{"meta":{"query_hash":"19ae3fcddb76","filters":{"topic":"Advanced Graph Theory Research"},"cohort_total":2515,"direct_labels_cover":3,"predictions_cover":2515,"exported":2515,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/19ae3fcddb76","api":"https://metacan.xera.ac/api/v1/cohort?topic=Advanced+Graph+Theory+Research"},"results":[{"id":"W100654495","doi":"","title":"List coloring Halin graphs","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018983832342762137,"score_gpt":0.28440059796351363,"score_spread":0.2654167656207515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100654495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656019,0.0005637456,0.008417203,0.0024809705,0.0023955372,0.00038010514,0.0000022271388,0.0007567447,0.019401543],"genre_scores_gemma":[0.98911417,0.000024621668,0.009968366,0.00020290482,0.000012929635,0.000029226601,0.0000011078872,0.000015636018,0.0006310368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838823,0.00010427031,0.00020625866,0.0004146377,0.0004008673,0.0004857209],"domain_scores_gemma":[0.99865603,0.0001905835,0.00005899515,0.0008051663,0.00011224609,0.00017700296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005107641,0.00014730652,0.00016088877,0.0001824053,0.00022191543,0.00014255763,0.0013782943,0.00006206305,0.00003351688],"category_scores_gemma":[0.000093974246,0.00015076516,0.00008054392,0.0008457607,0.00010175704,0.00077914726,0.00042043434,0.00026691495,0.0002616086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006301851,0.00007165256,0.001107171,0.000003926755,0.000009896198,0.000015160496,0.00016661896,0.00003003566,0.0008966056,0.9876436,0.0008148323,0.009234173],"study_design_scores_gemma":[0.0005656377,0.00008331996,0.0009871651,0.00001183874,0.00000200515,0.000010856165,0.000013803989,0.0026957362,0.007450546,0.97066396,0.017308742,0.0002063727],"about_ca_topic_score_codex":0.000011110319,"about_ca_topic_score_gemma":0.0000085838055,"teacher_disagreement_score":0.023512248,"about_ca_system_score_codex":0.00008013354,"about_ca_system_score_gemma":0.000048551163,"threshold_uncertainty_score":0.6148025},"labels":[],"label_agreement":null},{"id":"W1007141672","doi":"10.1007/978-3-319-06089-7_17","title":"Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Set (abstract data type); Tree (set theory); Computer science; Cover (algebra); Set packing; Regular polygon; Algorithm; Combinatorics; Mathematics; Geometry; Programming language","score_opus":0.03398452180586774,"score_gpt":0.29139792932001957,"score_spread":0.2574134075141518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1007141672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007353155,0.0015378551,0.9939016,0.0004004119,0.0015119544,0.00115126,0.00010042409,0.00018259407,0.00047857],"genre_scores_gemma":[0.7120033,0.00037378658,0.2812623,0.002730321,0.001422465,0.00013108827,0.00009312466,0.00021533707,0.001768314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99425393,0.00016932013,0.00071966666,0.0024460095,0.001170601,0.0012404529],"domain_scores_gemma":[0.9940295,0.0031529714,0.0004903292,0.0015508673,0.00037454293,0.0004017518],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025608758,0.000802847,0.001035121,0.00097377226,0.0006517826,0.0013778219,0.0026622238,0.000448728,0.0000040570167],"category_scores_gemma":[0.00030093302,0.0007307397,0.00013471444,0.0005918934,0.001474825,0.00077601994,0.0021737183,0.0009628611,0.000010932295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009339531,0.000019129477,0.00096168387,0.0011653077,0.00010006675,0.00016638343,0.0067659505,0.014955145,0.0005618332,0.096302405,0.0005788593,0.8783298],"study_design_scores_gemma":[0.0010370861,0.00051361864,0.000077281875,0.0008902252,0.000019713138,0.000331977,0.0000055853725,0.8684908,0.0003551292,0.11725849,0.009889319,0.0011307849],"about_ca_topic_score_codex":0.000024514451,"about_ca_topic_score_gemma":0.000066293025,"teacher_disagreement_score":0.87719905,"about_ca_system_score_codex":0.00020730642,"about_ca_system_score_gemma":0.00031267662,"threshold_uncertainty_score":0.9996588},"labels":[],"label_agreement":null},{"id":"W101650661","doi":"","title":"A note on the total domination vertex critical graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.020847416150095426,"score_gpt":0.2936126408208226,"score_spread":0.27276522467072717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101650661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96425277,0.00009692625,0.015038554,0.008168523,0.002964651,0.00042033257,0.000002697685,0.00029043583,0.008765092],"genre_scores_gemma":[0.99843645,0.000011799459,0.0010027788,0.00030169997,0.0000055638134,0.00003723013,7.701189e-7,0.000011545617,0.00019217662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982846,0.0002278097,0.00015777817,0.00035602372,0.00059143355,0.00038239305],"domain_scores_gemma":[0.9974469,0.0014824445,0.000031819065,0.0007710431,0.00015366398,0.00011416431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045273107,0.00013650101,0.0001284489,0.0001275037,0.00049079984,0.00006778914,0.00093459076,0.00006214865,0.000023975688],"category_scores_gemma":[0.0007965291,0.00010144058,0.000089502166,0.00069782353,0.0003182257,0.0003986812,0.00023411975,0.0003362521,0.0002458317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001681961,0.00010356002,0.000063600375,0.0000023485989,0.0000052114083,0.00004537791,0.00032578578,0.000007937201,0.0004965798,0.9960873,0.0012278293,0.0016176633],"study_design_scores_gemma":[0.000395476,0.00020016445,0.0038730882,0.000011742566,0.000001750853,0.0000514838,0.0000111982545,0.005155204,0.0032812178,0.9866476,0.00023467117,0.00013641796],"about_ca_topic_score_codex":0.0000044716585,"about_ca_topic_score_gemma":3.459603e-7,"teacher_disagreement_score":0.034183647,"about_ca_system_score_codex":0.000056182074,"about_ca_system_score_gemma":0.00006015643,"threshold_uncertainty_score":0.41366267},"labels":[],"label_agreement":null},{"id":"W102350756","doi":"","title":"Binomial Identities Generated by Counting Spanning Trees.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Binomial (polynomial); Combinatorics; Statistics","score_opus":0.015787305228591796,"score_gpt":0.27779793510411105,"score_spread":0.26201062987551926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102350756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9273403,0.0005067569,0.065578535,0.00009400106,0.0024272734,0.00014704918,0.0000031584357,0.00035500055,0.0035478869],"genre_scores_gemma":[0.9954594,0.00001349987,0.0036783789,0.00010769238,0.000025448082,0.0000062064983,0.000007413248,0.000022326323,0.0006796864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979876,0.00008059617,0.00030369512,0.00042929218,0.00052061747,0.00067818613],"domain_scores_gemma":[0.9987162,0.00031043074,0.000106119696,0.00052936014,0.00018472057,0.00015317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012723994,0.00017649848,0.00019090658,0.00022828742,0.0003273289,0.00029317176,0.0010920794,0.00008521285,0.00001954718],"category_scores_gemma":[0.00015982518,0.00018857606,0.00006327325,0.0009064162,0.00012655246,0.0008848404,0.00036224708,0.00028077952,0.00008865165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001668592,0.00005758411,0.002977883,0.0000057296643,0.0000197215,0.0000646016,0.00045684673,0.000029171506,0.018645598,0.96707934,0.0052175657,0.0054292954],"study_design_scores_gemma":[0.0016250986,0.00011496139,0.0034875562,0.00003072329,0.0000067705105,0.000026743855,0.00019084103,0.005422048,0.08132056,0.9024385,0.004755109,0.0005810615],"about_ca_topic_score_codex":0.000033441855,"about_ca_topic_score_gemma":0.000009270276,"teacher_disagreement_score":0.06811901,"about_ca_system_score_codex":0.00010925143,"about_ca_system_score_gemma":0.00005816409,"threshold_uncertainty_score":0.7689908},"labels":[],"label_agreement":null},{"id":"W102410762","doi":"","title":"Long Paths and Cycles Through Specified Vertices in k-Connected Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Graph","score_opus":0.024117532862543152,"score_gpt":0.2860400059407764,"score_spread":0.26192247307823324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102410762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930645,0.0007906433,0.001882775,0.0004447498,0.0005306607,0.00021485034,6.687508e-7,0.00015402025,0.0029171328],"genre_scores_gemma":[0.99781084,0.00043023596,0.0015583351,0.000108158056,0.000004577591,0.000019374373,0.0000013451834,0.000014118008,0.0000530284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983011,0.00017535113,0.00023459218,0.0004989144,0.00031116846,0.00047889497],"domain_scores_gemma":[0.9988178,0.0003548107,0.000058075853,0.00059294765,0.00006977058,0.00010660689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035099595,0.00016853494,0.00021838682,0.00019040285,0.00013071697,0.0001371023,0.00075916125,0.000074478696,0.000015145044],"category_scores_gemma":[0.00012643979,0.00016495955,0.000042336684,0.0011937196,0.0001505082,0.0010252796,0.000340842,0.00024753797,0.000027439442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035044504,0.00009423975,0.043982215,0.0000081855405,0.000010627141,0.0001853462,0.000572516,0.0000074203244,0.00040891353,0.94975334,0.000049519094,0.004892641],"study_design_scores_gemma":[0.0009753681,0.00008222952,0.09395741,0.000027967702,0.0000020212844,0.00002264608,0.00006133112,0.0007466039,0.0015023038,0.90196323,0.0004649309,0.000193975],"about_ca_topic_score_codex":0.000047976075,"about_ca_topic_score_gemma":0.00005246163,"teacher_disagreement_score":0.04997519,"about_ca_system_score_codex":0.00003759275,"about_ca_system_score_gemma":0.00002779187,"threshold_uncertainty_score":0.67268556},"labels":[],"label_agreement":null},{"id":"W103588595","doi":"","title":"Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02281584283864667,"score_gpt":0.2748316275715963,"score_spread":0.2520157847329496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103588595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917818,0.00030015167,0.0014794692,0.00031118045,0.00033290137,0.0002682659,0.0000017682561,0.00007644641,0.00544803],"genre_scores_gemma":[0.9948719,0.00015430248,0.0046191695,0.000106008214,0.0000030804754,0.000023357741,0.0000018597357,0.000021670141,0.00019863198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793035,0.00016893834,0.0003323209,0.00051430747,0.00053359533,0.00052046106],"domain_scores_gemma":[0.998134,0.0005996794,0.00012982133,0.00091619603,0.00012128745,0.00009899195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033294887,0.00020779856,0.0003185992,0.00022454637,0.00009597782,0.000048657064,0.0011277287,0.00007385091,0.000029123037],"category_scores_gemma":[0.00009740205,0.00017795096,0.00006175579,0.0015935154,0.0002852602,0.00086371857,0.0003812907,0.00021374803,0.000030897005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030287387,0.0003065082,0.12004179,0.000022658996,0.000042741474,0.00013848131,0.0011412238,0.00008334519,0.0015479146,0.8746493,0.00039722046,0.0013259809],"study_design_scores_gemma":[0.002134895,0.0004541145,0.036152836,0.00007590601,0.00000660297,0.000020355259,0.00013321642,0.0007348417,0.016053027,0.94272274,0.0011830112,0.00032847733],"about_ca_topic_score_codex":0.00006571662,"about_ca_topic_score_gemma":0.000100171615,"teacher_disagreement_score":0.08388895,"about_ca_system_score_codex":0.00007557562,"about_ca_system_score_gemma":0.00005137569,"threshold_uncertainty_score":0.72566295},"labels":[],"label_agreement":null},{"id":"W104414370","doi":"","title":"Stability Number and Fractional F-factors in Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stability (learning theory); Combinatorics; Computer science; Machine learning","score_opus":0.016190147693617225,"score_gpt":0.2772819295661864,"score_spread":0.2610917818725692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104414370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99542797,0.000044274653,0.0010065151,0.00014209794,0.0004044757,0.000120426135,0.0000017446002,0.0000735835,0.0027789304],"genre_scores_gemma":[0.99884397,0.0000049043606,0.0010563068,0.000019635097,0.0000025632846,0.000011699585,0.0000024694941,0.0000068707363,0.000051582236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875015,0.00012334443,0.00017583385,0.0003615305,0.00029944643,0.00028972237],"domain_scores_gemma":[0.9991181,0.0003305681,0.00004069815,0.00037500833,0.00006381475,0.00007180323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038611775,0.000112490074,0.00013151058,0.00009934996,0.00009513475,0.00006676702,0.00035383427,0.000057139543,0.00004978859],"category_scores_gemma":[0.00006035092,0.000109084795,0.000035232086,0.00060453604,0.00012609677,0.0006053392,0.00018123098,0.00023124028,0.000018957671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003931611,0.000073267096,0.35656223,0.0000028603458,0.0000017136542,0.000004562891,0.000043446795,0.0000036136455,0.00019281596,0.64290154,0.00007377871,0.00013626265],"study_design_scores_gemma":[0.00028963274,0.000014866495,0.2839757,0.0000028902268,4.658184e-7,0.000002850845,0.000012992073,0.00024776315,0.0013906409,0.7137554,0.00022089863,0.000085876105],"about_ca_topic_score_codex":0.0001720387,"about_ca_topic_score_gemma":0.00003623064,"teacher_disagreement_score":0.07258654,"about_ca_system_score_codex":0.000060067847,"about_ca_system_score_gemma":0.000036404464,"threshold_uncertainty_score":0.4448349},"labels":[],"label_agreement":null},{"id":"W105843398","doi":"","title":"A Note of k-Rotation Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rotation (mathematics); Combinatorics; Pure mathematics; Geometry","score_opus":0.01264707814507132,"score_gpt":0.2822236817423465,"score_spread":0.2695766035972752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105843398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98165977,0.000111779635,0.0068523814,0.000259978,0.0004425141,0.00021899531,0.0000016202896,0.00014297228,0.01030999],"genre_scores_gemma":[0.9935298,0.00002732226,0.0060984083,0.000045910074,0.0000014915942,0.0000125787765,0.0000011238025,0.000007300068,0.00027607032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989709,0.00008945733,0.00017382656,0.00022930886,0.00031489984,0.00022155409],"domain_scores_gemma":[0.9991193,0.00012392149,0.000048749956,0.0005419754,0.000096065996,0.00007003485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027463978,0.00008280668,0.00012279821,0.00012180741,0.00006727928,0.000026643556,0.0007108888,0.000039793442,0.00008379781],"category_scores_gemma":[0.000039054954,0.00008251153,0.00005928933,0.00079917273,0.00008346075,0.00040126476,0.00006968921,0.00011272711,0.00010476937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012206916,0.00005615539,0.00040894293,0.0000059257227,0.000005381618,0.000004613602,0.00027622658,0.00003332833,0.001074581,0.94459826,0.00010372794,0.05342068],"study_design_scores_gemma":[0.00042649967,0.000105804575,0.0024772305,0.000010480013,0.000001533288,0.000003252162,0.0000048965053,0.0019442685,0.007676759,0.9865501,0.0007103972,0.00008880004],"about_ca_topic_score_codex":0.000010966251,"about_ca_topic_score_gemma":0.000001064966,"teacher_disagreement_score":0.05333188,"about_ca_system_score_codex":0.000018515744,"about_ca_system_score_gemma":0.000036211673,"threshold_uncertainty_score":0.33647224},"labels":[],"label_agreement":null},{"id":"W1061820890","doi":"10.1007/s10878-015-9936-0","title":"Lower bounds for positive semidefinite zero forcing and their applications","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex cover; Positive-definite matrix; Theory of computation; Vertex (graph theory); Zero (linguistics); Discrete mathematics; Graph; Forcing (mathematics); Semidefinite programming; Upper and lower bounds; Algorithm; Mathematical optimization","score_opus":0.019747254604522393,"score_gpt":0.28322497922973683,"score_spread":0.26347772462521446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1061820890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052006723,0.00021941509,0.9972149,0.00042559797,0.0009866639,0.000277026,0.0000032361886,0.000018338784,0.0003347224],"genre_scores_gemma":[0.62132806,0.000051723626,0.37807208,0.00009549541,0.00034962903,0.00003072392,0.000005165243,0.000020561978,0.000046536745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991074,0.00007555647,0.0002948085,0.00013344709,0.00022973935,0.00015905249],"domain_scores_gemma":[0.9979289,0.0003073178,0.00029915944,0.00017329447,0.0011313846,0.00015992881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086930976,0.00009574161,0.00017822049,0.00018199586,0.00013476364,0.00017089493,0.00034627176,0.000057940957,6.981671e-7],"category_scores_gemma":[0.0002435857,0.0000797134,0.00006299618,0.00035722734,0.00006357171,0.0009516778,0.0000899092,0.00013173782,5.790991e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002993879,0.00014301518,0.00005911406,0.000012335404,0.00005122606,0.0000027855904,0.00088845514,0.111242145,0.0002794772,0.8806314,0.00051089027,0.005879752],"study_design_scores_gemma":[0.0022871234,0.0008064778,0.000009858778,0.000032168857,0.000011602039,0.000049812876,0.000068198315,0.14844295,0.0011466536,0.8445807,0.0024290646,0.00013538114],"about_ca_topic_score_codex":6.7505914e-7,"about_ca_topic_score_gemma":5.5844342e-8,"teacher_disagreement_score":0.620808,"about_ca_system_score_codex":0.00008393243,"about_ca_system_score_gemma":0.00015784036,"threshold_uncertainty_score":0.3250618},"labels":[],"label_agreement":null},{"id":"W106656638","doi":"","title":"3-flow Conjecture and Matchings in Bipartite Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Conjecture; Combinatorics; Strong perfect graph theorem; Flow (mathematics); Chordal graph; 1-planar graph; Graph; Geometry","score_opus":0.00948066044355914,"score_gpt":0.2595878085495363,"score_spread":0.2501071481059771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106656638","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942659,0.0005915707,0.0014460953,0.0020231067,0.00033883355,0.00018268214,0.0000015176456,0.00013290462,0.0010173753],"genre_scores_gemma":[0.9905621,0.000053344396,0.008997899,0.00028379634,0.0000045477095,0.000016529297,9.832338e-7,0.0000111668605,0.000069639245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987358,0.0000966522,0.00017348425,0.0003731152,0.00024207043,0.00037891013],"domain_scores_gemma":[0.99920785,0.00014625801,0.000041252904,0.0004440385,0.000035908077,0.00012466783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004167863,0.00013582602,0.00016454265,0.0002184825,0.00008979277,0.000102509235,0.0005848912,0.00006685038,0.0000147505025],"category_scores_gemma":[0.000048297425,0.00012982036,0.000034339533,0.00067302026,0.00009912612,0.0006310512,0.0002784864,0.0002902156,0.000041832707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071589893,0.00004543487,0.004922534,0.000006604705,0.0000051113075,0.00001911929,0.00069908175,0.00004307436,0.0004930201,0.9799404,0.00023456785,0.013583871],"study_design_scores_gemma":[0.00076026877,0.000058949878,0.00379847,0.000017662573,0.0000011088522,0.000017787992,0.00001449996,0.009841551,0.0023449792,0.98043627,0.0025439395,0.0001645418],"about_ca_topic_score_codex":0.000013342734,"about_ca_topic_score_gemma":0.000023816214,"teacher_disagreement_score":0.013419329,"about_ca_system_score_codex":0.000036241876,"about_ca_system_score_gemma":0.000027952043,"threshold_uncertainty_score":0.52939206},"labels":[],"label_agreement":null},{"id":"W108252396","doi":"","title":"A Sufficient Condition for Oriented Graphs to be Hamiltonian.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Mathematical optimization","score_opus":0.016509603998387756,"score_gpt":0.292884276763912,"score_spread":0.27637467276552424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108252396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9630356,0.00004961119,0.030656965,0.001637661,0.0011059702,0.0010235171,0.000025952251,0.000313778,0.0021509698],"genre_scores_gemma":[0.9891612,0.000008093928,0.0086358,0.0007702963,0.0000054016673,0.00024916415,0.000016753529,0.000020999674,0.0011322772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981605,0.000086252876,0.0002281082,0.00054729584,0.00041767358,0.00056019],"domain_scores_gemma":[0.99851793,0.00021152035,0.000041231036,0.0007635998,0.00021203244,0.00025370825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043828247,0.00016603031,0.00018119876,0.00022928276,0.00028408994,0.00009872483,0.0008780496,0.00006159368,0.00009427169],"category_scores_gemma":[0.00009908862,0.00016927153,0.00010313784,0.0012291374,0.00007884967,0.00035187684,0.00012703051,0.00013461542,0.00016132333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049783066,0.00017082162,0.00007844537,0.0000070189185,0.0000122676665,0.000007413737,0.0005584126,0.00013083463,0.0007538462,0.989889,0.003221532,0.0051205866],"study_design_scores_gemma":[0.0013301251,0.00070255785,0.000990008,0.000018885454,0.000004978219,0.000008098845,0.000045327815,0.004060689,0.004694948,0.92405206,0.06379308,0.000299269],"about_ca_topic_score_codex":0.000007823569,"about_ca_topic_score_gemma":0.0000041077096,"teacher_disagreement_score":0.065837,"about_ca_system_score_codex":0.000080278165,"about_ca_system_score_gemma":0.000059987557,"threshold_uncertainty_score":0.6902693},"labels":[],"label_agreement":null},{"id":"W109839048","doi":"","title":"P/d-Graphs of Tournaments.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016228202504722577,"score_gpt":0.2944694120789967,"score_spread":0.2782412095742741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109839048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93866605,0.0002494254,0.044671968,0.00014115484,0.0014257267,0.00018582714,9.183745e-7,0.00012936577,0.014529545],"genre_scores_gemma":[0.99188423,0.000012772505,0.007882092,0.00005189931,0.0000021420774,0.0000026954715,4.427016e-7,0.000008112726,0.00015561222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986807,0.000049344402,0.00024653514,0.00023127197,0.00042495914,0.00036719957],"domain_scores_gemma":[0.99878716,0.00020810199,0.00009553801,0.0006376945,0.00014287372,0.00012862995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880604,0.00009519026,0.00014631232,0.0002323206,0.000071331895,0.000025081785,0.0010678861,0.000046407094,0.000014684209],"category_scores_gemma":[0.00007944076,0.00009204316,0.00007332002,0.00088037347,0.00009878769,0.0003298577,0.00026652013,0.00015713803,0.000029704694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010942097,0.00008159444,0.0037477424,0.0000054988946,0.000013138312,0.000019122966,0.0001391764,0.000002181373,0.00300219,0.9797338,0.00018887916,0.013055692],"study_design_scores_gemma":[0.00044935296,0.000119249285,0.0074716313,0.000011082863,0.0000015263778,0.0000061699393,0.000025262543,0.00009831099,0.030434309,0.96049416,0.0007903444,0.00009862273],"about_ca_topic_score_codex":0.000006971471,"about_ca_topic_score_gemma":0.0000016834076,"teacher_disagreement_score":0.05321816,"about_ca_system_score_codex":0.000033564866,"about_ca_system_score_gemma":0.000033127624,"threshold_uncertainty_score":0.37534115},"labels":[],"label_agreement":null},{"id":"W110549108","doi":"","title":"A note on choosability with separation for planar graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar graph; Planar; Combinatorics; Separation (statistics); Graph; Computer science; Statistics; Computer graphics (images)","score_opus":0.01996082089592175,"score_gpt":0.314720412405843,"score_spread":0.2947595915099212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110549108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85065335,0.000030579693,0.14186549,0.001454623,0.000776166,0.001129887,0.0000066242715,0.0003291163,0.0037541476],"genre_scores_gemma":[0.9918118,0.000006455844,0.0077274214,0.0001676621,0.000005838272,0.00011923963,0.000005875569,0.000012890532,0.0001428097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860996,0.00008248842,0.00014673531,0.00046284747,0.00034025428,0.00035773352],"domain_scores_gemma":[0.9985635,0.00035624928,0.000059666974,0.00076056283,0.0001445215,0.00011544657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038323092,0.00014169788,0.00015114884,0.00012105952,0.00020109357,0.00007693179,0.00064134167,0.000055520508,0.0000044113626],"category_scores_gemma":[0.00009302879,0.000118592674,0.000057803438,0.00064570486,0.000082565515,0.00041668292,0.000046968613,0.00015621609,0.000032860527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020837689,0.00013421227,0.0023670306,0.0000072912044,0.000010149237,0.000008612047,0.00013660763,0.00006286035,0.00022281862,0.99302757,0.00035209433,0.0034623991],"study_design_scores_gemma":[0.0011447858,0.00081194023,0.0033853624,0.000013164739,0.0000029014716,0.00000897886,0.000007139832,0.0029776692,0.0021586525,0.9864352,0.002887075,0.00016712563],"about_ca_topic_score_codex":0.000006894242,"about_ca_topic_score_gemma":0.000011303629,"teacher_disagreement_score":0.14115845,"about_ca_system_score_codex":0.000069628986,"about_ca_system_score_gemma":0.00005740722,"threshold_uncertainty_score":0.48360687},"labels":[],"label_agreement":null},{"id":"W111065268","doi":"","title":"Mutually Eccentric Vertices in Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Eccentric; Structural engineering","score_opus":0.014587191091620417,"score_gpt":0.27014149887450295,"score_spread":0.2555543077828825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111065268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97933227,0.00082207774,0.0030326145,0.0002215266,0.0016953513,0.00031196658,5.749418e-7,0.00018907101,0.014394522],"genre_scores_gemma":[0.99692845,0.00004907037,0.002756912,0.00010504497,0.0000011678108,0.000020934178,4.6914303e-7,0.000011338391,0.00012663216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981762,0.0002798738,0.00022011928,0.0004132739,0.00038177523,0.0005287272],"domain_scores_gemma":[0.9988182,0.00024862055,0.00004980447,0.000669121,0.00007703009,0.00013719997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065418845,0.00013839049,0.00016439942,0.00035690196,0.00009404576,0.00009525516,0.0010357423,0.00005996707,0.000026362752],"category_scores_gemma":[0.00030343194,0.00013827093,0.000055665838,0.00196708,0.000072114846,0.00062818674,0.00015799388,0.0002451239,0.000114761984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052289306,0.000115503084,0.011007008,0.0000055338855,0.00000595816,0.00005134755,0.00020274016,0.000025585843,0.00015859074,0.98660296,0.00012260329,0.0016969632],"study_design_scores_gemma":[0.0008294184,0.00007661172,0.0045781303,0.000010772811,0.0000013103684,0.0000077961095,0.000028896653,0.00061356486,0.0025008344,0.98944426,0.0017382551,0.00017015747],"about_ca_topic_score_codex":0.000009438705,"about_ca_topic_score_gemma":0.000006798818,"teacher_disagreement_score":0.017596135,"about_ca_system_score_codex":0.000067133944,"about_ca_system_score_gemma":0.00008631988,"threshold_uncertainty_score":0.5638525},"labels":[],"label_agreement":null},{"id":"W113325530","doi":"10.1007/3-540-45995-2_22","title":"On the Power of BFS to Determine a Graphs Diameter","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lexicographical order; Upper and lower bounds; Combinatorics; Computer science; Graph; Constant (computer programming); Expressive power; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science; Programming language","score_opus":0.027953404545050294,"score_gpt":0.271347188716214,"score_spread":0.2433937841711637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113325530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000838754,0.00013030952,0.99090934,0.0014085702,0.0007104697,0.0006616303,0.000007504882,0.000074380856,0.005259017],"genre_scores_gemma":[0.6827587,0.000034358094,0.30949786,0.0063065845,0.00013040865,0.000044389435,9.839664e-7,0.000077951794,0.0011487595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555445,0.00008669129,0.00051615096,0.0014649461,0.0015735422,0.00080421695],"domain_scores_gemma":[0.9940338,0.0024046036,0.00023232508,0.0028051245,0.0002972346,0.00022687243],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001221346,0.0005202387,0.0005395846,0.0014895552,0.00021270601,0.00024863932,0.006196407,0.00020011129,0.0001222267],"category_scores_gemma":[0.00041937988,0.00035538088,0.0002218467,0.0014891374,0.0011663277,0.0003202505,0.0018900735,0.00092850317,0.00011270617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027078759,0.00007697844,0.000029543779,0.000026456111,0.000023318546,0.00011916559,0.0017483713,0.009972264,0.00059331936,0.509626,0.00013362041,0.47762394],"study_design_scores_gemma":[0.0001993572,0.00085898506,0.0000864677,0.0004282787,0.00000405832,0.000039488787,1.8255521e-7,0.048545986,0.0049667885,0.94331425,0.000940351,0.0006157869],"about_ca_topic_score_codex":0.0000045024412,"about_ca_topic_score_gemma":0.000012795613,"teacher_disagreement_score":0.68191993,"about_ca_system_score_codex":0.00013526564,"about_ca_system_score_gemma":0.00013884957,"threshold_uncertainty_score":0.9998898},"labels":[],"label_agreement":null},{"id":"W113843839","doi":"","title":"A Note on Dominating Cycles in Tough Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016523351454351676,"score_gpt":0.2947455400191361,"score_spread":0.2782221885647844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113843839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9731139,0.00012566155,0.0032279429,0.00032953566,0.0012087744,0.00031535694,8.044122e-7,0.00016262669,0.021515384],"genre_scores_gemma":[0.9917963,0.000012076648,0.007903175,0.0001417567,0.0000018948792,0.0000324304,4.1886292e-7,0.000014715093,0.000097216005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813485,0.0002969459,0.00022642726,0.00045493076,0.00039343623,0.00049339555],"domain_scores_gemma":[0.9985597,0.0005244405,0.00006374901,0.00068705337,0.000061529376,0.00010350692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082834996,0.00015923708,0.0001859768,0.00031730722,0.00012913777,0.00008344169,0.00082541973,0.00006845608,0.000010062623],"category_scores_gemma":[0.0004952977,0.00015842948,0.00006493268,0.0012246618,0.00007512029,0.0004011958,0.00014319202,0.0003436347,0.0000752093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000880415,0.00011076804,0.0017992946,0.000005250059,0.000003318757,0.000049828843,0.00035015328,0.000052242838,0.000560628,0.99000955,0.00006082763,0.006989337],"study_design_scores_gemma":[0.0009157586,0.000117542775,0.002762603,0.000034884433,7.613432e-7,0.0000063308094,0.000027750726,0.0008253658,0.008555554,0.98602664,0.0005445666,0.0001822089],"about_ca_topic_score_codex":0.000010361477,"about_ca_topic_score_gemma":0.0000071351233,"teacher_disagreement_score":0.021418167,"about_ca_system_score_codex":0.00008692193,"about_ca_system_score_gemma":0.00005416895,"threshold_uncertainty_score":0.64605665},"labels":[],"label_agreement":null},{"id":"W115503190","doi":"","title":"Contractible Edges and Bowties in a k-Connected Graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Combinatorics; Graph","score_opus":0.021879418466877288,"score_gpt":0.2572238948136041,"score_spread":0.23534447634672678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115503190","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890362,0.0024347191,0.001056966,0.001287445,0.0007195276,0.00029421662,0.000001291811,0.00021962536,0.004950002],"genre_scores_gemma":[0.99853045,0.00020804304,0.0009262135,0.000092425274,0.0000030418885,0.000026187725,3.692029e-7,0.00000966721,0.0002036217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998755,0.00013042879,0.0001677607,0.00035043052,0.00021788068,0.00037852165],"domain_scores_gemma":[0.9989601,0.00038700423,0.000045479028,0.00043499688,0.00006695831,0.000105512576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029527192,0.00012775406,0.00018537683,0.00028663952,0.00010736146,0.00011646128,0.0005150912,0.000060467082,0.000025301275],"category_scores_gemma":[0.00017249846,0.00012696267,0.000031555996,0.00082479895,0.00013095286,0.00068117335,0.00019558205,0.00023909599,0.000035529036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073601427,0.00009289096,0.0052172965,0.000008241037,0.000009407759,0.00004182195,0.0005695692,0.0000035396556,0.00058427616,0.9862257,0.0005611105,0.006678783],"study_design_scores_gemma":[0.0011070564,0.00011334012,0.006951378,0.00001986358,0.0000015732712,0.000017574304,0.00006233551,0.0027990271,0.002223179,0.9854887,0.0010357965,0.00018017831],"about_ca_topic_score_codex":0.000022941518,"about_ca_topic_score_gemma":0.00001233408,"teacher_disagreement_score":0.009494224,"about_ca_system_score_codex":0.000026398275,"about_ca_system_score_gemma":0.000011657076,"threshold_uncertainty_score":0.5177387},"labels":[],"label_agreement":null},{"id":"W115874132","doi":"","title":"Vertex-Disjoint Short Cycles Containing Specified Edges in a Graph.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Disjoint sets; Graph","score_opus":0.02408683008824998,"score_gpt":0.2769357215780593,"score_spread":0.2528488914898093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115874132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97838974,0.00047138962,0.0068993745,0.00034009235,0.0012398508,0.00034400765,0.0000018160829,0.00027835183,0.012035405],"genre_scores_gemma":[0.9976205,0.000020192392,0.002124393,0.000052628555,0.000010833641,0.00004100763,0.000003884569,0.000020317424,0.000106205756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783635,0.00016385883,0.0003589615,0.0005617309,0.00044892196,0.00063014956],"domain_scores_gemma":[0.99868685,0.000300651,0.00005257417,0.00075756974,0.00009169859,0.000110685505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062048924,0.00021014035,0.00029101945,0.00039163756,0.00013922463,0.00014293598,0.001116989,0.00008428535,0.000011422884],"category_scores_gemma":[0.00007335819,0.00021449587,0.0000957769,0.0010606908,0.00014246593,0.00055836677,0.00037262452,0.0003358995,0.000049644266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030817493,0.00013504463,0.017300682,0.0000061430783,0.000007843245,0.00010685914,0.00015718397,0.00006499851,0.0009635853,0.97513777,0.0003538942,0.0057352055],"study_design_scores_gemma":[0.00071028207,0.00011458538,0.05598005,0.00003474634,0.0000017537244,0.000010210018,0.000067734996,0.001098387,0.0049635535,0.9363628,0.00040531307,0.00025057816],"about_ca_topic_score_codex":0.00010677453,"about_ca_topic_score_gemma":0.0000819926,"teacher_disagreement_score":0.038774934,"about_ca_system_score_codex":0.000111780406,"about_ca_system_score_gemma":0.00006286071,"threshold_uncertainty_score":0.87468874},"labels":[],"label_agreement":null},{"id":"W116667574","doi":"","title":"Clique Graphs of Planar Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique-sum; Clique; Combinatorics; Chordal graph; Pathwidth; Indifference graph; Planar graph; 1-planar graph; Discrete mathematics; Graph; Line graph","score_opus":0.014745689355016434,"score_gpt":0.27422351416090585,"score_spread":0.25947782480588943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116667574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585425,0.00047808507,0.031895835,0.00096677034,0.0018306505,0.00048546976,0.000008838379,0.00038454108,0.0054073064],"genre_scores_gemma":[0.98948145,0.000046045065,0.010296341,0.00010117839,0.000001908162,0.000017906754,0.0000026230214,0.000014957606,0.000037619044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835384,0.00010000586,0.00028331546,0.00039132728,0.0004558702,0.00041564464],"domain_scores_gemma":[0.998501,0.00014255675,0.00011222398,0.00093159365,0.00015626768,0.00015636726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004537193,0.0001610331,0.00023881202,0.00031797795,0.000112279726,0.000036997943,0.001447049,0.00008582996,0.000006315971],"category_scores_gemma":[0.00007868901,0.0001573363,0.00013076162,0.0012673347,0.00020635298,0.00045162626,0.0001968928,0.00025618382,0.00003959984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136614635,0.00012908684,0.0012798025,0.000013876481,0.000021358963,0.000028836725,0.00023378448,0.000038793496,0.0012908303,0.9960259,0.00012290027,0.00080116215],"study_design_scores_gemma":[0.00094181986,0.00023070085,0.0020057007,0.000026580541,0.0000027680967,0.000012168034,0.000017712382,0.000033943816,0.01669794,0.9796345,0.00023360226,0.0001625428],"about_ca_topic_score_codex":0.000041719068,"about_ca_topic_score_gemma":0.000005850633,"teacher_disagreement_score":0.03093892,"about_ca_system_score_codex":0.000043332057,"about_ca_system_score_gemma":0.00011086744,"threshold_uncertainty_score":0.6415988},"labels":[],"label_agreement":null},{"id":"W116901816","doi":"","title":"Independent Sums of Arithmetic Progressions in Km-free Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Discrete mathematics; Combinatorics","score_opus":0.015359571693553505,"score_gpt":0.2857425302751914,"score_spread":0.2703829585816379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116901816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9935929,0.00039684097,0.0029893748,0.0006445882,0.0007881654,0.00046002943,0.000003834447,0.00011836957,0.0010058678],"genre_scores_gemma":[0.9915588,0.000024494135,0.008295037,0.00002758715,0.000001715112,0.000049570837,0.0000014098578,0.000013252015,0.00002814709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980402,0.00012226086,0.00033274048,0.0004104195,0.00064067723,0.00045371056],"domain_scores_gemma":[0.9982542,0.00013424185,0.00010641163,0.0012338092,0.00012833888,0.0001430028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059938995,0.000152173,0.00024151638,0.0004557679,0.000079170335,0.000043383505,0.0020221153,0.00008959731,0.000006564585],"category_scores_gemma":[0.00022385699,0.00014315436,0.00008239513,0.001623654,0.00018778397,0.00041722515,0.00079189945,0.00036220948,0.000017385437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010716594,0.00027848734,0.011242863,0.0000151124605,0.000009648713,0.000056881687,0.00035919,0.000084917316,0.00073469186,0.9851832,0.000026614267,0.001997693],"study_design_scores_gemma":[0.0018868909,0.00017842941,0.017053429,0.00007927519,0.0000020371285,0.000010174426,0.00003555015,0.00012630838,0.009182885,0.97125536,0.000043162294,0.00014650759],"about_ca_topic_score_codex":0.000053720014,"about_ca_topic_score_gemma":0.00004516853,"teacher_disagreement_score":0.013927835,"about_ca_system_score_codex":0.00009276231,"about_ca_system_score_gemma":0.00015665455,"threshold_uncertainty_score":0.5837666},"labels":[],"label_agreement":null},{"id":"W117787552","doi":"","title":"Some results in step domination of graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01554785319413933,"score_gpt":0.27828929668305524,"score_spread":0.2627414434889159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117787552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98668736,0.0005078297,0.0032099579,0.0002983351,0.0015762565,0.00043495247,0.0000039680112,0.000093212184,0.007188135],"genre_scores_gemma":[0.9949846,0.000036366622,0.004822504,0.000022091963,0.0000013033255,0.0000137895895,0.0000012277725,0.000007283104,0.00011083209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998475,0.000270514,0.00031295055,0.00030925797,0.0003532445,0.00027899706],"domain_scores_gemma":[0.9988122,0.00028571975,0.000107139625,0.00061440474,0.000116482726,0.00006403642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452972,0.00009812121,0.00016637587,0.00035109848,0.00004359718,0.000024462877,0.000636429,0.00005777064,0.0000023728203],"category_scores_gemma":[0.0004478551,0.000100072706,0.000047614183,0.001146061,0.00008255874,0.00059680094,0.00010223728,0.00016401877,0.000014413402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022008326,0.000109909335,0.00079848286,0.000007740576,0.0000041766675,0.000009399117,0.0002018721,0.00001997808,0.00080365397,0.9958492,0.000108185384,0.0020653836],"study_design_scores_gemma":[0.0016746934,0.00010724051,0.0032699993,0.000018202398,8.492533e-7,0.0000023003581,0.000024346833,0.0005773203,0.014440034,0.9794222,0.00036077373,0.00010201889],"about_ca_topic_score_codex":0.000011503762,"about_ca_topic_score_gemma":0.0000043526297,"teacher_disagreement_score":0.016426988,"about_ca_system_score_codex":0.00004807136,"about_ca_system_score_gemma":0.00005803641,"threshold_uncertainty_score":0.40808466},"labels":[],"label_agreement":null},{"id":"W118134238","doi":"","title":"The Forcing Domination Numbers Of Some Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Forcing (mathematics); Mathematical analysis","score_opus":0.011385634558625768,"score_gpt":0.28273845909241435,"score_spread":0.27135282453378856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118134238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.947574,0.00048755482,0.042564746,0.0005275701,0.0025404505,0.00037179416,7.1481435e-7,0.0001396275,0.0057935505],"genre_scores_gemma":[0.9978458,0.000031367777,0.001923307,0.000034112152,0.0000041458716,0.0000065585023,4.8058024e-7,0.000008413367,0.0001457632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866086,0.000076363904,0.00024697097,0.00020839572,0.0004361771,0.0003712501],"domain_scores_gemma":[0.9982399,0.0008080597,0.00012147652,0.0005918203,0.0001630263,0.0000757677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955068,0.00009041723,0.00011038362,0.00013399567,0.0002698382,0.000053129803,0.0010316389,0.000044652657,0.000001607492],"category_scores_gemma":[0.00018215022,0.00007041155,0.00007307429,0.00073813164,0.00016866125,0.0005529666,0.00021588105,0.00015926361,0.000011752615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015336534,0.000024956915,0.00081726495,0.0000048280895,0.000010100891,0.000003964292,0.00023116855,0.000005676176,0.0013768225,0.9817959,0.00011223599,0.01560171],"study_design_scores_gemma":[0.00039178747,0.00005905651,0.002669261,0.000009400877,0.0000017071778,0.0000031148982,0.00007189025,0.0004848579,0.022727208,0.97299963,0.0005024897,0.000079592224],"about_ca_topic_score_codex":0.000012317515,"about_ca_topic_score_gemma":0.000007225188,"teacher_disagreement_score":0.050271858,"about_ca_system_score_codex":0.000047194106,"about_ca_system_score_gemma":0.0000337305,"threshold_uncertainty_score":0.28712997},"labels":[],"label_agreement":null},{"id":"W119774723","doi":"10.1007/978-3-642-45043-3_8","title":"On the Parameterized Complexity of Computing Graph Bisections","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Disjoint sets; Vertex (graph theory); Combinatorics; Time complexity; Partition (number theory); Mathematics; Constant (computer programming); Graph partition; Feedback vertex set; Bisection method; Connected component; Graph; Vertex cover; Discrete mathematics; Computer science; Algorithm","score_opus":0.05961691458284554,"score_gpt":0.29979033801681515,"score_spread":0.2401734234339696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119774723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021200452,0.0000858315,0.9916602,0.00097429287,0.0008387094,0.0007844177,0.000008266194,0.00014149165,0.0033867648],"genre_scores_gemma":[0.66419756,0.00002143,0.334373,0.0010320348,0.00013714436,0.00001760509,0.0000028640422,0.00004060793,0.00017772742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562,0.0001736953,0.00066275924,0.0013795524,0.001370329,0.00079366035],"domain_scores_gemma":[0.9936031,0.0030009921,0.0003942564,0.0023975135,0.0004338083,0.00017034897],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015608398,0.0005325076,0.0006504902,0.0011817235,0.0005721167,0.0003843001,0.0054576183,0.00022258225,0.00008451597],"category_scores_gemma":[0.0003400679,0.00037845067,0.00025999037,0.0014791138,0.0041127536,0.00039472352,0.0018995609,0.0013704574,0.00007525511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010557821,0.00004876114,0.000010257336,0.000028245784,0.00002308427,0.000013445117,0.00048580216,0.029120944,0.00055432005,0.8509095,0.00002528449,0.118769854],"study_design_scores_gemma":[0.00016138863,0.00020416731,0.00011886471,0.00022173004,0.0000032398386,0.000021336198,2.6870612e-7,0.2618321,0.0017616879,0.73530227,0.00005624066,0.0003167348],"about_ca_topic_score_codex":0.000040863084,"about_ca_topic_score_gemma":0.000030961928,"teacher_disagreement_score":0.66207755,"about_ca_system_score_codex":0.00016254967,"about_ca_system_score_gemma":0.00028586647,"threshold_uncertainty_score":0.99992335},"labels":[],"label_agreement":null},{"id":"W11995151","doi":"","title":"Improved bounds for the product of the domination and chromatic numbers of a graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Graph; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.009365343003639942,"score_gpt":0.2594016022767104,"score_spread":0.25003625927307044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11995151","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950773,0.00035980545,0.002114169,0.0007598778,0.00040084313,0.0009348595,0.000003049044,0.000021490523,0.00032858588],"genre_scores_gemma":[0.9984049,0.000027746804,0.0012930119,0.000019507252,0.0000029961182,0.000056681052,3.0849293e-7,0.0000065413747,0.00018827358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915683,0.00008827211,0.00018865004,0.0001895116,0.00021469891,0.00016202976],"domain_scores_gemma":[0.9986832,0.0004015364,0.00010964841,0.00065862003,0.00012198329,0.000025027099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006304652,0.00007837746,0.00012848659,0.000042932315,0.0001573662,0.00002937259,0.0007671121,0.00002322274,0.0000054197435],"category_scores_gemma":[0.00014101258,0.000046825433,0.00006736657,0.00054108654,0.00029731353,0.00020693488,0.000105294006,0.00007858735,5.020422e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044985085,0.00009211476,0.00051037397,0.00008575071,0.000043322325,1.5231105e-7,0.0011926289,0.00001848366,0.009514274,0.950073,0.00015247778,0.038272414],"study_design_scores_gemma":[0.0008759047,0.00014356746,0.005553015,0.000026845933,0.00001282348,0.0000041569865,0.000041991825,0.008347211,0.027392846,0.957285,0.00024057366,0.000076105476],"about_ca_topic_score_codex":0.000021609867,"about_ca_topic_score_gemma":0.000004713486,"teacher_disagreement_score":0.03819631,"about_ca_system_score_codex":0.000014493087,"about_ca_system_score_gemma":0.00004791346,"threshold_uncertainty_score":0.19094858},"labels":[],"label_agreement":null},{"id":"W123065172","doi":"","title":"Restrained Domination Excellent Trees.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.024247903241052103,"score_gpt":0.2745094889075757,"score_spread":0.2502615856665236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123065172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9482639,0.00024951776,0.0315842,0.0014522672,0.0018966453,0.00042881325,0.0000015639903,0.00048661724,0.015636466],"genre_scores_gemma":[0.99396974,0.000054968044,0.0045766584,0.00006475491,0.00000786494,0.000027321707,0.0000023972136,0.000012223138,0.0012840835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984779,0.00012920107,0.00019349603,0.0003741194,0.00047034284,0.00035496982],"domain_scores_gemma":[0.99876183,0.00017653687,0.000063573876,0.0007298528,0.0001313598,0.00013684871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035397703,0.00012975998,0.00014424304,0.00016891751,0.00026452605,0.00003960383,0.00094798487,0.000058765407,0.000023320647],"category_scores_gemma":[0.00012388977,0.00012816947,0.00006713902,0.0006395039,0.00013723267,0.00050498097,0.00023467971,0.00018321653,0.00015634614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012027281,0.0000988885,0.00043416757,0.0000030208973,0.0000073165193,0.00008517367,0.00045209812,0.000017975546,0.0013705542,0.9916483,0.0014352577,0.004435187],"study_design_scores_gemma":[0.0011562236,0.00015778691,0.008510394,0.000008718157,0.0000015909972,0.00004527833,0.000018946208,0.0027354432,0.0058000544,0.978752,0.0026126804,0.0002008493],"about_ca_topic_score_codex":0.000007880891,"about_ca_topic_score_gemma":0.0000017642096,"teacher_disagreement_score":0.045705818,"about_ca_system_score_codex":0.00007592239,"about_ca_system_score_gemma":0.00008047067,"threshold_uncertainty_score":0.52265996},"labels":[],"label_agreement":null},{"id":"W124402557","doi":"","title":"An Addressing Scheme On Complete Bipartite Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Scheme (mathematics); Combinatorics; Graph; Mathematical analysis","score_opus":0.07088800168607567,"score_gpt":0.3224054629053689,"score_spread":0.25151746121929325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124402557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905203,0.00012762783,0.0044791694,0.0002606851,0.0009790871,0.00021831637,0.0000038568805,0.00046906504,0.0029419132],"genre_scores_gemma":[0.9895928,0.00002196974,0.009928332,0.0003080779,0.000009170249,0.000022547047,0.0000050791195,0.000024150182,0.00008789006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977372,0.00022941752,0.00023163146,0.00059627614,0.0006182185,0.0005872246],"domain_scores_gemma":[0.9979541,0.0001802673,0.0000853416,0.0013466323,0.00014564415,0.00028806616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037922437,0.00020711616,0.00022623538,0.00028380362,0.00058079313,0.00011448507,0.0015477434,0.000071274815,0.00002136951],"category_scores_gemma":[0.0000711714,0.00020396963,0.00008713102,0.0010132447,0.00026510705,0.000906258,0.000228947,0.00035706622,0.00024245628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019911058,0.0001807056,0.0031904525,0.0000050365693,0.000011771207,0.000095208336,0.00026321047,0.000036890648,0.0060834563,0.98814034,0.0005375047,0.0014355171],"study_design_scores_gemma":[0.00096169504,0.00048329128,0.009313384,0.000038696922,0.0000018580137,0.000044774206,0.000013607253,0.009785993,0.0070747947,0.9695221,0.0023865202,0.00037324423],"about_ca_topic_score_codex":0.00000877025,"about_ca_topic_score_gemma":0.000001194887,"teacher_disagreement_score":0.018618194,"about_ca_system_score_codex":0.000048651364,"about_ca_system_score_gemma":0.0000665191,"threshold_uncertainty_score":0.831764},"labels":[],"label_agreement":null},{"id":"W124588306","doi":"","title":"Enumeration for spanning forests of complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Enumeration; Combinatorics; Complete bipartite graph; Spanning tree; Graph","score_opus":0.030775711098023847,"score_gpt":0.3004455467256993,"score_spread":0.26966983562767544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124588306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.637719,0.00015507056,0.36001903,0.0003947573,0.000828783,0.0005131451,0.000007229935,0.00012085276,0.00024217524],"genre_scores_gemma":[0.9769435,0.0000052063974,0.022910751,0.000041832744,0.000004343817,0.00005361249,0.0000063063776,0.000012597906,0.000021827214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988095,0.00004508124,0.00024458027,0.00029188336,0.00028361665,0.00032534183],"domain_scores_gemma":[0.9989128,0.00017032534,0.00011483412,0.00050097535,0.00021551114,0.00008555465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039187283,0.000114563394,0.00018020246,0.00018241756,0.00015519353,0.00005112287,0.00065079593,0.00004589452,0.0000020464502],"category_scores_gemma":[0.00011761853,0.00011702988,0.00009427626,0.0005873008,0.00009541322,0.000501905,0.00013998247,0.00009960809,0.000011157346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016853859,0.000055915436,0.0014362455,0.00001993982,0.000013835121,0.0000021952073,0.00026555097,0.00075576344,0.0052981963,0.9907909,0.00005278792,0.0012918044],"study_design_scores_gemma":[0.001168016,0.00024442276,0.0030280661,0.000029912999,0.0000033011327,0.0000029261755,0.000008625317,0.002613964,0.020679208,0.97170806,0.0003928343,0.000120663],"about_ca_topic_score_codex":0.000013687711,"about_ca_topic_score_gemma":0.0000105464405,"teacher_disagreement_score":0.33922455,"about_ca_system_score_codex":0.000039885217,"about_ca_system_score_gemma":0.000063722764,"threshold_uncertainty_score":0.477234},"labels":[],"label_agreement":null},{"id":"W125447159","doi":"10.1007/978-3-319-07956-1_16","title":"New Lower Bounds on Broadcast Function","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Upper and lower bounds; Function (biology); Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.018034029748237645,"score_gpt":0.26643010582352544,"score_spread":0.2483960760752878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125447159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021571863,0.00023786747,0.9831285,0.00078782934,0.0037047,0.00035023567,0.000001842625,0.00025048302,0.011517002],"genre_scores_gemma":[0.12921767,0.0000778243,0.8403505,0.007970769,0.003445852,0.00002159594,0.00001088996,0.00017860577,0.01872626],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459726,0.000067336005,0.00046401628,0.0021247542,0.0017643033,0.0009823495],"domain_scores_gemma":[0.99591994,0.000725219,0.0002407372,0.0024614753,0.00025715528,0.0003954948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011927038,0.0006397054,0.00053343945,0.0013835657,0.00037118964,0.0008082846,0.0044648824,0.00039284208,0.00009961411],"category_scores_gemma":[0.00014119728,0.0005772422,0.00019181616,0.0009774433,0.0007129375,0.0005954835,0.001388768,0.00165672,0.00046149682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029256245,0.00001365507,0.000007814325,0.0000112009,0.0000073233864,0.000038451773,0.00009402356,0.00976221,0.0000786947,0.21027182,0.00015630922,0.7795293],"study_design_scores_gemma":[0.00043447796,0.0011501563,0.00007519205,0.00034789924,0.000006065972,0.0000545989,4.6612595e-8,0.10175273,0.000621638,0.85434556,0.040339705,0.00087192684],"about_ca_topic_score_codex":0.000013738629,"about_ca_topic_score_gemma":0.000026232537,"teacher_disagreement_score":0.7786573,"about_ca_system_score_codex":0.00037781816,"about_ca_system_score_gemma":0.00073984585,"threshold_uncertainty_score":0.9996679},"labels":[],"label_agreement":null},{"id":"W12746167","doi":"10.1080/08880010390203125","title":"Vertex-Disjoint K1, t's in Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.021898103047864267,"score_gpt":0.26131906849313136,"score_spread":0.2394209654452671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12746167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9594897,0.001370677,0.0027569786,0.0022108422,0.003326098,0.00056723156,0.0000021503765,0.0005303381,0.02974596],"genre_scores_gemma":[0.99775183,0.000069892616,0.0015900182,0.00015664576,0.0000019777954,0.00002979938,6.028498e-7,0.000014185387,0.0003850393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824166,0.00014381607,0.00023429486,0.00045330098,0.00040186674,0.00052506424],"domain_scores_gemma":[0.99869055,0.00017375832,0.000047080797,0.00087664346,0.00006298562,0.00014897357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038172465,0.00015469664,0.00019293021,0.00032308677,0.000098125216,0.00008886152,0.0012505593,0.0000684947,0.00008652031],"category_scores_gemma":[0.000115716764,0.00015611347,0.000075481556,0.0013659582,0.00009821418,0.0006130283,0.0003545377,0.00031718696,0.00040578344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037444722,0.0001464712,0.0023808626,0.0000052514215,0.000005687006,0.00006926208,0.00031139082,0.000011157703,0.0002063457,0.9863795,0.0013578043,0.009122502],"study_design_scores_gemma":[0.00083182636,0.00009437515,0.0034621092,0.000017626928,9.251648e-7,0.000010138654,0.000015581427,0.008413371,0.0007954131,0.98495555,0.0012115755,0.00019149891],"about_ca_topic_score_codex":0.000016137647,"about_ca_topic_score_gemma":0.0000076643055,"teacher_disagreement_score":0.038262114,"about_ca_system_score_codex":0.00007370202,"about_ca_system_score_gemma":0.00001641869,"threshold_uncertainty_score":0.63661224},"labels":[],"label_agreement":null},{"id":"W12912828","doi":"10.1007/978-1-4471-4069-6_5","title":"Graphs and Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Tree traversal; Graph traversal; Floyd–Warshall algorithm; Dijkstra's algorithm; Computer science; Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Breadth-first search; Algorithm; Discrete mathematics; Shortest path problem; Theoretical computer science; Graph; Artificial intelligence","score_opus":0.03443815039716676,"score_gpt":0.28481126624538416,"score_spread":0.2503731158482174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12912828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028648262,0.002697313,0.8789641,0.0040623425,0.0019497119,0.00061857904,0.0000051844177,0.0003685879,0.11104766],"genre_scores_gemma":[0.12895629,0.005736188,0.67323035,0.0017953626,0.0009508357,0.00004906808,0.000009787886,0.00017041234,0.18910171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635607,0.00004617736,0.00042759982,0.0012569056,0.0010256566,0.000887606],"domain_scores_gemma":[0.99762166,0.00021089143,0.00017579318,0.0014729153,0.0001654701,0.0003532478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001118778,0.0004356228,0.0004309074,0.0012344773,0.00029769714,0.00045403867,0.0029974768,0.00018455325,0.000009741909],"category_scores_gemma":[0.00002638053,0.00041862787,0.000095340096,0.00055778056,0.0014804461,0.0012451694,0.0024710502,0.0007281925,0.00005194028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013929875,0.00001329857,0.00010638975,0.000013602797,0.0000055706946,0.000028360553,0.000120228164,0.000038344515,0.000010617205,0.75743866,0.00006078347,0.24216276],"study_design_scores_gemma":[0.00021135439,0.00008638717,0.0003934161,0.00010528919,0.000003897017,0.000060160775,8.135363e-7,0.015199228,0.00007467709,0.96724176,0.016139908,0.0004831101],"about_ca_topic_score_codex":0.000008319232,"about_ca_topic_score_gemma":0.00004483139,"teacher_disagreement_score":0.24167965,"about_ca_system_score_codex":0.00016685778,"about_ca_system_score_gemma":0.00023922762,"threshold_uncertainty_score":0.99982655},"labels":[],"label_agreement":null},{"id":"W13215918","doi":"","title":"Spanning Eulerian Subgraphs in claw-free graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eulerian path; Claw; Combinatorics; Pure mathematics; Biology","score_opus":0.01387111740336125,"score_gpt":0.2660256259596989,"score_spread":0.2521545085563377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13215918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91810566,0.0008120636,0.0660606,0.00037319527,0.011500879,0.00040642967,0.0000015765625,0.00010627528,0.0026333323],"genre_scores_gemma":[0.9660083,0.000028050494,0.033257578,0.000019831226,0.0006406337,0.0000024853398,6.328594e-7,0.000035447007,0.0000070292754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960278,0.00025475866,0.0015359437,0.00038951435,0.001098618,0.00069332065],"domain_scores_gemma":[0.9964556,0.0010172528,0.001050187,0.0007128036,0.0005390332,0.000225129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032122198,0.00037019237,0.00088957744,0.00088236853,0.00029279268,0.0004822394,0.0020130945,0.00019200394,0.0000032396504],"category_scores_gemma":[0.0005749354,0.00034864823,0.00024904555,0.0014505071,0.00017493001,0.00078223064,0.00084289693,0.0008724016,0.0000020975576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050932922,0.00045828582,0.0014802198,0.000074724274,0.000029995304,0.000121695964,0.00047843702,0.00012443736,0.0007407584,0.99532485,0.00016817397,0.0009474765],"study_design_scores_gemma":[0.0048909565,0.00048114074,0.0010672638,0.0002873343,0.000015755959,0.00014728656,0.00012515795,0.0063168495,0.00071569055,0.98529124,0.0003131654,0.00034813018],"about_ca_topic_score_codex":0.000033777353,"about_ca_topic_score_gemma":0.0000031334773,"teacher_disagreement_score":0.047902662,"about_ca_system_score_codex":0.000110105866,"about_ca_system_score_gemma":0.00016213515,"threshold_uncertainty_score":0.9998965},"labels":[],"label_agreement":null},{"id":"W132229103","doi":"","title":"On The Hamiltonian Decomposition of Special Product of Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Hamiltonian (control theory); Pure mathematics; Product (mathematics); Combinatorics; Geometry; Mathematical optimization; Chemistry","score_opus":0.014578783458912632,"score_gpt":0.27608336610827916,"score_spread":0.26150458264936655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132229103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98353183,0.00007065049,0.0011231046,0.00032439717,0.0012114143,0.0003274743,0.0000020136745,0.000029898914,0.013379221],"genre_scores_gemma":[0.9984621,0.00000854667,0.0014258865,0.000035018595,0.0000061669543,0.000009925447,5.0573675e-7,0.0000073425567,0.000044534456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863434,0.0002875145,0.00021621793,0.0002493743,0.00040254925,0.00020997981],"domain_scores_gemma":[0.9985355,0.00033247806,0.00012314094,0.00080367725,0.00015983444,0.000045381315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006967805,0.00009973028,0.00015606672,0.00013609929,0.000097910684,0.000018443121,0.00077119685,0.000028304705,0.00002911616],"category_scores_gemma":[0.00023897462,0.0000747806,0.0000783776,0.000786053,0.00018352851,0.00016059999,0.0000832202,0.00015507783,0.000014173437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001581088,0.00014419034,0.00043110026,0.000007744879,0.000013000027,0.0000020290695,0.00020646177,0.000017725666,0.0038549444,0.9939372,0.00046074003,0.0009090499],"study_design_scores_gemma":[0.000258542,0.00018295257,0.001738025,0.00001748184,0.0000020226835,0.0000028479312,0.000012322435,0.000049532387,0.12262743,0.8747692,0.0002730544,0.00006654766],"about_ca_topic_score_codex":0.000003303041,"about_ca_topic_score_gemma":0.0000013153012,"teacher_disagreement_score":0.11916796,"about_ca_system_score_codex":0.000022543803,"about_ca_system_score_gemma":0.000055637134,"threshold_uncertainty_score":0.30494642},"labels":[],"label_agreement":null},{"id":"W133616081","doi":"","title":"Maximum genus, Girth and Maximum non-adjacent edge set.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Girth (graph theory); Enhanced Data Rates for GSM Evolution; Combinatorics; Set (abstract data type); Biology; Zoology; Computer science; Artificial intelligence","score_opus":0.012424787092114708,"score_gpt":0.2552469536248937,"score_spread":0.242822166532779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133616081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960272,0.0011714572,0.025922246,0.001055466,0.0024752286,0.0006280293,0.0000103136845,0.00037945027,0.008085824],"genre_scores_gemma":[0.9941036,0.00005096093,0.0048933052,0.00012536079,0.00002503413,0.000033460772,0.0000064664528,0.000029491877,0.0007323131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997777,0.00011441121,0.00027318584,0.00065510906,0.00049051223,0.0006897897],"domain_scores_gemma":[0.9984811,0.00014075876,0.00008904938,0.0009467733,0.00013514044,0.00020716547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004654781,0.00025103823,0.00025581065,0.0001898966,0.00026822425,0.00020678862,0.0010471322,0.00010215154,0.000018543393],"category_scores_gemma":[0.000034046105,0.00024832878,0.00007202294,0.00066816434,0.00018084345,0.000548731,0.0007181528,0.00030746707,0.00014978304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017435545,0.00013191093,0.0062625688,0.0000258607,0.000015976697,0.00008678259,0.00017112617,0.000021064448,0.00094304525,0.9763889,0.004302249,0.011633085],"study_design_scores_gemma":[0.0010314104,0.00013549128,0.010537375,0.000016951813,0.0000044144413,0.000030764757,0.000018618814,0.0017493669,0.0025836928,0.9716676,0.01191546,0.00030887386],"about_ca_topic_score_codex":0.000050960494,"about_ca_topic_score_gemma":0.00000859912,"teacher_disagreement_score":0.033831622,"about_ca_system_score_codex":0.00008400263,"about_ca_system_score_gemma":0.00007345281,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W133646803","doi":"","title":"Special Kinds of Domination Parameters of Edge-Deleted Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.018127951429485374,"score_gpt":0.2739325109925119,"score_spread":0.25580455956302656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133646803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838278,0.000051751016,0.0067206146,0.00013005454,0.0024438477,0.00024111045,0.000002429752,0.000057313366,0.006525031],"genre_scores_gemma":[0.9942415,0.000033486598,0.005585313,0.000021794569,0.000020995201,0.0000100121115,0.0000023332132,0.00001080646,0.000073785435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983904,0.00015342825,0.00035618403,0.00029398652,0.0005130781,0.00029296943],"domain_scores_gemma":[0.9984862,0.00027378352,0.00021062541,0.00065198896,0.00029145821,0.00008589672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157272,0.00012747111,0.00026091738,0.00036381118,0.000059722213,0.000022338794,0.0009868646,0.00007501515,0.000022696708],"category_scores_gemma":[0.00017828021,0.00012966906,0.000116959294,0.0014763654,0.0002269003,0.00040000945,0.00019963557,0.00015459524,0.000011564609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055670935,0.00016184914,0.002556867,0.000013691446,0.000023985396,0.0000106730695,0.00029275598,0.000027852571,0.0030543194,0.9715187,0.00051907497,0.02176459],"study_design_scores_gemma":[0.0010924248,0.00028565046,0.0046650185,0.000023404918,0.000005765083,0.0000069037774,0.000030449908,0.0010254371,0.030886,0.96119636,0.00063808326,0.00014452361],"about_ca_topic_score_codex":0.000014015736,"about_ca_topic_score_gemma":0.0000024953385,"teacher_disagreement_score":0.027831681,"about_ca_system_score_codex":0.00003698731,"about_ca_system_score_gemma":0.00005238277,"threshold_uncertainty_score":0.5287751},"labels":[],"label_agreement":null},{"id":"W134620505","doi":"","title":"On a generalization of signed total dominating functions of graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.012171298720965895,"score_gpt":0.2663995398700411,"score_spread":0.2542282411490752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134620505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9306364,0.00006152009,0.06697972,0.00012572327,0.00039807806,0.00016911015,0.0000029559897,0.00005758496,0.0015689114],"genre_scores_gemma":[0.9917573,0.0000030503359,0.008027248,0.000021674883,0.000004054207,0.0000121893345,0.0000025215365,0.000008484996,0.00016349203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988814,0.00010997756,0.00025938268,0.00021816077,0.0003463929,0.0001846567],"domain_scores_gemma":[0.9989176,0.00023200309,0.00014573781,0.00044604662,0.00020499663,0.0000536141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032795896,0.00009152816,0.0001560512,0.00024491685,0.00008111522,0.00001493059,0.00039740492,0.0000435082,0.000019096185],"category_scores_gemma":[0.00014983556,0.00009109278,0.000074028074,0.0008506234,0.000080210615,0.0003119006,0.00011983691,0.00009180882,0.000010851238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016996502,0.00015126557,0.00021314081,0.000009742235,0.000012713789,7.178964e-7,0.00022483937,0.0016760424,0.02179645,0.9695618,0.00014290855,0.0061933636],"study_design_scores_gemma":[0.0009431753,0.0003946625,0.0011761856,0.000030593696,0.0000049223686,0.0000031236293,0.00002609828,0.019478098,0.05495162,0.92281425,0.000050002833,0.00012726309],"about_ca_topic_score_codex":0.000006416337,"about_ca_topic_score_gemma":0.0000012916951,"teacher_disagreement_score":0.06112089,"about_ca_system_score_codex":0.000032351978,"about_ca_system_score_gemma":0.0000355882,"threshold_uncertainty_score":0.37146556},"labels":[],"label_agreement":null},{"id":"W135019761","doi":"","title":"Complete bipartite free graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Cograph; Chordal graph; 1-planar graph; Graph","score_opus":0.025079521374824644,"score_gpt":0.27375007785731814,"score_spread":0.2486705564824935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135019761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73979425,0.002458537,0.103894845,0.0027995822,0.012297928,0.0016533439,0.00003857047,0.0022836328,0.1347793],"genre_scores_gemma":[0.9864031,0.000022806344,0.012890305,0.0002431529,0.0000028374407,0.000033720422,0.000001973048,0.0000211721,0.00038092048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794644,0.00027540562,0.0002273486,0.00048128288,0.0004815224,0.0005879932],"domain_scores_gemma":[0.99763274,0.00023386374,0.00006890286,0.0017070619,0.00013748041,0.0002199332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062774617,0.00017948421,0.0002028003,0.0002081427,0.00024067822,0.00013181225,0.0018811328,0.00006159643,0.00005059851],"category_scores_gemma":[0.0003169429,0.0001779399,0.00010140926,0.0012099015,0.00015266846,0.0005429969,0.00036971128,0.0002621537,0.00029421665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034334698,0.000064139596,0.0015254306,0.000004985862,0.000014463043,0.000022775066,0.00008720814,0.000008203917,0.0010920595,0.9943916,0.002164279,0.00062141276],"study_design_scores_gemma":[0.00076407427,0.000091908114,0.0007661023,0.000007974844,0.0000022643674,0.000014715823,0.000009641749,0.00037782395,0.0026486325,0.96898925,0.026117124,0.00021046364],"about_ca_topic_score_codex":0.0000065685012,"about_ca_topic_score_gemma":0.0000030175538,"teacher_disagreement_score":0.24660885,"about_ca_system_score_codex":0.000039756032,"about_ca_system_score_gemma":0.00006035594,"threshold_uncertainty_score":0.7256178},"labels":[],"label_agreement":null},{"id":"W135964657","doi":"","title":"The Expectation of Independent Domination Number Over Random Binary Trees.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Random binary tree; Binary tree; Combinatorics; Statistics; Arithmetic","score_opus":0.009152291672543507,"score_gpt":0.2763003681278505,"score_spread":0.267148076455307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135964657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901594,0.00013587573,0.0017657042,0.0002897864,0.0005951038,0.00031099236,0.0000010358668,0.0000677657,0.006674365],"genre_scores_gemma":[0.9984626,0.0000828293,0.000423444,0.000024030287,0.000005674677,0.000042396056,0.000002087437,0.000009921725,0.00094700453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984106,0.00025294075,0.0002616832,0.00025548704,0.000568256,0.00025104507],"domain_scores_gemma":[0.9985837,0.0005417441,0.000099129924,0.00059121323,0.00012491163,0.000059330483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006521355,0.00011008875,0.00014200155,0.000066057764,0.00022710064,0.000071936534,0.00079916435,0.000055563705,0.00014522899],"category_scores_gemma":[0.00007822732,0.000084180836,0.000079120764,0.0005540612,0.00012132899,0.0005538587,0.000107778826,0.00015401082,0.00009154632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023813013,0.00014081235,0.0017619316,0.0000048990446,0.000026169984,0.000008847707,0.00096338085,0.00012238842,0.0013737683,0.9357376,0.000708128,0.058913957],"study_design_scores_gemma":[0.0038863735,0.000115161514,0.026624333,0.000017187776,0.000005232313,0.0000073122574,0.00007780792,0.006385727,0.0059961597,0.95522076,0.0015015,0.00016242488],"about_ca_topic_score_codex":0.000013513059,"about_ca_topic_score_gemma":0.0000054389643,"teacher_disagreement_score":0.058751535,"about_ca_system_score_codex":0.000057471116,"about_ca_system_score_gemma":0.00004501358,"threshold_uncertainty_score":0.34327948},"labels":[],"label_agreement":null},{"id":"W137453216","doi":"","title":"On the Girth of Digraphs with High Connectivity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Girth (graph theory); Mathematics; Combinatorics","score_opus":0.013045838375878383,"score_gpt":0.2476699812188061,"score_spread":0.2346241428429277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137453216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989117,0.00003415585,0.005031413,0.000942228,0.00028488462,0.00022238737,0.0000012240005,0.0000805125,0.0042861723],"genre_scores_gemma":[0.999221,0.000013526628,0.00045156592,0.00013051528,0.000002386369,0.000023024659,4.2583903e-7,0.000010847829,0.00014668691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986498,0.00017676565,0.00012571429,0.00029631195,0.0004552797,0.0002961348],"domain_scores_gemma":[0.9977097,0.0010369731,0.00008380751,0.0009684613,0.00013082383,0.00007026933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043401294,0.00012767452,0.00016340043,0.0001168272,0.0001489975,0.000044671488,0.0010770907,0.00003483663,0.000023579485],"category_scores_gemma":[0.00012472869,0.00007858431,0.00004853169,0.0010773962,0.00021131634,0.00024780686,0.00016329798,0.00021809015,0.000025060592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053810352,0.00012302649,0.003663346,0.0000029476787,0.000021837908,0.000020181304,0.000119671306,0.00004246879,0.00021345787,0.99461836,0.00017653947,0.0009443716],"study_design_scores_gemma":[0.00055843074,0.00053874525,0.007340908,0.000021946234,0.000002380076,0.000010413599,0.000023442322,0.00027346984,0.004706771,0.9861171,0.00029463824,0.00011171265],"about_ca_topic_score_codex":0.000027756845,"about_ca_topic_score_gemma":0.000008300582,"teacher_disagreement_score":0.010103998,"about_ca_system_score_codex":0.000021614369,"about_ca_system_score_gemma":0.000042887405,"threshold_uncertainty_score":0.3204575},"labels":[],"label_agreement":null},{"id":"W137797140","doi":"","title":"Multiplicity of triangles in 2-edge coloring of a family of graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Multiplicity (mathematics); Enhanced Data Rates for GSM Evolution; Combinatorics; Graph coloring; Graph; Geometry; Computer science; Line graph; Artificial intelligence","score_opus":0.026968470004223616,"score_gpt":0.28860468504711323,"score_spread":0.2616362150428896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137797140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99761635,0.00023410295,0.00026415294,0.000017672077,0.00016162754,0.00023171908,0.000004413962,0.000023397073,0.001446542],"genre_scores_gemma":[0.99737006,0.00006178733,0.0025037827,0.000006736249,9.193352e-7,0.000013208586,5.039915e-7,0.000007663695,0.000035329856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853283,0.0001575028,0.0004636664,0.00025075953,0.0003431479,0.0002520923],"domain_scores_gemma":[0.9986949,0.00037325762,0.00015144054,0.0005874525,0.00013573321,0.00005719438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006337396,0.00010838959,0.0003702155,0.00030144735,0.000024845993,0.000006062907,0.0009434452,0.00006309666,0.000011688078],"category_scores_gemma":[0.00011040227,0.000110057495,0.000099279576,0.001389983,0.00019974887,0.00025470532,0.00016001407,0.00014637843,0.0000030972694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014211531,0.0004314543,0.019793043,0.00006909831,0.000021297868,0.000007261934,0.00090054894,0.00018582233,0.023049183,0.93873525,0.000017811295,0.01664709],"study_design_scores_gemma":[0.002684745,0.0003774783,0.06567761,0.000107166255,0.0000037815234,0.0000012782497,0.00007573995,0.0025680687,0.095517814,0.8327637,0.000068130714,0.00015452594],"about_ca_topic_score_codex":0.000108325294,"about_ca_topic_score_gemma":0.000008406408,"teacher_disagreement_score":0.10597162,"about_ca_system_score_codex":0.00002521272,"about_ca_system_score_gemma":0.000059057336,"threshold_uncertainty_score":0.44880146},"labels":[],"label_agreement":null},{"id":"W1418567529","doi":"10.1016/j.dam.2015.09.015","title":"Counting the number of non-equivalent vertex colorings of a graph","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Degree (music); Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.034397920620340305,"score_gpt":0.3151338333837076,"score_spread":0.2807359127633673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1418567529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2306872,0.000034361117,0.70074314,0.000120850054,0.00007064292,0.0005654778,0.000005584857,0.00006043422,0.0677123],"genre_scores_gemma":[0.88277036,0.000007209057,0.11705917,0.000025278157,0.000007979726,0.000044381613,0.0000010009741,0.000016058817,0.000068556015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834156,0.000020815103,0.00042589026,0.00021145832,0.0007056625,0.00029458868],"domain_scores_gemma":[0.9981914,0.0003505789,0.00031614787,0.0008731382,0.00018045184,0.00008829349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010468946,0.00014474487,0.00030394606,0.000066873814,0.00006195141,0.000034459583,0.001289123,0.00004599589,0.000008549927],"category_scores_gemma":[0.000098716024,0.0000988392,0.00008815118,0.00060429476,0.0002782206,0.00014069027,0.00054190354,0.00014844506,0.000032872216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014170559,0.00007104419,0.00012446857,0.00016886127,0.00003513842,0.0000012706155,0.0038854613,0.00009737443,0.0057065324,0.98922354,0.00011714388,0.0005549828],"study_design_scores_gemma":[0.0006669365,0.000059032885,0.00012891048,0.000093586415,0.000024463257,0.000012020737,0.0027313228,0.016759915,0.03014195,0.9489302,0.00023671522,0.00021491303],"about_ca_topic_score_codex":0.0000058161654,"about_ca_topic_score_gemma":6.7229496e-7,"teacher_disagreement_score":0.65208316,"about_ca_system_score_codex":0.000023292008,"about_ca_system_score_gemma":0.00006972165,"threshold_uncertainty_score":0.40305457},"labels":[],"label_agreement":null},{"id":"W142123670","doi":"","title":"Regular Weighted Graphs Without Positive Cuts.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010257762863609247,"score_gpt":0.27615987145997967,"score_spread":0.2659021085963704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142123670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8447344,0.0004828193,0.123454645,0.000706477,0.0026551343,0.00068576523,0.0000042308943,0.0007604184,0.026516145],"genre_scores_gemma":[0.9856189,0.0000146081065,0.013432549,0.00019925743,0.000008015611,0.000011089839,0.000004243438,0.000025412333,0.00068594463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976127,0.0001505777,0.00027979963,0.0005793577,0.0006424895,0.00073508976],"domain_scores_gemma":[0.99802196,0.0002763841,0.00010007248,0.0010394373,0.00028118168,0.00028093602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011694456,0.00021800588,0.00023750594,0.00034469363,0.0002626657,0.000103106555,0.0014002401,0.00010975838,0.0000137590905],"category_scores_gemma":[0.00007223375,0.0002107294,0.00010987495,0.0014699282,0.00020685644,0.0006551523,0.00040002534,0.0003543118,0.00013229184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035516878,0.00009524478,0.0030563432,0.000004177681,0.000030661715,0.0001028366,0.00028213364,7.878253e-7,0.0018672588,0.98844403,0.00036663213,0.0057143904],"study_design_scores_gemma":[0.00077353197,0.00017454772,0.0066886535,0.000022135142,0.0000047968433,0.00002882784,0.000030522162,0.00046752588,0.027476488,0.96283346,0.0012347008,0.00026481404],"about_ca_topic_score_codex":0.000014172928,"about_ca_topic_score_gemma":0.00000410878,"teacher_disagreement_score":0.14088452,"about_ca_system_score_codex":0.000090773465,"about_ca_system_score_gemma":0.00006349152,"threshold_uncertainty_score":0.8593296},"labels":[],"label_agreement":null},{"id":"W143189219","doi":"10.46298/dmtcs.272","title":"P_4-Colorings and P_4-Bipartite Graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cograph; Bipartite graph; Strong perfect graph theorem; Indifference graph; Chordal graph; Discrete mathematics; Triangle-free graph; Pathwidth; Split graph; 1-planar graph; Pancyclic graph; Graph; Line graph","score_opus":0.01926560107359048,"score_gpt":0.2934408747580528,"score_spread":0.2741752736844623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143189219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09199325,0.00009458887,0.8978991,0.001086673,0.0002021413,0.00034107256,0.0000019508755,0.00030701372,0.008074214],"genre_scores_gemma":[0.6751796,0.00004952803,0.32443634,0.00021394018,0.00003498916,0.000024537772,5.272323e-7,0.000018040038,0.000042530442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957457,0.00012182515,0.0004989506,0.0011363892,0.0013001055,0.0011969982],"domain_scores_gemma":[0.99681175,0.00064321025,0.00013355937,0.001506227,0.0002560059,0.00064922293],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0024499441,0.00036416895,0.000409655,0.0004504829,0.00076306897,0.0010086066,0.00334593,0.00008068215,0.00005683827],"category_scores_gemma":[0.00026804322,0.00029074727,0.000118944845,0.002410369,0.005400553,0.0014149753,0.0025159123,0.00038260838,0.00010152986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000790499,0.00006951632,0.00017342705,0.000025895353,0.000008251721,0.000041255422,0.0009809888,0.000028196544,0.0006046637,0.98806846,0.00001428133,0.009977173],"study_design_scores_gemma":[0.000198745,0.00013940973,0.0002345436,0.000051025254,0.0000058075316,0.00014611163,0.00003813,0.3097387,0.000982862,0.68795365,0.00022077742,0.00029025783],"about_ca_topic_score_codex":0.000001751838,"about_ca_topic_score_gemma":8.471645e-7,"teacher_disagreement_score":0.5831863,"about_ca_system_score_codex":0.000045284927,"about_ca_system_score_gemma":0.0000822692,"threshold_uncertainty_score":0.99995446},"labels":[],"label_agreement":null},{"id":"W143711533","doi":"","title":"A Note on the Representation of Unit Interval Graphs: A Link Between Interval Graphs and Semiorders.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Indifference graph; Link (geometry); Unit interval; Interval graph; Combinatorics; Chordal graph; Unit (ring theory); Representation (politics); Pathwidth; Discrete mathematics; 1-planar graph; Graph; Line graph; Mathematics education","score_opus":0.0368655418629756,"score_gpt":0.32064296678188997,"score_spread":0.2837774249189144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143711533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892495,0.000117436655,0.0061080847,0.0015838051,0.00055138767,0.00042034342,0.000004365033,0.000096840035,0.0018682074],"genre_scores_gemma":[0.99842554,0.000037251666,0.0013114433,0.00011300571,0.000004006817,0.000024710032,0.000002235272,0.000016273882,0.00006551591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977576,0.0006704679,0.00034077303,0.00045213563,0.00044437213,0.00033463005],"domain_scores_gemma":[0.99736804,0.0012621478,0.00016494229,0.00091362494,0.00017930818,0.00011193312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010103163,0.00018648973,0.0002824754,0.00028203218,0.0001691691,0.000086502485,0.00092638546,0.00008434822,0.0000105216695],"category_scores_gemma":[0.00059785787,0.00014608333,0.00012548402,0.0013548251,0.00031393187,0.00035272609,0.00028687797,0.0004230522,0.0000109575285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022187125,0.000038918442,0.012069216,0.000013503796,0.00004311655,0.000005630459,0.00097164174,0.0000047600383,0.00031163005,0.9781381,0.000119376884,0.008261952],"study_design_scores_gemma":[0.00066697696,0.00038049291,0.005700521,0.00006606139,0.000010416994,0.0000051921343,0.00015475687,0.0003962081,0.009487038,0.982634,0.00034855265,0.00014979827],"about_ca_topic_score_codex":0.000026470927,"about_ca_topic_score_gemma":0.000004623311,"teacher_disagreement_score":0.009176028,"about_ca_system_score_codex":0.000021989237,"about_ca_system_score_gemma":0.000043498658,"threshold_uncertainty_score":0.5957105},"labels":[],"label_agreement":null},{"id":"W145583369","doi":"","title":"A Note on the Hall-Condition Number of a Graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.014490520136057602,"score_gpt":0.2956513618336297,"score_spread":0.2811608416975721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145583369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597176,0.000025068308,0.0014947304,0.0013450184,0.00040994678,0.00027740674,0.0000037158381,0.000107598404,0.03661895],"genre_scores_gemma":[0.9985111,0.0000179544,0.0007313036,0.00023421226,0.0000038853664,0.00002917876,0.0000012320894,0.000009336235,0.00046181082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987356,0.00017830505,0.0001647348,0.00025744637,0.00040640656,0.00025751622],"domain_scores_gemma":[0.9985972,0.00040453553,0.000055328204,0.0008040543,0.00007789237,0.00006096565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040927742,0.000108159824,0.00012500613,0.00006447619,0.00013809254,0.000041449322,0.00096035487,0.00004712437,0.000372333],"category_scores_gemma":[0.000056095298,0.00007930335,0.00008525691,0.0006888171,0.00014474468,0.0002546572,0.00008320837,0.00021018468,0.000463715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019580608,0.00009068742,0.00018872066,0.0000033927006,0.000010460799,0.0000066598254,0.0002384236,0.000019122039,0.00027468347,0.991341,0.0006291004,0.007178166],"study_design_scores_gemma":[0.00034704208,0.00009049286,0.0012284851,0.000020426922,0.0000021357084,0.000007651253,0.000007623346,0.00056870474,0.004845215,0.99174064,0.0010506725,0.00009091236],"about_ca_topic_score_codex":0.000015488897,"about_ca_topic_score_gemma":0.0000015468243,"teacher_disagreement_score":0.038793523,"about_ca_system_score_codex":0.000024171746,"about_ca_system_score_gemma":0.000031429852,"threshold_uncertainty_score":0.5960273},"labels":[],"label_agreement":null},{"id":"W145866003","doi":"","title":"A note on graphs with disjoint dominating and total dominating sets.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Dominating set; Combinatorics; Graph","score_opus":0.013711757464083662,"score_gpt":0.26537390016920026,"score_spread":0.2516621427051166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145866003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936198,0.00006924647,0.0031674623,0.00028497312,0.00030313502,0.00027449252,0.0000016672337,0.00015783033,0.0021213992],"genre_scores_gemma":[0.9828744,0.000013787867,0.016873868,0.00007615126,0.000003334353,0.00003530625,0.0000011798389,0.000023493902,0.00009846276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979703,0.00014870691,0.00022300944,0.0005902629,0.00055876264,0.00050899055],"domain_scores_gemma":[0.99838805,0.0005731469,0.00011647476,0.00060872175,0.0001236919,0.00018988474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048041999,0.0002328726,0.00025881335,0.00022322444,0.0005370858,0.00009449105,0.00052120374,0.00006136057,0.0000037618577],"category_scores_gemma":[0.00019254284,0.00019462999,0.000055392386,0.00073416764,0.0002862287,0.0005553147,0.00037652682,0.00038648173,0.00001683451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006259509,0.00010778212,0.0019834964,0.000017353406,0.000017245877,0.00023460173,0.0022869073,0.000042086253,0.00081545755,0.9797966,0.00004615921,0.014589711],"study_design_scores_gemma":[0.0032001778,0.0011630208,0.013876033,0.00014223301,0.000006806617,0.0005042877,0.00015508664,0.01239756,0.0071099,0.96083087,0.000047508158,0.0005665448],"about_ca_topic_score_codex":0.0000117597965,"about_ca_topic_score_gemma":0.0000023829234,"teacher_disagreement_score":0.018965762,"about_ca_system_score_codex":0.00006147298,"about_ca_system_score_gemma":0.000059007343,"threshold_uncertainty_score":0.79367805},"labels":[],"label_agreement":null},{"id":"W147598185","doi":"","title":"Bondage number in oriented graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012176168225396909,"score_gpt":0.29484539892828276,"score_spread":0.28266923070288585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147598185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9601759,0.000073617346,0.017973479,0.00018473767,0.0015248145,0.00023927091,8.226055e-7,0.00022391681,0.019603442],"genre_scores_gemma":[0.99432516,0.000008114659,0.005151474,0.00012385946,0.0000032118808,0.000009175393,0.000001553158,0.000014437107,0.00036302203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998121,0.00009186486,0.00027449496,0.0004241415,0.00044266882,0.00064579624],"domain_scores_gemma":[0.9986779,0.000258544,0.000056186454,0.00073735946,0.00010115023,0.00016884199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012872368,0.00014531189,0.00016896482,0.00027175402,0.00009421187,0.000049881928,0.00094563834,0.000079213816,0.000032572058],"category_scores_gemma":[0.00012460681,0.00014840055,0.00006189691,0.0020863758,0.00010097059,0.0005317703,0.0003337301,0.00034218765,0.0002173387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001678926,0.00011129612,0.03791675,0.0000040023397,0.0000048747156,0.00014354689,0.0002691629,0.0000017697207,0.00034825376,0.95800304,0.00028950907,0.00289099],"study_design_scores_gemma":[0.00086860004,0.00004685963,0.024033332,0.000013306563,8.047798e-7,0.000013662502,0.00003655636,0.00020884459,0.0033649846,0.9677938,0.0034385116,0.00018073095],"about_ca_topic_score_codex":0.00002555366,"about_ca_topic_score_gemma":0.000021862974,"teacher_disagreement_score":0.034149252,"about_ca_system_score_codex":0.00008544074,"about_ca_system_score_gemma":0.00004324252,"threshold_uncertainty_score":0.6051599},"labels":[],"label_agreement":null},{"id":"W147739259","doi":"","title":"Two families of graphs that are not CCE-orientable","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02582890884677912,"score_gpt":0.2883827748628266,"score_spread":0.26255386601604747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147739259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98417217,0.0002920673,0.004751802,0.00026891203,0.00158219,0.00024902626,0.000004920926,0.00019303724,0.008485868],"genre_scores_gemma":[0.9961568,0.00015280262,0.0030083864,0.00011007116,0.000004355851,0.000022730994,0.00000177646,0.000016605003,0.000526437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803036,0.00013242042,0.0002401694,0.00044784817,0.0006345248,0.00051464763],"domain_scores_gemma":[0.9981879,0.0002468385,0.00015727525,0.0010658232,0.00019714405,0.00014501263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045102893,0.00018249475,0.0002874093,0.0002810369,0.0001661412,0.00006685782,0.001442924,0.00005643785,0.000023937151],"category_scores_gemma":[0.00008404919,0.00017636873,0.00011295631,0.0013186401,0.00020415382,0.00075159915,0.0004898776,0.00022059499,0.000049971295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002663316,0.00013904204,0.045429356,0.000012034801,0.000019062563,0.000033018587,0.00024484345,0.000020046251,0.0010202342,0.9507355,0.00026847364,0.0020517234],"study_design_scores_gemma":[0.0010552212,0.00011254415,0.009331595,0.00003105792,0.0000041916855,0.000014376911,0.00019524575,0.00044002966,0.024252588,0.96283096,0.0015259283,0.00020628882],"about_ca_topic_score_codex":0.0000622349,"about_ca_topic_score_gemma":0.000012336389,"teacher_disagreement_score":0.03609776,"about_ca_system_score_codex":0.00004322569,"about_ca_system_score_gemma":0.000047753518,"threshold_uncertainty_score":0.7192108},"labels":[],"label_agreement":null},{"id":"W1481873605","doi":"10.1007/s00493-009-2178-y","title":"Highly parity linked graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Parity (physics); Disjoint sets; Graph; Joins; Discrete mathematics; Physics; Computer science","score_opus":0.0204968892541353,"score_gpt":0.28604150329798345,"score_spread":0.26554461404384816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481873605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20214984,0.003528511,0.6424367,0.022553012,0.0038869686,0.0015061651,0.000005494543,0.004412477,0.11952088],"genre_scores_gemma":[0.99290687,0.000046103974,0.006156664,0.00042656655,0.000017931301,0.000009464659,0.0000011333195,0.000006825034,0.00042846688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984078,0.00011497789,0.00018115589,0.00042770282,0.00040198403,0.0004664133],"domain_scores_gemma":[0.9984706,0.00012881037,0.0000554031,0.0010041732,0.00013194722,0.00020908417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003212698,0.00014519141,0.0001823304,0.00018060753,0.00021141146,0.000111548026,0.0016047993,0.000074878764,0.000009348958],"category_scores_gemma":[0.000101609745,0.00013729789,0.00009191812,0.001309801,0.000064689084,0.00045350145,0.00021055985,0.00031140202,0.00014498475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005571459,0.0001473323,0.00031187793,0.0000023963648,0.0000045995594,0.000027415666,0.00006790883,0.0000026562948,0.00048146312,0.9725773,0.0015553695,0.024816152],"study_design_scores_gemma":[0.00038505896,0.0002474199,0.01010654,0.000005766817,0.0000016989887,0.000006701594,0.0000027811518,0.0008071781,0.001265715,0.97512025,0.011872078,0.0001788194],"about_ca_topic_score_codex":0.0000028410914,"about_ca_topic_score_gemma":2.102292e-7,"teacher_disagreement_score":0.790757,"about_ca_system_score_codex":0.000059423903,"about_ca_system_score_gemma":0.000046839104,"threshold_uncertainty_score":0.55988455},"labels":[],"label_agreement":null},{"id":"W1481913488","doi":"10.1002/jgt.20649","title":"An asymptotically tight bound on the adaptable chromatic number","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigraph; Combinatorics; Mathematics; Chromatic scale; Vertex (graph theory); Integer (computer science); Graph; Upper and lower bounds; Edge coloring; Critical graph; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Graph power; Line graph","score_opus":0.022410699323175753,"score_gpt":0.2992226052457742,"score_spread":0.27681190592259847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481913488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5349398,0.0007373346,0.4442875,0.001594172,0.0010510301,0.00024641913,0.0000014662343,0.0000696168,0.01707265],"genre_scores_gemma":[0.99116033,0.000034454686,0.007543828,0.00071585784,0.0002690019,0.0000044199483,1.6631029e-7,0.000020265403,0.0002516503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968669,0.0011324651,0.0004277272,0.0001608175,0.000823543,0.00058854296],"domain_scores_gemma":[0.9967953,0.0014610131,0.00030044783,0.0008613655,0.00021950837,0.00036237325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006066856,0.00017932872,0.0002567773,0.00022363006,0.0003173294,0.00019724881,0.001962577,0.00006962735,0.0003368927],"category_scores_gemma":[0.00033222188,0.00010304022,0.00021300366,0.00064147153,0.0003106596,0.0016289295,0.0001218229,0.0006238411,0.0001781554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008051698,0.00027063405,0.0007710693,0.000006303095,0.00006795372,0.000017054866,0.0006481867,0.00005628748,0.0016632042,0.99295545,0.0005742453,0.0028891154],"study_design_scores_gemma":[0.00031305343,0.00040358666,0.0044544437,0.000065589105,0.000018583432,0.00034513054,0.00018266229,0.00041477676,0.0027239057,0.989207,0.0016950368,0.0001762116],"about_ca_topic_score_codex":6.309047e-7,"about_ca_topic_score_gemma":4.5699753e-7,"teacher_disagreement_score":0.45622054,"about_ca_system_score_codex":0.000051616593,"about_ca_system_score_gemma":0.00009453635,"threshold_uncertainty_score":0.4201858},"labels":[],"label_agreement":null},{"id":"W1484014009","doi":"10.1007/bfb0026093","title":"On the maximum path length of AVL trees","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Path length; Path (computing); Tree (set theory); Bounded function; Upper and lower bounds; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.021525221077780408,"score_gpt":0.26746629434775215,"score_spread":0.24594107326997175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484014009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023045392,0.0003616999,0.98706037,0.001756174,0.000595881,0.00044390632,0.000007692763,0.00009331888,0.009450478],"genre_scores_gemma":[0.6815487,0.00018351768,0.312814,0.003273932,0.0006491901,0.000027871796,0.000003276456,0.000088329834,0.0014111549],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956295,0.00009649835,0.0005057793,0.0013467254,0.0016685394,0.0007529426],"domain_scores_gemma":[0.99459314,0.0022109495,0.00031043869,0.002488049,0.0002535159,0.00014390516],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016061375,0.00050147146,0.0005069836,0.00084182544,0.00027850165,0.00023883714,0.006635599,0.0002274683,0.00006403888],"category_scores_gemma":[0.00025116524,0.00033842074,0.00019124389,0.00086748385,0.0016809142,0.00042866138,0.0016327724,0.0012021357,0.00006790504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010642236,0.000032002783,0.000008526126,0.000010879459,0.00000945707,0.000028616136,0.00038225634,0.016024385,0.00012177442,0.4558156,0.000026504089,0.52752936],"study_design_scores_gemma":[0.00017909678,0.00031953974,0.00005890631,0.00028444888,0.000003339486,0.000025237476,2.5576563e-7,0.108689114,0.0024899482,0.88598996,0.001548658,0.00041147164],"about_ca_topic_score_codex":0.000006828326,"about_ca_topic_score_gemma":0.000046860478,"teacher_disagreement_score":0.6813183,"about_ca_system_score_codex":0.00019265385,"about_ca_system_score_gemma":0.0003859538,"threshold_uncertainty_score":0.9999068},"labels":[],"label_agreement":null},{"id":"W1484251326","doi":"10.48550/arxiv.0712.0804","title":"Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Transitive relation; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.05429848220109878,"score_gpt":0.31668739605324886,"score_spread":0.2623889138521501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484251326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41203478,0.00046948704,0.583921,0.00091274816,0.0003938772,0.0010393156,0.000060606133,0.00023731207,0.0009308291],"genre_scores_gemma":[0.97998154,0.00020102065,0.017535366,0.001541095,0.00015413987,0.00015045272,0.000030669013,0.00006485964,0.00034084395],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99555504,0.00026238256,0.00057181134,0.0017728353,0.0007378913,0.0011000134],"domain_scores_gemma":[0.996295,0.00056096975,0.0001867601,0.0018610262,0.0004003062,0.000695962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011107636,0.0006092993,0.000691197,0.0007247018,0.0002675318,0.00023247117,0.0023887572,0.00037138286,0.000020537962],"category_scores_gemma":[0.00014100455,0.00062297645,0.00022111317,0.0009439567,0.0004931167,0.00033417958,0.002895258,0.001406381,0.00022482255],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020317638,0.0024744978,0.28419065,0.0017336321,0.0018673962,0.005859374,0.028852897,0.0032605368,0.10273153,0.24517374,0.004330618,0.31749335],"study_design_scores_gemma":[0.006249811,0.0034646443,0.57566935,0.0033075956,0.00022724504,0.0006204119,0.001242102,0.022100734,0.047236044,0.2931532,0.037075408,0.009653453],"about_ca_topic_score_codex":0.0000744478,"about_ca_topic_score_gemma":0.00008038171,"teacher_disagreement_score":0.56794673,"about_ca_system_score_codex":0.00013399782,"about_ca_system_score_gemma":0.00019510032,"threshold_uncertainty_score":0.99962217},"labels":[],"label_agreement":null},{"id":"W1484691446","doi":"10.1016/j.tcs.2016.08.016","title":"The complexity of dominating set reconfiguration","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Dominating set; Mathematics; Discrete mathematics; Bipartite graph; Vertex (graph theory); Bounded function; Time complexity; Sequence (biology); Existential quantification; Maximal independent set; Split graph; Pathwidth; Graph; Line graph","score_opus":0.04426428454903826,"score_gpt":0.31935977987283914,"score_spread":0.2750954953238009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484691446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02336185,0.000015018659,0.9692996,0.004288799,0.0002889384,0.00015554248,0.0000020316027,0.00007958104,0.002508594],"genre_scores_gemma":[0.9195939,0.0000069187313,0.08026369,0.00006498636,0.000042034084,0.000006139303,1.0395656e-7,0.0000042384268,0.000018007371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759763,0.00027211936,0.00032005366,0.0004830846,0.0007888245,0.00053826725],"domain_scores_gemma":[0.9967221,0.0015569959,0.000121585785,0.001043247,0.0003990272,0.00015703475],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0038323998,0.000117634336,0.00014849224,0.00011888388,0.00070780393,0.00020227164,0.0034440698,0.000028058608,0.00002319916],"category_scores_gemma":[0.0005431488,0.000058353868,0.00005717654,0.001031274,0.015136472,0.00077871466,0.0009921949,0.00011655215,0.000038927024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009993165,0.000009516185,0.000016849759,0.0000019610377,0.0000017008581,0.0000010373748,0.00017499612,0.000004613526,0.008526814,0.8315347,0.0000107489395,0.15970708],"study_design_scores_gemma":[0.00017800448,0.00013450306,0.0005584643,0.000028778171,7.8964996e-7,0.000013805053,0.000009565657,0.07089428,0.056275997,0.87172824,0.00007937582,0.000098199016],"about_ca_topic_score_codex":9.642398e-7,"about_ca_topic_score_gemma":9.828897e-7,"teacher_disagreement_score":0.896232,"about_ca_system_score_codex":0.000053458956,"about_ca_system_score_gemma":0.0001084955,"threshold_uncertainty_score":0.98754376},"labels":[],"label_agreement":null},{"id":"W1484933608","doi":"10.46298/dmtcs.2084","title":"Toppling numbers of complete and random graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Random graph; Discrete mathematics; Wheel graph; Graph power; Line graph","score_opus":0.01691383692396501,"score_gpt":0.28482182467055134,"score_spread":0.2679079877465863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484933608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036849465,0.000025470412,0.95759815,0.0002875221,0.00013876513,0.00027085622,0.0000025519587,0.00010532678,0.0047218795],"genre_scores_gemma":[0.6086377,0.000004996301,0.3912442,0.00007738001,0.000016766397,0.0000061844544,3.9175114e-7,0.000008897868,0.0000034963834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698097,0.00016717345,0.0004995567,0.00071205694,0.0009937081,0.0006465644],"domain_scores_gemma":[0.99672097,0.0013677254,0.00016778284,0.0011711133,0.00023565926,0.0003367698],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034037095,0.00024367568,0.00046693778,0.00029384784,0.00037924922,0.00031639545,0.002507603,0.000051282965,0.0000170746],"category_scores_gemma":[0.00036491142,0.00019039381,0.00011157727,0.001168894,0.00504647,0.0005444368,0.0015439206,0.00022797287,0.00001404326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009682182,0.00003502154,0.000048773054,0.000057592108,0.000007284431,0.0000017803338,0.0009778265,0.00007744362,0.0019437639,0.9904145,0.0000037920013,0.0064225523],"study_design_scores_gemma":[0.0003235946,0.000080552876,0.000047287504,0.00004797508,0.000004278945,0.000019061083,0.000021765865,0.4514944,0.0012301055,0.54656947,0.00001870116,0.00014282594],"about_ca_topic_score_codex":0.0000016305702,"about_ca_topic_score_gemma":3.8826803e-7,"teacher_disagreement_score":0.57178825,"about_ca_system_score_codex":0.000016102793,"about_ca_system_score_gemma":0.00004351389,"threshold_uncertainty_score":0.99766123},"labels":[],"label_agreement":null},{"id":"W1488677252","doi":"10.37236/1972","title":"A Note on Graphs Without Short Even Cycles","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Chordal graph; Discrete mathematics","score_opus":0.01295528252795957,"score_gpt":0.29942992678122426,"score_spread":0.2864746442532647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488677252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37257332,0.004471406,0.60938513,0.009037843,0.0006676122,0.00035276543,7.096546e-7,0.0001060671,0.0034051645],"genre_scores_gemma":[0.9984826,0.0005540456,0.0003993925,0.00021921533,0.000099977435,0.0000032637186,1.153764e-7,0.000018394328,0.00022298815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974954,0.00026571483,0.00037713847,0.00018204903,0.0009056753,0.0007740036],"domain_scores_gemma":[0.9984031,0.00035727353,0.00020778955,0.00064300676,0.00025883396,0.00013003044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020885046,0.00017507485,0.0002585238,0.00026402174,0.00021677125,0.00008258622,0.0024228292,0.000057130852,0.000004266757],"category_scores_gemma":[0.00011889095,0.00011482433,0.00017894268,0.0008196352,0.00010040528,0.00049505907,0.00015630209,0.0012498285,0.000024154533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006732252,0.00013041362,0.00019963093,0.0000023388352,0.000044029668,0.0000083229825,0.000231898,0.00055126956,0.00040801862,0.98229146,0.00016788639,0.015897434],"study_design_scores_gemma":[0.0005275994,0.0009071783,0.000410687,0.000024494337,0.000012417971,0.00023910608,0.000016850809,0.0020669382,0.0047590053,0.98446906,0.0064201765,0.00014648978],"about_ca_topic_score_codex":9.499128e-7,"about_ca_topic_score_gemma":0.0000044282447,"teacher_disagreement_score":0.62590927,"about_ca_system_score_codex":0.0003756891,"about_ca_system_score_gemma":0.00040442732,"threshold_uncertainty_score":0.5429952},"labels":[],"label_agreement":null},{"id":"W1491439802","doi":"10.48550/arxiv.0907.3016","title":"Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Duality (order theory); Mathematics; Combinatorics; Discrete mathematics; Mathematical economics","score_opus":0.08347775112373572,"score_gpt":0.35168272865645356,"score_spread":0.2682049775327178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491439802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34852004,0.0006149923,0.64506656,0.0016023031,0.00041632436,0.0032152454,0.00014139675,0.00020795639,0.00021521526],"genre_scores_gemma":[0.80549175,0.00024956325,0.18753885,0.0010513117,0.00040234256,0.0027806214,0.00013629402,0.00010434667,0.0022448944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665445,0.00013002583,0.0005041774,0.0014799343,0.00037270444,0.000858718],"domain_scores_gemma":[0.9965925,0.0008489633,0.00028487443,0.0015757892,0.00039666082,0.00030121498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00135263,0.00047238835,0.0006345395,0.00023486912,0.00032626846,0.00025148335,0.0018645574,0.0003271434,0.0000101175765],"category_scores_gemma":[0.0005325977,0.00047586975,0.00025466707,0.00030328866,0.00029212996,0.00035378762,0.0015687487,0.00058684783,0.000018200204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018500566,0.002010959,0.1129351,0.005750621,0.0010876241,0.0002818508,0.00559888,0.0011174566,0.018003253,0.38154346,0.017622897,0.45219785],"study_design_scores_gemma":[0.004558897,0.00090106716,0.07558043,0.0005459387,0.00010516465,0.00005705693,0.00009261512,0.015300464,0.018770434,0.7474202,0.13421933,0.00244839],"about_ca_topic_score_codex":0.000024809142,"about_ca_topic_score_gemma":0.000023718574,"teacher_disagreement_score":0.45752767,"about_ca_system_score_codex":0.0001102036,"about_ca_system_score_gemma":0.00019092049,"threshold_uncertainty_score":0.9997693},"labels":[],"label_agreement":null},{"id":"W1491529421","doi":"10.1007/3-540-36379-3_25","title":"New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Vertex cover; Planar graph; Disjoint sets; Treewidth; Mathematics; Vertex (graph theory); Feedback vertex set; Bounded function; Time complexity; Constant (computer programming); Binary logarithm; Kernelization; Cover (algebra); Discrete mathematics; Parameterized complexity; Graph; Pathwidth; Computer science; Mathematical analysis; Line graph","score_opus":0.03020348838626619,"score_gpt":0.276874548479269,"score_spread":0.24667106009300283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491529421","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012960516,0.0015101831,0.9946804,0.00081686466,0.00072762894,0.00079965993,0.000049199,0.0001294894,0.0011569696],"genre_scores_gemma":[0.031238493,0.0011790654,0.96226406,0.0023180405,0.00043462866,0.00003256275,0.000024553474,0.000121386576,0.0023872366],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956509,0.000043453907,0.00042304216,0.0020250485,0.0009599702,0.00089757255],"domain_scores_gemma":[0.9965802,0.0015039996,0.00020171487,0.0011459981,0.00011981341,0.0004482834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006662608,0.0006593589,0.00064630626,0.0009428668,0.0003849442,0.00057950156,0.002072979,0.00032323756,0.000014969119],"category_scores_gemma":[0.000106140746,0.00059003086,0.00010585141,0.00047645334,0.0009429579,0.00057378825,0.00083827536,0.0008002855,0.000024274837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005715947,0.000025364807,0.000040293446,0.00008480083,0.000028932229,0.00010216488,0.00085440645,0.0042603067,0.00009926355,0.11876665,0.0003640182,0.8753166],"study_design_scores_gemma":[0.0009965223,0.00085423875,0.0001837294,0.00043230437,0.000010059014,0.00023893733,6.3162804e-7,0.26913968,0.0007812492,0.7235685,0.0029129074,0.0008812134],"about_ca_topic_score_codex":0.000019752451,"about_ca_topic_score_gemma":0.000018927649,"teacher_disagreement_score":0.8744354,"about_ca_system_score_codex":0.00012821365,"about_ca_system_score_gemma":0.00019377105,"threshold_uncertainty_score":0.9996551},"labels":[],"label_agreement":null},{"id":"W1491785597","doi":"10.1002/jgt.21850","title":"A Brooks‐Type Theorem for the Bichromatic Number","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Brooks' theorem; Perfect graph; Perfect graph theorem; Clique number; Extremal graph theory; Discrete mathematics; Graph; List coloring; Graph coloring; Chromatic scale; Graph power; Line graph; Voltage graph","score_opus":0.01930900589953868,"score_gpt":0.3015448466994069,"score_spread":0.28223584079986824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491785597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017890941,0.0006017946,0.97651,0.00093851076,0.0008158758,0.00023642955,0.0000010964469,0.000038062808,0.002967324],"genre_scores_gemma":[0.96853185,0.00008073181,0.029920109,0.0006584199,0.00028289374,0.000010790971,2.1206618e-7,0.000025408443,0.0004895925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978827,0.00062962685,0.00044763365,0.00017856686,0.0004914415,0.0003699867],"domain_scores_gemma":[0.99354225,0.004752371,0.0003886992,0.0007250108,0.0004564085,0.00013526733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065939636,0.00015832152,0.00028013118,0.0002052691,0.00028829474,0.00012887632,0.002160001,0.000058119174,0.000054206692],"category_scores_gemma":[0.0011927183,0.00008935916,0.00032802293,0.0006527014,0.00032925454,0.00043902968,0.00015521373,0.0003455375,0.000048129576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001622891,0.00004190198,0.00010918142,0.000017663202,0.00010051056,0.000004455321,0.00041976757,0.00009307415,0.0007232796,0.9675447,0.001093112,0.029690078],"study_design_scores_gemma":[0.0005782272,0.00031696964,0.000454096,0.000047712263,0.00002791972,0.00023191547,0.000111001056,0.002123853,0.0008330698,0.9879138,0.0072423667,0.00011905785],"about_ca_topic_score_codex":6.465224e-7,"about_ca_topic_score_gemma":8.689389e-7,"teacher_disagreement_score":0.9506409,"about_ca_system_score_codex":0.000024906933,"about_ca_system_score_gemma":0.0000853006,"threshold_uncertainty_score":0.40138552},"labels":[],"label_agreement":null},{"id":"W1492727213","doi":"10.1007/978-3-642-30347-0_4","title":"The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Combinatorics; Regular polygon; Graph; Planar graph; Computer science; Planar; Mathematics; Computer graphics (images); Geometry","score_opus":0.04097300087380767,"score_gpt":0.3051633410611392,"score_spread":0.2641903401873315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492727213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000290462,0.0018058685,0.9937869,0.00045911042,0.0012861491,0.0005793336,0.000009018637,0.00014298166,0.001640193],"genre_scores_gemma":[0.76510763,0.0003828077,0.23232564,0.00059230113,0.0005821431,0.000030474577,0.0000048954853,0.00009757176,0.0008765246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469334,0.00015066293,0.0007793044,0.0013463697,0.0016387171,0.0013915786],"domain_scores_gemma":[0.9925537,0.00405246,0.00060354505,0.0022090531,0.00035932634,0.00022190464],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025504304,0.0005978987,0.00067705393,0.0015058159,0.00059414835,0.00046527106,0.00689692,0.00031777186,0.000030446976],"category_scores_gemma":[0.0005263593,0.00040265647,0.0002094431,0.0022076077,0.0018274493,0.00075134804,0.0015660563,0.0012870702,0.000021493179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007842974,0.00003211438,0.00017660773,0.000058465816,0.000035541994,0.00009040796,0.0012690835,0.0030853464,0.0004952398,0.2303097,0.000019260351,0.7643498],"study_design_scores_gemma":[0.00080226327,0.0006078801,0.0006924074,0.0010835452,0.000024397053,0.00030605707,0.0000024567294,0.12755285,0.004654925,0.85593504,0.0068314294,0.0015067726],"about_ca_topic_score_codex":0.000009841397,"about_ca_topic_score_gemma":0.00012969498,"teacher_disagreement_score":0.7648172,"about_ca_system_score_codex":0.00025238626,"about_ca_system_score_gemma":0.00062085997,"threshold_uncertainty_score":0.9998425},"labels":[],"label_agreement":null},{"id":"W1493350325","doi":"10.1007/3-540-45071-8_55","title":"Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Parameterized complexity; Bounded function; Variable (mathematics); Computer science; Computational complexity theory; Time complexity; Satisfiability; Tree (set theory); Discrete mathematics; Combinatorics; Algorithm; Mathematics","score_opus":0.019886599099719942,"score_gpt":0.25577968761385705,"score_spread":0.23589308851413712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493350325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007752796,0.00045110588,0.99098134,0.00038570722,0.000779784,0.0008768023,0.000017208087,0.00024279252,0.005490001],"genre_scores_gemma":[0.048371725,0.000050084527,0.94479835,0.0020847693,0.0001904023,0.00006574945,0.000008488289,0.00011845833,0.0043119662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992184,0.000118735574,0.00075502385,0.0028627317,0.0021117271,0.001967811],"domain_scores_gemma":[0.9938618,0.0015766382,0.00056254276,0.002956231,0.00057311717,0.0004696487],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012924727,0.0010588476,0.0011112592,0.0012141094,0.0006748687,0.0014581375,0.005281017,0.0005483547,0.00009553285],"category_scores_gemma":[0.00028214246,0.00087652233,0.00015977291,0.0018156371,0.0016337541,0.0016450919,0.0012892338,0.0019256748,0.000059306105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033920762,0.00052279583,0.0023768218,0.0005535218,0.00022107818,0.001213497,0.0017172904,0.08034001,0.002288758,0.5567125,0.00035238577,0.3533621],"study_design_scores_gemma":[0.0011116178,0.00091013755,0.00027498291,0.0009797692,0.000024160503,0.00034937877,9.586668e-7,0.18441153,0.004753999,0.80022115,0.005044615,0.001917735],"about_ca_topic_score_codex":0.000033356217,"about_ca_topic_score_gemma":0.00016094596,"teacher_disagreement_score":0.35144436,"about_ca_system_score_codex":0.00056516065,"about_ca_system_score_gemma":0.0010925491,"threshold_uncertainty_score":0.9995784},"labels":[],"label_agreement":null},{"id":"W1493404814","doi":"10.1007/11600930_69","title":"Packing Trees in Communication Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University; University of Toronto","funders":"","keywords":"Linear programming relaxation; Integer programming; Steiner tree problem; Approximation algorithm; Solver; Relaxation (psychology); Spanning tree; Combinatorics; Linear programming; Time complexity; Block (permutation group theory); Set packing; Tree (set theory); Computer science; Multicast; Mathematics; Independent set; Graph; Set (abstract data type); Mathematical optimization","score_opus":0.02363825283242386,"score_gpt":0.2889289885727813,"score_spread":0.26529073574035744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493404814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064533466,0.002030969,0.9921197,0.0008973775,0.000385045,0.00037920888,0.0000011084654,0.0001370985,0.0039849286],"genre_scores_gemma":[0.5847639,0.0005348427,0.4129192,0.0010215774,0.00035152212,0.00002091805,0.000006838675,0.0000509165,0.00033031928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619746,0.00012151251,0.0005637784,0.0013242409,0.0009186648,0.0008743536],"domain_scores_gemma":[0.99587077,0.0010564127,0.00024505352,0.0024946225,0.0001812252,0.00015188944],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018560129,0.00045201875,0.00048693744,0.0013757792,0.0002587995,0.000481484,0.006169976,0.00033055723,0.00002000853],"category_scores_gemma":[0.000112685455,0.00044140354,0.000106099564,0.0012646917,0.0009886033,0.0010525731,0.002500079,0.001661389,0.000027645605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048164784,0.000018087043,0.000119298566,0.0000048373654,0.0000029918315,0.000030528776,0.0003759217,0.29427326,0.000021181912,0.06821102,0.0000045214024,0.6369335],"study_design_scores_gemma":[0.00020659615,0.000053776377,0.00034679347,0.0003632608,0.0000013427587,0.000024185434,1.7777913e-7,0.66007423,0.000106051055,0.33761513,0.00079752627,0.0004108939],"about_ca_topic_score_codex":0.000020191465,"about_ca_topic_score_gemma":0.0008388483,"teacher_disagreement_score":0.63652265,"about_ca_system_score_codex":0.00048551202,"about_ca_system_score_gemma":0.00028018668,"threshold_uncertainty_score":0.9998038},"labels":[],"label_agreement":null},{"id":"W1493471320","doi":"10.1002/jgt.20641","title":"On the hamiltonicity of line graphs of locally finite, 6‐edge‐connected graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Line graph; 1-planar graph; Indifference graph; Discrete mathematics; Chordal graph; Pathwidth; Block graph; Symmetric graph; Graph; Voltage graph","score_opus":0.03758313666899045,"score_gpt":0.27017101973377083,"score_spread":0.2325878830647804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493471320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68057764,0.0011994077,0.31260562,0.00020591164,0.0005254777,0.00034032305,0.000015480886,0.00004567407,0.004484501],"genre_scores_gemma":[0.99360377,0.00025293158,0.005821127,0.00022454259,0.000019766097,0.000004488142,3.99016e-7,0.00002318462,0.000049817652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599445,0.0011964267,0.0011433607,0.00029262295,0.00092687376,0.000446267],"domain_scores_gemma":[0.99252385,0.0036413667,0.0013341426,0.0011739256,0.0011320373,0.00019470681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00509205,0.00027947195,0.0006214451,0.001270718,0.00015308973,0.000024328052,0.0030744807,0.00013033852,0.00012814227],"category_scores_gemma":[0.0015410355,0.00017620734,0.0006976108,0.002313256,0.0011196423,0.00046374023,0.00027699088,0.0008447142,0.000005646608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091192196,0.0004690521,0.00049321,0.00003196053,0.00024985132,0.000039800783,0.0012110692,0.00019113263,0.0047204434,0.98681474,0.00012149309,0.0047453116],"study_design_scores_gemma":[0.00073881313,0.0017309464,0.0028457819,0.00018644801,0.00003382782,0.00004766255,0.00020155296,0.0002871353,0.048797358,0.9449374,0.000025981986,0.00016706903],"about_ca_topic_score_codex":0.0000077403265,"about_ca_topic_score_gemma":0.00000520863,"teacher_disagreement_score":0.31302613,"about_ca_system_score_codex":0.000019412571,"about_ca_system_score_gemma":0.00017294408,"threshold_uncertainty_score":0.71855265},"labels":[],"label_agreement":null},{"id":"W1496800439","doi":"10.1007/978-3-642-16926-7_24","title":"From Path Graphs to Directed Path Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Longest path problem; Induced path; Path (computing); Computer science; Block graph; Cograph; Combinatorics; Directed graph; Fast path; Induced subgraph isomorphism problem; Indifference graph; Pathwidth; Discrete mathematics; Mathematics; Algorithm; Graph; Chordal graph; Shortest path problem; Line graph; Voltage graph; Computer network","score_opus":0.015379193430134084,"score_gpt":0.26715536841971177,"score_spread":0.25177617498957766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496800439","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013329956,0.00037236643,0.9909019,0.00072639005,0.0031920418,0.0008555891,0.00005462054,0.0006771138,0.0018869732],"genre_scores_gemma":[0.08742216,0.00007254256,0.9090088,0.0023335542,0.0005530838,0.000052467538,0.00002390119,0.00011389459,0.000419592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99199516,0.00011900962,0.0007447738,0.0033748995,0.0022352387,0.0015309493],"domain_scores_gemma":[0.99327016,0.0012719397,0.00031980974,0.0037936482,0.000588828,0.00075564394],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001339468,0.0009787544,0.00091855135,0.002315605,0.0005494179,0.0008909411,0.008910813,0.0006536427,0.00008114106],"category_scores_gemma":[0.0003497502,0.00088988576,0.0003134904,0.0026559234,0.0014147378,0.0008796075,0.0035327822,0.0026006687,0.00018938637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004547512,0.00011214211,0.00022663389,0.00003458889,0.00004660429,0.00052858616,0.0026935402,0.0026446262,0.00894153,0.15723674,0.00010360203,0.8273859],"study_design_scores_gemma":[0.0003099284,0.00026832247,0.00038270035,0.00033992424,0.000007850098,0.0000326766,2.8705483e-7,0.031707697,0.0044157426,0.95829284,0.003098728,0.0011432825],"about_ca_topic_score_codex":0.00011710581,"about_ca_topic_score_gemma":0.00022279874,"teacher_disagreement_score":0.8262426,"about_ca_system_score_codex":0.00021487976,"about_ca_system_score_gemma":0.0006005503,"threshold_uncertainty_score":0.99970037},"labels":[],"label_agreement":null},{"id":"W1497440123","doi":"10.1007/978-3-540-39890-5_24","title":"On the Recognition of General Partition Graphs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Frequency partition of a graph; Discrete mathematics; Partition (number theory); Vertex (graph theory); Planar graph; Outerplanar graph; Pathwidth; Graph; Line graph; Graph power","score_opus":0.035032273226030246,"score_gpt":0.2766525167281121,"score_spread":0.24162024350208183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497440123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007450499,0.00012527066,0.99138486,0.0008275845,0.0007086677,0.0003989422,0.000007321544,0.000053096785,0.005749188],"genre_scores_gemma":[0.39463937,0.00029386216,0.59356636,0.009828403,0.00043025328,0.000092287904,0.000022999375,0.000112797854,0.001013681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969751,0.00012420272,0.00039091095,0.00095465616,0.0010615643,0.00049352075],"domain_scores_gemma":[0.99707514,0.0009687838,0.00025630495,0.0013058471,0.00029936238,0.00009456604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014110123,0.00032437232,0.00031072547,0.0007531429,0.00023237252,0.00016345273,0.002283031,0.00017972587,0.000047990026],"category_scores_gemma":[0.0002076078,0.00023527989,0.00014087757,0.00088320003,0.0010667645,0.00035851198,0.00041823508,0.0007400933,0.000040889532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010654312,0.000030468578,0.000006458968,0.000016205619,0.000008550289,0.000017586335,0.00017187714,0.0074695623,0.00043352784,0.67509747,0.00006067933,0.316677],"study_design_scores_gemma":[0.00011947466,0.00021724936,0.00001893431,0.00018634554,0.000002796771,0.00001845644,7.251791e-8,0.036660414,0.010542407,0.95176,0.00021534903,0.00025852074],"about_ca_topic_score_codex":0.000004655193,"about_ca_topic_score_gemma":0.000011816063,"teacher_disagreement_score":0.39781854,"about_ca_system_score_codex":0.00011669149,"about_ca_system_score_gemma":0.0001699153,"threshold_uncertainty_score":0.95944357},"labels":[],"label_agreement":null},{"id":"W1500269355","doi":"10.1007/978-3-642-54423-1_47","title":"Complexity of Coloring Graphs without Paths and Cycles","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Complete coloring; NP-complete; Discrete mathematics; Brooks' theorem; Time complexity; Chordal graph; Path (computing); Graph; 1-planar graph; Computer science; Graph power; Line graph","score_opus":0.03918416248615249,"score_gpt":0.2926025502794808,"score_spread":0.2534183877933283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500269355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021386892,0.00038453419,0.99460816,0.0002292767,0.0004656788,0.00036314936,0.0000056129447,0.00010401309,0.001700866],"genre_scores_gemma":[0.63476676,0.00006320635,0.36476588,0.00021469429,0.00008148852,0.0000063717553,0.0000013806123,0.000026248683,0.00007398993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633795,0.00007880528,0.00050328014,0.0013857249,0.001039925,0.00065430027],"domain_scores_gemma":[0.99705845,0.00070507533,0.00032724912,0.0014071707,0.00028749785,0.00021455863],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014163253,0.0004491106,0.00070470513,0.0010224055,0.0002523405,0.00022582586,0.003027539,0.00021512009,0.0000071653],"category_scores_gemma":[0.00013598852,0.00040814865,0.00010924885,0.0006260164,0.003972793,0.00040155085,0.002185204,0.0007501186,0.000006556627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012879339,0.00001561569,0.0008696947,0.000087798304,0.0000114124905,0.000020709776,0.0004330286,0.002393807,0.0005104698,0.62441045,0.0000016814779,0.37123242],"study_design_scores_gemma":[0.00025494085,0.00021971026,0.0008625105,0.00031789608,0.0000043387267,0.000045411954,1.8579225e-7,0.1321373,0.0023700676,0.86317134,0.00018583129,0.00043044265],"about_ca_topic_score_codex":0.000017522416,"about_ca_topic_score_gemma":0.000067181194,"teacher_disagreement_score":0.632628,"about_ca_system_score_codex":0.000090180445,"about_ca_system_score_gemma":0.00021300698,"threshold_uncertainty_score":0.99983704},"labels":[],"label_agreement":null},{"id":"W1500859847","doi":"10.37236/826","title":"New Infinite Families of Almost-Planar Crossing-Critical Graphs","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Combinatorics; Degree (music); Planar graph; Chordal graph; 1-planar graph; Planar; Indifference graph; Simple (philosophy); Crossing number (knot theory); Clique-sum; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.017154063795545682,"score_gpt":0.28502763383726015,"score_spread":0.26787357004171447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500859847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25112352,0.009241042,0.73588336,0.002036657,0.0006139817,0.00013096828,0.0000011498869,0.00004114422,0.0009281922],"genre_scores_gemma":[0.9969815,0.00134963,0.0013171931,0.00007619506,0.000046139896,8.3342553e-7,1.7988249e-7,0.000014246743,0.0002140678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741286,0.00024709798,0.00054533465,0.00015523333,0.00089664344,0.000742851],"domain_scores_gemma":[0.99744165,0.00096573896,0.00031039774,0.0005559331,0.0005523042,0.00017399342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012326408,0.00016638423,0.0003502968,0.00030604337,0.00038790694,0.00007011438,0.002093751,0.00006743387,0.0000066186035],"category_scores_gemma":[0.00045028643,0.00011776779,0.00019434067,0.0013466041,0.0005653173,0.0005590812,0.0001415006,0.0010126138,0.0000064590663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000626801,0.00008102174,0.00048896606,0.000008242744,0.000048882044,0.000041264484,0.0008173651,0.000046671026,0.00073051674,0.99546224,0.00047805195,0.0017341173],"study_design_scores_gemma":[0.00068138493,0.000945649,0.00064498297,0.00002578886,0.000013627739,0.0010271218,0.00006627478,0.00015331192,0.004537597,0.98881173,0.0029693171,0.0001232345],"about_ca_topic_score_codex":0.00001211976,"about_ca_topic_score_gemma":0.0000021253288,"teacher_disagreement_score":0.745858,"about_ca_system_score_codex":0.00012282362,"about_ca_system_score_gemma":0.0016612522,"threshold_uncertainty_score":0.48024312},"labels":[],"label_agreement":null},{"id":"W1500986313","doi":"10.46298/dmtcs.574","title":"Adaptive Identification of Sets of Vertices in Graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Identification (biology); Hamming distance; Combinatorics; Computer science; Discrete mathematics; Mathematics; Metric dimension; Chordal graph; Graph; 1-planar graph","score_opus":0.025401469451309618,"score_gpt":0.31525980717988045,"score_spread":0.28985833772857084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500986313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18319906,0.00006421571,0.8153595,0.0000626065,0.00013819033,0.00022584134,0.0000035983724,0.000029792649,0.0009172063],"genre_scores_gemma":[0.7749598,0.0000049392884,0.22499683,0.000012907942,0.000007833052,0.00000899163,3.9575747e-7,0.0000066872663,0.000001578517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710405,0.00016020809,0.00071552745,0.00039203698,0.0010293184,0.00059888064],"domain_scores_gemma":[0.9976052,0.00063480064,0.00029077745,0.0010040032,0.00027149182,0.00019372157],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0037238628,0.000165978,0.00033179738,0.0005011636,0.000096787764,0.000070630995,0.0024177553,0.000048572485,0.000012386401],"category_scores_gemma":[0.00029526133,0.00013480824,0.000091046255,0.0022261431,0.0031178603,0.0012779776,0.00090714573,0.00016813146,0.000012417051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008616272,0.00018826577,0.00044657622,0.00005553935,0.000005547181,8.633513e-7,0.0035628916,0.00009449223,0.0060159103,0.9866496,0.0000011403838,0.002970587],"study_design_scores_gemma":[0.00012165222,0.00007854776,0.0018837176,0.00006792058,0.0000042067663,0.000005357201,0.000113125745,0.352016,0.031788968,0.6138028,6.2187064e-7,0.00011712127],"about_ca_topic_score_codex":0.0000019063152,"about_ca_topic_score_gemma":4.025485e-7,"teacher_disagreement_score":0.59176075,"about_ca_system_score_codex":0.000031546588,"about_ca_system_score_gemma":0.00006527284,"threshold_uncertainty_score":0.9995951},"labels":[],"label_agreement":null},{"id":"W1501033600","doi":"","title":"Some Structural Properties of a Least Central Subtree of a Tree","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Cardinality (data modeling); Tree (set theory); Mathematics; Graph; Set (abstract data type); Discrete mathematics; Computer science; Data mining","score_opus":0.05119654889255751,"score_gpt":0.3449830083518981,"score_spread":0.29378645945934057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501033600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98533744,0.000319918,0.012133606,0.00085339963,0.00025267343,0.00068339426,0.000022719698,0.000048105856,0.00034874535],"genre_scores_gemma":[0.9628032,0.000030551735,0.036396075,0.000007024809,0.00014547628,0.00006598847,0.0000037793018,0.000014518114,0.0005334012],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970335,0.00033903524,0.00039780806,0.00041010426,0.0011214663,0.0006980977],"domain_scores_gemma":[0.99750483,0.00013402554,0.000033304463,0.0010501444,0.0011019525,0.0001757671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011133895,0.00013545403,0.00023872934,0.0006027038,0.00033554598,0.00012885737,0.0018082934,0.000088223846,0.000055713255],"category_scores_gemma":[0.00047882958,0.00010872841,0.00008414231,0.0012766933,0.00097029714,0.0011330257,0.0006081438,0.0008088827,0.00002240719],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035677433,0.00010397,0.00037701786,0.00004309205,0.000031292664,0.0000063039674,0.0015247178,0.0004966129,0.6432672,0.3298094,0.000041331583,0.02426337],"study_design_scores_gemma":[0.0011491431,0.0004746956,0.0063678203,0.0000625521,0.0000048885136,0.00005472284,0.0005945102,0.40427572,0.5669095,0.019623801,0.00017405956,0.00030858867],"about_ca_topic_score_codex":0.00040158757,"about_ca_topic_score_gemma":0.00049625785,"teacher_disagreement_score":0.4037791,"about_ca_system_score_codex":0.00003975552,"about_ca_system_score_gemma":0.0007135382,"threshold_uncertainty_score":0.4433816},"labels":[],"label_agreement":null},{"id":"W1502166895","doi":"10.46298/dmtcs.387","title":"Complexity results on graphs with few cliques","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Split graph; Discrete mathematics; Clique graph; Vertex cover; Clique-sum; Indifference graph; Cograph; Vertex (graph theory); Clique problem; Block graph; Time complexity; Treewidth; Pathwidth; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.03449243138924327,"score_gpt":0.3270042868670117,"score_spread":0.2925118554777685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502166895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022990964,0.000010639328,0.94773984,0.0009867678,0.00018113643,0.00045506287,0.000008461638,0.00042287525,0.027204257],"genre_scores_gemma":[0.5590756,0.000002596575,0.44052863,0.0003153126,0.000038175538,0.000006193249,0.0000016779433,0.000016761045,0.000015055797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99426067,0.00015570909,0.00069226633,0.0013183173,0.0021554895,0.0014175375],"domain_scores_gemma":[0.9948223,0.001533684,0.0002243207,0.0022945467,0.0004564201,0.0006686974],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0064311386,0.00043145297,0.0004540375,0.0005878769,0.00081028324,0.00071539613,0.004576282,0.000084943924,0.000018792489],"category_scores_gemma":[0.00034757884,0.0002946996,0.00013399475,0.002814007,0.008238183,0.0008272029,0.0013449711,0.0005611336,0.000100758516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011799014,0.00017235485,0.000017081402,0.000023836234,0.000010807905,0.00006436227,0.0010648898,0.00005209654,0.00021900232,0.99298483,0.00002905834,0.0052436697],"study_design_scores_gemma":[0.0005021701,0.0009561367,0.00035791297,0.00014370991,0.0000054424495,0.000071820585,0.000055895813,0.12780574,0.0064978185,0.86311483,0.000064249056,0.00042425955],"about_ca_topic_score_codex":0.0000023439804,"about_ca_topic_score_gemma":0.0000045177107,"teacher_disagreement_score":0.53608465,"about_ca_system_score_codex":0.00008940708,"about_ca_system_score_gemma":0.00012737836,"threshold_uncertainty_score":0.9999505},"labels":[],"label_agreement":null},{"id":"W1506582321","doi":"10.1002/jgt.21667","title":"Forbidden Induced Subgraphs for Toughness","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Line graph; Discrete mathematics; Distance-hereditary graph; Voltage graph; Cubic graph; Symmetric graph","score_opus":0.0403595477434291,"score_gpt":0.3240029276503742,"score_spread":0.2836433799069451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506582321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31425586,0.0016662,0.6809027,0.00030197095,0.0014781334,0.00027594142,0.0000032079188,0.00004626785,0.0010696684],"genre_scores_gemma":[0.9749621,0.000047973423,0.024247099,0.00021019959,0.00036066055,0.000015210406,4.03917e-7,0.000023167882,0.00013314257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997884,0.00033546597,0.00048154197,0.00016740849,0.0004903092,0.0006412819],"domain_scores_gemma":[0.9973117,0.0010029229,0.0004123476,0.0005133123,0.00043088416,0.00032882436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004822924,0.00017482456,0.00032227067,0.000714671,0.0001826226,0.00007929081,0.0015732613,0.00009526209,0.00001595633],"category_scores_gemma":[0.00040859624,0.00013673618,0.00042316958,0.00082088384,0.000118428,0.0018048852,0.00015964257,0.00036182097,0.000008877517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022928539,0.00014426831,0.0012235316,0.00002122277,0.000098937126,0.0000076977985,0.0008410991,0.0000065875993,0.006744902,0.96810776,0.00046662535,0.022108095],"study_design_scores_gemma":[0.00086114905,0.00039406508,0.002252903,0.000036529207,0.00002233559,0.00018747491,0.00021468167,0.000027221455,0.02177295,0.97122097,0.0028028341,0.00020690315],"about_ca_topic_score_codex":5.827218e-7,"about_ca_topic_score_gemma":5.3224574e-7,"teacher_disagreement_score":0.6607063,"about_ca_system_score_codex":0.000037162183,"about_ca_system_score_gemma":0.00008381745,"threshold_uncertainty_score":0.55759394},"labels":[],"label_agreement":null},{"id":"W150683057","doi":"","title":"On line graphs which are weakly maximal clique irreducible.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Combinatorics; Line (geometry); Clique-sum; Clique number; Chordal graph; Discrete mathematics; Graph; 1-planar graph; Geometry","score_opus":0.021942974181400923,"score_gpt":0.29408166444763506,"score_spread":0.27213869026623416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150683057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9605863,0.0004549073,0.009310444,0.009874311,0.0031267565,0.00069614354,0.00001098104,0.00089791964,0.015042216],"genre_scores_gemma":[0.9931853,0.00004636062,0.005405746,0.0005548154,0.000027103659,0.000048344402,0.0000038454405,0.000034021334,0.000694486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972338,0.00021920321,0.00033227578,0.0008119466,0.0006704439,0.000732311],"domain_scores_gemma":[0.99742097,0.0003425724,0.00014057888,0.0014767532,0.00032921525,0.0002898864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074089493,0.00028574953,0.0002949788,0.00037653733,0.0002581135,0.00017005356,0.0018232943,0.00014336266,0.000050940955],"category_scores_gemma":[0.00030240745,0.00027783826,0.0001181743,0.0017087634,0.00010413363,0.00074440136,0.00043720842,0.00063826545,0.0005825668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045976383,0.00030784408,0.00040356172,0.000009268182,0.000019383417,0.000025217534,0.00012292665,0.00048394865,0.00040839595,0.98904246,0.0023946287,0.006736367],"study_design_scores_gemma":[0.00082075386,0.00043716645,0.0015121957,0.00004819608,0.0000035381943,0.000017617776,0.00001871709,0.005361911,0.006933273,0.981033,0.0034775157,0.00033606356],"about_ca_topic_score_codex":0.000006980256,"about_ca_topic_score_gemma":0.000018590516,"teacher_disagreement_score":0.032598954,"about_ca_system_score_codex":0.00011585956,"about_ca_system_score_gemma":0.00011286573,"threshold_uncertainty_score":0.9999674},"labels":[],"label_agreement":null},{"id":"W1507564261","doi":"10.1007/978-3-540-39890-5_11","title":"A Simple Linear Time LexBFS Cograph Recognition Algorithm","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Lexicographical order; Simple (philosophy); Algorithm; Complement (music); Cograph; Time complexity; Graph; Theoretical computer science; Combinatorics; Mathematics; Pathwidth; Line graph","score_opus":0.023456181181346864,"score_gpt":0.27916664467076174,"score_spread":0.2557104634894149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507564261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021055945,0.00038896172,0.99405324,0.00029080384,0.00076085876,0.00063055335,0.000030093259,0.00037555417,0.003448851],"genre_scores_gemma":[0.0017249779,0.00012432919,0.9943871,0.0023821336,0.00043134633,0.000030011668,0.00003996177,0.00008544026,0.0007947316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99439895,0.00012859334,0.00060460385,0.002181676,0.0015208008,0.0011653954],"domain_scores_gemma":[0.99616385,0.0007711936,0.00029968412,0.0018569186,0.00056667795,0.00034170636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016302635,0.00068786537,0.0006542537,0.0017612093,0.00045911252,0.00046629898,0.0036950193,0.00043159391,0.00010281923],"category_scores_gemma":[0.00018809349,0.000668362,0.0002448039,0.0017996524,0.001307671,0.0009816716,0.0012610921,0.001380094,0.0004742861],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006704635,0.000037864564,0.000005351858,0.000018734201,0.000016474158,0.000114606984,0.0002041162,0.003070214,0.00015130738,0.0029536872,0.00009668587,0.9933243],"study_design_scores_gemma":[0.00029520737,0.00024332474,0.0000058563323,0.00015455513,0.000006311939,0.00010856146,1.1506181e-7,0.41262722,0.0018056426,0.57914114,0.0048366087,0.00077546766],"about_ca_topic_score_codex":0.000009591406,"about_ca_topic_score_gemma":0.000011939979,"teacher_disagreement_score":0.99254876,"about_ca_system_score_codex":0.0002688962,"about_ca_system_score_gemma":0.0004264485,"threshold_uncertainty_score":0.99957675},"labels":[],"label_agreement":null},{"id":"W1508755082","doi":"10.1006/jctb.2000.2009","title":"High-Girth Graphs Avoiding a Minor are Nearly Bipartite","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Triangle-free graph; Odd graph; Discrete mathematics; Bipartite graph; Homomorphism; 1-planar graph; Planar graph; Girth (graph theory); Foster graph; Graph homomorphism; Graph power; Graph minor; Graph; Line graph","score_opus":0.015223306658726087,"score_gpt":0.2601376903989754,"score_spread":0.2449143837402493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508755082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9015137,0.0011262457,0.08158923,0.0014675941,0.012510814,0.00027100937,0.00000478037,0.0001555203,0.0013611126],"genre_scores_gemma":[0.9937727,0.00022558653,0.0046140086,0.00012080235,0.00064092997,0.0000056275967,4.514641e-7,0.000028778284,0.0005911194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965487,0.0009847104,0.0007013171,0.0002962436,0.00088096806,0.00058804784],"domain_scores_gemma":[0.9968415,0.0007414015,0.000754803,0.00066519395,0.0006608387,0.00033629485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003241265,0.00026861668,0.00053860684,0.0005087175,0.00042844884,0.00036576888,0.0018790337,0.00011827641,0.00008122691],"category_scores_gemma":[0.00086347235,0.00022750116,0.00028852018,0.001278366,0.00029087573,0.0028196455,0.00032871918,0.00081384764,0.000028936303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010786224,0.00014077035,0.0009908213,0.000011545197,0.000084316765,0.0004154128,0.00050475256,0.0000713761,0.0023402781,0.99133974,0.00037536884,0.0026469775],"study_design_scores_gemma":[0.0015067587,0.0009006848,0.00070745416,0.00007161105,0.0000140414795,0.00038762589,0.00032229023,0.000026592796,0.005083642,0.9774129,0.013311934,0.0002544577],"about_ca_topic_score_codex":0.0000030949268,"about_ca_topic_score_gemma":0.0000017002183,"teacher_disagreement_score":0.092259,"about_ca_system_score_codex":0.000088139175,"about_ca_system_score_gemma":0.00014826718,"threshold_uncertainty_score":0.9277228},"labels":[],"label_agreement":null},{"id":"W1509672730","doi":"10.37236/635","title":"Toughness of $K_{a,t}$-Minor-free Graphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Simon Fraser University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Omega; Graph; Discrete mathematics; Physics","score_opus":0.020393673663520264,"score_gpt":0.25172823739228267,"score_spread":0.2313345637287624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509672730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38498017,0.007853591,0.5980558,0.00072137185,0.0011695642,0.00028600026,0.0000012513864,0.00005462832,0.006877657],"genre_scores_gemma":[0.99870914,0.00050437386,0.00052998355,0.000033232995,0.000025320322,0.0000023216785,7.42878e-8,0.000014438486,0.00018109873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976262,0.00028524367,0.0005118327,0.00014944794,0.0007494447,0.00067786686],"domain_scores_gemma":[0.99739647,0.0002876455,0.00056108786,0.001081589,0.0005665313,0.00010667739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022388054,0.00015485071,0.000315438,0.00027550722,0.000119030534,0.00002512973,0.0048302338,0.000059477723,0.00001459509],"category_scores_gemma":[0.00021280615,0.000104516046,0.0002022777,0.0012696573,0.00020253882,0.0005065371,0.0004083188,0.00082250073,0.0000047103017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000678625,0.00015688772,0.00033469877,0.000009090494,0.00007181664,0.000013747198,0.0007194641,0.000008341873,0.00036512356,0.9963575,0.00014032755,0.0017551404],"study_design_scores_gemma":[0.00074036233,0.0009774682,0.0006045122,0.000018089628,0.00001859966,0.00018906326,0.000080340586,0.0000720658,0.015298488,0.9813971,0.0004945587,0.000109335786],"about_ca_topic_score_codex":0.0000067608053,"about_ca_topic_score_gemma":0.0000027899412,"teacher_disagreement_score":0.613729,"about_ca_system_score_codex":0.000120311735,"about_ca_system_score_gemma":0.0004680001,"threshold_uncertainty_score":0.89758563},"labels":[],"label_agreement":null},{"id":"W1509794588","doi":"10.5555/1496770.1496898","title":"A nearly linear time algorithm for the half integral parity disjoint paths packing problem","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Disjoint sets; Ackermann function; Mathematics; Time complexity; Parity (physics); Binary logarithm; Vertex (graph theory); Discrete mathematics; Approximation algorithm; Inverse; Algorithm; Graph; Physics","score_opus":0.01650779417379294,"score_gpt":0.2897351951554409,"score_spread":0.27322740098164794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509794588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028219406,0.000266261,0.9848246,0.010546347,0.00035985274,0.0017258164,0.000097923235,0.00045472593,0.0014422812],"genre_scores_gemma":[0.043701474,0.00021586783,0.9476577,0.0022447645,0.0012616548,0.00069832423,0.00009006953,0.000142889,0.003987258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589074,0.0002651602,0.0005596132,0.0011355896,0.0009180244,0.0012308792],"domain_scores_gemma":[0.9968549,0.00070464244,0.00021357399,0.0016102172,0.00029294347,0.00032373655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014622061,0.00051972107,0.00047246763,0.0002058596,0.0007956898,0.0005705699,0.00243204,0.00016969742,0.000018424878],"category_scores_gemma":[0.000100272606,0.00034660145,0.00042595234,0.00086304604,0.00027409816,0.0008985559,0.00039538814,0.00075394486,0.00015410793],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084937485,0.00024779656,0.000012108878,0.000017743341,0.00009700379,0.000044190478,0.0012261769,0.0007224966,0.0027332308,0.05553354,0.0007680358,0.93851274],"study_design_scores_gemma":[0.0010032144,0.0017627903,0.00022414664,0.000100047146,0.000028084629,0.00003823431,0.00007657231,0.9192542,0.004316478,0.06303423,0.00953118,0.00063081307],"about_ca_topic_score_codex":0.000040122726,"about_ca_topic_score_gemma":0.0000052956625,"teacher_disagreement_score":0.93788195,"about_ca_system_score_codex":0.00014965865,"about_ca_system_score_gemma":0.00013590777,"threshold_uncertainty_score":0.9998986},"labels":[],"label_agreement":null},{"id":"W1509846055","doi":"10.1007/978-3-642-30347-0_9","title":"Conflict-Free Graph Orientations with Parity Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multigraph; Combinatorics; Disjoint sets; Vertex (graph theory); Parity (physics); Mixed graph; Computer science; Graph; Discrete mathematics; Mathematics; Line graph; Voltage graph; Physics","score_opus":0.028985400351798023,"score_gpt":0.28937606847839104,"score_spread":0.260390668126593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509846055","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007822944,0.0005470629,0.9897763,0.00053895504,0.0007793686,0.0005996966,0.000023701326,0.00021633727,0.0074403565],"genre_scores_gemma":[0.16555715,0.00011290152,0.8320665,0.0012648731,0.0003917732,0.0000424722,0.000013748929,0.00007022261,0.00048037845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99509853,0.00007353816,0.0004681618,0.0015903588,0.0015984823,0.0011709266],"domain_scores_gemma":[0.9950069,0.0008498187,0.00028521783,0.0029150634,0.00050370244,0.00043929482],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011868671,0.0005983156,0.0005476181,0.001149517,0.0004642574,0.00048114534,0.005857232,0.00028417323,0.00008543699],"category_scores_gemma":[0.00016304902,0.0005039519,0.00012464053,0.0012899745,0.004511765,0.0012048462,0.0020190224,0.0012935951,0.00006868331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017510325,0.000057902682,0.00045856962,0.000033563014,0.00002965348,0.000114493436,0.0011232392,0.0036884476,0.000082058854,0.5731988,0.000028940987,0.42116684],"study_design_scores_gemma":[0.0009794858,0.00037546078,0.00054924696,0.00034474034,0.000018852883,0.00033635396,9.3304806e-7,0.016686855,0.0015041479,0.97448575,0.0034288503,0.0012893304],"about_ca_topic_score_codex":0.000013519805,"about_ca_topic_score_gemma":0.00009033129,"teacher_disagreement_score":0.4198775,"about_ca_system_score_codex":0.00022075795,"about_ca_system_score_gemma":0.00071649987,"threshold_uncertainty_score":0.9997412},"labels":[],"label_agreement":null},{"id":"W1510083871","doi":"10.1007/978-3-642-12200-2_4","title":"Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kernelization; Dominating set; Connected dominating set; Combinatorics; Planar graph; Planar; Mathematics; Limit (mathematics); Graph; Set (abstract data type); Reduction (mathematics); Computer science; Kernel (algebra); Discrete mathematics; Vertex (graph theory)","score_opus":0.03497057844501919,"score_gpt":0.30016189911650626,"score_spread":0.2651913206714871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510083871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037968965,0.00011225745,0.99403214,0.0017486487,0.0014475349,0.001143723,0.00006792304,0.00025446166,0.0008135918],"genre_scores_gemma":[0.18594895,0.000025932168,0.80895716,0.0035668402,0.00073326455,0.00008553884,0.000026428945,0.000095031624,0.00056086667],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947772,0.000073876465,0.0006015364,0.0022768097,0.0012219037,0.0010486512],"domain_scores_gemma":[0.9928815,0.0036391434,0.00043653633,0.0018972469,0.0008712501,0.0002743341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019324678,0.00065856316,0.0007279547,0.0010681492,0.00069292885,0.0006841018,0.004331603,0.00057853706,0.000041000385],"category_scores_gemma":[0.00102307,0.00063788006,0.00021136152,0.00096574286,0.0011643674,0.00088018156,0.001170421,0.0014654315,0.00003261302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011926622,0.00007572606,0.00010881881,0.00020548984,0.000054356427,0.00012101895,0.003422248,0.005544444,0.0072634327,0.34647748,0.00007918637,0.63652855],"study_design_scores_gemma":[0.00075256004,0.00030054236,0.0000573573,0.0002452583,0.000008997094,0.00008378276,4.2642952e-7,0.40710476,0.026865715,0.56086165,0.0028539144,0.00086505857],"about_ca_topic_score_codex":0.000011839451,"about_ca_topic_score_gemma":0.00012441656,"teacher_disagreement_score":0.63566345,"about_ca_system_score_codex":0.0002531137,"about_ca_system_score_gemma":0.00067062426,"threshold_uncertainty_score":0.99960726},"labels":[],"label_agreement":null},{"id":"W1512105312","doi":"10.1016/j.disc.2015.12.030","title":"Bounds on the maximum number of minimum dominating sets","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka","keywords":"Mathematics; Combinatorics; Lexicographical order; Domination analysis; Dominating set; Graph; Discrete mathematics; Upper and lower bounds; Vertex (graph theory)","score_opus":0.028074880962659372,"score_gpt":0.3196065664226326,"score_spread":0.2915316854599732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512105312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28012332,0.000016644666,0.672994,0.0035043715,0.00014275534,0.00037987233,0.000017332788,0.000102789774,0.042718884],"genre_scores_gemma":[0.9342506,0.0000063602342,0.06459745,0.00008761269,0.000019964167,0.000027849459,3.958904e-7,0.000020410227,0.0009893375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985165,0.00010327815,0.0003100261,0.00023083437,0.0005164733,0.00032286096],"domain_scores_gemma":[0.9969485,0.0016725782,0.00018429432,0.0010392469,0.00009340781,0.000061971616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008388602,0.0001440268,0.00019239307,0.00005685752,0.00012327779,0.00006489069,0.0012267691,0.000042565913,0.00009695426],"category_scores_gemma":[0.0005500462,0.0000686519,0.00009924731,0.00030291322,0.00023228445,0.00021229124,0.00036457446,0.00010543352,0.00022928986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061693186,0.00004892703,0.00010165717,0.000043727658,0.00001880603,0.0000045165757,0.0013016865,0.0000014574007,0.0031427918,0.9857979,0.00023534737,0.009297058],"study_design_scores_gemma":[0.00026999443,0.000058057783,0.000062818195,0.00021373988,0.000004384318,0.000016190905,0.00027471533,0.004320797,0.016735153,0.977594,0.00030122726,0.00014888594],"about_ca_topic_score_codex":7.6083563e-7,"about_ca_topic_score_gemma":5.7256165e-7,"teacher_disagreement_score":0.6541273,"about_ca_system_score_codex":0.000027332935,"about_ca_system_score_gemma":0.000028157987,"threshold_uncertainty_score":0.29471338},"labels":[],"label_agreement":null},{"id":"W1512371449","doi":"10.1016/j.jctb.2015.11.002","title":"On Rota's Conjecture and nested separations in matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Conjecture; Combinatorics; Mathematics; Nested set model; Computer science; Programming language","score_opus":0.01714138966048585,"score_gpt":0.2926170667063513,"score_spread":0.27547567704586545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512371449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95377004,0.0006961453,0.032879047,0.0022983665,0.0055753505,0.00033810947,0.0000033859187,0.000058872218,0.0043806536],"genre_scores_gemma":[0.99758714,0.000018684737,0.0019599693,0.00007997731,0.00016369698,0.0000034060956,3.5547856e-7,0.000009635415,0.00017713467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983589,0.00053298334,0.00034090312,0.00014150243,0.00041513875,0.00021058954],"domain_scores_gemma":[0.9985974,0.00047349895,0.00019507723,0.0002738315,0.0002619997,0.00019822436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018238737,0.00012718725,0.00026519594,0.00028588308,0.00007129722,0.00013289497,0.0005650227,0.00007594596,0.000008260281],"category_scores_gemma":[0.00067051285,0.00010255538,0.00005191424,0.00047378376,0.00014749913,0.0010232141,0.00012907796,0.00041522784,0.0000048451393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000711739,0.000067054454,0.00016468624,0.0000035787677,0.000013596829,0.00007950297,0.00083024916,0.00024156338,0.00018153325,0.99662757,0.0003147984,0.0007641076],"study_design_scores_gemma":[0.0017648953,0.0013692558,0.00022645539,0.000030243767,0.00000339769,0.00021623199,0.00020845108,0.0000801242,0.0009905241,0.99230963,0.0026965113,0.00010429271],"about_ca_topic_score_codex":0.0000012450439,"about_ca_topic_score_gemma":0.0000018079328,"teacher_disagreement_score":0.04381707,"about_ca_system_score_codex":0.000075513904,"about_ca_system_score_gemma":0.0002008374,"threshold_uncertainty_score":0.4182087},"labels":[],"label_agreement":null},{"id":"W1513274608","doi":"10.1007/s00453-016-0159-2","title":"On the Parameterized Complexity of Reconfiguration Problems","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); University of Waterloo","funders":"","keywords":"Control reconfiguration; Parameterized complexity; Vertex cover; Vertex (graph theory); Combinatorics; Kernelization; Mathematics; Theory of computation; Bounded function; Maximization; Sequence (biology); Discrete mathematics; Graph; Computer science; Algorithm; Mathematical optimization","score_opus":0.06819916082681735,"score_gpt":0.28743081139528687,"score_spread":0.21923165056846952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513274608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031245187,0.000011574357,0.95824814,0.0078083174,0.00010449378,0.00034712724,0.000009284251,0.00007471213,0.0021511891],"genre_scores_gemma":[0.9706555,0.000007897918,0.028847754,0.00014699787,0.00001975308,0.00004313042,7.6607347e-7,0.000006829226,0.00027139648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896055,0.0001935939,0.00017440542,0.00022836543,0.00024889654,0.00019421376],"domain_scores_gemma":[0.9983143,0.00080473087,0.00009091672,0.00065685,0.0000922219,0.000040958028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004624395,0.00007890535,0.000112124384,0.000058770624,0.00008034973,0.00002609658,0.00078237365,0.00002804183,0.00007664775],"category_scores_gemma":[0.00020183537,0.000038674898,0.00005046581,0.00025068354,0.0002997344,0.00020094846,0.00010006445,0.00007607529,0.00008882348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014031987,0.00003192487,0.0000047961785,0.0000030549004,0.000010702789,8.192916e-7,0.000077706856,0.0000031424595,0.038890682,0.84024364,0.00017311245,0.120546415],"study_design_scores_gemma":[0.000297244,0.00018606102,0.00025424312,0.000033932305,0.0000010846196,0.0000037464717,0.000004800368,0.005206156,0.099484235,0.8937508,0.0006960735,0.0000816204],"about_ca_topic_score_codex":0.0000052492246,"about_ca_topic_score_gemma":0.0000014158175,"teacher_disagreement_score":0.93941027,"about_ca_system_score_codex":0.00002074294,"about_ca_system_score_gemma":0.00002533866,"threshold_uncertainty_score":0.15771167},"labels":[],"label_agreement":null},{"id":"W1514238746","doi":"10.1007/978-3-540-68552-4_7","title":"Computing Branch Decomposition of Large Planar Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Time complexity; Pathwidth; Subroutine; Mathematics; Planar; Book embedding; Algorithm; Combinatorics; Modular decomposition; Graph; Discrete mathematics; Computer science; Line graph","score_opus":0.016986563573989203,"score_gpt":0.29362713107242466,"score_spread":0.27664056749843546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514238746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009998789,0.0008328586,0.9942888,0.00018672094,0.00083635066,0.0004301898,0.000015675163,0.00016556091,0.0022439845],"genre_scores_gemma":[0.6103906,0.00017008539,0.38849914,0.00059130834,0.00019352954,0.000003937973,0.000013482721,0.000049694332,0.000088212844],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499106,0.000090680005,0.00075904845,0.0015994977,0.001539887,0.0010197966],"domain_scores_gemma":[0.9963577,0.0008776648,0.00046315798,0.0016601292,0.00041983355,0.0002215419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012466275,0.0005577502,0.0007561347,0.0017819782,0.0004446057,0.00016099558,0.0042806896,0.00032744507,0.000013851286],"category_scores_gemma":[0.00007632064,0.0005486065,0.00023818488,0.0013355954,0.0011868653,0.000683107,0.0013221746,0.001090068,0.000027799573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043513846,0.00017304214,0.00048054405,0.00017787487,0.00005160042,0.0003439048,0.0026432252,0.031810936,0.0022567145,0.28394434,0.00008614431,0.6779882],"study_design_scores_gemma":[0.000833044,0.00043173842,0.00065021403,0.000843657,0.000008242468,0.00037926523,2.8349035e-7,0.29333085,0.00840438,0.6930112,0.0009984801,0.0011086331],"about_ca_topic_score_codex":0.000010903751,"about_ca_topic_score_gemma":0.00003060412,"teacher_disagreement_score":0.6768795,"about_ca_system_score_codex":0.00019853759,"about_ca_system_score_gemma":0.00043876786,"threshold_uncertainty_score":0.99969655},"labels":[],"label_agreement":null},{"id":"W1516152095","doi":"10.1007/s101079900110","title":"Restricted 2-factor polytopes","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Travelling salesman problem; Facet (psychology); Uniform k 21 polytope; Birkhoff polytope; Graph; Discrete mathematics; Complete graph; Mathematical optimization; Geometry; Convex optimization; Regular polygon","score_opus":0.029632310202253837,"score_gpt":0.30495063517821547,"score_spread":0.27531832497596165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516152095","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06735173,0.0001478759,0.90909886,0.00096297404,0.000051561878,0.0006301419,0.0000014670662,0.001125015,0.020630363],"genre_scores_gemma":[0.4882364,0.000008965004,0.50822014,0.0001089021,0.00005631512,0.000076264456,0.0000011760245,0.00002490581,0.003266966],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983359,0.00008267597,0.00025657803,0.00034665066,0.0004282355,0.00054998597],"domain_scores_gemma":[0.99879736,0.0002819567,0.00003213042,0.0006494955,0.00004285817,0.0001962094],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019709732,0.00014372455,0.00018414426,0.00009540927,0.0001527171,0.00025043986,0.00094376976,0.000059363363,0.0007982387],"category_scores_gemma":[0.00018672534,0.0001161172,0.00007982561,0.00073118653,0.00011162008,0.000412498,0.00014876314,0.00021617733,0.0010782355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006124243,0.0001092476,0.00002656196,0.000024669205,0.000008516973,0.000025808322,0.0002583629,0.0000037798595,0.0002131307,0.23626223,0.000034007466,0.76302755],"study_design_scores_gemma":[0.00066412083,0.0003112573,0.0005829551,0.00011236404,0.000008355286,0.00011234939,0.000057983874,0.026899252,0.0032103444,0.90616834,0.061217993,0.0006546768],"about_ca_topic_score_codex":0.000001908235,"about_ca_topic_score_gemma":3.5466414e-7,"teacher_disagreement_score":0.7623729,"about_ca_system_score_codex":0.000027265942,"about_ca_system_score_gemma":0.000024541974,"threshold_uncertainty_score":0.99969953},"labels":[],"label_agreement":null},{"id":"W1516725342","doi":"","title":"Constructing Incremental Sequences in Graphs","year":2006,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Sequence (biology); Approximation algorithm; Group (periodic table); Constraint (computer-aided design); Graph; Discrete mathematics; Geometry","score_opus":0.034354179743035174,"score_gpt":0.31869436152871883,"score_spread":0.28434018178568365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516725342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36894953,0.00043312224,0.47444677,0.0006699206,0.0014841679,0.0009186241,0.000020112755,0.00061825453,0.15245947],"genre_scores_gemma":[0.76730734,0.000013425064,0.23220685,0.000061786806,0.000027998722,0.000045409724,0.000013639793,0.000010635962,0.0003129323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977317,0.00019189944,0.00037642906,0.0007661826,0.00047164166,0.0004621359],"domain_scores_gemma":[0.9988327,0.00016429408,0.00012896677,0.00074107246,0.000064261105,0.00006871489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007180489,0.00022759884,0.00027465966,0.00057019544,0.000065441614,0.00023257972,0.0019663426,0.00015386213,0.000034094315],"category_scores_gemma":[0.00004307864,0.00021645578,0.000095845826,0.000592398,0.00024959212,0.00033004352,0.003030597,0.0008188209,0.000018287332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035921094,0.00003290397,0.051801212,0.000047102905,0.000012931633,0.000089936235,0.00010038718,0.00054890837,0.000250637,0.91830224,0.00014446226,0.028665667],"study_design_scores_gemma":[0.00022607361,0.00002109805,0.0012236434,0.000102117825,0.0000014492416,0.000027767244,0.00015321329,0.013590241,0.0038258042,0.9804035,0.000049388917,0.00037574416],"about_ca_topic_score_codex":0.001053144,"about_ca_topic_score_gemma":0.0009082635,"teacher_disagreement_score":0.39835778,"about_ca_system_score_codex":0.00018785246,"about_ca_system_score_gemma":0.00017481775,"threshold_uncertainty_score":0.8826811},"labels":[],"label_agreement":null},{"id":"W1517569912","doi":"10.1017/cbo9781139087223.008","title":"Graph minors: generalizing Kuratowski's theorem","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robertson–Seymour theorem; Combinatorics; Graph minor; Mathematics; Discrete mathematics; Minor (academic); Outerplanar graph; 1-planar graph; Graph; Pathwidth; Line graph; Voltage graph; Political science; Law","score_opus":0.02857034180329234,"score_gpt":0.2277575115081462,"score_spread":0.19918716970485384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517569912","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004087202,0.00042124258,0.05752204,0.00004403243,0.0002251728,0.00047093868,0.00005987248,0.00046187974,0.94075394],"genre_scores_gemma":[0.0006124337,0.00019947023,0.0049228403,0.00018551854,0.00014571378,0.0000010297335,0.000020689444,0.000055147553,0.99385715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99703276,0.00014194079,0.00027714839,0.0011640324,0.0006702835,0.00071384554],"domain_scores_gemma":[0.997036,0.00014237213,0.00028228416,0.0018606078,0.00029727456,0.00038151004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028774876,0.00061638205,0.00055810495,0.00065386255,0.0004194907,0.0001949784,0.0033066245,0.00044200377,0.000004632316],"category_scores_gemma":[0.000014388843,0.0007030942,0.00044596088,0.000051532086,0.00047493036,0.00044046598,0.0012447749,0.0008927503,0.000037379228],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042578406,0.000010696549,4.8985675e-7,0.000028101198,0.000094558854,0.0007676071,0.00005694297,0.000011869182,0.00015835432,0.9711762,0.007993041,0.019659529],"study_design_scores_gemma":[0.00062576577,0.00013056098,0.0000064171672,0.00018476881,0.000068503745,0.00006921372,0.000014916471,0.00036537083,0.0017698893,0.009961885,0.98578453,0.0010181741],"about_ca_topic_score_codex":0.000030348954,"about_ca_topic_score_gemma":0.0000016000967,"teacher_disagreement_score":0.9777915,"about_ca_system_score_codex":0.00022187803,"about_ca_system_score_gemma":0.0001595722,"threshold_uncertainty_score":0.999542},"labels":[],"label_agreement":null},{"id":"W1519450118","doi":"10.1007/11604686_10","title":"Roman Domination over Some Graph Classes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Vertex (graph theory); Domination analysis; Graph; Interval graph; Minimum weight; Mathematics; Time complexity; Dominating set; Discrete mathematics; Line graph; Pathwidth","score_opus":0.016729671139819293,"score_gpt":0.28423662359484875,"score_spread":0.2675069524550295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519450118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029444785,0.0008960001,0.99169546,0.0008093654,0.0012145182,0.00047139166,0.000005198059,0.00025024416,0.0043633822],"genre_scores_gemma":[0.24529421,0.000456651,0.7446695,0.0036985266,0.002203475,0.000049094913,0.000016405267,0.00014708018,0.0034650469],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463516,0.00007061971,0.0005553301,0.0019577376,0.0017808632,0.0010002932],"domain_scores_gemma":[0.9964374,0.00075893983,0.00030116606,0.0019524976,0.0002909147,0.00025913518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001221425,0.0006205659,0.0005501081,0.0020873176,0.00036805554,0.0006861985,0.0050691315,0.0003788681,0.00006960019],"category_scores_gemma":[0.00013113415,0.00057911157,0.0002065981,0.0011335422,0.0012565511,0.0022501359,0.0018541166,0.0011838401,0.00012935472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008398217,0.00003351427,0.000033076416,0.000022681907,0.000010748012,0.000074838536,0.00024059627,0.010572488,0.00031498692,0.4197222,0.000036865018,0.5689296],"study_design_scores_gemma":[0.0003516309,0.00016443193,0.0003180803,0.00019233584,0.000004967811,0.000050766503,8.8100926e-8,0.12279938,0.0016574705,0.86939234,0.0043471144,0.00072140543],"about_ca_topic_score_codex":0.0000069954963,"about_ca_topic_score_gemma":0.000057502686,"teacher_disagreement_score":0.56820816,"about_ca_system_score_codex":0.00050561083,"about_ca_system_score_gemma":0.0005242676,"threshold_uncertainty_score":0.99966604},"labels":[],"label_agreement":null},{"id":"W1520749929","doi":"10.46298/dmtcs.550","title":"On the Book Thickness of k-Trees","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Tree (set theory); Combinatorics; Degree (music); Decomposition; Discrete mathematics; Physics; Ecology; Biology","score_opus":0.02964475841660093,"score_gpt":0.28619845014396084,"score_spread":0.2565536917273599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520749929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008406703,0.000031096075,0.96406376,0.000594518,0.00018268771,0.00033285024,0.0000024820076,0.000113645816,0.026272276],"genre_scores_gemma":[0.77136415,0.0000046361206,0.22810161,0.00045055285,0.000019476602,0.000018061484,1.7094004e-7,0.00001300262,0.000028342007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966765,0.00020099929,0.00044863182,0.0006369528,0.0013642046,0.0006726836],"domain_scores_gemma":[0.9956143,0.0015565638,0.00017882267,0.0021275554,0.00030258766,0.00022019086],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030747778,0.00025453532,0.00030995542,0.00023740646,0.0004471526,0.00019523414,0.006156279,0.00005565962,0.00022719792],"category_scores_gemma":[0.00046908794,0.00014533095,0.00014095592,0.0013895156,0.0065552085,0.00060814485,0.001754227,0.00034275002,0.000103414524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009849087,0.00011903707,0.000007908308,0.000017556607,0.000008607406,0.000006577225,0.003233976,0.00001842405,0.00053473096,0.99484736,0.00005387543,0.0011421246],"study_design_scores_gemma":[0.0000894721,0.00023280684,0.000087008826,0.000075579694,0.000004327131,0.00001749305,0.000062734485,0.17474376,0.011932419,0.8125719,0.000016391128,0.00016614218],"about_ca_topic_score_codex":0.000001158555,"about_ca_topic_score_gemma":4.2099592e-7,"teacher_disagreement_score":0.76295745,"about_ca_system_score_codex":0.000024641351,"about_ca_system_score_gemma":0.00010282952,"threshold_uncertainty_score":0.9992209},"labels":[],"label_agreement":null},{"id":"W1521918479","doi":"10.37236/976","title":"Matrix Partitions with Finitely Many Obstructions","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Matrix (chemical analysis); Diagonal; Characterization (materials science); Induced subgraph; Graph; Finite set; Block matrix; Discrete mathematics; Diagonal matrix; Eigenvalues and eigenvectors","score_opus":0.010567544475568983,"score_gpt":0.28278040714190844,"score_spread":0.2722128626663395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521918479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08199678,0.0013162125,0.913862,0.0013234225,0.00027808087,0.00009790491,3.8700563e-7,0.000035783894,0.0010894537],"genre_scores_gemma":[0.99814844,0.00020544651,0.0010934215,0.000042857115,0.00006543291,0.0000020299858,1.81454e-7,0.000012078188,0.0004300876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981528,0.0001077596,0.00033189476,0.000118143216,0.00058158697,0.00070781156],"domain_scores_gemma":[0.99827754,0.00046941737,0.00027579188,0.0004561093,0.0004004386,0.00012068932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019176422,0.000115430834,0.00015893353,0.00022959101,0.00032309038,0.00007549255,0.0012969314,0.00003852706,0.000008444622],"category_scores_gemma":[0.000080393096,0.00007305641,0.00008971119,0.0013413453,0.00013202101,0.00046676293,0.00009028811,0.00091968186,0.000013792957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004254605,0.00006649643,0.00016755195,0.0000022538434,0.000045817753,0.000027661878,0.00013836475,0.00028606443,0.00013277012,0.9980206,0.000107290834,0.0009626041],"study_design_scores_gemma":[0.0005289093,0.0006941525,0.0007940733,0.000012226023,0.00001767116,0.001037664,0.000114739705,0.00018666053,0.0015084421,0.9893789,0.0056260596,0.000100465215],"about_ca_topic_score_codex":0.0000014445044,"about_ca_topic_score_gemma":0.000006391764,"teacher_disagreement_score":0.9161517,"about_ca_system_score_codex":0.00024339503,"about_ca_system_score_gemma":0.00039359674,"threshold_uncertainty_score":0.3995611},"labels":[],"label_agreement":null},{"id":"W1522469957","doi":"10.1016/j.dam.2012.12.006","title":"The vertex leafage of chordal graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Chordal graph; Mathematics; Vertex (graph theory); Interval graph; Discrete mathematics; Treewidth; Tree (set theory); Graph; Pathwidth; 1-planar graph; Line graph","score_opus":0.019421689100344953,"score_gpt":0.2834221397538592,"score_spread":0.26400045065351424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522469957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028687667,0.00043951866,0.9171548,0.00017787641,0.00021476742,0.0005562835,0.0000053236786,0.00014975932,0.052614026],"genre_scores_gemma":[0.8875532,0.00004803141,0.11210061,0.000034814704,0.000023158062,0.00005989696,0.0000014273897,0.000020508785,0.00015831196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848074,0.00002949528,0.00031503508,0.00016888883,0.00047741365,0.0005284456],"domain_scores_gemma":[0.9980021,0.0006012691,0.00015284898,0.0010716289,0.000046370278,0.00012576867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009110802,0.00014886868,0.00019914495,0.000070112335,0.00021321111,0.000062099774,0.0013458277,0.000047039564,0.00000982143],"category_scores_gemma":[0.000083055784,0.00009541975,0.000092134,0.00046765624,0.00025074478,0.00024054566,0.00041397434,0.00017648659,0.000075452124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000523199,0.000052180207,0.000029535388,0.00003826076,0.000020409876,3.1297526e-7,0.0013278207,0.0000045642246,0.005358937,0.98666716,0.00015677953,0.006338838],"study_design_scores_gemma":[0.00025853465,0.000031861946,0.00021920538,0.000017451855,0.000010739898,0.0000071812224,0.00065542903,0.0028350723,0.025301307,0.9685054,0.0019506479,0.0002071788],"about_ca_topic_score_codex":8.0812595e-7,"about_ca_topic_score_gemma":7.4966533e-7,"teacher_disagreement_score":0.85886556,"about_ca_system_score_codex":0.000015358411,"about_ca_system_score_gemma":0.00002065441,"threshold_uncertainty_score":0.38911045},"labels":[],"label_agreement":null},{"id":"W1523383428","doi":"10.1007/11602613_104","title":"On Routing in VLSI Design and Communication Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Steiner tree problem; Routing (electronic design automation); Computer science; Vertex (graph theory); Mathematical optimization; Approximation algorithm; Multicast; Very-large-scale integration; Integer programming; Linear programming; Theoretical computer science; Mathematics; Distributed computing; Computer network; Graph","score_opus":0.02756434756253712,"score_gpt":0.28470505037295357,"score_spread":0.25714070281041645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523383428","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007012176,0.0006512289,0.99669415,0.0005698126,0.00020323359,0.00048310938,4.3750478e-7,0.00008782372,0.0012401049],"genre_scores_gemma":[0.38305312,0.00025804815,0.6154043,0.0010030109,0.000120092125,0.000014115599,0.0000018383381,0.000031469568,0.0001139758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968429,0.00017751021,0.00042128545,0.0012010117,0.0006792104,0.0006780762],"domain_scores_gemma":[0.9956154,0.0023400353,0.00018941116,0.001605898,0.00011449704,0.00013473748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002490738,0.00038377134,0.00038318674,0.00095945783,0.000272006,0.00041683274,0.0032894826,0.00026676143,0.000006328152],"category_scores_gemma":[0.00016275364,0.0003670947,0.00004894951,0.00076367176,0.0007909252,0.0006208472,0.0016801562,0.0014328569,0.000011403341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008032763,0.000012156532,0.000019103867,0.0000039702886,0.00000185897,0.000017761582,0.0002878671,0.38353205,0.000009103909,0.14166482,0.0000024678673,0.4744408],"study_design_scores_gemma":[0.00017223583,0.000090064124,0.00007482111,0.00030399646,8.8634744e-7,0.000017740509,8.5741554e-8,0.67467445,0.000074861964,0.32427192,0.000057433397,0.00026147414],"about_ca_topic_score_codex":0.000008718467,"about_ca_topic_score_gemma":0.00005558953,"teacher_disagreement_score":0.47417933,"about_ca_system_score_codex":0.00031523756,"about_ca_system_score_gemma":0.00018218804,"threshold_uncertainty_score":0.9998781},"labels":[],"label_agreement":null},{"id":"W1523797563","doi":"10.1007/978-3-642-12200-2_30","title":"On Quadratic Threshold CSPs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Predicate (mathematical logic); Quadratic equation; Combinatorics; Discrete mathematics; Computer science","score_opus":0.02164728414739782,"score_gpt":0.28453404510519054,"score_spread":0.26288676095779273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523797563","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018022675,0.00017606281,0.98283315,0.0008860593,0.0020590443,0.0005009765,0.0000038004048,0.00023538881,0.013125272],"genre_scores_gemma":[0.28395587,0.000054474298,0.70762426,0.004834809,0.00088845234,0.000039464772,0.000006457856,0.00013265628,0.002463524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944375,0.000043450487,0.00050302903,0.0021261533,0.0018345467,0.001055305],"domain_scores_gemma":[0.99489534,0.0012013335,0.00023329072,0.003086365,0.00026387494,0.00031979833],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013645448,0.00066274166,0.00058227824,0.001457701,0.000434276,0.0006785767,0.0068450156,0.0004932585,0.00007769833],"category_scores_gemma":[0.00024264607,0.00057369855,0.00017888461,0.00092271226,0.001596857,0.00069647917,0.0018906471,0.0028002935,0.00031196835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133892,0.000043839522,0.00001324023,0.000027028333,0.000008633827,0.00019670893,0.00034584416,0.011188211,0.00092842494,0.69202304,0.000016595644,0.29519507],"study_design_scores_gemma":[0.00020439737,0.00028128034,0.000020499792,0.00021553854,0.000002536296,0.00005318339,4.184533e-8,0.10842776,0.004171114,0.88514185,0.00087739935,0.00060441485],"about_ca_topic_score_codex":0.000004682601,"about_ca_topic_score_gemma":0.00007059891,"teacher_disagreement_score":0.29459065,"about_ca_system_score_codex":0.00023537068,"about_ca_system_score_gemma":0.000580004,"threshold_uncertainty_score":0.99967146},"labels":[],"label_agreement":null},{"id":"W15242030","doi":"","title":"Two-Dimensional Bandwidth of Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bandwidth (computing); Combinatorics; Computer network; Computer science","score_opus":0.013483079314258253,"score_gpt":0.2793649703429749,"score_spread":0.2658818910287167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15242030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98929715,0.00046214604,0.001872237,0.0007873196,0.0009144356,0.00020271399,0.000002698724,0.00016846898,0.006292858],"genre_scores_gemma":[0.9815969,0.000005225036,0.018051958,0.00012569207,0.00000557031,0.0000084176745,0.0000012768893,0.000009853824,0.00019509268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985688,0.000096675714,0.00022625369,0.00030749768,0.00048023983,0.00032056103],"domain_scores_gemma":[0.9987599,0.00020206194,0.00007914513,0.0006716169,0.00016333634,0.00012393399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043449784,0.000119224955,0.00017710857,0.00018432314,0.00009019196,0.00002563064,0.00093889795,0.000040020397,0.00004106759],"category_scores_gemma":[0.000055553166,0.000112434165,0.00008664154,0.00067126215,0.00013034455,0.00046034894,0.00032837596,0.00016982938,0.00008207382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011018973,0.00011042092,0.0008489402,0.000004023112,0.000013499915,0.000005328352,0.00008013633,0.00030459755,0.002415262,0.9890757,0.0005863866,0.006544667],"study_design_scores_gemma":[0.0009133723,0.00009673858,0.0011251103,0.000012218336,0.0000022534196,0.0000092648415,0.0000037465677,0.003765426,0.020699393,0.97246534,0.00077418913,0.00013294538],"about_ca_topic_score_codex":0.000007213474,"about_ca_topic_score_gemma":0.0000022111494,"teacher_disagreement_score":0.01828413,"about_ca_system_score_codex":0.000030292316,"about_ca_system_score_gemma":0.00006327566,"threshold_uncertainty_score":0.4584932},"labels":[],"label_agreement":null},{"id":"W1525531059","doi":"10.1007/978-1-4614-0110-0_29","title":"Construction of Locally Plane Graphs with Many Edges","year":2012,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Planar graph; Combinatorics; Mathematics; Line graph; Plane (geometry); Graph; Discrete mathematics; Geometry","score_opus":0.019809743065615164,"score_gpt":0.24161389944174816,"score_spread":0.221804156376133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525531059","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002777752,0.0005099491,0.47518846,0.000056304696,0.00014727977,0.00021642492,0.000008894748,0.00011334939,0.5237315],"genre_scores_gemma":[0.020141454,0.0009820267,0.38554245,0.00015936015,0.00020454291,0.000024663532,0.00003444266,0.00012752453,0.5927835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852556,0.000020613303,0.00024630045,0.0003874289,0.00052228174,0.0002978336],"domain_scores_gemma":[0.99855614,0.0001108648,0.00019517784,0.0007998943,0.0002050762,0.000132861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019732276,0.00025237273,0.00032742295,0.0003631588,0.000053520907,0.000028759903,0.00079891016,0.00017852115,0.00031431596],"category_scores_gemma":[0.0000049211862,0.00019076267,0.00008107856,0.00008925192,0.0005861145,0.0003078064,0.0002345482,0.00033415048,0.00009037092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030505267,0.0000087754015,0.000054452736,0.000038681374,0.000053549567,0.000010334292,0.000025161844,0.000003343376,0.000043841676,0.92996734,0.00011077933,0.06965326],"study_design_scores_gemma":[0.0004028867,0.00041555072,0.00007809438,0.00020969262,0.000024999392,0.00028960963,0.000014485567,0.0000782801,0.002808782,0.9635469,0.03162152,0.0005092113],"about_ca_topic_score_codex":0.000004882686,"about_ca_topic_score_gemma":0.000010099419,"teacher_disagreement_score":0.08964602,"about_ca_system_score_codex":0.000022960225,"about_ca_system_score_gemma":0.000084140534,"threshold_uncertainty_score":0.77790755},"labels":[],"label_agreement":null},{"id":"W1526859640","doi":"","title":"K 3,3 Minors and the Maximum-Flow Problem","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minor (academic); Combinatorics; Mathematics; Planar graph; Graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Graph minor; Flow (mathematics); Discrete mathematics; Planar; Computer science; Chordal graph; Line graph; Geometry; Voltage graph; Artificial intelligence","score_opus":0.053062170730478746,"score_gpt":0.34197726507755705,"score_spread":0.2889150943470783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526859640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043514878,0.0019986182,0.91431373,0.02151936,0.00020338499,0.0031301058,0.000014982849,0.0002710504,0.01503388],"genre_scores_gemma":[0.4697136,0.0015853208,0.51396704,0.00027769222,0.00024092228,0.000988237,0.000009269552,0.00003853292,0.0131794205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966984,0.0009341261,0.00023643399,0.0005079681,0.000979516,0.0006435746],"domain_scores_gemma":[0.9976165,0.00070859713,0.0000117197915,0.0009304121,0.00056457415,0.00016816557],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028505104,0.00012933409,0.00016282711,0.00035399315,0.0021582728,0.0003353948,0.0014174599,0.00006056664,0.00004308061],"category_scores_gemma":[0.00030709486,0.000085760264,0.00004903674,0.0015877599,0.0017140044,0.0007420602,0.00082243036,0.0006901917,0.0002688585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006531965,0.00016619347,0.00016654219,0.00002007168,0.000065738954,0.00014276782,0.00803078,0.0033322286,0.00065774587,0.7819966,0.0034055742,0.20195042],"study_design_scores_gemma":[0.0022017602,0.00016002415,0.00049176323,0.000015702419,0.000002675043,0.00051538483,0.0002888615,0.8922172,0.0009579441,0.09380401,0.009085144,0.000259495],"about_ca_topic_score_codex":0.00023032681,"about_ca_topic_score_gemma":0.00006093889,"teacher_disagreement_score":0.888885,"about_ca_system_score_codex":0.00005699482,"about_ca_system_score_gemma":0.00029357534,"threshold_uncertainty_score":0.9991408},"labels":[],"label_agreement":null},{"id":"W1526904710","doi":"10.1007/3-540-36379-3_35","title":"Connected and Loosely Connected List Homomorphisms","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Bipartite graph; Homomorphism; Combinatorics; Discrete mathematics; Time complexity; Pathwidth; Indifference graph; Mathematics; Graph homomorphism; Complete bipartite graph; Computer science; Graph; Line graph; Voltage graph","score_opus":0.02350317992220167,"score_gpt":0.25560026214924325,"score_spread":0.2320970822270416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526904710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003995008,0.0014876656,0.99013954,0.0007940105,0.000910915,0.0006501454,0.000015744708,0.00038470275,0.0052177454],"genre_scores_gemma":[0.5429763,0.0004911191,0.45024702,0.0026806777,0.00062635675,0.000040277806,0.000018937,0.00015900619,0.0027602895],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943678,0.000106090796,0.00062061934,0.0024045082,0.0013452747,0.0011557158],"domain_scores_gemma":[0.995258,0.0014675704,0.000311286,0.0020135797,0.00051650056,0.00043306238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009851923,0.0007678641,0.00080389524,0.00148245,0.0004840588,0.00085180014,0.0041005276,0.0004483589,0.00012539247],"category_scores_gemma":[0.0003665082,0.0007265493,0.00012926283,0.0014090581,0.0025524322,0.0008821285,0.002288049,0.0014523126,0.0000845875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022832253,0.00006916266,0.00008458587,0.00007647723,0.000035149398,0.0006649992,0.0007826813,0.002584991,0.00069693895,0.43689147,0.00006589394,0.5580248],"study_design_scores_gemma":[0.0007493191,0.00039880033,0.00017662457,0.00037733617,0.000010486349,0.0004031383,2.2733565e-7,0.3220294,0.0018338651,0.6704558,0.0023586338,0.0012063638],"about_ca_topic_score_codex":0.000017005766,"about_ca_topic_score_gemma":0.000046522844,"teacher_disagreement_score":0.5568185,"about_ca_system_score_codex":0.00025775234,"about_ca_system_score_gemma":0.00030390342,"threshold_uncertainty_score":0.9995186},"labels":[],"label_agreement":null},{"id":"W1527608075","doi":"10.37236/460","title":"Another Abstraction of the Erdős-Szekeres Happy End Theorem","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Tel Aviv University; Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Integer (computer science); Simple (philosophy); Regular polygon; Set (abstract data type); Discrete mathematics; General position; Plane (geometry); Geometry; Computer science","score_opus":0.0073306789534315605,"score_gpt":0.25351135019581006,"score_spread":0.2461806712423785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527608075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77748173,0.0016985849,0.20788588,0.004769433,0.0026002938,0.0003488538,0.000001266585,0.000040264276,0.005173676],"genre_scores_gemma":[0.999273,0.0001340201,0.000112306516,0.00006234164,0.00007823754,0.0000016510736,4.4976083e-8,0.000014224899,0.0003241936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804366,0.00024592702,0.00037209535,0.00012269606,0.00073315954,0.00048246465],"domain_scores_gemma":[0.9976777,0.0005739089,0.00058151706,0.0007663059,0.0003512268,0.000049362887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024218622,0.00012829633,0.00019242759,0.000107753505,0.00019962483,0.00005722637,0.0026539692,0.00007142237,0.000029919445],"category_scores_gemma":[0.00026435728,0.0000678926,0.00018247473,0.00066361437,0.00027389618,0.0003792772,0.00018293626,0.0016621659,0.0000054664715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033407425,0.00008613923,0.00021793028,0.0000037480288,0.000041327774,0.0000016006095,0.00021729861,0.00005242988,0.020745935,0.97500277,0.00012192536,0.0034754674],"study_design_scores_gemma":[0.0003277473,0.00022019066,0.0017579144,0.000013029378,0.000012149397,0.00018825132,0.000041890846,0.00026687168,0.057965435,0.9349438,0.0041870857,0.00007563639],"about_ca_topic_score_codex":0.0000048713678,"about_ca_topic_score_gemma":0.000012672833,"teacher_disagreement_score":0.22179122,"about_ca_system_score_codex":0.00009507698,"about_ca_system_score_gemma":0.00047218555,"threshold_uncertainty_score":0.72213763},"labels":[],"label_agreement":null},{"id":"W1528095446","doi":"10.1007/11682462_62","title":"Packing Dicycle Covers in Planar Graphs with No K 5–e Minor","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Minor (academic); Planar; Planar graph; Combinatorics; Theoretical computer science; Computer graphics (images); Graph; Mathematics; Humanities; Art","score_opus":0.013087783474351394,"score_gpt":0.24909612712772436,"score_spread":0.23600834365337298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528095446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006345972,0.0002781812,0.98768556,0.00027905352,0.0005679167,0.00051409664,0.000008341848,0.00014242066,0.009889861],"genre_scores_gemma":[0.4345772,0.000063893436,0.56165326,0.0016472943,0.00039691027,0.000039307568,0.000018110595,0.00012752086,0.0014765357],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947813,0.000066836576,0.0004973783,0.0019251676,0.0015578587,0.0011714263],"domain_scores_gemma":[0.9969736,0.00072098797,0.00025307387,0.0016057463,0.00024204033,0.00020456863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096427894,0.0006240724,0.0006084114,0.0019053327,0.0002438892,0.0004626704,0.0039813076,0.0002811351,0.000014066144],"category_scores_gemma":[0.00007464642,0.0005342684,0.00011396747,0.0016002737,0.0013854316,0.0009325547,0.0008093213,0.0012540931,0.00005605418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019096669,0.00021340608,0.0073347827,0.00019229819,0.000050994462,0.0030845783,0.001526144,0.27685356,0.00097551825,0.22119986,0.0002556352,0.48812225],"study_design_scores_gemma":[0.0014102635,0.0007585036,0.0017579203,0.0013340197,0.000008646454,0.0001889467,5.663648e-7,0.20781958,0.001394036,0.7803315,0.0030498477,0.0019461635],"about_ca_topic_score_codex":0.00010468533,"about_ca_topic_score_gemma":0.0005008531,"teacher_disagreement_score":0.5591316,"about_ca_system_score_codex":0.00039567068,"about_ca_system_score_gemma":0.0005064799,"threshold_uncertainty_score":0.99971086},"labels":[],"label_agreement":null},{"id":"W1528651684","doi":"10.1016/j.comgeo.2017.10.002","title":"Continuous Yao graphs","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Exploratory Research for Advanced Technology; Natural Sciences and Engineering Research Council of Canada; Natur og Univers, Det Frie Forskningsråd; National Science Foundation","keywords":"Spanner; Combinatorics; Vertex (graph theory); Mathematics; Regular polygon; Algebraic number; Apex (geometry); Plane (geometry); Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.02671546909029007,"score_gpt":0.32140128542788193,"score_spread":0.2946858163375919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528651684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08250538,0.0001820763,0.90627515,0.0010196351,0.000467353,0.00014015593,0.00000650955,0.00017465472,0.009229087],"genre_scores_gemma":[0.9205903,0.0000047481662,0.0783846,0.00021836189,0.00005090998,0.00001022019,0.000005764599,0.000009405134,0.0007257023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985654,0.000048231643,0.00017142537,0.0003897398,0.00050311885,0.00032210242],"domain_scores_gemma":[0.9982647,0.0002914017,0.00014411894,0.00092070294,0.00024185452,0.00013725596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039525665,0.0001203524,0.00015408864,0.00031070822,0.0007686831,0.00051476137,0.0021803516,0.000045977973,0.00004159898],"category_scores_gemma":[0.00032408035,0.00011937491,0.00008851907,0.00033106262,0.00023532716,0.00082042074,0.0006648622,0.00018001188,0.00030284075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007220686,0.000050893414,0.008641217,0.000007766272,0.000025202204,0.000040143685,0.000050953066,0.0031289961,0.000065590204,0.9307849,0.0009474824,0.05624965],"study_design_scores_gemma":[0.00042117017,0.000051541036,0.11476041,0.000011171394,0.0000017956035,0.000030056337,0.000008781594,0.027997635,0.00015131461,0.8537632,0.0026152653,0.00018761854],"about_ca_topic_score_codex":0.0000060293846,"about_ca_topic_score_gemma":7.8343487e-7,"teacher_disagreement_score":0.8380849,"about_ca_system_score_codex":0.000023195598,"about_ca_system_score_gemma":0.00006424139,"threshold_uncertainty_score":0.5912166},"labels":[],"label_agreement":null},{"id":"W1529426207","doi":"10.37236/2570","title":"Note on Nordhaus-Gaddum Problems for Colin de Verdière type Parameters","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Combinatorics; Mathematics; Conjecture; Graph; Complement (music); Upper and lower bounds; Rank (graph theory); Type (biology); Chemistry","score_opus":0.01591747753785912,"score_gpt":0.2818817897808203,"score_spread":0.2659643122429612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529426207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19045684,0.0013973366,0.80063474,0.005280889,0.00085737597,0.00091508677,7.9570293e-7,0.000050680956,0.00040628397],"genre_scores_gemma":[0.99782217,0.00026416723,0.0012298276,0.00025749477,0.000054323005,0.000025046998,2.9832256e-7,0.000021489452,0.00032520568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979489,0.00020059364,0.00032470954,0.00016253791,0.00047353288,0.00088971277],"domain_scores_gemma":[0.99768406,0.0008523845,0.00029304795,0.0004795097,0.00055757345,0.00013344608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00168881,0.00015387964,0.00023330959,0.00015381917,0.00019338391,0.00012316326,0.0018084365,0.00006828058,0.000005112615],"category_scores_gemma":[0.00031283163,0.00010489615,0.00013882396,0.00067328097,0.00007550366,0.0003691077,0.0001067084,0.0008303139,0.000032254688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010303795,0.00012979736,0.00005090334,0.00001345984,0.000058045734,0.0000030323888,0.00030433782,0.0021596628,0.0009383721,0.98951703,0.0014887351,0.0052335677],"study_design_scores_gemma":[0.0008406099,0.0026180155,0.00008925724,0.000026015541,0.000012882886,0.00007019258,0.000023010187,0.008675849,0.003393566,0.97829837,0.005823274,0.0001289451],"about_ca_topic_score_codex":0.000006441311,"about_ca_topic_score_gemma":0.0000024182443,"teacher_disagreement_score":0.8073653,"about_ca_system_score_codex":0.000494222,"about_ca_system_score_gemma":0.0006357882,"threshold_uncertainty_score":0.42775407},"labels":[],"label_agreement":null},{"id":"W1529517016","doi":"","title":"A new flow formulation for FIPP p-cycle protection subject to multiple link failures","year":2011,"lang":"en","type":"article","venue":"International Conference on Ultra Modern Telecommunications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Column generation; Path (computing); Scalability; Mathematical optimization; Computer science; Bandwidth (computing); Dual (grammatical number); Mathematics; Computer network","score_opus":0.12270868231741712,"score_gpt":0.3413565591995041,"score_spread":0.21864787688208698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529517016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015568013,0.000008149848,0.97393876,0.0062346035,0.00011988138,0.0010332706,0.000028787343,0.00022891219,0.016850842],"genre_scores_gemma":[0.6849031,0.000011304263,0.313276,0.00011950266,0.000041591007,0.00040015444,0.000032234995,0.000016039114,0.0012001044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849683,0.00008956977,0.00033428022,0.00043964683,0.00034376793,0.00029590935],"domain_scores_gemma":[0.9976489,0.00029165306,0.0001342514,0.0011563464,0.00059863896,0.00017024517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002965146,0.0001848369,0.00014512739,0.00037472046,0.0003129408,0.00017511952,0.002402186,0.00008855919,0.0001046955],"category_scores_gemma":[0.0003982875,0.00019217325,0.000109605746,0.00027431073,0.000030493,0.0007784493,0.0001945049,0.00028193492,0.00010916547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013802657,0.000114465,0.000084068764,0.000004196462,0.00004421199,3.565493e-7,0.0021875447,0.001390307,0.00863661,0.7015828,0.00008690437,0.2857305],"study_design_scores_gemma":[0.00052430446,0.00024040834,0.0011713115,0.000038686652,0.0000038465487,0.000005221232,0.000030443365,0.5117409,0.012310026,0.4714058,0.002298608,0.00023040522],"about_ca_topic_score_codex":0.00016450285,"about_ca_topic_score_gemma":0.00044213937,"teacher_disagreement_score":0.6833463,"about_ca_system_score_codex":0.00015574541,"about_ca_system_score_gemma":0.00020262046,"threshold_uncertainty_score":0.78365976},"labels":[],"label_agreement":null},{"id":"W1529872609","doi":"10.1016/j.jctb.2015.05.011","title":"The structure of 2-separations of infinite matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Invariant (physics); Graphic matroid; Duality (order theory); Tree (set theory); Discrete mathematics; Mathematical physics","score_opus":0.01746079313427293,"score_gpt":0.29334364779114674,"score_spread":0.2758828546568738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529872609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8699374,0.002526857,0.10462889,0.0014077867,0.015826851,0.0004640503,0.000029587665,0.000048192946,0.0051303715],"genre_scores_gemma":[0.995889,0.000045926725,0.0037276421,0.000011162212,0.00018309685,5.332905e-7,3.0072871e-7,0.000008113499,0.00013420443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978642,0.00053683965,0.0006311292,0.000088082365,0.0006899881,0.00018980246],"domain_scores_gemma":[0.9966352,0.0007147698,0.0007406028,0.00049928547,0.001281273,0.00012885155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019192691,0.00011094235,0.0003050642,0.00015449116,0.0001168014,0.000062037696,0.0014591787,0.00006273274,0.000009522258],"category_scores_gemma":[0.0010315313,0.00007131014,0.00013120807,0.00055437884,0.00044577417,0.00089668424,0.00022821347,0.0003028176,0.0000011240874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068648043,0.00003590942,0.00012280351,0.000007497854,0.00005490939,0.0000033233662,0.0008732616,0.0002486285,0.0060752295,0.99065506,0.00027062866,0.00096623617],"study_design_scores_gemma":[0.0007467677,0.000887643,0.000078413,0.00001916094,0.000009342479,0.000058750964,0.0003935876,0.000030017905,0.04011447,0.95160645,0.0059910105,0.00006437983],"about_ca_topic_score_codex":9.804916e-7,"about_ca_topic_score_gemma":0.0000010563263,"teacher_disagreement_score":0.12595162,"about_ca_system_score_codex":0.0000346875,"about_ca_system_score_gemma":0.0003744791,"threshold_uncertainty_score":0.2907943},"labels":[],"label_agreement":null},{"id":"W1530791066","doi":"10.1023/a:1011453115618","title":"Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Satisfiability; Discrete mathematics; Theory of computation; Approximation algorithm; Upper and lower bounds; Heuristic; Algorithm; Mathematical optimization","score_opus":0.02127682984858473,"score_gpt":0.297354183519847,"score_spread":0.27607735367126224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530791066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013665363,0.00010501017,0.984367,0.00040851603,0.0010274356,0.00030665513,0.0000013069742,0.000026177871,0.000092498536],"genre_scores_gemma":[0.42284498,0.00017816645,0.5765918,0.00004606478,0.0002841296,0.000016535001,0.000004648506,0.00001526052,0.000018389806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987416,0.00012954598,0.00041281385,0.00017505427,0.00035076038,0.00019021986],"domain_scores_gemma":[0.9982784,0.00026785495,0.0003399724,0.0002076428,0.0007926208,0.00011351873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012143599,0.00010273225,0.00021438587,0.00023138532,0.00014974074,0.00013546119,0.0003715739,0.00007563421,0.0000064980754],"category_scores_gemma":[0.00046432618,0.00009268585,0.000082167615,0.00053311145,0.000058611382,0.0012636743,0.00007049081,0.00013468546,4.2087834e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009868774,0.00066433876,0.003206427,0.00007620524,0.00009459782,0.000018013869,0.00055967283,0.291913,0.00091602077,0.6253567,0.00037332939,0.075834826],"study_design_scores_gemma":[0.0021875429,0.00068215927,0.0003059789,0.000010700253,0.000011864739,0.00005131961,0.000025601184,0.51119965,0.00062342675,0.48361725,0.0011629128,0.00012159849],"about_ca_topic_score_codex":0.0000012589593,"about_ca_topic_score_gemma":1.1652363e-7,"teacher_disagreement_score":0.40917963,"about_ca_system_score_codex":0.00006404694,"about_ca_system_score_gemma":0.00007390562,"threshold_uncertainty_score":0.37796193},"labels":[],"label_agreement":null},{"id":"W1532021344","doi":"10.1007/11538363_26","title":"Closure Properties of Weak Systems of Bounded Arithmetic","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bounded function; Class (philosophy); Axiom; Complexity class; Closure (psychology); Discrete mathematics; Descriptive complexity theory; Second-order arithmetic; Computer science; Arithmetic; Mathematics; Algebra over a field; Time complexity; Pure mathematics; Artificial intelligence","score_opus":0.027840504164713224,"score_gpt":0.2617839800224799,"score_spread":0.23394347585776665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532021344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079880224,0.0041439743,0.9908205,0.00018431719,0.0008740315,0.000626403,0.000006866584,0.00008013692,0.0024649482],"genre_scores_gemma":[0.8012864,0.000114796225,0.19729339,0.0000871545,0.0002602042,0.00001535286,0.0000012819145,0.0000440417,0.00089737365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995409,0.00009398923,0.0008781779,0.0012023231,0.0017448461,0.00067165756],"domain_scores_gemma":[0.99631286,0.00036320448,0.0005538675,0.0019184805,0.00070427783,0.00014732388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014659435,0.00047263753,0.0008786324,0.0013354716,0.00013705422,0.00021267652,0.004691912,0.00030435866,0.000007592129],"category_scores_gemma":[0.00015807808,0.0003896677,0.00018268559,0.000988211,0.0023059738,0.0006082914,0.0014757391,0.0007793196,0.000012049815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005245619,0.00014482839,0.0002532679,0.0009079044,0.00007103159,0.000044437966,0.0015970205,0.09684461,0.00730127,0.5362927,0.000011582941,0.3564789],"study_design_scores_gemma":[0.0009909652,0.0010302905,0.00015256101,0.0045581846,0.000028566745,0.0002332937,0.000002242927,0.5048929,0.0581876,0.42582262,0.002456849,0.0016439409],"about_ca_topic_score_codex":0.000031639574,"about_ca_topic_score_gemma":0.000034237546,"teacher_disagreement_score":0.8004876,"about_ca_system_score_codex":0.00020201849,"about_ca_system_score_gemma":0.00076684705,"threshold_uncertainty_score":0.9998555},"labels":[],"label_agreement":null},{"id":"W1532852577","doi":"10.46298/dmtcs.482","title":"On edge-intersection graphs of k-bend paths in grids","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Pathwidth; 1-planar graph; Indifference graph; Chordal graph; Planar graph; Outerplanar graph; Longest path problem; Discrete mathematics; Grid; Clique-sum; Lattice graph; Line graph; Graph; Voltage graph; Geometry","score_opus":0.012110239712280422,"score_gpt":0.2889517041416278,"score_spread":0.2768414644293474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532852577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2878269,0.0000037785667,0.706123,0.00016535036,0.0005846893,0.0002486719,0.0000027153626,0.000080246304,0.004964645],"genre_scores_gemma":[0.81163013,0.0000018367997,0.18823579,0.000069171874,0.000028647264,0.000014404773,6.0593175e-7,0.000013310188,0.000006090165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661756,0.00011840156,0.00056674046,0.00080810045,0.0011654957,0.0007237158],"domain_scores_gemma":[0.9969517,0.0008517355,0.00016131028,0.0015279042,0.00023703216,0.00027034312],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027235548,0.00026927723,0.00036994196,0.00078092085,0.00020964649,0.00024229877,0.0032737695,0.0000944437,0.00005834557],"category_scores_gemma":[0.00047626527,0.00021276502,0.00014079809,0.002288467,0.0035538336,0.0006653706,0.0010473413,0.0006941771,0.00004010502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012977084,0.00018240826,0.000050517137,0.000031166826,0.0000037934417,0.000011332211,0.0011892347,0.00008939843,0.009273616,0.9840255,0.0000074555073,0.0051226323],"study_design_scores_gemma":[0.00020035815,0.00025107778,0.00018886257,0.000069420996,0.0000018906622,0.000021162929,0.00003312339,0.30392128,0.011546259,0.6835895,0.0000042728257,0.00017277946],"about_ca_topic_score_codex":0.0000027652236,"about_ca_topic_score_gemma":0.000005365926,"teacher_disagreement_score":0.52380323,"about_ca_system_score_codex":0.000038797974,"about_ca_system_score_gemma":0.00010211758,"threshold_uncertainty_score":0.9991579},"labels":[],"label_agreement":null},{"id":"W1537431299","doi":"10.1007/11775096_25","title":"Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Multiset; Graph; Mathematics; Partition (number theory); Discrete mathematics; Time complexity; Split graph; Computer science; Pathwidth; Line graph","score_opus":0.019577771788288685,"score_gpt":0.2545518202272691,"score_spread":0.2349740484389804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537431299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032276163,0.0011283655,0.99546975,0.0002540856,0.00047871715,0.00076320284,0.0000356746,0.00013142776,0.0014159903],"genre_scores_gemma":[0.3543839,0.00020145584,0.64447045,0.00033919475,0.00021344543,0.00007099854,0.00004589912,0.000060829283,0.00021383632],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602497,0.000077635596,0.00062974915,0.0015086853,0.0010946768,0.00066426786],"domain_scores_gemma":[0.9974224,0.00047102242,0.00038335178,0.0010836885,0.00046831774,0.00017123375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009701729,0.00047642857,0.0005509041,0.0011659829,0.00025568253,0.00021491048,0.0017722577,0.00026009645,0.000010836563],"category_scores_gemma":[0.00007874292,0.00044936078,0.00013667885,0.0012626012,0.0022674627,0.0009134511,0.0008075031,0.0007161477,0.000006789099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066318826,0.0001707588,0.00064732326,0.00043605574,0.00003773974,0.00020877073,0.00062855135,0.003820771,0.0011283071,0.16261367,0.00007338959,0.8301683],"study_design_scores_gemma":[0.00032932952,0.00028452,0.0003846308,0.00061451376,0.000008326171,0.00006871662,2.4915187e-7,0.023014622,0.0026942499,0.9718765,0.00019857525,0.0005257536],"about_ca_topic_score_codex":0.00002186775,"about_ca_topic_score_gemma":0.00008830918,"teacher_disagreement_score":0.8296426,"about_ca_system_score_codex":0.00009245317,"about_ca_system_score_gemma":0.00024538854,"threshold_uncertainty_score":0.9997958},"labels":[],"label_agreement":null},{"id":"W1539135222","doi":"10.46298/dmtcs.345","title":"Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Maximal independent set; Independent set; Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Discrete mathematics; Chordal graph; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.030404127322679365,"score_gpt":0.3125950203568114,"score_spread":0.28219089303413203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539135222","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039811548,0.00002397611,0.94660336,0.0038750132,0.00013945308,0.0009599155,0.000022411208,0.00035193135,0.008212371],"genre_scores_gemma":[0.47246766,0.0000031581797,0.52612156,0.0012431068,0.000056887657,0.00004485099,0.0000016388955,0.000032533855,0.000028569535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929725,0.00020965602,0.00071127305,0.0017484926,0.0026799687,0.0016781164],"domain_scores_gemma":[0.99534106,0.0006610422,0.00019844544,0.0023391114,0.0004675601,0.0009927853],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.003335277,0.0005577445,0.00059366185,0.00082635257,0.0008879493,0.0013360295,0.0058113276,0.00009878234,0.00016554724],"category_scores_gemma":[0.00018914325,0.00042228543,0.00017287249,0.00309772,0.0027852908,0.0013863214,0.002242861,0.00061613735,0.00059165136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004432407,0.0001185307,0.0000546267,0.000028498396,0.000023533763,0.000044866825,0.0035688176,0.00022692599,0.001388023,0.9793817,0.00015056772,0.014969589],"study_design_scores_gemma":[0.00057566236,0.00072755164,0.00019048281,0.00017052538,0.000014362148,0.0002870223,0.000098177145,0.32769307,0.008407528,0.66020626,0.00079934805,0.0008299981],"about_ca_topic_score_codex":0.0000022636102,"about_ca_topic_score_gemma":0.0000034386196,"teacher_disagreement_score":0.43265614,"about_ca_system_score_codex":0.00016775854,"about_ca_system_score_gemma":0.0002056394,"threshold_uncertainty_score":0.99992853},"labels":[],"label_agreement":null},{"id":"W1541872440","doi":"10.1007/3-540-45477-2_9","title":"On the Relationship between Clique-Width and Treewidth","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Combinatorics; Clique-width; Clique-sum; Partial k-tree; Mathematics; Discrete mathematics; Bounded function; Graph; Tree decomposition; Tree-depth; Chordal graph; Pathwidth; 1-planar graph; Line graph; Voltage graph","score_opus":0.05768015266796828,"score_gpt":0.3089462622550377,"score_spread":0.2512661095870694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541872440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086357596,0.00025186667,0.98536766,0.0035922301,0.00031641516,0.00048399394,0.000004874213,0.00012693007,0.0089924475],"genre_scores_gemma":[0.8979173,0.000056429744,0.098050594,0.0021481614,0.00043560623,0.000020024047,0.0000041932462,0.00005296572,0.0013147584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612576,0.00014062622,0.0004139994,0.0014605881,0.0011447697,0.00071424263],"domain_scores_gemma":[0.9883507,0.009276378,0.00020860737,0.0018141407,0.0001439273,0.00020623207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020168084,0.00046977325,0.0004086257,0.0008705747,0.0006128083,0.0005386678,0.0036146394,0.00028505013,0.000018597071],"category_scores_gemma":[0.0007917689,0.0003322384,0.000099256,0.0010036889,0.0015125935,0.0005036926,0.001382837,0.0016432086,0.00005798346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005754075,0.000008693611,0.0029483873,0.000009863862,0.000005985515,0.000036075566,0.00025251097,0.0015360012,0.000003730377,0.73441726,0.000021624744,0.26075414],"study_design_scores_gemma":[0.00015203524,0.0001995439,0.0045965253,0.00021869635,0.0000039796273,0.000029734189,1.0135401e-7,0.015030384,0.00008207943,0.97853976,0.000762877,0.00038426876],"about_ca_topic_score_codex":0.0000065436498,"about_ca_topic_score_gemma":0.000026878142,"teacher_disagreement_score":0.8970537,"about_ca_system_score_codex":0.00019839098,"about_ca_system_score_gemma":0.0002724291,"threshold_uncertainty_score":0.999913},"labels":[],"label_agreement":null},{"id":"W1542271501","doi":"10.46298/dmtcs.533","title":"Cycle transversals in bounded degree graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Combinatorics; Mathematics; Degree (music); Bounded function; Transversal (combinatorics); Discrete mathematics; Chordal graph; Time complexity; Graph","score_opus":0.04119992193136523,"score_gpt":0.2953425194147365,"score_spread":0.25414259748337126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542271501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039751966,0.000028181907,0.9384754,0.00021315445,0.00022508448,0.00039886136,0.000002671879,0.00023286755,0.020671856],"genre_scores_gemma":[0.58872336,0.0000051473044,0.41108632,0.00013343566,0.000011699529,0.000019014584,3.7511177e-7,0.000014570368,0.000006045032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956684,0.00018767775,0.00061364344,0.0010456439,0.0012505634,0.0012340865],"domain_scores_gemma":[0.9971091,0.0004218355,0.0001171009,0.0017092663,0.000189666,0.00045303343],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0029834085,0.00034714403,0.00043165227,0.0006770123,0.0003735489,0.0004091127,0.0052801925,0.00009182958,0.0001242616],"category_scores_gemma":[0.0001786534,0.00028504326,0.00016459203,0.0029579622,0.004525172,0.0013691641,0.0011914915,0.00042513394,0.0001151566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015243761,0.00017466815,0.00006546544,0.000024970801,0.0000064048713,0.00004976228,0.0051336517,0.000016528984,0.00037707193,0.989477,0.000005129304,0.004654115],"study_design_scores_gemma":[0.00030197707,0.0001320359,0.0004125778,0.000048732032,0.0000038707317,0.000033568864,0.000061493825,0.22479355,0.0029529524,0.7709499,0.000009089868,0.00030024967],"about_ca_topic_score_codex":0.0000073288065,"about_ca_topic_score_gemma":0.0000056720332,"teacher_disagreement_score":0.5489714,"about_ca_system_score_codex":0.00006982111,"about_ca_system_score_gemma":0.00013848279,"threshold_uncertainty_score":0.9999602},"labels":[],"label_agreement":null},{"id":"W1542539758","doi":"10.1002/jgt.21795","title":"Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Vertex (graph theory); Bounded function; Independent set; Indifference graph; Discrete mathematics; Maximal independent set; Graph; 1-planar graph","score_opus":0.012063852795284016,"score_gpt":0.2689821085366713,"score_spread":0.2569182557413873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542539758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51339895,0.00008344269,0.48479915,0.00007970933,0.00032672146,0.00006608166,0.0000027700862,0.000014158499,0.0012290158],"genre_scores_gemma":[0.9863051,0.000058939335,0.013472002,0.00005278956,0.000029798677,0.0000015982923,5.591823e-7,0.000015477997,0.00006370223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781865,0.00048492945,0.0007198835,0.00016384567,0.000547501,0.00026517324],"domain_scores_gemma":[0.9974583,0.0005523286,0.0007962442,0.0005166472,0.00054563774,0.00013084336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021242178,0.00014294313,0.00041297817,0.0005692186,0.000089544796,0.000039457256,0.0012036228,0.00006352947,0.000054885524],"category_scores_gemma":[0.00034431962,0.00012132401,0.00028168753,0.00095330307,0.00033248018,0.000741847,0.00017530072,0.00028650602,0.0000049514656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001349677,0.00014270986,0.0037982124,0.00004657942,0.00010490022,0.0000052063947,0.00059768447,0.00006471668,0.05874786,0.9233626,0.000022375,0.012972149],"study_design_scores_gemma":[0.0007383261,0.0003311936,0.009183556,0.00013047417,0.000019128975,0.000106375235,0.000082503444,0.00043299733,0.019819794,0.96869296,0.00032414228,0.00013857441],"about_ca_topic_score_codex":0.0000013364839,"about_ca_topic_score_gemma":0.0000010641844,"teacher_disagreement_score":0.47290617,"about_ca_system_score_codex":0.000014132364,"about_ca_system_score_gemma":0.00007697495,"threshold_uncertainty_score":0.49474496},"labels":[],"label_agreement":null},{"id":"W1542956397","doi":"10.1007/3-540-45749-6_64","title":"Frequency Channel Assignment on Planar Networks","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Frequency assignment; Planar; Channel (broadcasting); Computer network; Telecommunications; Algorithm; Computer graphics (images)","score_opus":0.02724496262158387,"score_gpt":0.2615314947421288,"score_spread":0.2342865321205449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542956397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005716199,0.000672845,0.98356897,0.00080424635,0.0017934673,0.0005483608,0.000005903788,0.00022801987,0.012372463],"genre_scores_gemma":[0.3748108,0.0008921203,0.60569704,0.010359486,0.003305658,0.00013156739,0.000025704474,0.00030736026,0.004470242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939613,0.00008428581,0.00055075786,0.0022557224,0.001833165,0.0013147875],"domain_scores_gemma":[0.9959521,0.0008239489,0.00027866702,0.0023937502,0.00019039768,0.00036109504],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011121025,0.000742042,0.0006150002,0.0012785265,0.00041474172,0.00049035985,0.005708372,0.00044007177,0.00007055596],"category_scores_gemma":[0.000087076674,0.0006648352,0.00017958088,0.000946755,0.00094270066,0.000587113,0.0010518103,0.0017980126,0.00018280622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009759877,0.00007642309,0.00001771151,0.000022747825,0.000021752452,0.0004892639,0.00036688804,0.25167835,0.00004655478,0.28186882,0.00011165915,0.4652901],"study_design_scores_gemma":[0.00021146484,0.0003458397,0.000027342296,0.00030847627,0.0000029066482,0.000047122856,5.8177985e-8,0.4501351,0.00021512776,0.5475614,0.00050471013,0.0006404062],"about_ca_topic_score_codex":0.0000070047367,"about_ca_topic_score_gemma":0.000013125148,"teacher_disagreement_score":0.46464968,"about_ca_system_score_codex":0.00059449073,"about_ca_system_score_gemma":0.00021177028,"threshold_uncertainty_score":0.9996712},"labels":[],"label_agreement":null},{"id":"W1542970106","doi":"10.48550/arxiv.1005.5522","title":"Shrink-Wrapping trajectories for Linear Programming","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Science Foundation","keywords":"Mathematics; Linear programming; Convexity; Affine transformation; Interior point method; Second-order cone programming; Convex cone; Sequence (biology); Path (computing); Affine space; Linear space; Linear-fractional programming; Regular polygon; Convex optimization; Algorithm; Computer science; Geometry; Convex analysis","score_opus":0.09761090265019441,"score_gpt":0.24282631029229504,"score_spread":0.1452154076421006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542970106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0970617,0.00005380335,0.9002235,0.00008068653,0.00082537864,0.00088518666,0.000015304498,0.0004833603,0.0003711135],"genre_scores_gemma":[0.9134828,0.000048367536,0.08489469,0.000031718457,0.00021771203,0.000013040927,0.000017497872,0.00003815061,0.0012560195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974175,0.0001079923,0.00021792858,0.001404495,0.00013820302,0.00071387505],"domain_scores_gemma":[0.9972428,0.00034803338,0.00021514973,0.0015836252,0.00037134442,0.0002390298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056980527,0.00036802996,0.0003826797,0.00040885713,0.00036472577,0.00018998071,0.003005995,0.00042587463,0.000009710834],"category_scores_gemma":[0.00016277705,0.00042682415,0.0003458111,0.00077306526,0.00027090654,0.0005303881,0.0021821049,0.0012800851,0.00002337543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094104726,0.0001274913,0.000983775,0.00030842883,0.0001400402,0.00014731314,0.0005423203,0.038356196,0.00058018265,0.94635195,0.000050434108,0.012317773],"study_design_scores_gemma":[0.0009475028,0.00018705345,0.00020979057,0.00015489926,0.000056990037,0.000008619208,0.00016677653,0.53596157,0.0025485093,0.44395313,0.014719196,0.0010859884],"about_ca_topic_score_codex":0.000032826352,"about_ca_topic_score_gemma":0.000043578282,"teacher_disagreement_score":0.8164211,"about_ca_system_score_codex":0.00011890711,"about_ca_system_score_gemma":0.000286427,"threshold_uncertainty_score":0.9998184},"labels":[],"label_agreement":null},{"id":"W1542990689","doi":"10.1007/978-3-642-19222-7_7","title":"Shortest Paths between Shortest Paths and Independent Sets","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control reconfiguration; K shortest path routing; Shortest path problem; Sequence (biology); Yen's algorithm; Shortest Path Faster Algorithm; Floyd–Warshall algorithm; Graph","score_opus":0.03353041539316524,"score_gpt":0.2815773617864456,"score_spread":0.24804694639328037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542990689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009812762,0.0008392099,0.99207664,0.00025640952,0.0008398558,0.0007079721,0.000027562599,0.00024367457,0.004027379],"genre_scores_gemma":[0.8055206,0.00020648581,0.19267625,0.0006544897,0.00047401147,0.000028769613,0.000014839641,0.000098234275,0.00032634547],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99323183,0.00010069259,0.00075356115,0.0027736963,0.0017971636,0.0013430256],"domain_scores_gemma":[0.9953023,0.0010319666,0.00031652278,0.0023936841,0.00036686868,0.0005886247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018862116,0.00088131445,0.0008866345,0.0013700869,0.00045218994,0.0006871373,0.005337762,0.0005656894,0.000040008705],"category_scores_gemma":[0.00016598286,0.0008087526,0.0001609219,0.00087660976,0.0017921332,0.0011350411,0.004295896,0.0018900105,0.00007081155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007523116,0.000038749924,0.0037970378,0.000031201198,0.000025351917,0.0003606939,0.0010152158,0.0006388796,0.000078734636,0.031093396,0.000010529609,0.96290267],"study_design_scores_gemma":[0.00044607674,0.0006281747,0.0071351374,0.0005144621,0.000023213595,0.00024568907,5.8121856e-7,0.040308923,0.0011243589,0.9466272,0.0012476345,0.0016985408],"about_ca_topic_score_codex":0.00003142437,"about_ca_topic_score_gemma":0.00009843513,"teacher_disagreement_score":0.9612042,"about_ca_system_score_codex":0.00027148487,"about_ca_system_score_gemma":0.0005843672,"threshold_uncertainty_score":0.9994363},"labels":[],"label_agreement":null},{"id":"W154300135","doi":"","title":"Some Bounds on Alliances in Trees.","year":2010,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Dominating set; Mathematics; Cardinality (data modeling); Graph; Simple graph; Alliance; Offensive; Upper and lower bounds; Simple (philosophy); Discrete mathematics; Computer science; Data mining","score_opus":0.013036732546370977,"score_gpt":0.2734150912754956,"score_spread":0.2603783587291246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154300135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87640554,0.0012003939,0.06977966,0.0072613196,0.03372876,0.0027705687,0.000012398242,0.0010294118,0.007811923],"genre_scores_gemma":[0.9935045,0.0006983875,0.0049486468,0.00036662666,0.00013159386,0.000091280075,0.000011048371,0.000021433932,0.00022643084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981943,0.0001398826,0.00027538184,0.00060241617,0.00036732937,0.00042072096],"domain_scores_gemma":[0.99875885,0.00037341725,0.000114493676,0.0005078143,0.00009493212,0.00015047641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051544735,0.00022509701,0.00025533515,0.0004532561,0.00024276732,0.0002315632,0.00065194553,0.00020417343,0.000018232673],"category_scores_gemma":[0.00019437402,0.00021090965,0.00006457492,0.0011008139,0.00020947917,0.00059181324,0.00015950874,0.0006281949,0.000007802343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019919903,0.00031235453,0.0006975511,0.0000041694207,0.000009380961,0.000013499871,0.00009051659,0.02101923,0.00012659018,0.9698018,0.00023050999,0.007495192],"study_design_scores_gemma":[0.004612739,0.0012711432,0.0034367281,0.00010998465,0.000008523632,0.0000050886747,0.000055100343,0.1602346,0.0005198869,0.8264314,0.002681448,0.0006333479],"about_ca_topic_score_codex":0.0000042726933,"about_ca_topic_score_gemma":0.000023929675,"teacher_disagreement_score":0.14337039,"about_ca_system_score_codex":0.000036824178,"about_ca_system_score_gemma":0.00004899857,"threshold_uncertainty_score":0.8600646},"labels":[],"label_agreement":null},{"id":"W154378396","doi":"","title":"Comment on \"Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles\".","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Enhanced Data Rates for GSM Evolution; Hamiltonian (control theory); Combinatorics; Hamiltonian path; Graph; Computer science; Mathematical optimization; Optics; Physics; Artificial intelligence","score_opus":0.025989539586778323,"score_gpt":0.28188861639656165,"score_spread":0.25589907680978335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154378396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97475874,0.00032370997,0.00179053,0.0155147165,0.0015931178,0.0023446477,0.000016293498,0.00052720786,0.0031310078],"genre_scores_gemma":[0.9878918,0.000022004455,0.0093094595,0.0023036557,0.000012643988,0.00022835178,0.000008847677,0.000049717077,0.00017355486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957746,0.00078859704,0.0006914755,0.0008797758,0.00085108593,0.0010144259],"domain_scores_gemma":[0.99722403,0.00048398983,0.0002232775,0.0015633405,0.0001610284,0.0003443377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013558414,0.0004422912,0.0006530867,0.0006008731,0.00032599494,0.00022820146,0.0022187533,0.00016885097,0.000029620767],"category_scores_gemma":[0.00018857121,0.00041635963,0.00016966187,0.0014891356,0.00021834038,0.0005834213,0.00043577063,0.00069717056,0.00033616903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018572365,0.0009857047,0.0024053627,0.00002856049,0.000052600968,0.00008951839,0.0017267435,0.00019403921,0.001461389,0.9795894,0.0029296349,0.010351319],"study_design_scores_gemma":[0.010067479,0.001841447,0.0140935825,0.00023732125,0.000015435644,0.000025161658,0.00015192793,0.03319051,0.0025991532,0.92106926,0.015736999,0.0009717084],"about_ca_topic_score_codex":0.00004241692,"about_ca_topic_score_gemma":0.000072357136,"teacher_disagreement_score":0.05852013,"about_ca_system_score_codex":0.00045103597,"about_ca_system_score_gemma":0.00014843959,"threshold_uncertainty_score":0.9998288},"labels":[],"label_agreement":null},{"id":"W1546598357","doi":"10.37236/4053","title":"On the Hyperbolicity of Random Graphs","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Binomial (polynomial); Random graph; Discrete mathematics; Statistics","score_opus":0.008707904971047311,"score_gpt":0.24355808628778286,"score_spread":0.23485018131673555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546598357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5455131,0.0011004391,0.4471173,0.0036643927,0.00036780114,0.00018220086,2.34074e-7,0.000017971059,0.0020365443],"genre_scores_gemma":[0.99939424,0.0002765379,0.00003550682,0.00018586831,0.000028952756,0.0000021728888,3.52165e-8,0.000008787639,0.00006792357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762344,0.0007293043,0.0003466062,0.00010460028,0.0007258186,0.00047023658],"domain_scores_gemma":[0.99613386,0.0024182182,0.0004028535,0.0006770036,0.00030810057,0.00005997384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004902955,0.000117561096,0.00026365436,0.00013682725,0.000183777,0.00003683123,0.0026028543,0.00003624322,0.0000049142823],"category_scores_gemma":[0.0006534857,0.00005762341,0.00018896011,0.0008250931,0.00016862669,0.00016086649,0.00013584747,0.00090503576,0.0000052835894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009563133,0.000074367934,0.000033314718,0.0000027032015,0.000040953135,8.033962e-7,0.00014356911,0.00017198248,0.00047353073,0.99746376,0.0001485388,0.0013508372],"study_design_scores_gemma":[0.0010352042,0.0008258386,0.00011188237,0.000014788268,0.000010304942,0.00004712496,0.000017048504,0.0011168997,0.006818378,0.98894286,0.000997881,0.00006180234],"about_ca_topic_score_codex":0.0000021768883,"about_ca_topic_score_gemma":8.860846e-7,"teacher_disagreement_score":0.45388108,"about_ca_system_score_codex":0.00007803205,"about_ca_system_score_gemma":0.00018842462,"threshold_uncertainty_score":0.4836794},"labels":[],"label_agreement":null},{"id":"W1547065387","doi":"10.1016/j.jctb.2016.06.006","title":"5-list-coloring planar graphs with distant precolored vertices","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Planar graph; Order (exchange); Graph; Planar; Induced subgraph; Graph homomorphism","score_opus":0.011021558989236077,"score_gpt":0.24589534272845842,"score_spread":0.23487378373922235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547065387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82947284,0.0005966934,0.15306954,0.0021187386,0.0103687225,0.00048514453,0.00000902718,0.00018914194,0.0036901233],"genre_scores_gemma":[0.99566984,0.00009764689,0.0037094303,0.000031181935,0.00020663037,0.000009358969,1.7857671e-7,0.000021673208,0.00025403846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975919,0.000456819,0.0004957546,0.00025908748,0.0007406847,0.00045572693],"domain_scores_gemma":[0.9973007,0.0009856967,0.00048158306,0.0005249702,0.0004583866,0.000248705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017969323,0.00021661472,0.0003915635,0.0002632189,0.00021681919,0.00016228324,0.0015800673,0.00007351608,0.000040742594],"category_scores_gemma":[0.00044987275,0.00012111688,0.0001354756,0.0005330286,0.00039151197,0.0026630214,0.00015913353,0.00026954612,0.0000066922444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037149552,0.000097233096,0.00071554456,0.000012640369,0.00011697146,0.00016033546,0.00037962946,0.000005264895,0.0074176327,0.98357767,0.00009245207,0.0037096655],"study_design_scores_gemma":[0.0021196946,0.0024070619,0.000500034,0.00013922533,0.000018376897,0.00017835852,0.00014662376,0.0000036220415,0.021732764,0.9653623,0.0071776197,0.00021432688],"about_ca_topic_score_codex":0.0000010455773,"about_ca_topic_score_gemma":0.0000028168458,"teacher_disagreement_score":0.16619699,"about_ca_system_score_codex":0.0001175655,"about_ca_system_score_gemma":0.00019794176,"threshold_uncertainty_score":0.4939003},"labels":[],"label_agreement":null},{"id":"W1547799720","doi":"10.1007/978-3-540-73420-8_25","title":"Universal Algebra and Hardness Results for Constraint Satisfaction Problems","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Concordia University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Idempotence; Congruence (geometry); Reduct; Discrete mathematics; Semiring; Algebraic number; Combinatorics; Algebra over a field; Computer science; Rough set; Pure mathematics","score_opus":0.020002480328235362,"score_gpt":0.28802100532307223,"score_spread":0.26801852499483686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547799720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043634366,0.00005029757,0.954437,0.00071684265,0.0005867953,0.00044337616,0.0000037149607,0.000097960954,0.00002962783],"genre_scores_gemma":[0.6334999,0.0000035960413,0.36629352,0.00014797343,0.000045220688,0.0000041498593,5.935536e-7,0.000003984783,0.0000010578772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777836,0.000046382236,0.0002616916,0.00083641784,0.00042965167,0.000647513],"domain_scores_gemma":[0.99817413,0.0008802124,0.00008722023,0.00049539283,0.0001985055,0.00016455505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025477065,0.00015802326,0.00015883707,0.00048182558,0.00029826036,0.00026036287,0.0009024998,0.000071594375,7.0388586e-7],"category_scores_gemma":[0.0003035065,0.00014342993,0.0000322015,0.001573379,0.00084264,0.00089778856,0.00043059874,0.00023830036,0.0000018380847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050020975,0.000022263679,0.0014367432,0.000019792498,0.0000034989334,0.000022494292,0.0014589104,0.009616855,0.0040816874,0.026030637,0.000004872823,0.9572522],"study_design_scores_gemma":[0.0017497345,0.00046016998,0.02060912,0.000092405804,0.0000023301002,0.00015423672,0.0000072256616,0.6635081,0.024080621,0.2886712,0.00021770921,0.0004471575],"about_ca_topic_score_codex":0.000031564105,"about_ca_topic_score_gemma":0.00017369042,"teacher_disagreement_score":0.95680505,"about_ca_system_score_codex":0.00013466226,"about_ca_system_score_gemma":0.00017217839,"threshold_uncertainty_score":0.5848903},"labels":[],"label_agreement":null},{"id":"W1548559198","doi":"10.1016/j.jctb.2014.12.003","title":"Matroid 3-connectivity and branch width","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Matroid; Combinatorics; Minor (academic); Mathematics; Integer (computer science); Oriented matroid; Matroid partitioning; Set (abstract data type); Discrete mathematics; Graphic matroid; Computer science; Humanities","score_opus":0.018418209423534875,"score_gpt":0.27575564629247123,"score_spread":0.25733743686893634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548559198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72262686,0.0019451964,0.25699413,0.001693156,0.010519458,0.00025643935,0.0000027902875,0.000110042165,0.00585192],"genre_scores_gemma":[0.9937912,0.000046877707,0.00546792,0.00006024437,0.00040940443,0.0000019320005,1.233612e-7,0.00001351756,0.0002087604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979802,0.0006218787,0.00035445247,0.00018355461,0.0005713584,0.00028860662],"domain_scores_gemma":[0.9979501,0.0004904712,0.00029987647,0.00038053657,0.00053627044,0.00034276408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037279807,0.00015420569,0.00034789444,0.00019133346,0.00011824472,0.00018102198,0.00086717936,0.000071834234,0.000011044473],"category_scores_gemma":[0.0010133376,0.00012725906,0.000089692825,0.00038109973,0.00025431946,0.002214072,0.00032921933,0.0003830105,0.0000064293267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079386024,0.000068064786,0.00031347558,0.000008170868,0.00003590566,0.00004537361,0.000637271,0.000015796588,0.0010562224,0.98801947,0.0002877089,0.008718667],"study_design_scores_gemma":[0.0015486431,0.0010435703,0.00036093342,0.000019592728,0.000007035886,0.0005002148,0.00012929372,0.000025909423,0.0048916936,0.98563856,0.005695926,0.00013865507],"about_ca_topic_score_codex":0.0000011485657,"about_ca_topic_score_gemma":4.1329614e-7,"teacher_disagreement_score":0.27116433,"about_ca_system_score_codex":0.00006916258,"about_ca_system_score_gemma":0.0002189657,"threshold_uncertainty_score":0.5189474},"labels":[],"label_agreement":null},{"id":"W1551586077","doi":"10.1007/978-3-319-12340-0_20","title":"Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Planar; Mathematics; Constant (computer programming); Treewidth; Graph; Discrete mathematics; Physics; Pathwidth; Computer science","score_opus":0.0165859407235565,"score_gpt":0.28004999691450977,"score_spread":0.26346405619095326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551586077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001012821,0.00014889993,0.99726087,0.00019123482,0.0005691354,0.0009904408,0.00008316621,0.000137074,0.0005179226],"genre_scores_gemma":[0.012872086,0.000016137,0.98639613,0.00027691902,0.00017580965,0.000022814189,0.000040350973,0.000044670756,0.00015509587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618345,0.00007622888,0.00066778855,0.0013215509,0.0010739036,0.0006770493],"domain_scores_gemma":[0.99630666,0.0012173065,0.0004828417,0.0012554262,0.0005596348,0.00017812614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011084612,0.0004848411,0.00070131134,0.00090889365,0.00030914336,0.00024810093,0.00263854,0.000322064,0.000019217483],"category_scores_gemma":[0.00009711346,0.00046025537,0.00021981337,0.0006705005,0.0013644755,0.0005507118,0.00043989712,0.00054677716,0.00003197336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022669523,0.000031693846,0.000007606803,0.00008988168,0.000020857477,0.000006908276,0.0002900593,0.0054258835,0.0018826649,0.093591906,0.000014379929,0.8986155],"study_design_scores_gemma":[0.00034102707,0.00027050587,0.000010309561,0.00018681672,0.000004740125,0.000022987213,4.5096186e-8,0.60081774,0.004370524,0.39336386,0.0002824503,0.00032900914],"about_ca_topic_score_codex":0.000004746623,"about_ca_topic_score_gemma":0.000004605032,"teacher_disagreement_score":0.89828646,"about_ca_system_score_codex":0.00015746464,"about_ca_system_score_gemma":0.0003835277,"threshold_uncertainty_score":0.99978495},"labels":[],"label_agreement":null},{"id":"W1554183532","doi":"10.1007/s10107-016-1041-3","title":"An axiomatic duality framework for the theta body and related convex corners","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Mathematics; Polytope; Combinatorics; Discrete mathematics","score_opus":0.03534091095242158,"score_gpt":0.3469610993440978,"score_spread":0.3116201883916762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554183532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009836519,0.00010763295,0.9859368,0.0026506344,0.00007034414,0.0009442967,0.0000014474047,0.00025833835,0.00019399622],"genre_scores_gemma":[0.7506502,0.0000051477555,0.24889107,0.000057115074,0.000021293792,0.00020685786,4.1494954e-7,0.00001921337,0.00014865343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982175,0.00018050475,0.00034186212,0.00041488558,0.00033281036,0.0005124],"domain_scores_gemma":[0.9941557,0.004519764,0.00010465945,0.0009727762,0.000061754006,0.00018534901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019694162,0.00016622036,0.00023930363,0.000051602117,0.00031082117,0.00025877083,0.00091911753,0.00010069927,0.000023222066],"category_scores_gemma":[0.0014672969,0.000081384875,0.00008279658,0.00029934605,0.0005140413,0.00041547915,0.00021442816,0.00016979157,0.000040696035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009090813,0.000068241745,0.000036845162,0.000053994576,0.000028044544,0.0000029653042,0.0006256899,4.5653422e-7,0.00027711884,0.8293428,0.000004824932,0.16954994],"study_design_scores_gemma":[0.0002837963,0.00015422836,0.000086856206,0.00010924975,0.000014525566,0.000030473377,0.00016826415,0.037960906,0.0003855309,0.96034974,0.00030895844,0.00014748097],"about_ca_topic_score_codex":7.565861e-7,"about_ca_topic_score_gemma":2.929592e-7,"teacher_disagreement_score":0.74081373,"about_ca_system_score_codex":0.000023969013,"about_ca_system_score_gemma":0.000022813507,"threshold_uncertainty_score":0.3318779},"labels":[],"label_agreement":null},{"id":"W1554852049","doi":"10.1007/978-3-642-15369-3_25","title":"Maximum Flows on Disjoint Paths","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Upper and lower bounds; Combinatorics; Maximum flow problem; Mathematics; Path (computing); Enhanced Data Rates for GSM Evolution; Flow (mathematics); Simple (philosophy); Constant (computer programming); Flow network; Planar; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.01871409523069201,"score_gpt":0.2704832735398518,"score_spread":0.2517691783091598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554852049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015951249,0.00015203378,0.98770636,0.00091093784,0.0028207947,0.000545854,0.000008885795,0.0002643799,0.007431214],"genre_scores_gemma":[0.05631419,0.000063910964,0.9386558,0.0026993942,0.0009861783,0.00003570257,0.000007545749,0.000112193935,0.0011250919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939331,0.000062320476,0.00054607855,0.002390076,0.0018832148,0.0011852501],"domain_scores_gemma":[0.9949691,0.0008578011,0.00024310786,0.0032550204,0.0002950632,0.00037989882],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001446384,0.00073159405,0.00062551454,0.0014177377,0.00044179324,0.00064610806,0.006676265,0.00051329785,0.00007565688],"category_scores_gemma":[0.0002343023,0.00062781177,0.00022455196,0.00086848775,0.0012470927,0.00066197745,0.0025906505,0.0028450983,0.00033249147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014266311,0.00004602248,0.0000105111185,0.00002254121,0.000007623961,0.0002462263,0.00033201906,0.0072967927,0.0012421972,0.115080625,0.00000901633,0.8756921],"study_design_scores_gemma":[0.00024940778,0.00034086354,0.00004306539,0.00024465288,0.0000028233658,0.00007341748,6.878283e-8,0.14281924,0.0044183205,0.8460973,0.0049373438,0.00077348214],"about_ca_topic_score_codex":0.000007005413,"about_ca_topic_score_gemma":0.00008183303,"teacher_disagreement_score":0.8749187,"about_ca_system_score_codex":0.0002901988,"about_ca_system_score_gemma":0.0005450833,"threshold_uncertainty_score":0.99961734},"labels":[],"label_agreement":null},{"id":"W1558213091","doi":"10.1007/978-3-540-79719-7_10","title":"Complexity and Algorithms for Well-Structured k-SAT Instances","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Treewidth; Combinatorics; Constructive; Discrete mathematics; Path (computing); Computational complexity theory; Algorithm; Graph; Pathwidth; Computer science; Line graph","score_opus":0.047337264908975586,"score_gpt":0.30210024391376333,"score_spread":0.2547629790047877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558213091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015991883,0.0016189779,0.9941182,0.00063969794,0.0011526247,0.0008958995,0.000029141464,0.00017359386,0.0012119134],"genre_scores_gemma":[0.043824542,0.00039272718,0.95391613,0.0009211167,0.00044077897,0.00003108244,0.000013776179,0.000054009728,0.00040581822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526244,0.00005452577,0.00052148494,0.0020826324,0.0011062426,0.0009726835],"domain_scores_gemma":[0.9966247,0.0010166111,0.00027950626,0.0014248801,0.00036770734,0.00028661665],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008775974,0.0006364204,0.0007448452,0.000910529,0.00067214074,0.00042796961,0.003591495,0.00032447846,0.000011500468],"category_scores_gemma":[0.00013761422,0.00056963845,0.00015293041,0.0006717283,0.0033743812,0.0008204329,0.0016124025,0.00086041004,0.000012995755],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003798558,0.00002558468,0.00007807269,0.000105253006,0.000025086965,0.00010233654,0.0010813718,0.003947681,0.0001423096,0.10009258,0.000092783215,0.89426893],"study_design_scores_gemma":[0.0005375393,0.0002566943,0.000198991,0.00016122853,0.0000044838803,0.00019953134,3.0836065e-7,0.24687745,0.0010479745,0.7430902,0.0068937303,0.0007318373],"about_ca_topic_score_codex":0.0000086566315,"about_ca_topic_score_gemma":0.000091281225,"teacher_disagreement_score":0.8935371,"about_ca_system_score_codex":0.00022142306,"about_ca_system_score_gemma":0.00042898074,"threshold_uncertainty_score":0.9996755},"labels":[],"label_agreement":null},{"id":"W1559047461","doi":"","title":"Simple, Linear-Time Modular Decomposition","year":2007,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modular decomposition; Modular design; Computer science; Simple (philosophy); Time complexity; Decomposition; Undirected graph; Graph theory; Algorithm; Theoretical computer science; Graph; Tree decomposition; Linear programming; Mathematical optimization; Mathematics; Line graph; Combinatorics; Pathwidth","score_opus":0.041609745378921245,"score_gpt":0.23058745137637693,"score_spread":0.18897770599745567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559047461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36021236,0.000009690035,0.63750714,0.000022388927,0.00004101599,0.00008498428,0.0000012900168,0.00016263212,0.001958495],"genre_scores_gemma":[0.99216217,0.000011551689,0.0064302003,0.00009321205,0.000040144132,1.3932569e-7,0.0000048901597,0.000010749374,0.0012469694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869704,0.00008256111,0.00012034843,0.0005314782,0.00010660462,0.00046196417],"domain_scores_gemma":[0.99873775,0.00016985543,0.000059179874,0.00069346937,0.00012917623,0.00021057653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052070525,0.00013350455,0.00012741119,0.00027200102,0.00022516125,0.000034161803,0.0010172549,0.000074140175,0.000051955503],"category_scores_gemma":[0.000028227485,0.00015467813,0.00009234783,0.0012263942,0.00010582587,0.00078937446,0.0003455502,0.00018454446,0.00051748025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114216076,0.00014663488,0.0031828075,0.000009885198,0.00004115988,0.0009535347,0.00012617909,0.063072234,0.017902356,0.90996134,0.0001374717,0.0043521943],"study_design_scores_gemma":[0.000724362,0.00014753362,0.0049299053,0.000010189149,0.000010136331,0.000019418047,0.000040418505,0.7605192,0.01155648,0.21985333,0.0017920736,0.00039692197],"about_ca_topic_score_codex":0.000011584518,"about_ca_topic_score_gemma":0.000005872671,"teacher_disagreement_score":0.697447,"about_ca_system_score_codex":0.00010531891,"about_ca_system_score_gemma":0.000031125335,"threshold_uncertainty_score":0.6651334},"labels":[],"label_agreement":null},{"id":"W1559782353","doi":"10.1002/jgt.21797","title":"Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Conjecture; Claw; Homogeneous; Complement (music); Graph; Discrete mathematics; Pathwidth; Indifference graph; Strong perfect graph theorem; Chordal graph; 1-planar graph; Line graph","score_opus":0.009072508602622455,"score_gpt":0.2538911671698522,"score_spread":0.24481865856722976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559782353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8730875,0.004148228,0.11861265,0.0014192703,0.00053572026,0.0002518728,0.000008906553,0.00008461036,0.0018512106],"genre_scores_gemma":[0.9919607,0.00041551702,0.0070100403,0.0004448975,0.00006627234,0.0000032746277,3.9017286e-7,0.000023348657,0.00007558235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974413,0.0007148364,0.00042643707,0.00037087206,0.00060444535,0.00044210092],"domain_scores_gemma":[0.9974045,0.0010187714,0.00034482646,0.00070517266,0.00017436601,0.00035236994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028146347,0.0002722422,0.00042509672,0.00090162613,0.00023709542,0.00017063777,0.001135763,0.00012321497,0.000013727911],"category_scores_gemma":[0.0003588658,0.00020214474,0.00021761014,0.0005774955,0.0006696688,0.0006250421,0.00029811473,0.00077578664,0.0000025304778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016001186,0.000058587593,0.0009907768,0.000020728688,0.00008964136,0.000037850084,0.00025392856,0.000016096386,0.000851938,0.9598176,0.00038769984,0.037315127],"study_design_scores_gemma":[0.0013569114,0.0012642692,0.0066014333,0.000071106166,0.00002276902,0.00043236327,0.00007633846,0.00010875425,0.0005190946,0.98793155,0.0013940685,0.00022133505],"about_ca_topic_score_codex":0.0000012192442,"about_ca_topic_score_gemma":0.0000031141547,"teacher_disagreement_score":0.11887314,"about_ca_system_score_codex":0.000014991102,"about_ca_system_score_gemma":0.000038898103,"threshold_uncertainty_score":0.82432234},"labels":[],"label_agreement":null},{"id":"W1559927413","doi":"","title":"Detecting Backdoor Sets with Respect to Horn and Binary Clauses.","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Backdoor; Parameterized complexity; Satisfiability; Mathematics; Class (philosophy); Set (abstract data type); Binary number; Discrete mathematics; Combinatorics; Boolean satisfiability problem; French horn; Computer science; Artificial intelligence; Arithmetic; Physics","score_opus":0.024991978151011344,"score_gpt":0.30241421303184235,"score_spread":0.277422234880831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559927413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5585001,0.000058658457,0.43620265,0.0013665799,0.000034429955,0.00021324516,4.6910222e-7,0.00021509569,0.003408752],"genre_scores_gemma":[0.7892391,0.000004481506,0.21018799,0.0002548776,0.000014157598,0.000011130212,9.488691e-8,0.000010454221,0.0002777228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883723,0.000039816176,0.000095572046,0.00042747843,0.00024994762,0.00034993174],"domain_scores_gemma":[0.99916184,0.00009963031,0.000020150403,0.00046736543,0.000060115053,0.0001908805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028454314,0.00010942455,0.000103371814,0.00018435238,0.00016479209,0.00012185078,0.00044920153,0.000027726166,0.000012606971],"category_scores_gemma":[0.000057214835,0.000081853446,0.000015993335,0.0007839221,0.000065411194,0.00040943033,0.00038145974,0.00015132698,0.000068779824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000804379,0.00030243528,0.0065006674,0.0001003103,0.00012525747,0.0015178544,0.0074054087,0.010273498,0.08577143,0.5866274,0.00064035173,0.29993096],"study_design_scores_gemma":[0.0086076,0.012270315,0.051303517,0.00054353033,0.000019717761,0.0019106641,0.0022273634,0.010244742,0.3503485,0.5496563,0.009631695,0.0032360847],"about_ca_topic_score_codex":0.000024440127,"about_ca_topic_score_gemma":0.00008232347,"teacher_disagreement_score":0.29669487,"about_ca_system_score_codex":0.00004839322,"about_ca_system_score_gemma":0.00005741092,"threshold_uncertainty_score":0.33378866},"labels":[],"label_agreement":null},{"id":"W1560744624","doi":"10.1007/978-3-642-13078-6_5","title":"Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Pedigree chart; Computer science; Algorithm; Recombination; Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematics; Artificial intelligence; Genetics; Biology","score_opus":0.024338078797069902,"score_gpt":0.274277897785305,"score_spread":0.24993981898823509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560744624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010115782,0.00022532389,0.99677795,0.00025580602,0.0005492747,0.00074823154,0.000024691271,0.00011630812,0.000290844],"genre_scores_gemma":[0.010128441,0.000006767508,0.98861647,0.00031074585,0.00037112524,0.00003239195,0.000008227375,0.000049251274,0.00047655834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586535,0.000037972008,0.00049309974,0.0015783204,0.0011549239,0.00087035063],"domain_scores_gemma":[0.99559665,0.0015289467,0.00035883122,0.0016604075,0.00065029936,0.00020484423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089563936,0.0005561635,0.00067422196,0.00097422546,0.00023446158,0.00031100094,0.0037306664,0.00034915569,0.000013191766],"category_scores_gemma":[0.00016674255,0.0004404508,0.00018981552,0.00069286104,0.0019021884,0.00066007813,0.001093537,0.0009079028,0.000006024814],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025117395,0.0000790913,0.00013534269,0.000066735316,0.000025881549,0.000043281718,0.00046349276,0.0027916508,0.005854964,0.013027221,0.000010105312,0.97747713],"study_design_scores_gemma":[0.00065415225,0.0016569956,0.000064464664,0.00027403407,0.000014318608,0.00011557045,2.4160423e-7,0.4948785,0.06502911,0.43489242,0.001486824,0.00093335594],"about_ca_topic_score_codex":0.000007170179,"about_ca_topic_score_gemma":0.00010984563,"teacher_disagreement_score":0.9765438,"about_ca_system_score_codex":0.00011201694,"about_ca_system_score_gemma":0.0004416426,"threshold_uncertainty_score":0.99980474},"labels":[],"label_agreement":null},{"id":"W1561229603","doi":"10.1007/11564751_30","title":"Maximum Constraint Satisfaction on Diamonds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Constraint satisfaction problem; Constraint (computer-aided design); Computer science; Constraint satisfaction dual problem; Lattice (music); Constraint satisfaction; Domain (mathematical analysis); Mathematical optimization; Combinatorics; Mathematics; Local consistency; Artificial intelligence; Geometry","score_opus":0.020528245553279045,"score_gpt":0.2781065930185123,"score_spread":0.2575783474652333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561229603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014021175,0.00019892158,0.98373,0.0010413624,0.0014290041,0.00044190497,0.000007722455,0.00024152426,0.012769301],"genre_scores_gemma":[0.44878936,0.00013390569,0.54595476,0.0028657475,0.0010060609,0.00002786271,0.0000060026937,0.00008503681,0.0011312559],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950818,0.00006212077,0.0004935599,0.0018726314,0.0015555065,0.000934372],"domain_scores_gemma":[0.9965897,0.00078284455,0.00023991747,0.0018816196,0.00022720515,0.0002787031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010458321,0.00059596234,0.00050208543,0.0014223054,0.00032370246,0.0004868319,0.0030453373,0.00035330624,0.000088231536],"category_scores_gemma":[0.00012634325,0.0005501723,0.00016358866,0.00074500707,0.0014619104,0.00074470876,0.0010931517,0.0015042116,0.00023408495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008398046,0.000015750264,0.00004342066,0.000010018561,0.0000066317425,0.00007459675,0.00015877135,0.018739298,0.00012259171,0.14300233,0.000012550515,0.8378056],"study_design_scores_gemma":[0.0003740826,0.00041060615,0.00047995255,0.0003115081,0.0000041529865,0.000121501835,1.6054777e-7,0.11538371,0.0020337477,0.877189,0.0028056018,0.0008859708],"about_ca_topic_score_codex":0.000009833951,"about_ca_topic_score_gemma":0.00008334064,"teacher_disagreement_score":0.83691967,"about_ca_system_score_codex":0.00059997273,"about_ca_system_score_gemma":0.00049434544,"threshold_uncertainty_score":0.999695},"labels":[],"label_agreement":null},{"id":"W1561371316","doi":"","title":"Linear vertex arboricity, independence number and clique cover number","year":2001,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Arboricity; Independence number; Mathematics; Combinatorics; Vertex (graph theory); Vertex cover; Degeneracy (biology); Clique; Upper and lower bounds; Independence (probability theory); Edge cover; Discrete mathematics; Graph; Statistics; Planar graph; Biology","score_opus":0.012966408040262192,"score_gpt":0.24617425426983983,"score_spread":0.23320784622957763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561371316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47476003,0.000046884426,0.35893014,0.00019048076,0.00078826374,0.0002511391,0.000008951311,0.0002967691,0.16472736],"genre_scores_gemma":[0.97723454,0.00009762389,0.0074004275,0.00010344849,0.000113248105,0.0000018732527,0.0000049999544,0.000012828815,0.015031029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997612,0.0001846018,0.00022413017,0.0007506447,0.0007711328,0.00045752048],"domain_scores_gemma":[0.99846536,0.00020308144,0.00011131032,0.0005768208,0.0003286317,0.0003147716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025906338,0.00025004905,0.00022420351,0.00021617496,0.0010682859,0.00016024346,0.0010059817,0.00019803329,0.00007272707],"category_scores_gemma":[0.00008578949,0.00028401142,0.00010065146,0.00103524,0.0007204429,0.0020047883,0.00073141506,0.0005451278,0.00031767235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011512262,0.00014424416,0.112574086,0.000020701798,0.000058585978,0.004723494,0.00010277063,0.0010932104,0.0012410826,0.8787693,0.00020569669,0.0009517238],"study_design_scores_gemma":[0.007666418,0.00044918052,0.34997505,0.0007267219,0.00016557131,0.021698207,0.00044323946,0.07635396,0.010982307,0.05559679,0.4715929,0.0043496517],"about_ca_topic_score_codex":0.00014797218,"about_ca_topic_score_gemma":0.000014291622,"teacher_disagreement_score":0.8231725,"about_ca_system_score_codex":0.0003919221,"about_ca_system_score_gemma":0.0004706589,"threshold_uncertainty_score":0.9999612},"labels":[],"label_agreement":null},{"id":"W156247037","doi":"","title":"Notes on factor-critically, extendability and independence number.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Factor (programming language); Independence number; Discrete mathematics; Statistics; Computer science; Programming language","score_opus":0.02805785495427411,"score_gpt":0.3083864145964977,"score_spread":0.2803285596422236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156247037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99016917,0.0000577722,0.006019878,0.00073418586,0.0005261387,0.00019155674,0.0000036952958,0.00019664,0.002100955],"genre_scores_gemma":[0.99605644,0.00004025302,0.0035906236,0.00020815908,0.0000053077656,0.000014786122,5.4674274e-7,0.000011905206,0.00007197918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979464,0.00018147839,0.00019523285,0.0006051496,0.0006252357,0.00044652433],"domain_scores_gemma":[0.9975895,0.0010490038,0.000036175777,0.0008483887,0.00023326764,0.00024361715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034050713,0.00018254107,0.00020737536,0.00006855152,0.0003097932,0.000070216534,0.0008407446,0.00009888999,0.00004080243],"category_scores_gemma":[0.0009494299,0.00016526703,0.000052223382,0.00038409122,0.00040278313,0.00055038155,0.00044632578,0.0004305908,0.00015115165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015356452,0.00013358038,0.032466967,0.000008900639,0.0000062337226,0.00007092934,0.00023244657,0.0000013904629,0.00032813713,0.9615419,0.000042711363,0.0051514558],"study_design_scores_gemma":[0.00041734774,0.00016403686,0.081198536,0.000013435851,0.0000010198075,0.00007429494,0.000008294052,0.0004085874,0.0043515484,0.9129694,0.00018736855,0.00020610064],"about_ca_topic_score_codex":0.000021548854,"about_ca_topic_score_gemma":0.000002150237,"teacher_disagreement_score":0.048731573,"about_ca_system_score_codex":0.00005555793,"about_ca_system_score_gemma":0.00007858955,"threshold_uncertainty_score":0.6739394},"labels":[],"label_agreement":null},{"id":"W156285056","doi":"","title":"K-Dominating Sets of Cardinal Products of Paths.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular cardinal; Combinatorics","score_opus":0.015076404813184943,"score_gpt":0.2741882838147326,"score_spread":0.25911187900154764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156285056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99666053,0.0003048866,0.00019262015,0.00012313404,0.00019186828,0.00014784397,0.0000019520317,0.00003130201,0.0023458356],"genre_scores_gemma":[0.9911138,0.00003311184,0.008704289,0.000007889421,0.0000022477384,0.000006200466,4.6532514e-7,0.0000071864597,0.00012480601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988657,0.00011136964,0.000220673,0.00027059138,0.00031738557,0.00021426308],"domain_scores_gemma":[0.9990177,0.0001447658,0.00008302401,0.00051871024,0.00017950317,0.00005628131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053256704,0.000089276036,0.00020660847,0.00009055205,0.000050439558,0.000012976013,0.00052631844,0.000032912078,0.000013089579],"category_scores_gemma":[0.00014594333,0.00008740907,0.000036806185,0.00055017107,0.0001480284,0.00027193173,0.00017178478,0.00011456064,0.0000062355166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016525202,0.00007435735,0.0017105257,0.00006142123,0.000015290727,0.00000809648,0.0008006535,0.000016650696,0.006734197,0.8934665,0.000056449764,0.097039364],"study_design_scores_gemma":[0.0007409255,0.00027542197,0.007826885,0.00007352379,0.0000053982326,0.000018166545,0.000048073387,0.0017728186,0.069451235,0.91939974,0.00022722968,0.00016060952],"about_ca_topic_score_codex":0.000012430028,"about_ca_topic_score_gemma":2.1651948e-7,"teacher_disagreement_score":0.09687875,"about_ca_system_score_codex":0.00001364785,"about_ca_system_score_gemma":0.000051195257,"threshold_uncertainty_score":0.35644382},"labels":[],"label_agreement":null},{"id":"W156526445","doi":"","title":"Transformation of Spanning Trees in a 2-Connected Graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spanning tree; Mathematics; Transformation (genetics); Connected dominating set; Graph; Combinatorics; Chemistry","score_opus":0.01830503032991665,"score_gpt":0.27788232892317394,"score_spread":0.2595772985932573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156526445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97423023,0.00010720803,0.022018412,0.00027223647,0.00024430436,0.00018048016,5.9530623e-7,0.00008535678,0.0028611622],"genre_scores_gemma":[0.9982924,0.00003846878,0.0015985317,0.000021853883,0.0000012958957,0.000014883314,0.0000016336159,0.000006491361,0.000024484181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988928,0.00011186937,0.00026036976,0.00019674018,0.00026557982,0.00027267687],"domain_scores_gemma":[0.9992887,0.00015192662,0.00006406222,0.00035549107,0.00008444484,0.000055411907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041699968,0.000093534516,0.00016330737,0.00039482134,0.000047950965,0.000025596744,0.000595059,0.000048126665,0.000008343801],"category_scores_gemma":[0.00006760052,0.00009476541,0.000051562518,0.0016530675,0.00005711401,0.00071379694,0.000059442165,0.0001494877,0.0000082603265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025523357,0.00008429043,0.005444528,0.0000070404876,0.0000062023023,0.0000143909165,0.0015030843,0.00018653963,0.0033527098,0.9816053,0.0000143499465,0.0077560437],"study_design_scores_gemma":[0.001122298,0.00012633625,0.016545406,0.00004006225,0.0000014304499,0.000008701188,0.00010484634,0.008214186,0.007549152,0.96596617,0.00019852193,0.00012290615],"about_ca_topic_score_codex":0.000033101926,"about_ca_topic_score_gemma":0.000027366501,"teacher_disagreement_score":0.024062114,"about_ca_system_score_codex":0.000029769873,"about_ca_system_score_gemma":0.00003098976,"threshold_uncertainty_score":0.38644212},"labels":[],"label_agreement":null},{"id":"W1566398300","doi":"10.5555/1496770.1496895","title":"List-color-critical graphs on a fixed surface","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; List coloring; Discrete mathematics; Vertex (graph theory); Graph; Edge coloring; Graph coloring; Graph power; Line graph","score_opus":0.02510923386739464,"score_gpt":0.3320261162720462,"score_spread":0.30691688240465154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566398300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2580524,0.00012863557,0.5788295,0.025350181,0.00044705204,0.000489525,0.0000035328658,0.0012376118,0.13546151],"genre_scores_gemma":[0.94187886,0.0000062880513,0.054488305,0.0019822156,0.000015779475,0.0000030617723,4.8189855e-7,0.000005461153,0.0016195795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984079,0.00011435625,0.00014269262,0.000435662,0.00041962726,0.000479759],"domain_scores_gemma":[0.9984927,0.000492903,0.00001476066,0.00071197096,0.000093307885,0.00019433988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035080966,0.0001279747,0.00013492288,0.00011049218,0.00014202985,0.00012846892,0.0009955493,0.000055099517,0.00009101359],"category_scores_gemma":[0.00024763666,0.000105854444,0.000077387835,0.0007006606,0.00011066278,0.0003770306,0.00011465838,0.00022944334,0.00027241593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020402404,0.00010149868,0.000050927036,0.0000016907798,0.0000023732637,0.00003467137,0.00005090523,0.0000711751,0.0037199159,0.9854923,0.0011374634,0.009316676],"study_design_scores_gemma":[0.00036926707,0.0012329431,0.0021834413,0.000015413956,0.0000016093459,0.00001813164,0.000018902832,0.014271205,0.014933873,0.9643041,0.0023623188,0.00028878872],"about_ca_topic_score_codex":0.0000044524018,"about_ca_topic_score_gemma":0.0000029130247,"teacher_disagreement_score":0.6838264,"about_ca_system_score_codex":0.000026725975,"about_ca_system_score_gemma":0.00003340076,"threshold_uncertainty_score":0.4316619},"labels":[],"label_agreement":null},{"id":"W1567455550","doi":"10.4230/dagrep.4.2.38","title":"Graph Modification Problems (Dagstuhl Seminar 14071)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Universität Ulm; Université de Montpellier; Universität Rostock; Korea Advanced Institute of Science and Technology; Technische Universität Berlin; University of Haifa; National and Kapodistrian University of Athens; Goethe-Universität Frankfurt am Main; Magyar Tudományos Akadémia; Universität Trier; Durham University; University of Oregon; Universitetet i Bergen; University of Leeds; Uniwersytet Warszawski; Indian Institute of Science; University of Toronto; University of Ioannina; Universiteit Maastricht","keywords":"Graph; Computer science; Theoretical computer science","score_opus":0.023628448558856565,"score_gpt":0.2844284748760495,"score_spread":0.26080002631719296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567455550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04646928,0.00008340979,0.9429661,0.0005054849,0.00062044075,0.0018552691,0.00011438641,0.0006151048,0.0067705256],"genre_scores_gemma":[0.90891486,0.000096630676,0.08782146,0.0009787603,0.00021299548,0.00061138225,0.00033769757,0.00009570569,0.00093050074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548745,0.0001508937,0.0013269355,0.000622484,0.0010378283,0.0013743965],"domain_scores_gemma":[0.99583465,0.00039028234,0.00059184345,0.002141035,0.0006075091,0.0004346735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019954888,0.0005665847,0.0005725568,0.0006958571,0.00067692914,0.0006599437,0.0030530975,0.00029346463,0.000019218427],"category_scores_gemma":[0.00029153057,0.00051969173,0.00035460424,0.0011103525,0.0002985508,0.003304133,0.0007662395,0.0006706336,0.00040951173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020699964,0.0013657238,0.005195152,0.0013578682,0.00033874917,0.000006690239,0.01892335,0.0045292205,0.0019257615,0.80366254,0.01068839,0.15179954],"study_design_scores_gemma":[0.0062403358,0.0016422586,0.0018434227,0.00043816827,0.00005647388,0.00015530104,0.00094271306,0.54120016,0.007932916,0.16270521,0.2746164,0.0022266577],"about_ca_topic_score_codex":0.00001165458,"about_ca_topic_score_gemma":0.000006826866,"teacher_disagreement_score":0.8624456,"about_ca_system_score_codex":0.00015298631,"about_ca_system_score_gemma":0.00007424093,"threshold_uncertainty_score":0.99972546},"labels":[],"label_agreement":null},{"id":"W1567556142","doi":"10.5555/2133036.2133167","title":"The dichotomy of list homomorphisms for digraphs","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Mathematics; Conjecture; Discrete mathematics; Constraint satisfaction problem","score_opus":0.048820308952243,"score_gpt":0.2849847899260437,"score_spread":0.23616448097380072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567556142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050409227,0.00014529935,0.9638245,0.0001715025,0.00013412893,0.00037353486,0.0000029837206,0.000076692944,0.030230427],"genre_scores_gemma":[0.92257744,0.00002905659,0.075168476,0.000066007175,0.000012125819,0.00009194007,3.8163532e-7,0.000007411089,0.0020471497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992325,0.00003667271,0.00014176458,0.00017414962,0.00017066131,0.00024429124],"domain_scores_gemma":[0.9987317,0.00038069123,0.000050594856,0.0006488813,0.0001303991,0.000057786794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004575513,0.00006417917,0.00008239741,0.00006072547,0.000166806,0.00003116558,0.0013333912,0.000021256717,0.000021107913],"category_scores_gemma":[0.00007064659,0.000037943548,0.000083080544,0.0003315337,0.0002464234,0.00020904804,0.0001753256,0.000057972095,0.000007463049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017821685,0.000026306741,0.0003187276,0.0000038544003,0.0000095085925,7.888807e-7,0.00018697059,3.0025151e-7,0.00045207748,0.9852601,0.00033796398,0.013385563],"study_design_scores_gemma":[0.00027620813,0.00018932868,0.0012614517,0.0000050565072,0.0000021675282,0.0000033964013,0.000057979112,0.0016260712,0.045765728,0.94035786,0.010359482,0.00009525433],"about_ca_topic_score_codex":0.0000178904,"about_ca_topic_score_gemma":0.00001733405,"teacher_disagreement_score":0.9175365,"about_ca_system_score_codex":0.0000049267514,"about_ca_system_score_gemma":0.000023604007,"threshold_uncertainty_score":0.24777947},"labels":[],"label_agreement":null},{"id":"W1568391928","doi":"10.37236/5180","title":"The Bondage Number of Random Graphs","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Domination analysis; Mathematics; Dominating set; Vertex (graph theory); Graph; Upper and lower bounds; Bound graph; Neighbourhood (mathematics); Discrete mathematics; Graph power; Line graph","score_opus":0.010165258565285135,"score_gpt":0.29121616005334944,"score_spread":0.28105090148806433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568391928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060789727,0.02775519,0.8943369,0.0073284963,0.00385843,0.0007819714,0.0000055036508,0.000060294322,0.0050835004],"genre_scores_gemma":[0.9913467,0.007621218,0.000084741754,0.00003072143,0.000091245194,0.000009800306,2.3170188e-7,0.00002871268,0.0007866031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550074,0.0009706673,0.0009208068,0.00026003338,0.0013637132,0.0009840606],"domain_scores_gemma":[0.99325305,0.0023887528,0.0016251793,0.0016476021,0.00096676196,0.00011867678],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006835918,0.00030434653,0.0006196655,0.00017197792,0.00034003973,0.00015096956,0.007109844,0.00016860302,0.0000071788927],"category_scores_gemma":[0.00044118054,0.00014317613,0.0005924774,0.00065118546,0.00043789492,0.0002486193,0.0015330728,0.00284475,0.000010367298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019166649,0.00006267135,0.00009059345,0.000019301015,0.0002477242,0.0000091506545,0.00018345163,0.000031626754,0.00011574599,0.9958404,0.00043739192,0.0027703005],"study_design_scores_gemma":[0.0014831534,0.00020480629,0.000041669937,0.000106273896,0.000038458107,0.00019375084,0.000023083478,0.000113225855,0.0018261557,0.9909192,0.0048879124,0.00016232012],"about_ca_topic_score_codex":0.00000258171,"about_ca_topic_score_gemma":0.000001632101,"teacher_disagreement_score":0.930557,"about_ca_system_score_codex":0.00032985833,"about_ca_system_score_gemma":0.0015933379,"threshold_uncertainty_score":0.99945575},"labels":[],"label_agreement":null},{"id":"W1572300247","doi":"10.55016/ojs/cdm.v5i2.62000","title":"Connected domination dot-critical graphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.012747377189052157,"score_gpt":0.3389732156815263,"score_spread":0.3262258384924741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572300247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02224597,0.000019857871,0.96877486,0.0050607375,0.00037418207,0.0005225535,0.000109715525,0.00032562413,0.0025664957],"genre_scores_gemma":[0.82028884,0.000002108556,0.179228,0.00012439118,0.0000490848,0.0001201428,0.000014674646,0.000014846859,0.00015789592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981536,0.000088372755,0.0003766685,0.0003846022,0.00043762635,0.00055910496],"domain_scores_gemma":[0.9965044,0.00119221,0.00006664158,0.0010743471,0.00080325553,0.0003591323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084271457,0.00018644828,0.00024983293,0.00029919512,0.0003995367,0.0002888505,0.001090078,0.00011454397,0.000082837105],"category_scores_gemma":[0.0070957523,0.00016676645,0.00011402191,0.00095791253,0.00023692784,0.00049428537,0.0003733575,0.0004250608,0.00035439807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004187463,0.00008200142,0.000014232729,0.000014831991,0.000010834505,0.000006769892,0.0003512691,0.000006975698,0.024429329,0.9736198,0.00026801688,0.001191741],"study_design_scores_gemma":[0.0004281454,0.00008127985,0.0002584172,0.000030253948,0.000014153257,0.00004427215,0.0000514977,0.022613436,0.01424653,0.959069,0.002873883,0.00028911966],"about_ca_topic_score_codex":0.0000019778536,"about_ca_topic_score_gemma":0.000010970465,"teacher_disagreement_score":0.7980429,"about_ca_system_score_codex":0.00005074346,"about_ca_system_score_gemma":0.000085166,"threshold_uncertainty_score":0.8494791},"labels":[],"label_agreement":null},{"id":"W1572651318","doi":"10.1016/j.disc.2006.05.018","title":"A characterization of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-comparability graphs","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Bipartite graph; Mathematics; Comparability; Combinatorics; Graph; Transitive relation; Characterization (materials science); Path (computing); Discrete mathematics; Computer science","score_opus":0.021004266821016766,"score_gpt":0.257866261394366,"score_spread":0.23686199457334925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572651318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6942892,0.0005647061,0.016577657,0.00048147395,0.0015169451,0.000094887495,0.0004503712,0.00027109805,0.28575364],"genre_scores_gemma":[0.9838052,0.0005299336,0.011370569,0.00054832175,0.000876745,0.0007126142,0.0011319935,0.00060268585,0.00042194212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9888258,0.000670083,0.002558029,0.001992061,0.0033553257,0.0025987185],"domain_scores_gemma":[0.99020135,0.0019475686,0.0027465685,0.0038177166,0.0003325029,0.0009542853],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0031558382,0.00097494456,0.0005323027,0.0007203884,0.0013870681,0.0015503853,0.003469922,0.0016602783,0.1804625],"category_scores_gemma":[0.001679231,0.0017496434,0.0019094468,0.0021834557,0.0024116626,0.00216326,0.0026005849,0.00159101,0.0016182634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084577996,0.0006568991,0.00003898821,0.0027622357,0.00093708845,0.0005610519,0.0042155394,0.0013337905,0.012673035,0.9323502,0.04229216,0.0013331966],"study_design_scores_gemma":[0.0013952303,0.0011373367,0.00023488537,0.0013054096,0.0006588034,0.0005524864,0.0011062584,0.16038184,0.8275115,0.0033917367,0.0009033801,0.0014211474],"about_ca_topic_score_codex":0.00057029526,"about_ca_topic_score_gemma":0.0005014182,"teacher_disagreement_score":0.9289585,"about_ca_system_score_codex":0.000024117277,"about_ca_system_score_gemma":0.0012421084,"threshold_uncertainty_score":0.999913},"labels":[],"label_agreement":null},{"id":"W1572981224","doi":"10.1007/978-3-0348-8211-8_6","title":"Enumération des 2-arbres k-gonaux","year":2002,"lang":"fr","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Generalization; Quadrilateral; Combinatorics; Mathematics; Enumeration; Planar; Discrete mathematics; Computer science; Mathematical analysis; Physics","score_opus":0.10904042213735254,"score_gpt":0.29169895484272435,"score_spread":0.1826585327053718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572981224","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007996087,0.0024211719,0.19582014,0.00045136304,0.0013000019,0.0012874636,0.00012455843,0.00060578965,0.7971899],"genre_scores_gemma":[0.050113186,0.00063963543,0.03795263,0.00079666195,0.0010426263,0.0001565918,0.00003534746,0.00035259326,0.90891075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936782,0.0004160478,0.0010362553,0.0018663197,0.0014731874,0.0015300071],"domain_scores_gemma":[0.9947016,0.0008337746,0.0004789761,0.0024344285,0.000831833,0.00071937527],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001069396,0.0011870983,0.00087042956,0.00082118204,0.0010678509,0.0006586132,0.0024159888,0.00081589253,0.0022918917],"category_scores_gemma":[0.00022559443,0.0012620381,0.0005924273,0.00017410889,0.002519514,0.00089399493,0.0011103156,0.0014040837,0.004528287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004866534,0.000062189094,0.00008566557,0.00018314365,0.00012593428,0.0003205301,0.00093845744,0.00006328429,0.00073586113,0.82887185,0.00051315984,0.16805129],"study_design_scores_gemma":[0.00078698574,0.00045486254,0.00027863088,0.0007719882,0.00007478907,0.00019364194,0.000024202984,0.0082012,0.0032919596,0.5456305,0.43876928,0.0015219132],"about_ca_topic_score_codex":0.00009271354,"about_ca_topic_score_gemma":0.00015575133,"teacher_disagreement_score":0.4382561,"about_ca_system_score_codex":0.0003594784,"about_ca_system_score_gemma":0.00035347647,"threshold_uncertainty_score":0.99898297},"labels":[],"label_agreement":null},{"id":"W1574040800","doi":"10.1007/978-3-540-72951-8_18","title":"Location Oblivious Distributed Unit Disk Graph Coloring","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph coloring; Computer science; List coloring; Edge coloring; Graph; Greedy coloring; Upper and lower bounds; Fractional coloring; Unit disk; Combinatorics; Chromatic scale; Algorithm; Unit disk graph; Mathematics; Theoretical computer science; Graph power; Line graph","score_opus":0.03679719369105777,"score_gpt":0.30106360173470526,"score_spread":0.2642664080436475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574040800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016959224,0.00065062364,0.99498755,0.00027762417,0.0012368985,0.0005606784,0.000010420651,0.00032113315,0.0017854617],"genre_scores_gemma":[0.58247805,0.00015244992,0.41509703,0.0009167492,0.0006094908,0.00003352175,0.000044485932,0.00010266167,0.00056556845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945244,0.00006768453,0.00063177384,0.0018699224,0.0016825956,0.0012236106],"domain_scores_gemma":[0.9954567,0.0010378095,0.0003196331,0.0020466906,0.00079308177,0.0003460652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019635775,0.00062286423,0.0005413989,0.0019961551,0.0004932313,0.0006485634,0.0051857764,0.00038589074,0.000014662097],"category_scores_gemma":[0.00028435374,0.00060205563,0.0001437197,0.0033061954,0.0014692991,0.0010736001,0.0019985444,0.0014167613,0.00007095388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002548349,0.0000605891,0.0003200924,0.00008392972,0.000022552902,0.00025950174,0.00048554924,0.08687076,0.0001410968,0.25201744,0.000010210348,0.6597028],"study_design_scores_gemma":[0.00041668428,0.000289096,0.0007786251,0.0005740187,0.000009269911,0.00010278443,4.5768658e-7,0.20539409,0.0017097312,0.7878494,0.0017927794,0.0010830582],"about_ca_topic_score_codex":0.000023381017,"about_ca_topic_score_gemma":0.00014985002,"teacher_disagreement_score":0.65861976,"about_ca_system_score_codex":0.00046637858,"about_ca_system_score_gemma":0.00059105776,"threshold_uncertainty_score":0.9996431},"labels":[],"label_agreement":null},{"id":"W1574759554","doi":"10.1007/3-540-40996-3_3","title":"Strategies for Hotlink Assignments","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Computer science; Directed acyclic graph; Zipf's law; Web page; Constant (computer programming); Combinatorics; Set (abstract data type); Binary tree; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; World Wide Web; Programming language; Statistics","score_opus":0.02947728663966838,"score_gpt":0.3013976377944786,"score_spread":0.2719203511548102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574759554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001746762,0.00037344257,0.9853903,0.00040458606,0.000877973,0.0007868533,0.0000133330095,0.00020893691,0.011927111],"genre_scores_gemma":[0.06080859,0.00012525536,0.93528444,0.0014800883,0.0006434228,0.00008658383,0.000011759202,0.00009643739,0.0014634043],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954202,0.000040670056,0.00048325848,0.0018264956,0.0011911148,0.001038224],"domain_scores_gemma":[0.99684316,0.0008161578,0.00019427438,0.0016909657,0.00023476002,0.00022070129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010006306,0.0005599332,0.0005260134,0.0009750895,0.00036896468,0.0009631975,0.0051614754,0.00032505757,0.0000481337],"category_scores_gemma":[0.00004934802,0.0005156602,0.00018558653,0.00061209826,0.0010155991,0.0012426057,0.0009260702,0.0007995112,0.000067308734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016858707,0.000021753678,0.0000042270876,0.000028480175,0.000011313027,0.000039245355,0.00027980687,0.024332076,0.00012610912,0.31867868,0.000027019345,0.6564344],"study_design_scores_gemma":[0.00028262314,0.00023571376,0.000010421613,0.00015158346,0.0000034024245,0.000023156521,2.163624e-7,0.14550382,0.000608154,0.8474615,0.005213719,0.00050565373],"about_ca_topic_score_codex":0.0000047474787,"about_ca_topic_score_gemma":0.00001863537,"teacher_disagreement_score":0.6559288,"about_ca_system_score_codex":0.00027537002,"about_ca_system_score_gemma":0.00095188717,"threshold_uncertainty_score":0.9997295},"labels":[],"label_agreement":null},{"id":"W1575452258","doi":"10.46298/dmtcs.625","title":"Isomorphism of graph classes related to the circular-ones property","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph isomorphism; Combinatorics; Mathematics; Arc (geometry); Isomorphism (crystallography); Discrete mathematics; Regular polygon; Indifference graph; Graph property; Graph; Line graph; Voltage graph; Geometry; Chemistry","score_opus":0.018041717329907874,"score_gpt":0.2762916424278751,"score_spread":0.2582499250979672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575452258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026457725,0.000043072065,0.96271384,0.00531416,0.0002739845,0.0010838849,0.0000029830774,0.00016716622,0.0039431625],"genre_scores_gemma":[0.75304615,0.000005682544,0.24644765,0.0003331876,0.000020914531,0.00007037465,5.805514e-7,0.000017945775,0.000057499365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576193,0.00023705781,0.00068480894,0.0008467701,0.0015719569,0.000897452],"domain_scores_gemma":[0.99575245,0.0007045304,0.00018369647,0.00226364,0.0006800361,0.00041566096],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024618062,0.00031371534,0.00041955456,0.00036572834,0.0005644249,0.0005993091,0.006172975,0.000074551914,0.000100852056],"category_scores_gemma":[0.00047224312,0.00015917388,0.00017548041,0.003318483,0.004553341,0.0009506609,0.0024352819,0.00036111055,0.00034641882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025575928,0.00008771315,0.000026619155,0.00003826582,0.000014772505,0.0000042301185,0.0020135287,0.00021895162,0.0041671894,0.98826784,0.00013033193,0.005027985],"study_design_scores_gemma":[0.00012223341,0.00018523181,0.00020913863,0.000076448996,0.000006308269,0.00004391769,0.00009105139,0.28575632,0.003709942,0.7094702,0.00009479864,0.00023441756],"about_ca_topic_score_codex":0.0000070953647,"about_ca_topic_score_gemma":5.295546e-7,"teacher_disagreement_score":0.7265884,"about_ca_system_score_codex":0.000036856974,"about_ca_system_score_gemma":0.0001317084,"threshold_uncertainty_score":0.9992041},"labels":[],"label_agreement":null},{"id":"W1576493106","doi":"10.1007/978-3-540-85097-7_35","title":"Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Mathematics; Discrete mathematics; Computer science","score_opus":0.029438573931049136,"score_gpt":0.27957456160883376,"score_spread":0.2501359876777846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576493106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015626728,0.000974919,0.9925151,0.00059068744,0.0011837536,0.0020714584,0.00003116253,0.00018828256,0.0022883946],"genre_scores_gemma":[0.18257937,0.00075169984,0.8105084,0.0035697971,0.00077787315,0.000412457,0.0000407127,0.00021061536,0.0011490752],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932319,0.00007605922,0.00090375415,0.0026294428,0.0015100613,0.0016488063],"domain_scores_gemma":[0.9946265,0.0018770925,0.0003563353,0.0022910587,0.00047045958,0.00037852878],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013222744,0.0008469974,0.0009737081,0.0025189407,0.00043151266,0.0004131938,0.0069303378,0.00046605364,0.000014059862],"category_scores_gemma":[0.00021804118,0.0008199583,0.00031288975,0.0016878254,0.0022910575,0.00090605847,0.0018351944,0.0014638453,0.0000431359],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009214609,0.00013141055,0.0002811543,0.0001206755,0.000031231273,0.0007115309,0.001433149,0.020073332,0.00064988196,0.060037214,0.00025481256,0.9161835],"study_design_scores_gemma":[0.0018877962,0.0005757246,0.00026772206,0.00086320407,0.000007660246,0.00028351697,3.7125886e-7,0.37927198,0.0013405025,0.586301,0.027377253,0.0018232443],"about_ca_topic_score_codex":0.0000182822,"about_ca_topic_score_gemma":0.00014783442,"teacher_disagreement_score":0.9143602,"about_ca_system_score_codex":0.0004963065,"about_ca_system_score_gemma":0.0009026126,"threshold_uncertainty_score":0.9994251},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020429043359511363,"score_gpt":0.2706849358530934,"score_spread":0.25025589249358204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576691799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3166748,0.00030871815,0.67822737,0.00011989441,0.00003763677,0.0003966018,0.000001301537,0.00020421995,0.004029455],"genre_scores_gemma":[0.83623594,0.000021722632,0.16353686,0.00004118216,0.0000088473835,0.00004525491,0.0000010814757,0.000030465206,0.00007864309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767685,0.000099961886,0.00030816035,0.0004470499,0.00041670428,0.001051247],"domain_scores_gemma":[0.9983869,0.00029397037,0.00010935636,0.0010532148,0.000048557267,0.00010800341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064296,0.00025571327,0.00029349822,0.00019781852,0.00012916955,0.00010628501,0.0013842455,0.000068903966,0.000056404337],"category_scores_gemma":[0.00012969694,0.00019355424,0.00007990671,0.0010582566,0.0002650743,0.00049404573,0.00026679662,0.0004923512,0.000056965273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003475569,0.00013525545,0.001880689,0.000043163625,0.00003404623,0.000036019854,0.0032595492,0.000059680227,0.0003446951,0.99112695,0.000004373109,0.003040809],"study_design_scores_gemma":[0.0005612043,0.0006666633,0.00068343466,0.00007841389,0.0000087443905,0.00008513323,0.00006586941,0.028315833,0.010146628,0.9589564,0.00004273657,0.00038890983],"about_ca_topic_score_codex":0.000029124654,"about_ca_topic_score_gemma":0.00010025614,"teacher_disagreement_score":0.5195612,"about_ca_system_score_codex":0.0001034926,"about_ca_system_score_gemma":0.00019274009,"threshold_uncertainty_score":0.78929126},"labels":[],"label_agreement":null},{"id":"W1577506113","doi":"10.1007/978-3-540-68880-8_6","title":"New Upper Bounds on Continuous Tree Edge-Partition Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Partition (number theory); Combinatorics; Tree (set theory); Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.019245519122859895,"score_gpt":0.2659052201453175,"score_spread":0.24665970102245757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577506113","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075077776,0.0004898005,0.97381884,0.0011023688,0.0012094157,0.0006518646,0.0000040993114,0.00029623942,0.022352288],"genre_scores_gemma":[0.04031106,0.00025828273,0.94531274,0.0027946723,0.0014101483,0.00003885058,0.000013948348,0.00012336581,0.009736926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942117,0.000074436975,0.00059196027,0.0021613843,0.0017933664,0.0011671998],"domain_scores_gemma":[0.99632686,0.00059857074,0.0002847259,0.0020546035,0.00031778385,0.00041747888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079113897,0.00069848174,0.00066632574,0.001396038,0.00048466073,0.00062787335,0.004427701,0.0003911512,0.00005322049],"category_scores_gemma":[0.000106946805,0.00063413894,0.00022224257,0.0010585311,0.001071092,0.00093332224,0.0012625025,0.0013975698,0.00028544935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026536654,0.000043825523,0.00003827605,0.000020025394,0.000012652751,0.0001971709,0.000782778,0.0071099503,0.00016539174,0.090292,0.0006147554,0.90069664],"study_design_scores_gemma":[0.0008582451,0.0011408322,0.00019969395,0.0006937159,0.0000076222727,0.0003157956,2.2642949e-7,0.055231113,0.0042588264,0.90727,0.028606536,0.0014173817],"about_ca_topic_score_codex":0.00001791326,"about_ca_topic_score_gemma":0.000069820104,"teacher_disagreement_score":0.89927924,"about_ca_system_score_codex":0.00045820398,"about_ca_system_score_gemma":0.0010538162,"threshold_uncertainty_score":0.999611},"labels":[],"label_agreement":null},{"id":"W1577910185","doi":"10.1002/jgt.22182","title":"Dominating induced matchings in graphs containing no long claw","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Chordal graph; Time complexity; Matching (statistics); Induced subgraph; Discrete mathematics; Graph","score_opus":0.03397447845630661,"score_gpt":0.3340140648915205,"score_spread":0.3000395864352139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577910185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81265825,0.0022715004,0.17526978,0.00045842223,0.0033650124,0.0005594398,0.000005683898,0.00008618337,0.005325706],"genre_scores_gemma":[0.98068506,0.00033543902,0.01842317,0.00015395912,0.0002218421,0.000017249715,0.0000013563886,0.000055855817,0.000106102234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943893,0.0014475014,0.0014519995,0.0007017691,0.001180875,0.0008285777],"domain_scores_gemma":[0.99253315,0.0014892003,0.0030300613,0.0017336011,0.0008975827,0.0003164029],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01291542,0.0005402136,0.0011902597,0.002418949,0.00040278662,0.00074740965,0.0064262655,0.0004764964,0.000020255025],"category_scores_gemma":[0.0019064987,0.0004851349,0.00077745115,0.0004946943,0.00037953374,0.0014808465,0.0027303144,0.0048502656,0.000014483168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009894456,0.0002519212,0.0070186253,0.00031745346,0.0004079572,0.0023845562,0.006401478,0.00061071507,0.0041112374,0.887975,0.00006884028,0.08946279],"study_design_scores_gemma":[0.0012234716,0.00031681618,0.00515281,0.0021335364,0.00002421096,0.00024501132,0.00027117238,0.00044739267,0.0008034189,0.9888545,0.000037040925,0.00049057277],"about_ca_topic_score_codex":0.000028578603,"about_ca_topic_score_gemma":0.000019932966,"teacher_disagreement_score":0.16802676,"about_ca_system_score_codex":0.00019475383,"about_ca_system_score_gemma":0.00052500016,"threshold_uncertainty_score":0.99976003},"labels":[],"label_agreement":null},{"id":"W1578742758","doi":"10.48550/arxiv.1410.7423","title":"Packing odd $T$-joins with at most two terminals","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Joins; Bipartite graph; Conjecture; Cardinality (data modeling); Disjoint sets; Sigma; Graph; Discrete mathematics; Physics; Computer science","score_opus":0.07429698143910071,"score_gpt":0.22548152780460756,"score_spread":0.15118454636550685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578742758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34247628,0.000033541062,0.6514588,0.00006763133,0.00018684036,0.0003304319,0.000010724549,0.0002812491,0.0051544933],"genre_scores_gemma":[0.9890957,0.000051801435,0.0040250043,0.00013254602,0.00008309414,0.0000023319044,0.000012452062,0.00004016459,0.006556946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678105,0.00032821848,0.00020656365,0.0016918919,0.00024101356,0.0007512847],"domain_scores_gemma":[0.9962546,0.00029760046,0.00031396048,0.0025250919,0.00027070686,0.00033798817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005062521,0.0004580245,0.0004733244,0.00047448996,0.00040711087,0.00018385504,0.003221789,0.00020452456,0.00005803609],"category_scores_gemma":[0.000051947554,0.00045890038,0.0001761097,0.0009844404,0.00036413383,0.00050174515,0.005371533,0.00085824216,0.00022976486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022172241,0.00014034988,0.01582128,0.00019404473,0.00021078404,0.0024463108,0.00045002796,0.3143236,0.00043033843,0.66217315,0.0004265135,0.0031618564],"study_design_scores_gemma":[0.0024743683,0.00041385982,0.00254898,0.0006286955,0.00012528517,0.00012545282,0.00010743486,0.71691996,0.0030338953,0.26731494,0.004138078,0.0021690684],"about_ca_topic_score_codex":0.00007316007,"about_ca_topic_score_gemma":0.00015614521,"teacher_disagreement_score":0.6474338,"about_ca_system_score_codex":0.00038159182,"about_ca_system_score_gemma":0.00022614545,"threshold_uncertainty_score":0.99978626},"labels":[],"label_agreement":null},{"id":"W1579357699","doi":"10.1007/978-3-540-30551-4_77","title":"Sweeping Graphs with Large Clique Number","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Regina","funders":"","keywords":"Computer science; Clique; Clique problem; Theoretical computer science; Combinatorics; Graph; Chordal graph; Mathematics; 1-planar graph","score_opus":0.015019955904187065,"score_gpt":0.27993704221590104,"score_spread":0.26491708631171396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579357699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016080898,0.0002050129,0.9886688,0.0005639013,0.0006245876,0.00055035617,0.000006157226,0.00029520597,0.008925178],"genre_scores_gemma":[0.3260294,0.000072495495,0.6709855,0.0020360067,0.0002632222,0.00002791478,0.0000059740114,0.000095249074,0.00048424109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410516,0.00006494636,0.00050560274,0.0022270388,0.0016665735,0.0014306612],"domain_scores_gemma":[0.99623066,0.00051865104,0.00028033703,0.002230155,0.00040899252,0.00033119178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014170028,0.00071237155,0.0006496715,0.0010554637,0.00047501098,0.00058529404,0.0050226334,0.000365085,0.000070533635],"category_scores_gemma":[0.000081843165,0.0006005174,0.00017075558,0.0015932873,0.0013118894,0.001141099,0.0019363192,0.0017140511,0.00013799348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019421608,0.000047341924,0.0002690826,0.00005274413,0.000020741458,0.00044685687,0.0006638622,0.018899187,0.00005253838,0.85887384,0.000004607239,0.12064976],"study_design_scores_gemma":[0.0005884274,0.00022340665,0.00012286194,0.0007021426,0.000005340792,0.00022261587,2.0129572e-7,0.025388937,0.0010517591,0.9699575,0.0008453386,0.00089152623],"about_ca_topic_score_codex":0.000016854923,"about_ca_topic_score_gemma":0.000120916746,"teacher_disagreement_score":0.3258686,"about_ca_system_score_codex":0.00046591464,"about_ca_system_score_gemma":0.0011211111,"threshold_uncertainty_score":0.99964464},"labels":[],"label_agreement":null},{"id":"W158188782","doi":"","title":"On the lower bounds of partial signed domination number of graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Discrete mathematics; Graph","score_opus":0.01261581860335374,"score_gpt":0.2841050634765157,"score_spread":0.27148924487316195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158188782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895656,0.00002638842,0.0040085637,0.0008053545,0.0005987337,0.0002075507,0.0000018492044,0.000037134483,0.004748795],"genre_scores_gemma":[0.99877566,0.0000046977284,0.0009824872,0.00007434031,0.000005120402,0.000017391985,6.7576894e-7,0.000008560372,0.00013109433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859697,0.00018413582,0.00025720947,0.00022069413,0.00051250483,0.00022849154],"domain_scores_gemma":[0.99830866,0.0006035476,0.00014630225,0.0006974632,0.0001938086,0.000050246825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072000903,0.0001049911,0.00015999294,0.00008826389,0.00009143195,0.000027646154,0.0008848423,0.00005182246,0.00008366992],"category_scores_gemma":[0.00018222864,0.0000784677,0.00009604065,0.00064167153,0.00021486722,0.00030186682,0.00015533695,0.00014260387,0.000048259095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004740622,0.00027436248,0.00027233124,0.000004626215,0.000015254247,0.0000012845912,0.00024783454,0.00003269883,0.0018357928,0.99395084,0.00045934372,0.002858213],"study_design_scores_gemma":[0.00055693806,0.0002047148,0.0004693502,0.000016152102,0.000003235693,0.000001550435,0.000011920045,0.0017244566,0.05288743,0.9436731,0.0003669967,0.000084200925],"about_ca_topic_score_codex":0.0000052404657,"about_ca_topic_score_gemma":0.000001088974,"teacher_disagreement_score":0.051051635,"about_ca_system_score_codex":0.000030247613,"about_ca_system_score_gemma":0.000043457858,"threshold_uncertainty_score":0.319982},"labels":[],"label_agreement":null},{"id":"W158287491","doi":"10.1007/bfb0023872","title":"A constructive proof that tree are well-quasi-ordered under minors (detailed abstract)","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constructive; Constructive proof; Mathematical proof; Mathematics; Lemma (botany); Discrete mathematics; Combinatorics; Tree (set theory); Minor (academic); Computer science","score_opus":0.025305504328420197,"score_gpt":0.27296282240515024,"score_spread":0.24765731807673005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158287491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040072246,0.0006829071,0.9800914,0.0012792521,0.0013370848,0.001091953,0.000013522546,0.0002590358,0.014844116],"genre_scores_gemma":[0.51991135,0.00010349557,0.47304472,0.002057131,0.0009667894,0.00007036394,0.000011655705,0.00015506735,0.0036794546],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99266446,0.00008734636,0.00073483726,0.0028493176,0.0021659818,0.0014980835],"domain_scores_gemma":[0.9947972,0.0010340692,0.0006992726,0.0025294689,0.0005111178,0.00042883283],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011068785,0.0010187243,0.0010108474,0.0016406492,0.00047474296,0.0007493877,0.0060353135,0.0005908161,0.00020303235],"category_scores_gemma":[0.00012937702,0.0009248433,0.0003027969,0.0011483349,0.002813914,0.0014185627,0.0020632402,0.0019510625,0.0002034296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006388407,0.00016819866,0.0003667228,0.00009600407,0.00007836149,0.00040292987,0.00091674057,0.017202266,0.0002018917,0.07081346,0.000058873833,0.90963066],"study_design_scores_gemma":[0.0013094845,0.00040310094,0.0014874191,0.00084185804,0.000022485765,0.00036945913,0.0000053162835,0.11640595,0.006337449,0.86774045,0.002933996,0.0021430454],"about_ca_topic_score_codex":0.0000099677145,"about_ca_topic_score_gemma":0.0003759947,"teacher_disagreement_score":0.90748763,"about_ca_system_score_codex":0.0006619327,"about_ca_system_score_gemma":0.0009367259,"threshold_uncertainty_score":0.99989986},"labels":[],"label_agreement":null},{"id":"W1582969422","doi":"10.1007/978-3-642-20807-2_6","title":"TSP on Cubic and Subcubic Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.027594923748835116,"score_gpt":0.27232444643889603,"score_spread":0.2447295226900609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582969422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005124048,0.000745002,0.98667634,0.0003033913,0.0009823204,0.00042801496,0.00000374748,0.00018967039,0.010159099],"genre_scores_gemma":[0.5496401,0.0006496982,0.44246075,0.0038690905,0.0004646537,0.00004235957,0.000005847097,0.00015537311,0.0027121198],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535424,0.000063829706,0.0004163027,0.0020843542,0.0011389889,0.0009422876],"domain_scores_gemma":[0.9965534,0.0007199922,0.00020258164,0.0020023144,0.00019960484,0.000322064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010689261,0.0006198242,0.0005471983,0.0017642764,0.0003400511,0.00040196907,0.0040361807,0.0003189125,0.000035773144],"category_scores_gemma":[0.00010001908,0.0005448526,0.00013207333,0.00091127265,0.0017308786,0.00064892456,0.0018940193,0.0012810639,0.000101597565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014315153,0.000024058423,0.000054255703,0.000022904273,0.000008782438,0.00011625647,0.0004438899,0.00056322344,0.00012282973,0.48620757,0.000008692448,0.5124132],"study_design_scores_gemma":[0.00023643876,0.000475017,0.0002110005,0.00024562268,0.000004017623,0.0000872139,7.339917e-8,0.017514046,0.0016173589,0.977903,0.0010656759,0.000640514],"about_ca_topic_score_codex":0.000013126617,"about_ca_topic_score_gemma":0.00003359139,"teacher_disagreement_score":0.5491277,"about_ca_system_score_codex":0.00016146348,"about_ca_system_score_gemma":0.0002865625,"threshold_uncertainty_score":0.9997003},"labels":[],"label_agreement":null},{"id":"W1584364430","doi":"10.1016/j.tcs.2015.04.037","title":"The interval constrained 3-coloring problem","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundacja na rzecz Nauki Polskiej","keywords":"Interval (graph theory); Mathematics; Combinatorics; Time complexity; Discrete mathematics","score_opus":0.031286921797765155,"score_gpt":0.30748014581150407,"score_spread":0.2761932240137389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584364430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008566035,0.000045251225,0.9730824,0.0028690023,0.00068621244,0.0002636313,4.864547e-7,0.00028528483,0.014201691],"genre_scores_gemma":[0.8150383,0.0000026365217,0.1845812,0.00022516552,0.00009275796,0.000017802435,1.2508936e-7,0.0000071950603,0.00003478185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996588,0.00025079132,0.00029967254,0.00069268723,0.0011947246,0.0009741226],"domain_scores_gemma":[0.99699086,0.00072390353,0.00006596711,0.0011346189,0.0004834391,0.00060118205],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0057018613,0.00018153794,0.00017259177,0.00015140782,0.00084354,0.0010294656,0.005694907,0.00003789244,0.0000062963654],"category_scores_gemma":[0.0004090553,0.000114384726,0.00006529785,0.0017082635,0.008509192,0.0009643737,0.0027658714,0.00035424592,0.00013696877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016118098,0.0000206337,0.000024715211,0.0000017282313,0.000003227045,0.000013678731,0.00042790076,0.00014519769,0.0001767911,0.9313487,0.000056601617,0.067764744],"study_design_scores_gemma":[0.0002455174,0.00026843173,0.000050670948,0.000014081442,0.0000011409837,0.0000692914,0.000031300304,0.26899225,0.0019946122,0.72735184,0.00082698534,0.00015389927],"about_ca_topic_score_codex":0.0000015455561,"about_ca_topic_score_gemma":8.4838393e-7,"teacher_disagreement_score":0.8064723,"about_ca_system_score_codex":0.00011970535,"about_ca_system_score_gemma":0.00039128205,"threshold_uncertainty_score":0.99968475},"labels":[],"label_agreement":null},{"id":"W1586356312","doi":"10.1007/978-3-319-12691-3_22","title":"Algorithms for Cut Problems on Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Parameterized complexity; Combinatorics; Running time; Time complexity; Tree (set theory); Mathematics; Constant (computer programming); Polynomial; Computer science; Discrete mathematics; Algorithm","score_opus":0.034287847710399014,"score_gpt":0.2979919124767282,"score_spread":0.2637040647663292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586356312","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007439971,0.00019397882,0.9922259,0.000909221,0.0013583371,0.0010789584,0.000010601513,0.00022357077,0.00399198],"genre_scores_gemma":[0.0325801,0.00005696398,0.95980453,0.0024265414,0.0011781538,0.00014048256,0.000012105174,0.00011758795,0.003683511],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485713,0.000054171996,0.00050548627,0.0021756247,0.0013244839,0.0010830984],"domain_scores_gemma":[0.99541545,0.0016131492,0.0002650932,0.0020837546,0.00036706854,0.0002555079],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016727403,0.00062984746,0.00063012907,0.0012483638,0.00038652125,0.0005360484,0.0054714456,0.00033104635,0.00001144289],"category_scores_gemma":[0.0002155501,0.0005409229,0.00022370959,0.00065806735,0.0009920916,0.00040656433,0.0011756115,0.0009032,0.00007398688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010816139,0.00002165729,0.000003319152,0.00003895905,0.000007952259,0.000013779746,0.00024475722,0.038965136,0.00008808585,0.20088042,0.000030369953,0.75969476],"study_design_scores_gemma":[0.00031769267,0.00060961896,0.000009311952,0.00028514964,0.0000028927604,0.000020883203,4.8620805e-8,0.4089937,0.0012599393,0.57755095,0.010428968,0.000520829],"about_ca_topic_score_codex":0.0000053200242,"about_ca_topic_score_gemma":0.00005867475,"teacher_disagreement_score":0.7591739,"about_ca_system_score_codex":0.00027128865,"about_ca_system_score_gemma":0.00035649416,"threshold_uncertainty_score":0.9999094},"labels":[],"label_agreement":null},{"id":"W158781227","doi":"","title":"On Irregularity of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0218766658137197,"score_gpt":0.2728580865804129,"score_spread":0.25098142076669316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158781227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99029815,0.000084477986,0.0036231563,0.00015558758,0.0007050976,0.00013694372,0.0000013777164,0.0001153828,0.0048798476],"genre_scores_gemma":[0.9972183,0.000018172555,0.0025227454,0.00006162897,0.0000012878544,0.00000770742,6.924896e-7,0.000007823299,0.00016160215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987233,0.00010757337,0.00016702403,0.0002865306,0.00045207894,0.0002634786],"domain_scores_gemma":[0.9986347,0.00022611787,0.00006559657,0.0008535194,0.00012259092,0.000097476244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002768031,0.000104774605,0.00016826867,0.00017271057,0.00013582892,0.000011161352,0.0010100938,0.000051236515,0.000012025],"category_scores_gemma":[0.0001132221,0.00010012247,0.00008375759,0.0007459492,0.00021069752,0.0002458037,0.00021536852,0.00018604296,0.000046512836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012654389,0.00014350437,0.0016262352,0.000005067234,0.000009151797,0.000026742326,0.00013631005,0.000010562996,0.0004816919,0.9960491,0.0006288059,0.0008701781],"study_design_scores_gemma":[0.0004457258,0.00020230531,0.0082994085,0.000009106788,8.859126e-7,0.000013120273,0.0000029779721,0.00031265695,0.010872959,0.97956854,0.0001723891,0.00009994135],"about_ca_topic_score_codex":0.000007659892,"about_ca_topic_score_gemma":4.4919068e-7,"teacher_disagreement_score":0.016480573,"about_ca_system_score_codex":0.000023005314,"about_ca_system_score_gemma":0.000051222298,"threshold_uncertainty_score":0.40828758},"labels":[],"label_agreement":null},{"id":"W1590078554","doi":"","title":"Simplex Adjacency Graphs in Linear Optimization","year":2006,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Simplex; Adjacency list; Mathematics; Context (archaeology); Linear programming; Chordal graph; Indifference graph; Degeneracy (biology); Duality (order theory); Discrete mathematics; Computer science; Graph; Mathematical optimization","score_opus":0.04304331769652263,"score_gpt":0.3724864654297721,"score_spread":0.32944314773324945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590078554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014486655,0.00027608604,0.97880864,0.0017190711,0.00014940428,0.0008676954,0.000010106547,0.00015485688,0.0035274688],"genre_scores_gemma":[0.45935223,0.0001891984,0.53643644,0.00005740924,0.00017709384,0.00037746437,0.0000740484,0.00003763505,0.003298497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963937,0.0006922979,0.00040888914,0.0006501135,0.0010046059,0.0008504191],"domain_scores_gemma":[0.9979507,0.00030389806,0.00001642355,0.0008949965,0.0007131293,0.00012087941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002101245,0.00015434517,0.00017018078,0.0014234518,0.00058190804,0.0003225992,0.0013142016,0.000104893086,0.00011920186],"category_scores_gemma":[0.0002642823,0.00015319457,0.000054522192,0.004705107,0.00023740336,0.0012526572,0.00044735026,0.0006743457,0.00018435852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006796769,0.00022412394,0.00031882233,0.000007477476,0.000005204159,0.000042322838,0.00018640215,0.6805169,0.0012461805,0.3035866,0.00052762293,0.013331525],"study_design_scores_gemma":[0.00046989467,0.00008735794,0.00060071633,0.000013699461,6.21113e-7,0.000010899365,0.000064604494,0.96716565,0.0012169805,0.029078765,0.0011153389,0.00017549934],"about_ca_topic_score_codex":0.0009539621,"about_ca_topic_score_gemma":0.0005727585,"teacher_disagreement_score":0.44486558,"about_ca_system_score_codex":0.0001747931,"about_ca_system_score_gemma":0.0003181484,"threshold_uncertainty_score":0.6247093},"labels":[],"label_agreement":null},{"id":"W1591207959","doi":"10.4230/lipics.fsttcs.2009.2319","title":"On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cover (algebra); Mathematics; Vertex (graph theory); Combinatorics; Upper and lower bounds; Vertex cover; Regular polygon; Inequality; Metric (unit); Discrete mathematics; Approximation algorithm; Mathematical analysis; Geometry; Graph","score_opus":0.01935012980026356,"score_gpt":0.27016689915421316,"score_spread":0.2508167693539496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591207959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15272133,0.000046915062,0.8360643,0.0021817465,0.00036431834,0.00261141,0.00050882396,0.00012581468,0.0053753355],"genre_scores_gemma":[0.9812656,0.000011775566,0.015774038,0.0021294479,0.00004141918,0.00011899864,0.000025865946,0.000027322389,0.00060554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748105,0.00008002673,0.00068035466,0.0002286065,0.00085894164,0.00067104335],"domain_scores_gemma":[0.99686867,0.0009678817,0.00040193996,0.0012172443,0.00044628364,0.000097973745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010576751,0.00030254023,0.0003660774,0.00015034745,0.0005469974,0.00026143368,0.0020562827,0.000094869356,0.00001432734],"category_scores_gemma":[0.00026415696,0.00015684597,0.00023866641,0.00047060827,0.00027285042,0.0010049713,0.00026278332,0.00036997904,0.000015100413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006902334,0.00010992243,0.0003027112,0.00017337578,0.00010924234,9.4257354e-7,0.0074771345,0.0009333562,0.00008061669,0.9779983,0.0035308949,0.008593243],"study_design_scores_gemma":[0.014102337,0.008792555,0.0015318587,0.0016698404,0.00011749149,0.00008240284,0.005739845,0.1947747,0.050244413,0.5709981,0.1499933,0.0019531513],"about_ca_topic_score_codex":0.0000020652087,"about_ca_topic_score_gemma":0.000002991253,"teacher_disagreement_score":0.82854426,"about_ca_system_score_codex":0.00009721014,"about_ca_system_score_gemma":0.00013287856,"threshold_uncertainty_score":0.6395993},"labels":[],"label_agreement":null},{"id":"W159195102","doi":"","title":"Toughness of Generalized Petersen Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01855483965152638,"score_gpt":0.27677174546538014,"score_spread":0.25821690581385376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159195102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9722617,0.00033784786,0.01347825,0.00012680009,0.0018596684,0.00027631308,0.0000019812887,0.0001545428,0.011502871],"genre_scores_gemma":[0.9869724,0.000023724835,0.01265731,0.000055229903,0.0000014395433,0.000017390403,8.652193e-7,0.0000129096115,0.0002587521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841976,0.0002701618,0.00023560769,0.00033217127,0.0003843111,0.00035801594],"domain_scores_gemma":[0.99861777,0.00014901122,0.000091828,0.000863505,0.00015990036,0.00011797618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050399563,0.00013463359,0.00022297738,0.00017565434,0.00008819231,0.00003847013,0.0009290802,0.000054192464,0.000029780176],"category_scores_gemma":[0.00014146474,0.0001298081,0.00010310801,0.00091431825,0.00012352671,0.0003521759,0.00015561398,0.00013616025,0.000027811771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068921427,0.00007109504,0.0010638648,0.000009763734,0.000016734119,0.000012434286,0.00015403802,0.00001393692,0.0032840099,0.9944377,0.00020218124,0.0007273574],"study_design_scores_gemma":[0.0008183464,0.00008133376,0.00062468345,0.000008618775,0.0000027834958,0.000009832468,0.000018163506,0.00019826861,0.031452745,0.9649718,0.0016667669,0.00014668932],"about_ca_topic_score_codex":0.000007976327,"about_ca_topic_score_gemma":9.604202e-7,"teacher_disagreement_score":0.029465925,"about_ca_system_score_codex":0.000024926796,"about_ca_system_score_gemma":0.00006661639,"threshold_uncertainty_score":0.5293421},"labels":[],"label_agreement":null},{"id":"W159253485","doi":"","title":"Graph Orientations and Signings That Are Saturated with Alternating Cycles.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01678179386426939,"score_gpt":0.2690823586310942,"score_spread":0.25230056476682483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159253485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9749389,0.0001216549,0.02333944,0.0004759794,0.00029555906,0.00020472947,0.0000017167714,0.00020231656,0.0004196619],"genre_scores_gemma":[0.9879239,0.00001734702,0.011881132,0.00009925066,0.0000033530196,0.000022446924,0.0000022421616,0.00001553757,0.000034742956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987173,0.000054888304,0.000121915116,0.00040485754,0.00037054453,0.00033047405],"domain_scores_gemma":[0.99909776,0.00012431678,0.000112904716,0.00038621615,0.00013705564,0.00014176138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018934208,0.00014830127,0.00014136732,0.0001631805,0.00029135123,0.00019356953,0.00050876144,0.00003993097,0.0000020622647],"category_scores_gemma":[0.000048339112,0.00012810162,0.000025994295,0.0008235384,0.00015798605,0.00077888556,0.00018709576,0.00022508155,0.000009520901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118707,0.000046102723,0.015552251,0.000008631222,0.000022561058,0.00006400505,0.0008707157,0.0002466145,0.0007854935,0.98146486,0.000017807371,0.0009090561],"study_design_scores_gemma":[0.0015057508,0.0001443986,0.015377163,0.00007079534,0.0000049094474,0.000037011014,0.0002659741,0.000263167,0.009844423,0.97223145,0.000038044764,0.00021690755],"about_ca_topic_score_codex":0.000039994036,"about_ca_topic_score_gemma":0.000011588927,"teacher_disagreement_score":0.012985005,"about_ca_system_score_codex":0.00005227831,"about_ca_system_score_gemma":0.000049709248,"threshold_uncertainty_score":0.5223832},"labels":[],"label_agreement":null},{"id":"W1593178005","doi":"10.37236/5327","title":"The Total Acquisition Number of Random Graphs","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Michigan University","keywords":"Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Random graph; Discrete mathematics","score_opus":0.00841781867157016,"score_gpt":0.28211421866373076,"score_spread":0.2736963999921606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593178005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14766937,0.021507412,0.8200515,0.004554103,0.0034373924,0.00064587744,0.000005299696,0.0000490768,0.0020800005],"genre_scores_gemma":[0.99523526,0.0041066916,0.00006362262,0.000019393803,0.000114971095,0.000010669109,3.9660458e-7,0.00002253897,0.00042642676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605215,0.00087377254,0.0007957754,0.00023369807,0.001230197,0.0008144084],"domain_scores_gemma":[0.99470913,0.0016962612,0.0013063251,0.0012290619,0.00096082804,0.00009836365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005167373,0.00026440917,0.0005063005,0.00015590894,0.0003135099,0.00013868214,0.004235055,0.00015956633,0.0000087000835],"category_scores_gemma":[0.0002229982,0.0001294086,0.00051562133,0.0005490562,0.0003320609,0.00028276493,0.001135851,0.002049408,0.000009382656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025127153,0.00006402627,0.00005228177,0.000014739786,0.00018153554,0.000005866397,0.00014804568,0.000089957626,0.0002071365,0.99577737,0.0001876459,0.0030201464],"study_design_scores_gemma":[0.001456874,0.00024434205,0.00013008881,0.00010547603,0.00003574378,0.0003103561,0.000022051745,0.00023756955,0.0018794917,0.99492466,0.00050671695,0.00014662286],"about_ca_topic_score_codex":0.0000019814822,"about_ca_topic_score_gemma":4.985628e-7,"teacher_disagreement_score":0.8475659,"about_ca_system_score_codex":0.0003570402,"about_ca_system_score_gemma":0.0011034291,"threshold_uncertainty_score":0.89037716},"labels":[],"label_agreement":null},{"id":"W1593427793","doi":"10.46298/dmtcs.458","title":"Adjoint functors and tree duality","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Homomorphism; Duality (order theory); Functor; Combinatorics; Functor category; Tree (set theory); Adjoint functors; Discrete mathematics; Natural transformation","score_opus":0.020913076198679884,"score_gpt":0.2992496958744759,"score_spread":0.27833661967579604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593427793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026505556,0.00005297447,0.9626805,0.001940616,0.00015934715,0.00028593413,0.0000022313682,0.00026523456,0.00810758],"genre_scores_gemma":[0.6465744,0.000007753115,0.35296655,0.00038204392,0.000041671163,0.0000047544877,4.9810893e-7,0.0000075979315,0.000014724806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962549,0.00014425289,0.0004652952,0.0009960608,0.0012335264,0.00090594473],"domain_scores_gemma":[0.9971117,0.0005006522,0.00011552584,0.0014961847,0.00021677208,0.00055920676],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021899226,0.00031528427,0.00038350184,0.000284267,0.00054371875,0.0007967331,0.0026624142,0.000067347515,0.000029935098],"category_scores_gemma":[0.00032576095,0.0002376555,0.000103842845,0.0014076179,0.00342398,0.0010177513,0.0013209233,0.00032439874,0.00004698693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005619759,0.00007812053,0.000015578838,0.000015160936,0.0000040486607,0.000013839734,0.001053953,0.00001191574,0.001005746,0.96211773,0.000019598683,0.035658672],"study_design_scores_gemma":[0.00016888826,0.0002655297,0.0007033839,0.00003548161,0.0000042439215,0.000048255457,0.00003098585,0.2880059,0.0016066697,0.70885503,0.000030630425,0.00024503947],"about_ca_topic_score_codex":6.0454175e-7,"about_ca_topic_score_gemma":3.5725125e-7,"teacher_disagreement_score":0.62006885,"about_ca_system_score_codex":0.00004760208,"about_ca_system_score_gemma":0.00008883941,"threshold_uncertainty_score":0.99928814},"labels":[],"label_agreement":null},{"id":"W1594588516","doi":"10.1007/3-540-45105-6_106","title":"On the Treewidth of NK Landscapes","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Treewidth; Computer science; Theoretical computer science; Graph; Pathwidth","score_opus":0.020274896276776408,"score_gpt":0.2661022176563283,"score_spread":0.24582732137955188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594588516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015381846,0.0003894323,0.9852006,0.0012691004,0.0005912248,0.00035500966,0.000004417473,0.000057850462,0.011978537],"genre_scores_gemma":[0.5444634,0.0003119899,0.44270867,0.009071349,0.0004915804,0.00004799587,0.000005071542,0.00014260186,0.0027573307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964856,0.0000989357,0.0003992855,0.0011016087,0.0013028106,0.0006117843],"domain_scores_gemma":[0.9952609,0.0021323366,0.0002480775,0.0020173774,0.00022478789,0.000116497824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014826212,0.0004059295,0.0004405635,0.00075358996,0.00023013898,0.00019880453,0.0048509925,0.00018862014,0.00004879293],"category_scores_gemma":[0.00027862293,0.00026603136,0.00015112167,0.0010124377,0.00096838316,0.00028037903,0.0008829194,0.0009087249,0.000037424586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101029855,0.000029309598,0.000018610908,0.000022457984,0.00001136025,0.000031864107,0.00031492964,0.014752628,0.00012857618,0.7660144,0.00007124944,0.21859452],"study_design_scores_gemma":[0.00017231915,0.000268541,0.000021407574,0.00025205215,0.000002901739,0.000024990373,1.4218162e-7,0.058639403,0.0039902185,0.9349281,0.0013553948,0.00034453216],"about_ca_topic_score_codex":0.0000034375048,"about_ca_topic_score_gemma":0.000023509234,"teacher_disagreement_score":0.5443096,"about_ca_system_score_codex":0.000112751644,"about_ca_system_score_gemma":0.00027113783,"threshold_uncertainty_score":0.9999792},"labels":[],"label_agreement":null},{"id":"W1595412293","doi":"10.1002/jgt.20626","title":"Large cliques or stable sets in graphs with no four‐edge path and no five‐edge path in the complement","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Induced path; Block graph; Conjecture; Induced subgraph; Path graph; Split graph; Independent set; Discrete mathematics; Complement (music); Graph factorization; Graph; Path (computing); Longest path problem; Chordal graph; Pathwidth; Line graph; Graph power; Computer science; Vertex (graph theory)","score_opus":0.04279535364240605,"score_gpt":0.2992597116122812,"score_spread":0.25646435796987516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595412293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91672546,0.0017990791,0.07142038,0.0002617502,0.0003911133,0.0010500861,0.000039958304,0.000054617427,0.00825755],"genre_scores_gemma":[0.9821242,0.0006906844,0.016494546,0.00051025016,0.000034775156,0.000023348202,0.0000010505642,0.000023037333,0.00009807881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996277,0.0014147286,0.00063973485,0.00034290037,0.0006418201,0.0006838638],"domain_scores_gemma":[0.99772215,0.0007469628,0.00040096077,0.0005984426,0.0003613351,0.00017017133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007147487,0.00026572935,0.00044175386,0.0007519357,0.00017923117,0.000111062705,0.0015469133,0.00006985478,0.000069266025],"category_scores_gemma":[0.00017762976,0.0001471981,0.00012011555,0.0010792734,0.0002910418,0.0009420526,0.00029290954,0.0007721106,0.0000087041235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036477114,0.001177004,0.046799943,0.000116902105,0.000117696334,0.0017271637,0.023338392,0.000012135637,0.0003364992,0.916242,0.0015670161,0.0049175327],"study_design_scores_gemma":[0.0039469944,0.0035488277,0.048957676,0.00046735,0.000021328495,0.00046262867,0.0033750618,0.0004535153,0.00023638688,0.9353852,0.002690707,0.00045429883],"about_ca_topic_score_codex":0.000020296318,"about_ca_topic_score_gemma":0.00015065014,"teacher_disagreement_score":0.06539876,"about_ca_system_score_codex":0.000047970654,"about_ca_system_score_gemma":0.00014590382,"threshold_uncertainty_score":0.60025644},"labels":[],"label_agreement":null},{"id":"W159710950","doi":"","title":"Self-complementary Graphs with Minimum Degree Two","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics","score_opus":0.03104552313222821,"score_gpt":0.27496098841493855,"score_spread":0.24391546528271033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159710950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9282819,0.0011008778,0.0127956625,0.0026342392,0.0024784328,0.0013915116,0.000011263334,0.0018446186,0.049461465],"genre_scores_gemma":[0.9640617,0.000031356827,0.035308883,0.00025976653,0.000007018337,0.00004423759,0.0000026568405,0.0000262621,0.0002581382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775785,0.00015530756,0.00022796715,0.0005764703,0.0006259171,0.0006564843],"domain_scores_gemma":[0.9982332,0.00020323604,0.00008295958,0.0011217176,0.00013127626,0.00022760419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030872153,0.00023353493,0.00021812791,0.0002300771,0.00027181362,0.0001234504,0.00163318,0.00003793661,0.00012793517],"category_scores_gemma":[0.000016259108,0.0002045034,0.000073245144,0.0011414994,0.00012303746,0.0006985362,0.00040022362,0.00027664122,0.00024142166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001131962,0.00023769874,0.0041305586,0.000011586859,0.000055224802,0.00009698261,0.00046423523,0.0000050455787,0.00009989502,0.9875083,0.0021315115,0.0052476255],"study_design_scores_gemma":[0.0026116793,0.0005125622,0.0009723804,0.000018821605,0.000011083726,0.000055736284,0.000050755014,0.007145461,0.0011643108,0.98119044,0.0058642877,0.000402469],"about_ca_topic_score_codex":0.000015002796,"about_ca_topic_score_gemma":0.000012395864,"teacher_disagreement_score":0.04920333,"about_ca_system_score_codex":0.00006844851,"about_ca_system_score_gemma":0.000026156955,"threshold_uncertainty_score":0.8339407},"labels":[],"label_agreement":null},{"id":"W159748213","doi":"","title":"On Disconnected Graph with Large Reconstruction Number.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Totally disconnected space; Connectivity; Connected component; Discrete mathematics","score_opus":0.013110134706882505,"score_gpt":0.2500286008500767,"score_spread":0.23691846614319423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159748213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96113396,0.000050222166,0.015756348,0.00053888274,0.0013593443,0.00030702472,0.000004143719,0.0004580108,0.020392071],"genre_scores_gemma":[0.99670714,0.00001647319,0.0026978971,0.00009453478,0.000005197144,0.000027402113,0.000001583187,0.00001722979,0.00043255917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984122,0.00014068595,0.000152797,0.00045993942,0.00038134423,0.0004530288],"domain_scores_gemma":[0.9987098,0.0002105846,0.000072590556,0.00076632027,0.00010383196,0.00013687389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002094157,0.00016455224,0.00016014065,0.00013779112,0.00025058218,0.0001020454,0.0006619356,0.000059046506,0.00025389018],"category_scores_gemma":[0.00007431576,0.00013746845,0.000052136318,0.0010834722,0.00010302634,0.0006110581,0.00011577687,0.00028726176,0.00039828997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017737217,0.00014836143,0.0021863466,0.00000386594,0.000018626843,0.000025649713,0.00014338814,0.0000085637885,0.0000601539,0.99150497,0.00059808185,0.00528427],"study_design_scores_gemma":[0.0012701785,0.0002771811,0.00093480304,0.000034819266,0.0000030033432,0.000077561286,0.00002819721,0.0028518941,0.0011099984,0.99285483,0.0003312223,0.0002263204],"about_ca_topic_score_codex":0.0000035103435,"about_ca_topic_score_gemma":0.0000045080255,"teacher_disagreement_score":0.03557317,"about_ca_system_score_codex":0.000048245536,"about_ca_system_score_gemma":0.000013541321,"threshold_uncertainty_score":0.5605801},"labels":[],"label_agreement":null},{"id":"W1597703390","doi":"10.1007/11604686_18","title":"Ultimate Generalizations of LexBFS and LEX M","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Chordal graph; Graph; Combinatorics; Set (abstract data type); Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.023247366250803928,"score_gpt":0.2896899513063959,"score_spread":0.266442585055592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597703390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010446303,0.0007961632,0.99428535,0.0004547303,0.00029996983,0.00027317303,0.000007687634,0.00007961449,0.0036988347],"genre_scores_gemma":[0.09341641,0.00027146222,0.9047268,0.0005467199,0.00022868169,0.000007960203,0.0000043665314,0.00003656362,0.00076102227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971626,0.000047697635,0.0004257114,0.001072281,0.0007803622,0.0005113483],"domain_scores_gemma":[0.997664,0.0005327037,0.00021811898,0.001150721,0.00027938097,0.00015512967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081387174,0.00034249487,0.00042128516,0.00096065714,0.00019331,0.00020223632,0.0023149299,0.00018487572,0.000022290615],"category_scores_gemma":[0.000120442295,0.0003168588,0.0000751053,0.0006900243,0.0014018698,0.00063310954,0.0014404302,0.0004420084,0.000011950669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061422015,0.000021961074,0.000050728842,0.000041915588,0.000010442949,0.000021744037,0.00069575745,0.07147395,0.0011542437,0.29920235,0.000008049207,0.6273127],"study_design_scores_gemma":[0.00024287082,0.00011902868,0.00014984922,0.00019428912,0.000004770528,0.000082543585,1.3152315e-7,0.4898001,0.0028925352,0.5050582,0.0009874129,0.00046824914],"about_ca_topic_score_codex":0.000008591444,"about_ca_topic_score_gemma":0.000039216786,"teacher_disagreement_score":0.62684447,"about_ca_system_score_codex":0.0001063729,"about_ca_system_score_gemma":0.00030354582,"threshold_uncertainty_score":0.99992836},"labels":[],"label_agreement":null},{"id":"W1598462167","doi":"","title":"Balanced allocations: balls-into-bins revisited and chains-into-bins","year":2007,"lang":"en","type":"article","venue":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bin; Ball (mathematics); Combinatorics; Bounded function; Mathematics; Chain (unit); Set (abstract data type); Mathematical optimization; Discrete mathematics; Computer science; Algorithm; Physics; Geometry","score_opus":0.03597906122040967,"score_gpt":0.3657497126521062,"score_spread":0.32977065143169654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598462167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808584,0.0006536422,0.002388365,0.01069783,0.00018253936,0.0007552902,0.00010794492,0.000038442024,0.0043175896],"genre_scores_gemma":[0.97440577,0.0033203536,0.021055223,0.00076492416,0.00024989227,0.00001699073,0.000008935873,0.000028495562,0.00014939478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905377,0.00023754226,0.0017231206,0.0021205961,0.00079974235,0.004581312],"domain_scores_gemma":[0.98708725,0.002268013,0.00033261447,0.0015050187,0.001381454,0.0074256603],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.017285708,0.0005012981,0.0010326816,0.00224087,0.001236713,0.001069909,0.0032019154,0.000268814,0.00006232448],"category_scores_gemma":[0.0063969493,0.0004679955,0.00016544673,0.0023657465,0.014188776,0.003100003,0.0027529332,0.0011165782,0.000033395583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007932591,0.00018363995,0.009105248,0.00007307989,0.000018838578,0.000005034977,0.00007818151,0.00003534299,0.003642538,0.98259467,0.000016328813,0.0041677835],"study_design_scores_gemma":[0.002104831,0.0013242405,0.112613715,0.0001661194,0.000020495952,0.0000942332,0.0009293239,0.079494774,0.011316005,0.7881827,0.002800643,0.0009529149],"about_ca_topic_score_codex":0.0018908324,"about_ca_topic_score_gemma":0.00045587652,"teacher_disagreement_score":0.19441195,"about_ca_system_score_codex":0.0010981908,"about_ca_system_score_gemma":0.0037937015,"threshold_uncertainty_score":0.9999671},"labels":[],"label_agreement":null},{"id":"W159861840","doi":"","title":"Neighborhood Union Condition with Distance for Vertex-pancyclicity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.011887405154393143,"score_gpt":0.27203364812114655,"score_spread":0.2601462429667534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159861840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16000153,0.00014103996,0.83254015,0.0011705008,0.00096226385,0.0006915844,0.0000092663095,0.0003205447,0.004163116],"genre_scores_gemma":[0.995939,0.000027557664,0.0033265073,0.0001605951,0.000007349104,0.00011293339,0.000014342939,0.000020952544,0.00039077166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985076,0.00009816385,0.00016560282,0.0004429694,0.00033622165,0.00044940226],"domain_scores_gemma":[0.9986315,0.00028346758,0.00008514819,0.0006698775,0.00019737045,0.0001326718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031553453,0.00016274919,0.00017846866,0.00010472918,0.00024334,0.00009846741,0.00075922953,0.000058483987,0.000009343654],"category_scores_gemma":[0.00007046757,0.00014587658,0.000052176812,0.0007375228,0.000098505094,0.00078482577,0.00010070132,0.00015376272,0.000027377411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006234817,0.000102996666,0.0034869886,0.000010638455,0.000015006666,0.000015400483,0.000076630415,0.000023296221,0.00025075817,0.99027324,0.00043658548,0.005246098],"study_design_scores_gemma":[0.0016594557,0.00044073313,0.0025258986,0.000028863102,0.000005022533,0.000023058139,0.000016278327,0.0044302186,0.0011257618,0.9823737,0.0071485145,0.00022247808],"about_ca_topic_score_codex":0.0000055106802,"about_ca_topic_score_gemma":0.000009354417,"teacher_disagreement_score":0.83593744,"about_ca_system_score_codex":0.000081597056,"about_ca_system_score_gemma":0.000054762964,"threshold_uncertainty_score":0.5948674},"labels":[],"label_agreement":null},{"id":"W1598672207","doi":"10.37236/2533","title":"A Note on Forbidding Clique Immersions","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Digraph; Eulerian path; Clique; Discrete mathematics; Graph; Structured program theorem; Immersion (mathematics); Robertson–Seymour theorem; Extremal graph theory; Pathwidth; Line graph; Pure mathematics; Voltage graph","score_opus":0.011424469731928658,"score_gpt":0.2835691420794096,"score_spread":0.2721446723474809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598672207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10787873,0.0010322962,0.8788394,0.008759561,0.0006029226,0.00028120287,1.934112e-7,0.00003725239,0.0025684382],"genre_scores_gemma":[0.9987731,0.00033484877,0.00024020915,0.00026195895,0.000053314445,0.000005760587,7.5507074e-8,0.000012635653,0.00031810222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981011,0.00022889148,0.00029935237,0.0001299241,0.0005464817,0.0006942343],"domain_scores_gemma":[0.99812454,0.000667072,0.0002628816,0.0004964123,0.00032988068,0.00011920017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014038444,0.00012461467,0.00018292153,0.00019882369,0.00023972557,0.00009851113,0.0019222666,0.00004870895,0.00001444037],"category_scores_gemma":[0.00019652027,0.0000788614,0.00014237408,0.000727035,0.00006237766,0.0005500086,0.00017725785,0.0011693046,0.00007405001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001417344,0.00006143089,0.000020213005,0.0000019391882,0.00002281149,0.000005128576,0.00016575656,0.00010767533,0.0010244638,0.9941411,0.00051540154,0.0039198915],"study_design_scores_gemma":[0.00041959586,0.0008473566,0.00012216001,0.00002111573,0.0000056677254,0.00012307492,0.000044913813,0.0020211602,0.0036894833,0.99003804,0.0025736296,0.00009383049],"about_ca_topic_score_codex":0.0000041931935,"about_ca_topic_score_gemma":6.989105e-7,"teacher_disagreement_score":0.89089435,"about_ca_system_score_codex":0.00033322835,"about_ca_system_score_gemma":0.00036773496,"threshold_uncertainty_score":0.50801116},"labels":[],"label_agreement":null},{"id":"W1598867843","doi":"10.1007/978-3-642-03816-7_18","title":"DP-Complete Problems Derived from Extremal NP-Complete Properties","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"NP-complete; Implicant; Combinatorics; Computer science; Mathematics; Contrast (vision); Degree (music); Discrete mathematics; Time complexity; Artificial intelligence; Physics; Boolean function","score_opus":0.05478918288468504,"score_gpt":0.2595776014824834,"score_spread":0.20478841859779834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598867843","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034132082,0.0018161589,0.9902695,0.0018853287,0.0010186878,0.0010977095,0.00003134281,0.00045692563,0.0030830316],"genre_scores_gemma":[0.19950432,0.00017277001,0.7933969,0.0037472872,0.001157833,0.00007155564,0.000035196066,0.00016047915,0.0017536774],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99168307,0.00016068584,0.00095934625,0.00325302,0.002252932,0.0016909565],"domain_scores_gemma":[0.9947884,0.0006918239,0.00045522564,0.0031159427,0.0005205081,0.00042811647],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011235871,0.0011047327,0.0011136222,0.0013515499,0.00064127526,0.0011859455,0.008575876,0.00043319564,0.00006411875],"category_scores_gemma":[0.00017451533,0.00095136755,0.00029796758,0.0010954078,0.0020176326,0.0014196401,0.0028020162,0.001798211,0.00021148108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041148418,0.00007516189,0.000037007234,0.00006614236,0.00004177989,0.00025839583,0.0016147488,0.023132661,0.029199755,0.019692706,0.000028486571,0.925812],"study_design_scores_gemma":[0.00063707656,0.00043363692,0.00030986196,0.00085708627,0.000012302914,0.000114063085,3.730957e-7,0.2506179,0.004263742,0.7339296,0.0072114505,0.0016129619],"about_ca_topic_score_codex":0.00008093374,"about_ca_topic_score_gemma":0.00018877682,"teacher_disagreement_score":0.92419904,"about_ca_system_score_codex":0.00044887,"about_ca_system_score_gemma":0.00066198345,"threshold_uncertainty_score":0.9998509},"labels":[],"label_agreement":null},{"id":"W1599403872","doi":"10.1016/j.dam.2016.01.026","title":"Global cycle properties of locally isometric graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Combinatorics; Isometric exercise; Conjecture; Chordal graph; Neighbourhood (mathematics); Discrete mathematics; Indifference graph; Graph; Vertex (graph theory); Mathematical analysis","score_opus":0.021100355340927864,"score_gpt":0.26408884339656225,"score_spread":0.2429884880556344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599403872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066365816,0.0001373042,0.9222874,0.00015191502,0.000042135413,0.0003531397,0.000010134064,0.0001514763,0.010500671],"genre_scores_gemma":[0.8886542,0.000029443361,0.11113998,0.00002810432,0.00000908034,0.00004448172,3.1733856e-7,0.0000140373995,0.00008036141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827445,0.00002205168,0.00039288038,0.00032705703,0.00058103906,0.00040251188],"domain_scores_gemma":[0.9985353,0.00013296632,0.00017143709,0.00093480246,0.00010999541,0.00011549404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037150198,0.0001802364,0.0002913396,0.00020915201,0.00006985473,0.000045674922,0.0013125322,0.00006123956,0.000013267907],"category_scores_gemma":[0.0001256312,0.00010585361,0.00009491439,0.0015213018,0.00028422524,0.0002554217,0.00048179092,0.00005846481,0.00008155775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124897715,0.00008106037,0.000056109267,0.00011365592,0.00002546485,0.0000016969252,0.00022109316,0.000017968678,0.02469767,0.95592576,0.000033014672,0.018814012],"study_design_scores_gemma":[0.00049483863,0.000069336595,0.00012437333,0.00010958426,0.000008110141,0.000007918562,0.000121416066,0.0017192689,0.046666343,0.9503723,0.00007401651,0.00023249982],"about_ca_topic_score_codex":0.0000018747911,"about_ca_topic_score_gemma":0.0000015192596,"teacher_disagreement_score":0.8222884,"about_ca_system_score_codex":0.000045064506,"about_ca_system_score_gemma":0.00005408818,"threshold_uncertainty_score":0.43165848},"labels":[],"label_agreement":null},{"id":"W1599512452","doi":"10.1007/978-3-319-07557-0_1","title":"The Cycling Property for the Clutter of Odd st-Walks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Bipartite graph; Clutter; Combinatorics; Computer science; Eulerian path; Matroid; Electronic circuit; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Telecommunications; Physics; Pure mathematics; Radar","score_opus":0.028923743418956042,"score_gpt":0.2878754024216047,"score_spread":0.25895165900264866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599512452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012578922,0.00074654125,0.9923285,0.003522531,0.0013168277,0.0010641931,0.000006036786,0.00006251048,0.00094023976],"genre_scores_gemma":[0.25424585,0.0004371382,0.73095727,0.005469892,0.0021590032,0.0002586963,0.0000055867918,0.0001828958,0.0062836735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614626,0.0000894653,0.0005759452,0.001161324,0.0011801774,0.0008468149],"domain_scores_gemma":[0.99087954,0.005679352,0.00036466244,0.0024535665,0.00051586586,0.0001069902],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0037024054,0.00041470485,0.00043768543,0.00032363154,0.0009149493,0.0004970641,0.007958157,0.00019986783,0.00000548379],"category_scores_gemma":[0.00048346136,0.00018866439,0.00022812831,0.00052604027,0.0022946661,0.00028344226,0.0019936608,0.0009122134,0.00001049792],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020302079,0.000008607876,0.000011579111,0.000035838468,0.00001802767,0.0000032471107,0.00033523564,0.014555091,0.00016662371,0.09996264,0.00006778845,0.88481504],"study_design_scores_gemma":[0.00022411447,0.00020505415,0.000028203796,0.00019113782,0.000007582174,0.000019133664,3.460163e-7,0.5220261,0.0016245778,0.45115456,0.024181228,0.0003379333],"about_ca_topic_score_codex":0.000009071428,"about_ca_topic_score_gemma":0.00006914,"teacher_disagreement_score":0.8844771,"about_ca_system_score_codex":0.000117147174,"about_ca_system_score_gemma":0.00038011526,"threshold_uncertainty_score":0.9974093},"labels":[],"label_agreement":null},{"id":"W159955302","doi":"","title":"Average lower independence in trees and outerplanar graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Combinatorics; Pathwidth; Discrete mathematics; Statistics; Graph; Line graph","score_opus":0.011522635569900066,"score_gpt":0.25953387175641757,"score_spread":0.2480112361865175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159955302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877511,0.00044351208,0.0054944814,0.00016948396,0.0010047853,0.00023183231,0.0000013104951,0.000101704165,0.004801778],"genre_scores_gemma":[0.99781,0.000060114984,0.0018211516,0.00010479424,0.0000010645562,0.000015848278,4.0312116e-7,0.000010109472,0.00017651275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838513,0.00020413804,0.00018306593,0.00045532416,0.0003646962,0.0004076371],"domain_scores_gemma":[0.99901605,0.0001840319,0.00004344862,0.0005711041,0.00005210789,0.00013326314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006469325,0.00014919358,0.00017423589,0.000259085,0.00009172281,0.00010087718,0.00065419497,0.00008375871,0.000014967743],"category_scores_gemma":[0.0001360191,0.00014708463,0.00003534851,0.0007326429,0.00010465745,0.0006150343,0.0001780396,0.0003209846,0.000027023107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079264455,0.00007264481,0.024494398,0.0000043732057,0.000005254134,0.00012743402,0.00025396296,0.000019843765,0.00017875609,0.97331214,0.00006138152,0.0014618587],"study_design_scores_gemma":[0.00074686867,0.000106051826,0.011614332,0.000017237251,7.677034e-7,0.00002559012,0.000019199826,0.0005051644,0.00093116873,0.9851291,0.00072046893,0.00018403222],"about_ca_topic_score_codex":0.000016909347,"about_ca_topic_score_gemma":0.000028629081,"teacher_disagreement_score":0.012880067,"about_ca_system_score_codex":0.000035191435,"about_ca_system_score_gemma":0.0000480815,"threshold_uncertainty_score":0.59979373},"labels":[],"label_agreement":null},{"id":"W1601379450","doi":"10.1007/3-540-44450-5_13","title":"Arithmetic Circuits and Polynomial Replacement Systems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Generalization; Polynomial; Electronic circuit; Scope (computer science); Arithmetic; Natural number; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Programming language; Electrical engineering","score_opus":0.019089426504118573,"score_gpt":0.2632402137323563,"score_spread":0.24415078722823771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601379450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017943933,0.0019535772,0.9883178,0.00030447895,0.0012727083,0.0006607208,0.000006475231,0.00015567649,0.007149143],"genre_scores_gemma":[0.7532233,0.0008946659,0.23724055,0.0019853325,0.0016847524,0.00009323148,0.000011337456,0.00018238444,0.0046844585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951699,0.00007973657,0.00054358545,0.0020162947,0.001286955,0.00090355426],"domain_scores_gemma":[0.9969884,0.0005696728,0.00020039751,0.0017760985,0.00015882129,0.0003066078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001319443,0.000538963,0.0005850758,0.0011985208,0.00033148297,0.0008902695,0.0030239164,0.00028501268,0.000023113002],"category_scores_gemma":[0.00006929048,0.00050361105,0.000086480446,0.00064647256,0.001140594,0.0006107786,0.0013815858,0.00093558844,0.000053319578],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016810522,0.000026771822,0.000043284188,0.00006414713,0.000017880064,0.00016063321,0.00046500957,0.015460975,0.00012355448,0.05757787,0.000028696444,0.92601436],"study_design_scores_gemma":[0.000995383,0.0008098852,0.00014831111,0.0009201077,0.000014420836,0.0007299144,4.531649e-7,0.58801764,0.0006678355,0.39518893,0.0108132325,0.0016938664],"about_ca_topic_score_codex":0.000025553776,"about_ca_topic_score_gemma":0.0000150232045,"teacher_disagreement_score":0.9243205,"about_ca_system_score_codex":0.00032272495,"about_ca_system_score_gemma":0.0004492177,"threshold_uncertainty_score":0.99974155},"labels":[],"label_agreement":null},{"id":"W1602309302","doi":"10.1016/j.jcss.2015.07.004","title":"Conservative constraint satisfaction re-revisited","year":2015,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint satisfaction problem; Homomorphism; Mathematics; Constraint (computer-aided design); Variable (mathematics); Graph; Constraint satisfaction; Discrete mathematics; Conservative extension; Combinatorics; Statistics","score_opus":0.06971659307546549,"score_gpt":0.32773972412823354,"score_spread":0.2580231310527681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602309302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1322112,0.0004220395,0.86424494,0.0006137053,0.0006317406,0.00009155038,8.5316464e-7,0.00002914788,0.0017548611],"genre_scores_gemma":[0.9204161,0.000008209918,0.07935771,0.000088374654,0.00011528642,6.2515727e-7,3.9612406e-8,0.0000019071468,0.000011753402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982328,0.00032823914,0.00040424254,0.0001897323,0.0006555796,0.00018944808],"domain_scores_gemma":[0.9984971,0.00028435997,0.00034225755,0.00014384392,0.00050322176,0.00022918402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030570228,0.00009417045,0.0002547909,0.00027140288,0.0001624805,0.00032854927,0.00057277497,0.000029546121,0.0000012560787],"category_scores_gemma":[0.000049170318,0.00006414044,0.000051523868,0.00056817906,0.00035324905,0.0010921234,0.00013892265,0.00013807607,0.000004226937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006076627,0.00004341809,0.042135194,0.00009447813,0.00008332607,0.000242974,0.004913696,0.0018197243,0.00034827748,0.81591046,0.0040624146,0.13028526],"study_design_scores_gemma":[0.005662269,0.0080725625,0.09750626,0.0019316006,0.000044953413,0.01205012,0.015136443,0.7383683,0.0014686,0.113948815,0.004587585,0.0012225197],"about_ca_topic_score_codex":0.000008593792,"about_ca_topic_score_gemma":0.0000016575148,"teacher_disagreement_score":0.7882049,"about_ca_system_score_codex":0.000053304186,"about_ca_system_score_gemma":0.00023791661,"threshold_uncertainty_score":0.31682083},"labels":[],"label_agreement":null},{"id":"W1604898370","doi":"10.1007/s10107-003-0407-5","title":"The stable set problem and the lift-and-project ranks of graphs","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Subdivision; Vertex (graph theory); Pathwidth; Cograph; Graph; Discrete mathematics; Split graph; Line graph","score_opus":0.02837370701248726,"score_gpt":0.3029111102361365,"score_spread":0.2745374032236492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604898370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019065421,0.003488831,0.96095735,0.0016396466,0.000068372356,0.0031460593,0.00000180858,0.00019782863,0.0114347115],"genre_scores_gemma":[0.65698135,0.00014491536,0.34206057,0.000055337918,0.000009598617,0.0003360072,3.2420755e-7,0.0000232891,0.00038862805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830055,0.0003662513,0.0003034655,0.00025359634,0.00036060374,0.0004155104],"domain_scores_gemma":[0.99727196,0.0019731994,0.00009172441,0.0005222991,0.000073702446,0.00006711654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035059429,0.00012817074,0.00022731633,0.00005453334,0.000400437,0.00028057734,0.00054471596,0.000040675972,0.0000030457],"category_scores_gemma":[0.0007024857,0.000061731975,0.00006171012,0.00051894557,0.00097368687,0.00018309827,0.000277281,0.00022972141,0.0000032064825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015780604,0.000025276313,0.000041159867,0.00009477756,0.000020311354,0.0000013271555,0.0013499978,0.0000012721878,0.000022242706,0.95572317,0.000016788325,0.042687874],"study_design_scores_gemma":[0.00058287644,0.00006431322,0.000004666373,0.000039862367,0.000009317929,0.00003539894,0.00047842597,0.0048718103,0.00032016798,0.9896845,0.0038201234,0.000088523],"about_ca_topic_score_codex":0.0000050347076,"about_ca_topic_score_gemma":0.0000022103393,"teacher_disagreement_score":0.6379159,"about_ca_system_score_codex":0.000007016472,"about_ca_system_score_gemma":0.000033968267,"threshold_uncertainty_score":0.358759},"labels":[],"label_agreement":null},{"id":"W1609598951","doi":"10.15517/rmta.v19i2.1334","title":"Variants of the mixed postman problem solvable using linear programming","year":2012,"lang":"en","type":"article","venue":"Revista de Matemática Teoría y Aplicaciones","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sistema Nacional de Investigadores; University of Waterloo; Universidad Autónoma Metropolitana","keywords":"Mixed graph; Mathematics; Linear programming; Graph; Combinatorics; Time complexity; Discrete mathematics; Mathematical optimization; Line graph; Voltage graph","score_opus":0.029473064422161414,"score_gpt":0.29745937250027893,"score_spread":0.2679863080781175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609598951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3641788,0.0015052172,0.6299,0.0013676367,0.00023851801,0.001664564,0.00001237633,0.00034506945,0.0007878122],"genre_scores_gemma":[0.80461115,0.000018121435,0.19507255,0.00005562702,0.00007370763,0.00004156561,0.0000011896702,0.00002855725,0.000097527074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99742556,0.0003756826,0.00046552613,0.00036345428,0.0004693057,0.00090047537],"domain_scores_gemma":[0.9979073,0.00019871358,0.00025068637,0.0012479958,0.00017945872,0.00021587052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016478426,0.00022192906,0.00032337254,0.0001248028,0.00033053829,0.00014253068,0.0014542774,0.00009918533,0.00001768075],"category_scores_gemma":[0.00021187971,0.0001598941,0.00015087218,0.0010474666,0.0001976848,0.00064051704,0.0008249587,0.00026217784,0.000036752182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002645272,0.00030753406,0.007105345,0.00045942582,0.000054171564,0.00000427607,0.0007013306,0.000120631936,0.054659892,0.926154,0.000058819795,0.010348078],"study_design_scores_gemma":[0.0049328106,0.0010989566,0.061769236,0.0051188096,0.0006109441,0.0024695764,0.0015303366,0.18158577,0.29401225,0.18729284,0.25392854,0.0056499294],"about_ca_topic_score_codex":0.000010437103,"about_ca_topic_score_gemma":6.675147e-7,"teacher_disagreement_score":0.7388612,"about_ca_system_score_codex":0.00008806321,"about_ca_system_score_gemma":0.00010309643,"threshold_uncertainty_score":0.6520292},"labels":[],"label_agreement":null},{"id":"W1609788678","doi":"10.1007/s00493-016-3356-3","title":"Density of 5/2-critical graphs","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph homomorphism; Discrete mathematics; Graph; Homomorphism; Triangle-free graph; Graph power; Line graph","score_opus":0.018925724334806764,"score_gpt":0.2944850513808936,"score_spread":0.2755593270460868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609788678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11592005,0.00023702027,0.874214,0.0033391314,0.00074487744,0.00015222895,0.000002523902,0.00024385627,0.0051463293],"genre_scores_gemma":[0.9951965,0.000014571825,0.0045706276,0.000032506825,0.0000057716707,0.000005723339,6.339018e-8,0.000005747773,0.0001684387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988853,0.000100333804,0.0001495908,0.00026458266,0.00031596213,0.00028426902],"domain_scores_gemma":[0.9982943,0.0006191115,0.000033542266,0.00071298913,0.00021025541,0.00012979671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026892681,0.00008060868,0.00014535814,0.00012164174,0.00006841628,0.000013678276,0.0009231786,0.000041248742,0.00001873348],"category_scores_gemma":[0.0005100616,0.00005510566,0.00006766829,0.0005553107,0.0002823712,0.0003081553,0.00037694984,0.00007732527,0.00006639901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004978885,0.000094834475,0.002301122,0.00000830526,0.0000038030594,0.000011225914,0.000029458472,4.0981725e-8,0.0058918265,0.97903794,0.00024154701,0.012374916],"study_design_scores_gemma":[0.00026705742,0.00011170554,0.0035329727,0.0000141315495,0.0000014814053,0.000007184576,0.0000026806442,0.000040387327,0.037461996,0.95775527,0.00071725063,0.00008787479],"about_ca_topic_score_codex":0.0000016763822,"about_ca_topic_score_gemma":1.7511233e-7,"teacher_disagreement_score":0.8792765,"about_ca_system_score_codex":0.000031915453,"about_ca_system_score_gemma":0.000037774804,"threshold_uncertainty_score":0.22471435},"labels":[],"label_agreement":null},{"id":"W1612749533","doi":"10.37236/3128","title":"Optimization Problems over Unit-Distance Representations of Graphs","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Hypersphere; Mathematics; Combinatorics; Ellipsoid; Homomorphism; Generalization; Graph; Discrete mathematics; Unit sphere; Unit (ring theory)","score_opus":0.0181356453415886,"score_gpt":0.29378667735360786,"score_spread":0.27565103201201924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1612749533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019076029,0.006334672,0.9721239,0.0006761562,0.0006730251,0.00051331654,0.0000028472004,0.000031620857,0.0005684311],"genre_scores_gemma":[0.99307716,0.0045173275,0.0019626368,0.00002366901,0.000039502273,0.000023573537,0.0000035766595,0.000029349558,0.00032323343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965997,0.0005390878,0.0008865735,0.00029176,0.0010665387,0.0006163774],"domain_scores_gemma":[0.9949602,0.00045068294,0.0017509036,0.001287627,0.0014447322,0.00010586978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019090223,0.00025712553,0.0004789965,0.00044357992,0.0001605279,0.00014242764,0.0035991946,0.00015720278,0.00001739734],"category_scores_gemma":[0.0002270653,0.00019161368,0.00027815386,0.001339709,0.00021211943,0.00055398466,0.000841258,0.0021519805,0.0000022486445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014541868,0.00011012998,0.0001482725,0.000044861434,0.00012410739,0.000002177515,0.0003688423,0.18331724,0.00006456759,0.8154124,0.00013737382,0.0002554825],"study_design_scores_gemma":[0.00048098076,0.0002624946,0.0001597947,0.00011921131,0.00003711108,0.00003821969,0.000037453847,0.029012382,0.0004841321,0.9688862,0.0003135112,0.00016848303],"about_ca_topic_score_codex":0.000019130557,"about_ca_topic_score_gemma":0.0000037288917,"teacher_disagreement_score":0.9740011,"about_ca_system_score_codex":0.00027504103,"about_ca_system_score_gemma":0.001120275,"threshold_uncertainty_score":0.93494046},"labels":[],"label_agreement":null},{"id":"W161287854","doi":"","title":"Edge Complete (p, 2) Semigraphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.022926056344896535,"score_gpt":0.2889876445121452,"score_spread":0.2660615881672487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161287854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6403623,0.0009496704,0.28678033,0.0010560642,0.005887028,0.0007500645,0.0000070817996,0.001352509,0.0628549],"genre_scores_gemma":[0.9904658,0.000012463941,0.008807466,0.00026534402,0.000010616034,0.000008255405,0.0000024503088,0.000017694301,0.000409913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980067,0.00008502362,0.00026033248,0.00045529613,0.000494647,0.0006980205],"domain_scores_gemma":[0.99811053,0.0004001863,0.000072720795,0.0010056697,0.00015637721,0.00025450817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012313676,0.00017116033,0.00018893574,0.00027372962,0.0002196117,0.000093002775,0.0016172034,0.00007478108,0.000027470694],"category_scores_gemma":[0.00009496906,0.00017119202,0.000099395555,0.00124694,0.00014805276,0.00047769237,0.00044990666,0.00030915998,0.00027838018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010461697,0.0000621593,0.0018820665,0.000005567386,0.000012580171,0.00005446913,0.00017826962,0.0000021928702,0.0022122297,0.9869075,0.0015373465,0.0071351593],"study_design_scores_gemma":[0.0005702418,0.00010521341,0.006444767,0.00001095247,0.0000019670006,0.000020445523,0.000024247838,0.00045597597,0.004908754,0.9697925,0.017433234,0.00023172672],"about_ca_topic_score_codex":0.000011839811,"about_ca_topic_score_gemma":0.000007423884,"teacher_disagreement_score":0.35010347,"about_ca_system_score_codex":0.000060202347,"about_ca_system_score_gemma":0.00004182466,"threshold_uncertainty_score":0.6981008},"labels":[],"label_agreement":null},{"id":"W1613467653","doi":"10.1016/j.jctb.2015.12.005","title":"Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Lemma (botany); Conjecture; Isoperimetric inequality; Graph; Vertex (graph theory); Induced subgraph; Discrete mathematics; Botany","score_opus":0.033757637382348084,"score_gpt":0.3304632292392484,"score_spread":0.2967055918569003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1613467653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9659052,0.0006801139,0.01821566,0.0017952507,0.011507934,0.0005449712,0.000013398906,0.000081484715,0.0012559721],"genre_scores_gemma":[0.9917941,0.00004484393,0.0075726444,0.00008512567,0.0002817899,0.00002375942,7.4625245e-7,0.000027634596,0.00016933824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996945,0.0006294807,0.00069223146,0.0003245935,0.0008207961,0.00058787066],"domain_scores_gemma":[0.99603987,0.0020395247,0.00027615792,0.00046498986,0.0007977947,0.0003816361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004736831,0.00025714544,0.00054629566,0.0005580536,0.00029070774,0.0002009203,0.0014403883,0.00013369542,0.000007792735],"category_scores_gemma":[0.0040072175,0.0002183952,0.0002589724,0.0008781544,0.00046275376,0.0017741245,0.00031940438,0.0006335,0.0000030992694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035861868,0.0003299658,0.00020830386,0.000023585988,0.000039294402,0.00008900195,0.0014164271,0.00030150096,0.00029894846,0.9928947,0.0002345324,0.0005775522],"study_design_scores_gemma":[0.0027145573,0.004287254,0.00008267038,0.000105257546,0.000011513785,0.00006001597,0.00052668824,0.00035091516,0.0027188575,0.98468924,0.004218965,0.00023408703],"about_ca_topic_score_codex":0.0000050032127,"about_ca_topic_score_gemma":0.000004993215,"teacher_disagreement_score":0.025888903,"about_ca_system_score_codex":0.00014639132,"about_ca_system_score_gemma":0.00031948395,"threshold_uncertainty_score":0.8905898},"labels":[],"label_agreement":null},{"id":"W16151075","doi":"10.1007/978-3-642-38768-5_28","title":"An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rounding; Semidefinite programming; Computer science; Semidefinite embedding; Bisection method; Graph; Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Quadratically constrained quadratic program","score_opus":0.02390558049323789,"score_gpt":0.27698206770268197,"score_spread":0.2530764872094441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16151075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060024646,0.00027816033,0.9947616,0.00016546746,0.0012645208,0.0027592294,0.000010331096,0.0004622189,0.00023848232],"genre_scores_gemma":[0.0066955606,0.00004174959,0.99197286,0.00016587447,0.00042785582,0.0003944108,0.00003800623,0.00007902758,0.00018465327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459344,0.0001101104,0.0007199124,0.0022456723,0.0010567689,0.0012740821],"domain_scores_gemma":[0.99623394,0.00074008835,0.00048718092,0.0015988897,0.000640657,0.00029921814],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024903435,0.00070387207,0.00059659005,0.0022747298,0.00079202314,0.0018800593,0.003330747,0.00039388484,0.000006263075],"category_scores_gemma":[0.00012894468,0.0006557543,0.00021065422,0.0014322514,0.0009186157,0.0030001337,0.0007823178,0.0010344019,0.0000128230995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061882824,0.000042369527,0.000007615879,0.00010359907,0.0000139623835,0.0000043260416,0.000682382,0.009524599,0.0011193971,0.019078536,0.0000016495937,0.96941537],"study_design_scores_gemma":[0.00022154441,0.00038243236,0.000006329472,0.00017387001,0.0000045814927,0.000028225077,5.826246e-7,0.54630905,0.00087288814,0.4512102,0.00034240825,0.00044787826],"about_ca_topic_score_codex":0.000031998734,"about_ca_topic_score_gemma":0.000041127732,"teacher_disagreement_score":0.9689675,"about_ca_system_score_codex":0.00039741013,"about_ca_system_score_gemma":0.00034503097,"threshold_uncertainty_score":0.9995894},"labels":[],"label_agreement":null},{"id":"W161675474","doi":"10.1016/j.jctb.2007.10.005","title":"Corrigendum to “Counting connected graphs inside-out” [J. Combin. Theory Ser. B 93 (2005) 127–172]","year":2008,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.021592723447045832,"score_gpt":0.27204120898922163,"score_spread":0.2504484855421758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161675474","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036420606,0.010729043,0.0979906,0.0020872508,0.8208679,0.0027247795,0.00016557102,0.0009788277,0.060813967],"genre_scores_gemma":[0.1462052,0.016677966,0.023493327,0.0069314777,0.03989892,0.00036148657,0.00035602672,0.0023790223,0.76369655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9863384,0.0038611179,0.0028000795,0.0013227995,0.003379645,0.0022980035],"domain_scores_gemma":[0.9874679,0.0019778546,0.0031604778,0.0026506106,0.0033640552,0.0013791216],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.008959734,0.0015102152,0.0028036532,0.0024062027,0.0012012623,0.0008553418,0.007906386,0.001328785,0.00034187993],"category_scores_gemma":[0.0049790284,0.0013977202,0.0012082227,0.0023969426,0.0010996764,0.0031665214,0.002013899,0.005833754,0.00017324151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018977172,0.0003551474,0.000016560198,0.000092527356,0.00048654404,0.0009111103,0.0016214063,0.000022166498,0.00023211734,0.65205973,0.340758,0.0015469393],"study_design_scores_gemma":[0.0016544565,0.00172498,0.000033384167,0.00047426383,0.00007045865,0.00078973005,0.00035938848,0.000017844559,0.0010156344,0.6089799,0.38391817,0.0009618218],"about_ca_topic_score_codex":0.000009363563,"about_ca_topic_score_gemma":0.000014678612,"teacher_disagreement_score":0.78096896,"about_ca_system_score_codex":0.0006801931,"about_ca_system_score_gemma":0.0029098217,"threshold_uncertainty_score":0.9999677},"labels":[],"label_agreement":null},{"id":"W161708728","doi":"","title":"Square-free colorings of graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Square-free integer; Cartesian product; Discrete mathematics; Multipartite; Bounded function; Graph; Domination analysis; Vertex (graph theory)","score_opus":0.015100800266836044,"score_gpt":0.26638835724180937,"score_spread":0.25128755697497335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161708728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98020786,0.00022913603,0.008204869,0.0008224826,0.00091060146,0.00030291826,0.0000033743902,0.0002497528,0.009068977],"genre_scores_gemma":[0.99153584,0.000018407582,0.008286386,0.00005344961,0.0000015851039,0.000020368685,6.7679446e-7,0.000012553401,0.000070752445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852705,0.000054597585,0.00023298997,0.00033563812,0.00048101236,0.0003686913],"domain_scores_gemma":[0.99822533,0.00012944391,0.00009545629,0.0012534448,0.00016904068,0.00012726744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037585138,0.00013122197,0.0002005185,0.00021036787,0.000098727316,0.00003815368,0.0020806787,0.00006108538,0.000007895146],"category_scores_gemma":[0.00016905584,0.00013160045,0.00009608333,0.0010993977,0.00017716028,0.00048270085,0.0006300999,0.00019047257,0.000037317604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011539321,0.000115199735,0.00091493793,0.000014691888,0.000013039594,0.000016422893,0.000192389,0.000056764835,0.0014075136,0.9965722,0.00009373848,0.0005915843],"study_design_scores_gemma":[0.0013261493,0.00026248634,0.0021835628,0.000024056584,0.0000022780148,0.000006464765,0.00001879455,0.000030723524,0.026069555,0.96950656,0.00043636144,0.00013301184],"about_ca_topic_score_codex":0.000033873097,"about_ca_topic_score_gemma":0.000003571027,"teacher_disagreement_score":0.027065622,"about_ca_system_score_codex":0.000062076804,"about_ca_system_score_gemma":0.00009451115,"threshold_uncertainty_score":0.5366511},"labels":[],"label_agreement":null},{"id":"W162572492","doi":"","title":"Generalized weakly connected domination in graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.020548479801050817,"score_gpt":0.2737326248080655,"score_spread":0.2531841450070147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162572492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99428827,0.00016228258,0.0024002416,0.000355411,0.0007845838,0.00026503231,8.797583e-7,0.00019032952,0.0015529958],"genre_scores_gemma":[0.99462336,0.00007155442,0.0049035517,0.00010185097,0.0000031542363,0.000047529928,0.0000042509237,0.000013565062,0.00023116682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982416,0.00026358396,0.00026188625,0.00041808526,0.0004033186,0.00041154367],"domain_scores_gemma":[0.9988274,0.00021888241,0.00007284207,0.00061573106,0.00015464933,0.000110496505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043579334,0.00014822891,0.0002114078,0.00041412716,0.00016581811,0.000039941457,0.0009135448,0.00007923732,0.000019136301],"category_scores_gemma":[0.00018382934,0.00015264073,0.000064878346,0.0016341524,0.00012879402,0.00061467214,0.00020750695,0.00023091346,0.00006669474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020658279,0.000100647674,0.0038905544,0.0000035061307,0.00000678175,0.00008874033,0.00038729244,0.000025814328,0.0030741603,0.9909376,0.00038774553,0.0010765005],"study_design_scores_gemma":[0.001890989,0.00008330543,0.02023266,0.0000103430675,0.0000010677459,0.000031385025,0.000011086795,0.0040000402,0.0066662077,0.9664376,0.0004324854,0.00020287246],"about_ca_topic_score_codex":0.00003701277,"about_ca_topic_score_gemma":0.000010746942,"teacher_disagreement_score":0.024500042,"about_ca_system_score_codex":0.00008267025,"about_ca_system_score_gemma":0.000078282595,"threshold_uncertainty_score":0.6224508},"labels":[],"label_agreement":null},{"id":"W1629366369","doi":"10.37236/1893","title":"Matroid Inequalities from Electrical Network Theory","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Generalization; Combinatorics; Rank (graph theory); Logarithm; Class (philosophy); Graphic matroid; Property (philosophy); Discrete mathematics; Plane (geometry); Mathematical analysis; Geometry","score_opus":0.010880758061514501,"score_gpt":0.2616404004158826,"score_spread":0.2507596423543681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1629366369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05500294,0.02331611,0.9169421,0.002907929,0.00045597058,0.00013237262,6.4077415e-7,0.000066551,0.0011753659],"genre_scores_gemma":[0.9966067,0.0010054499,0.0009296986,0.00035177285,0.0005959696,0.000003430439,4.314694e-7,0.000020336258,0.0004861769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965337,0.0008786849,0.00053720066,0.00018297927,0.0008041152,0.0010633214],"domain_scores_gemma":[0.9969243,0.0016465054,0.00039219146,0.0006280721,0.00027804417,0.00013087933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038343912,0.00018769524,0.00032651692,0.00013741029,0.00025301214,0.00012389026,0.0027506836,0.000073823154,0.000024170204],"category_scores_gemma":[0.00022963739,0.00012582408,0.00018723086,0.0009914389,0.00011270105,0.0006091659,0.00024550874,0.0014373091,0.00003349038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009537712,0.00007274938,0.0000764707,0.000001190913,0.00008642708,0.000007518992,0.0003007458,0.0007288376,0.00011361608,0.98940176,0.0008234043,0.008291902],"study_design_scores_gemma":[0.00056960597,0.0004675279,0.0001014509,0.000011645883,0.000018522089,0.0001156005,0.00004005371,0.0018799164,0.001003055,0.9848046,0.010846123,0.0001419111],"about_ca_topic_score_codex":0.0000025737256,"about_ca_topic_score_gemma":0.0000027958038,"teacher_disagreement_score":0.9416038,"about_ca_system_score_codex":0.0004308536,"about_ca_system_score_gemma":0.00054480816,"threshold_uncertainty_score":0.6244472},"labels":[],"label_agreement":null},{"id":"W1631636474","doi":"10.1016/j.dam.2015.06.011","title":"A tie-break model for graph search","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.08109971346624698,"score_gpt":0.3344557456080762,"score_spread":0.2533560321418292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1631636474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002019223,0.000037831785,0.9864867,0.00036759113,0.000042006737,0.0008513321,0.000016715512,0.00023600746,0.00994259],"genre_scores_gemma":[0.17721952,0.0000052653963,0.8216083,0.00017170404,0.000036201043,0.00034444124,0.000010295015,0.000043981774,0.00056029897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979805,0.000018310146,0.00031240963,0.0004359536,0.00064859615,0.0006042666],"domain_scores_gemma":[0.9980971,0.00023935307,0.000081547776,0.0010711091,0.0001947164,0.00031617016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010229194,0.00021453439,0.00028597555,0.00018458228,0.00013484033,0.00015555046,0.0014092184,0.0000814661,0.0000022839602],"category_scores_gemma":[0.00007988932,0.00018245197,0.00010904503,0.00050043815,0.00013381611,0.00026268675,0.00048495302,0.00018360217,0.00006961945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022681188,0.00007059652,0.0000013461181,0.00009225441,0.000020116204,0.0000015408855,0.0035868918,0.0042328252,0.0011518992,0.9868618,0.001193279,0.002764748],"study_design_scores_gemma":[0.00037044522,0.000030572304,3.109332e-7,0.000007333661,0.0000043405735,0.0000034559114,0.0002616924,0.475597,0.0016761427,0.5217174,0.00019417991,0.00013710637],"about_ca_topic_score_codex":0.0000011168376,"about_ca_topic_score_gemma":0.0000016524804,"teacher_disagreement_score":0.47136417,"about_ca_system_score_codex":0.000051120314,"about_ca_system_score_gemma":0.00011322116,"threshold_uncertainty_score":0.74401754},"labels":[],"label_agreement":null},{"id":"W164070410","doi":"","title":"Independent Sets And Matchings In Tensor Product Of Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Product (mathematics); Tensor (intrinsic definition); Combinatorics; Pure mathematics; Geometry","score_opus":0.0124302741916157,"score_gpt":0.2691557154029496,"score_spread":0.2567254412113339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164070410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99803865,0.00024569713,0.00039448545,0.000497464,0.00027215117,0.00023271637,9.83158e-7,0.000045743694,0.00027213292],"genre_scores_gemma":[0.9957924,0.000031188516,0.0040961336,0.00003686315,0.0000010208261,0.000013043678,4.8787484e-7,0.000008812761,0.000020088388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987326,0.000066113695,0.00020880891,0.00037435806,0.00034039462,0.00027770197],"domain_scores_gemma":[0.9992209,0.00006395838,0.00006847692,0.00048847834,0.00007809067,0.00008008621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051342166,0.00011149716,0.00018166796,0.0002565735,0.00004842815,0.00003383077,0.0005913961,0.00003917794,0.0000018117655],"category_scores_gemma":[0.00008739554,0.000105934625,0.000030415724,0.00068026263,0.000113107046,0.000413217,0.00032516278,0.00022111094,0.000006272692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011353108,0.000115739946,0.015393544,0.000022526676,0.0000066658927,0.000027633763,0.00076692924,0.00004319956,0.0018112538,0.9794961,0.000010149093,0.0022948713],"study_design_scores_gemma":[0.0009541673,0.00009057896,0.048563164,0.000033164688,0.0000010812466,0.000017657148,0.000028023667,0.000054021573,0.008303205,0.94182533,0.000022889713,0.00010672208],"about_ca_topic_score_codex":0.00006774909,"about_ca_topic_score_gemma":0.000010717283,"teacher_disagreement_score":0.03767081,"about_ca_system_score_codex":0.000041611354,"about_ca_system_score_gemma":0.0000599502,"threshold_uncertainty_score":0.43198887},"labels":[],"label_agreement":null},{"id":"W1641711201","doi":"10.1007/s00373-009-0864-6","title":"Upper Bounds for α-Domination Parameters","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Domination analysis; Mathematics; Upper and lower bounds; Combinatorics; Vertex (graph theory); Probabilistic logic; Graph; Discrete mathematics; Tuple; Statistics","score_opus":0.016888497846105178,"score_gpt":0.27610609123442076,"score_spread":0.25921759338831557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641711201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3206825,0.000946585,0.6728063,0.002179021,0.0006191878,0.00061758416,0.000004121816,0.00025624826,0.0018883973],"genre_scores_gemma":[0.9860876,0.00009171995,0.013301927,0.00027156962,0.0000046833024,0.000027108157,0.0000022817503,0.0000055558203,0.0002075081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909073,0.000031203428,0.00012223737,0.00028310154,0.0001931128,0.000279634],"domain_scores_gemma":[0.99930197,0.000141003,0.000042461263,0.0003052273,0.00011109177,0.00009827289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031081415,0.000104219034,0.00011927903,0.00018384487,0.00021704304,0.00015271138,0.0003764796,0.00005119657,6.8415363e-7],"category_scores_gemma":[0.000055065724,0.00009754814,0.00006777475,0.0005464349,0.00005393146,0.00036935936,0.000050539147,0.00009135258,0.0000017170943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009577645,0.000047205827,0.00030238277,0.0000050097174,0.0000045388033,0.0000013576034,0.00009783567,0.0000026274613,0.000117184085,0.9511779,0.00024396247,0.047990438],"study_design_scores_gemma":[0.000548752,0.00037361452,0.0027115308,0.0000049603714,0.0000031893208,0.000005049702,0.000018192322,0.003979088,0.0007916376,0.9893035,0.0021299561,0.00013051153],"about_ca_topic_score_codex":0.0000011699346,"about_ca_topic_score_gemma":2.2263272e-7,"teacher_disagreement_score":0.66540515,"about_ca_system_score_codex":0.000019820633,"about_ca_system_score_gemma":0.000017909613,"threshold_uncertainty_score":0.39778975},"labels":[],"label_agreement":null},{"id":"W164421947","doi":"","title":"A space-filling complete graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Space (punctuation); Combinatorics; Computer science","score_opus":0.030524980774971847,"score_gpt":0.2844275239525914,"score_spread":0.25390254317761957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164421947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74937594,0.00085520954,0.21511988,0.0028325205,0.0036932756,0.0006479104,0.0000046699133,0.00116321,0.026307398],"genre_scores_gemma":[0.9894344,0.0000794201,0.009840023,0.00016854436,0.000010066198,0.000013753902,0.0000020830919,0.000020419351,0.00043125686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980775,0.00014011729,0.00020873884,0.0004879388,0.0004768246,0.00060885446],"domain_scores_gemma":[0.9983515,0.0002403837,0.00007195199,0.0009834041,0.0001434319,0.0002093177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004699266,0.00018042623,0.00020903964,0.00024812025,0.00027220423,0.00014919369,0.0014378938,0.0000616596,0.00003560937],"category_scores_gemma":[0.000086260996,0.00018007871,0.00010444545,0.0014024423,0.000121111436,0.0005706911,0.0004125211,0.00028916073,0.00028885575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010410273,0.000057911253,0.0015609207,0.0000042851116,0.000014673699,0.000082951105,0.00018052467,0.00004385286,0.001377809,0.99375445,0.00046967308,0.002442529],"study_design_scores_gemma":[0.00059899274,0.00010009354,0.0009780779,0.000015941649,0.0000023316802,0.000041965235,0.000026323238,0.0041265585,0.00081390963,0.9810765,0.011991962,0.00022737589],"about_ca_topic_score_codex":0.000017166798,"about_ca_topic_score_gemma":0.0000033646565,"teacher_disagreement_score":0.24005851,"about_ca_system_score_codex":0.00005019931,"about_ca_system_score_gemma":0.000041771327,"threshold_uncertainty_score":0.73433965},"labels":[],"label_agreement":null},{"id":"W164741719","doi":"","title":"Embedding Graphs Containing K5-Subdivisions.","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Subdivision; Planarity testing; Mathematics; Embedding; Partition (number theory); Combinatorics; Planar graph; Discrete mathematics; Graph; Computer science; Geography; Artificial intelligence","score_opus":0.04491052220131737,"score_gpt":0.31998172315983103,"score_spread":0.2750712009585137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164741719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01815844,0.0002756986,0.9145274,0.00071044045,0.00017534175,0.00013811732,5.295512e-7,0.00051186536,0.065502174],"genre_scores_gemma":[0.9222085,0.000033376782,0.07518406,0.00037945525,0.000016382306,0.000011273862,2.7833278e-7,0.000009253776,0.0021574115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985957,0.00007675801,0.00016438396,0.00037284155,0.00034699167,0.00044333798],"domain_scores_gemma":[0.9988352,0.0002780921,0.000035446537,0.00062480354,0.00007164304,0.00015478402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000343227,0.000112747664,0.00012403954,0.00023112581,0.00023802783,0.00014925924,0.0010071371,0.00003806189,0.0005027268],"category_scores_gemma":[0.00011530125,0.0000968358,0.000071709874,0.00073956384,0.00007029391,0.0007097531,0.00037970438,0.00018806643,0.0004474039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002157683,0.000030165977,0.0005193245,0.000002024685,0.000010668616,0.00003091802,0.00040343805,0.00014799734,0.0005220662,0.9302829,0.0012718681,0.066776484],"study_design_scores_gemma":[0.00057897926,0.00021402269,0.0004762549,0.000026221245,0.0000029817288,0.00004794115,0.00019201206,0.69301903,0.0020342048,0.2946712,0.0083376365,0.00039952484],"about_ca_topic_score_codex":0.000004159384,"about_ca_topic_score_gemma":0.0000015688281,"teacher_disagreement_score":0.90405005,"about_ca_system_score_codex":0.000021658632,"about_ca_system_score_gemma":0.0000072893467,"threshold_uncertainty_score":0.5750621},"labels":[],"label_agreement":null},{"id":"W165089886","doi":"10.1007/978-3-642-40104-6_16","title":"On the Spanning Ratio of Theta-Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.028394435626567245,"score_gpt":0.2754427752379511,"score_spread":0.24704833961138384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165089886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030778057,0.0002543058,0.9848901,0.0011747739,0.00061686174,0.0005775189,0.0000026023697,0.000077201206,0.012098825],"genre_scores_gemma":[0.73807013,0.00008172868,0.2560246,0.0028091734,0.0002602709,0.000055237695,0.0000027155486,0.00008322638,0.002612905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961462,0.00009974521,0.0004798906,0.0011740655,0.0014468775,0.0006532392],"domain_scores_gemma":[0.99452275,0.0023397952,0.00033809224,0.0023221925,0.00035363543,0.00012354791],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015135236,0.00044679394,0.0004679999,0.00091551756,0.00031601803,0.00034672234,0.005828728,0.00019500189,0.00010055426],"category_scores_gemma":[0.00026888365,0.00028899827,0.00018653907,0.0009797493,0.001706824,0.0005168179,0.0014499906,0.001110048,0.000109496614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043779837,0.000014838609,0.000008141114,0.00001170786,0.000012384845,0.000011719281,0.00043681642,0.016907293,0.00040691745,0.8330882,0.000034132463,0.14906347],"study_design_scores_gemma":[0.000095163035,0.00017871583,0.0000485944,0.00022122802,0.0000029738062,0.000012806792,2.1511285e-7,0.14784074,0.0037461428,0.8473645,0.00020476058,0.00028419742],"about_ca_topic_score_codex":0.000010257669,"about_ca_topic_score_gemma":0.0000074127947,"teacher_disagreement_score":0.73776233,"about_ca_system_score_codex":0.000104219485,"about_ca_system_score_gemma":0.00031679453,"threshold_uncertainty_score":0.9999562},"labels":[],"label_agreement":null},{"id":"W165467593","doi":"10.1007/978-3-642-36694-9_17","title":"Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Computer science; Graphic matroid; Polyhedron; Lift (data mining); Representation (politics); Time complexity; Matrix representation; Flow (mathematics); Algorithm; Matroid partitioning; Set (abstract data type); Relation (database); Combinatorics; Discrete mathematics; Mathematics; Geometry; Data mining","score_opus":0.030916162013431014,"score_gpt":0.2852821066402142,"score_spread":0.2543659446267832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165467593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003156936,0.0010469607,0.99558055,0.00040762403,0.00067892735,0.0010272493,0.000052745494,0.000120259785,0.00076998485],"genre_scores_gemma":[0.09659647,0.00015347579,0.90210766,0.0005195447,0.00026762806,0.000060580336,0.000016393924,0.00007074594,0.00020750698],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955604,0.000076356504,0.00065598736,0.001649387,0.0011303355,0.00092753983],"domain_scores_gemma":[0.99535614,0.0017239371,0.00039003286,0.0016780263,0.0005583383,0.00029350913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013625821,0.0006065262,0.00082976616,0.0017954103,0.00034800213,0.00042560408,0.003650435,0.00037513435,0.000015276737],"category_scores_gemma":[0.00017418759,0.00055790774,0.00022633908,0.0009945922,0.0027113184,0.0008551915,0.0012713873,0.00082817895,0.000010047269],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024928693,0.00010324067,0.00013218039,0.00024689457,0.00004076091,0.000025662188,0.0006423093,0.0032588935,0.0010843186,0.10454628,0.000085884225,0.88980865],"study_design_scores_gemma":[0.0004432547,0.00073139137,0.00008937845,0.0003718594,0.000009261033,0.000060112234,4.5727026e-7,0.36436892,0.0030653465,0.62891436,0.0013007494,0.00064490776],"about_ca_topic_score_codex":0.0000086096,"about_ca_topic_score_gemma":0.000025169104,"teacher_disagreement_score":0.88916373,"about_ca_system_score_codex":0.00010195815,"about_ca_system_score_gemma":0.0002600078,"threshold_uncertainty_score":0.99968725},"labels":[],"label_agreement":null},{"id":"W1658236029","doi":"10.11650/twjm/1500406852","title":"INCIDENCE COLORING OF REGULAR GRAPHS AND COMPLEMENT GRAPHS","year":2012,"lang":"en","type":"article","venue":"Taiwanese Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Incidence (geometry); Complement (music); Chromatic scale; Combinatorics; Discrete mathematics","score_opus":0.03780756360018455,"score_gpt":0.3126725882282856,"score_spread":0.27486502462810103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658236029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8679056,0.0011783849,0.13028844,0.00013562321,0.00013595574,0.0001435571,0.0000013363293,0.000016254011,0.00019485148],"genre_scores_gemma":[0.8038593,0.00010677026,0.19597131,0.000015735946,0.000017485994,0.0000019588285,9.399923e-8,0.000008802275,0.000018514858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798846,0.00010867594,0.0007021,0.000100019526,0.0007597503,0.00034101825],"domain_scores_gemma":[0.9979299,0.00039956137,0.0006943765,0.00040904625,0.00034737727,0.0002197956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026957244,0.0001378668,0.00038662527,0.00035337717,0.00008477566,0.00003974263,0.0008220936,0.000038361395,0.0000135348155],"category_scores_gemma":[0.0002449435,0.000106887914,0.00010669876,0.0004991122,0.00018798679,0.00083642453,0.00032470305,0.00022047071,0.0000027179542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020503625,0.00034735363,0.008273206,0.00032791513,0.0000877759,0.000031098814,0.0061606895,0.000050669452,0.015994575,0.9656926,0.00012757865,0.0028860394],"study_design_scores_gemma":[0.00079872983,0.00047780867,0.004301054,0.00038878174,0.000043049233,0.0011782366,0.0018280137,0.00140259,0.02292533,0.9661024,0.00030240646,0.00025157302],"about_ca_topic_score_codex":0.0000014664981,"about_ca_topic_score_gemma":0.0000010864277,"teacher_disagreement_score":0.06568287,"about_ca_system_score_codex":0.000030140636,"about_ca_system_score_gemma":0.000040507784,"threshold_uncertainty_score":0.43587625},"labels":[],"label_agreement":null},{"id":"W1660895817","doi":"10.1007/978-3-642-13580-4_1","title":"High Degree Graphs Contain Large-Star Factors","year":2010,"lang":"en","type":"book-chapter","venue":"Bolyai Society mathematical studies","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lemma (botany); Session (web analytics); Star (game theory); Combinatorics; Degree (music); Graph; Simple (philosophy); Computer science; Graph theory; Theoretical computer science; Mathematics; Discrete mathematics; World Wide Web; Physics; Biology; Botany","score_opus":0.07678758911574396,"score_gpt":0.3183262065036169,"score_spread":0.24153861738787297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1660895817","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004196936,0.02193882,0.7480968,0.0054325787,0.0030368008,0.005631496,0.0006543286,0.0037598908,0.20725235],"genre_scores_gemma":[0.013040829,0.0060745166,0.45491168,0.0014350538,0.0006365148,0.0003483654,0.00006826563,0.00051226176,0.5229725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560505,0.000060407463,0.00078912836,0.0011122398,0.0013564837,0.0010767094],"domain_scores_gemma":[0.99531645,0.0019381769,0.0003597893,0.0015768345,0.0004898337,0.00031894905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011103001,0.00091329764,0.0015289926,0.00011333146,0.00082480285,0.00016943674,0.0020022814,0.00071288267,0.00028629685],"category_scores_gemma":[0.00046008726,0.00069441367,0.0012018706,0.00017196556,0.0012152116,0.00032932637,0.0022004824,0.0018246571,0.00038404303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047948565,0.00007266025,0.000007895212,0.000287756,0.0008107708,0.000022151822,0.0023963538,3.814635e-7,0.000062891115,0.9932882,0.002391666,0.00065444445],"study_design_scores_gemma":[0.00040792843,0.00011192613,0.000033800676,0.00022036418,0.00007783864,0.000008181669,0.0005355517,0.00012238922,0.00015841023,0.98017454,0.017412908,0.00073614594],"about_ca_topic_score_codex":0.000002696672,"about_ca_topic_score_gemma":0.000017296992,"teacher_disagreement_score":0.31572014,"about_ca_system_score_codex":0.00016727079,"about_ca_system_score_gemma":0.00009856498,"threshold_uncertainty_score":0.9995507},"labels":[],"label_agreement":null},{"id":"W166823269","doi":"","title":"On Irregularity In Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011329640090500047,"score_gpt":0.2636239412768887,"score_spread":0.2522943011863887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166823269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.983575,0.000097979966,0.002403478,0.00045492404,0.000840276,0.00020241718,9.501828e-7,0.00017665888,0.012248307],"genre_scores_gemma":[0.9982354,0.00000272269,0.0014251596,0.000086371256,0.0000024796623,0.00001891149,0.0000016080933,0.000009069122,0.00021827311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985652,0.00013316053,0.00017288704,0.00037867774,0.00036401048,0.0003860678],"domain_scores_gemma":[0.99894863,0.00020356667,0.000037986636,0.0006994922,0.00004863058,0.00006170961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043680708,0.00012089227,0.00013932327,0.0002765937,0.0000826242,0.000067154324,0.00090506003,0.00006140333,0.00000908652],"category_scores_gemma":[0.000054615553,0.00012114456,0.00005407642,0.0010475924,0.00007804991,0.00031076052,0.00018927448,0.0002628896,0.00008676395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008570953,0.00017340576,0.0042442447,0.0000029243356,0.0000018351134,0.00004069338,0.000023966042,0.000063149615,0.00019061114,0.99339414,0.00063445995,0.0012219963],"study_design_scores_gemma":[0.0005993289,0.00007763888,0.028882973,0.000010873385,4.2982452e-7,0.000002673064,0.0000022687202,0.00091598945,0.0015310176,0.96754164,0.00030578327,0.00012939658],"about_ca_topic_score_codex":0.00006904747,"about_ca_topic_score_gemma":0.000023773282,"teacher_disagreement_score":0.025852514,"about_ca_system_score_codex":0.00006634696,"about_ca_system_score_gemma":0.00003122392,"threshold_uncertainty_score":0.4940132},"labels":[],"label_agreement":null},{"id":"W1668554195","doi":"10.2298/aadm151109021k","title":"Protecting a graph with mobile guards","year":2015,"lang":"en","type":"preprint","venue":"Applicable Analysis and Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Combinatorics; Vertex (graph theory); Computer security; Theoretical computer science; Mathematics","score_opus":0.022173567486252925,"score_gpt":0.3022670874989861,"score_spread":0.2800935200127332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1668554195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029885355,0.00045664486,0.96533597,0.00006331569,0.000010953405,0.0011151269,0.000017851522,0.00018234231,0.0029324642],"genre_scores_gemma":[0.4266306,0.00011475751,0.5707608,0.00003681976,0.00004919139,0.0018242581,0.000031058502,0.0000512206,0.0005013052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997128,0.00011420123,0.0004861713,0.0009934393,0.00078371057,0.0004944915],"domain_scores_gemma":[0.9967672,0.00019650094,0.00042790401,0.0020340164,0.00029811857,0.00027624553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016115041,0.00042149742,0.0009663034,0.0005729773,0.00025085255,0.0006281194,0.0012741152,0.00018409331,0.000013447493],"category_scores_gemma":[0.00005665444,0.00030115983,0.00027234122,0.0022033292,0.00018283163,0.0001952529,0.0022143319,0.00073491415,0.000010641702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015960545,0.0014721999,0.004266792,0.0066413167,0.020187594,0.00023383842,0.023848815,0.23510262,0.0011231569,0.6453992,0.00073390297,0.060830954],"study_design_scores_gemma":[0.00029429368,0.00015738595,0.000023944809,0.0001242853,0.0009144063,0.000016185555,0.00093636574,0.34596866,0.0005829088,0.649957,0.00033263874,0.0006919518],"about_ca_topic_score_codex":0.00008594998,"about_ca_topic_score_gemma":0.000041472635,"teacher_disagreement_score":0.39674523,"about_ca_system_score_codex":0.00004631617,"about_ca_system_score_gemma":0.00011858682,"threshold_uncertainty_score":0.99994403},"labels":[],"label_agreement":null},{"id":"W167532964","doi":"","title":"The Resolution Width Problem is EXPTIME-Complete.","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Resolution (logic); Conjecture; Mathematical proof; Mathematics; Set (abstract data type); Integer (computer science); Proof complexity; Reduction (mathematics); Discrete mathematics; Integer programming; Combinatorics; Algorithm; Computer science","score_opus":0.02134139489818287,"score_gpt":0.26929238239771053,"score_spread":0.24795098749952765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167532964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004301205,0.0002609292,0.9179383,0.00504971,0.00007085638,0.000236282,0.0000012034409,0.00023301577,0.075779594],"genre_scores_gemma":[0.30099082,0.00006006128,0.63762814,0.0009550641,0.00022033151,0.00012959274,0.00000415161,0.000030771516,0.059981104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986491,0.0000947539,0.0001679072,0.00030090014,0.0003689141,0.0004183996],"domain_scores_gemma":[0.9988997,0.00019565779,0.00004195652,0.0007247505,0.00009016031,0.0000477638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005058535,0.0000909539,0.00006924822,0.00005877051,0.00046815,0.00020094517,0.0010972965,0.00002853597,0.00003761521],"category_scores_gemma":[0.000015178716,0.000057404417,0.000050617175,0.00048399452,0.00013190153,0.00037478775,0.00029654606,0.00012305702,0.00030193545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005902583,0.000018682354,0.000090174726,0.0000018046595,0.0000031826166,0.0000020682155,0.000046547524,0.00010783237,0.0013443405,0.96568966,0.017563362,0.015126435],"study_design_scores_gemma":[0.0001622783,0.00005101089,0.0007247195,0.000004366691,7.338801e-7,0.000008697818,0.000011593951,0.036888737,0.0025424424,0.8164026,0.14308427,0.00011851302],"about_ca_topic_score_codex":0.000070751325,"about_ca_topic_score_gemma":0.000036507972,"teacher_disagreement_score":0.30056068,"about_ca_system_score_codex":0.000037004826,"about_ca_system_score_gemma":0.000031254764,"threshold_uncertainty_score":0.388087},"labels":[],"label_agreement":null},{"id":"W167733642","doi":"","title":"Total domination in Kr-covered graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010918119384244298,"score_gpt":0.2668438112478923,"score_spread":0.255925691863648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167733642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883654,0.00009490946,0.0074189655,0.0005113958,0.0009830402,0.00025295885,0.00000110655,0.00012870197,0.0022435074],"genre_scores_gemma":[0.99640757,0.000010979417,0.0034005377,0.000058117137,0.0000028367037,0.000028814527,0.0000021719684,0.000010601346,0.00007837772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985729,0.00008564686,0.00020483571,0.00037435855,0.00038416078,0.00037812474],"domain_scores_gemma":[0.9991291,0.000101635495,0.000054755237,0.0005417336,0.000080810525,0.00009195475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042735497,0.00012683334,0.00014936933,0.0003157502,0.000085639585,0.000082908184,0.00073756557,0.0000682689,0.0000072566168],"category_scores_gemma":[0.00011671762,0.00013329998,0.00005966377,0.0012324174,0.00007051904,0.00082272326,0.00023549401,0.00022790761,0.00008596711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012739699,0.00012183004,0.0007991751,0.0000045242955,0.0000044399,0.000036632293,0.00031859352,0.00026686987,0.0012028988,0.9943444,0.0000268082,0.0028610765],"study_design_scores_gemma":[0.001854557,0.000101799174,0.010977593,0.0000188144,8.3480086e-7,0.000011979777,0.000019801644,0.00044748827,0.0059124622,0.98045236,0.000050382056,0.00015194327],"about_ca_topic_score_codex":0.00003895537,"about_ca_topic_score_gemma":0.000010568489,"teacher_disagreement_score":0.013892068,"about_ca_system_score_codex":0.00016814918,"about_ca_system_score_gemma":0.00008316963,"threshold_uncertainty_score":0.54358155},"labels":[],"label_agreement":null},{"id":"W1678874697","doi":"10.1007/s12532-018-0145-6","title":"Enumeration of 2-level polytopes","year":2018,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Enumeration; Facet (psychology); Combinatorics; Hyperplane; Mathematics; Dimension (graph theory); Polytope model; Regular polygon; Convex polytope; Polyhedral combinatorics; Birkhoff polytope; Discrete mathematics; Convex set; Convex optimization; Geometry","score_opus":0.056748973027078806,"score_gpt":0.34766620676157195,"score_spread":0.29091723373449313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678874697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015746774,0.000015273768,0.98249483,0.00021347536,0.00006774025,0.0002566386,5.7607383e-7,0.00015011986,0.0010545595],"genre_scores_gemma":[0.5573875,2.320967e-7,0.4425058,0.000016341164,0.000031140447,0.000010268744,0.0000016685425,0.000005378676,0.00004169272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877024,0.00008672828,0.00030743817,0.0002323673,0.00037661428,0.00022661916],"domain_scores_gemma":[0.9990407,0.00024042084,0.00011228588,0.00026199766,0.0002783695,0.00006621446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327046,0.00009549752,0.00015234997,0.00013525915,0.00011290022,0.00009680404,0.0003770568,0.000042238415,0.000015217886],"category_scores_gemma":[0.00023003833,0.00008484123,0.00004904884,0.0005233992,0.00019914632,0.0003593815,0.00014026229,0.000079064106,0.000110953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070797273,0.0001163112,0.000035850346,0.000056634188,0.000010700361,0.0000012267453,0.0009210332,0.00005178278,0.0013385148,0.5302108,0.000029718687,0.46722037],"study_design_scores_gemma":[0.00023511446,0.00033028983,0.0002793052,0.000052180192,0.0000047556664,0.000012938883,0.000042470783,0.28894088,0.013684813,0.6960236,0.00025841416,0.00013524074],"about_ca_topic_score_codex":0.0000021101196,"about_ca_topic_score_gemma":9.2089755e-7,"teacher_disagreement_score":0.5416407,"about_ca_system_score_codex":0.000020761232,"about_ca_system_score_gemma":0.000029689223,"threshold_uncertainty_score":0.34597248},"labels":[],"label_agreement":null},{"id":"W1681620790","doi":"10.1007/978-3-642-17517-6_20","title":"Simultaneous Interval Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interval graph; Combinatorics; Chordal graph; Indifference graph; Pathwidth; Split graph; Cograph; Mathematics; Bipartite graph; Discrete mathematics; Maximal independent set; Interval (graph theory); Vertex (graph theory); 1-planar graph; Graph; Line graph","score_opus":0.015983635976769894,"score_gpt":0.279561506986288,"score_spread":0.2635778710095181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1681620790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015172131,0.0002931196,0.9913975,0.00051314675,0.00244973,0.00045171077,0.0000063638695,0.00030878015,0.0044279187],"genre_scores_gemma":[0.2405471,0.00006250408,0.75604707,0.0014566336,0.0004661457,0.00001594777,0.000005102372,0.00008746909,0.001312025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944595,0.0000567996,0.00057741976,0.0021823577,0.0015690752,0.0011548313],"domain_scores_gemma":[0.99459815,0.0016514835,0.00026178468,0.0026857413,0.00044001854,0.00036283914],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012644023,0.0006910628,0.00064271054,0.0016376599,0.0003880867,0.0006788118,0.007988295,0.00054240477,0.00006575079],"category_scores_gemma":[0.00042279213,0.0006286118,0.00024397645,0.001074205,0.0021898553,0.0007680095,0.0031424542,0.0027902722,0.0001697668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013449816,0.00003412575,0.000018440991,0.00002840413,0.000012722973,0.00052459,0.0004762476,0.010723404,0.0013402929,0.15293875,0.0000047210933,0.83388484],"study_design_scores_gemma":[0.00020160154,0.00021174681,0.0000089836585,0.00016631716,0.0000035344012,0.00016970489,7.407571e-8,0.20014001,0.0036318426,0.7918021,0.0029816977,0.0006823682],"about_ca_topic_score_codex":0.000010296316,"about_ca_topic_score_gemma":0.0001203324,"teacher_disagreement_score":0.8332025,"about_ca_system_score_codex":0.00021057356,"about_ca_system_score_gemma":0.00052590464,"threshold_uncertainty_score":0.9996165},"labels":[],"label_agreement":null},{"id":"W1683401792","doi":"10.1016/j.jctb.2015.11.005","title":"Certifying non-representability of matroids over prime fields","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Prime (order theory); Mathematics; Computer science; Combinatorics","score_opus":0.030494904017273235,"score_gpt":0.3143289892299906,"score_spread":0.28383408521271736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683401792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77781,0.0003753461,0.20714734,0.00057221984,0.008683235,0.00027936528,0.000002811337,0.000048858805,0.005080841],"genre_scores_gemma":[0.9947761,0.000013100626,0.0046971184,0.000026459142,0.0003150915,0.0000022303427,2.2568581e-7,0.00001244168,0.00015722068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737865,0.0005566372,0.00069371174,0.00019796794,0.0008671098,0.00030590393],"domain_scores_gemma":[0.9971364,0.0005291557,0.00053540285,0.00073156535,0.00080192904,0.00026554754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037391544,0.00016086015,0.00045500323,0.00019862315,0.00007393638,0.000080384474,0.0015144504,0.00011062005,0.000043803484],"category_scores_gemma":[0.001085131,0.00013317283,0.00021398139,0.0004878332,0.00028009646,0.001659231,0.0005134138,0.00043625198,0.0000045631728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020583002,0.00026377226,0.0021255212,0.000035030822,0.00009465437,0.00004652507,0.0019119438,0.0001331526,0.0053767897,0.9838532,0.0005382514,0.0035628257],"study_design_scores_gemma":[0.0014518556,0.000978715,0.00065213215,0.000035657522,0.000010570945,0.00006896503,0.00026669315,0.00011259174,0.061342828,0.9335403,0.0014058657,0.00013386682],"about_ca_topic_score_codex":0.000006669959,"about_ca_topic_score_gemma":5.352037e-7,"teacher_disagreement_score":0.21696614,"about_ca_system_score_codex":0.00010515869,"about_ca_system_score_gemma":0.00035396937,"threshold_uncertainty_score":0.54306304},"labels":[],"label_agreement":null},{"id":"W1683881076","doi":"10.1287/moor.2016.0815","title":"Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Finite set; Monotone polygon; Discrete mathematics; Regular polygon; Mathematical analysis","score_opus":0.11030769931766725,"score_gpt":0.4258984505532524,"score_spread":0.3155907512355851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683881076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137928,0.02516064,0.42573568,0.005619255,0.0002575233,0.00626826,0.000075087315,0.00020069565,0.02289003],"genre_scores_gemma":[0.80503654,0.004811119,0.18610634,0.0000067970345,0.000018955257,0.00020989229,0.0000029349742,0.000029224168,0.0037782127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986306,0.00012661112,0.00027408343,0.000282801,0.00037712354,0.00030877462],"domain_scores_gemma":[0.99743664,0.0009833948,0.000049495564,0.00094304176,0.00047857303,0.00010884432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022376152,0.00010001282,0.0002419787,0.00023569973,0.0012572627,0.0006658559,0.0008695919,0.000066234614,0.000008340167],"category_scores_gemma":[0.0013440859,0.0000876229,0.00003627708,0.00015715718,0.0007909622,0.0007535978,0.000626504,0.00020671843,0.0000074345025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054570037,0.00005162657,0.000035406032,0.00033253565,0.000026992053,0.0000029469472,0.002914398,0.000017537659,0.0008425632,0.99028784,0.000033752352,0.0054489183],"study_design_scores_gemma":[0.0015769389,0.00051218976,0.00028007283,0.0003947333,0.000023059356,0.00012318524,0.002753437,0.3704972,0.0071393806,0.61477613,0.0015178147,0.00040584648],"about_ca_topic_score_codex":0.000040848947,"about_ca_topic_score_gemma":0.00003434597,"teacher_disagreement_score":0.37551174,"about_ca_system_score_codex":0.000019769053,"about_ca_system_score_gemma":0.00010472199,"threshold_uncertainty_score":0.9669975},"labels":[],"label_agreement":null},{"id":"W168997024","doi":"","title":"The Greedy Algorithm for Domination in Cubic Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Greedy algorithm; Mathematics; Cubic graph; Combinatorics; Algorithm; Graph; Line graph","score_opus":0.013345152088701713,"score_gpt":0.2831954101280781,"score_spread":0.26985025803937635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168997024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25853765,0.0011096818,0.7260989,0.004903539,0.0052254163,0.0023903162,0.000006845534,0.0003505091,0.0013771367],"genre_scores_gemma":[0.96975386,0.000059514103,0.029713124,0.00007074393,0.0000072440594,0.00023897507,0.0000026677762,0.000016937198,0.00013696063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986604,0.000080277954,0.00020623235,0.00031784148,0.0003093471,0.0004259373],"domain_scores_gemma":[0.9987473,0.00042749988,0.00006363812,0.0005501316,0.00014206194,0.000069403475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009517725,0.00011648089,0.00012021793,0.00017195693,0.0003034766,0.00012620063,0.0011376211,0.000054626144,7.8240777e-7],"category_scores_gemma":[0.00013452512,0.000092914415,0.00007234984,0.00091471337,0.00011835566,0.00046773697,0.00017453486,0.00017878058,0.000018415758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006484753,0.000054411346,0.00006498893,0.0000025642535,0.000005192186,0.000004999038,0.00015901864,0.00003386611,0.00012644708,0.90150136,0.000040779327,0.097999886],"study_design_scores_gemma":[0.0017092945,0.00012971088,0.00087572885,0.000011877109,0.0000012811596,0.0000043918767,0.000031338168,0.0061681606,0.0028334705,0.98731226,0.0008060664,0.000116420815],"about_ca_topic_score_codex":0.000020420866,"about_ca_topic_score_gemma":0.000023928491,"teacher_disagreement_score":0.71121615,"about_ca_system_score_codex":0.00012586969,"about_ca_system_score_gemma":0.00007868946,"threshold_uncertainty_score":0.378894},"labels":[],"label_agreement":null},{"id":"W1695953772","doi":"10.1016/j.ejc.2015.06.005","title":"Improved complexity results on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-coloring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs","year":2015,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Vertex (graph theory); Complete coloring; Graph; Induced subgraph; Discrete mathematics; Line graph","score_opus":0.03197586937708036,"score_gpt":0.2621459650223334,"score_spread":0.23017009564525304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1695953772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8107993,0.0021431886,0.0034344946,0.0012564226,0.008551617,0.00013408168,0.0005837213,0.00048217466,0.172615],"genre_scores_gemma":[0.98277026,0.002357879,0.006290856,0.0019265189,0.003345054,0.0004886514,0.0007525557,0.0016092563,0.00045898164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97768176,0.002065478,0.0049192375,0.0035211267,0.006808025,0.0050043757],"domain_scores_gemma":[0.9794554,0.0037320685,0.006353144,0.0061103455,0.00096600514,0.0033830146],"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.009453803,0.002117013,0.0010344215,0.0015312243,0.0034807916,0.0037110632,0.008535828,0.002506399,0.016215626],"category_scores_gemma":[0.006802146,0.0035236622,0.0037720113,0.0034968122,0.0035188587,0.0042964644,0.007081145,0.00585061,0.0032719374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062297974,0.0012708709,0.000029740255,0.001315384,0.0022345618,0.007236511,0.0033608177,0.0042440523,0.002404765,0.88027424,0.08895098,0.002448311],"study_design_scores_gemma":[0.010740627,0.010396455,0.00036367856,0.0037483105,0.0020973028,0.0051479004,0.0026095822,0.4596281,0.4876924,0.0035833549,0.009919058,0.0040732524],"about_ca_topic_score_codex":0.0007827634,"about_ca_topic_score_gemma":0.00058830454,"teacher_disagreement_score":0.87669086,"about_ca_system_score_codex":0.000098803706,"about_ca_system_score_gemma":0.0036594728,"threshold_uncertainty_score":0.999193},"labels":[],"label_agreement":null},{"id":"W1696541610","doi":"10.1002/jgt.22018","title":"Strongly Even‐Cycle Decomposable Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Mathematics; Combinatorics; Subdivision; Eulerian path; Characterization (materials science); Chordal graph; Property (philosophy); Graph; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Pure mathematics; Computer science; Lagrangian","score_opus":0.012991495177843027,"score_gpt":0.27929766973279474,"score_spread":0.2663061745549517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696541610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19341944,0.0011014865,0.8010618,0.0010617662,0.00072578044,0.00012225313,0.000004468786,0.00007217791,0.0024308078],"genre_scores_gemma":[0.97706515,0.00022260437,0.021947462,0.000112394126,0.00009601172,0.000003595798,1.1332835e-7,0.000022832504,0.00052986277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973625,0.000569971,0.0005642758,0.00027244375,0.0006851588,0.0005456293],"domain_scores_gemma":[0.9971692,0.0009739379,0.00044262945,0.000717435,0.00038576475,0.0003110143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003023405,0.00019565714,0.00033424757,0.00076964434,0.0001705252,0.00008492714,0.0021669918,0.00007426588,0.00011960058],"category_scores_gemma":[0.00027574136,0.00011946456,0.0003878001,0.0007990827,0.00030634552,0.0015557983,0.00024903353,0.00031570272,0.0000601309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018544651,0.00010853185,0.001189497,0.000006607576,0.00009501195,0.00008465947,0.00013395444,0.000055535813,0.011746739,0.9281763,0.00061070244,0.057607017],"study_design_scores_gemma":[0.0010005733,0.00039283204,0.0015255742,0.000090869966,0.000010466897,0.00024543327,0.000052442123,0.00004028283,0.006340865,0.98811847,0.0020018485,0.00018034305],"about_ca_topic_score_codex":7.1367504e-7,"about_ca_topic_score_gemma":0.0000012887695,"teacher_disagreement_score":0.7836457,"about_ca_system_score_codex":0.000057709673,"about_ca_system_score_gemma":0.0001278054,"threshold_uncertainty_score":0.48716232},"labels":[],"label_agreement":null},{"id":"W16985043","doi":"10.1158/1055-9965.epi-06-0479","title":"Realizability of p-Point, q-Line Graphs with Prescribed Maximum Degree, and Point Connectivity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realizability; Mathematics; Degree (music); Point (geometry); Line (geometry); Combinatorics; Discrete mathematics; Algorithm; Geometry; Physics","score_opus":0.02517202750151202,"score_gpt":0.2729990411080596,"score_spread":0.2478270136065476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16985043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9714718,0.0002625118,0.023999719,0.00046082833,0.00024098787,0.000491218,0.0000056637573,0.00015782312,0.00290946],"genre_scores_gemma":[0.9941202,0.00006656126,0.0056474064,0.000047419184,0.0000027338615,0.000028301745,0.000002284337,0.00001842137,0.00006666446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788743,0.0002856936,0.0003040681,0.00062732043,0.00044514704,0.000450363],"domain_scores_gemma":[0.9976866,0.00045659038,0.00014772886,0.0011740924,0.0003344793,0.00020047861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000953131,0.00021929793,0.0003616967,0.00019468437,0.00012913843,0.000057370136,0.00073249126,0.00007730118,0.0000149287625],"category_scores_gemma":[0.00024187607,0.00018589442,0.000063787484,0.0010502018,0.00043853183,0.0006718302,0.00043573516,0.00025000126,0.0000046851314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021725983,0.00028632366,0.036573023,0.00004129671,0.000038630533,0.00004904265,0.00040297167,0.000013353287,0.00075844827,0.9548511,0.000092453076,0.0066761132],"study_design_scores_gemma":[0.0015150541,0.0008225023,0.019316213,0.000038874114,0.000008302807,0.00006412913,0.000038730836,0.001299548,0.0045838207,0.9719048,0.00018719453,0.00022083623],"about_ca_topic_score_codex":0.00014939575,"about_ca_topic_score_gemma":0.000055782544,"teacher_disagreement_score":0.02264842,"about_ca_system_score_codex":0.000042494543,"about_ca_system_score_gemma":0.00007129988,"threshold_uncertainty_score":0.7580554},"labels":[],"label_agreement":null},{"id":"W170988298","doi":"","title":"Twin Domination in Digraphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Physics","score_opus":0.013472682030766093,"score_gpt":0.27525342787879337,"score_spread":0.2617807458480273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170988298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9519205,0.00034720515,0.017474638,0.00037730692,0.0016635323,0.0004132807,6.29919e-7,0.00019594564,0.027606959],"genre_scores_gemma":[0.99590003,0.000014390283,0.0037888167,0.00006174918,0.0000011928236,0.000028897815,6.3771336e-7,0.000008508948,0.0001957855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986281,0.00023662702,0.00017622634,0.00032251608,0.00029588933,0.00034068248],"domain_scores_gemma":[0.99908817,0.00018866415,0.0000426913,0.0005312376,0.00006860223,0.00008063105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075271394,0.00010482323,0.00012557306,0.00029746973,0.000070365735,0.00006706825,0.0006377933,0.00005328722,0.000015130176],"category_scores_gemma":[0.00025208018,0.0001078331,0.000043426804,0.0012989349,0.000055357934,0.0005626163,0.00009288691,0.000192401,0.00006792683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033160445,0.0000779618,0.00470953,0.0000032117055,0.0000027019798,0.000017525408,0.00019938253,0.000013217273,0.00038995687,0.9916058,0.0001108939,0.0028664963],"study_design_scores_gemma":[0.00076145306,0.00004885765,0.004995,0.000009012735,5.8437877e-7,0.000005105434,0.00002193524,0.0005362632,0.005231512,0.98648864,0.0017741935,0.00012743771],"about_ca_topic_score_codex":0.0000070292263,"about_ca_topic_score_gemma":0.000005841832,"teacher_disagreement_score":0.043979518,"about_ca_system_score_codex":0.00006628649,"about_ca_system_score_gemma":0.000048708316,"threshold_uncertainty_score":0.4397306},"labels":[],"label_agreement":null},{"id":"W171110949","doi":"","title":"The total number of generalized stable sets and kernels of graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012070815635474404,"score_gpt":0.2810397959182403,"score_spread":0.2689689802827659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171110949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99616134,0.00035706267,0.00013329445,0.00010066829,0.00020586727,0.00013556995,0.0000036595873,0.000026475267,0.002876043],"genre_scores_gemma":[0.9971132,0.00019516409,0.0017938067,0.000012219693,0.0000012226618,0.000009366516,6.072916e-7,0.000008059277,0.0008663292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988248,0.00014541707,0.00022542395,0.00021691136,0.0003218127,0.00026568817],"domain_scores_gemma":[0.99890393,0.0002544895,0.00007562646,0.0005849067,0.0001076939,0.00007333291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046597645,0.00009620301,0.000178587,0.000037712824,0.00012423482,0.000039584444,0.00065108686,0.000038990365,0.00006259545],"category_scores_gemma":[0.00003430226,0.000072495284,0.000054592812,0.0004589454,0.00025337853,0.0002643867,0.00019966412,0.000104581624,0.000011101587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029779023,0.000046749014,0.0021529286,0.000009192461,0.000022603826,0.0000024166523,0.00020746914,0.00002368946,0.0010086934,0.9863493,0.00019898954,0.009948214],"study_design_scores_gemma":[0.00067921967,0.00006059388,0.004344419,0.000010510341,0.00000296517,0.000012636309,0.00001354961,0.00121642,0.0081680305,0.984998,0.00040865058,0.00008499956],"about_ca_topic_score_codex":0.000041086114,"about_ca_topic_score_gemma":0.0000011102312,"teacher_disagreement_score":0.009863215,"about_ca_system_score_codex":0.000009870761,"about_ca_system_score_gemma":0.00003689944,"threshold_uncertainty_score":0.29562718},"labels":[],"label_agreement":null},{"id":"W1712011956","doi":"","title":"Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Cograph; Chordal graph; 1-planar graph; Graph","score_opus":0.02047042098494921,"score_gpt":0.2928000782790482,"score_spread":0.27232965729409897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1712011956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99175704,0.00084689545,0.005440585,0.00038249118,0.00073854317,0.0005096205,0.000011457778,0.00014780943,0.00016556642],"genre_scores_gemma":[0.9919462,0.00007702996,0.007638946,0.0001222348,0.000010369975,0.00014895013,0.0000034908012,0.000015919588,0.000036835732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982491,0.000190761,0.00020466247,0.00048264573,0.00025013438,0.00062269415],"domain_scores_gemma":[0.9983831,0.00058338774,0.00007192535,0.00052786287,0.00012426013,0.000309467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908252,0.00019484156,0.00024696864,0.00016535542,0.00035272716,0.00011879104,0.0003559575,0.00008725349,0.000002816698],"category_scores_gemma":[0.00015767872,0.00018932026,0.000077994795,0.000460311,0.0002602978,0.0011450845,0.00046480048,0.00016744908,0.000003301186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017042044,0.00013180508,0.12712334,0.000029021341,0.000020716703,7.316411e-7,0.00023614049,6.0257685e-7,0.0013212535,0.8665782,0.000098546094,0.00444256],"study_design_scores_gemma":[0.00066617987,0.00013957846,0.13286996,0.0000079700385,0.000007969553,0.000014882622,0.000010478771,0.0006415327,0.0023427876,0.8627408,0.00035476446,0.00020308497],"about_ca_topic_score_codex":0.000020615978,"about_ca_topic_score_gemma":0.0000069854723,"teacher_disagreement_score":0.005746616,"about_ca_system_score_codex":0.000030804345,"about_ca_system_score_gemma":0.000022469196,"threshold_uncertainty_score":0.7720256},"labels":[],"label_agreement":null},{"id":"W171736474","doi":"","title":"Partioning A Bipartite Graph into Vertex-Disjoint Paths.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.011712075852797465,"score_gpt":0.2598653087767702,"score_spread":0.24815323292397276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171736474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9134078,0.00080575404,0.076393105,0.0009481167,0.002654936,0.00041858456,0.0000020669765,0.0008011508,0.0045684855],"genre_scores_gemma":[0.9919075,0.000013097443,0.0076266075,0.00009857928,0.000010768473,0.0000641788,0.0000048831475,0.000020435793,0.00025396806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997879,0.00016562849,0.0003207622,0.00053863775,0.0005067254,0.00058923394],"domain_scores_gemma":[0.99852663,0.0001683825,0.00009560435,0.00090048433,0.00015298402,0.00015591462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005581128,0.00019618763,0.00021018424,0.00023788397,0.00035560658,0.0002097644,0.0009691837,0.000073641364,0.00001959535],"category_scores_gemma":[0.00009066078,0.0001957646,0.00011873662,0.0012078322,0.00014738708,0.00075671024,0.0004025637,0.00025760155,0.00023904677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007837236,0.00011312541,0.0036105472,0.000008894553,0.000010195617,0.00003403456,0.00017891935,0.00011778631,0.0021692629,0.9882172,0.0012951082,0.0042370884],"study_design_scores_gemma":[0.00054861757,0.000101244026,0.0040401244,0.00002423598,0.0000034386958,0.000008151453,0.000015608568,0.004704241,0.0056803133,0.98238957,0.0022448623,0.00023960015],"about_ca_topic_score_codex":0.00011042067,"about_ca_topic_score_gemma":0.000022931838,"teacher_disagreement_score":0.07849968,"about_ca_system_score_codex":0.00008271494,"about_ca_system_score_gemma":0.0000642047,"threshold_uncertainty_score":0.79830486},"labels":[],"label_agreement":null},{"id":"W172066816","doi":"","title":"New Conditions for k-ordered Hamiltonian Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Hamiltonian path; Hamiltonian (control theory); Path graph; Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.017926935948161738,"score_gpt":0.2960958785239048,"score_spread":0.27816894257574304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172066816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1796708,0.00044944446,0.79982764,0.007163769,0.004764917,0.0018620476,0.00003581649,0.0010974503,0.0051281275],"genre_scores_gemma":[0.9407064,0.000012518364,0.058352824,0.0002556538,0.000008958162,0.000091939415,0.000011532072,0.000023090475,0.0005371038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985937,0.00003799379,0.00019213292,0.0004181282,0.00027654343,0.00048149488],"domain_scores_gemma":[0.998619,0.0001693564,0.000060497194,0.0007492852,0.00014869557,0.00025312984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021552749,0.0001541361,0.00016974975,0.00019787028,0.00031375588,0.00012139763,0.0011000012,0.00007048825,0.000016530625],"category_scores_gemma":[0.00010610613,0.00016163777,0.00012318857,0.0007867687,0.000086195134,0.00054067327,0.00017109951,0.00016057554,0.000086530534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007866518,0.00006179598,0.00008928404,0.0000058966375,0.000018572839,0.0000069420894,0.00017232673,0.000076272896,0.00093063933,0.9950284,0.0016919088,0.0019101237],"study_design_scores_gemma":[0.0020970223,0.00018950796,0.00095235487,0.0000150655615,0.000004072067,0.000009089255,0.000015197659,0.00015601865,0.0036337236,0.98935694,0.0033791205,0.00019186712],"about_ca_topic_score_codex":0.000033259876,"about_ca_topic_score_gemma":0.000015212499,"teacher_disagreement_score":0.76103556,"about_ca_system_score_codex":0.00007637181,"about_ca_system_score_gemma":0.0002556504,"threshold_uncertainty_score":0.6591397},"labels":[],"label_agreement":null},{"id":"W172707356","doi":"","title":"Realization of Degree 10 Minimum Spanning Trees in 3-Space.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Realization (probability); Spanning tree; Minimum spanning tree; Degree (music); Minimum degree spanning tree; Computer science; Space (punctuation); Mathematics; Combinatorics; Physics; Statistics","score_opus":0.046233520706352484,"score_gpt":0.28765465180558203,"score_spread":0.24142113109922955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172707356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09451278,0.00011069321,0.85992455,0.0014784829,0.00016284351,0.00029050634,0.000052375515,0.000064040934,0.043403737],"genre_scores_gemma":[0.9880242,0.0000024927074,0.011110923,0.000096319185,0.000030437519,0.000009858972,0.00006266586,0.000010255971,0.0006528655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835664,0.00012178222,0.0003084999,0.00038210797,0.00042897885,0.00040199736],"domain_scores_gemma":[0.998736,0.00030808873,0.000110111905,0.0002976575,0.0003512513,0.00019686142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000369627,0.00014511142,0.00019302986,0.0016723608,0.00009041292,0.000082959334,0.0006283089,0.000079594975,0.0001391245],"category_scores_gemma":[0.0001339671,0.00016365378,0.00004321318,0.0018565005,0.00011752132,0.00028176102,0.000054833454,0.0001549426,0.000047848276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075999183,0.000029688024,0.0042516766,0.000007922528,0.0000047848257,0.000027390666,0.00006642284,0.09370883,0.00010726404,0.89029807,0.0005916489,0.010898713],"study_design_scores_gemma":[0.0006129004,0.0001456153,0.18710734,0.00010965091,0.0000020775285,0.000009026031,0.000071577306,0.34493607,0.0003033306,0.4655436,0.00083969434,0.00031912499],"about_ca_topic_score_codex":0.0094253635,"about_ca_topic_score_gemma":0.035554405,"teacher_disagreement_score":0.8935114,"about_ca_system_score_codex":0.00020238615,"about_ca_system_score_gemma":0.0009385856,"threshold_uncertainty_score":0.997171},"labels":[],"label_agreement":null},{"id":"W1732011848","doi":"10.46298/dmtcs.3411","title":"Finding a Strong Stable Set or a Meyniel Obstruction in any Graph","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rogers Communications (Canada); Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Chord (peer-to-peer); Clique; Independent set; Discrete mathematics; Computer science","score_opus":0.03194635860705702,"score_gpt":0.31990689398220307,"score_spread":0.28796053537514604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1732011848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05756335,0.000029554663,0.9386707,0.0005835061,0.00020445648,0.00041157685,0.0000054304883,0.00019797498,0.0023334546],"genre_scores_gemma":[0.57549053,0.0000058157616,0.4243001,0.00007988199,0.000054171764,0.000021924268,9.298382e-7,0.000014263305,0.0000323761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548006,0.00017194435,0.00064591237,0.0010376965,0.0013499542,0.0013144363],"domain_scores_gemma":[0.99726146,0.0006643186,0.0001596554,0.0013441714,0.0001806709,0.00038969872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030148583,0.0003426939,0.00041936646,0.00075020135,0.00049815566,0.00078788114,0.0034130837,0.00008935851,0.00010845165],"category_scores_gemma":[0.00032736815,0.00026100827,0.00011326408,0.0033932454,0.002160603,0.0020783255,0.0015766048,0.0004921279,0.00006913336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017156204,0.0000840511,0.00006300721,0.0000345674,0.000006085666,0.000021153883,0.0022995644,0.0013396196,0.00058063667,0.98731613,0.000015296102,0.008222724],"study_design_scores_gemma":[0.00029234332,0.00011036588,0.00009950155,0.000090598565,0.0000032860733,0.000060298782,0.00014517644,0.58640605,0.0016795363,0.41081434,0.000039173236,0.00025932404],"about_ca_topic_score_codex":0.0000030249562,"about_ca_topic_score_gemma":0.000009671202,"teacher_disagreement_score":0.58506644,"about_ca_system_score_codex":0.00018140262,"about_ca_system_score_gemma":0.00019502753,"threshold_uncertainty_score":0.9999842},"labels":[],"label_agreement":null},{"id":"W1732508261","doi":"10.1002/jgt.20596","title":"Overlap number of graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Bound graph; Matching (statistics); Discrete mathematics; Graph power; Line graph","score_opus":0.029826219507205095,"score_gpt":0.29551436913689244,"score_spread":0.26568814962968734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1732508261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5094623,0.0009414358,0.4540629,0.0000712199,0.0009027264,0.0001439392,0.0000036303852,0.00004910518,0.03436273],"genre_scores_gemma":[0.9586665,0.00013059791,0.040931217,0.00008137816,0.000031031046,0.0000013775789,8.162931e-8,0.000013973922,0.0001438179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979786,0.00040449353,0.0005731735,0.00016717082,0.0005724314,0.00030410322],"domain_scores_gemma":[0.997877,0.00033798904,0.000582992,0.0005807041,0.00044499277,0.00017632236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024786512,0.00014242853,0.00032891834,0.0005323297,0.000066961635,0.000020670255,0.0017068969,0.00006742629,0.00019498415],"category_scores_gemma":[0.00016786825,0.0001105643,0.00039546285,0.00092806655,0.0003517507,0.0008350183,0.00018692977,0.00037149127,0.000021396854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020543311,0.00015419851,0.008306269,0.000013920903,0.00009755231,0.00006657286,0.0010249539,0.0000028785148,0.0017016747,0.9798745,0.000129394,0.008422641],"study_design_scores_gemma":[0.00042946797,0.00023706477,0.006196962,0.000046192814,0.000013478409,0.0003087259,0.00017785038,0.000011512206,0.010514943,0.98176605,0.00018252902,0.00011523342],"about_ca_topic_score_codex":0.0000024973217,"about_ca_topic_score_gemma":4.6223747e-7,"teacher_disagreement_score":0.4492042,"about_ca_system_score_codex":0.000015230716,"about_ca_system_score_gemma":0.00008024553,"threshold_uncertainty_score":0.45086813},"labels":[],"label_agreement":null},{"id":"W1738403920","doi":"10.1007/978-3-540-70918-3_30","title":"An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Combinatorics; Vertex (graph theory); Algorithm; Graph; Computer science; Mathematics; Discrete mathematics","score_opus":0.021008694542040462,"score_gpt":0.3043820339160814,"score_spread":0.2833733393740409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1738403920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036476267,0.0014317326,0.99315363,0.0002168064,0.002554761,0.0011715351,0.00007824075,0.0003619432,0.000994891],"genre_scores_gemma":[0.0064445497,0.000085866326,0.99156857,0.0007127245,0.0005210708,0.000039436905,0.00004402554,0.000103816696,0.00047996416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925973,0.000071089096,0.000790991,0.003027978,0.0017439156,0.001768716],"domain_scores_gemma":[0.99438995,0.001096712,0.00035589276,0.0028992807,0.00071144674,0.0005466905],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023416593,0.00093087304,0.0008233348,0.0019600175,0.0006289239,0.0007121364,0.007898924,0.00054018124,0.000029656792],"category_scores_gemma":[0.00009026869,0.00089388806,0.00033189773,0.0014504743,0.002017526,0.0016976532,0.0012229623,0.0014131592,0.00002577678],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002864813,0.000060042552,0.000006410808,0.00003780876,0.000017957085,0.00020650265,0.00023397453,0.010976342,0.000049227947,0.034081146,0.00002084978,0.9542811],"study_design_scores_gemma":[0.0003894164,0.00066816853,0.000034331257,0.00018276418,0.000007854128,0.0001695755,5.516489e-7,0.6521794,0.00036483686,0.34302393,0.0021030575,0.00087606476],"about_ca_topic_score_codex":0.0000073002298,"about_ca_topic_score_gemma":0.0001304866,"teacher_disagreement_score":0.953405,"about_ca_system_score_codex":0.0005381723,"about_ca_system_score_gemma":0.0010102009,"threshold_uncertainty_score":0.9993512},"labels":[],"label_agreement":null},{"id":"W175918027","doi":"","title":"Embedding graphs without edge accumulation points in tubular surfaces.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Embedding; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Geometry; Computer science; Artificial intelligence","score_opus":0.02975803999944533,"score_gpt":0.3394812905349219,"score_spread":0.30972325053547656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175918027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709731,0.0001411508,0.026231328,0.00011671758,0.0010139978,0.0002900359,5.2887344e-7,0.00017679004,0.0010563671],"genre_scores_gemma":[0.9905214,0.000010702474,0.009284088,0.00006526273,0.0000045659617,0.000007742713,0.0000025724974,0.00002011259,0.0000835857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782765,0.0001488148,0.00034702674,0.0005039876,0.0005242399,0.00064831064],"domain_scores_gemma":[0.99856216,0.00032554928,0.000096364376,0.0007231226,0.00013085114,0.00016195142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216291,0.00018255755,0.00021954041,0.00048326817,0.00013940205,0.00010606079,0.0009865257,0.00010565681,0.000011285841],"category_scores_gemma":[0.00019818167,0.00019321423,0.000063520776,0.0015191442,0.00008302002,0.0009778946,0.00032617906,0.00034806004,0.000069403686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002574506,0.000088246634,0.08287531,0.000008109226,0.0000101694295,0.000054048218,0.0005471128,0.000401401,0.0016781641,0.9115806,0.00004441305,0.0026866512],"study_design_scores_gemma":[0.0010034125,0.000052294774,0.045776147,0.000033868542,0.0000020925095,0.000007286979,0.000040537623,0.022638643,0.0055538956,0.92446405,0.00018721269,0.00024055598],"about_ca_topic_score_codex":0.00002899542,"about_ca_topic_score_gemma":0.000020120864,"teacher_disagreement_score":0.03709916,"about_ca_system_score_codex":0.00013143143,"about_ca_system_score_gemma":0.00005067666,"threshold_uncertainty_score":0.7879048},"labels":[],"label_agreement":null},{"id":"W1759411922","doi":"10.1007/3-540-36136-7_37","title":"Bounded-Degree Independent Sets in Planar Graphs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Independent set; Combinatorics; Bounded function; Planar graph; Degree (music); Maximal independent set; Planar; Discrete mathematics; Mathematics; Graph; Set (abstract data type); Planar straight-line graph; Upper and lower bounds; 1-planar graph; Computer science; Chordal graph; Physics","score_opus":0.038105072769623306,"score_gpt":0.2821378396137072,"score_spread":0.2440327668440839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1759411922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033358493,0.00070410955,0.9855883,0.0006186862,0.0012562395,0.0006585614,0.000009481915,0.0002004635,0.010630554],"genre_scores_gemma":[0.39014578,0.00050439243,0.60374725,0.002882595,0.00041062085,0.000068854046,0.000015370493,0.00018001217,0.0020450985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928979,0.00011138428,0.0007602382,0.0025062677,0.002254675,0.0014695307],"domain_scores_gemma":[0.9959549,0.0007431066,0.0002892326,0.002445895,0.00022263937,0.00034425265],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016831822,0.0007731327,0.0007623401,0.0031229896,0.0003033489,0.0006809586,0.0070487307,0.00052700745,0.00006427443],"category_scores_gemma":[0.00013185819,0.0007409165,0.00019544539,0.0018799886,0.0013291701,0.001094394,0.0018637596,0.0022442853,0.00015629738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017232365,0.0000927979,0.0004641472,0.00005489205,0.000018219878,0.0012789627,0.0013290872,0.00863033,0.000079866266,0.30161813,0.000040937906,0.6863754],"study_design_scores_gemma":[0.00049196265,0.00020170967,0.000612835,0.00034848455,0.000002935873,0.00017076309,2.70287e-7,0.09955159,0.00028830717,0.8965457,0.00092800055,0.0008574535],"about_ca_topic_score_codex":0.000040173192,"about_ca_topic_score_gemma":0.00041699337,"teacher_disagreement_score":0.68551797,"about_ca_system_score_codex":0.00062376575,"about_ca_system_score_gemma":0.00046304218,"threshold_uncertainty_score":0.9995042},"labels":[],"label_agreement":null},{"id":"W1763401657","doi":"10.1007/3-540-45471-3_21","title":"A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Matroid; Graphic matroid; Matroid partitioning; Combinatorics; Mathematics; Time complexity; Basis (linear algebra); Cycle basis; Discrete mathematics; Matrix (chemical analysis); Matrix multiplication; Oriented matroid; Graph","score_opus":0.012069325774437843,"score_gpt":0.2476371203445412,"score_spread":0.23556779457010335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763401657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018946754,0.00033737134,0.99414593,0.00206099,0.0004826146,0.0006798648,0.000021554419,0.00008620668,0.0019959821],"genre_scores_gemma":[0.015481261,0.0000336358,0.9776181,0.001574514,0.0006012329,0.000030647036,0.000002788028,0.00007505472,0.0045827786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952292,0.000102902675,0.0005992829,0.0015459534,0.001590845,0.00093185157],"domain_scores_gemma":[0.9957306,0.0009446366,0.00027739827,0.0024799702,0.00030370016,0.00026370658],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013717203,0.0005260508,0.00064048637,0.001088205,0.00030710752,0.00032086816,0.006760634,0.00025698112,0.00009158018],"category_scores_gemma":[0.000127483,0.0004059112,0.00023244674,0.0014239355,0.0012986946,0.00042808786,0.0027544869,0.00082413945,0.00020385228],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014323872,0.00003659746,0.000003467597,0.000017761304,0.000019086896,0.000059637303,0.0009114219,0.010781471,0.0011827945,0.0024907114,0.0003614457,0.98412126],"study_design_scores_gemma":[0.00042709766,0.0005586248,0.00009816597,0.00034406228,0.000012173783,0.0001449168,3.8638268e-7,0.87088484,0.0073981974,0.114030495,0.005235521,0.00086554216],"about_ca_topic_score_codex":0.000014469091,"about_ca_topic_score_gemma":0.0000063200323,"teacher_disagreement_score":0.98325574,"about_ca_system_score_codex":0.00022152509,"about_ca_system_score_gemma":0.00028201056,"threshold_uncertainty_score":0.99983925},"labels":[],"label_agreement":null},{"id":"W1764061692","doi":"10.1002/jgt.21882","title":"<i>K</i><sub>4</sub>‐free and ‐free Planar Matching Covered Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Matching (statistics); Subdivision; Graph; Induced subgraph; Factor-critical graph; Conformal map; Line graph; Discrete mathematics; Graph power; Vertex (graph theory); Geometry","score_opus":0.02082237696549377,"score_gpt":0.25973746476043824,"score_spread":0.23891508779494447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764061692","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6411283,0.0038350753,0.35096037,0.0010024587,0.0008497829,0.0001993029,0.000018996894,0.00009667224,0.0019090103],"genre_scores_gemma":[0.97789377,0.0005149169,0.02078406,0.0005788169,0.00014452438,0.000004235984,8.7356835e-7,0.000040477265,0.000038353064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996887,0.0006882528,0.00058725715,0.00032500993,0.0010027254,0.0005097456],"domain_scores_gemma":[0.99663305,0.00076108635,0.0004921685,0.0011273655,0.00039847294,0.00058787665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048227035,0.0002592072,0.0004374181,0.0008567865,0.00019416759,0.00021092483,0.0027514112,0.000108324784,0.0000030200065],"category_scores_gemma":[0.0007621288,0.00021416743,0.00023344558,0.00084277906,0.00036760725,0.0014683277,0.00060354813,0.00071571674,0.000009149805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005169425,0.00009921415,0.0005147879,0.00002542642,0.0001510573,0.00033332728,0.0014308125,0.00010352446,0.020667974,0.9578892,0.0046233363,0.013644402],"study_design_scores_gemma":[0.001926058,0.00043129319,0.0006373616,0.0000781788,0.000021118334,0.00087078323,0.0003811969,0.000049743885,0.008566918,0.9863925,0.00040534252,0.00023949721],"about_ca_topic_score_codex":0.000002682977,"about_ca_topic_score_gemma":0.000005944265,"teacher_disagreement_score":0.3367654,"about_ca_system_score_codex":0.000054015032,"about_ca_system_score_gemma":0.00017960144,"threshold_uncertainty_score":0.8733494},"labels":[],"label_agreement":null},{"id":"W1766429383","doi":"10.37236/5095","title":"Graphs with Induced-Saturation Number Zero","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Saturation (graph theory); Vertex (graph theory); Induced subgraph; Graph; Discrete mathematics","score_opus":0.01403695763189795,"score_gpt":0.2792874026438186,"score_spread":0.2652504450119207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766429383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10994492,0.0016501172,0.8814927,0.0037289977,0.0012494918,0.00036892015,0.000001236191,0.00006278025,0.0015008433],"genre_scores_gemma":[0.9985829,0.0006117689,0.00025124685,0.00006497937,0.000102908016,0.000011472974,6.727278e-7,0.000035005174,0.00033901713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645627,0.0005020347,0.00054645416,0.00033672363,0.0012729623,0.0008855646],"domain_scores_gemma":[0.99616563,0.00042582737,0.0010887843,0.0012057096,0.00097147474,0.00014256977],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002265814,0.0003410827,0.00046319567,0.00026276175,0.0002130919,0.00022113541,0.003802266,0.00021471753,0.0000065149966],"category_scores_gemma":[0.00011547342,0.00018119569,0.0002285983,0.0007659743,0.00013549061,0.00057273137,0.00079586596,0.003339744,0.000017697901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008908159,0.000069769405,0.00013522853,0.000015237798,0.00017667803,0.000022909922,0.00019770484,0.000058234644,0.0002636957,0.9964076,0.00028414314,0.0022797177],"study_design_scores_gemma":[0.00068967947,0.00055322057,0.00012654679,0.00014007595,0.00003415034,0.00044969376,0.0000120309205,0.0001106592,0.002294299,0.99444765,0.0008948353,0.00024718227],"about_ca_topic_score_codex":0.0000026477787,"about_ca_topic_score_gemma":0.0000023577647,"teacher_disagreement_score":0.888638,"about_ca_system_score_codex":0.00060343504,"about_ca_system_score_gemma":0.001844402,"threshold_uncertainty_score":0.9989596},"labels":[],"label_agreement":null},{"id":"W176713422","doi":"","title":"The Inverse Domination Number of a Graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Graph; Combinatorics; Geometry","score_opus":0.012533047829698121,"score_gpt":0.2847599724812493,"score_spread":0.2722269246515512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176713422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97087455,0.00009779784,0.019631581,0.0012586103,0.0014517689,0.0003107239,0.0000010842099,0.00011879959,0.006255087],"genre_scores_gemma":[0.99556035,0.000034055633,0.004212432,0.000038376904,0.0000024158003,0.000017682394,4.767411e-7,0.0000067091078,0.00012749573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897546,0.00008733115,0.0001674462,0.00018870523,0.00034773542,0.00023330616],"domain_scores_gemma":[0.998856,0.00022223522,0.000083992294,0.0006077033,0.00016853618,0.00006150937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054122554,0.000080779304,0.00009440196,0.00006183052,0.00019287807,0.000049249324,0.0009473074,0.000037522812,0.0000041224366],"category_scores_gemma":[0.00014126718,0.00006102598,0.0000641795,0.00076384505,0.00019556149,0.00036714645,0.00021505528,0.0001340845,0.00006680221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009248284,0.000047706202,0.00046634118,0.0000035307328,0.000009439128,0.0000040423893,0.00027899918,0.000032544747,0.0004304295,0.99619806,0.00015942579,0.0023602194],"study_design_scores_gemma":[0.00073961914,0.00004235336,0.00079229655,0.000009732862,0.0000016372965,0.0000066755833,0.000035668952,0.00016843225,0.007077805,0.99048835,0.00056817045,0.00006925651],"about_ca_topic_score_codex":0.000018007568,"about_ca_topic_score_gemma":0.00001278915,"teacher_disagreement_score":0.024685808,"about_ca_system_score_codex":0.00004874397,"about_ca_system_score_gemma":0.00006895294,"threshold_uncertainty_score":0.24885672},"labels":[],"label_agreement":null},{"id":"W1768636550","doi":"10.1007/978-3-319-13524-3_21","title":"Reconfiguration over Tree Decompositions","year":2014,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Control reconfiguration; Vertex (graph theory); Parameterized complexity; Combinatorics; Bounded function; Feedback vertex set; Mathematics; Discrete mathematics; Cardinality (data modeling); Graph; Dominating set; Pathwidth; Computer science; Line graph","score_opus":0.020282838400060097,"score_gpt":0.31319455821428005,"score_spread":0.29291171981421993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768636550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014637701,0.00012759224,0.9803872,0.0015937455,0.0023050422,0.0004979486,0.0000044297994,0.000269429,0.00017689921],"genre_scores_gemma":[0.5573017,0.000010561731,0.44178268,0.0006150289,0.00023133423,0.00003764198,0.00000658239,0.00001286524,0.0000015860519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953033,0.00030309794,0.00051999546,0.0019375138,0.0010575422,0.0008786073],"domain_scores_gemma":[0.9958817,0.0008422734,0.00024968587,0.0024728444,0.00031644737,0.00023706871],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017578751,0.0004336358,0.00044960628,0.0012098588,0.00038079364,0.0011447582,0.0055329977,0.0002878874,0.00001772558],"category_scores_gemma":[0.00028314395,0.0004149694,0.00015373545,0.0021242634,0.00065814954,0.00086351857,0.003692035,0.0013727424,0.00004565838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005820676,0.00007001211,0.00044260535,0.000040576757,0.000007941993,0.000023070967,0.00070638565,0.3415775,0.002688604,0.007229093,0.00001755129,0.64719087],"study_design_scores_gemma":[0.00016503858,0.000059900085,0.001984615,0.00012432683,0.000002055303,0.00002063683,9.206296e-8,0.6570373,0.007892227,0.33231044,0.000057564474,0.00034579664],"about_ca_topic_score_codex":0.00003844249,"about_ca_topic_score_gemma":0.00011355754,"teacher_disagreement_score":0.64684504,"about_ca_system_score_codex":0.00035803494,"about_ca_system_score_gemma":0.0005158203,"threshold_uncertainty_score":0.9998922},"labels":[],"label_agreement":null},{"id":"W1774294075","doi":"10.46298/dmtcs.3429","title":"Directed One-Trees","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Directed graph; Property (philosophy); Class (philosophy); Tree (set theory); Measure (data warehouse); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.020004681116525647,"score_gpt":0.29856820624155356,"score_spread":0.2785635251250279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1774294075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008476068,0.000050786,0.9744733,0.0020240145,0.00018734354,0.0003272653,0.0000031877396,0.00079789764,0.013660164],"genre_scores_gemma":[0.4992328,0.000006329694,0.5003722,0.00022083428,0.00010002922,0.000014407713,7.152322e-7,0.000014833262,0.000037864822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537045,0.00014640695,0.00053597335,0.0010551994,0.0017200236,0.0011719448],"domain_scores_gemma":[0.99629444,0.0006723385,0.00013454922,0.0019844736,0.00036274054,0.00055146636],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002246478,0.0003403576,0.00040020398,0.00041258163,0.0006535597,0.00088768493,0.005427925,0.00007747667,0.00014451178],"category_scores_gemma":[0.00035754303,0.00027767717,0.0001481157,0.0022716678,0.003852198,0.0015338692,0.00236305,0.00038876542,0.00043547453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004486046,0.00015688241,0.000011146816,0.000014295621,0.000009737332,0.0000068238623,0.0009727565,0.00018087386,0.0018724356,0.9722769,0.000038859715,0.02445475],"study_design_scores_gemma":[0.00015181626,0.00008398169,0.00008583779,0.000041787924,0.0000043940818,0.00002333384,0.000013254203,0.5397966,0.005266294,0.454085,0.00019020721,0.0002574883],"about_ca_topic_score_codex":8.223189e-7,"about_ca_topic_score_gemma":0.0000017152342,"teacher_disagreement_score":0.53961575,"about_ca_system_score_codex":0.000094750365,"about_ca_system_score_gemma":0.00013597707,"threshold_uncertainty_score":0.9999675},"labels":[],"label_agreement":null},{"id":"W1784462007","doi":"10.1016/j.tcs.2015.09.009","title":"Games on interval and permutation graph representations","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Combinatorics; Interval graph; Graph; Mathematics; Permutation graph; Discrete mathematics; Combinatorial game theory; PSPACE; Permutation (music); Time complexity; Representation (politics); Computer science; Theoretical computer science; Pathwidth; Computational complexity theory; Line graph; Algorithm; Sequential game; Game theory; Mathematical economics","score_opus":0.034296970045577184,"score_gpt":0.3413963523780636,"score_spread":0.3070993823324864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784462007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08712724,0.000022996786,0.9063892,0.0016319976,0.0002877709,0.00014624713,0.0000010271705,0.000158559,0.004234972],"genre_scores_gemma":[0.8923686,0.0000031992308,0.107165314,0.00037947154,0.000049366987,0.00000962397,5.831252e-7,0.0000056439585,0.000018170931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997656,0.00019251452,0.00018491116,0.000706934,0.00083485997,0.0004248011],"domain_scores_gemma":[0.9981446,0.00036686758,0.000042555697,0.00071558496,0.000284513,0.00044587895],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016423302,0.0001344818,0.00013651543,0.0003574977,0.0002828767,0.0004499349,0.0014510225,0.000030098754,0.000007840116],"category_scores_gemma":[0.00035315356,0.00010957996,0.00003676421,0.0013061978,0.0033498036,0.00096877216,0.00091884745,0.0001978561,0.000059874987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001575019,0.00003391198,0.00011494437,0.000001962817,0.0000020788038,0.000010452544,0.00088333024,0.00030733662,0.00015387262,0.96811956,0.000054526896,0.030302254],"study_design_scores_gemma":[0.00024753652,0.00038627116,0.0017745628,0.000015073176,0.0000014926994,0.000044331744,0.000046404857,0.20222549,0.0016571066,0.7934142,0.000052012892,0.00013551237],"about_ca_topic_score_codex":0.0000029594491,"about_ca_topic_score_gemma":4.961779e-7,"teacher_disagreement_score":0.8052414,"about_ca_system_score_codex":0.00004704734,"about_ca_system_score_gemma":0.00009903915,"threshold_uncertainty_score":0.9993625},"labels":[],"label_agreement":null},{"id":"W1786052730","doi":"10.46298/dmtcs.3419","title":"Fast separation in a graph with an excluded minor","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Backslash; Combinatorics; Mathematics; Vertex (graph theory); Order (exchange); Graph; Discrete mathematics","score_opus":0.01874154929046081,"score_gpt":0.3162033184436024,"score_spread":0.2974617691531416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1786052730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111499436,0.0000136497265,0.8842687,0.00059475255,0.000058124417,0.00039172694,0.0000017921152,0.00016926407,0.003002546],"genre_scores_gemma":[0.54898304,0.0000015168458,0.45080128,0.00012791826,0.00003939396,0.000023052131,0.000001175684,0.000011581093,0.000011012734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614275,0.00017220149,0.00046856378,0.0009980433,0.0012922519,0.00092619314],"domain_scores_gemma":[0.99745166,0.00028741662,0.00012008616,0.0014969378,0.00022883741,0.00041508238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021098251,0.00031023507,0.00033825875,0.0005712942,0.00034517242,0.00071064103,0.0032558949,0.00006492993,0.00003659304],"category_scores_gemma":[0.00007679155,0.00022859772,0.00006631268,0.0025502057,0.0026953348,0.0023603486,0.00075386546,0.00032835043,0.00006617656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021794876,0.0002019982,0.000045104647,0.000015933907,0.00000390041,0.000016718905,0.0028616206,0.0015461727,0.0009932417,0.9841531,0.0000036662193,0.010136784],"study_design_scores_gemma":[0.00031760693,0.00034069206,0.00012585678,0.000049330247,0.0000027445028,0.0000483211,0.000058080634,0.6244558,0.0027515208,0.37158072,0.0000112056705,0.0002580935],"about_ca_topic_score_codex":0.0000018508125,"about_ca_topic_score_gemma":0.000013981819,"teacher_disagreement_score":0.62290967,"about_ca_system_score_codex":0.00008272603,"about_ca_system_score_gemma":0.00014077601,"threshold_uncertainty_score":0.9931073},"labels":[],"label_agreement":null},{"id":"W1791050365","doi":"10.2168/lmcs-11(4:18)2015","title":"A finer reduction of constraint problems to digraphs","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Grantová Agentura České Republiky; Grantová Agentura, Univerzita Karlova","keywords":"Digraph; Constraint satisfaction problem; Nondeterministic algorithm; Combinatorics; Mathematics; Complexity of constraint satisfaction; Discrete mathematics; Conjecture; Constraint (computer-aided design); Algebraic number; Local consistency","score_opus":0.16129164546768482,"score_gpt":0.4418393829298686,"score_spread":0.28054773746218375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791050365","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01520986,0.000043652817,0.98225564,0.0006111681,0.0006336632,0.00035401812,5.765275e-7,0.000085592,0.00080584525],"genre_scores_gemma":[0.22161329,0.000001853993,0.7781966,0.000120064695,0.000030786276,0.000023307588,8.4101394e-8,0.0000032239375,0.000010812363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968041,0.00059676834,0.00042354717,0.0008513865,0.00075692084,0.0005672693],"domain_scores_gemma":[0.9978698,0.00040087732,0.000098022494,0.0008223769,0.0003826788,0.0004262367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076709185,0.00015103804,0.00029137972,0.0006542836,0.00007627837,0.00012336785,0.00249739,0.00005791674,0.0000040777354],"category_scores_gemma":[0.00083615154,0.00011699464,0.000058484206,0.005079174,0.0011359088,0.00064307876,0.0013814183,0.00025898163,0.000009550178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014983902,0.0001445272,0.00033765074,0.000009877818,0.0000025161924,0.000011668121,0.0014046057,0.019818872,0.026863988,0.25442383,0.000033253593,0.6969342],"study_design_scores_gemma":[0.00045071807,0.00094852346,0.0025206262,0.000071931594,0.0000012157928,0.00010732596,0.00004121512,0.23791,0.026538672,0.7306441,0.00044116826,0.00032448888],"about_ca_topic_score_codex":0.000012456704,"about_ca_topic_score_gemma":0.0000012186619,"teacher_disagreement_score":0.69660974,"about_ca_system_score_codex":0.0000871358,"about_ca_system_score_gemma":0.00021604773,"threshold_uncertainty_score":0.4770903},"labels":[],"label_agreement":null},{"id":"W1791216447","doi":"10.1016/j.ejc.2015.08.001","title":"Fast recoloring of sparse graphs","year":2015,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Graph coloring; Mathematics; Edge coloring; List coloring; Complete coloring; Fractional coloring; Discrete mathematics; Conjecture; Graph; Planar graph; Greedy coloring; Brooks' theorem; Bounded function; Vertex (graph theory); Graph power; Line graph","score_opus":0.05956010983609713,"score_gpt":0.2941333767780692,"score_spread":0.2345732669419721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791216447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3137354,0.0052466164,0.6118752,0.0005732441,0.0150701385,0.00053230225,0.00001595057,0.00016128802,0.05278991],"genre_scores_gemma":[0.9827642,0.0004644768,0.016319368,0.000020886706,0.0001305539,9.841712e-7,0.0000010944792,0.00005717442,0.0002412492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99544483,0.0014649222,0.0011530357,0.0003501489,0.0011957941,0.00039129006],"domain_scores_gemma":[0.994353,0.00021194115,0.0018507376,0.0011692329,0.0020186682,0.00039640095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006258804,0.00030529,0.0006848439,0.0008177476,0.00006760902,0.00014139555,0.0045609986,0.00007559002,0.00000503006],"category_scores_gemma":[0.0006137703,0.00028354162,0.00035867697,0.0008166077,0.0001510682,0.00042186055,0.002986331,0.0018428199,0.000023458528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025463878,0.00106202,0.0039537395,0.00054981856,0.0005634094,0.004353992,0.003455024,0.014988326,0.00068740954,0.9069626,0.008828145,0.05434093],"study_design_scores_gemma":[0.0017426367,0.0014326618,0.002242532,0.0007412434,0.000048340316,0.00028671144,0.000116159725,0.0011526073,0.0014830782,0.9825641,0.007608791,0.00058112544],"about_ca_topic_score_codex":7.4502486e-7,"about_ca_topic_score_gemma":1.8941725e-7,"teacher_disagreement_score":0.6690288,"about_ca_system_score_codex":0.00015559625,"about_ca_system_score_gemma":0.0004546846,"threshold_uncertainty_score":0.9999617},"labels":[],"label_agreement":null},{"id":"W1791945965","doi":"10.3390/a11020020","title":"Vertex Cover Reconfiguration and Beyond","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Vertex cover; Combinatorics; Parameterized complexity; Bipartite graph; Vertex (graph theory); Control reconfiguration; Feedback vertex set; Mathematics; Edge cover; Bounded function; Discrete mathematics; Graph; Computer science","score_opus":0.017390398062897928,"score_gpt":0.2864005603685251,"score_spread":0.2690101623056272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791945965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010936383,0.00016223277,0.96015686,0.00090727763,0.0005029769,0.00014878217,0.000002736337,0.0001237068,0.027059019],"genre_scores_gemma":[0.8052851,0.00008841698,0.18808897,0.0013871993,0.00033332896,0.0000249522,0.0000049551672,0.000021207481,0.004765865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992551,0.000041736545,0.00008549501,0.00026065507,0.00016447068,0.00019252142],"domain_scores_gemma":[0.9994064,0.00008048084,0.00002438115,0.00031764546,0.00009570499,0.00007540352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021577155,0.00006694268,0.000070708964,0.00006898833,0.00013111277,0.00009351114,0.00029710864,0.00003424387,0.00006702528],"category_scores_gemma":[0.000042487736,0.000061128114,0.000015184986,0.00024259102,0.0001435587,0.0005623208,0.00011942776,0.0000738637,0.00033952022],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008698022,0.000021372107,0.0001124485,0.0000036003523,0.000013230057,0.000014660876,0.0006646758,0.0000016490868,0.0025557477,0.15609317,0.0023945838,0.83811617],"study_design_scores_gemma":[0.0011040177,0.0008894209,0.0046370397,0.000018925888,0.000006179517,0.00017337357,0.00007913531,0.29142958,0.03557836,0.5878494,0.07770078,0.00053381064],"about_ca_topic_score_codex":0.000004555384,"about_ca_topic_score_gemma":0.000002074109,"teacher_disagreement_score":0.83758235,"about_ca_system_score_codex":0.000014119596,"about_ca_system_score_gemma":0.000022948123,"threshold_uncertainty_score":0.43639588},"labels":[],"label_agreement":null},{"id":"W179577048","doi":"10.1007/0-387-22444-0_4","title":"Algorithmic Aspects of Tree Width","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":283,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Divide and conquer algorithms; Computer science; Graph; Graph theory; Theoretical computer science; Tree (set theory); Politics; Algorithm; Political science; Mathematics; Combinatorics","score_opus":0.024976958168576105,"score_gpt":0.27036624599583775,"score_spread":0.24538928782726166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179577048","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.463366e-7,0.00032219704,0.29026857,0.00010724182,0.00013609965,0.0001771444,0.0000038309768,0.00007898918,0.70890546],"genre_scores_gemma":[0.00038213847,0.00014724355,0.1016416,0.00020358067,0.00005429909,0.0000065389045,0.0000031755073,0.000046997688,0.8975144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816936,0.00003069484,0.00030729471,0.00056148,0.00060879206,0.00032235487],"domain_scores_gemma":[0.9981182,0.00014251813,0.00016399892,0.0012739287,0.0001735771,0.00012772687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026800073,0.00027769743,0.00039432506,0.00036275163,0.000045571534,0.00003341334,0.0014504396,0.00019112881,0.0004263274],"category_scores_gemma":[0.000024734336,0.0002468179,0.00018315211,0.00011277081,0.00019323843,0.00020053904,0.00033292593,0.0003714841,0.00023128292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023029643,0.000009656691,4.8383293e-7,0.000015326224,0.00002976627,0.00003579144,0.000016103257,0.000002729509,0.000057896174,0.93558204,0.00088631985,0.06336157],"study_design_scores_gemma":[0.00016498881,0.000119064454,0.0000034468148,0.000042259227,0.000005005053,0.000023740124,0.0000010184092,0.00030425575,0.0014393101,0.91791004,0.0797369,0.00024994073],"about_ca_topic_score_codex":0.0000027720357,"about_ca_topic_score_gemma":0.000010051443,"teacher_disagreement_score":0.18862697,"about_ca_system_score_codex":0.000054133394,"about_ca_system_score_gemma":0.000121981604,"threshold_uncertainty_score":0.9999984},"labels":[],"label_agreement":null},{"id":"W1799977443","doi":"10.48550/arxiv.1110.4896","title":"Strengthened Brooks Theorem for digraphs of girth three","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Chromatic scale; Corollary; Degree (music); Graph; Vertex (graph theory); Discrete mathematics; Physics","score_opus":0.10628695600934576,"score_gpt":0.21712545748954373,"score_spread":0.11083850148019797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1799977443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14660616,0.00009816507,0.84665215,0.000015492415,0.00028113843,0.00068466354,0.000059439837,0.00018531372,0.0054174657],"genre_scores_gemma":[0.989268,0.00008905552,0.009837079,0.00001506608,0.00003221193,0.0000048342094,0.000011156638,0.000030387502,0.0007121951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976822,0.00015425154,0.00027249343,0.0012127884,0.00014062558,0.0005376462],"domain_scores_gemma":[0.99636734,0.00042284967,0.00037076286,0.002263282,0.00038112575,0.00019462557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004985649,0.0003640066,0.00048767278,0.00053692673,0.00014401015,0.000046536185,0.0040213377,0.00029144745,0.000028584907],"category_scores_gemma":[0.000081200065,0.00038399818,0.00049087754,0.0006330027,0.00044644455,0.0003291148,0.0024545456,0.00051153207,0.000018402063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016696242,0.00010587977,0.0014202842,0.00012373128,0.00014736701,0.00002913564,0.00023810305,0.008627747,0.00011263798,0.9865329,0.000029670911,0.0024655543],"study_design_scores_gemma":[0.0006094437,0.00016320124,0.00055848924,0.00008073516,0.000041831652,0.0000012969476,0.000040726056,0.060531594,0.0023970793,0.93507785,0.00011843781,0.00037929535],"about_ca_topic_score_codex":0.00006143181,"about_ca_topic_score_gemma":0.00008261387,"teacher_disagreement_score":0.84266186,"about_ca_system_score_codex":0.000069930924,"about_ca_system_score_gemma":0.00020761984,"threshold_uncertainty_score":0.9998612},"labels":[],"label_agreement":null},{"id":"W1801749230","doi":"10.37236/2497","title":"Recognition and Characterization of Chronological Interval Digraphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Victoria","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Interval (graph theory); Characterization (materials science); Interval graph; Vertex (graph theory); Discrete mathematics; Time complexity; Graph; Class (philosophy); Pathwidth; Line graph; Computer science; Artificial intelligence","score_opus":0.01725302464268015,"score_gpt":0.24430010431113044,"score_spread":0.22704707966845028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801749230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8224703,0.0004273975,0.1762236,0.00061376026,0.000101742444,0.00009818585,2.7179985e-7,0.000009200681,0.000055502074],"genre_scores_gemma":[0.9990104,0.0008232328,0.00008257459,0.000031257714,0.000020010706,0.0000032365838,6.463028e-7,0.000004540174,0.000024135888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998941,0.00017780071,0.0002817654,0.00008562132,0.00024500297,0.00026879742],"domain_scores_gemma":[0.99906856,0.00014609376,0.00031079477,0.00017678809,0.00025001768,0.00004775843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072092004,0.00007479318,0.00015882571,0.00012848126,0.000058437778,0.000045722303,0.0006104761,0.000039895665,0.000009359585],"category_scores_gemma":[0.00007335802,0.000047748752,0.00005663415,0.00039501378,0.00010847364,0.00058406836,0.00011000909,0.00040365467,0.0000056861513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047382015,0.00016448965,0.0005181091,0.000014561232,0.00007114604,0.00000260805,0.00045363145,0.0000017282089,0.055979155,0.8640396,0.000023176004,0.07868443],"study_design_scores_gemma":[0.00036372917,0.00091367273,0.0046258187,0.000019583396,0.0000070240826,0.00010887678,0.000026805797,0.00050823827,0.011041908,0.98217946,0.0001449812,0.000059905447],"about_ca_topic_score_codex":0.0000017654769,"about_ca_topic_score_gemma":2.4930344e-7,"teacher_disagreement_score":0.17654003,"about_ca_system_score_codex":0.000059479516,"about_ca_system_score_gemma":0.000085721775,"threshold_uncertainty_score":0.19471376},"labels":[],"label_agreement":null},{"id":"W1803579481","doi":"","title":"Forced Orientation of Graphs","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Forcing (mathematics); Matroid; Combinatorics; Orientation (vector space); Graph; Cardinality (data modeling); Set (abstract data type); Existential quantification; Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.047339521230320085,"score_gpt":0.30143359753334603,"score_spread":0.25409407630302594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803579481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0568531,0.0000074897066,0.8962624,0.00001262043,0.00005721442,0.00006655536,2.0515827e-7,0.000056307385,0.046684075],"genre_scores_gemma":[0.8727933,0.0000023036516,0.1267685,0.000024169844,0.0000015846213,0.000004211458,2.2506234e-7,0.000001966233,0.0004037162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995305,0.000024593348,0.00008682381,0.00011874433,0.000132918,0.000106402986],"domain_scores_gemma":[0.9995452,0.000029544093,0.000028549086,0.00029064858,0.00007214773,0.000033901117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014190428,0.000033306744,0.0000466705,0.000100575904,0.000022284265,0.0000051505626,0.00039693946,0.0000130996195,0.00007998718],"category_scores_gemma":[0.000018248233,0.000027253043,0.00002706532,0.00039123962,0.00004513941,0.00032334897,0.000083364524,0.000029427532,0.000020346408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000538185,0.000013980261,0.0010112518,0.000002266521,0.0000026828498,7.841362e-7,0.0005449924,0.0000012215572,0.0023178705,0.9881861,0.00002164159,0.007891812],"study_design_scores_gemma":[0.00016384349,0.0001047968,0.004984302,0.000002306048,7.0988597e-7,0.0000017360329,0.00006559574,0.0014552217,0.18080664,0.81230664,0.000054454697,0.00005373548],"about_ca_topic_score_codex":0.000015187377,"about_ca_topic_score_gemma":0.0000022132872,"teacher_disagreement_score":0.8159402,"about_ca_system_score_codex":0.000003529251,"about_ca_system_score_gemma":0.000011037723,"threshold_uncertainty_score":0.111134686},"labels":[],"label_agreement":null},{"id":"W180549117","doi":"","title":"Maximum number of 3-paths in a graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.01570994867429192,"score_gpt":0.2926897269549101,"score_spread":0.27697977828061815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180549117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98307866,0.000098915596,0.004606708,0.00020000357,0.0005951681,0.00016795904,8.3623996e-7,0.0000777261,0.011174045],"genre_scores_gemma":[0.9960585,0.00004795154,0.003650812,0.000043489064,0.000002203437,0.000017930462,6.3107075e-7,0.000010437192,0.0001680474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859726,0.00012230022,0.00024617044,0.0003108894,0.00034526997,0.00037812124],"domain_scores_gemma":[0.99889046,0.00015369078,0.00006771925,0.0007020506,0.00009665425,0.00008941384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046497915,0.00011460395,0.00019561853,0.00020571757,0.00004120557,0.000026326203,0.001026481,0.00005972957,0.000041466326],"category_scores_gemma":[0.00007769252,0.00011590534,0.00006697305,0.0016180949,0.000099682286,0.00040391547,0.0002912535,0.00020071439,0.000086564345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015625152,0.00014737688,0.060962066,0.00000684467,0.0000057756934,0.000071883245,0.00021851445,0.000009286667,0.00033890776,0.9334273,0.00009665287,0.0046997895],"study_design_scores_gemma":[0.00070655916,0.000052305382,0.009446759,0.000019829055,8.928023e-7,0.000025925541,0.000022390994,0.0004163343,0.0011511476,0.98744786,0.00058969617,0.00012028888],"about_ca_topic_score_codex":0.000038692266,"about_ca_topic_score_gemma":0.000008301919,"teacher_disagreement_score":0.054020595,"about_ca_system_score_codex":0.000035919154,"about_ca_system_score_gemma":0.00004535302,"threshold_uncertainty_score":0.4726483},"labels":[],"label_agreement":null},{"id":"W1813313303","doi":"10.1137/100793529","title":"A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest path problem; Combinatorics; Mathematics; Lexicographical order; Discrete mathematics; Time complexity; Induced path; Hamiltonian path; Graph; Shortest path problem","score_opus":0.037621190887750726,"score_gpt":0.32785387620906364,"score_spread":0.2902326853213129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813313303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011124085,0.00022735355,0.9846927,0.001086612,0.0004154468,0.0011753519,0.000034420635,0.00008777588,0.0011562501],"genre_scores_gemma":[0.62320095,0.00006504779,0.37517682,0.0004182479,0.00059927866,0.0001859872,0.000003974443,0.000067940615,0.00028174065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972122,0.00021669467,0.00057192607,0.00028941908,0.00082124973,0.00088856765],"domain_scores_gemma":[0.9961472,0.0019758155,0.00036919347,0.0009700896,0.00016509597,0.000372602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029878768,0.0003014987,0.000364853,0.00016032696,0.00070873054,0.00035522066,0.0015959673,0.000077022894,0.000027698388],"category_scores_gemma":[0.0002324825,0.00017568009,0.00033421212,0.00040629352,0.00019672087,0.00054050225,0.00021563472,0.00069178664,0.00005652506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016186139,0.0016092521,0.0005225351,0.00017521181,0.00025802213,0.000019028425,0.0048490167,0.0007743911,0.00022365576,0.8359599,0.00649581,0.14895134],"study_design_scores_gemma":[0.0018756454,0.0017503275,0.0012523885,0.00021730078,0.00005735814,0.00035129528,0.00075533474,0.16568424,0.0015785178,0.81264776,0.013102099,0.00072772393],"about_ca_topic_score_codex":0.0000011628752,"about_ca_topic_score_gemma":0.0000011060058,"teacher_disagreement_score":0.6120769,"about_ca_system_score_codex":0.00011432554,"about_ca_system_score_gemma":0.00007487612,"threshold_uncertainty_score":0.71640265},"labels":[],"label_agreement":null},{"id":"W1816145465","doi":"10.1007/978-3-662-44777-2_46","title":"Ordering without Forbidden Patterns","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Graph; Discrete mathematics","score_opus":0.022712947709002854,"score_gpt":0.2848081149853978,"score_spread":0.262095167276395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1816145465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016867649,0.00018160118,0.99325347,0.00040298107,0.0012064145,0.00042402666,0.000003678544,0.00026726033,0.004091889],"genre_scores_gemma":[0.44636175,0.0000633475,0.54937387,0.0015181066,0.0008025973,0.000026618853,0.0000052137725,0.00010702797,0.0017414973],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994957,0.000060907158,0.00050176453,0.0019497586,0.0014353273,0.0010952656],"domain_scores_gemma":[0.9962565,0.0005613099,0.000252917,0.0023666127,0.0002802587,0.00028243364],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013578013,0.00061131915,0.000626681,0.0011595886,0.00031920036,0.00063675526,0.0060820724,0.00029885682,0.000037907786],"category_scores_gemma":[0.00014296167,0.0005611012,0.00015629314,0.00063414144,0.0007464638,0.000616819,0.0029283126,0.0011992233,0.00011788909],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069292464,0.00001289085,0.0005253354,0.00006347372,0.0000124414755,0.00008351789,0.00039098685,0.012726669,0.0001451121,0.10015478,0.000008105316,0.88586974],"study_design_scores_gemma":[0.00039253102,0.00025039716,0.00020863953,0.0006024304,0.0000055509513,0.00012190837,1.4199497e-7,0.397426,0.0016676821,0.59455556,0.0036712827,0.0010978736],"about_ca_topic_score_codex":0.000017301796,"about_ca_topic_score_gemma":0.00010831522,"teacher_disagreement_score":0.8847719,"about_ca_system_score_codex":0.0002674454,"about_ca_system_score_gemma":0.0003595966,"threshold_uncertainty_score":0.99968404},"labels":[],"label_agreement":null},{"id":"W182912702","doi":"","title":"Several definitions of matroids.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.025569289347559657,"score_gpt":0.2771785389918423,"score_spread":0.25160924964428266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182912702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8762779,0.00048587975,0.06944719,0.0028204666,0.0014006018,0.00040179974,0.000013637259,0.00048021533,0.04867228],"genre_scores_gemma":[0.96749973,0.000030223817,0.032212343,0.00009068434,0.000005345378,0.000011390271,0.0000014541391,0.000007749635,0.00014109591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990236,0.0000662377,0.00017671542,0.00020254873,0.000273799,0.0002570647],"domain_scores_gemma":[0.9990645,0.000137945,0.00005464882,0.0005509412,0.000108189684,0.00008377516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002207156,0.00008400218,0.0001239233,0.0001202373,0.00008515685,0.000028569337,0.0007752159,0.000037113557,0.000031944368],"category_scores_gemma":[0.00005270959,0.00008559997,0.00006381547,0.0004713891,0.000085815715,0.00046405316,0.00023164113,0.00013671105,0.00015916488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037016057,0.00008084277,0.00026909722,0.0000041659864,0.0000076240076,0.0000027701244,0.00013097828,0.000070752365,0.0005583649,0.9959446,0.00061070477,0.0023163909],"study_design_scores_gemma":[0.0004047457,0.00006610671,0.0010273245,0.000007724019,0.0000017721396,0.000009254796,0.000009396125,0.0022140231,0.00531757,0.98955256,0.0012935901,0.00009596239],"about_ca_topic_score_codex":0.0000044918665,"about_ca_topic_score_gemma":0.0000019282888,"teacher_disagreement_score":0.09122178,"about_ca_system_score_codex":0.000036246776,"about_ca_system_score_gemma":0.000050563835,"threshold_uncertainty_score":0.34906653},"labels":[],"label_agreement":null},{"id":"W1829289780","doi":"10.1016/j.tcs.2016.05.031","title":"A 13k-kernel for planar feedback vertex set via region decomposition","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Narodowe Centrum Nauki; Agence Nationale de la Recherche","keywords":"Vertex (graph theory); Kernel (algebra); Mathematics; Set (abstract data type); Planar; Feedback vertex set; Algorithm; Combinatorics; Computer science; Graph","score_opus":0.021215364685179622,"score_gpt":0.3082908469589348,"score_spread":0.28707548227375523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829289780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012741038,0.00001769574,0.9820627,0.0034079247,0.0005383443,0.00044668687,0.000006074163,0.00027833224,0.0005012266],"genre_scores_gemma":[0.82498676,0.000006131253,0.17432183,0.00049852894,0.00010337377,0.000034921708,0.0000012768114,0.000014637504,0.00003255334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996522,0.00017510925,0.00032028183,0.0011487384,0.00080778764,0.0010261033],"domain_scores_gemma":[0.99675053,0.0011148925,0.00009093654,0.0012446659,0.00035167174,0.0004473244],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016152391,0.0002498542,0.0002567729,0.00031302654,0.00058424403,0.00029888228,0.0035233374,0.000080453574,0.000017930246],"category_scores_gemma":[0.00016106608,0.00016815828,0.00012232753,0.0011032405,0.0031755448,0.0013396626,0.0007610809,0.00014803314,0.00017099975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006413011,0.000042662108,0.000045760655,0.000008146798,0.0000049507926,0.000013616869,0.00013125362,0.000014249048,0.0075685945,0.9052664,0.00022313882,0.086617105],"study_design_scores_gemma":[0.0007199444,0.0005057429,0.00046070843,0.00007288685,0.0000036171434,0.00013013641,0.0000027242138,0.14909445,0.013779398,0.83469796,0.00023055436,0.0003018835],"about_ca_topic_score_codex":0.0000012571297,"about_ca_topic_score_gemma":5.480195e-7,"teacher_disagreement_score":0.8122457,"about_ca_system_score_codex":0.00015672955,"about_ca_system_score_gemma":0.00012334756,"threshold_uncertainty_score":0.9995372},"labels":[],"label_agreement":null},{"id":"W1832761474","doi":"10.1007/978-3-540-78773-0_16","title":"Minimum Cost Homomorphisms to Reflexive Digraphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Graph homomorphism; Graph; Line graph; Voltage graph","score_opus":0.0334414931792028,"score_gpt":0.3030028647787649,"score_spread":0.2695613715995621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832761474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010073771,0.00054408284,0.9863424,0.0011133032,0.0015440071,0.0011510543,0.00001718161,0.000292204,0.008895085],"genre_scores_gemma":[0.10826345,0.00037321492,0.8811434,0.0061926525,0.0008212911,0.00011151958,0.000013717467,0.00015410181,0.0029266598],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99296933,0.0000792277,0.00067455723,0.0027394535,0.0020445418,0.0014928678],"domain_scores_gemma":[0.9946123,0.0009097276,0.00026325765,0.0030084944,0.0005355754,0.00067068177],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010361287,0.0008187953,0.0008084145,0.0024634649,0.0005586406,0.00049775286,0.007799342,0.00039477873,0.00003356254],"category_scores_gemma":[0.00021832527,0.0007736694,0.00024816528,0.0022695942,0.0018972703,0.0008481074,0.0032888118,0.0014232065,0.00034792727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044414246,0.00006817067,0.000034663233,0.000030941384,0.00002534792,0.0009814424,0.0018822987,0.019823989,0.0004523748,0.09516388,0.00037977457,0.8811127],"study_design_scores_gemma":[0.0008901515,0.0011902043,0.00020329551,0.0008237929,0.000011159435,0.0006896956,6.0022126e-7,0.08537768,0.006494615,0.86464673,0.03682959,0.002842467],"about_ca_topic_score_codex":0.000012361424,"about_ca_topic_score_gemma":0.000049690723,"teacher_disagreement_score":0.8782702,"about_ca_system_score_codex":0.00048414594,"about_ca_system_score_gemma":0.00076130946,"threshold_uncertainty_score":0.9994714},"labels":[],"label_agreement":null},{"id":"W183387654","doi":"","title":"New Families of Sequential Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018161506262625228,"score_gpt":0.2779904438686136,"score_spread":0.25982893760598835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183387654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78165317,0.0010934008,0.16348577,0.00026512225,0.005346202,0.00053606194,0.0000034521622,0.00039476424,0.047222048],"genre_scores_gemma":[0.97964686,0.000034593242,0.019809319,0.000030989344,0.0000020086543,0.0000049561563,5.6608354e-7,0.0000102494605,0.00046047868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867386,0.00015262654,0.00020153384,0.00028428205,0.00037657813,0.00031111733],"domain_scores_gemma":[0.9988741,0.0001213331,0.00007128941,0.0006868204,0.00010840555,0.00013803082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034999446,0.00011712173,0.0001734163,0.00018836383,0.00007494873,0.000037947797,0.000859728,0.000051962335,0.00003782901],"category_scores_gemma":[0.00012588932,0.00011580817,0.0000880501,0.00090408284,0.00009602428,0.0003720382,0.00015347236,0.00014464179,0.00003664919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000455299,0.0000351552,0.0011668202,0.0000065606696,0.000014864448,0.0000067365127,0.000177516,0.000009888426,0.0023070343,0.99251187,0.0006448329,0.0031141709],"study_design_scores_gemma":[0.0005246833,0.000091993476,0.00041646074,0.000007849208,0.000002422452,0.000006164363,0.00002457029,0.000061159764,0.04288112,0.953511,0.0023585332,0.000114036244],"about_ca_topic_score_codex":0.000025312915,"about_ca_topic_score_gemma":0.0000021670385,"teacher_disagreement_score":0.19799365,"about_ca_system_score_codex":0.000022175589,"about_ca_system_score_gemma":0.00015263908,"threshold_uncertainty_score":0.47225204},"labels":[],"label_agreement":null},{"id":"W1836341359","doi":"10.37236/2475","title":"Recurrence Relations and Splitting Formulas for the Domination Polynomial","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"European Social Fund","keywords":"Mathematics; Combinatorics; Graph; Polynomial; Reduction (mathematics); Recurrence relation; Discrete mathematics; Mathematical analysis","score_opus":0.01530257340099532,"score_gpt":0.28800492155899604,"score_spread":0.2727023481580007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836341359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05011444,0.008816547,0.9368216,0.0032561773,0.0005578571,0.0002587562,4.01052e-7,0.000010226835,0.0001640213],"genre_scores_gemma":[0.99872965,0.0003677979,0.0005653241,0.000033434648,0.0001423561,0.000008325567,1.3472525e-7,0.000006837218,0.00014615181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875885,0.00013201637,0.0002492927,0.00007380047,0.00028479513,0.00050121435],"domain_scores_gemma":[0.99725646,0.0019177155,0.00028704177,0.00024650752,0.00022985917,0.000062395346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003887279,0.00008037292,0.00010777837,0.0000821301,0.0004742397,0.00007156511,0.0008000335,0.000032804768,0.000001087546],"category_scores_gemma":[0.000514367,0.000045771958,0.00006960663,0.0003910238,0.000076884084,0.00077688263,0.0001139725,0.0005085122,0.000001587721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025850968,0.000026560065,0.00027408666,0.0000027324231,0.000022068285,1.061084e-7,0.000576132,0.00003139284,0.000085423984,0.9851201,0.00018257991,0.013652935],"study_design_scores_gemma":[0.0006943279,0.00031052888,0.0013072836,0.000013060501,0.000027792603,0.00013607455,0.00012977667,0.0070834938,0.00093720335,0.97941566,0.00985931,0.00008550094],"about_ca_topic_score_codex":8.7621913e-7,"about_ca_topic_score_gemma":7.525136e-7,"teacher_disagreement_score":0.9486152,"about_ca_system_score_codex":0.00017034466,"about_ca_system_score_gemma":0.00018514272,"threshold_uncertainty_score":0.36475164},"labels":[],"label_agreement":null},{"id":"W1836455089","doi":"10.1007/s00453-016-0139-6","title":"List H-Coloring a Graph by Removing Few Vertices","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Defense Advanced Research Projects Agency; Office of Naval Research; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Combinatorics; Mathematics; Parameterized complexity; Bipartite graph; Conjecture; Discrete mathematics; Homomorphism; Vertex (graph theory); Graph homomorphism; Graph; Graph power; Line graph","score_opus":0.01321742497990888,"score_gpt":0.2631657678241809,"score_spread":0.249948342844272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836455089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0330477,0.0005648886,0.9592316,0.0033361,0.00040076007,0.00020221251,0.000009135475,0.00044633678,0.0027612497],"genre_scores_gemma":[0.8997115,0.00016020406,0.09643589,0.000407219,0.00017677847,0.000062551975,0.0000015279555,0.000040926825,0.0030034198],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982215,0.00010131426,0.00019646253,0.0005276874,0.00038437446,0.0005686512],"domain_scores_gemma":[0.99852324,0.00042439887,0.00006407089,0.000722735,0.00008326867,0.00018227726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003966058,0.00015264867,0.00015528894,0.0001539036,0.00020751871,0.00012605665,0.0013654748,0.000055971595,0.000038565024],"category_scores_gemma":[0.00016356066,0.00010927466,0.00007562232,0.00060837466,0.00015078393,0.00096435525,0.00045889555,0.00013581853,0.00016148062],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023352724,0.00008205584,0.00050798804,0.000016113943,0.00004920139,0.0000985539,0.00025942802,0.0000020074153,0.12783894,0.09430402,0.003915082,0.77290326],"study_design_scores_gemma":[0.0030935027,0.00066181057,0.0018745637,0.0004017832,0.000024873501,0.00019452437,0.000111052475,0.010037824,0.3537234,0.48513937,0.14287362,0.0018636626],"about_ca_topic_score_codex":0.000023678305,"about_ca_topic_score_gemma":0.000004215292,"teacher_disagreement_score":0.86666375,"about_ca_system_score_codex":0.000064036765,"about_ca_system_score_gemma":0.000038762362,"threshold_uncertainty_score":0.44560912},"labels":[],"label_agreement":null},{"id":"W184891553","doi":"","title":"On the Decomposition of Graphs Into Cliques.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition; Combinatorics; Biology","score_opus":0.011175043424231097,"score_gpt":0.29203822280072705,"score_spread":0.28086317937649596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184891553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98801965,0.00007455375,0.0014136219,0.0010128563,0.00029124267,0.00019810679,7.148223e-7,0.000090276575,0.008898978],"genre_scores_gemma":[0.9982333,0.00003487639,0.0013455937,0.00024884118,0.0000017800174,0.000019237552,9.747323e-7,0.00000779242,0.00010755784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988425,0.0002124539,0.00017192635,0.00023496561,0.00033077665,0.00020741543],"domain_scores_gemma":[0.99861526,0.00045071423,0.000049812665,0.00074512407,0.00008000727,0.000059062135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047073528,0.00009798639,0.00011627556,0.000093966504,0.00015279389,0.000039338305,0.0010470378,0.000041710697,0.00011118284],"category_scores_gemma":[0.000042944765,0.00007178772,0.000072904135,0.0006034445,0.00013902345,0.00023229711,0.000094570576,0.0001844371,0.00011063266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022815571,0.00008269299,0.00009144087,0.0000034881052,0.000008778253,0.0000033673766,0.00023244796,0.00002641996,0.00063157274,0.98577774,0.00049047323,0.012628773],"study_design_scores_gemma":[0.00022399034,0.00021469113,0.00063333125,0.000018992967,0.0000014004605,0.0000022837091,0.0000062757754,0.00080755574,0.013137057,0.9844938,0.0003825993,0.000078041885],"about_ca_topic_score_codex":0.000015550711,"about_ca_topic_score_gemma":0.0000013856452,"teacher_disagreement_score":0.012550731,"about_ca_system_score_codex":0.000029206509,"about_ca_system_score_gemma":0.000026084032,"threshold_uncertainty_score":0.2927418},"labels":[],"label_agreement":null},{"id":"W1853166665","doi":"10.1007/978-3-642-54423-1_10","title":"Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Upper and lower bounds; Spanning tree; Integer (computer science); Mathematics; Computer science; Discrete mathematics","score_opus":0.02470718623155525,"score_gpt":0.2757769881116598,"score_spread":0.2510698018801045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853166665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034115327,0.00014604972,0.98554724,0.0019504144,0.00071585696,0.00047874945,0.0000047163726,0.00009152957,0.010724311],"genre_scores_gemma":[0.8603352,0.000030459249,0.13598213,0.0022902102,0.0002319583,0.000020511994,0.0000028877532,0.000051521474,0.0010551858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995726,0.00014824409,0.0005655656,0.0013042267,0.0015142806,0.00074170285],"domain_scores_gemma":[0.9942788,0.0025243945,0.0003862491,0.0023072085,0.00035994747,0.00014343833],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0024555086,0.0005159687,0.00058620406,0.0010028753,0.00042443335,0.00039860466,0.005290764,0.00023475682,0.000047784102],"category_scores_gemma":[0.00033353185,0.00034772084,0.00024229677,0.00093652,0.0032355993,0.0003014103,0.0011638465,0.00116426,0.000036612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100018615,0.0000142746485,0.000033650304,0.000016511132,0.000018690927,0.000013813165,0.0005226218,0.01096192,0.0006830127,0.8712774,0.000018942472,0.11642918],"study_design_scores_gemma":[0.00021156669,0.00032430363,0.000073349525,0.00034753632,0.0000063217394,0.00003356182,4.9137446e-7,0.20080966,0.004819701,0.7920001,0.00093150354,0.00044187088],"about_ca_topic_score_codex":0.000005695451,"about_ca_topic_score_gemma":0.000009644154,"teacher_disagreement_score":0.859994,"about_ca_system_score_codex":0.0001107158,"about_ca_system_score_gemma":0.0004738152,"threshold_uncertainty_score":0.9998975},"labels":[],"label_agreement":null},{"id":"W1857045085","doi":"10.20382/jocg.v3i1a1","title":"The emergence of sparse spanners and well-separated pair decomposition under anarchy","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spanner; Euclidean geometry; Combinatorics; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Mathematics; Constant (computer programming); Euclidean distance; Graph; Network topology; Computer science; Discrete mathematics; Theoretical computer science; Algorithm; Computer network; Distributed computing; Artificial intelligence; Geometry","score_opus":0.02514194668334845,"score_gpt":0.26345494322076585,"score_spread":0.2383129965374174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857045085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.467948,0.00017052604,0.5299997,0.00034629158,0.00015325916,0.00006999008,0.000001966575,0.00001302406,0.0012972702],"genre_scores_gemma":[0.9749101,0.000120448654,0.024713058,0.000039094866,0.000018783328,8.330917e-8,0.0000011209103,0.000005319758,0.00019201933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862003,0.00022091337,0.00030264287,0.00016382265,0.00049056695,0.00020204703],"domain_scores_gemma":[0.99812776,0.00043774064,0.00040807435,0.0001709089,0.0007030979,0.00015241075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055186526,0.00010888914,0.00017821189,0.000828954,0.00022886353,0.000031834,0.00079959433,0.000044693006,0.000030433723],"category_scores_gemma":[0.000035256664,0.00009181187,0.000105864965,0.0016283192,0.00028768953,0.00071225694,0.00019849514,0.0002198993,0.000004438279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009407061,0.00034668975,0.011064375,0.000038755286,0.0005086906,0.00032079875,0.0014161912,0.20724836,0.0016802904,0.7634514,0.0014196011,0.01156412],"study_design_scores_gemma":[0.00513746,0.003274627,0.23209466,0.0002375286,0.00016102589,0.00088714564,0.0054022805,0.13482429,0.009509133,0.5965077,0.010923031,0.0010410958],"about_ca_topic_score_codex":0.000009763611,"about_ca_topic_score_gemma":0.0000024341578,"teacher_disagreement_score":0.5069621,"about_ca_system_score_codex":0.000046018245,"about_ca_system_score_gemma":0.00014749118,"threshold_uncertainty_score":0.37439793},"labels":[],"label_agreement":null},{"id":"W1858133485","doi":"10.37236/2299","title":"On the Cartesian Product of Non Well-Covered Graphs","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Cartesian product; Combinatorics; Vertex (graph theory); Mathematics; Cardinality (data modeling); Graph; Product (mathematics); Maximal independent set; Discrete mathematics; Chordal graph; 1-planar graph; Computer science; Geometry; Data mining","score_opus":0.011681149696567873,"score_gpt":0.26048168492128465,"score_spread":0.2488005352247168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858133485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7468236,0.0122735845,0.21072558,0.016291818,0.0038078346,0.0039191307,0.0000062100385,0.000086056054,0.006066195],"genre_scores_gemma":[0.99821526,0.0011103367,0.000082413724,0.00009443034,0.00008550084,0.000032614225,6.315499e-7,0.000033350927,0.00034545953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995701,0.00076979864,0.0007878563,0.00037116976,0.0014691219,0.0009010309],"domain_scores_gemma":[0.99420047,0.0009851902,0.0015027453,0.002288022,0.00091336813,0.000110208566],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004031396,0.0003693083,0.00063247286,0.00036292028,0.00021966561,0.00016018398,0.006943045,0.00014143609,0.00001713261],"category_scores_gemma":[0.00035828305,0.0002017757,0.0004526171,0.0009800751,0.00026390044,0.0002413729,0.00103028,0.0041028475,0.000020672705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055403907,0.0001700451,0.000024605497,0.000039019105,0.00020190292,0.0000058182577,0.00036848607,0.0009487722,0.00044071252,0.9954843,0.001296778,0.0009641903],"study_design_scores_gemma":[0.0003884221,0.000860343,0.00013783187,0.00015586824,0.000034546527,0.000065973625,0.000036164798,0.0010561561,0.008597458,0.9878625,0.00061199185,0.00019270781],"about_ca_topic_score_codex":0.000015599557,"about_ca_topic_score_gemma":0.0000019638253,"teacher_disagreement_score":0.25139168,"about_ca_system_score_codex":0.00038161967,"about_ca_system_score_gemma":0.0014264184,"threshold_uncertainty_score":0.9984299},"labels":[],"label_agreement":null},{"id":"W1860548633","doi":"10.37236/2666","title":"A Superlocal Version of Reed's Conjecture","year":2014,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Neighbourhood (mathematics); Mathematics; Omega; Vertex (graph theory); Upper and lower bounds; Locality; Independent set; Graph; Chromatic scale; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.008571330437597833,"score_gpt":0.2618029617354574,"score_spread":0.2532316312978596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860548633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1392454,0.008235466,0.8476192,0.0023363105,0.0016613394,0.00030471978,0.000002481565,0.000035672918,0.0005594339],"genre_scores_gemma":[0.99836266,0.0010704758,0.00024350938,0.000048617818,0.00012228168,0.0000024915075,0.0000011110907,0.000023239752,0.00012561513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646294,0.0006745111,0.00067835615,0.00027182943,0.0011963217,0.0007160234],"domain_scores_gemma":[0.99623615,0.000656365,0.0009967616,0.0012261136,0.00075964275,0.00012494955],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0035779718,0.00027984855,0.0006649593,0.00032352944,0.00012330053,0.000071330964,0.0048864675,0.00026322983,0.00000815416],"category_scores_gemma":[0.00028270754,0.000188943,0.00039412588,0.0005572623,0.00022230779,0.0001840997,0.0014343755,0.0037172635,0.000006370422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010037996,0.000095503754,0.00004358582,0.00006576928,0.00014840643,0.00001271668,0.00030540462,0.002148451,0.00027568487,0.994874,0.0004720243,0.001458092],"study_design_scores_gemma":[0.0007875395,0.0011421263,0.0000541482,0.00013377213,0.000045586057,0.00020164362,0.000030424253,0.0034437126,0.00281238,0.9877649,0.0034042103,0.00017956922],"about_ca_topic_score_codex":0.000005971705,"about_ca_topic_score_gemma":0.0000014371504,"teacher_disagreement_score":0.85911727,"about_ca_system_score_codex":0.00045741914,"about_ca_system_score_gemma":0.0015363855,"threshold_uncertainty_score":0.99858123},"labels":[],"label_agreement":null},{"id":"W1861204304","doi":"10.1007/978-3-642-25870-1_29","title":"Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Grid; Vertex (graph theory); Intersection (aeronautics); Computer science; Combinatorics; Theoretical computer science; Geography; Mathematics; Graph; Cartography; Geometry","score_opus":0.03237308431601719,"score_gpt":0.2708802046717232,"score_spread":0.238507120355706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861204304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005671492,0.0005802839,0.9894395,0.00005928467,0.002352238,0.00042145848,0.000008892756,0.000060491286,0.0014063593],"genre_scores_gemma":[0.8843529,0.00023231481,0.11503392,0.00012924176,0.00013097795,0.000012972199,0.000003518786,0.000041664305,0.00006245007],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962373,0.0000980848,0.0008264584,0.00127294,0.00092151435,0.00064374827],"domain_scores_gemma":[0.9969842,0.00075299636,0.00051304576,0.0012669486,0.00035986758,0.00012294095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013804004,0.0004304221,0.00072788727,0.0027858082,0.00008023717,0.00007677946,0.0031950024,0.00028494906,0.000018173074],"category_scores_gemma":[0.0002182178,0.00040937364,0.00019141131,0.0014456832,0.0012333408,0.0011126762,0.0013611038,0.0009255453,0.000007095801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084617874,0.00015218556,0.0009070302,0.00027983144,0.000032899254,0.00011170008,0.0035134305,0.0034074213,0.0066793645,0.24465266,0.000009692126,0.74016917],"study_design_scores_gemma":[0.00037552678,0.0005021148,0.0005178208,0.0011072822,0.0000054874317,0.000037918126,0.0000012825888,0.026090644,0.0271517,0.943667,0.000062638275,0.00048058492],"about_ca_topic_score_codex":0.00009101263,"about_ca_topic_score_gemma":0.00021484902,"teacher_disagreement_score":0.8786814,"about_ca_system_score_codex":0.00020373985,"about_ca_system_score_gemma":0.00041149295,"threshold_uncertainty_score":0.9998358},"labels":[],"label_agreement":null},{"id":"W186137167","doi":"","title":"Trees with equal average domination and independent domination numbers.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph","score_opus":0.0096807429801973,"score_gpt":0.2558306158770472,"score_spread":0.2461498728968499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186137167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.854457,0.00007508701,0.14221993,0.00054981664,0.00036834288,0.00032643604,0.0000012695475,0.00013520764,0.0018669023],"genre_scores_gemma":[0.9941899,0.000017144339,0.0055700624,0.000049648217,0.0000056843855,0.000029036162,0.0000033873362,0.000013313757,0.00012181387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984926,0.00009297421,0.0001626673,0.00041329232,0.0005433939,0.00029506558],"domain_scores_gemma":[0.99911416,0.00013330413,0.000087033295,0.00040043515,0.00014529772,0.00011975892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047300768,0.00015150824,0.0001495395,0.00017965783,0.00019119249,0.00016593926,0.0004617755,0.00006954832,0.000006164758],"category_scores_gemma":[0.00006305847,0.00013480801,0.000027173164,0.00048780767,0.00011571521,0.0010396168,0.0002031299,0.00020340289,0.000025288151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003917925,0.000093361945,0.0006835037,0.0000074194786,0.00001362932,0.000037853337,0.00091675343,0.00022784437,0.0007225094,0.98946923,0.000011345298,0.0077773514],"study_design_scores_gemma":[0.0032854048,0.00031112164,0.0070312,0.000027807158,0.000004411688,0.000041051215,0.00006546847,0.00089084235,0.0072562397,0.9807856,0.000092270995,0.00020860121],"about_ca_topic_score_codex":0.00003144686,"about_ca_topic_score_gemma":0.000039054343,"teacher_disagreement_score":0.13973291,"about_ca_system_score_codex":0.00014793446,"about_ca_system_score_gemma":0.00007470946,"threshold_uncertainty_score":0.54973114},"labels":[],"label_agreement":null},{"id":"W1861909104","doi":"10.1007/s00453-013-9752-9","title":"Practical and Efficient Split Decomposition via Graph-Labelled Trees","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Lexicographical order; Graph; Modular decomposition; Decomposition; Mathematics; Algorithm; Combinatorics; Computer science; Inverse; Line graph; Pathwidth","score_opus":0.014971663974801794,"score_gpt":0.31105844003241884,"score_spread":0.296086776057617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861909104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060812596,0.000101232334,0.93445885,0.0033681225,0.000117100186,0.00037035893,0.0000012814133,0.00014979008,0.0006206923],"genre_scores_gemma":[0.59227,0.00001603993,0.407323,0.00016513343,0.000044662964,0.00006420911,0.0000026240293,0.000012298348,0.00010200748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846196,0.00014078245,0.0001901934,0.00046268848,0.00033656013,0.0004077939],"domain_scores_gemma":[0.9987576,0.00036289764,0.000055952325,0.00048032313,0.00012694592,0.00021629698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027125637,0.0001461664,0.00015673388,0.00017135477,0.00020157165,0.00018620359,0.00038769143,0.00006279756,0.000074812895],"category_scores_gemma":[0.000051957308,0.00012810052,0.000048705548,0.0004462637,0.0001681895,0.00047832838,0.00033105945,0.00021249258,0.00029157544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003915374,0.00063063484,0.00021712048,0.000026194488,0.00009397348,0.000092098926,0.0005736495,0.00024746003,0.032365892,0.3776856,0.0017935841,0.5862346],"study_design_scores_gemma":[0.0009290697,0.0003292209,0.005997948,0.00002082844,0.000011747339,0.00024606785,0.000042396627,0.80274326,0.011560233,0.17711718,0.0005896151,0.0004124167],"about_ca_topic_score_codex":0.000031586023,"about_ca_topic_score_gemma":0.000002294867,"teacher_disagreement_score":0.80249584,"about_ca_system_score_codex":0.000027485565,"about_ca_system_score_gemma":0.00003302489,"threshold_uncertainty_score":0.52237874},"labels":[],"label_agreement":null},{"id":"W1864728667","doi":"","title":"Decycling and dominating cubes and grids","year":2006,"lang":"en","type":"dissertation","venue":"Memorial University Research Repository (Memorial University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Computer science","score_opus":0.01967402217984583,"score_gpt":0.27810012708419835,"score_spread":0.2584261049043525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864728667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86683965,0.0006327397,0.00343116,0.00013560039,0.009016664,0.0015026119,0.000035484194,0.00048255056,0.11792355],"genre_scores_gemma":[0.63833624,0.0020856962,0.0129203815,0.00001330595,0.009480088,0.0000035448277,0.00031041575,0.00021821067,0.3366321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99337864,0.001681781,0.00035523542,0.0017825562,0.001631659,0.0011701045],"domain_scores_gemma":[0.9956379,0.001382898,0.0002916183,0.00096965866,0.0011128848,0.0006050366],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016484618,0.0005473625,0.000728064,0.0028210208,0.0031317158,0.00068075536,0.0025572935,0.0007406902,0.0000079132],"category_scores_gemma":[0.00036918637,0.00068734266,0.00021177215,0.002453319,0.00080813415,0.001989363,0.001716398,0.0019909826,0.000012340754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0139865875,0.0008729763,0.002303524,0.0022678804,0.0011054275,0.026079096,0.008678632,0.00024215822,0.10855394,0.7622211,0.0075813513,0.06610735],"study_design_scores_gemma":[0.042095385,0.0057950024,0.010183146,0.003659334,0.0012992085,0.0007810041,0.06059505,0.01673026,0.14183906,0.06968959,0.6357218,0.011611172],"about_ca_topic_score_codex":0.0015704429,"about_ca_topic_score_gemma":0.000554532,"teacher_disagreement_score":0.69253147,"about_ca_system_score_codex":0.0008052822,"about_ca_system_score_gemma":0.00093586394,"threshold_uncertainty_score":0.9995578},"labels":[],"label_agreement":null},{"id":"W1871413087","doi":"10.1016/j.dam.2015.08.018","title":"A note on the Grundy number and graph products","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Memorial University of Newfoundland; Mount Allison University; University of Prince Edward Island; St. Francis Xavier University; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.04128525240217985,"score_gpt":0.30362654616002677,"score_spread":0.2623412937578469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871413087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07146504,0.00006277689,0.8162682,0.0074387514,0.00017362696,0.0015988552,0.0000069003167,0.0003894177,0.102596454],"genre_scores_gemma":[0.76055574,0.000013065316,0.23831148,0.00038185978,0.000086886124,0.00016140655,0.0000021626292,0.00003717734,0.00045021996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985688,0.000037124337,0.00019173298,0.00035897974,0.0005147407,0.00032867512],"domain_scores_gemma":[0.9982861,0.0003478746,0.0000871883,0.0010550548,0.00008242484,0.00014131243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000854154,0.00017613261,0.00017597097,0.00005551299,0.00014528165,0.00016836786,0.0008138543,0.000043575736,0.0000055876035],"category_scores_gemma":[0.00021662205,0.00010737268,0.00003007573,0.00051492604,0.00020494185,0.00014381611,0.00039427425,0.00022165739,0.00023226262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000852909,0.000031146858,0.000004213865,0.00002931644,0.000009912941,0.0000032634598,0.0025572358,0.000019133182,0.0011364992,0.99375147,0.0006602528,0.0017890007],"study_design_scores_gemma":[0.00025642227,0.000039141352,0.00001122689,0.000019881518,0.000005808038,0.000017592423,0.00038588082,0.0039622486,0.0077027637,0.98554736,0.0018683859,0.00018330621],"about_ca_topic_score_codex":0.0000010916168,"about_ca_topic_score_gemma":8.131214e-7,"teacher_disagreement_score":0.6890907,"about_ca_system_score_codex":0.000020478436,"about_ca_system_score_gemma":0.000045508037,"threshold_uncertainty_score":0.4378531},"labels":[],"label_agreement":null},{"id":"W187157619","doi":"","title":"Domination Graphs of Tournaments with Isolated Vertices.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010761805555458954,"score_gpt":0.25894835006657946,"score_spread":0.24818654451112052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187157619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9662723,0.00012859644,0.028498089,0.00007186921,0.0004982315,0.00024223515,6.4845005e-7,0.000074217736,0.004213812],"genre_scores_gemma":[0.994835,0.000013229689,0.004996485,0.000025656032,4.944451e-7,0.000011053561,6.734363e-7,0.000009658581,0.00010772475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998745,0.00015748246,0.00018643492,0.0002491201,0.0004005254,0.00026142673],"domain_scores_gemma":[0.99895704,0.000114083065,0.00011485804,0.0005018644,0.00022272405,0.00008945906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039309732,0.00010830215,0.00014950636,0.00017802772,0.00008667032,0.000041396535,0.00055816665,0.00004242676,0.000014859339],"category_scores_gemma":[0.00008950261,0.00009269733,0.000037457725,0.0010021582,0.00008537227,0.00054856343,0.00006636185,0.00013565377,0.00001345845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002955873,0.000120773635,0.0027655663,0.000008666127,0.000026443886,0.000010335649,0.00020984146,0.000024100795,0.0018095762,0.99299324,0.00004431621,0.0019576135],"study_design_scores_gemma":[0.001571343,0.0004269356,0.001868778,0.000030254603,0.0000063891307,0.000012378248,0.000032563003,0.0013693008,0.025319112,0.96895003,0.00026271876,0.00015017514],"about_ca_topic_score_codex":0.0000049960418,"about_ca_topic_score_gemma":0.0000013741968,"teacher_disagreement_score":0.028562725,"about_ca_system_score_codex":0.00003911081,"about_ca_system_score_gemma":0.00005931744,"threshold_uncertainty_score":0.37800875},"labels":[],"label_agreement":null},{"id":"W1873702685","doi":"10.1090/s0002-9947-04-03544-5","title":"Coloring-flow duality of embedded graphs","year":2004,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Council; Division of Mathematical Sciences; National Security Agency; Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Invariant (physics); Edge coloring; Discrete mathematics; Mathematical physics","score_opus":0.021607512555551954,"score_gpt":0.30324022582720556,"score_spread":0.2816327132716536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873702685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13440646,0.000010942529,0.8641993,0.00074622675,0.00003420589,0.00019060686,0.0000098643695,0.00005936089,0.00034305538],"genre_scores_gemma":[0.7225482,0.000013798369,0.27730513,0.000063907035,0.0000032026517,0.000016571234,1.14819755e-7,0.0000074402415,0.00004163857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858135,0.000097867436,0.00035206377,0.0002173835,0.0004888848,0.00026242336],"domain_scores_gemma":[0.998315,0.00032557335,0.00022815468,0.000919219,0.00012853349,0.00008353993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046830272,0.00012175702,0.00034735777,0.000032998603,0.00015286433,0.0000144661035,0.0011303796,0.0000316609,0.000029013665],"category_scores_gemma":[0.000060845457,0.0000865386,0.0005757122,0.0013284041,0.0014406771,0.00019506614,0.00006327904,0.00023681344,0.00000677658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006763043,0.001969755,0.00014299933,0.0004609983,0.0004962309,0.0000012892908,0.0117783435,0.024667162,0.02823952,0.91664135,0.000076326105,0.015458384],"study_design_scores_gemma":[0.0004437986,0.00019645499,0.0007715948,0.000056044544,0.00003408862,0.00001064447,0.00081198197,0.008561407,0.046056062,0.9428862,0.000016902748,0.00015481781],"about_ca_topic_score_codex":0.000028250375,"about_ca_topic_score_gemma":0.0000018709449,"teacher_disagreement_score":0.58814174,"about_ca_system_score_codex":0.000051922183,"about_ca_system_score_gemma":0.000083321174,"threshold_uncertainty_score":0.53082347},"labels":[],"label_agreement":null},{"id":"W187710645","doi":"","title":"Distance Independent Domination In Iterated Line Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Iterated function; Combinatorics; Line (geometry); Geometry; Mathematical analysis","score_opus":0.009569804928416695,"score_gpt":0.2630987710915827,"score_spread":0.253528966163166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187710645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95107496,0.00034174148,0.043091364,0.00045934296,0.001032882,0.00038015217,0.0000025687998,0.00020747741,0.0034095324],"genre_scores_gemma":[0.99794704,0.000010738684,0.0015950748,0.000039734758,0.0000047199524,0.00003776911,0.000009951423,0.0000118022945,0.00034316996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983225,0.00015065141,0.00029204643,0.00041958404,0.0004361174,0.00037912597],"domain_scores_gemma":[0.9990528,0.00013166142,0.000082984676,0.00052462047,0.00014546381,0.000062429914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000528606,0.00014409327,0.00016387869,0.0003277297,0.00008910923,0.00012512923,0.0007903303,0.00007232091,0.000008136329],"category_scores_gemma":[0.000055505898,0.0001467136,0.00004511564,0.001593432,0.00006574534,0.0006742813,0.00018151505,0.00025742903,0.00003521581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017295572,0.00016584457,0.006583159,0.000006125309,0.000002795539,0.000049593495,0.00007898549,0.00017509106,0.0011182519,0.9896618,0.00012142026,0.002019608],"study_design_scores_gemma":[0.0011291746,0.00006106353,0.020131825,0.000020977699,8.951157e-7,0.00000425579,0.000006588432,0.007378745,0.004596321,0.9661143,0.00038981126,0.00016604332],"about_ca_topic_score_codex":0.0000635519,"about_ca_topic_score_gemma":0.00007261817,"teacher_disagreement_score":0.0468721,"about_ca_system_score_codex":0.00012080264,"about_ca_system_score_gemma":0.000039746723,"threshold_uncertainty_score":0.5982807},"labels":[],"label_agreement":null},{"id":"W1878158968","doi":"10.37236/689","title":"A New Upper Bound on the Global Defensive Alliance Number in Trees","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Alliance; Vertex (graph theory); Graph; Tree (set theory); Order (exchange); Dominating set; Discrete mathematics; Geography","score_opus":0.02319584475108637,"score_gpt":0.2794500783205623,"score_spread":0.2562542335694759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878158968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7403447,0.005777708,0.2260836,0.008867888,0.0010701611,0.0005208097,9.3717955e-7,0.00005019349,0.017283995],"genre_scores_gemma":[0.9985897,0.00045503216,0.00022923668,0.0003350775,0.000046140773,0.000002887669,4.027321e-8,0.000009986926,0.00033193175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778825,0.00035937343,0.00032221002,0.00016853036,0.00062136864,0.0007402414],"domain_scores_gemma":[0.99843144,0.00040024542,0.00025721232,0.00059403275,0.00021193703,0.000105136096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014477506,0.0001608819,0.00021211988,0.000048879854,0.00014575174,0.00007518162,0.0025667262,0.00005184405,0.000031715626],"category_scores_gemma":[0.00019364875,0.00008912318,0.00013182631,0.0010937745,0.00010736636,0.0003407628,0.00017329265,0.0009948029,0.00005475127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009741267,0.00007958349,0.0019441305,9.824353e-7,0.000037048794,0.000025872,0.00067141646,0.000024514055,0.000012668407,0.99526125,0.0004924225,0.0013526862],"study_design_scores_gemma":[0.0005551201,0.00044270634,0.0036170734,0.000026502319,0.0000067924434,0.00020983958,0.000108831504,0.0001185097,0.00060615706,0.99233735,0.001869207,0.00010192215],"about_ca_topic_score_codex":0.000022780043,"about_ca_topic_score_gemma":0.00005362155,"teacher_disagreement_score":0.25824496,"about_ca_system_score_codex":0.0005282087,"about_ca_system_score_gemma":0.00074204203,"threshold_uncertainty_score":0.47696587},"labels":[],"label_agreement":null},{"id":"W1878337849","doi":"","title":"A note on equimatchable graphs","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Matching (statistics); Cardinality (data modeling); Discrete mathematics; Computer science","score_opus":0.0199512579187382,"score_gpt":0.3179064146089651,"score_spread":0.29795515669022693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878337849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04411822,0.000006562875,0.7993236,0.0019719403,0.00058628083,0.00017131139,8.4810887e-7,0.0004721624,0.15334907],"genre_scores_gemma":[0.84878135,0.000002244745,0.14706978,0.00069314253,0.000026898844,0.000015416888,3.1186096e-7,0.000008524528,0.003402315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990042,0.00002443528,0.00008313835,0.0002869611,0.00027533213,0.00032594256],"domain_scores_gemma":[0.99884516,0.0001580814,0.00001837712,0.0008118545,0.000050741455,0.00011578819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031942863,0.00008063708,0.00007413952,0.00014853543,0.00010401458,0.00008665705,0.0010138096,0.000041619525,0.00015081822],"category_scores_gemma":[0.00006534534,0.00006310235,0.00004670299,0.00045819284,0.00006870204,0.00033596338,0.00024175819,0.00030961353,0.00072818506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043656078,0.000027342636,0.000050152958,0.0000014085767,0.0000015222574,0.000006829069,0.00004961532,0.00000967144,0.024217749,0.95770794,0.00041521166,0.017508185],"study_design_scores_gemma":[0.0002171997,0.00011993978,0.0002559693,0.0000032777164,4.3858896e-7,0.000010828208,0.000004885457,0.009629975,0.043731607,0.93327713,0.012600098,0.0001486645],"about_ca_topic_score_codex":0.000008863958,"about_ca_topic_score_gemma":0.000025505706,"teacher_disagreement_score":0.8046631,"about_ca_system_score_codex":0.0000061994583,"about_ca_system_score_gemma":0.00002731137,"threshold_uncertainty_score":0.93595886},"labels":[],"label_agreement":null},{"id":"W189131776","doi":"","title":"Constrained switchings in cubic graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.009523332103955083,"score_gpt":0.255686903082417,"score_spread":0.2461635709784619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189131776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97980446,0.00018802266,0.0057990053,0.0005670652,0.00079420576,0.00026067765,0.0000012096122,0.00026013784,0.012325202],"genre_scores_gemma":[0.9962819,0.0000057311872,0.003402457,0.000084717605,0.0000036670974,0.000022414923,0.000002130001,0.0000125342485,0.00018442712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835575,0.00011738839,0.00026291521,0.0004184365,0.0003468256,0.00049871724],"domain_scores_gemma":[0.9989931,0.00020297283,0.00006342341,0.00058752974,0.00006907009,0.00008391687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005238506,0.00015353083,0.0001906503,0.00033806864,0.000100825804,0.00009857515,0.0010205797,0.000067446774,0.000013075898],"category_scores_gemma":[0.00005814987,0.00015644896,0.00006727626,0.001257404,0.00013569363,0.0005212781,0.00022745531,0.000293978,0.000065057546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056628596,0.00009536062,0.007008821,0.0000049428704,0.0000033701183,0.000058981826,0.00008033395,0.000027480472,0.0018506425,0.98891246,0.0002689465,0.0016829865],"study_design_scores_gemma":[0.0009015728,0.00005279574,0.008078026,0.000014905839,9.2311365e-7,0.000012091538,0.000012408155,0.0013998857,0.0022753594,0.9866634,0.0004110945,0.00017751333],"about_ca_topic_score_codex":0.000119543874,"about_ca_topic_score_gemma":0.000026768656,"teacher_disagreement_score":0.016477447,"about_ca_system_score_codex":0.000058959806,"about_ca_system_score_gemma":0.00006677556,"threshold_uncertainty_score":0.6379804},"labels":[],"label_agreement":null},{"id":"W1897354905","doi":"10.37236/4419","title":"On Maltsev Digraphs","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Combinatorics; Constraint satisfaction problem; Time complexity; Discrete mathematics; Disjoint sets; Semilattice; Directed graph; Homomorphism; Series (stratigraphy)","score_opus":0.01895759023653225,"score_gpt":0.2791022268054558,"score_spread":0.26014463656892356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897354905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1886577,0.006361288,0.7892704,0.0056449506,0.0015375867,0.0002340098,3.426366e-7,0.00007872181,0.008215019],"genre_scores_gemma":[0.9991192,0.00019298367,0.00009052079,0.00016671585,0.00004931918,0.0000017018158,7.497284e-8,0.000011076841,0.0003683899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978065,0.000279271,0.0002798819,0.00012522185,0.00088951434,0.00061959994],"domain_scores_gemma":[0.998299,0.00039950915,0.00025405534,0.0005617483,0.0003019834,0.00018367765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027088053,0.0001230827,0.00018700302,0.0002132143,0.00011094892,0.00007743164,0.0022931015,0.000039706298,0.0000020131151],"category_scores_gemma":[0.00031638623,0.000076725504,0.00011623336,0.00097307994,0.00007987419,0.00037386426,0.000142646,0.00095815706,0.000029272429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063274885,0.0000862876,0.000041444368,0.0000011042044,0.00002898841,0.000016949672,0.00020225439,0.00016938345,0.000025512696,0.99628127,0.0011121157,0.0019714262],"study_design_scores_gemma":[0.00076112594,0.0015692813,0.00003694106,0.00000993707,0.0000057054217,0.00020567571,0.00004372322,0.0004457635,0.0007937354,0.9888464,0.0071951174,0.00008658195],"about_ca_topic_score_codex":0.0000010369716,"about_ca_topic_score_gemma":6.804075e-7,"teacher_disagreement_score":0.8104615,"about_ca_system_score_codex":0.00029431193,"about_ca_system_score_gemma":0.0006346838,"threshold_uncertainty_score":0.42611912},"labels":[],"label_agreement":null},{"id":"W1899569194","doi":"10.1016/j.jctb.2016.02.002","title":"Packing Steiner trees","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Steiner tree problem; Conjecture; Mathematics; Disjoint sets; Graph; Spanning tree; Tree (set theory); Discrete mathematics","score_opus":0.014121268360480495,"score_gpt":0.269411629229777,"score_spread":0.2552903608692965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899569194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17669007,0.001057926,0.7880268,0.0053619943,0.018923473,0.00027834787,0.0000050280923,0.00019639317,0.009459974],"genre_scores_gemma":[0.9942822,0.00008952406,0.0036822439,0.000053234482,0.0006613324,0.0000021462806,5.860648e-8,0.000017271814,0.0012120205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978988,0.00050687237,0.00046037746,0.00017347779,0.00061560265,0.00034485038],"domain_scores_gemma":[0.9976058,0.0008677697,0.0003826274,0.0004953461,0.00046935005,0.0001791355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022343248,0.00015642638,0.00030862435,0.00023996411,0.00012927632,0.00011618832,0.0014763322,0.000068682566,0.00008427077],"category_scores_gemma":[0.00080374663,0.0000914291,0.00017538163,0.0003768997,0.00023282431,0.0023677482,0.00027495553,0.00021864893,0.000021327469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043864152,0.00004951381,0.00015409516,0.0000032736386,0.000044165816,0.00006994397,0.00018960387,0.000003537217,0.012595172,0.9552502,0.00027272495,0.030929137],"study_design_scores_gemma":[0.001274006,0.00069781044,0.00017493987,0.00007339804,0.00000584784,0.00014974526,0.000060536247,0.000002744722,0.02449643,0.95168716,0.021239093,0.00013826943],"about_ca_topic_score_codex":2.4105879e-7,"about_ca_topic_score_gemma":3.1998172e-7,"teacher_disagreement_score":0.8175921,"about_ca_system_score_codex":0.00007695312,"about_ca_system_score_gemma":0.00013258558,"threshold_uncertainty_score":0.37283707},"labels":[],"label_agreement":null},{"id":"W1911143988","doi":"10.1093/comjnl/bxv039","title":"Narrowing the Complexity Gap for Colouring (<i>C<sub>s</sub>, P<sub>t</sub></i>)-Free Graphs","year":2015,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Library science; Computer science; Media studies; Sociology","score_opus":0.09799493135422839,"score_gpt":0.30158093558384713,"score_spread":0.20358600422961876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1911143988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3171371,0.00044672313,0.6725615,0.007140261,0.00176656,0.00060133956,0.000008287363,0.0001779424,0.00016028996],"genre_scores_gemma":[0.94910306,0.00008677718,0.046889637,0.0021828245,0.0015825583,0.00006203954,0.0000028820577,0.00007630826,0.00001394575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487853,0.0011187937,0.0007193545,0.00063207175,0.0013248533,0.0013263874],"domain_scores_gemma":[0.99513644,0.0011682464,0.00044238416,0.0019208075,0.00073366566,0.00059843797],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00600085,0.00045737508,0.00048444388,0.00031981873,0.0020957391,0.001147821,0.006902678,0.000113849965,0.0000020846567],"category_scores_gemma":[0.00025852278,0.0002930718,0.00048017086,0.0010042324,0.0008088706,0.0011225981,0.0024173183,0.0014797968,0.000050153776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007149627,0.00051679445,0.0006997654,0.00010395923,0.0007857403,0.00039209452,0.011909429,0.022113949,0.09587763,0.52773714,0.08786553,0.251283],"study_design_scores_gemma":[0.0022304133,0.00045439083,0.0009105555,0.00010172623,0.00003232409,0.0016277767,0.0001571959,0.08433868,0.042977598,0.8648075,0.0018666227,0.00049522077],"about_ca_topic_score_codex":0.0000029506887,"about_ca_topic_score_gemma":0.000018137516,"teacher_disagreement_score":0.63196594,"about_ca_system_score_codex":0.00020782242,"about_ca_system_score_gemma":0.00031996612,"threshold_uncertainty_score":0.99995214},"labels":[],"label_agreement":null},{"id":"W1911800350","doi":"10.2298/fil1601169a","title":"On the domination polynomials of friendship graphs","year":2016,"lang":"en","type":"preprint","venue":"Filomat","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Limiting; Order (exchange)","score_opus":0.03332738700759024,"score_gpt":0.3040263962590281,"score_spread":0.27069900925143786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1911800350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2663106,0.00046625908,0.594036,0.01505462,0.0034891737,0.0027002143,0.00034358524,0.0005497047,0.11704983],"genre_scores_gemma":[0.9966018,0.000023458913,0.0027622767,0.00012077318,0.00005300895,0.00010624303,0.0000050614062,0.000017122265,0.0003102149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979466,0.00037497995,0.00030880325,0.0005055882,0.0005671191,0.00029686332],"domain_scores_gemma":[0.9961285,0.0015094496,0.00031151055,0.0018333496,0.0001534206,0.000063748106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010801768,0.00020556655,0.00026865868,0.00030224156,0.00010226884,0.0000806319,0.0025212052,0.00015994292,0.0001420845],"category_scores_gemma":[0.00048413945,0.00011934619,0.00018643032,0.00027534016,0.000194926,0.00014486557,0.0015174424,0.00036448796,0.00012801363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002477912,0.000028388504,0.00002962416,0.000031300657,0.000023541765,0.0000031941138,0.00018766361,0.0000207549,0.0013734443,0.98955655,0.0014029063,0.007317868],"study_design_scores_gemma":[0.00015033555,0.000056695397,0.0006814236,0.00015285371,0.0000031919387,0.0000019874503,0.000007331628,0.00036631126,0.025589505,0.97246695,0.00038071204,0.0001427245],"about_ca_topic_score_codex":0.0000046583546,"about_ca_topic_score_gemma":0.0000011502514,"teacher_disagreement_score":0.73029125,"about_ca_system_score_codex":0.000051205858,"about_ca_system_score_gemma":0.000089712354,"threshold_uncertainty_score":0.4866796},"labels":[],"label_agreement":null},{"id":"W1913504200","doi":"10.1002/jgt.21791","title":"Chasing a Fast Robber on Planar Graphs and Random Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israeli Centers for Research Excellence; Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Mathematics; Combinatorics; Treewidth; Planar graph; Vertex (graph theory); Discrete mathematics; Graph; Constant (computer programming); Pathwidth; Line graph; Computer science","score_opus":0.01250663770375848,"score_gpt":0.2608837992795954,"score_spread":0.2483771615758369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913504200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.319178,0.001412588,0.6729334,0.00089376705,0.00078093493,0.00025355304,0.0000034260347,0.00009981919,0.0044445437],"genre_scores_gemma":[0.9899546,0.0002755476,0.008969414,0.00059046515,0.000074011914,0.0000039489455,3.9832855e-7,0.000026994981,0.00010462722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704427,0.00093294354,0.00053020695,0.00033762003,0.0006771782,0.00047781048],"domain_scores_gemma":[0.99703,0.0014442791,0.00043530163,0.0005590862,0.00020940861,0.00032189663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045403866,0.00025754614,0.0004779752,0.0012935296,0.0002966063,0.00017399632,0.0010802645,0.00009318999,0.000013972554],"category_scores_gemma":[0.00035554767,0.00019375491,0.0003220569,0.00083575066,0.00038946205,0.0007011428,0.00011202585,0.0006527264,0.0000086528125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071563094,0.00008234575,0.0004639476,0.000015583686,0.00009452089,0.00005147685,0.0005498093,0.000084212916,0.0019413668,0.939418,0.00017538102,0.056407712],"study_design_scores_gemma":[0.0025287636,0.00072360755,0.0012907829,0.00013555735,0.00001996109,0.0003822936,0.00011569719,0.00035364938,0.0010987784,0.99221206,0.00091551786,0.00022331235],"about_ca_topic_score_codex":0.00000127971,"about_ca_topic_score_gemma":0.0000016345845,"teacher_disagreement_score":0.6707766,"about_ca_system_score_codex":0.000020255377,"about_ca_system_score_gemma":0.000039030467,"threshold_uncertainty_score":0.79010963},"labels":[],"label_agreement":null},{"id":"W191581831","doi":"","title":"Triangle-Free Regular Graphs as an Extremal Family.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023373265250316945,"score_gpt":0.2794175054579152,"score_spread":0.25604424020759825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191581831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9501643,0.00091052765,0.010297726,0.00035827074,0.0030609886,0.00060985185,0.000003511794,0.0006375016,0.033957288],"genre_scores_gemma":[0.9864304,0.000031488875,0.012142482,0.00025429946,0.000007636458,0.000048251986,0.0000030534334,0.00003897628,0.0010433908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967617,0.000652362,0.0003196182,0.00077587366,0.00075981405,0.0007306627],"domain_scores_gemma":[0.996303,0.00023733804,0.000101915495,0.0027728716,0.00019861906,0.00038621298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013126355,0.00026542065,0.00031695323,0.00031659607,0.00030521033,0.00020299289,0.002734118,0.000131673,0.000044430348],"category_scores_gemma":[0.0006048121,0.00026610662,0.00015478804,0.0014317996,0.00018266552,0.0011666882,0.0003726104,0.00034472937,0.00017713106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022434897,0.0001836829,0.000417453,0.0000053237454,0.000019115017,0.00009559724,0.00017655788,0.0000050396693,0.0017022094,0.99328476,0.00092729705,0.0031605286],"study_design_scores_gemma":[0.0019177152,0.00038235186,0.00061273784,0.000011756748,0.0000051087923,0.000035228433,0.00007998471,0.00028677276,0.005988502,0.9839742,0.006386036,0.00031959263],"about_ca_topic_score_codex":0.000014790891,"about_ca_topic_score_gemma":0.0000030856058,"teacher_disagreement_score":0.036266085,"about_ca_system_score_codex":0.000065850974,"about_ca_system_score_gemma":0.00016411301,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W1916472382","doi":"10.37236/449","title":"Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Canada Research Chairs; University of Melbourne; Macquarie University","keywords":"Combinatorics; Mathematics; Heuristics; Bounding overwatch; Maximal independent set; Cubic graph; Vertex (graph theory); Greedy algorithm; Discrete mathematics; Graph; Chordal graph; Algorithm; Computer science; 1-planar graph; Line graph; Mathematical optimization","score_opus":0.009681412868531011,"score_gpt":0.2806493101126358,"score_spread":0.27096789724410475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916472382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8369772,0.0018210191,0.15898377,0.0014607899,0.00035588475,0.00028036343,7.7892986e-7,0.000021759743,0.00009846288],"genre_scores_gemma":[0.99888045,0.00034132766,0.0006417098,0.00004093584,0.000035618174,0.0000047464678,1.9550635e-7,0.00001103189,0.000043985092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769,0.00038626537,0.00046023953,0.00017797109,0.00068745564,0.000598025],"domain_scores_gemma":[0.9970473,0.0011711569,0.0005312,0.0007159086,0.000429063,0.00010538768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053407555,0.00015917377,0.00041748915,0.00054566824,0.00031057445,0.00008156255,0.0015369358,0.00006134694,0.0000030726967],"category_scores_gemma":[0.00024580787,0.00008400839,0.00029625997,0.00320982,0.0004737219,0.00023723027,0.00021134614,0.0016777552,8.978349e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010216549,0.0001081526,0.00024933525,0.000003972634,0.0005431474,0.00005244702,0.00053328223,0.00017251875,0.0001252342,0.9851881,0.000004674267,0.012916918],"study_design_scores_gemma":[0.0015220436,0.00079628435,0.00021394432,0.000010734932,0.0003532639,0.0010379918,0.00014359063,0.022449642,0.0009747736,0.97197163,0.00040053297,0.00012555688],"about_ca_topic_score_codex":0.0000137125835,"about_ca_topic_score_gemma":0.000021392263,"teacher_disagreement_score":0.16190328,"about_ca_system_score_codex":0.000049531416,"about_ca_system_score_gemma":0.00018783662,"threshold_uncertainty_score":0.72891045},"labels":[],"label_agreement":null},{"id":"W1917899534","doi":"10.1007/s10878-015-9947-x","title":"Reconfiguration of dominating sets","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Connected dominating set; Graph; Domination analysis; Control reconfiguration; Discrete mathematics; Adjacency list; Computer science","score_opus":0.02884581217723134,"score_gpt":0.30399583347759573,"score_spread":0.27515002130036437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917899534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077879103,0.0000780013,0.98769766,0.0002606885,0.0025677949,0.00009148865,3.8978757e-7,0.0000135009295,0.0015025942],"genre_scores_gemma":[0.6868042,0.000017377864,0.31300506,0.000011698158,0.00013535048,0.0000010122128,0.0000010523624,0.0000072329303,0.000017053386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853015,0.00020813517,0.0005061911,0.00008766549,0.00055425783,0.00011358394],"domain_scores_gemma":[0.9972365,0.0001527192,0.00072886626,0.00017925768,0.0015916253,0.00011105305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547856,0.00006976878,0.00019423588,0.00024984707,0.000037436173,0.000055727778,0.00046633644,0.000054948927,0.0000060836123],"category_scores_gemma":[0.0010028018,0.000063160114,0.000059544018,0.0005057614,0.00003286919,0.0012843178,0.000056891946,0.00014371758,0.0000014744998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002543993,0.00019117579,0.0002167449,0.000018366998,0.00003602986,0.000014706199,0.001332274,0.6529474,0.0014237683,0.3280293,0.0005440103,0.014991797],"study_design_scores_gemma":[0.0051985793,0.0015848797,0.00008433179,0.00011062003,0.000017935166,0.000103168524,0.0001923902,0.57656926,0.026683766,0.38880596,0.0004334279,0.00021567727],"about_ca_topic_score_codex":0.0000012384907,"about_ca_topic_score_gemma":4.7534964e-8,"teacher_disagreement_score":0.67901623,"about_ca_system_score_codex":0.000078941586,"about_ca_system_score_gemma":0.00022149821,"threshold_uncertainty_score":0.25755948},"labels":[],"label_agreement":null},{"id":"W191955849","doi":"","title":"On the Domination Number of the Product of Two Cycles.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Arithmetic; Geometry","score_opus":0.015502352550200691,"score_gpt":0.3097720243543911,"score_spread":0.2942696718041904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191955849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888366,0.000024042001,0.0023379857,0.00071519363,0.00077134214,0.0002956658,7.680744e-7,0.000020784772,0.0069976086],"genre_scores_gemma":[0.999129,0.000002032891,0.0006414441,0.000051358045,0.0000047292597,0.0000057559987,1.6498778e-7,0.000006518702,0.0001589769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987314,0.00016455646,0.0002056606,0.00019316294,0.0005071148,0.00019814515],"domain_scores_gemma":[0.9979652,0.0006920111,0.00015056062,0.0009708691,0.00019310546,0.000028247303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016554866,0.00007876843,0.00010607165,0.000049871753,0.000098329365,0.000013763573,0.0012503662,0.000021580716,0.000012494631],"category_scores_gemma":[0.00036266076,0.000045199387,0.00006630583,0.00078408094,0.00021274027,0.00014321393,0.00026499157,0.00017349551,0.000016016096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001356237,0.00008327504,0.0028560124,0.000005683392,0.000007814693,7.3487024e-7,0.00024126576,0.000014812571,0.0027822307,0.99024373,0.00017413107,0.003576715],"study_design_scores_gemma":[0.00029275805,0.000027222904,0.011327818,0.000017952849,0.0000017808846,0.0000024385934,0.00001536258,0.00015879706,0.14527854,0.8427617,0.00007034827,0.00004529513],"about_ca_topic_score_codex":0.000012247571,"about_ca_topic_score_gemma":0.0000028903341,"teacher_disagreement_score":0.14748208,"about_ca_system_score_codex":0.00003238864,"about_ca_system_score_gemma":0.00003955031,"threshold_uncertainty_score":0.23235124},"labels":[],"label_agreement":null},{"id":"W1924533234","doi":"10.37236/1778","title":"Decomposing Infinite 2-Connected Graphs into 3-Connected Components","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Modular decomposition; Planar graph; Chordal graph; Connected component; Indifference graph; 1-planar graph; Pathwidth; Strongly connected component; Discrete mathematics; Clique-sum; Graph; Line graph","score_opus":0.011773604596896615,"score_gpt":0.26508313271587697,"score_spread":0.25330952811898033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924533234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6356875,0.0021255875,0.35957086,0.0016543177,0.00053955143,0.00017163718,2.779378e-7,0.000078349636,0.00017193521],"genre_scores_gemma":[0.9983691,0.00040807927,0.0009578814,0.00016665256,0.000045615197,0.0000036819363,0.0000010540934,0.000027615104,0.000020339154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670887,0.00040993257,0.00068234635,0.00026005236,0.0009112692,0.0010275388],"domain_scores_gemma":[0.9971504,0.00063486176,0.0005857544,0.0007405663,0.00068526017,0.00020311233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019094208,0.00026791624,0.0004095145,0.0005234179,0.0004798771,0.0001784214,0.0030227876,0.0000919426,0.000004109983],"category_scores_gemma":[0.00030348828,0.00019704178,0.00023063856,0.0023051642,0.00018349294,0.00081787235,0.00032759868,0.0015077192,0.00001902292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008333065,0.00018886635,0.00013142942,0.000007875755,0.00012138962,0.000037475464,0.0006952454,0.0010171521,0.009497493,0.987064,0.000016363278,0.0011394001],"study_design_scores_gemma":[0.0022596512,0.00077757216,0.00052385434,0.000059114212,0.000022208356,0.00047469087,0.00005578482,0.000684202,0.011506097,0.98278064,0.0006350605,0.00022113581],"about_ca_topic_score_codex":0.0000191957,"about_ca_topic_score_gemma":0.000010285164,"teacher_disagreement_score":0.3626816,"about_ca_system_score_codex":0.00067004666,"about_ca_system_score_gemma":0.0007061109,"threshold_uncertainty_score":0.8035131},"labels":[],"label_agreement":null},{"id":"W1924742230","doi":"10.1007/s00493-015-3003-4","title":"Regular families of forests, antichains and duality pairs of relational structures","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Antichain; Mathematics; Homomorphism; Duality (order theory); Combinatorics; Constraint (computer-aided design); Constraint satisfaction problem; Discrete mathematics; Partially ordered set; Geometry","score_opus":0.020806861208372263,"score_gpt":0.2683903031659259,"score_spread":0.2475834419575536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924742230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82757556,0.00060108537,0.17036602,0.0005613302,0.00014455683,0.00015480694,0.000014068604,0.000049851235,0.0005327041],"genre_scores_gemma":[0.9943465,0.00006539734,0.0054771146,0.0000058315754,0.0000049784117,0.0000028702402,5.200342e-7,0.000004727379,0.00009208551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899983,0.000108501954,0.0002045594,0.00021003545,0.00032395605,0.00015312214],"domain_scores_gemma":[0.998782,0.00042323454,0.00011180176,0.00045538283,0.00016945747,0.000058152913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031552368,0.000077585144,0.00016647218,0.00011951039,0.000053796695,0.0000062727386,0.00038521015,0.00004428581,0.000005374415],"category_scores_gemma":[0.000286993,0.000053510223,0.00003866408,0.0003241241,0.0003225184,0.00022729531,0.00027265967,0.000054236436,7.661529e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010207344,0.000026723872,0.0415653,0.000024480227,0.000011683691,0.0000014242582,0.00012979413,0.000002417869,0.0026061612,0.95048827,0.00006425743,0.0050692772],"study_design_scores_gemma":[0.0003780144,0.000097468954,0.15523465,0.00002071741,0.0000020115924,0.0000026578025,0.000013321554,0.00020362168,0.013344208,0.8302829,0.0003545799,0.00006579424],"about_ca_topic_score_codex":0.0000054516145,"about_ca_topic_score_gemma":0.000001387328,"teacher_disagreement_score":0.16677089,"about_ca_system_score_codex":0.000019482395,"about_ca_system_score_gemma":0.000042622105,"threshold_uncertainty_score":0.21820836},"labels":[],"label_agreement":null},{"id":"W1927157310","doi":"10.1109/ipps.1992.223066","title":"Efficient parallel shortest path algorithms for k-chordal graphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Shortest path problem; Chordal graph; Product (mathematics); Combinatorics; Path (computing); Longest path problem; Parallel algorithm; Computer science; Binary logarithm; K shortest path routing; Algorithm; Floyd–Warshall algorithm; Mathematics; Discrete mathematics; Graph","score_opus":0.03269908696444551,"score_gpt":0.3084834023234436,"score_spread":0.2757843153589981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927157310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040558265,0.0001283762,0.98753595,0.00016320066,0.00024058994,0.0005193048,0.000004177253,0.0002026756,0.0071499133],"genre_scores_gemma":[0.36178255,0.000008912457,0.6367929,0.00020561408,0.000018883786,0.00014631763,0.0000019780953,0.00001696546,0.0010258853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816304,0.0000895581,0.00020981807,0.00054949435,0.0003723408,0.0006157276],"domain_scores_gemma":[0.99859893,0.00031002884,0.000038434235,0.0007041248,0.00014887609,0.0001996251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000737329,0.0001654109,0.0001635023,0.00015861585,0.00021138394,0.00010387443,0.0008184858,0.000052709904,0.000036966387],"category_scores_gemma":[0.00015271429,0.00013656968,0.00013398999,0.0006128208,0.00009580798,0.00012431006,0.00011457287,0.00013145129,0.000048518556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000703112,0.00010854238,0.00017559556,0.0000034498416,0.00001035752,0.000007604244,0.0000792594,0.004049369,0.0002565467,0.98615056,0.00037338072,0.00877833],"study_design_scores_gemma":[0.0012249881,0.00040953455,0.00042189882,0.000010183989,0.000005276816,0.00003970846,0.00009467425,0.45116523,0.0028788566,0.5296996,0.013531738,0.00051832886],"about_ca_topic_score_codex":0.0000034292218,"about_ca_topic_score_gemma":0.00000275296,"teacher_disagreement_score":0.45645094,"about_ca_system_score_codex":0.000028654047,"about_ca_system_score_gemma":0.00006672472,"threshold_uncertainty_score":0.556915},"labels":[],"label_agreement":null},{"id":"W1928499748","doi":"10.1016/j.jctb.2016.07.008","title":"Non-planar extensions of subdivisions of planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Security Agency; National Science Foundation","keywords":"Combinatorics; Mathematics; Planar graph; Subdivision; Graph; Backslash; Planar; Lemma (botany); Discrete mathematics; Computer science","score_opus":0.013822217486434706,"score_gpt":0.27120107243894753,"score_spread":0.25737885495251284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928499748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6923187,0.00083134515,0.2909951,0.0017998824,0.010320238,0.00048200955,0.00006717358,0.00006848725,0.0031170957],"genre_scores_gemma":[0.9934606,0.00022464283,0.0060002916,0.000021282836,0.0001082231,0.0000019371087,3.5086387e-7,0.000016640333,0.00016600733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973908,0.0003987547,0.0008735897,0.00019825486,0.00080318365,0.00033540162],"domain_scores_gemma":[0.995803,0.0013824928,0.00087830843,0.0007345764,0.0009804948,0.00022115425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022415102,0.00018556259,0.000597007,0.0005223614,0.00012164854,0.000022344493,0.0016750024,0.00010218342,0.000050209186],"category_scores_gemma":[0.0007913983,0.00011852587,0.00030091044,0.00069669477,0.0005589234,0.0011163572,0.00017612692,0.00026140545,0.00000540603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007897959,0.00016659127,0.0004073773,0.000016896973,0.000087722794,0.000045800232,0.00028620224,0.0000033432452,0.05710806,0.9382576,0.00049318146,0.0023374658],"study_design_scores_gemma":[0.0013887918,0.0013771504,0.0010167487,0.0002085693,0.000018100644,0.000104368075,0.00013095517,0.0000034774234,0.05615158,0.9381563,0.0013109349,0.0001330381],"about_ca_topic_score_codex":0.0000021660903,"about_ca_topic_score_gemma":6.659472e-7,"teacher_disagreement_score":0.30114195,"about_ca_system_score_codex":0.000033541775,"about_ca_system_score_gemma":0.00022653963,"threshold_uncertainty_score":0.48333448},"labels":[],"label_agreement":null},{"id":"W1930792227","doi":"10.1002/jgt.21711","title":"Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Arboricity; Multigraph; Mathematics; Combinatorics; Degree (music); Conjecture; Dense graph; Planar graph; Bounded function; Graph; Discrete mathematics; Tree decomposition; Pathwidth; 1-planar graph; Chordal graph; Line graph","score_opus":0.01759353469542376,"score_gpt":0.2805384940187399,"score_spread":0.2629449593233162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930792227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7111957,0.0008693216,0.28717858,0.0001939286,0.00008747351,0.0001962823,7.942747e-7,0.000020021005,0.0002578807],"genre_scores_gemma":[0.9415484,0.00015202326,0.05815819,0.0000764834,0.000020660773,0.000009624964,4.122523e-7,0.000016893699,0.000017276234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978836,0.00039535327,0.0005341579,0.00024771172,0.00059674925,0.0003424166],"domain_scores_gemma":[0.9975763,0.0004732669,0.00057859404,0.00048598507,0.0006185013,0.00026737936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014608144,0.00020713125,0.0003905081,0.0011080161,0.00016873474,0.00012832475,0.0009195047,0.00007489444,0.000020248908],"category_scores_gemma":[0.00007785499,0.0001468662,0.00019126265,0.0010297038,0.0006911968,0.0015068584,0.00015949759,0.00036427495,0.0000035721164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057444675,0.00021309871,0.014418648,0.00007074006,0.0002516951,0.00007566465,0.0012259042,0.00006909024,0.0103544975,0.9355187,0.00013573836,0.037091803],"study_design_scores_gemma":[0.0009839339,0.0010477421,0.03125157,0.0001411356,0.000025237572,0.00045039598,0.00016806145,0.00014623649,0.004793189,0.9608077,0.000019013343,0.00016581565],"about_ca_topic_score_codex":0.00001719152,"about_ca_topic_score_gemma":0.00003282943,"teacher_disagreement_score":0.2303527,"about_ca_system_score_codex":0.000023237744,"about_ca_system_score_gemma":0.000082692335,"threshold_uncertainty_score":0.59890294},"labels":[],"label_agreement":null},{"id":"W194079889","doi":"","title":"On a-valuations of disconnected graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.025384215024093684,"score_gpt":0.3063423858488823,"score_spread":0.28095817082478863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194079889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97373545,0.000064380605,0.012977798,0.0005022015,0.0007270157,0.00022885457,0.0000021680096,0.00014528478,0.011616851],"genre_scores_gemma":[0.9981731,0.000017461964,0.0015397392,0.000057822665,0.0000015527744,0.000019848192,0.0000023641905,0.0000086925065,0.00017941114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987266,0.0001446677,0.0001870339,0.00027240778,0.00041450246,0.0002547567],"domain_scores_gemma":[0.9985002,0.00041387853,0.00007268521,0.00076594064,0.00016057727,0.00008666433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035104927,0.00010077363,0.00014139427,0.00023482779,0.000110308996,0.000030187384,0.00084491866,0.00003867997,0.000044644126],"category_scores_gemma":[0.00023198678,0.00009348335,0.00006847334,0.0010821285,0.0000987474,0.00029211194,0.00015000683,0.00014321301,0.00007582094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001251887,0.00014224453,0.0011348184,0.0000024654464,0.000012219581,0.000007603119,0.00012717034,0.000062432206,0.00058094447,0.99449986,0.00020646067,0.003211276],"study_design_scores_gemma":[0.00052281556,0.00020628446,0.0038366911,0.000013084457,0.000002380053,0.0000041976346,0.0000126807445,0.0019399722,0.0021644828,0.99100536,0.00019222702,0.0000998242],"about_ca_topic_score_codex":0.000007365732,"about_ca_topic_score_gemma":0.000002543332,"teacher_disagreement_score":0.02443766,"about_ca_system_score_codex":0.000025768228,"about_ca_system_score_gemma":0.00004618225,"threshold_uncertainty_score":0.38121402},"labels":[],"label_agreement":null},{"id":"W194283047","doi":"","title":"Polynomial Algorithm for Finding Chromatic Sum for Unicyclic and Outerplanar Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Chromatic polynomial; Algorithm; Discrete mathematics","score_opus":0.01932628026623991,"score_gpt":0.2964231950449247,"score_spread":0.2770969147786848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194283047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4873937,0.00091161905,0.502728,0.0027924026,0.0026449924,0.0026819739,0.000070597096,0.00044423496,0.00033249045],"genre_scores_gemma":[0.7708381,0.000031799005,0.22814405,0.0002324063,0.00004763698,0.00027759548,0.0000135100545,0.000038759423,0.00037617577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998471,0.000054159944,0.00025199584,0.00046064946,0.00020379292,0.0005583968],"domain_scores_gemma":[0.9985367,0.00063784525,0.00009103376,0.0004886357,0.00008016889,0.0001656111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445261,0.00018370592,0.00024943717,0.00023071052,0.00032306244,0.0001483722,0.000777819,0.000083551735,0.0000023909288],"category_scores_gemma":[0.000093533105,0.00018521231,0.000103270366,0.0003195707,0.00009747417,0.00058033323,0.00020129397,0.00012331746,0.000008130088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002852624,0.00011536864,0.00025523335,0.000055360077,0.00006216088,0.0000039121,0.0004884389,0.000010132858,0.0009957245,0.7925088,0.0053996164,0.20007673],"study_design_scores_gemma":[0.003491335,0.00047215505,0.00046526227,0.00003877971,0.000016295344,0.000022028,0.000037349146,0.13883394,0.005157264,0.8357588,0.015290362,0.00041643195],"about_ca_topic_score_codex":0.00000452065,"about_ca_topic_score_gemma":0.0000044308317,"teacher_disagreement_score":0.28344437,"about_ca_system_score_codex":0.00006811,"about_ca_system_score_gemma":0.000050477498,"threshold_uncertainty_score":0.7552739},"labels":[],"label_agreement":null},{"id":"W1943297633","doi":"10.46298/dmtcs.2080","title":"Diversities and the Geometry of Hypergraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Embedding; Metric (unit); Steiner tree problem; Hypergraph; Combinatorics; Set (abstract data type); Distortion (music); Relation (database); Combinatorial optimization; Discrete mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.010219233834626421,"score_gpt":0.2556408838133856,"score_spread":0.2454216499787592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943297633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042399667,0.000055306158,0.95157707,0.00078122853,0.000120244826,0.00019261074,0.000001608339,0.00006467403,0.00480758],"genre_scores_gemma":[0.7657966,0.000010593173,0.23401715,0.00013458998,0.000021268437,0.0000048617267,1.6140609e-7,0.0000058806536,0.00000890599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997586,0.00020730608,0.00031749747,0.00046930532,0.0009506143,0.00046925351],"domain_scores_gemma":[0.99644136,0.001929131,0.00012513116,0.001119782,0.00020844219,0.00017617716],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003997669,0.0001786702,0.00033786226,0.00026819672,0.00048908766,0.00030117616,0.0030179955,0.00003747272,0.000012643565],"category_scores_gemma":[0.00045305016,0.000104767336,0.00010256708,0.0012784352,0.013426629,0.00049165706,0.0023872491,0.00019406705,0.000010110147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009991206,0.000021809003,0.000030190997,0.000032846925,0.000008094579,8.361201e-7,0.0015215683,0.000039245384,0.00018707066,0.9940584,0.000004936971,0.004085063],"study_design_scores_gemma":[0.00027527256,0.00006705073,0.000060508763,0.000023473604,0.0000053156564,0.000013564467,0.00006915626,0.41988978,0.0007951743,0.5786995,0.000012746207,0.00008840428],"about_ca_topic_score_codex":0.0000018229194,"about_ca_topic_score_gemma":1.7488465e-7,"teacher_disagreement_score":0.7233969,"about_ca_system_score_codex":0.000011200852,"about_ca_system_score_gemma":0.000035279216,"threshold_uncertainty_score":0.9892583},"labels":[],"label_agreement":null},{"id":"W1943774235","doi":"10.1109/icpads.2004.92","title":"Wavelength assignment on bounded degree trees of rings","year":2004,"lang":"en","type":"article","venue":"International Conference on Parallel and Distributed Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Tree (set theory); Wavelength; Node (physics); Bounded function; Time complexity; Upper and lower bounds; Mathematics; Degree (music); Approximation algorithm; Routing (electronic design automation); Network topology; Disjoint sets; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Combinatorics; Computer science; Algorithm; Computer network; Physics; Optics; Telecommunications","score_opus":0.07809195675287456,"score_gpt":0.31608982907265426,"score_spread":0.2379978723197797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943774235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08318784,0.000055363875,0.899853,0.0016911273,0.0004638469,0.00032572722,0.00019214836,0.00008714906,0.0141437985],"genre_scores_gemma":[0.9986699,0.00004508989,0.0008789381,0.00004035365,0.000032179472,0.000042484462,0.000041890657,0.0000056663016,0.00024348067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832594,0.00006920425,0.0003152608,0.00038380674,0.0006747898,0.00023096616],"domain_scores_gemma":[0.99903834,0.00010592387,0.00016132873,0.0003307351,0.00024225148,0.000121445155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002506271,0.00016470432,0.00021265438,0.00014514374,0.000083981744,0.00018142982,0.0007664982,0.0000620935,0.000014787204],"category_scores_gemma":[0.00007181747,0.00013620552,0.000053230906,0.00014283128,0.0001154996,0.00022241488,0.00013629938,0.00015632773,0.000029420276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009309151,0.00013775668,0.0002812882,0.000010499871,0.00004550322,0.000017277069,0.000100474834,0.005169011,0.0005114127,0.9908246,0.000051922078,0.0027571707],"study_design_scores_gemma":[0.008818607,0.002808171,0.029066134,0.0013354034,0.000017907001,0.00013532116,0.0011405908,0.26879156,0.0032458242,0.67879367,0.00458837,0.0012584428],"about_ca_topic_score_codex":0.00008187981,"about_ca_topic_score_gemma":0.000011796445,"teacher_disagreement_score":0.9154821,"about_ca_system_score_codex":0.00012725343,"about_ca_system_score_gemma":0.000088683,"threshold_uncertainty_score":0.55543},"labels":[],"label_agreement":null},{"id":"W194649186","doi":"10.1007/978-3-642-25011-8_24","title":"On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multigraph; Combinatorics; Vertex (graph theory); Planar graph; Graph; Planar; Mathematics; Plane (geometry); Discrete mathematics; Computer science; Geometry","score_opus":0.03404041091732289,"score_gpt":0.2868589059006162,"score_spread":0.2528184949832933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194649186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005486,0.00019718343,0.9927414,0.00037244454,0.00043785022,0.0003503753,0.00001886891,0.00004164561,0.0052916007],"genre_scores_gemma":[0.5452214,0.00010679275,0.4533639,0.00091695896,0.000100617835,0.000022620956,0.0000042044658,0.000054896187,0.00020863193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969144,0.00007193842,0.00051958516,0.00090941833,0.0010641366,0.0005205172],"domain_scores_gemma":[0.99632156,0.001349334,0.00030989666,0.0016292401,0.00028217954,0.00010781352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092781376,0.00036955587,0.0005123205,0.0007073046,0.00021341811,0.000060298284,0.0039007992,0.00019554915,0.000025115894],"category_scores_gemma":[0.00008882083,0.00027194436,0.0001803094,0.0010121557,0.0020016658,0.0003367137,0.00040755997,0.0007867331,0.000017025945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043322772,0.0000991384,0.000029235916,0.000058811704,0.00003424189,0.00003420171,0.0024761197,0.0023402243,0.00043175908,0.87429124,0.000017071983,0.120144606],"study_design_scores_gemma":[0.0003011572,0.00022981763,0.000057188034,0.00047666757,0.000009513759,0.000053191066,8.977729e-7,0.02080176,0.0018157067,0.97589296,0.00007093271,0.0002902013],"about_ca_topic_score_codex":0.000022672055,"about_ca_topic_score_gemma":0.000033001208,"teacher_disagreement_score":0.5446728,"about_ca_system_score_codex":0.00006916152,"about_ca_system_score_gemma":0.00031850606,"threshold_uncertainty_score":0.9999733},"labels":[],"label_agreement":null},{"id":"W1948783854","doi":"10.48550/arxiv.1004.3320","title":"Approximation Algorithms for Dominating Set in Disk Graphs","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Euclidean geometry; Set (abstract data type); Graph; Upper and lower bounds; Approximation algorithm; Unit disk graph; Unit disk; Running time; Discrete mathematics; Algorithm; Computer science; Vertex (graph theory); Geometry","score_opus":0.09476514679204252,"score_gpt":0.2512652688231497,"score_spread":0.1565001220311072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948783854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20109348,0.000018178107,0.7971925,0.00005833151,0.00034943267,0.00074872066,0.000029601699,0.00013082428,0.0003789355],"genre_scores_gemma":[0.9458593,0.00003624836,0.05365255,0.000021370297,0.00003927424,0.0000137846,0.000037779537,0.000021934715,0.0003177488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977933,0.0001690817,0.00023398535,0.0011760719,0.00012590605,0.0005016165],"domain_scores_gemma":[0.9978589,0.00040213446,0.00023953569,0.0011579709,0.00020644952,0.00013502402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090071844,0.00027843736,0.0003176639,0.000713436,0.00017108244,0.0001258486,0.0021722647,0.00034461715,0.000006321085],"category_scores_gemma":[0.00016398396,0.00032678762,0.00020554614,0.00097377785,0.00015942419,0.00061407225,0.0016889677,0.0010417046,0.000012304037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047929316,0.00008845494,0.0011768331,0.00015063844,0.00002937725,0.00007159701,0.00050194946,0.045126,0.00028382486,0.94269216,0.000023555778,0.009807662],"study_design_scores_gemma":[0.00043473492,0.000024382305,0.00026477416,0.000039018236,0.0000064286787,0.000001356281,0.000054257875,0.5081722,0.00034790352,0.4903899,0.00004866162,0.00021638475],"about_ca_topic_score_codex":0.000048446105,"about_ca_topic_score_gemma":0.00007007528,"teacher_disagreement_score":0.7447658,"about_ca_system_score_codex":0.0001502239,"about_ca_system_score_gemma":0.00012649337,"threshold_uncertainty_score":0.9999184},"labels":[],"label_agreement":null},{"id":"W1949878150","doi":"10.1137/1.9781611973730.114","title":"Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Chordal graph; Intersection graph; Split graph; Algorithm; Interval graph; Block graph; Time complexity; Discrete mathematics; Arc (geometry); Mathematics; Graph; Indifference graph; Line graph; 1-planar graph; Geometry","score_opus":0.03502330776170659,"score_gpt":0.2828926462636801,"score_spread":0.2478693385019735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949878150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1998378,0.000049782728,0.799013,0.000101052065,0.00023054608,0.00040798733,0.00006253343,0.00016770078,0.00012959134],"genre_scores_gemma":[0.8540827,0.00016317703,0.1452202,0.00009435785,0.00005307881,0.000038852588,0.0002772728,0.000028193854,0.000042138832],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998081,0.00019778904,0.00034395978,0.0006938333,0.00040824557,0.00027514563],"domain_scores_gemma":[0.9984728,0.000078057245,0.0002843368,0.0007538483,0.00030193655,0.00010902787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038312076,0.00023613419,0.00034132422,0.0004208499,0.00008594684,0.00015607166,0.0007302061,0.0002709566,0.000028204178],"category_scores_gemma":[0.000058260735,0.00022314652,0.00009483296,0.00031120333,0.00010862461,0.00036349634,0.0012262198,0.0004836984,0.0000031909149],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014044924,0.000034084598,0.00034939914,0.0006815639,0.000094473486,0.0000067165975,0.0006994658,0.000029176043,0.122239165,0.012624308,0.000012023224,0.86321557],"study_design_scores_gemma":[0.0003116547,0.000066570916,0.0046854527,0.00021856611,0.000018359764,0.000028216642,0.000013681873,0.13278039,0.033813424,0.82758373,0.00006716498,0.0004128107],"about_ca_topic_score_codex":0.000017498272,"about_ca_topic_score_gemma":0.0000027556787,"teacher_disagreement_score":0.86280274,"about_ca_system_score_codex":0.000026994081,"about_ca_system_score_gemma":0.000059269314,"threshold_uncertainty_score":0.90996504},"labels":[],"label_agreement":null},{"id":"W1953770551","doi":"10.37236/550","title":"Hamiltonicity of $k$-Traceable Graphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Hamiltonian path; Graph; Path (computing); Vertex (graph theory); Induced path; Integer (computer science); Discrete mathematics; Longest path problem; Shortest path problem; Computer science","score_opus":0.02183922895665276,"score_gpt":0.2527308645314063,"score_spread":0.23089163557475356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953770551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41773978,0.0075512137,0.56793815,0.00032291736,0.0005982402,0.00020211794,5.525454e-7,0.00003809318,0.0056089587],"genre_scores_gemma":[0.9984186,0.0008329661,0.00053691963,0.00002737042,0.000012587523,0.0000014380431,4.71239e-8,0.000010491299,0.00015954285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979584,0.00024851278,0.00045246654,0.00012479191,0.00060176715,0.0006140272],"domain_scores_gemma":[0.99805206,0.00023565604,0.00051029655,0.0006226251,0.0004899693,0.00008937272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025072244,0.00012473077,0.00027119217,0.00021429636,0.000117584925,0.000020260546,0.0026246605,0.0000508844,0.00001275603],"category_scores_gemma":[0.00011872837,0.0000835074,0.0001815055,0.0010841959,0.00017171657,0.00048084988,0.00019666737,0.00082356634,0.000004879744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048803406,0.00016267782,0.00033920986,0.000007200082,0.0000619392,0.0000074897553,0.0005370694,0.000019822644,0.00061714236,0.99734503,0.00005895389,0.0007946763],"study_design_scores_gemma":[0.00044432937,0.0008600932,0.0006039864,0.000015646927,0.000014117694,0.000136231,0.00005257505,0.00019345924,0.023491887,0.97369134,0.00041270725,0.00008364842],"about_ca_topic_score_codex":0.00000877927,"about_ca_topic_score_gemma":0.0000023596142,"teacher_disagreement_score":0.5806789,"about_ca_system_score_codex":0.00012303157,"about_ca_system_score_gemma":0.0004832663,"threshold_uncertainty_score":0.48773158},"labels":[],"label_agreement":null},{"id":"W196193938","doi":"","title":"Counting rooted spanning forests in complete multipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Spanning tree; Physics","score_opus":0.02526542457220644,"score_gpt":0.28737536236066785,"score_spread":0.2621099377884614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196193938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802988,0.00016745333,0.017215565,0.0003425309,0.00071910286,0.0003062327,0.0000016485278,0.00024745282,0.00070118404],"genre_scores_gemma":[0.991752,0.000006778092,0.008060661,0.00009666291,0.000004374714,0.00003257268,0.0000033955782,0.000022040504,0.000021499342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977906,0.00010958561,0.0003434151,0.00053416326,0.00048647125,0.0007357985],"domain_scores_gemma":[0.99869734,0.00020192358,0.000108493914,0.00071469485,0.00013036247,0.000147175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070340576,0.0002023476,0.0002543143,0.0003850473,0.00020550165,0.00014805117,0.0011803014,0.000077669785,0.000004827625],"category_scores_gemma":[0.0002053172,0.00021654103,0.00007748955,0.0016334773,0.00012720052,0.0008484597,0.00042743084,0.00040705633,0.000082513325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011892017,0.00008825727,0.038188837,0.0000109829225,0.000008857353,0.00009666202,0.00048066434,0.0024787397,0.0013958232,0.9563408,0.000019666137,0.0008788111],"study_design_scores_gemma":[0.0019251676,0.000075004355,0.061905812,0.00008593965,0.000001332287,0.000010894913,0.000023264223,0.008324561,0.0014695433,0.9256661,0.00026465804,0.00024775707],"about_ca_topic_score_codex":0.0001161068,"about_ca_topic_score_gemma":0.00013795975,"teacher_disagreement_score":0.03067474,"about_ca_system_score_codex":0.00014620679,"about_ca_system_score_gemma":0.0000815377,"threshold_uncertainty_score":0.8830287},"labels":[],"label_agreement":null},{"id":"W1963693997","doi":"10.1016/j.ejc.2013.06.043","title":"Graph partitions with prescribed patterns","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Induced subgraph isomorphism problem; Graph homomorphism; Homomorphism; Partition (number theory); Induced subgraph; Discrete mathematics; Graph; Distance-hereditary graph; Factor-critical graph; Line graph; Voltage graph","score_opus":0.01618968927603948,"score_gpt":0.23112680411656777,"score_spread":0.2149371148405283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963693997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18221794,0.00018799986,0.8092193,0.0009092196,0.00038985498,0.000144124,0.0000011421312,0.000059046408,0.006871376],"genre_scores_gemma":[0.9940922,0.000045153625,0.005464353,0.00010086875,0.00004506652,0.0000022541246,3.413279e-7,0.000020906595,0.00022881562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818814,0.0005159359,0.0003393956,0.00014938734,0.0005166912,0.00029042942],"domain_scores_gemma":[0.99828595,0.0001088574,0.00026474966,0.00045827986,0.0006271475,0.00025503186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070941326,0.00012335356,0.00016150955,0.00023356472,0.00012201651,0.00021478851,0.0012982151,0.000011645783,0.000040525887],"category_scores_gemma":[0.000066721994,0.000090624766,0.00008231688,0.000586116,0.000071052564,0.0010639868,0.0001756432,0.00037452104,0.000107849584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060619634,0.0009321601,0.027215464,0.00005599992,0.00022784637,0.0019662362,0.001943012,0.00092622923,0.0014248823,0.9268252,0.014133564,0.02428879],"study_design_scores_gemma":[0.0055253496,0.0057906914,0.17371309,0.00039702954,0.000047303212,0.0013079321,0.00032259812,0.0010306105,0.0036285908,0.7825755,0.02466097,0.0010003358],"about_ca_topic_score_codex":0.0000010799899,"about_ca_topic_score_gemma":2.3864445e-7,"teacher_disagreement_score":0.81187433,"about_ca_system_score_codex":0.000026251228,"about_ca_system_score_gemma":0.00004611154,"threshold_uncertainty_score":0.36955708},"labels":[],"label_agreement":null},{"id":"W1964031838","doi":"10.1007/s00493-011-1687-5","title":"Packing directed circuits exactly","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Cardinality (data modeling); Combinatorics; Mathematics; Set (abstract data type); Electronic circuit; Characterization (materials science); Property (philosophy); Discrete mathematics; Minor (academic); Computer science; Law","score_opus":0.05387108488223161,"score_gpt":0.27160837928300036,"score_spread":0.21773729440076875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964031838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07820483,0.0012078129,0.5640001,0.0002869735,0.002690321,0.0006933578,0.0000024542746,0.003890947,0.34902316],"genre_scores_gemma":[0.9951135,0.000017453962,0.0042626727,0.00006843783,0.000015549718,0.00002201878,5.526029e-7,0.000015804611,0.0004840041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853796,0.00012571325,0.00016008374,0.0004004733,0.00032171168,0.0004540519],"domain_scores_gemma":[0.99860764,0.00012963818,0.00006294737,0.0008734551,0.00014836408,0.00017797858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027994148,0.00013387651,0.00015544934,0.00016959678,0.00017080088,0.000059283437,0.0014453032,0.000055730427,0.000061984945],"category_scores_gemma":[0.00014745371,0.00012933323,0.000059669335,0.0011014988,0.000067129535,0.00050316803,0.00039539282,0.0002198878,0.00022662252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034230377,0.00015110975,0.0023989102,0.000007732951,0.000014904294,0.000068947826,0.0009741467,2.99589e-7,0.0008604564,0.9518486,0.0005081789,0.04316328],"study_design_scores_gemma":[0.0005542566,0.0001971175,0.021435533,0.00002234295,0.0000040771406,0.000023663697,0.000025679346,0.00107131,0.017070226,0.952495,0.006709779,0.00039105647],"about_ca_topic_score_codex":0.000009467503,"about_ca_topic_score_gemma":4.600065e-7,"teacher_disagreement_score":0.9169087,"about_ca_system_score_codex":0.00006578334,"about_ca_system_score_gemma":0.000048552083,"threshold_uncertainty_score":0.5274056},"labels":[],"label_agreement":null},{"id":"W1964148783","doi":"10.1016/j.disc.2007.08.052","title":"Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Steiner tree problem; Connectivity; Neighbourhood (mathematics); Discrete mathematics; Graph; Induced subgraph","score_opus":0.015517588845970518,"score_gpt":0.28714373773133084,"score_spread":0.2716261488853603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964148783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3519831,0.00087613956,0.6425156,0.00034714997,0.00014827469,0.00044943552,0.000011574484,0.00014610148,0.0035226382],"genre_scores_gemma":[0.9045823,0.000045398425,0.09471469,0.00010555245,0.000025533593,0.0000229833,0.000005243484,0.00003649393,0.00046175023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975678,0.00007346691,0.0005344668,0.0005190157,0.0005717491,0.00073355174],"domain_scores_gemma":[0.99814236,0.000503478,0.0001227596,0.0009445693,0.000074342504,0.00021248094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012058666,0.00027756148,0.00034447474,0.0003132302,0.00010913665,0.00011974328,0.0008434017,0.00009437544,0.00001530422],"category_scores_gemma":[0.00015713701,0.000233703,0.00007359487,0.0008388035,0.00025646237,0.0004903999,0.00043258327,0.00032312007,0.000032508313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039781877,0.00023328245,0.0031124912,0.00049261167,0.000038847113,0.00059753255,0.004990007,0.00020462448,0.0009839763,0.9748733,0.00016474663,0.014268808],"study_design_scores_gemma":[0.00094934617,0.00014862101,0.0053871977,0.00028368592,0.000013208885,0.00013248173,0.00082076516,0.07210139,0.0008989705,0.9181422,0.00047937568,0.00064273615],"about_ca_topic_score_codex":0.000010899632,"about_ca_topic_score_gemma":0.00010179991,"teacher_disagreement_score":0.55259925,"about_ca_system_score_codex":0.00004827407,"about_ca_system_score_gemma":0.000027299193,"threshold_uncertainty_score":0.9530132},"labels":[],"label_agreement":null},{"id":"W1964296470","doi":"10.1016/s0012-365x(00)00055-8","title":"Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Digraph; Combinatorics; Mathematics; Bipartite graph; Path (computing); Discrete mathematics; Graph; Computer science; Quantum","score_opus":0.02621749155710442,"score_gpt":0.29682061700021123,"score_spread":0.27060312544310683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964296470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68871933,0.00026435417,0.30590326,0.00006494969,0.00006839048,0.0005295646,0.00003645205,0.00015946887,0.004254231],"genre_scores_gemma":[0.9177896,0.00005792254,0.081850894,0.000013691725,0.000016647351,0.000036590412,0.000012555304,0.00003383018,0.00018827236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720365,0.00014287623,0.00075449224,0.00051561417,0.0006435699,0.0007398287],"domain_scores_gemma":[0.99802715,0.0003365742,0.00022224429,0.0011477984,0.0000998372,0.00016642464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006698004,0.00030035074,0.0004892266,0.00041433758,0.000106692576,0.00008198072,0.0011659752,0.00008488905,0.000096010044],"category_scores_gemma":[0.000108006694,0.0002745688,0.0001741577,0.0013809525,0.00024710895,0.0006187041,0.00025079396,0.00035378113,0.0000361465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008252914,0.00060916785,0.027578807,0.00046955113,0.000112070615,0.00010993421,0.012893672,0.006765078,0.0056453333,0.9231817,0.00005569223,0.02249645],"study_design_scores_gemma":[0.0037659598,0.00059924304,0.012267055,0.0015915302,0.00005015952,0.000060491286,0.0034235127,0.81260014,0.0119412765,0.15078238,0.0011548984,0.0017633382],"about_ca_topic_score_codex":0.00003107942,"about_ca_topic_score_gemma":0.000043520107,"teacher_disagreement_score":0.80583507,"about_ca_system_score_codex":0.00004278461,"about_ca_system_score_gemma":0.00003892667,"threshold_uncertainty_score":0.9999707},"labels":[],"label_agreement":null},{"id":"W1964336276","doi":"10.1007/s00373-007-0712-5","title":"On the Density of Trigraph Homomorphisms","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Order (exchange); Graph homomorphism; Combinatorics; Algebra homomorphism; Discrete mathematics; Graph; Line graph; Voltage graph","score_opus":0.016357687131862527,"score_gpt":0.24953558173241772,"score_spread":0.23317789460055519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964336276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9171781,0.00026859183,0.07896759,0.00028963736,0.0002457078,0.00017485836,0.0000013168062,0.0000622272,0.0028119877],"genre_scores_gemma":[0.9992893,0.0000828029,0.00041436424,0.00013936772,0.0000028155853,0.000003357193,2.6785094e-7,0.0000052238224,0.00006254168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989147,0.00006356544,0.00016559185,0.00022469726,0.00036142522,0.00026999685],"domain_scores_gemma":[0.99847233,0.00067775167,0.00007422094,0.00055963633,0.00012273173,0.00009332658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001123493,0.00010492342,0.0001377329,0.00020639821,0.00020273164,0.000033430184,0.0006270194,0.000048837406,0.0000029929433],"category_scores_gemma":[0.00007775206,0.00007080913,0.00007324522,0.0012309382,0.00022134985,0.000100530844,0.00016135025,0.00020652199,0.0000029631642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016240645,0.000069935864,0.0031724127,0.000004729579,0.000009600159,0.000011229904,0.00009413532,6.873304e-7,0.00018352117,0.99273086,0.00014208755,0.0035645433],"study_design_scores_gemma":[0.00025064903,0.00020086674,0.014104729,0.000007739112,0.0000025405568,0.0000077581,0.00003804533,0.00012287364,0.0064084837,0.97857666,0.00019413266,0.00008549514],"about_ca_topic_score_codex":0.0000070678266,"about_ca_topic_score_gemma":0.0000021108724,"teacher_disagreement_score":0.08211118,"about_ca_system_score_codex":0.000009419397,"about_ca_system_score_gemma":0.000015642232,"threshold_uncertainty_score":0.28875127},"labels":[],"label_agreement":null},{"id":"W1964476238","doi":"10.1016/s0012-365x(03)00302-9","title":"On i−-ER-critical graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of South Africa","keywords":"Combinatorics; Mathematics; Corollary; Discrete mathematics; Indifference graph; Enhanced Data Rates for GSM Evolution; Graph; Domination analysis; Computer science; Vertex (graph theory)","score_opus":0.02765724729133736,"score_gpt":0.3274778824452344,"score_spread":0.29982063515389706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964476238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006952791,0.000054387143,0.9244092,0.00036484655,0.00016535925,0.00017288355,0.0000032823543,0.00018253767,0.06769471],"genre_scores_gemma":[0.7143973,0.00000779914,0.28468338,0.00024503353,0.000010713241,0.000030092859,9.446615e-7,0.000025841015,0.0005988866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983994,0.00011689818,0.00023103155,0.00032069968,0.0004928028,0.00043917203],"domain_scores_gemma":[0.99787843,0.00089321245,0.00004070759,0.0009527341,0.00006990956,0.00016498099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005224113,0.00016269168,0.00018378862,0.00014222915,0.00015055033,0.00013785361,0.0007671831,0.00005315064,0.000077566736],"category_scores_gemma":[0.0013161227,0.00013139758,0.00010278113,0.0004872073,0.00016517227,0.0002473933,0.00010950435,0.00021669954,0.00036130357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015890578,0.00008042189,0.000010178652,0.000031029896,0.000006831756,0.00001731671,0.00032822567,0.000016356145,0.00015112557,0.9986725,0.0002123335,0.00047209198],"study_design_scores_gemma":[0.00014015159,0.00009472564,0.000009451786,0.0000349606,0.0000030878805,0.00002297274,0.00008164004,0.005252746,0.0027037894,0.9907929,0.0006945031,0.00016909852],"about_ca_topic_score_codex":2.5623814e-7,"about_ca_topic_score_gemma":3.225584e-7,"teacher_disagreement_score":0.70744455,"about_ca_system_score_codex":0.000021708422,"about_ca_system_score_gemma":0.000029980627,"threshold_uncertainty_score":0.53582376},"labels":[],"label_agreement":null},{"id":"W1964689736","doi":"10.1007/s10107-010-0384-4","title":"The master equality polyhedron with multiple rows","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subadditivity; Polyhedron; Mathematics; Row; Combinatorics; Vertex (graph theory); Submodular set function; Duality (order theory); Discrete mathematics; Graph; Computer science","score_opus":0.03564288285088745,"score_gpt":0.30824950322159844,"score_spread":0.272606620370711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964689736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03562742,0.00002306386,0.9589239,0.0015291116,0.00008342862,0.0005016095,4.238824e-7,0.00026265226,0.0030484034],"genre_scores_gemma":[0.6837745,4.2947173e-7,0.3153615,0.000041637988,0.000037954404,0.000105534484,3.5824922e-7,0.000015743104,0.00066238607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816376,0.00010083253,0.00024852515,0.00033857758,0.0005262654,0.0006220371],"domain_scores_gemma":[0.99761045,0.0010163832,0.000072105526,0.0010423481,0.00008300388,0.00017570509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013963099,0.0001532708,0.00015450563,0.000040101168,0.0004160431,0.0005014538,0.0012083094,0.00005859984,0.00002336362],"category_scores_gemma":[0.00043192023,0.000082762024,0.00006267252,0.00034482378,0.0003066644,0.00033614674,0.00039736045,0.00050761865,0.00017308306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019460462,0.00010473852,0.00057166605,0.00003484426,0.000014131975,0.000009005281,0.0004125003,0.000002215232,0.0010710423,0.7503248,0.000016420032,0.24741921],"study_design_scores_gemma":[0.0009378389,0.00036672738,0.0004957233,0.00006754014,0.0000123019445,0.00014724683,0.00035285702,0.067211986,0.006421115,0.8872074,0.03616418,0.0006150898],"about_ca_topic_score_codex":0.0000045246284,"about_ca_topic_score_gemma":0.000059476475,"teacher_disagreement_score":0.64814705,"about_ca_system_score_codex":0.000018762446,"about_ca_system_score_gemma":0.000034021665,"threshold_uncertainty_score":0.48355305},"labels":[],"label_agreement":null},{"id":"W1964729600","doi":"10.1016/j.ejc.2007.11.007","title":"Majority functions on structures with finite duality","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of the Fraser Valley","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Unanimity; Duality (order theory); Combinatorics; Bounded function; Strong duality; Path (computing); Discrete mathematics; Pure mathematics; Optimization problem; Mathematical analysis; Mathematical optimization","score_opus":0.03352257192047073,"score_gpt":0.25745444317490584,"score_spread":0.22393187125443512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964729600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29969326,0.00016422741,0.68005586,0.00052180083,0.0010200515,0.000089895875,0.0000030500703,0.00007391317,0.018377928],"genre_scores_gemma":[0.9950539,0.00003863776,0.0041813157,0.000118446325,0.00008763788,2.790291e-7,3.8252745e-7,0.000017117753,0.00050229765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777424,0.00073986955,0.00033337247,0.00018252553,0.0007262153,0.0002437441],"domain_scores_gemma":[0.9982291,0.00029424342,0.000290881,0.00051259436,0.00046418296,0.00020900891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010751883,0.00014047952,0.00019122702,0.000225298,0.00030890584,0.00006371623,0.0010108509,0.000016211952,0.00001189806],"category_scores_gemma":[0.00023431859,0.00010257177,0.000086506865,0.00070504483,0.00014345447,0.00042901025,0.00014308472,0.00063323794,0.000042699074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035193158,0.0005259063,0.008513696,0.000020298747,0.00012052661,0.005007524,0.001069201,0.0038592222,0.00014258783,0.9680994,0.005065063,0.0072246213],"study_design_scores_gemma":[0.009246884,0.014021446,0.3495147,0.00018854691,0.000051326722,0.0060883993,0.0002308614,0.0010457371,0.0029983488,0.5161383,0.09912798,0.001347474],"about_ca_topic_score_codex":3.7486052e-7,"about_ca_topic_score_gemma":1.3583222e-7,"teacher_disagreement_score":0.6953606,"about_ca_system_score_codex":0.00005486248,"about_ca_system_score_gemma":0.00010257354,"threshold_uncertainty_score":0.41827554},"labels":[],"label_agreement":null},{"id":"W1964757115","doi":"10.1016/j.jctb.2007.09.002","title":"Generating weakly 4-connected matroids","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Graphic matroid; Oriented matroid; Matroid partitioning; Element (criminal law); Minor (academic); Discrete mathematics","score_opus":0.011170585007555882,"score_gpt":0.27695689597859524,"score_spread":0.2657863109710394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964757115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3478831,0.0005864916,0.6367589,0.00041429975,0.009993768,0.000164664,0.0000012087501,0.00011893866,0.004078605],"genre_scores_gemma":[0.9540494,0.000027891307,0.044098943,0.00012358843,0.0012717163,0.000001440703,4.2228535e-7,0.000025291172,0.00040131545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973528,0.00043825473,0.0007556303,0.00020626125,0.00073167885,0.0005153756],"domain_scores_gemma":[0.9971427,0.0008812631,0.00052101904,0.00048485657,0.0007129687,0.00025721316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061740763,0.00019553807,0.0003659754,0.00036364907,0.0002613013,0.00020100568,0.0015220244,0.00010526503,0.000052011394],"category_scores_gemma":[0.0009907136,0.00016647605,0.00019045915,0.0007675031,0.0001831581,0.0017181789,0.00027307062,0.0005643343,0.000012745954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060351175,0.00006829721,0.00007511776,0.000007329022,0.000050465715,0.00017359114,0.00042095807,0.00007694802,0.031923257,0.9584398,0.00015851672,0.008002172],"study_design_scores_gemma":[0.0009910902,0.0008430992,0.00012924918,0.000031128173,0.00000867545,0.00044937618,0.00027934395,0.0001008206,0.05082517,0.93971646,0.0064249896,0.00020062008],"about_ca_topic_score_codex":7.652373e-7,"about_ca_topic_score_gemma":7.931494e-7,"teacher_disagreement_score":0.6061663,"about_ca_system_score_codex":0.00010483911,"about_ca_system_score_gemma":0.00017407424,"threshold_uncertainty_score":0.6788696},"labels":[],"label_agreement":null},{"id":"W1964852627","doi":"10.1007/s10107-012-0626-8","title":"A stabilized structured Dantzig–Wolfe decomposition method","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Polyhedron; Column generation; Mathematics; Decomposition; Mathematical optimization; Extreme point; Variable (mathematics); Linear programming; Scheme (mathematics); Decomposition method (queueing theory); Combinatorics; Discrete mathematics","score_opus":0.035062206351621106,"score_gpt":0.38205921895953326,"score_spread":0.34699701260791216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964852627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010465795,0.00013368155,0.98702306,0.00020340856,0.00010582689,0.0005376109,9.2058957e-7,0.00039623442,0.0011334674],"genre_scores_gemma":[0.3198299,7.423878e-7,0.6799406,0.000040265597,0.000049467475,0.00007791687,0.0000018751686,0.000016183169,0.000043056356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997572,0.00032275674,0.00035598825,0.00034544375,0.0005397126,0.0008640832],"domain_scores_gemma":[0.99810445,0.00067151367,0.000091730566,0.0007082554,0.000082224746,0.00034182056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017306603,0.00019842322,0.00029433443,0.00013389118,0.00019556636,0.00020434131,0.0007565245,0.0000833146,0.00010331186],"category_scores_gemma":[0.00036657127,0.00016035573,0.00012236567,0.0005848758,0.00009900724,0.00086342765,0.00039457297,0.00027442642,0.00013737647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013943614,0.00020627817,0.000120427496,0.0000967186,0.000022788585,0.0000046649343,0.0013001297,0.000007939369,0.004752842,0.7385894,0.000014433151,0.2548704],"study_design_scores_gemma":[0.0006804078,0.0001360111,0.00019781744,0.00006603547,0.000022786617,0.00017230569,0.0002310043,0.039370123,0.01912745,0.9352514,0.004261123,0.00048352583],"about_ca_topic_score_codex":0.0000012669179,"about_ca_topic_score_gemma":4.902488e-7,"teacher_disagreement_score":0.30936414,"about_ca_system_score_codex":0.000068430294,"about_ca_system_score_gemma":0.000022788356,"threshold_uncertainty_score":0.6539117},"labels":[],"label_agreement":null},{"id":"W1964864950","doi":"10.1006/jctb.2001.2090","title":"Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Matching (statistics); Cubic graph; Lattice (music); Graph; Discrete mathematics; Line graph; Voltage graph; Physics","score_opus":0.01904510044783211,"score_gpt":0.2777941096068416,"score_spread":0.2587490091590095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964864950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49299264,0.001637874,0.5004136,0.0014347633,0.002637873,0.0003861655,0.000022202805,0.00004094771,0.00043393014],"genre_scores_gemma":[0.9576998,0.00024710238,0.04173618,0.00007817602,0.00012992833,0.0000071403497,3.346666e-7,0.00001673564,0.00008464024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841136,0.00033347646,0.0004667367,0.0001473495,0.00038736517,0.00025374346],"domain_scores_gemma":[0.9955452,0.0032686857,0.00041958055,0.000326743,0.00033539103,0.00010438815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018020548,0.00014423778,0.0003080318,0.00016960203,0.00042774054,0.00016356041,0.00089388114,0.000051576422,0.000028583856],"category_scores_gemma":[0.00027331055,0.00010433243,0.00017837076,0.00030573722,0.00027658837,0.0012881691,0.00020748161,0.00030177092,9.631632e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038758706,0.00008845371,0.000019845982,0.000027631755,0.00010045061,0.000009494668,0.0018548238,0.0008747147,0.002153929,0.99288994,0.00010770263,0.0014854018],"study_design_scores_gemma":[0.0010772874,0.0005578676,0.000080148144,0.00006899659,0.000036090372,0.00019254815,0.0008433894,0.0007266192,0.0038016504,0.9914727,0.0010261303,0.00011652427],"about_ca_topic_score_codex":0.0000022486502,"about_ca_topic_score_gemma":3.0302343e-7,"teacher_disagreement_score":0.4647071,"about_ca_system_score_codex":0.000023544795,"about_ca_system_score_gemma":0.00003628093,"threshold_uncertainty_score":0.4254553},"labels":[],"label_agreement":null},{"id":"W1965667139","doi":"10.1137/110847585","title":"A Local Strengthening of Reed's $\\omega$, $\\Delta$, $\\chi$ Conjecture for Quasi-line Graphs","year":2013,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Omega; Conjecture; Combinatorics; Mathematics; Line (geometry); Mathematical proof; Graph; Line graph; Discrete mathematics; Physics; Geometry","score_opus":0.03564674079192311,"score_gpt":0.3243638320159371,"score_spread":0.288717091224014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965667139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026522402,0.0005583236,0.96956635,0.0007285089,0.0006444801,0.0011747364,0.00013292898,0.0001162938,0.0005559599],"genre_scores_gemma":[0.52677965,0.00024881112,0.472083,0.00009162361,0.00020389611,0.000111842506,0.00002636201,0.00012257493,0.00033224642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482816,0.00029687595,0.0017509647,0.0007559119,0.0014495042,0.0009185993],"domain_scores_gemma":[0.9936701,0.0012821442,0.0019988483,0.001844635,0.00074231974,0.00046197083],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002098591,0.00076213886,0.0013731795,0.0008560256,0.0003062898,0.0005252218,0.0036150897,0.00048581662,0.00004702473],"category_scores_gemma":[0.00069316564,0.00057722,0.00094779476,0.0005158935,0.00041641959,0.00038209988,0.0014314362,0.002608674,0.000019447447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012713316,0.00054595264,0.000015399703,0.0017882085,0.00056722376,0.000061617066,0.0032571978,0.018788716,0.00026921585,0.95862603,0.0007564579,0.015196838],"study_design_scores_gemma":[0.00085058267,0.0010205257,0.000007333133,0.0015678188,0.00005881505,0.00016995636,0.00043940998,0.21945572,0.0015803782,0.7740371,0.00028613594,0.0005262226],"about_ca_topic_score_codex":0.000005947821,"about_ca_topic_score_gemma":0.0000048183188,"teacher_disagreement_score":0.50025725,"about_ca_system_score_codex":0.00014990111,"about_ca_system_score_gemma":0.00036987755,"threshold_uncertainty_score":0.9996923},"labels":[],"label_agreement":null},{"id":"W1965799704","doi":"10.1016/j.dam.2012.02.004","title":"On edge-sets of bicliques in graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Simon Fraser University","funders":"Secretaría de Ciencia y Técnica, Universidad de Buenos Aires; Natural Sciences and Engineering Research Council of Canada; Fondation Sciences Mathématiques de Paris; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Combinatorics; Hypergraph; Mathematics; Bipartite graph; Complete bipartite graph; Intersection graph; Discrete mathematics; Graph; Line graph","score_opus":0.026164911057218455,"score_gpt":0.31298894050997234,"score_spread":0.28682402945275387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965799704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37346393,0.0001771975,0.54747045,0.00012846687,0.00013324931,0.00078981515,0.000008412239,0.0001903575,0.077638134],"genre_scores_gemma":[0.86313283,0.000013694202,0.13670227,0.000050198156,0.000008545822,0.00004605628,0.0000016688144,0.000015599717,0.000029144781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867964,0.000028477194,0.0003230277,0.00019221404,0.00036007026,0.0004165525],"domain_scores_gemma":[0.9986415,0.00038104094,0.00012369058,0.00072312256,0.000028663966,0.00010200471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064143684,0.00014670857,0.00025013118,0.00026641457,0.000034204884,0.000024476816,0.0007191753,0.000058655518,0.000015696027],"category_scores_gemma":[0.00007243004,0.0001205265,0.000059399412,0.0005894735,0.000102954335,0.00023786975,0.00022709774,0.00016940944,0.0000803278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007931162,0.00016774502,0.000085797525,0.00007436854,0.000007046482,9.347208e-7,0.0018347154,0.000020286901,0.002678958,0.9920116,0.000052671832,0.0030579458],"study_design_scores_gemma":[0.00024578947,0.000045418714,0.0003015914,0.00005042423,0.0000026553478,0.0000020811324,0.00017371694,0.0015631404,0.030227216,0.9671672,0.000060928454,0.00015985307],"about_ca_topic_score_codex":0.0000014759247,"about_ca_topic_score_gemma":0.0000012715492,"teacher_disagreement_score":0.48966888,"about_ca_system_score_codex":0.000022852253,"about_ca_system_score_gemma":0.00001633087,"threshold_uncertainty_score":0.49149278},"labels":[],"label_agreement":null},{"id":"W1966205566","doi":"10.1007/s00373-011-1072-8","title":"On Cartesian Product of Factor-Critical Graphs","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Factor graph; Graph; Discrete mathematics; Factor (programming language); Product (mathematics); Cartesian coordinate system; Computer science; Geometry; Algorithm","score_opus":0.03510544318309315,"score_gpt":0.27590548118175523,"score_spread":0.24080003799866206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966205566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96022344,0.0014837201,0.022400683,0.0002754705,0.0011691198,0.0004934965,0.00001532805,0.00030677047,0.013631993],"genre_scores_gemma":[0.9981859,0.00007463144,0.0016302316,0.000040300274,0.0000031747877,0.000012024472,4.8602294e-7,0.000010988843,0.000042310232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855196,0.00009156753,0.0002017288,0.00042794982,0.00036860752,0.00035818224],"domain_scores_gemma":[0.998731,0.00018600904,0.00005094677,0.0006786894,0.00017139126,0.00018193884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022271706,0.00016024859,0.00021245368,0.0002999182,0.00013222493,0.00003267712,0.0006380583,0.000054635802,0.0000119028],"category_scores_gemma":[0.00012936648,0.00014028075,0.0000829841,0.0009305827,0.00028758953,0.00026732803,0.00017537862,0.00022427586,0.0000050123554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013944631,0.0001907055,0.0048883893,0.00002773876,0.000011459075,0.000013485859,0.00047305028,1.2965083e-7,0.00017357912,0.98924416,0.00005095135,0.004912378],"study_design_scores_gemma":[0.00023607549,0.000504656,0.012835184,0.000016305208,0.000003815743,0.000008287766,0.000027996703,0.000074795535,0.0058634398,0.9801971,0.00007396532,0.00015842539],"about_ca_topic_score_codex":0.0000146166085,"about_ca_topic_score_gemma":0.0000010566932,"teacher_disagreement_score":0.037962433,"about_ca_system_score_codex":0.000009751036,"about_ca_system_score_gemma":0.000029983743,"threshold_uncertainty_score":0.5720483},"labels":[],"label_agreement":null},{"id":"W1967091137","doi":"10.7151/dmgt.1238","title":"On dominating the Cartesian product of a graph and K <sub>2</sub>","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Graph; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.011147351217330617,"score_gpt":0.25500146980566574,"score_spread":0.2438541185883351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967091137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69528335,0.00046493806,0.29938623,0.002195603,0.00013273297,0.0009397835,0.000006775094,0.00017787372,0.0014126868],"genre_scores_gemma":[0.9921497,0.000044266795,0.0075182905,0.00009503424,0.000022273336,0.00010764893,0.0000011329616,0.00003093161,0.000030715863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973699,0.0004453538,0.00046381503,0.000598408,0.0006398494,0.00048266037],"domain_scores_gemma":[0.99698347,0.001085407,0.00025024774,0.001422899,0.00011060917,0.00014736221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023121892,0.0003036156,0.00038474728,0.00040192978,0.0004576701,0.000091529066,0.0011712522,0.00005873467,0.0000059218532],"category_scores_gemma":[0.0007077861,0.00015464617,0.00019887739,0.0011802401,0.0008343193,0.00037772334,0.0004114885,0.00032098044,0.000019083196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004693887,0.00019040641,0.000014959533,0.000120233235,0.000037584243,0.000008444802,0.0040423214,0.000064976855,0.020489894,0.9551023,0.0000123024465,0.01986963],"study_design_scores_gemma":[0.0004400244,0.00012558859,0.0004334575,0.00030465116,0.000016094476,0.000039012182,0.0007541831,0.00009770692,0.088523045,0.9090617,0.0000035049975,0.0002010679],"about_ca_topic_score_codex":0.0000010938785,"about_ca_topic_score_gemma":0.0000021140138,"teacher_disagreement_score":0.29686633,"about_ca_system_score_codex":0.000019457786,"about_ca_system_score_gemma":0.000050913557,"threshold_uncertainty_score":0.63062876},"labels":[],"label_agreement":null},{"id":"W1968027460","doi":"10.1016/s0166-218x(02)00418-3","title":"Maximum independent set and maximum clique algorithms for overlap graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Chordal graph; Mathematics; Combinatorics; Maximal independent set; Split graph; Indifference graph; Treewidth; Independent set; Clique-sum; Pathwidth; Discrete mathematics; Cograph; Vertex (graph theory); Clique problem; 1-planar graph; Graph; Line graph","score_opus":0.030238746495345224,"score_gpt":0.3033645190743955,"score_spread":0.27312577257905024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968027460","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007900526,0.00010574297,0.98283815,0.00011229941,0.00010348569,0.0011809408,0.000031496482,0.00016597618,0.00756137],"genre_scores_gemma":[0.1639113,0.00007001184,0.8349958,0.00021337958,0.000025710255,0.0004842352,0.000014068198,0.00006767824,0.00021781461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977658,0.000042075444,0.00042268814,0.0006192756,0.00049771025,0.0006524481],"domain_scores_gemma":[0.99816024,0.00041303795,0.0001722648,0.0009377156,0.00008839391,0.00022831606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009822464,0.00031314808,0.00037959032,0.0001894821,0.00023642965,0.00021683605,0.0007696947,0.00014057959,0.000012990011],"category_scores_gemma":[0.00010508959,0.00027594654,0.00011367095,0.00041078025,0.00016430907,0.00026270427,0.0002936155,0.00025843014,0.000025012409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001109103,0.00005976857,0.000021216767,0.00015998461,0.000036065623,0.0000056066997,0.0008610229,0.00001919236,0.0014853847,0.99259406,0.00010488228,0.004641747],"study_design_scores_gemma":[0.00078782556,0.00008304486,0.000021614178,0.000020979856,0.00001393225,0.000036675203,0.0006053261,0.0055596232,0.0065717543,0.98423326,0.0017142821,0.00035168862],"about_ca_topic_score_codex":0.0000011173873,"about_ca_topic_score_gemma":0.000002071391,"teacher_disagreement_score":0.15601076,"about_ca_system_score_codex":0.000038883758,"about_ca_system_score_gemma":0.00005929209,"threshold_uncertainty_score":0.99996924},"labels":[],"label_agreement":null},{"id":"W1968677127","doi":"10.1016/j.jctb.2004.09.006","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>Δ</mml:mi><mml:mo>-</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-critical graphs","year":2004,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Microsoft (Canada); University of Toronto","funders":"","keywords":"Clique; Algorithm; Graph; Combinatorics; Mathematics; Discrete mathematics; Computer science","score_opus":0.016637711207507806,"score_gpt":0.2627129415723882,"score_spread":0.2460752303648804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968677127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96907717,0.003486972,0.003868426,0.0017721948,0.014604958,0.00024045986,0.00041106466,0.00049056724,0.006048162],"genre_scores_gemma":[0.9859153,0.002274095,0.0041890494,0.00126377,0.0047488394,0.0004248689,0.00015298641,0.00089982845,0.00013128022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97999233,0.0020579095,0.0042480323,0.0029057397,0.006191022,0.004604972],"domain_scores_gemma":[0.9844038,0.0046126293,0.0036678077,0.003243271,0.001273806,0.0027987217],"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.007919261,0.0020142545,0.0013973378,0.0014052187,0.0035096253,0.0036590362,0.006740095,0.0032410456,0.0020043142],"category_scores_gemma":[0.0057169804,0.0029426774,0.0036526585,0.002978838,0.0052644457,0.005479877,0.0041137226,0.0055260854,0.001621927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007533863,0.0013958182,0.000025464853,0.0009816223,0.0023362613,0.0035220548,0.0035016024,0.002253673,0.0028378586,0.9646927,0.0064882226,0.004430854],"study_design_scores_gemma":[0.0057561123,0.007197375,0.000035149333,0.0021274807,0.001271113,0.0040926314,0.0034872207,0.010538571,0.20112057,0.7569518,0.004872728,0.0025492047],"about_ca_topic_score_codex":0.00047096534,"about_ca_topic_score_gemma":0.00019004653,"teacher_disagreement_score":0.20774087,"about_ca_system_score_codex":0.00016920635,"about_ca_system_score_gemma":0.003470607,"threshold_uncertainty_score":0.99926},"labels":[],"label_agreement":null},{"id":"W1968959377","doi":"10.1016/j.disopt.2005.10.007","title":"How to recycle your facets","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Educational Foundation of America; HEC Montréal; Belgian American Educational Foundation","keywords":"Facet (psychology); Polytope; Mathematics; Construct (python library); Combinatorics; Polyhedral combinatorics; Mathematical optimization; Computer science; Geometry; Psychology","score_opus":0.017486512446671036,"score_gpt":0.2802205927815007,"score_spread":0.26273408033482964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968959377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014992018,0.000036650763,0.989228,0.003625886,0.00009879256,0.00023069752,0.0000038682015,0.00017729253,0.005099601],"genre_scores_gemma":[0.4082297,0.0000068810155,0.58669305,0.00013683057,0.00006943197,0.000034155375,0.000026865364,0.000018188337,0.004784865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989257,0.000061741826,0.00010838811,0.0003414177,0.0002778049,0.00028496448],"domain_scores_gemma":[0.9992808,0.000025604379,0.00004307454,0.00045823157,0.00010498615,0.000087301196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015051813,0.0001024644,0.00008974989,0.00014931193,0.00013053342,0.00033495273,0.00053045107,0.000039628165,0.000013801581],"category_scores_gemma":[0.00006797445,0.0000973815,0.00003671803,0.0007213426,0.00002458786,0.0008311907,0.00017583038,0.000069781134,0.000034250123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008388226,0.000017004031,0.00017249903,0.0000035182843,0.0000031658087,0.0000036264769,0.00011363145,0.8956466,0.0013122741,0.09707227,0.00070497964,0.004942047],"study_design_scores_gemma":[0.00036626973,0.0000968069,0.00081887876,0.000015722793,0.000002833302,0.0000057235757,0.00005860907,0.9611083,0.007315007,0.02388349,0.005986789,0.00034152615],"about_ca_topic_score_codex":0.000012046491,"about_ca_topic_score_gemma":0.0000050888516,"teacher_disagreement_score":0.4067305,"about_ca_system_score_codex":0.000038347578,"about_ca_system_score_gemma":0.000017553544,"threshold_uncertainty_score":0.39711022},"labels":[],"label_agreement":null},{"id":"W1969337449","doi":"10.1016/j.disc.2007.11.006","title":"Bipartite graphs are not universal fixers","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02775671963024989,"score_gpt":0.2992228160809777,"score_spread":0.27146609645072783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969337449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06271492,0.000038818933,0.9277001,0.00037588237,0.00014089954,0.00020460742,0.0000073796123,0.00025724035,0.008560143],"genre_scores_gemma":[0.8211449,0.000015851847,0.17742205,0.00019604334,0.00003269642,0.000005978486,0.0000028743657,0.000029224346,0.001150409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982845,0.000038854905,0.0002841778,0.0003188322,0.0005206893,0.0005529523],"domain_scores_gemma":[0.9983562,0.00033489673,0.00015193822,0.0008593206,0.00009731814,0.00020030237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086205,0.00017428794,0.00020643041,0.000261252,0.00016118832,0.00010854822,0.0011118496,0.00006452893,0.000025502757],"category_scores_gemma":[0.00014100756,0.00015231756,0.00011946157,0.00081998075,0.00017150711,0.00044400283,0.000337227,0.00020526431,0.0001561428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012034258,0.00006300665,0.00032104627,0.000052312913,0.00002381529,0.00008504176,0.0015797402,0.000050420964,0.00128529,0.99434775,0.0002242755,0.001955267],"study_design_scores_gemma":[0.001155033,0.0001956405,0.0025405432,0.00020523579,0.000027261602,0.00006636671,0.0036145395,0.043385617,0.03387372,0.90801895,0.0059196376,0.0009974727],"about_ca_topic_score_codex":0.000002561272,"about_ca_topic_score_gemma":0.0000105329755,"teacher_disagreement_score":0.75842994,"about_ca_system_score_codex":0.00004458973,"about_ca_system_score_gemma":0.000025584037,"threshold_uncertainty_score":0.621133},"labels":[],"label_agreement":null},{"id":"W1969412240","doi":"10.1016/j.disc.2008.01.039","title":"On Tutte polynomial uniqueness of twisted wheels","year":2008,"lang":"it","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Nankai University","keywords":"Tutte polynomial; Mathematics; Combinatorics; Polyhedral graph; Discrete mathematics; Hypercube; Chromatic polynomial; Uniqueness; Graph; Matroid; Line graph; Pathwidth; Voltage graph","score_opus":0.04184147399083735,"score_gpt":0.30485081405496806,"score_spread":0.2630093400641307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969412240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44479898,0.00026372063,0.5301559,0.0006419168,0.0005989732,0.0011582259,0.00013823129,0.0002079863,0.022036053],"genre_scores_gemma":[0.9524687,0.00011911874,0.04251683,0.00013952915,0.00009113497,0.000026184496,0.00000993936,0.00007864551,0.004549894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613774,0.0003201613,0.0009559841,0.00063347514,0.001161652,0.0007910107],"domain_scores_gemma":[0.9958672,0.0010682497,0.00054137,0.001946491,0.00030156728,0.0002751139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083376426,0.0004632043,0.00079688337,0.00037572338,0.00029407456,0.000085314896,0.0019742246,0.00020289286,0.00013822831],"category_scores_gemma":[0.00052129856,0.00041511125,0.00031508453,0.0010765387,0.0008969981,0.00038843587,0.00064309314,0.0005020097,0.00024317516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019146678,0.00088091067,0.00018160771,0.0008605804,0.0002021643,0.00027279876,0.016060391,0.001049177,0.0060943635,0.97065103,0.0016790468,0.0018764688],"study_design_scores_gemma":[0.005047594,0.0030334203,0.0013896306,0.0032009485,0.00016858589,0.000595004,0.0013142083,0.21565346,0.15042631,0.6131361,0.0030412197,0.0029935017],"about_ca_topic_score_codex":0.000015175812,"about_ca_topic_score_gemma":0.0000021661585,"teacher_disagreement_score":0.50766975,"about_ca_system_score_codex":0.00010128742,"about_ca_system_score_gemma":0.00027753215,"threshold_uncertainty_score":0.99983007},"labels":[],"label_agreement":null},{"id":"W1969741579","doi":"10.1007/s003730170022","title":"Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs","year":2001,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Digraph; Combinatorics; Mathematics; Conjecture; Graph; Discrete mathematics; Physics","score_opus":0.023888732718980208,"score_gpt":0.27729175245013604,"score_spread":0.2534030197311558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969741579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974789,0.000738719,0.0012851364,0.00008102373,0.000043406173,0.00016255959,0.000010332566,0.000008243927,0.00019169759],"genre_scores_gemma":[0.99920696,0.00053423183,0.00023309982,0.000007339274,0.0000014455386,0.0000064456444,8.439492e-7,0.000005274118,0.000004377284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889296,0.00011968192,0.00031316595,0.0002021032,0.00028132834,0.00019074924],"domain_scores_gemma":[0.99888486,0.00038525643,0.00021850049,0.00034581928,0.00012222504,0.000043316686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037345145,0.00011381291,0.00027021766,0.00017986263,0.000045757304,0.000009993114,0.00033589095,0.000056591365,0.000001922922],"category_scores_gemma":[0.000055423683,0.00008416657,0.00005737516,0.0007951007,0.00037401755,0.0001493936,0.00014984456,0.00014130864,1.18752915e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056982353,0.00016609846,0.3193952,0.000084514184,0.000021415353,0.0000023093824,0.0007191687,0.00003995329,0.0029522178,0.6744504,0.000004827352,0.002106942],"study_design_scores_gemma":[0.0015854503,0.0005761699,0.31317022,0.00028440263,0.00001912903,0.000012238638,0.00045697042,0.009950006,0.015430553,0.65826446,0.00004271507,0.00020771],"about_ca_topic_score_codex":0.00008923049,"about_ca_topic_score_gemma":0.000028962693,"teacher_disagreement_score":0.016185941,"about_ca_system_score_codex":0.0000063140405,"about_ca_system_score_gemma":0.000016269521,"threshold_uncertainty_score":0.3432213},"labels":[],"label_agreement":null},{"id":"W1969997664","doi":"10.1007/s00373-010-0887-z","title":"Diameter-Preserving Spanning Trees in Sparse Weighted Graphs","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Spanning tree; Mathematics; Weight function; Vertex (graph theory); Graph; Shortest-path tree; Simple graph; Connectivity; Discrete mathematics; Mathematical analysis","score_opus":0.020223197123717028,"score_gpt":0.2652129367781776,"score_spread":0.24498973965446055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969997664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96719396,0.002417763,0.025723148,0.00068695686,0.00032128007,0.00029037104,0.0000018565521,0.0002819506,0.0030827213],"genre_scores_gemma":[0.99409944,0.0004152988,0.005196056,0.0001628686,0.0000057970187,0.000013984452,0.0000016395558,0.000011678932,0.000093225244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980052,0.00013989984,0.0002883236,0.0005585293,0.00040005078,0.0006079884],"domain_scores_gemma":[0.99873817,0.0001921621,0.00007969762,0.0007050735,0.000083708226,0.00020117973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051646226,0.0002288719,0.00028142636,0.0007367166,0.00020126357,0.00019897195,0.0010298886,0.00008111979,0.0000047815074],"category_scores_gemma":[0.000061226725,0.00021855833,0.000088829,0.0025238462,0.00009155236,0.0007347103,0.00030592593,0.00037368678,0.0000039302413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000122902575,0.00013451622,0.017717263,0.000007316175,0.000007977891,0.000091341346,0.0003873548,0.000016192691,0.00044530476,0.95848,0.000092885384,0.022607582],"study_design_scores_gemma":[0.0006720624,0.00024039949,0.046758417,0.00004222411,0.0000030263636,0.000012967065,0.00005601055,0.008166027,0.00053975073,0.9429286,0.00031819756,0.00026228838],"about_ca_topic_score_codex":0.000027618451,"about_ca_topic_score_gemma":0.000015131868,"teacher_disagreement_score":0.029041154,"about_ca_system_score_codex":0.000028590151,"about_ca_system_score_gemma":0.000026364216,"threshold_uncertainty_score":0.891255},"labels":[],"label_agreement":null},{"id":"W1970277269","doi":"10.1145/1360443.1360454","title":"The complexity of fixed-parameter problems","year":2008,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Completeness (order theory); Computer science; Mathematics; Theoretical computer science; Algorithm; Calculus (dental); Mathematical analysis","score_opus":0.11419205458326208,"score_gpt":0.3186488220123281,"score_spread":0.204456767429066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970277269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66276944,0.0011765524,0.30981284,0.012462848,0.000679332,0.0014518591,0.000011259313,0.00042763836,0.011208239],"genre_scores_gemma":[0.9591924,0.00012748575,0.03972342,0.00019825401,0.00003174845,0.000025638265,0.0000010093539,0.000010871344,0.0006891513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985317,0.00016661691,0.0002492833,0.0002771737,0.00039813897,0.00037706015],"domain_scores_gemma":[0.99679905,0.0010635938,0.000109711866,0.0018308643,0.000106222615,0.00009056891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003547636,0.000115160256,0.00016673665,0.00006131647,0.00033122566,0.00004325036,0.0027815888,0.00003849102,0.000015516564],"category_scores_gemma":[0.000671607,0.0000752867,0.00009636463,0.0004882766,0.00088317547,0.00034036714,0.0007817542,0.00021021966,0.000071394235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012339054,0.0003994218,0.020787999,0.00006285164,0.00014370347,0.00006953738,0.0047333264,0.0004487387,0.029000271,0.7772392,0.015716465,0.15127507],"study_design_scores_gemma":[0.000543378,0.00030882546,0.013344874,0.00002027503,0.0000032775843,0.000071305294,0.000050890158,0.0036585573,0.027244745,0.9202768,0.034192815,0.00028424792],"about_ca_topic_score_codex":0.000058587466,"about_ca_topic_score_gemma":0.0000388647,"teacher_disagreement_score":0.296423,"about_ca_system_score_codex":0.000020498677,"about_ca_system_score_gemma":0.00006590082,"threshold_uncertainty_score":0.516893},"labels":[],"label_agreement":null},{"id":"W1970577301","doi":"10.1016/j.dam.2014.02.008","title":"Number of lines in hypergraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); Concordia University","funders":"Concordia University; Canada Research Chairs","keywords":"Hypergraph; Mathematics; Combinatorics; Upper and lower bounds; Line (geometry); Chen; Discrete mathematics; Geometry","score_opus":0.01583011199010476,"score_gpt":0.2953630191365015,"score_spread":0.2795329071463967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970577301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11301717,0.0000135093715,0.8276888,0.000089139096,0.000038054706,0.00022463969,0.0000015768521,0.00007944082,0.05884766],"genre_scores_gemma":[0.6746825,0.00000681406,0.32516977,0.000029735565,0.000012014736,0.000027615099,0.0000010477136,0.000011950032,0.000058575726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988466,0.00002424067,0.0003362491,0.00022912229,0.00030109877,0.00026271885],"domain_scores_gemma":[0.99876213,0.00030415962,0.000111110996,0.00072179537,0.000042290314,0.000058490306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005141934,0.0001252169,0.0002616411,0.0001233926,0.000029621253,0.000026589514,0.0008152272,0.000050865303,0.000015067694],"category_scores_gemma":[0.00008433841,0.00010482905,0.00005523985,0.00059018773,0.000103706436,0.00011739254,0.0002454399,0.00012462532,0.00006669407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003391394,0.000056707446,0.00025365397,0.000084652944,0.000005280726,7.4047614e-7,0.0005816744,0.000058683996,0.0048862793,0.99025565,0.000017031332,0.0037962405],"study_design_scores_gemma":[0.00031816668,0.000016098027,0.00018872289,0.000035151006,0.0000026541272,0.000004567949,0.000116855495,0.022079041,0.01148828,0.96534914,0.00024867855,0.00015264798],"about_ca_topic_score_codex":0.000002066409,"about_ca_topic_score_gemma":0.000002941708,"teacher_disagreement_score":0.5616653,"about_ca_system_score_codex":0.000009080027,"about_ca_system_score_gemma":0.000014422946,"threshold_uncertainty_score":0.42748046},"labels":[],"label_agreement":null},{"id":"W1970733021","doi":"10.5539/jmr.v4n3p116","title":"The Upper Bound of Transitive Index of Reducible Tournaments","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Guangdong Province","keywords":"Mathematics; Transitive relation; Upper and lower bounds; Index (typography); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.09975700056949226,"score_gpt":0.42083377958498186,"score_spread":0.3210767790154896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970733021","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73892665,0.0024721758,0.2517924,0.0013007153,0.00031656877,0.0004184584,0.000004254215,0.0000072242,0.0047615366],"genre_scores_gemma":[0.9730951,0.00033152156,0.026077691,0.0000050596745,0.000074236006,0.0000036311767,5.852341e-8,0.000013056164,0.00039964734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955719,0.0005300146,0.0008013525,0.00010026138,0.0023980138,0.0005984563],"domain_scores_gemma":[0.9947557,0.0023164533,0.0004906113,0.0006264612,0.0015978019,0.00021299803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013548466,0.00009783537,0.0003258384,0.0005274437,0.00020661138,0.0000802433,0.0018716827,0.00006090191,0.000026195126],"category_scores_gemma":[0.0010953458,0.000060109895,0.00017229933,0.0009063749,0.0005230014,0.00070053316,0.00031078528,0.0007523747,0.000008421601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046046954,0.004126935,0.006437685,0.00084328913,0.000814318,0.00005257748,0.045144673,0.00017119801,0.15572293,0.72463804,0.0033540204,0.058233872],"study_design_scores_gemma":[0.0017361002,0.0014270364,0.0063711293,0.0008899941,0.000025859405,0.00062597793,0.011213112,0.005925662,0.21963458,0.7496289,0.0022538158,0.00026782506],"about_ca_topic_score_codex":0.0000042603206,"about_ca_topic_score_gemma":0.0000011428094,"teacher_disagreement_score":0.23416844,"about_ca_system_score_codex":0.00008896666,"about_ca_system_score_gemma":0.0002893363,"threshold_uncertainty_score":0.4695655},"labels":[],"label_agreement":null},{"id":"W1971393213","doi":"10.1007/s00224-007-1345-z","title":"An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Parameterized complexity; Feedback vertex set; Combinatorics; Undirected graph; Mathematics; Vertex (graph theory); Algorithm; Bounded function; Running time; Exponential function; Vertex cover; Function (biology); Time complexity; Binary logarithm; Graph; Exponential time hypothesis; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.02914474183978229,"score_gpt":0.31721327122112886,"score_spread":0.2880685293813466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971393213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016083773,0.0004943199,0.97977823,0.000058940605,0.0009438896,0.0012551972,0.000013301486,0.00038425124,0.000988084],"genre_scores_gemma":[0.9232524,0.0000037595714,0.07604267,0.000057867033,0.00023964462,0.00001970741,0.0000069618163,0.00004085786,0.00033611734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664986,0.00072770106,0.00066098943,0.0005618755,0.00059853046,0.00080105854],"domain_scores_gemma":[0.99353343,0.0041911686,0.00036286205,0.0012882062,0.0004511951,0.00017311107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010497464,0.0002610569,0.00042185455,0.00023499322,0.00048803247,0.00017396994,0.0024889526,0.00010764956,0.0000034242782],"category_scores_gemma":[0.000118102165,0.00019356204,0.00014107162,0.0008785975,0.00029719013,0.00030986857,0.00028099053,0.00026692465,0.000018040648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007016467,0.00009142618,0.000058642563,0.00012103496,0.0001097842,0.0000063417206,0.0030657852,0.004583657,0.0017254454,0.6826939,0.00021681367,0.307257],"study_design_scores_gemma":[0.001061015,0.00050662336,0.0009361132,0.0002630476,0.00002333496,0.00006573248,0.0015157054,0.86561847,0.003055497,0.124765374,0.0017411028,0.00044799002],"about_ca_topic_score_codex":0.000032541808,"about_ca_topic_score_gemma":0.000003886331,"teacher_disagreement_score":0.9071686,"about_ca_system_score_codex":0.00008161678,"about_ca_system_score_gemma":0.00009238631,"threshold_uncertainty_score":0.7893231},"labels":[],"label_agreement":null},{"id":"W1971489185","doi":"10.1016/j.disc.2014.12.001","title":"Point determining digraphs, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-matrix partitions, and dualities in full homomorphisms","year":2014,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Mathematics; Algorithm; Theology; Philosophy","score_opus":0.022036936684090846,"score_gpt":0.2675929174034697,"score_spread":0.24555598071937884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971489185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9458135,0.0024796305,0.022990545,0.0009847672,0.0021471828,0.00033134292,0.0014580995,0.0007029357,0.023092024],"genre_scores_gemma":[0.9662611,0.0018351034,0.02487532,0.0011328344,0.0015377589,0.0018003079,0.0010298123,0.001023859,0.00050390547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98262274,0.0011787891,0.0039710198,0.0033819175,0.0044318587,0.0044136513],"domain_scores_gemma":[0.9858802,0.0045209327,0.0033557813,0.003871746,0.00048100017,0.0018903173],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005537449,0.0020097818,0.0012151749,0.0012853971,0.0028916874,0.0035589463,0.0043885717,0.0023509315,0.004059523],"category_scores_gemma":[0.003566483,0.002983248,0.0023579749,0.0024046549,0.003695899,0.0033195228,0.004639621,0.0030648732,0.0018176319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000945801,0.0007221041,0.00003410382,0.0029285706,0.0012605197,0.0012290037,0.008157094,0.0017212091,0.0023502274,0.9660663,0.011673374,0.002911721],"study_design_scores_gemma":[0.0037336627,0.003119241,0.00009382781,0.004406977,0.0015920585,0.0032033732,0.007520347,0.7444278,0.19305083,0.031029517,0.0040854593,0.0037368785],"about_ca_topic_score_codex":0.00065886375,"about_ca_topic_score_gemma":0.0008590647,"teacher_disagreement_score":0.9350368,"about_ca_system_score_codex":0.00007593405,"about_ca_system_score_gemma":0.0012612743,"threshold_uncertainty_score":0.9992645},"labels":[],"label_agreement":null},{"id":"W1971752656","doi":"10.1016/j.jctb.2009.05.002","title":"The projective plane is a stabilizer","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Projective plane; Matroid; Real projective plane; Stabilizer (aeronautics); Projective test; Blocking set; Minor (academic); Plane (geometry); Mathematics; Projective space; Combinatorics; Fano plane; Pure mathematics; Complex projective space; Geometry; Art; Engineering; Structural engineering","score_opus":0.011682825517400432,"score_gpt":0.2817224498482041,"score_spread":0.2700396243308037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971752656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44725135,0.01160684,0.32829037,0.06423075,0.060149163,0.004017102,0.000032385306,0.0007330934,0.08368896],"genre_scores_gemma":[0.9957152,0.00019046594,0.0024135015,0.00031165805,0.00053740334,0.000004141213,1.6425194e-7,0.000012515659,0.00081495725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977069,0.0005915658,0.00044771942,0.00017443977,0.0007069767,0.00037242597],"domain_scores_gemma":[0.9974323,0.0009166713,0.00037713538,0.0005475203,0.0005910018,0.00013535426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029537946,0.00015985938,0.00026869294,0.00012904833,0.00039507807,0.00026365466,0.0017439038,0.000065800916,0.000022132625],"category_scores_gemma":[0.00065825274,0.0000975639,0.00016062014,0.0005246855,0.00025462126,0.0012831019,0.00014145953,0.0005120145,0.000008664247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012782005,0.00008109597,0.000016747572,0.000002066834,0.00004107477,0.000037711678,0.0013579375,0.0000044428066,0.000647722,0.98147565,0.0008886383,0.0141687235],"study_design_scores_gemma":[0.00077296264,0.0017541978,0.00015268676,0.00001748075,0.000006147161,0.00017043766,0.0003586463,0.000013210894,0.009106488,0.9553033,0.03222951,0.00011490446],"about_ca_topic_score_codex":3.7621058e-7,"about_ca_topic_score_gemma":2.3797003e-7,"teacher_disagreement_score":0.5484638,"about_ca_system_score_codex":0.00008437473,"about_ca_system_score_gemma":0.00024429118,"threshold_uncertainty_score":0.39785403},"labels":[],"label_agreement":null},{"id":"W1972322699","doi":"10.1016/j.disc.2012.07.018","title":"Separation properties of 3-Steiner and 3-monophonic convexity in graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convexity; Combinatorics; Disjoint sets; Regular polygon; Convex set; Subderivative; Space (punctuation); Discrete mathematics; Convex optimization; Geometry; Computer science","score_opus":0.039361960832035935,"score_gpt":0.3071247290695605,"score_spread":0.2677627682375246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972322699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9208484,0.000642592,0.07717947,0.00007938289,0.000043597876,0.00023361472,0.000001591305,0.000029816034,0.0009414824],"genre_scores_gemma":[0.977451,0.000026291578,0.02239546,0.000012349281,0.000006131692,0.000018167984,6.557188e-7,0.000006691346,0.00008323369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991566,0.00005964125,0.00023584988,0.00012035457,0.0001970576,0.00023051973],"domain_scores_gemma":[0.99941623,0.000063212865,0.00008303239,0.000337323,0.00004065379,0.000059530586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052327744,0.00008979004,0.0001674828,0.0001204198,0.00003271403,0.00002717491,0.0002557773,0.000035337784,0.0000036782762],"category_scores_gemma":[0.000080619844,0.00006730652,0.00002823833,0.00029684743,0.00013330876,0.0005469736,0.00016830499,0.00008638655,0.0000097982365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012229488,0.0001498744,0.0064145005,0.0003920175,0.000016093434,0.000001144711,0.012577343,0.00003883942,0.027963918,0.9512938,0.000016053591,0.0011241663],"study_design_scores_gemma":[0.0012321661,0.00022782561,0.009476466,0.00043642003,0.000018313458,0.000038851147,0.0017973005,0.14318492,0.18012455,0.66258687,0.00019716365,0.0006791809],"about_ca_topic_score_codex":0.000004463558,"about_ca_topic_score_gemma":0.0000038017577,"teacher_disagreement_score":0.288707,"about_ca_system_score_codex":0.000012633187,"about_ca_system_score_gemma":0.000015670763,"threshold_uncertainty_score":0.27446803},"labels":[],"label_agreement":null},{"id":"W1973793988","doi":"10.1007/s00026-015-0251-3","title":"The Highly Connected Matroids in Minor-Closed Classes","year":2015,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Minor (academic); Combinatorics; Characterization (materials science); Class (philosophy); Graphic matroid; State (computer science); Discrete mathematics; Computer science; Algorithm; Physics","score_opus":0.0879982621014941,"score_gpt":0.35005088756509617,"score_spread":0.2620526254636021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973793988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95372856,0.0041199387,0.016152868,0.011909014,0.0012685086,0.0005424529,0.0000051660177,0.00022342865,0.01205005],"genre_scores_gemma":[0.99871427,0.00017693212,0.0004968353,0.00014114215,0.000013435427,0.0000143685265,0.0000010448732,0.000010340146,0.00043164447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812496,0.00027847965,0.00032038684,0.00023948165,0.00059177977,0.00044492926],"domain_scores_gemma":[0.9974425,0.0008103545,0.0001294027,0.00078240637,0.0006743418,0.00016100454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013203862,0.00012724027,0.0002090872,0.00018176904,0.00008589208,0.000084913736,0.0015962631,0.000066036904,0.0000011056339],"category_scores_gemma":[0.00077526044,0.000097515695,0.00006141514,0.0014167023,0.00016400211,0.00038712745,0.00034242187,0.00021822704,0.000023449378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000356005,0.000113242575,0.0022076291,0.00000805714,0.000010784703,0.00001583524,0.00021446991,0.000031923042,0.00016435854,0.99092054,0.003887141,0.0023904236],"study_design_scores_gemma":[0.000672376,0.00031516017,0.004082463,0.000015311687,0.0000011562935,0.0000037711663,0.000111611684,0.0016309961,0.011231133,0.9671897,0.014603547,0.00014271884],"about_ca_topic_score_codex":0.0000239782,"about_ca_topic_score_gemma":0.000011890398,"teacher_disagreement_score":0.04498568,"about_ca_system_score_codex":0.000029443001,"about_ca_system_score_gemma":0.00018131016,"threshold_uncertainty_score":0.39765745},"labels":[],"label_agreement":null},{"id":"W1973873776","doi":"10.1016/j.ic.2004.03.005","title":"Computing the vertex separation of unicyclic graphs","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Computer science; Vertex (graph theory); Mathematics; Discrete mathematics; Graph","score_opus":0.0162835703785676,"score_gpt":0.3142700028112472,"score_spread":0.2979864324326796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973873776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1498044,0.000029123179,0.84869504,0.00040525466,0.00006915262,0.00013569012,5.851022e-7,0.000051343137,0.00080938987],"genre_scores_gemma":[0.9870726,0.0000119698025,0.01266381,0.00023232575,0.000004075452,0.0000026029745,0.0000087995595,0.0000015307047,0.0000023229832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932337,0.000043375232,0.0002511872,0.000068743255,0.00021548098,0.00009786389],"domain_scores_gemma":[0.999461,0.000093387076,0.00014749543,0.00013121814,0.00013802198,0.000028911245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030425633,0.000058417838,0.00006520959,0.00014193091,0.00016615241,0.00010087307,0.00020830576,0.000024642528,6.8577594e-7],"category_scores_gemma":[0.000026554975,0.000044855442,0.00002385365,0.00046805566,0.00006538474,0.0014719402,0.00007783275,0.00007393703,0.0000135798555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004447049,0.000009597201,0.00007387632,0.0000116335395,0.0000058765586,1.3705419e-7,0.0029859475,0.054572325,0.000080945734,0.6592419,0.000019394667,0.28299388],"study_design_scores_gemma":[0.0006981235,0.00008745702,0.0091024535,0.000023480423,0.0000025489373,0.00001674814,0.0003159095,0.6757287,0.0010673688,0.31254756,0.00031500694,0.000094659554],"about_ca_topic_score_codex":0.000014182936,"about_ca_topic_score_gemma":0.0000022812026,"teacher_disagreement_score":0.8372682,"about_ca_system_score_codex":0.00001859867,"about_ca_system_score_gemma":0.00003955463,"threshold_uncertainty_score":0.18291518},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011223979419256062,"score_gpt":0.2711278830301002,"score_spread":0.25990390361084414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974199390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55374146,0.0010837165,0.43746212,0.0010660467,0.000057080204,0.0007913574,0.0000044174712,0.00010091658,0.0056928825],"genre_scores_gemma":[0.9828316,0.00020239934,0.015774576,0.000013557582,0.000008692584,0.00004637997,0.0000011408249,0.000020153053,0.0011014846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981577,0.000111708774,0.00033015833,0.0002747096,0.00050839677,0.00061733276],"domain_scores_gemma":[0.9978254,0.0010433448,0.00019973869,0.000795802,0.00008801432,0.000047699603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060778216,0.0001716785,0.00021799009,0.00009883403,0.00018281242,0.00005834732,0.0010052037,0.000047307432,0.0000476079],"category_scores_gemma":[0.00021381878,0.000109389446,0.000069471476,0.000854718,0.00029158744,0.0002669544,0.000247618,0.00028590293,0.0000502223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024588835,0.000092521244,0.000530096,0.000050557777,0.000034292374,0.0000047174744,0.0020580448,0.00027266782,0.00046844748,0.9897904,0.00003264446,0.0066410233],"study_design_scores_gemma":[0.00075509655,0.0002344064,0.00015779553,0.000101471975,0.000010294348,0.00007455184,0.00013444641,0.13940644,0.0092189545,0.84945756,0.00018414363,0.00026484008],"about_ca_topic_score_codex":0.00000428965,"about_ca_topic_score_gemma":0.00012377028,"teacher_disagreement_score":0.42909014,"about_ca_system_score_codex":0.000158617,"about_ca_system_score_gemma":0.00003584929,"threshold_uncertainty_score":0.4460772},"labels":[],"label_agreement":null},{"id":"W1975011389","doi":"10.1016/s0012-365x(00)00345-9","title":"Bounded vertex coloring of trees","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Bounded function; Combinatorics; Mathematics; Fractional coloring; Vertex (graph theory); Complete coloring; Chromatic scale; Brooks' theorem; Discrete mathematics; List coloring; Graph; Graph power; 1-planar graph; Chordal graph","score_opus":0.033826241284818,"score_gpt":0.3093333693216396,"score_spread":0.2755071280368216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975011389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20052123,0.000062569954,0.7766838,0.00016420484,0.00008839847,0.00018339221,0.0000022655213,0.00011848757,0.022175672],"genre_scores_gemma":[0.87085664,0.000027684997,0.12832624,0.000019397987,0.000011911157,0.0000128695765,9.4112e-7,0.000012883227,0.00073143543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889827,0.000034328397,0.00026025483,0.00018385763,0.0003524171,0.00027084458],"domain_scores_gemma":[0.9988466,0.00024312978,0.00010286338,0.0006642466,0.00007041978,0.00007276142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031818042,0.00010663814,0.00020222417,0.000107440115,0.00007464271,0.000060060993,0.0008709725,0.000034441044,0.00002632983],"category_scores_gemma":[0.00014050321,0.000089774054,0.00007439525,0.0004728382,0.00011044847,0.0002979514,0.00026026124,0.000092053924,0.000038998132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058679498,0.000064767024,0.00029540516,0.00004935468,0.000019710207,0.000014681585,0.0016642851,0.000048388694,0.0024531498,0.992641,0.00004692223,0.0026964962],"study_design_scores_gemma":[0.0003746188,0.00012433209,0.00055469404,0.000088520675,0.000007731776,0.00003476512,0.0005355,0.0672869,0.009029534,0.920838,0.0009145626,0.0002108442],"about_ca_topic_score_codex":0.0000024407238,"about_ca_topic_score_gemma":0.0000079287975,"teacher_disagreement_score":0.6703354,"about_ca_system_score_codex":0.000022533415,"about_ca_system_score_gemma":0.000027816035,"threshold_uncertainty_score":0.36608797},"labels":[],"label_agreement":null},{"id":"W1975017470","doi":"10.1016/j.disc.2009.07.015","title":"Graph-like spaces: An introduction","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Graph; Discrete mathematics; Combinatorics","score_opus":0.02130881350651235,"score_gpt":0.30365715907637125,"score_spread":0.2823483455698589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975017470","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020810978,0.000048829985,0.9729226,0.0032124573,0.00019283082,0.00021647627,0.000001847914,0.00034358443,0.0022503936],"genre_scores_gemma":[0.423011,0.000023312305,0.57531965,0.00032962393,0.00030126114,0.000015901838,0.000012010683,0.000024465398,0.00096280937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985584,0.0000695052,0.00022760275,0.00038089007,0.00040949468,0.00035411556],"domain_scores_gemma":[0.9984445,0.000051059935,0.000092179325,0.001181021,0.00008600301,0.00014524769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048534307,0.00015783096,0.00017865891,0.00017807983,0.00014529037,0.00024173503,0.0009442114,0.00005000933,0.000024008998],"category_scores_gemma":[0.00007810434,0.00013172241,0.00007200388,0.0006322769,0.00007693349,0.00093669404,0.00009664972,0.00016971932,0.000061062354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004004221,0.000098544406,0.000008160951,0.000016053315,0.0000069411676,0.000006135931,0.001564694,0.00012131826,0.0018239655,0.9887534,0.00048781274,0.0071089813],"study_design_scores_gemma":[0.0001681463,0.00026566716,0.0000983714,0.000012174677,0.0000055018745,0.000034180066,0.00034675765,0.027992468,0.0020612776,0.966124,0.0026574873,0.00023396254],"about_ca_topic_score_codex":8.129404e-7,"about_ca_topic_score_gemma":0.0000015440736,"teacher_disagreement_score":0.4022,"about_ca_system_score_codex":0.000024022913,"about_ca_system_score_gemma":0.000019427951,"threshold_uncertainty_score":0.53714836},"labels":[],"label_agreement":null},{"id":"W1975155259","doi":"10.1007/s00373-013-1286-z","title":"Subset-Sum Representations of Domination Polynomials","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Domination analysis; Graph; Discrete mathematics","score_opus":0.014489181128081844,"score_gpt":0.27050442430798644,"score_spread":0.2560152431799046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975155259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9284941,0.00072605105,0.0640113,0.0009037212,0.00047982592,0.00053918053,0.000004505039,0.00012333195,0.0047179996],"genre_scores_gemma":[0.99709463,0.0001301245,0.002425485,0.00002931934,0.0000043954087,0.000040698393,0.000001955436,0.0000056257186,0.00026777032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906904,0.00007436468,0.00019966479,0.00023009923,0.00023721672,0.00018961562],"domain_scores_gemma":[0.99899733,0.00018191122,0.000091336944,0.00041869126,0.00021960899,0.0000910964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023822865,0.00008343907,0.0001351969,0.00022476671,0.00011646466,0.00007728662,0.0003994868,0.000043719923,0.000014062913],"category_scores_gemma":[0.00006900575,0.000077883,0.00004667171,0.00080138416,0.00010967409,0.0005618105,0.00016911914,0.00008819712,0.000010388487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001893381,0.000051362476,0.004953992,0.000010554938,0.000008444916,9.070946e-7,0.0001857488,0.0000025650936,0.0018496176,0.9841523,0.00047457544,0.008308006],"study_design_scores_gemma":[0.0003507458,0.000074440926,0.02824223,0.0000058987694,0.0000029264938,0.0000037437906,0.00007931027,0.0013008007,0.0052519455,0.9644218,0.00017124174,0.000094923365],"about_ca_topic_score_codex":0.000061823004,"about_ca_topic_score_gemma":0.0000013929772,"teacher_disagreement_score":0.068600535,"about_ca_system_score_codex":0.000010844238,"about_ca_system_score_gemma":0.000021610753,"threshold_uncertainty_score":0.31759766},"labels":[],"label_agreement":null},{"id":"W1975172784","doi":"10.1016/j.jctb.2006.01.001","title":"Representation characterizations of chordal bipartite graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Chordal graph; Interval graph; Bipartite graph; Mathematics; Complete bipartite graph; Split graph; Discrete mathematics; Cograph; Distance-hereditary graph; Indifference graph; Graph; Line graph; 1-planar graph; Graph power","score_opus":0.012271149793242522,"score_gpt":0.2757147604491695,"score_spread":0.263443610655927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975172784","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8260499,0.00027286235,0.1644391,0.00057353213,0.004944343,0.00025971932,0.0000072469657,0.000066592525,0.0033866866],"genre_scores_gemma":[0.9964467,0.00004921814,0.002916095,0.000015297419,0.000287512,0.0000035206172,0.00000257427,0.000011779053,0.0002672563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799514,0.00043310598,0.00066794915,0.00014776741,0.00054092944,0.00021512876],"domain_scores_gemma":[0.9978443,0.0003228428,0.0006929959,0.0004012779,0.00065883336,0.000079773046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011834507,0.00012038622,0.00031150252,0.00037060597,0.00011708819,0.00008406423,0.0008168663,0.000058887854,0.00003397287],"category_scores_gemma":[0.00029897803,0.00010675494,0.00017694129,0.0010559837,0.00022309182,0.0018314702,0.00012918685,0.0002116489,0.0000031990064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033983708,0.00013307326,0.0013060682,0.000008570627,0.000030857114,0.0000150071155,0.00016088488,0.00011779156,0.021096572,0.975436,0.00013594227,0.0012194379],"study_design_scores_gemma":[0.00087716966,0.00045124465,0.0043646377,0.000024541037,0.000010285268,0.0000552514,0.0000360574,0.000037320788,0.05605224,0.9366279,0.0013674255,0.0000958818],"about_ca_topic_score_codex":0.000003303721,"about_ca_topic_score_gemma":5.518506e-7,"teacher_disagreement_score":0.17039683,"about_ca_system_score_codex":0.000028935256,"about_ca_system_score_gemma":0.00010186258,"threshold_uncertainty_score":0.43533403},"labels":[],"label_agreement":null},{"id":"W1975406723","doi":"10.1137/070687988","title":"Edge-Face Total Chromatic Number of Halin Graphs","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Discrete mathematics; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Graph; Computer science; Artificial intelligence","score_opus":0.01865966902696562,"score_gpt":0.3178651783919686,"score_spread":0.29920550936500295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975406723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30323017,0.00019284592,0.6772235,0.0013787358,0.0002976498,0.00035089193,0.000006692075,0.000121609155,0.017197886],"genre_scores_gemma":[0.84194976,0.000048210364,0.1572005,0.00011435307,0.000053682223,0.0000030863914,7.5017425e-7,0.00002121142,0.0006084342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974391,0.00014724968,0.00072199036,0.00024484063,0.00096127344,0.00048557538],"domain_scores_gemma":[0.99801373,0.00030132424,0.00046767664,0.00079657655,0.00016118177,0.00025952203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000958407,0.00024974384,0.00044021293,0.00022987359,0.00017585051,0.00018615964,0.0012650489,0.00007786487,0.00010704635],"category_scores_gemma":[0.00025177875,0.00018911359,0.00027440564,0.0006710815,0.0001256355,0.00053379074,0.00012842046,0.00051695807,0.00014669112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026390282,0.00044048394,0.000055339726,0.0001169275,0.000072101175,0.00011148882,0.0025569985,0.0005822236,0.0027561754,0.98415494,0.0005461089,0.00858084],"study_design_scores_gemma":[0.0005799631,0.0004876833,0.00040499453,0.00039367637,0.000015050266,0.0011472786,0.00027076225,0.01803291,0.005185787,0.9731222,0.00007103425,0.0002886855],"about_ca_topic_score_codex":3.036821e-7,"about_ca_topic_score_gemma":1.5246991e-7,"teacher_disagreement_score":0.5387196,"about_ca_system_score_codex":0.000053209696,"about_ca_system_score_gemma":0.00007151784,"threshold_uncertainty_score":0.77118284},"labels":[],"label_agreement":null},{"id":"W1975475652","doi":"10.2298/aadm100213014w","title":"Voting 'Against' in regular and nearly regular graphs","year":2010,"lang":"en","type":"article","venue":"Applicable Analysis and Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Strongly regular graph; Pathwidth; Line graph","score_opus":0.00830073800910323,"score_gpt":0.2578503158802581,"score_spread":0.24954957787115487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975475652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54897106,0.00015298772,0.44927555,0.00018963343,0.000008386517,0.00018610239,0.0000017839982,0.000051059935,0.0011634094],"genre_scores_gemma":[0.84835154,0.00006398716,0.15131058,0.00005645551,0.0000110058345,0.00003422532,0.0000033446188,0.000013025457,0.00015584045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983336,0.000046451434,0.00037284603,0.0005340657,0.00032447165,0.0003885867],"domain_scores_gemma":[0.99859786,0.00021100671,0.0001300456,0.000828653,0.000056215733,0.0001762425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711758,0.00018904825,0.00043804626,0.0004632688,0.00017930685,0.00031697852,0.00051772495,0.000092128015,0.00000684094],"category_scores_gemma":[0.0000759987,0.00015826267,0.000112460555,0.0020597633,0.00020174982,0.00035889677,0.00040747895,0.0002933715,0.0000044305375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032723983,0.000053944063,0.008384519,0.00006555415,0.00014453204,0.000013421796,0.000603057,0.00012226196,0.011759698,0.96642494,0.000010989237,0.012413796],"study_design_scores_gemma":[0.00035674436,0.00003163023,0.0028183572,0.000023423838,0.00011956002,0.000009951959,0.00032833262,0.45866492,0.002408482,0.53457314,0.0003132146,0.00035225842],"about_ca_topic_score_codex":0.000029651577,"about_ca_topic_score_gemma":0.00012996132,"teacher_disagreement_score":0.45854267,"about_ca_system_score_codex":0.000007226682,"about_ca_system_score_gemma":0.000014224674,"threshold_uncertainty_score":0.64537644},"labels":[],"label_agreement":null},{"id":"W1975584720","doi":"10.7151/dmgt.1727","title":"On the complexity of the 3-kernel problem in some classes of digraphs","year":2013,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Kernel (algebra); Vertex (graph theory); Discrete mathematics; Computational complexity theory; Graph; Algorithm","score_opus":0.035712373019534484,"score_gpt":0.27579385258276223,"score_spread":0.24008147956322776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975584720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91613,0.00031415027,0.058044903,0.01053798,0.00023273438,0.003668124,0.00002496215,0.00015735014,0.010889812],"genre_scores_gemma":[0.9949194,0.000016448688,0.004475475,0.0001370157,0.0000066564176,0.00020193006,6.158576e-7,0.000019723644,0.00022272082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968584,0.00096182973,0.000656863,0.00037039735,0.0007324488,0.0004200619],"domain_scores_gemma":[0.99561983,0.0019492448,0.00038301852,0.001843397,0.00012871272,0.00007577515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017313409,0.00024912134,0.00042186357,0.00030854688,0.00018712894,0.00004986867,0.0028052044,0.000071683404,0.0001375339],"category_scores_gemma":[0.00047312505,0.00009933521,0.00031076896,0.0014597125,0.0020981089,0.00046448904,0.0007122588,0.00035114423,0.000035522266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019384755,0.00037226602,0.00036778048,0.00013053103,0.000027308777,5.543302e-7,0.0017124466,0.000028062514,0.0025369523,0.9936108,0.00011913422,0.0010747808],"study_design_scores_gemma":[0.0002177611,0.000059948165,0.008259601,0.00036957455,0.000005790626,0.0000028242262,0.00083254505,0.000707799,0.006558246,0.98284245,0.000006064395,0.00013738315],"about_ca_topic_score_codex":0.000010617717,"about_ca_topic_score_gemma":0.0000049423743,"teacher_disagreement_score":0.07878943,"about_ca_system_score_codex":0.000015837057,"about_ca_system_score_gemma":0.000047005204,"threshold_uncertainty_score":0.7730569},"labels":[],"label_agreement":null},{"id":"W1975645051","doi":"10.1016/s0012-365x(02)00518-6","title":"Factor d-domatic colorings of graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Fractional coloring; Discrete mathematics; Edge coloring; Vertex (graph theory); Disjoint sets; Graph; Graph power; Line graph","score_opus":0.029955070364367387,"score_gpt":0.2972155256529396,"score_spread":0.26726045528857223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975645051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20126113,0.00009475795,0.7689447,0.00006210261,0.00008047451,0.00036756732,0.000007328212,0.00013067729,0.029051285],"genre_scores_gemma":[0.779806,0.000009724956,0.21982682,0.00001697332,0.0000019845168,0.000018734,4.9309944e-7,0.00001460872,0.0003046461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861443,0.00007855602,0.00035646211,0.00021418554,0.00042716792,0.000309227],"domain_scores_gemma":[0.99850976,0.00034601198,0.00017027075,0.0007878499,0.000086333996,0.00009976979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036816273,0.00014425811,0.00026692706,0.00015457852,0.00006854019,0.000049915045,0.0007916924,0.00004313914,0.00005127139],"category_scores_gemma":[0.0003762318,0.000117703705,0.00011073315,0.0006017123,0.00013039474,0.00028624813,0.00013195052,0.000114325085,0.000045361412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011293282,0.000051659543,0.00015660458,0.00013951048,0.000017728738,0.0000033337283,0.0010433714,0.000010615645,0.0021447886,0.9961787,0.000014045174,0.00023850612],"study_design_scores_gemma":[0.00024763215,0.00008539627,0.0001382911,0.000060896,0.0000058069345,0.00001465956,0.0002614645,0.0031725778,0.03210167,0.96337974,0.00035205373,0.00017982857],"about_ca_topic_score_codex":8.5335927e-7,"about_ca_topic_score_gemma":5.8450837e-7,"teacher_disagreement_score":0.57854486,"about_ca_system_score_codex":0.000017915225,"about_ca_system_score_gemma":0.000038102087,"threshold_uncertainty_score":0.47998178},"labels":[],"label_agreement":null},{"id":"W1975847110","doi":"10.2298/yjor130402037h","title":"On the maximum orders of an induced forest, an induced tree, and a stable set","year":2013,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Tree (set theory); Integer (computer science); Order (exchange); Upper and lower bounds; Set (abstract data type); Stability (learning theory); Discrete mathematics; Computer science","score_opus":0.12365718098265857,"score_gpt":0.40012774714530297,"score_spread":0.2764705661626444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975847110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98807937,0.000041149156,0.007516793,0.0029506332,0.00005212987,0.0005592032,0.0000037077207,0.000011102342,0.0007858899],"genre_scores_gemma":[0.9921883,0.00002797495,0.0074607097,0.000079456324,0.00005148142,0.000042226915,0.0000016882542,0.000017544215,0.00013064076],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959069,0.001437669,0.00047748358,0.0002937733,0.0013573029,0.0005269031],"domain_scores_gemma":[0.99591464,0.0007491548,0.00008857543,0.0008961968,0.0020035529,0.00034788364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00430008,0.00014419029,0.0002424023,0.00086935505,0.00064190157,0.0006687393,0.0017814807,0.00008664817,0.0001229167],"category_scores_gemma":[0.0009855723,0.000092798866,0.00005448219,0.0014279935,0.00027009705,0.0027276939,0.00030858768,0.0010770557,0.000020627584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042809482,0.0016977974,0.0013540582,0.000053838525,0.00024723043,0.000121360375,0.01087704,0.0119218305,0.4730525,0.38770947,0.004012693,0.108524084],"study_design_scores_gemma":[0.0048934473,0.022200892,0.025678527,0.00029455527,0.0000205781,0.000527471,0.012641801,0.42915714,0.10496934,0.398215,0.00051291037,0.0008883467],"about_ca_topic_score_codex":0.00040048506,"about_ca_topic_score_gemma":0.00035400686,"teacher_disagreement_score":0.4172353,"about_ca_system_score_codex":0.00006945004,"about_ca_system_score_gemma":0.0005712794,"threshold_uncertainty_score":0.6448669},"labels":[],"label_agreement":null},{"id":"W1976120600","doi":"10.1142/s0129054100000260","title":"ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":231,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Clique graph; Treewidth; Split graph; Vertex (graph theory); Chordal graph; Block graph; Bounded function; Graph; Pathwidth; Line graph; Graph power; 1-planar graph","score_opus":0.02382651196834527,"score_gpt":0.33623674160293426,"score_spread":0.312410229634589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976120600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37440827,0.0000502351,0.61966443,0.0039032467,0.0008907479,0.00009549627,0.0000035797173,0.00001264469,0.0009713812],"genre_scores_gemma":[0.95032835,0.00007942262,0.049126364,0.00030050386,0.000116052724,0.0000017667141,3.3876967e-7,0.000004105625,0.000043086893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717027,0.00013327085,0.00058852386,0.00021535243,0.0016952883,0.00019726862],"domain_scores_gemma":[0.99630654,0.0009641348,0.0004787083,0.000487684,0.0016786505,0.00008428536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018253544,0.00010640214,0.00017831508,0.00078667485,0.00016747255,0.00021664215,0.0051240656,0.000022934597,0.000102721315],"category_scores_gemma":[0.00025902104,0.00007300705,0.00017092827,0.0010314904,0.0009882601,0.0020103317,0.0002492574,0.00023026299,0.000014810509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049597016,0.0002085791,0.00025628592,0.0000032294267,0.000055325407,0.0000088259985,0.00033218032,0.012937823,0.0022161477,0.85488015,0.00022306415,0.1288288],"study_design_scores_gemma":[0.0007749217,0.0011839281,0.012509936,0.00025281182,0.000009521324,0.0002507737,0.000022486203,0.059721336,0.024582379,0.8988541,0.0016170484,0.00022077531],"about_ca_topic_score_codex":0.000005303869,"about_ca_topic_score_gemma":0.0000010533792,"teacher_disagreement_score":0.5759201,"about_ca_system_score_codex":0.00007083338,"about_ca_system_score_gemma":0.0004672889,"threshold_uncertainty_score":0.9521874},"labels":[],"label_agreement":null},{"id":"W1976525036","doi":"10.1016/j.tcs.2012.12.025","title":"Weak near-unanimity functions and digraph homomorphism problems","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Digraph; Unanimity; Homomorphism; Mathematics; Combinatorics; Conjecture; Algebraic number; Context (archaeology); Discrete mathematics; Constraint satisfaction problem; Measure (data warehouse); Computer science","score_opus":0.013713714101190025,"score_gpt":0.24758432885136222,"score_spread":0.2338706147501722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976525036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0965171,0.00007090514,0.89500046,0.0018935085,0.00033139854,0.0004682768,0.0000015015554,0.0003287174,0.005388164],"genre_scores_gemma":[0.8977809,0.00001052455,0.10175448,0.0002618945,0.000050024617,0.000051162544,5.256496e-7,0.0000108225095,0.00007968724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966635,0.0001385789,0.00028557886,0.0011206274,0.0008509414,0.0009407915],"domain_scores_gemma":[0.9973427,0.00032028375,0.00006290417,0.0012951709,0.0003613168,0.00061759533],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001418593,0.00024109302,0.00023757594,0.00026211192,0.0011891312,0.0014691399,0.0024742584,0.00006486375,0.00011855037],"category_scores_gemma":[0.000105831146,0.00019190535,0.000069712594,0.0021539908,0.008800505,0.001984971,0.002042435,0.0003886626,0.0003822318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023860857,0.00005510635,0.0004477643,0.0000071454947,0.0000042207275,0.0000031472368,0.00022570837,0.000077762714,0.00096080836,0.9542558,0.0001273515,0.043832798],"study_design_scores_gemma":[0.00020962619,0.00024772904,0.008115592,0.00002024437,0.0000027650049,0.000079965255,0.000012233211,0.33899698,0.00045906327,0.65121675,0.00036998876,0.00026907978],"about_ca_topic_score_codex":0.000017641387,"about_ca_topic_score_gemma":0.000001426577,"teacher_disagreement_score":0.8012638,"about_ca_system_score_codex":0.000041481475,"about_ca_system_score_gemma":0.00011503427,"threshold_uncertainty_score":0.99956745},"labels":[],"label_agreement":null},{"id":"W1976577139","doi":"10.1016/j.dam.2012.01.024","title":"Finding and listing induced paths and cycles","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Listing (finance); Time complexity; Running time; Discrete mathematics; Algorithm","score_opus":0.047435364140021107,"score_gpt":0.3154596740394087,"score_spread":0.26802430989938764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976577139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6389355,0.00018077306,0.3509968,0.000075899974,0.000041875188,0.0002610553,0.0000019499792,0.00013025219,0.009375917],"genre_scores_gemma":[0.7996876,0.000013278386,0.20017785,0.000031042524,0.00003209703,0.000022020557,7.6628373e-7,0.000013807278,0.00002149045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989687,0.000016792568,0.00018672702,0.0002157316,0.00021250545,0.00039950595],"domain_scores_gemma":[0.9990419,0.00034274225,0.000088075074,0.00034555804,0.000016511176,0.00016521974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055818807,0.00014138139,0.00017538563,0.00008699736,0.0001900093,0.00013634493,0.00028013653,0.000052846604,0.0000030803712],"category_scores_gemma":[0.00009261602,0.000120099205,0.000017981494,0.00019354526,0.00008010338,0.00034322223,0.00052327017,0.00015549871,0.000011560198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016321324,0.000021155469,0.00030824542,0.000095284406,0.000009018214,0.0000012263415,0.0051624267,9.1555086e-7,0.018224718,0.9579905,0.000005937463,0.018178904],"study_design_scores_gemma":[0.00075530994,0.00006289844,0.0037359863,0.00014542897,0.000027483886,0.00009053021,0.004269614,0.02150313,0.023693494,0.94465566,0.0002203911,0.00084007776],"about_ca_topic_score_codex":0.0000010198085,"about_ca_topic_score_gemma":4.1588876e-7,"teacher_disagreement_score":0.16075215,"about_ca_system_score_codex":0.000012092875,"about_ca_system_score_gemma":0.000008465665,"threshold_uncertainty_score":0.48975033},"labels":[],"label_agreement":null},{"id":"W1976619117","doi":"10.1016/j.disc.2005.12.053","title":"The firefighter problem for graphs of maximum degree three","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Degree (music); Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.03299384743016334,"score_gpt":0.28530295995360117,"score_spread":0.2523091125234378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976619117","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054456666,0.00019324294,0.9860652,0.00064451236,0.000062149695,0.00070306275,0.000015385283,0.00007746134,0.0067933057],"genre_scores_gemma":[0.23010328,0.000016050783,0.76844066,0.000028964218,0.000044906188,0.00026907487,0.0000069230286,0.000041720006,0.0010484075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998574,0.000029254243,0.0003962966,0.00022767633,0.00037797596,0.00039477105],"domain_scores_gemma":[0.99804664,0.00066761236,0.00019012234,0.00089554494,0.00015692366,0.00004314199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006228808,0.00014849566,0.00019621893,0.00007172758,0.00024022123,0.00011211527,0.0013180223,0.000046694833,0.0000038226653],"category_scores_gemma":[0.00006222131,0.00008903495,0.00016005439,0.00034476205,0.00020458114,0.00019838975,0.00024371773,0.000095729694,0.000010397784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007251819,0.000040171635,0.00009221046,0.00010532965,0.000016279713,9.4473364e-7,0.00017117245,0.000027346447,0.0003928446,0.99206185,0.00046527927,0.006619341],"study_design_scores_gemma":[0.00022431806,0.00007059311,0.00015900197,0.000034310455,0.0000068289783,0.0000045459524,0.00003308402,0.017915094,0.0027634616,0.97746426,0.0012073483,0.000117177624],"about_ca_topic_score_codex":0.000005516436,"about_ca_topic_score_gemma":0.000047124922,"teacher_disagreement_score":0.22465762,"about_ca_system_score_codex":0.0000142427525,"about_ca_system_score_gemma":0.000028303755,"threshold_uncertainty_score":0.36307397},"labels":[],"label_agreement":null},{"id":"W1976828798","doi":"10.1016/j.jctb.2008.03.003","title":"Projective geometries in dense matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Prime power; Minor (academic); Mathematics; Integer (computer science); Projective plane; Prime (order theory); Simple (philosophy); Discrete mathematics; Computer science; Geometry","score_opus":0.017698982939964993,"score_gpt":0.2748469373574108,"score_spread":0.2571479544174458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976828798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9434649,0.0009300043,0.046995528,0.00043697827,0.004902079,0.00029789392,0.000002034523,0.000064889224,0.0029057243],"genre_scores_gemma":[0.99431336,0.00019088761,0.004799469,0.000039098075,0.00026517097,0.00000575069,1.7509151e-7,0.000015633148,0.00037044083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764013,0.00052712095,0.00056059205,0.00020009044,0.0006843693,0.0003877146],"domain_scores_gemma":[0.9978878,0.00070253736,0.0003446235,0.0003953062,0.0005320495,0.00013766924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023480458,0.0001745462,0.00041686892,0.00083712494,0.00017856491,0.0000737155,0.0012519968,0.000087314635,0.000023029277],"category_scores_gemma":[0.0012187174,0.00014712127,0.00014924331,0.001614198,0.00040085163,0.0021397423,0.00027354294,0.0005727969,0.000010096493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013393189,0.00016169607,0.0016956234,0.00000887116,0.00003832327,0.00062479713,0.002030174,0.00004517385,0.0007542054,0.9918417,0.00016099753,0.0012991462],"study_design_scores_gemma":[0.0015138717,0.0011268448,0.0018042695,0.000032588898,0.000003688912,0.0011634221,0.00035849708,0.00001204737,0.01053858,0.98038656,0.0028897082,0.00016990518],"about_ca_topic_score_codex":0.0000024230662,"about_ca_topic_score_gemma":8.839169e-7,"teacher_disagreement_score":0.050848506,"about_ca_system_score_codex":0.00015427772,"about_ca_system_score_gemma":0.00037063667,"threshold_uncertainty_score":0.5999431},"labels":[],"label_agreement":null},{"id":"W1977227483","doi":"10.1007/s00037-009-0266-4","title":"Space-Efficient Counting in Graphs on Surfaces","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Modulo; Discrete mathematics; Algebraic number; Planar graph; Counting problem; Graph","score_opus":0.0639715632429065,"score_gpt":0.3344310122917777,"score_spread":0.2704594490488712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977227483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65685713,0.00006438318,0.33604938,0.0021175034,0.00012108069,0.00022875091,0.0000052543805,0.00017299352,0.004383501],"genre_scores_gemma":[0.94621146,0.0000011049843,0.05325783,0.00047112518,0.000017054843,0.000004112064,0.000008953378,0.000005550945,0.000022791804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979746,0.00017426677,0.00026419703,0.0004929585,0.0006911394,0.00040285912],"domain_scores_gemma":[0.99886936,0.00043996534,0.000085172396,0.00034437035,0.00016205493,0.0000990966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006501749,0.00016305948,0.00018963603,0.00036471285,0.00021927443,0.00012958735,0.00080035994,0.00003706565,0.000016755832],"category_scores_gemma":[0.00009169962,0.00016433549,0.000066113156,0.0011283841,0.00015156786,0.0002105035,0.00013344319,0.0002774661,0.00008046707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014107103,0.00011925157,0.00070181413,0.0000024397414,0.0000021282103,0.000014525061,0.00010405519,0.3730081,0.00004894079,0.624627,0.000056320358,0.0013013076],"study_design_scores_gemma":[0.00021715532,0.0000696131,0.12683178,0.000013637564,2.982125e-7,0.000005162826,0.0000068933696,0.3967496,0.00004638612,0.47591004,0.000049317605,0.00010012271],"about_ca_topic_score_codex":0.0000113230035,"about_ca_topic_score_gemma":0.000008319575,"teacher_disagreement_score":0.28935432,"about_ca_system_score_codex":0.00009921866,"about_ca_system_score_gemma":0.00007336025,"threshold_uncertainty_score":0.6701407},"labels":[],"label_agreement":null},{"id":"W1977358807","doi":"10.1016/j.aam.2012.03.004","title":"On minor-closed classes of matroids with exponential growth rate","year":2012,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Exponential function; Matroid; Base (topology); Integer (computer science); Minor (academic); Prime power; Exponential growth; Prime (order theory); Discrete mathematics; Mathematical analysis","score_opus":0.013725122250598564,"score_gpt":0.2805289442160489,"score_spread":0.2668038219654503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977358807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.160908,0.00034743335,0.8154036,0.000036767473,0.00012722614,0.0005191675,0.0000033884037,0.000105876876,0.022548582],"genre_scores_gemma":[0.70819527,0.000049002258,0.29158062,0.000028319126,0.000023900244,0.00006636628,0.0000011600351,0.000019034926,0.00003633217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829704,0.000044522447,0.00038145023,0.00028175698,0.00046493954,0.0005303077],"domain_scores_gemma":[0.9980192,0.000934036,0.00022955908,0.00066253345,0.000051026804,0.00010360173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058859,0.00021843077,0.00034163182,0.00023867446,0.000053493193,0.000027353502,0.00082348,0.00005424203,0.000012847307],"category_scores_gemma":[0.00009169135,0.00017019376,0.000041813582,0.0006661364,0.00020058002,0.00060095766,0.00018318502,0.00020580985,0.000042465213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007154402,0.00037461388,0.00036017588,0.00022799271,0.000008994686,0.0000045764054,0.0006463378,0.00021207966,0.004269148,0.9911517,0.000012440242,0.0026604056],"study_design_scores_gemma":[0.0012193671,0.00023455059,0.0005036057,0.00014102068,0.000009683022,0.000012333846,0.0003308613,0.001309189,0.08706839,0.9084948,0.00028569732,0.0003905346],"about_ca_topic_score_codex":6.5963974e-7,"about_ca_topic_score_gemma":0.0000034535797,"teacher_disagreement_score":0.5472873,"about_ca_system_score_codex":0.0000420519,"about_ca_system_score_gemma":0.000028412793,"threshold_uncertainty_score":0.69403},"labels":[],"label_agreement":null},{"id":"W1977507713","doi":"10.1007/s10878-007-9106-0","title":"Lower bounds and a tabu search algorithm for the minimum deficiency problem","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Theory of computation; Tabu search; Graph; Graph coloring; Edge coloring; Neighbourhood (mathematics); Discrete mathematics; Algorithm; Graph power; Line graph","score_opus":0.01375133543579926,"score_gpt":0.2907933059047155,"score_spread":0.27704197046891627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977507713","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010878049,0.00046154181,0.9954109,0.000511304,0.0019690131,0.00034713003,9.737748e-7,0.000015214237,0.00019607588],"genre_scores_gemma":[0.123230524,0.00017716459,0.87590384,0.000065602115,0.00049782306,0.0000074421396,8.1200824e-7,0.000019813855,0.00009699572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983963,0.000081684,0.0004218218,0.00016315865,0.0006101715,0.00032688287],"domain_scores_gemma":[0.99765545,0.00081225135,0.00024592748,0.00022074644,0.00094210304,0.00012354043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034740446,0.00010686861,0.00016663896,0.00022941398,0.0003153585,0.00024527093,0.00068100955,0.000070041155,0.00000415566],"category_scores_gemma":[0.00018893875,0.00007456545,0.00008202333,0.00064603717,0.000121482,0.00075377006,0.00013211623,0.00024662606,6.2443064e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065313844,0.0006683498,0.00017885692,0.000050270646,0.000100068726,0.000049106322,0.001859062,0.120255,0.00064007496,0.5657966,0.00076721376,0.30898225],"study_design_scores_gemma":[0.0035990765,0.0019335845,0.00012309251,0.000043057116,0.000027714252,0.00015528168,0.00016293798,0.861908,0.0011458473,0.12791969,0.0027541048,0.00022758146],"about_ca_topic_score_codex":0.0000014956249,"about_ca_topic_score_gemma":1.8023759e-7,"teacher_disagreement_score":0.741653,"about_ca_system_score_codex":0.000071223476,"about_ca_system_score_gemma":0.0001691695,"threshold_uncertainty_score":0.30406907},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025549136054115698,"score_gpt":0.30638295864821063,"score_spread":0.28083382259409495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977677776","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031360254,0.00043936106,0.9643711,0.0010689965,0.000095328265,0.0012980463,0.000017376757,0.00026418318,0.0010853484],"genre_scores_gemma":[0.41824177,0.00022288131,0.5790252,0.000114262344,0.00011564558,0.0006747631,0.000029023999,0.000109005,0.0014674037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617326,0.00011342404,0.00073229667,0.0007429824,0.0007187267,0.001519306],"domain_scores_gemma":[0.99540836,0.00135414,0.00028592613,0.0026423591,0.00016045236,0.00014877369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013054911,0.00043081897,0.00051356235,0.00048908964,0.00023933176,0.00023767588,0.0038567274,0.00016438028,0.000052617113],"category_scores_gemma":[0.0023973347,0.00035834583,0.00020569224,0.0015399972,0.00021877358,0.0008552513,0.0009102571,0.00050180795,0.000028192426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001071098,0.00022677837,0.00024349145,0.0002622521,0.00005424452,0.000011332021,0.0010362283,0.00016280414,0.00095307373,0.98187387,0.00026990953,0.014798914],"study_design_scores_gemma":[0.0016140114,0.00039419843,0.00003900476,0.0001083791,0.000015890933,0.00005830261,0.00013332498,0.09852235,0.0066670943,0.8909359,0.001052503,0.0004590595],"about_ca_topic_score_codex":0.000006953282,"about_ca_topic_score_gemma":0.00021891583,"teacher_disagreement_score":0.38688153,"about_ca_system_score_codex":0.00026248378,"about_ca_system_score_gemma":0.00024049662,"threshold_uncertainty_score":0.9998869},"labels":[],"label_agreement":null},{"id":"W1977889556","doi":"10.1016/s0012-365x(02)00803-8","title":"Finding a maximum induced matching in weakly chordal graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Bipartite graph; Matching (statistics); Split graph; 3-dimensional matching; Interval graph; Vertex (graph theory); Indifference graph; Discrete mathematics; Factor-critical graph; Cardinality (data modeling); Pathwidth; Graph; 1-planar graph; Line graph; Graph power; Computer science","score_opus":0.03729535450122503,"score_gpt":0.314509867878203,"score_spread":0.277214513376978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977889556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4711958,0.000049024053,0.5146851,0.00013202737,0.00014123463,0.00033874816,0.0000019906167,0.00013766142,0.013318446],"genre_scores_gemma":[0.8017177,0.00000739805,0.19803077,0.000050851435,0.000008141985,0.000037020534,0.0000010704441,0.000026562651,0.00012048106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979033,0.00016663918,0.00042078877,0.00040716497,0.00048178312,0.00062035135],"domain_scores_gemma":[0.9985908,0.00030535756,0.00012577626,0.0008053011,0.000041654323,0.00013106928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011500817,0.00022375351,0.0002906476,0.00040630522,0.00014245296,0.00020183228,0.000992628,0.00008448972,0.000027302658],"category_scores_gemma":[0.00030422656,0.00020214815,0.00010117021,0.0011536344,0.00005538844,0.00055629003,0.00024086889,0.00040551543,0.00007327382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024877086,0.0000658165,0.00027451466,0.00006148247,0.000010789206,0.000038287395,0.0040242164,0.0000713308,0.005174673,0.9889847,0.000010233135,0.0012814901],"study_design_scores_gemma":[0.00031538747,0.000041369956,0.00018688502,0.00010080358,0.0000026933262,0.000034778048,0.0007581557,0.004950831,0.0048175924,0.9884361,0.00008511935,0.0002703003],"about_ca_topic_score_codex":0.0000065111713,"about_ca_topic_score_gemma":0.000012361425,"teacher_disagreement_score":0.3305219,"about_ca_system_score_codex":0.00006364538,"about_ca_system_score_gemma":0.000059799386,"threshold_uncertainty_score":0.8243362},"labels":[],"label_agreement":null},{"id":"W1978292808","doi":"10.1090/s0002-9947-09-04874-0","title":"Varieties with few subalgebras of powers","year":2009,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Conjecture; Algorithm; Mathematics; Artificial intelligence; Computer science; Combinatorics","score_opus":0.01388077732672764,"score_gpt":0.27560731840426334,"score_spread":0.2617265410775357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978292808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06953793,0.00010806221,0.9250313,0.003607259,0.000044021213,0.00039538892,0.00002099118,0.000056392244,0.001198642],"genre_scores_gemma":[0.90374833,0.00009881554,0.095370516,0.0002453407,0.000010979276,0.000007965851,2.514135e-7,0.000018995723,0.0004988311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973345,0.0002254086,0.0005577743,0.00038455307,0.000980511,0.0005172867],"domain_scores_gemma":[0.9970535,0.000625937,0.0005252942,0.0013559887,0.00028075537,0.00015853433],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005729655,0.0002887969,0.00072962855,0.000056283116,0.00028405592,0.000048901038,0.0016778775,0.00006990487,0.00013208097],"category_scores_gemma":[0.00005303305,0.00018929456,0.0007744415,0.0021857999,0.0039312113,0.00030811827,0.000048721704,0.00053890154,0.000012616936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064398575,0.0047075143,0.0003140699,0.0012163613,0.0016862038,0.000005107072,0.033530284,0.0054326328,0.015278361,0.8685807,0.0005902191,0.068014555],"study_design_scores_gemma":[0.0013758623,0.0044534276,0.006058062,0.00064905087,0.000564795,0.000088270164,0.009777079,0.027773064,0.034893945,0.9132773,0.00015526955,0.00093381875],"about_ca_topic_score_codex":0.000037799142,"about_ca_topic_score_gemma":0.0000019785748,"teacher_disagreement_score":0.8342104,"about_ca_system_score_codex":0.000070668284,"about_ca_system_score_gemma":0.00020793059,"threshold_uncertainty_score":0.99877954},"labels":[],"label_agreement":null},{"id":"W1978631091","doi":"10.1016/j.disc.2007.12.075","title":"The obstructions for toroidal graphs with no <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si14.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>’s","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toroid; Combinatorics; Mathematics; Planar graph; Subdivision; Discrete mathematics; Physics; Graph","score_opus":0.021273118216842864,"score_gpt":0.25545277334377403,"score_spread":0.23417965512693117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978631091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5383571,0.0025780017,0.026604874,0.0015531448,0.0053514647,0.0002629815,0.0016915593,0.00075924775,0.42284164],"genre_scores_gemma":[0.96034575,0.0021194383,0.027221145,0.001247432,0.0023554312,0.0028330116,0.0013163701,0.0013716064,0.0011898432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9842185,0.0007247315,0.0030106653,0.0029353797,0.0047170343,0.0043937066],"domain_scores_gemma":[0.9852448,0.004281813,0.0031731185,0.004858037,0.000571606,0.0018706431],"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.0033839492,0.0015889372,0.0006726749,0.0008592631,0.0048041767,0.0028878457,0.0055131093,0.002488139,0.11293441],"category_scores_gemma":[0.003201773,0.0025461668,0.0029695765,0.0025971108,0.004569324,0.0028715099,0.0037001083,0.0027885395,0.002406884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016372877,0.0004950129,0.000015053388,0.0017596179,0.0021370912,0.0011666326,0.004469086,0.0020050488,0.0015671663,0.79493946,0.18789183,0.001916723],"study_design_scores_gemma":[0.0032607242,0.0032501575,0.000071494826,0.0019249857,0.00177652,0.0037284077,0.004239749,0.19089077,0.7757628,0.0040840725,0.007986125,0.003024171],"about_ca_topic_score_codex":0.0007478027,"about_ca_topic_score_gemma":0.001424719,"teacher_disagreement_score":0.79085535,"about_ca_system_score_codex":0.000042679352,"about_ca_system_score_gemma":0.0024070863,"threshold_uncertainty_score":0.99986756},"labels":[],"label_agreement":null},{"id":"W1979091665","doi":"10.1016/j.jctb.2010.06.001","title":"The number of points in a matroid with no n-point line as a minor","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Minor (academic); Combinatorics; Rank (graph theory); Mathematics; Prime power; Line (geometry); Integer (computer science); Point (geometry); Prime (order theory); Projective plane; Oriented matroid; Discrete mathematics; Graphic matroid; Geometry; Computer science; Humanities","score_opus":0.005835806336886248,"score_gpt":0.27290845197337554,"score_spread":0.2670726456364893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979091665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817357,0.0000974929,0.005162324,0.001413142,0.0050979964,0.0002647615,0.0000018622079,0.000023163328,0.0062035313],"genre_scores_gemma":[0.98752445,0.000043032655,0.0114384005,0.000050474184,0.00032413332,0.0000065211484,1.5321366e-7,0.000019756351,0.0005930774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978074,0.00042288675,0.0005989714,0.00016293746,0.0006663649,0.0003414401],"domain_scores_gemma":[0.99694115,0.0009864406,0.00054225296,0.00060919713,0.0007798194,0.00014116385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035598837,0.0001662334,0.00035578996,0.00014209945,0.00012641486,0.00011261897,0.001599329,0.000078885496,0.000078141835],"category_scores_gemma":[0.0011104454,0.00009922233,0.00012252241,0.00053012377,0.0004808045,0.0009691399,0.00025887656,0.00084798265,0.000026482317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003329225,0.00014843061,0.0005264016,0.000011227809,0.000040548457,0.00008588229,0.0004621675,0.0000050145186,0.0038093904,0.99017483,0.000055407938,0.0013514725],"study_design_scores_gemma":[0.0017305702,0.001074098,0.00027216176,0.000055972712,0.0000062253134,0.0006453151,0.00017540631,0.000025480711,0.014033315,0.9778657,0.0039944714,0.0001212859],"about_ca_topic_score_codex":0.0000043623304,"about_ca_topic_score_gemma":0.0000083365085,"teacher_disagreement_score":0.012309134,"about_ca_system_score_codex":0.000033380657,"about_ca_system_score_gemma":0.00028759608,"threshold_uncertainty_score":0.40461692},"labels":[],"label_agreement":null},{"id":"W1979119667","doi":"10.1109/lics.2012.24","title":"Near Unanimity Constraints Have Bounded Pathwidth Duality","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Nondeterministic algorithm; Unanimity; Bounded function; Conjecture; Constraint satisfaction problem; Mathematics; Duality (order theory); Discrete mathematics; Equivalence (formal languages); Backtracking; Combinatorics; Mathematical optimization","score_opus":0.04729336190534559,"score_gpt":0.3271589810276005,"score_spread":0.2798656191222549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979119667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1297197,0.00007758439,0.8019044,0.0005437435,0.0003094206,0.00026001647,0.000006174054,0.00036629572,0.06681266],"genre_scores_gemma":[0.9162417,0.0000030770075,0.082557745,0.00040083076,0.000043664404,0.000009372003,0.0000013285585,0.0000075673347,0.00073469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811137,0.0002375333,0.0001929634,0.00031927612,0.00041858116,0.00072027347],"domain_scores_gemma":[0.9984885,0.00021169565,0.0000510462,0.00081296137,0.00009875833,0.0003370751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012527526,0.00013741899,0.00015477483,0.00005336711,0.0002579076,0.00018879701,0.0008091488,0.000064348664,0.00030790543],"category_scores_gemma":[0.00016088337,0.00011586204,0.000070999886,0.00028302675,0.00054708176,0.001045594,0.0004716156,0.00021697246,0.00039819325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071019563,0.00011776071,0.0194934,0.000006386718,0.000012251283,0.000006645851,0.00058752194,0.0000026713283,0.0003864067,0.95640415,0.0003016257,0.022674056],"study_design_scores_gemma":[0.0019459721,0.00022563565,0.111384295,0.000024735793,0.000010738903,0.00018223337,0.0005267993,0.013703324,0.030491645,0.8028456,0.03739641,0.0012626284],"about_ca_topic_score_codex":0.000022818609,"about_ca_topic_score_gemma":0.000011089614,"teacher_disagreement_score":0.78652203,"about_ca_system_score_codex":0.000057205125,"about_ca_system_score_gemma":0.000095685435,"threshold_uncertainty_score":0.5118101},"labels":[],"label_agreement":null},{"id":"W1979477295","doi":"10.1016/j.disc.2004.07.022","title":"The graphs with maximum induced matching and maximum matching the same size","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Factor-critical graph; Characterization (materials science); 3-dimensional matching; Graph; Cograph; Discrete mathematics; Simple (philosophy); Line graph; Bipartite graph; Pathwidth; Voltage graph; Statistics","score_opus":0.019029947364102493,"score_gpt":0.27922666289546505,"score_spread":0.26019671553136253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979477295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.610083,0.00034737465,0.37445572,0.009675459,0.000106383995,0.00078942894,0.0000051957863,0.0002678291,0.0042696465],"genre_scores_gemma":[0.85035855,0.00007538988,0.1484765,0.00043445668,0.00005907327,0.000066846806,7.171297e-7,0.000050321814,0.0004781325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977395,0.00015971858,0.00036667567,0.00039698146,0.0007028546,0.0006342935],"domain_scores_gemma":[0.9964634,0.0018524841,0.00019837197,0.0012721333,0.00007758697,0.00013598082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137076,0.00028934138,0.00025072545,0.00006423406,0.0010606175,0.00081179355,0.001707307,0.00006293865,0.0000088369015],"category_scores_gemma":[0.00013528559,0.00014136473,0.00008152947,0.00046702992,0.00030892243,0.0004897634,0.00067825546,0.00053257385,0.000033340933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001980044,0.000037694343,0.000040663446,0.000055798366,0.000064985805,0.00001196464,0.011653661,0.00012893674,0.0011494781,0.96187276,0.000043044165,0.024921218],"study_design_scores_gemma":[0.00028509376,0.00006608992,0.0001960802,0.000077039236,0.00001331911,0.00011006927,0.0025559699,0.00416567,0.00056745217,0.9911341,0.0005816921,0.00024743399],"about_ca_topic_score_codex":0.000014756419,"about_ca_topic_score_gemma":0.00007121082,"teacher_disagreement_score":0.24027558,"about_ca_system_score_codex":0.000034648445,"about_ca_system_score_gemma":0.00004312828,"threshold_uncertainty_score":0.81575197},"labels":[],"label_agreement":null},{"id":"W1979637305","doi":"10.1016/j.dam.2004.07.007","title":"Minimization of ordered, symmetric half-products","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Minification; Algebra over a field; Mathematical optimization; Pure mathematics","score_opus":0.021628327450887167,"score_gpt":0.2727581203581696,"score_spread":0.25112979290728243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979637305","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010546044,0.00007864359,0.97512245,0.00030178952,0.00005655476,0.00041874385,0.0000029353923,0.00012894617,0.013343874],"genre_scores_gemma":[0.47953296,0.000018145975,0.5203089,0.000023726223,0.00001621164,0.000024874216,0.0000048519896,0.000017058177,0.000053288935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847376,0.000013705102,0.0003768066,0.00034003097,0.00049267075,0.00030302227],"domain_scores_gemma":[0.99849004,0.00012917598,0.00020586042,0.00094718864,0.00015227133,0.00007547007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031097577,0.00016008699,0.00025746247,0.00029939046,0.00007797408,0.00005108954,0.0009011075,0.000058736252,0.0000075699413],"category_scores_gemma":[0.00021159936,0.00014068531,0.000048737336,0.0019498179,0.00011323749,0.00021386702,0.00027779,0.000118468124,0.000059506234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004568977,0.00010257538,0.0000021631631,0.00016207482,0.000014942869,0.0000020571797,0.0007745813,0.0012442154,0.0062780464,0.98788816,0.000018517543,0.0035080793],"study_design_scores_gemma":[0.0006749534,0.000053734315,0.000037967282,0.00004116301,0.00001157623,0.000009926639,0.00024065934,0.004953455,0.10280109,0.8907577,0.00018474921,0.00023304744],"about_ca_topic_score_codex":0.000002916151,"about_ca_topic_score_gemma":7.4559136e-7,"teacher_disagreement_score":0.4689869,"about_ca_system_score_codex":0.000039925257,"about_ca_system_score_gemma":0.00008136882,"threshold_uncertainty_score":0.57369804},"labels":[],"label_agreement":null},{"id":"W1979733770","doi":"10.1016/s0012-365x(03)00311-x","title":"Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Heuristic; Variable (mathematics); Algebraic number; Series (stratigraphy); Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Metaheuristic","score_opus":0.051255614563814056,"score_gpt":0.3153195008242945,"score_spread":0.26406388626048044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979733770","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040042237,0.00007434224,0.9793574,0.00014452939,0.00016453848,0.0010362898,0.000027586517,0.00027603726,0.014915029],"genre_scores_gemma":[0.19487783,0.0000022174747,0.8045505,0.00011810784,0.000025504567,0.00017146349,0.000004642323,0.000050936742,0.00019873759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973871,0.000057129404,0.00041240716,0.0005828034,0.0006051555,0.0009554027],"domain_scores_gemma":[0.99746764,0.00083698053,0.000096261945,0.0011163192,0.00019347793,0.00028930957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013887349,0.00029917623,0.00038231423,0.0003167489,0.00039216212,0.00035796003,0.0013410288,0.00010056238,0.000074501455],"category_scores_gemma":[0.0005283329,0.0002516698,0.00015399756,0.0010418673,0.00008441645,0.00037705325,0.00033052443,0.00021689874,0.00006993729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084293415,0.00005536313,0.000075423544,0.00014969001,0.00003751045,0.0000086006185,0.001058651,0.00075875054,0.0021085248,0.9947709,0.00017383038,0.00079435704],"study_design_scores_gemma":[0.00042320992,0.00016105192,0.000030138643,0.00007377406,0.0000114365275,0.000040910116,0.00014714446,0.0827535,0.01205709,0.9034129,0.00055096543,0.00033790068],"about_ca_topic_score_codex":0.0000027838805,"about_ca_topic_score_gemma":0.0000029971804,"teacher_disagreement_score":0.19087361,"about_ca_system_score_codex":0.000056273173,"about_ca_system_score_gemma":0.000117611286,"threshold_uncertainty_score":0.99999356},"labels":[],"label_agreement":null},{"id":"W1979947096","doi":"10.1016/s0012-365x(00)00369-1","title":"The upper domination Ramsey number u(3,3,3)","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Domination analysis; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Vertex (graph theory); Computer science","score_opus":0.024625825096035517,"score_gpt":0.2973754815534076,"score_spread":0.2727496564573721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979947096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074297893,0.00018327138,0.8836615,0.0030234244,0.00022421921,0.00037472742,0.0000025283325,0.00022122196,0.10487931],"genre_scores_gemma":[0.7601639,0.00021625687,0.21897054,0.00024088577,0.0001132271,0.00011344209,0.0000023417049,0.00005014426,0.020129267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866766,0.00007777153,0.0002376198,0.00021056288,0.00045701064,0.00034935185],"domain_scores_gemma":[0.99832684,0.0005333259,0.00009196532,0.00088271854,0.00008839846,0.00007677142],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005427399,0.0001251378,0.00011792746,0.00003836663,0.00036850915,0.00030326546,0.0011307398,0.000042940235,0.00013586851],"category_scores_gemma":[0.0002563431,0.0000784939,0.000083078645,0.0003672373,0.00013618686,0.000380004,0.00027115608,0.0001629415,0.0011910162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010953388,0.00003220123,0.000052527434,0.000013053093,0.000010907686,0.000003466794,0.0011859513,0.000005615299,0.00007800128,0.98457885,0.0014730431,0.01256528],"study_design_scores_gemma":[0.00027703837,0.000027050388,0.00008748693,0.000027440254,0.0000056412973,0.000040005656,0.00044225183,0.2445704,0.001022145,0.7378409,0.015432844,0.00022680557],"about_ca_topic_score_codex":8.277401e-7,"about_ca_topic_score_gemma":0.0000012396686,"teacher_disagreement_score":0.7527341,"about_ca_system_score_codex":0.000044096658,"about_ca_system_score_gemma":0.0000067334213,"threshold_uncertainty_score":0.9995867},"labels":[],"label_agreement":null},{"id":"W1980213624","doi":"10.1016/j.dam.2011.01.014","title":"Separator orders in interval, cocomparability, and AT-free graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Separator (oil production); Combinatorics; Interval graph; Interval (graph theory); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.041937089263702064,"score_gpt":0.29236340334544086,"score_spread":0.2504263140817388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980213624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7022559,0.000103124104,0.25657383,0.00012717489,0.000065052445,0.0010373824,0.000009036938,0.00023777722,0.039590746],"genre_scores_gemma":[0.76824737,0.00001465377,0.23147482,0.00006667089,0.0000045133042,0.00011569695,0.0000015625808,0.000020965983,0.000053756557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836695,0.000039189606,0.00039355204,0.00046778726,0.00030464111,0.0004278985],"domain_scores_gemma":[0.99815446,0.00020300427,0.00010933224,0.0013480034,0.00003657454,0.00014860946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059821794,0.00021671806,0.0003347357,0.0001928605,0.00009291417,0.000059619066,0.0014202354,0.00006944051,0.00004272849],"category_scores_gemma":[0.00006887505,0.00018927046,0.00005614171,0.00052793784,0.00031475056,0.00022957633,0.0015518444,0.00020444498,0.00005556898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002708586,0.000120319906,0.00074059004,0.00011688247,0.000016108641,0.0000082678325,0.005624473,0.000004114739,0.0009841764,0.9914976,0.00016761043,0.0006928029],"study_design_scores_gemma":[0.00062901573,0.00005757425,0.0009940802,0.00002926509,0.000005169994,0.000010920384,0.000407367,0.0051019588,0.0035202831,0.9888534,0.00013102753,0.00025994756],"about_ca_topic_score_codex":0.000009870984,"about_ca_topic_score_gemma":0.000061614825,"teacher_disagreement_score":0.06599147,"about_ca_system_score_codex":0.0000444192,"about_ca_system_score_gemma":0.000022217842,"threshold_uncertainty_score":0.7718226},"labels":[],"label_agreement":null},{"id":"W1980595063","doi":"10.1016/j.tcs.2010.07.003","title":"Cops and Robbers from a distance","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Upper and lower bounds; Graph; Zigzag; Function (biology); Discrete mathematics; Geometry","score_opus":0.0074750399545815875,"score_gpt":0.26657268459215955,"score_spread":0.25909764463757795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980595063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15275301,0.000027387588,0.84356886,0.0009095842,0.0005408269,0.000117513686,0.0000025170475,0.00017643026,0.0019038769],"genre_scores_gemma":[0.71646184,0.000003418821,0.2831563,0.000283398,0.000074922005,0.0000050606764,3.7210827e-7,0.000006007577,0.000008650533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974127,0.00008150727,0.00019148891,0.0009441683,0.0007196384,0.00065049645],"domain_scores_gemma":[0.997582,0.0005698314,0.00004516578,0.0011752115,0.00015043849,0.00047733937],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012181301,0.00017642808,0.00018294013,0.00015112103,0.00047716836,0.0005861487,0.0029800958,0.000055187727,0.00005770409],"category_scores_gemma":[0.00018333661,0.00014491353,0.000037934413,0.0010842565,0.007100645,0.0009827573,0.001672703,0.0005004308,0.000060973158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075233274,0.000022461494,0.00024083769,0.000001409073,0.0000019565098,0.000012807643,0.0002515036,0.00000849239,0.0066861995,0.94901675,0.000013429966,0.04373661],"study_design_scores_gemma":[0.00018523358,0.00007323963,0.0019399639,0.000009257766,0.0000014066784,0.000023281404,0.0000041237413,0.24294737,0.005124346,0.74910086,0.00039422823,0.000196699],"about_ca_topic_score_codex":0.000005973558,"about_ca_topic_score_gemma":0.0000060413226,"teacher_disagreement_score":0.56370884,"about_ca_system_score_codex":0.000021220572,"about_ca_system_score_gemma":0.00009460628,"threshold_uncertainty_score":0.9956015},"labels":[],"label_agreement":null},{"id":"W1980634280","doi":"10.1016/j.disc.2011.11.032","title":"A degree condition for cycles of maximum length in bipartite digraphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Digraph; Mathematics; Combinatorics; Degree (music); Hamiltonian (control theory); Discrete mathematics; Graph; Physics","score_opus":0.08954373980614025,"score_gpt":0.3256156053587312,"score_spread":0.23607186555259094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980634280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16647412,0.00006306039,0.8281071,0.000039192822,0.000046055713,0.0004852356,0.000024196564,0.00005983183,0.004701186],"genre_scores_gemma":[0.76831585,0.000011962711,0.23153163,0.000010485597,0.00000586318,0.00007913388,0.0000039150086,0.000012986571,0.000028154696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989034,0.00004006995,0.0003469911,0.00021233692,0.00021155301,0.00028565477],"domain_scores_gemma":[0.99895304,0.0002321719,0.0001492733,0.00052946096,0.000077970406,0.000058061654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045817049,0.000118210104,0.00022123018,0.00022934846,0.00004165915,0.00002274196,0.000640361,0.000047074795,0.000017819528],"category_scores_gemma":[0.00013618292,0.00010096531,0.00009620326,0.00039560653,0.00013096063,0.00034372037,0.00013374582,0.00008094719,0.000009871976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021999747,0.00016668216,0.0008095918,0.00024191706,0.000021048945,0.000004827492,0.00654157,0.000008438367,0.001996258,0.985658,0.000024620686,0.0045050606],"study_design_scores_gemma":[0.00040787316,0.00013135717,0.0012146677,0.00009475635,0.0000062604586,0.000004204797,0.00042244935,0.0186645,0.030627128,0.94824743,0.00003380957,0.00014553324],"about_ca_topic_score_codex":0.0000054097254,"about_ca_topic_score_gemma":0.00001898835,"teacher_disagreement_score":0.60184175,"about_ca_system_score_codex":0.000013380703,"about_ca_system_score_gemma":0.000021395817,"threshold_uncertainty_score":0.4117246},"labels":[],"label_agreement":null},{"id":"W1980709314","doi":"10.4236/ojdm.2013.33029","title":"Multiple Circular Colouring as a Model for Scheduling","year":2013,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Chromatic scale; Mathematics; Scheduling (production processes); Graph; Combinatorics; Computer science; Mathematical optimization; Discrete mathematics","score_opus":0.058188764967941606,"score_gpt":0.3432924704403453,"score_spread":0.28510370547240366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980709314","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0632658,0.00006892408,0.9346179,0.0005601641,0.000055918703,0.00069380965,0.0000016734331,0.000011980498,0.0007238353],"genre_scores_gemma":[0.40803686,0.000007052508,0.59159577,0.000051872576,0.000020876974,0.000028557166,2.1554078e-7,0.000015202146,0.00024358243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984917,0.00004655823,0.00055452075,0.00016916954,0.00040577023,0.00033227037],"domain_scores_gemma":[0.99799204,0.00041087184,0.0004635932,0.00047233762,0.00046133503,0.00019980814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012427358,0.00013766816,0.00034140775,0.00012959291,0.00017812209,0.0007155276,0.0026867583,0.000045319888,0.000021849854],"category_scores_gemma":[0.0007675642,0.0001074788,0.00015914203,0.00019950604,0.000049560866,0.0017868233,0.0006509944,0.000215789,0.000033414537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008477348,0.00051207514,0.00019057929,0.00058014493,0.00038796384,0.000058784703,0.011432867,0.19217947,0.037262663,0.74499774,0.00047439855,0.011838544],"study_design_scores_gemma":[0.00049170095,0.00008369317,0.0000035831536,0.00010259542,0.0000071001805,0.000063537926,0.000276457,0.61334187,0.0017376441,0.3837745,0.000028061808,0.000089276655],"about_ca_topic_score_codex":0.000002622158,"about_ca_topic_score_gemma":7.3450605e-7,"teacher_disagreement_score":0.4211624,"about_ca_system_score_codex":0.00004605939,"about_ca_system_score_gemma":0.00015675953,"threshold_uncertainty_score":0.689985},"labels":[],"label_agreement":null},{"id":"W1981011157","doi":"10.1016/j.disc.2014.02.006","title":"Binary matroids with no 4-spike minors","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Combinatorics; Minor (academic); Mathematics; Binary number; Simple (philosophy); Rank (graph theory); Circumference; Bounding overwatch; Discrete mathematics; Computer science; Arithmetic","score_opus":0.012548588064515712,"score_gpt":0.26391457852280636,"score_spread":0.25136599045829067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981011157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04140617,0.000026531998,0.92679834,0.0002950311,0.00008782354,0.00023510867,0.0000026767898,0.0002524182,0.030895898],"genre_scores_gemma":[0.33405796,0.0000067982305,0.6621429,0.00016189784,0.00007635172,0.000044901386,0.000004321569,0.000046624664,0.003458282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983902,0.00007515148,0.0002445409,0.00034545045,0.0005037113,0.00044094046],"domain_scores_gemma":[0.99821913,0.00023868568,0.0001106591,0.001163024,0.0001158514,0.00015267031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005007903,0.00020165632,0.00024978368,0.0001329199,0.0001379344,0.00014652427,0.0011977835,0.00004884998,0.000036930058],"category_scores_gemma":[0.00012336155,0.00014230428,0.000071786235,0.0004279291,0.00016020371,0.00037586983,0.00034444124,0.00017572929,0.00057544373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001643536,0.00009638983,0.00021239882,0.00020309666,0.000029095494,0.000021692918,0.0010745972,0.00014009996,0.0014724161,0.99256676,0.00057799125,0.0035890243],"study_design_scores_gemma":[0.0012200633,0.0013867037,0.0005165862,0.00029947027,0.00002903397,0.00013321926,0.00035271744,0.43481243,0.0048214626,0.5436299,0.011712639,0.001085779],"about_ca_topic_score_codex":0.0000017485656,"about_ca_topic_score_gemma":0.0000015225243,"teacher_disagreement_score":0.44893688,"about_ca_system_score_codex":0.000022896085,"about_ca_system_score_gemma":0.000027973054,"threshold_uncertainty_score":0.7396357},"labels":[],"label_agreement":null},{"id":"W1981167177","doi":"10.1007/s11083-010-9175-z","title":"Join-Irreducible Boolean Functions","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Join (topology); Irreducibility; Discrete mathematics; Order (exchange); Omega; Pure mathematics","score_opus":0.01812048192973254,"score_gpt":0.2922381663705092,"score_spread":0.27411768444077667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981167177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070116885,0.00005264302,0.84436375,0.0031896036,0.0017690397,0.00018060935,0.0000034374125,0.00035066225,0.07997338],"genre_scores_gemma":[0.8403274,0.000005537663,0.11747442,0.00049971463,0.00022462479,0.000041739866,0.000003962229,0.000024168148,0.041398447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991497,0.00002295413,0.00008199871,0.00028256045,0.00018846591,0.00027436603],"domain_scores_gemma":[0.99892133,0.000047664136,0.000020352136,0.0007911901,0.00011395857,0.00010550105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021948636,0.00007325292,0.00006421045,0.000110128,0.00017333929,0.000091110785,0.0005973072,0.000041561987,0.00054031645],"category_scores_gemma":[0.0000968605,0.000066041976,0.00003343737,0.0006272435,0.000082298255,0.00039825027,0.00019409388,0.00032449182,0.0015468982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008672015,0.00015981944,0.0013528856,0.0000074464288,0.000021142543,0.000016006079,0.00037282912,0.00011135255,0.058514442,0.766354,0.022436816,0.15064457],"study_design_scores_gemma":[0.0004588247,0.00009306382,0.0038397165,0.0000058228698,0.0000036586332,0.000057821417,0.00005762572,0.0065485556,0.008274845,0.15128002,0.8290226,0.0003574447],"about_ca_topic_score_codex":0.00000614409,"about_ca_topic_score_gemma":0.000026001444,"teacher_disagreement_score":0.8065858,"about_ca_system_score_codex":0.0000070954106,"about_ca_system_score_gemma":0.000067957175,"threshold_uncertainty_score":0.9992305},"labels":[],"label_agreement":null},{"id":"W1981391255","doi":"10.4310/joc.2013.v4.n3.a2","title":"Complements of nearly perfect graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Hungarian Scientific Research Fund; Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche","keywords":"Class (philosophy); Bounded function; Trivially perfect graph; Chordal graph; Indifference graph; Function (biology); Clique-sum","score_opus":0.018441708194938358,"score_gpt":0.28255513332557425,"score_spread":0.2641134251306359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981391255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8651331,0.00056298607,0.1304257,0.0005377733,0.0010200153,0.00022409445,0.0000011504288,0.000023347422,0.0020718449],"genre_scores_gemma":[0.99338514,0.000053313826,0.0063995146,0.00004039529,0.000016264094,0.0000019911317,1.3694951e-7,0.000008133148,0.000095132455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982137,0.00015107528,0.0004969622,0.00011110685,0.00076744944,0.00025970055],"domain_scores_gemma":[0.9978001,0.00023382636,0.0004639001,0.0003774839,0.00096063013,0.00016403518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007393924,0.00010331047,0.000275529,0.00034771496,0.00007057519,0.000080810605,0.0013673105,0.000037426555,0.000047837388],"category_scores_gemma":[0.00012654054,0.00008463006,0.00015510192,0.0008249538,0.0000791549,0.0009597372,0.0002117899,0.0003057676,0.000022060722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014720321,0.00030898623,0.017222762,0.000031135223,0.000070567155,0.00002490398,0.00037497358,0.00004128441,0.00425074,0.9666323,0.0025249757,0.008502654],"study_design_scores_gemma":[0.0009855946,0.00096075103,0.022443913,0.000034572477,0.0000068647955,0.000063196625,0.00005301849,0.0008811419,0.003950406,0.9691533,0.0013500314,0.00011723772],"about_ca_topic_score_codex":0.000007862224,"about_ca_topic_score_gemma":2.2839055e-7,"teacher_disagreement_score":0.12825203,"about_ca_system_score_codex":0.00004637397,"about_ca_system_score_gemma":0.00009028284,"threshold_uncertainty_score":0.34511137},"labels":[],"label_agreement":null},{"id":"W1981399828","doi":"10.1016/s0166-218x(03)00304-4","title":"Hereditary dominating pair graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Research Council Canada; National Science Council","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Path graph; Dominating set; Induced path; Graph; Discrete mathematics; Line graph; Pathwidth; Graph power","score_opus":0.018307557652128232,"score_gpt":0.2723833924507984,"score_spread":0.2540758347986702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981399828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013813509,0.00008573804,0.90078855,0.00009975654,0.00011335277,0.00040366585,0.000002891947,0.0003106339,0.084381916],"genre_scores_gemma":[0.4162366,0.000005575956,0.5833473,0.00009048177,0.000017836237,0.00008520442,0.0000024158433,0.000029018043,0.00018554761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981546,0.000049925544,0.00035713328,0.0004117471,0.0005012514,0.00052535534],"domain_scores_gemma":[0.9982477,0.0004084041,0.00013352225,0.0010003278,0.00005758174,0.00015245394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084424234,0.00022528986,0.00026317468,0.0001487692,0.00021365307,0.0001149409,0.00096232345,0.00007228102,0.00004097861],"category_scores_gemma":[0.00016412414,0.00019498271,0.00010074131,0.0006794335,0.0001271635,0.0002675654,0.00022947394,0.00025081652,0.00014023045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019077168,0.000053879397,0.000013135563,0.00006605482,0.000017249164,0.000015601361,0.0010108749,0.000036174028,0.0021934328,0.99326026,0.00022782602,0.0031035861],"study_design_scores_gemma":[0.00033670137,0.00002827241,0.000012614259,0.000023698125,0.000006226714,0.000032495293,0.0008071556,0.0046965955,0.014025078,0.97895557,0.00079753937,0.00027803943],"about_ca_topic_score_codex":6.047691e-7,"about_ca_topic_score_gemma":7.195273e-7,"teacher_disagreement_score":0.40242308,"about_ca_system_score_codex":0.000029703891,"about_ca_system_score_gemma":0.000040455885,"threshold_uncertainty_score":0.7951164},"labels":[],"label_agreement":null},{"id":"W1981737915","doi":"10.1016/j.disc.2007.03.017","title":"Perfect matchings after vertex deletions","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Factor-critical graph; Distance-hereditary graph; Perfect graph theorem; Discrete mathematics; Induced subgraph; Graph; Line graph; Pathwidth; Graph power","score_opus":0.013243460046563798,"score_gpt":0.29337321976176767,"score_spread":0.2801297597152039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981737915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084737346,0.00007428535,0.90645766,0.00025252436,0.00009950253,0.00017989683,0.0000033098277,0.00018889247,0.008006551],"genre_scores_gemma":[0.7073613,0.0000065840227,0.29168648,0.00015828645,0.00002052293,0.000021958618,0.0000017671294,0.000021535712,0.0007215921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984829,0.0000340761,0.0002809187,0.0002814299,0.0004325988,0.00048808072],"domain_scores_gemma":[0.99855983,0.00034932257,0.00006641077,0.00079495815,0.000075856515,0.00015363935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092643977,0.00015903171,0.00016988667,0.00016161415,0.00014499879,0.00013494688,0.00082226004,0.000055600638,0.00007092491],"category_scores_gemma":[0.00013598896,0.00013237017,0.00011051883,0.00045516092,0.00009723385,0.00038697183,0.00032913458,0.00021198193,0.00036509216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013925384,0.00009972568,0.00029418975,0.000090901034,0.000026294345,0.000082531034,0.004317328,0.000020684814,0.0015758787,0.98708993,0.00023254567,0.0061560464],"study_design_scores_gemma":[0.00038615245,0.000118321914,0.0017581027,0.00011748137,0.000015346133,0.00011183103,0.00050298736,0.03541731,0.004436239,0.9539654,0.002632959,0.00053786],"about_ca_topic_score_codex":0.0000023786615,"about_ca_topic_score_gemma":0.0000066725192,"teacher_disagreement_score":0.6226239,"about_ca_system_score_codex":0.00004306377,"about_ca_system_score_gemma":0.000023608069,"threshold_uncertainty_score":0.53978986},"labels":[],"label_agreement":null},{"id":"W1981843507","doi":"10.1016/j.dam.2010.02.011","title":"A General Label Search to investigate classical graph search algorithms","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Search algorithm; Algorithm; Graph; Mathematical optimization; Combinatorics","score_opus":0.03913475955611867,"score_gpt":0.3226654876041811,"score_spread":0.28353072804806245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981843507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1882065,0.000009144336,0.80099195,0.0015898956,0.0001588,0.00087370496,0.000017143402,0.00034465344,0.0078081912],"genre_scores_gemma":[0.10610362,0.0000064051246,0.89212596,0.00043882674,0.00016977768,0.0002015077,0.000009843577,0.00006927679,0.0008747943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961638,0.00006722846,0.00047352602,0.00083836855,0.0012981659,0.0011589113],"domain_scores_gemma":[0.99676365,0.00033817126,0.0000655787,0.0017754474,0.00018664422,0.00087050267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013562941,0.00036312232,0.0004219735,0.00042289874,0.000326886,0.00040012907,0.0025732226,0.00017779425,0.00004407618],"category_scores_gemma":[0.00011621236,0.00031101028,0.00010961307,0.0016174873,0.0004714582,0.00028479088,0.0011254235,0.0011683342,0.00065822614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009449324,0.000115191164,0.000010354323,0.00005554526,0.000023458686,0.000017004957,0.0016114316,0.0001027066,0.17889869,0.80816334,0.00029565475,0.010697162],"study_design_scores_gemma":[0.0010778297,0.00020235551,0.0001353858,0.00003839654,0.00001447296,0.000055278473,0.0003332816,0.21525835,0.13424549,0.646243,0.0014710014,0.00092521904],"about_ca_topic_score_codex":0.000008008736,"about_ca_topic_score_gemma":0.000012064587,"teacher_disagreement_score":0.21515563,"about_ca_system_score_codex":0.00003978831,"about_ca_system_score_gemma":0.00016818005,"threshold_uncertainty_score":0.9999342},"labels":[],"label_agreement":null},{"id":"W1981884232","doi":"10.1016/j.disc.2005.12.048","title":"Can transitive orientation make sandwich problems easier?","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Transitive relation; Combinatorics; Mathematics; Partially ordered set; Comparability graph; Transitive reduction; Orientation (vector space); Comparability; Graph; Discrete mathematics; Line graph; Pathwidth; Voltage graph","score_opus":0.01616633255282864,"score_gpt":0.27545241161224837,"score_spread":0.25928607905941975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981884232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029055761,0.000047913698,0.9587537,0.0006309551,0.000076260054,0.00044108613,0.000018919176,0.00018417658,0.010791234],"genre_scores_gemma":[0.8834875,0.000005234705,0.11533573,0.000052088457,0.00004774152,0.000063818785,0.000023645265,0.000024676141,0.0009595156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844414,0.00006838401,0.0003050092,0.00032657583,0.00047400326,0.00038190963],"domain_scores_gemma":[0.99904,0.00013044194,0.00010474901,0.0005252381,0.000119622164,0.00007992421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033595384,0.00016755352,0.0001877241,0.00012149172,0.00015111372,0.0001529204,0.00055644964,0.000051059884,0.000011384152],"category_scores_gemma":[0.000036403817,0.00014353135,0.00007799834,0.0005664355,0.00009919,0.00024099766,0.000089218556,0.00014142855,0.000036631107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004397539,0.00009200131,0.00017902526,0.00010808404,0.000015955793,0.000015845902,0.004277856,0.00046037495,0.0028019415,0.98905027,0.00006383943,0.0029303874],"study_design_scores_gemma":[0.00047418676,0.00007913646,0.00050304126,0.000067905865,0.000011399517,0.00002638609,0.00060133036,0.05149183,0.006261388,0.9399016,0.00029082058,0.0002910109],"about_ca_topic_score_codex":0.000022766893,"about_ca_topic_score_gemma":0.000061716855,"teacher_disagreement_score":0.8544318,"about_ca_system_score_codex":0.00005054444,"about_ca_system_score_gemma":0.00004331654,"threshold_uncertainty_score":0.58530384},"labels":[],"label_agreement":null},{"id":"W1982050567","doi":"10.1007/s00373-012-1270-z","title":"Solving Partition Problems with Colour-Bipartitions","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Indifference graph; Pathwidth; Discrete mathematics; Homomorphism; Partition (number theory); Vertex (graph theory); Time complexity; Graph; Line graph","score_opus":0.021424106780662405,"score_gpt":0.24812032415968993,"score_spread":0.22669621737902754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982050567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70644635,0.002403841,0.2819968,0.0007915616,0.0005707342,0.0005940239,0.000004975457,0.00051707553,0.0066746427],"genre_scores_gemma":[0.9971389,0.00011185696,0.0024788291,0.000060692615,0.000010129287,0.00007326618,0.000002140739,0.0000090723315,0.0001150675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989301,0.00005671553,0.000114835944,0.00020347764,0.00024622766,0.00044862748],"domain_scores_gemma":[0.9992671,0.00007421549,0.000050335606,0.00030465968,0.00009515343,0.00020851233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003261789,0.00011011178,0.00010867535,0.0001242954,0.000331422,0.00010617726,0.00024133862,0.000041627314,0.0000061492683],"category_scores_gemma":[0.000015722524,0.00009131969,0.000028034925,0.00077990035,0.00010352338,0.00085224817,0.0001251935,0.00015321175,0.000011432545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029327039,0.00011365578,0.024263918,0.0000140359,0.000009621242,0.000001997882,0.0003197326,0.000010982314,0.00012354959,0.9740009,0.00015133886,0.0009873655],"study_design_scores_gemma":[0.00047728737,0.00028585122,0.0129289245,0.000029686009,0.000009293566,0.000039661623,0.000080679754,0.001137368,0.00069217966,0.97985244,0.0042227115,0.00024391667],"about_ca_topic_score_codex":0.000004741816,"about_ca_topic_score_gemma":0.000003233157,"teacher_disagreement_score":0.29069257,"about_ca_system_score_codex":0.000019700057,"about_ca_system_score_gemma":0.000020713853,"threshold_uncertainty_score":0.3723909},"labels":[],"label_agreement":null},{"id":"W1982107102","doi":"10.1016/j.ipl.2006.01.013","title":"On the structure of certain intersection graphs","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Intersection (aeronautics); Computer science; Data structure; Combinatorics; Mathematics; Discrete mathematics; Programming language; Engineering","score_opus":0.007812606576568194,"score_gpt":0.2381557933190754,"score_spread":0.23034318674250723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982107102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39680186,0.0000054564293,0.5994839,0.0026874137,0.00009001303,0.00010871177,0.0000019967472,0.0000708365,0.00074977335],"genre_scores_gemma":[0.9955462,1.9768873e-7,0.002442606,0.0019803175,0.000011261674,0.0000032063251,0.000004880036,0.0000027900155,0.000008512005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920917,0.000040578147,0.00022240465,0.00007882969,0.00030572774,0.00014331412],"domain_scores_gemma":[0.9994123,0.00008153741,0.000178197,0.00022087325,0.00009208387,0.000014981049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016477692,0.000076376215,0.00006006441,0.00023270662,0.00015298229,0.00015032198,0.00044381883,0.000026476504,0.000007704137],"category_scores_gemma":[0.000045008524,0.000051654515,0.00003286869,0.0005677937,0.00008694708,0.0018281091,0.000044700468,0.00014804603,0.000008465072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039631806,0.000019019673,0.00025042286,0.00009927067,0.000009610649,8.398053e-7,0.0027728984,0.01670921,0.052126527,0.84111094,0.0032271938,0.08363444],"study_design_scores_gemma":[0.00079585373,0.00014470951,0.003933933,0.00021204467,0.000006386315,0.000032862103,0.0005238012,0.08941629,0.18979385,0.71179163,0.0028877843,0.00046086148],"about_ca_topic_score_codex":0.000013018918,"about_ca_topic_score_gemma":0.0000020925095,"teacher_disagreement_score":0.59874433,"about_ca_system_score_codex":0.00003275544,"about_ca_system_score_gemma":0.000021418353,"threshold_uncertainty_score":0.210641},"labels":[],"label_agreement":null},{"id":"W1982321501","doi":"10.1016/j.aim.2011.03.015","title":"Exponentially many perfect matchings in cubic graphs","year":2011,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Seventh Framework Programme; Agentúra na Podporu Výskumu a Vývoja; National Science Foundation","keywords":"Lemma (botany); Mathematics; Conjecture; Cubic graph; Exposition (narrative); Combinatorics; Graph; Exponential growth; Discrete mathematics; Line graph; Mathematical analysis; Voltage graph","score_opus":0.026881069079637696,"score_gpt":0.29544386877180084,"score_spread":0.2685627996921631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982321501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25563362,0.0018148014,0.7158173,0.00005972222,0.00033049248,0.0005840883,0.0000016844169,0.00021730679,0.02554097],"genre_scores_gemma":[0.6174402,0.00059546117,0.38164276,0.00004701935,0.000009760608,0.000071944654,6.023894e-7,0.000024460845,0.00016778041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979905,0.00011461503,0.00049899163,0.00043982154,0.00040148673,0.0005545788],"domain_scores_gemma":[0.9986293,0.00028648795,0.00014061222,0.0008198664,0.000043114982,0.000080666985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093707506,0.0002142493,0.00031248352,0.0005145145,0.000060553542,0.000047964488,0.0015571634,0.00006511409,0.00006325028],"category_scores_gemma":[0.00014197247,0.00019833983,0.0000777315,0.0010442913,0.00014078063,0.0016317754,0.00037987938,0.00034369828,0.0000950394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013948005,0.0003179541,0.002889482,0.0001508367,0.000005319992,0.00011273211,0.007687681,0.00012078611,0.0006747066,0.9717311,0.0000048931765,0.01629054],"study_design_scores_gemma":[0.0003631297,0.00006387734,0.0013098561,0.00014439799,0.0000017647284,0.000025210238,0.00030796538,0.008153833,0.002138161,0.9870826,0.00016548623,0.00024373336],"about_ca_topic_score_codex":0.000010949859,"about_ca_topic_score_gemma":0.000060712624,"teacher_disagreement_score":0.36180657,"about_ca_system_score_codex":0.000054408647,"about_ca_system_score_gemma":0.00003056299,"threshold_uncertainty_score":0.8088063},"labels":[],"label_agreement":null},{"id":"W1982842138","doi":"10.1016/j.aam.2014.02.002","title":"A geometric version of the Andrásfai–Erdős–Sós Theorem","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Mathematics; Combinatorics; Matroid; Integer (computer science); Rank (graph theory); Binary number; Discrete mathematics; Simple (philosophy); Graphic matroid; Affine transformation; Graph; Upper and lower bounds; Geometry; Arithmetic; Mathematical analysis","score_opus":0.00964440343855563,"score_gpt":0.2692203123829219,"score_spread":0.2595759089443663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982842138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016137091,0.00036202985,0.93360436,0.00008230834,0.00017054971,0.00042068688,0.000001941645,0.00006747703,0.04915357],"genre_scores_gemma":[0.81801033,0.00009803245,0.18172677,0.00005005515,0.000016110469,0.000026971631,4.0507624e-7,0.000012857864,0.000058474892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843985,0.000055046752,0.00035585824,0.00028972534,0.0005335209,0.0003260207],"domain_scores_gemma":[0.9974132,0.0011751861,0.00022499998,0.0010890644,0.000047051508,0.00005045049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097083196,0.00015125069,0.00026693824,0.00027227376,0.00008882,0.000026677686,0.0017206136,0.00005519916,0.000009298698],"category_scores_gemma":[0.00038636534,0.000102231235,0.000067130546,0.0020728512,0.00023028019,0.00025693476,0.00059060816,0.00021774728,0.000033737735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007841009,0.00008605768,0.00025006742,0.000120801546,0.000002789568,4.2452405e-7,0.00032052363,0.00072820624,0.00072440866,0.9558498,0.000016989565,0.04189204],"study_design_scores_gemma":[0.00046390053,0.0000411807,0.00019519101,0.00006517913,0.0000034063144,0.0000043176747,0.0001275174,0.010445919,0.014824229,0.97028416,0.0034007563,0.00014425008],"about_ca_topic_score_codex":5.135512e-7,"about_ca_topic_score_gemma":0.0000027570698,"teacher_disagreement_score":0.80187327,"about_ca_system_score_codex":0.000040665927,"about_ca_system_score_gemma":0.000023564924,"threshold_uncertainty_score":0.4168869},"labels":[],"label_agreement":null},{"id":"W1983971177","doi":"10.5539/jmr.v7n1p1","title":"Eccentric Coloring of a Graph","year":2015,"lang":"","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Lexicographical order; Graph; Chromatic scale; Fractional coloring; Graph power; Line graph","score_opus":0.270494518278048,"score_gpt":0.44991933732218525,"score_spread":0.17942481904413726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983971177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37537196,0.012033947,0.5974013,0.0018161702,0.001700883,0.0012993863,0.000012582135,0.000026156236,0.010337581],"genre_scores_gemma":[0.876914,0.0016046665,0.120105386,0.000010028562,0.00032653054,0.0000073266183,1.8022517e-7,0.000056254943,0.0009756076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98608,0.001749854,0.002380248,0.0003919564,0.007956813,0.0014411445],"domain_scores_gemma":[0.98196024,0.0035320169,0.0015232825,0.001338452,0.0103659425,0.0012800455],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.037059493,0.0003094473,0.0011207942,0.003885043,0.00024189445,0.00036618309,0.004977427,0.0002197228,0.00008321722],"category_scores_gemma":[0.009419105,0.00025971208,0.0004654777,0.006073475,0.0011381137,0.0012359048,0.0018745277,0.002569369,0.00010306891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015134298,0.011522168,0.0024720964,0.0053761574,0.0015218366,0.0030315309,0.06227949,0.007882571,0.013304266,0.80797195,0.014542525,0.06858195],"study_design_scores_gemma":[0.003675539,0.0054121604,0.0001236435,0.002042056,0.000058841084,0.0012747139,0.0094294315,0.062326323,0.020627627,0.89250195,0.0020845705,0.00044312148],"about_ca_topic_score_codex":0.000010397035,"about_ca_topic_score_gemma":0.0000025354595,"teacher_disagreement_score":0.5015421,"about_ca_system_score_codex":0.00047662685,"about_ca_system_score_gemma":0.002740736,"threshold_uncertainty_score":0.9999855},"labels":[],"label_agreement":null},{"id":"W1983977135","doi":"10.1002/jgt.10002","title":"Coloring all directed paths in a symmetric tree, with an application to optical networks*","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Directed graph; Tree (set theory); Wavelength-division multiplexing; Arc (geometry); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Wavelength; Telecommunications","score_opus":0.016131353985332345,"score_gpt":0.2866688221256312,"score_spread":0.2705374681402989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983977135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32317507,0.00021193642,0.67537934,0.00017551947,0.000077152086,0.00018803179,1.7529128e-7,0.000046064735,0.00074669096],"genre_scores_gemma":[0.9537818,0.00010505931,0.04576864,0.0001921252,0.000084419946,0.000020649168,4.698561e-7,0.000017627232,0.000029207094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997974,0.00038908026,0.00041442644,0.0002861258,0.0004920896,0.00044431552],"domain_scores_gemma":[0.99819225,0.0005549387,0.00019799768,0.00045915137,0.00024547076,0.00035017205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025342254,0.00015218875,0.00028262235,0.001373262,0.000070143695,0.00008882068,0.0011063835,0.00006505123,0.000003526405],"category_scores_gemma":[0.00017025994,0.00011717275,0.00007851535,0.0040824497,0.00008517968,0.0007452751,0.00011474044,0.0004572374,0.0000042689876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018998409,0.00048673584,0.008446317,0.000006781684,0.00006504594,0.00045337595,0.00050183694,0.016405901,0.0013078196,0.681132,0.000025742507,0.2892686],"study_design_scores_gemma":[0.0038143254,0.0061160545,0.10809924,0.00025311045,0.000050732746,0.0015541714,0.00044859282,0.086412825,0.0013893466,0.7886749,0.002288236,0.0008984629],"about_ca_topic_score_codex":0.0000036661093,"about_ca_topic_score_gemma":0.000036512305,"teacher_disagreement_score":0.6306067,"about_ca_system_score_codex":0.00008889464,"about_ca_system_score_gemma":0.00005488461,"threshold_uncertainty_score":0.4778166},"labels":[],"label_agreement":null},{"id":"W1984034523","doi":"10.1007/s00373-013-1310-3","title":"A Note on Cyclic Connectivity and Matching Properties of Regular Graphs","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Discrete mathematics; Indifference graph; Graph","score_opus":0.01688209207769032,"score_gpt":0.24026086724360105,"score_spread":0.22337877516591073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984034523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99321294,0.0010547037,0.0047365213,0.00026904073,0.00011108579,0.00027857354,9.841243e-7,0.000075643184,0.0002604942],"genre_scores_gemma":[0.9987742,0.0002903266,0.0007736844,0.000063264466,0.00000241987,0.00003405211,2.313898e-7,0.000010404841,0.00005141711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877334,0.00011120251,0.00017371772,0.00036413947,0.00029546654,0.00028211504],"domain_scores_gemma":[0.99910045,0.00013796693,0.000081366576,0.00045311227,0.00012122597,0.00010590309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003151343,0.00015713107,0.0002303732,0.00019885655,0.0002007785,0.00011245891,0.00035595635,0.000064656226,0.0000013725465],"category_scores_gemma":[0.00004779032,0.00012640221,0.000051849674,0.00048301747,0.00023036198,0.00046276127,0.00026901803,0.00020318743,0.0000026825348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009997256,0.00007905271,0.0015836934,0.000056533077,0.000013157784,0.0000026249636,0.00054969726,0.0000033780734,0.0110932905,0.9765654,0.000021807047,0.010021322],"study_design_scores_gemma":[0.00038012967,0.00025058154,0.009964539,0.000054066466,0.0000035148169,0.000009124306,0.000061180726,0.00095878966,0.010895896,0.9772111,0.00005098771,0.00016009796],"about_ca_topic_score_codex":0.00010269681,"about_ca_topic_score_gemma":0.0000025463355,"teacher_disagreement_score":0.009861224,"about_ca_system_score_codex":0.000010812164,"about_ca_system_score_gemma":0.000015085619,"threshold_uncertainty_score":0.5154532},"labels":[],"label_agreement":null},{"id":"W1984099766","doi":"10.5555/1283383.1283472","title":"Lower bounds on average-case delay for video-on-demand broadcast protocols","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Communication source; Upper and lower bounds; Bandwidth (computing); Atomic broadcast; Video on demand; Matching (statistics); Computer network; Set (abstract data type); Constant (computer programming); Broadcasting (networking); Mathematics; Statistics","score_opus":0.024335974845671633,"score_gpt":0.3356211953914677,"score_spread":0.31128522054579605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984099766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074744546,0.000036916852,0.9571854,0.0012525377,0.0008753093,0.019923868,0.000109971006,0.00044385018,0.012697698],"genre_scores_gemma":[0.7615498,0.00003847992,0.17279162,0.008623507,0.0029571927,0.038852274,0.00007555883,0.00057802885,0.014533563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99543023,0.00018335183,0.0005913607,0.0013840826,0.0010333423,0.0013776091],"domain_scores_gemma":[0.9961662,0.0010552417,0.00020760635,0.0018111265,0.00023528734,0.00052449026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00201243,0.00054857624,0.00043549947,0.00050306524,0.0006782118,0.0004649954,0.0014587571,0.00018075948,0.000036462858],"category_scores_gemma":[0.00014305432,0.00045764155,0.00032813073,0.0007611147,0.00024188588,0.00063403446,0.00030814717,0.000575324,0.00026060658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011598625,0.0039695986,0.00018673373,0.0005278292,0.00059554895,0.023088554,0.003657999,0.016260473,0.021647576,0.60783404,0.011066222,0.2995668],"study_design_scores_gemma":[0.01982193,0.043452844,0.0002610558,0.0014549819,0.000069372225,0.0037115805,0.00028002704,0.21384366,0.19674426,0.12214301,0.39263526,0.0055820225],"about_ca_topic_score_codex":0.000008122057,"about_ca_topic_score_gemma":0.0000056990266,"teacher_disagreement_score":0.7843938,"about_ca_system_score_codex":0.00022420457,"about_ca_system_score_gemma":0.000105143656,"threshold_uncertainty_score":0.9997875},"labels":[],"label_agreement":null},{"id":"W1984128589","doi":"10.1007/s00373-004-0579-7","title":"Spanning Trails Connecting Given Edges","year":2005,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Degree (music); Enhanced Data Rates for GSM Evolution; Multiple edges; Discrete mathematics; Physics; Computer science","score_opus":0.024392160606597258,"score_gpt":0.27269927210987666,"score_spread":0.2483071115032794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984128589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70651656,0.004888788,0.27222335,0.002980752,0.0007331275,0.00036052856,0.0000033110812,0.0007624796,0.01153109],"genre_scores_gemma":[0.993059,0.00012042612,0.006494765,0.000111485926,0.000021862948,0.000008494378,6.2250325e-7,0.000011082063,0.00017230386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988333,0.00005801362,0.00015491527,0.00034279368,0.00023567984,0.00037527832],"domain_scores_gemma":[0.99919325,0.00018036253,0.000056446108,0.0003400025,0.00008249406,0.00014746965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037579634,0.0001316938,0.00015306783,0.0001815638,0.00032858385,0.00016483825,0.0005336252,0.000054692242,0.0000061871715],"category_scores_gemma":[0.000059300884,0.00012698938,0.000055093387,0.00067066884,0.00006808931,0.0005241926,0.00023751539,0.00022225206,0.000011466883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002606019,0.000034670848,0.0010939124,0.000008162144,0.0000094747065,0.000007725878,0.00050255813,0.000023100127,0.00021812096,0.86933917,0.00014943304,0.12861104],"study_design_scores_gemma":[0.0006209465,0.00015098495,0.0020681736,0.000023693909,0.000004653386,0.00004099746,0.00021846048,0.0054219514,0.0029841394,0.96704596,0.021122376,0.00029764112],"about_ca_topic_score_codex":0.0000039484053,"about_ca_topic_score_gemma":0.0000018444543,"teacher_disagreement_score":0.28654242,"about_ca_system_score_codex":0.000021213677,"about_ca_system_score_gemma":0.000018323497,"threshold_uncertainty_score":0.51784766},"labels":[],"label_agreement":null},{"id":"W1984228559","doi":"10.1016/j.disc.2003.06.004","title":"Roman domination in graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":556,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Vertex (graph theory); Graph; Dominating set; Minimum weight; Discrete mathematics","score_opus":0.01958927517900732,"score_gpt":0.2969287906505696,"score_spread":0.27733951547156227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984228559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08450676,0.00007921039,0.8754576,0.00013817314,0.000082761246,0.0002841838,0.0000010981756,0.00009702132,0.03935318],"genre_scores_gemma":[0.79914755,0.000010215293,0.20043147,0.000029806808,0.00000352833,0.00002833529,0.0000010910501,0.000011517687,0.0003364713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891037,0.00009557361,0.00022602861,0.00021388206,0.0002844882,0.0002696412],"domain_scores_gemma":[0.9991419,0.00016535478,0.00006266267,0.00053299277,0.000037656715,0.000059466718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006804299,0.00010334623,0.0001370289,0.00022351791,0.000055539527,0.00007749109,0.00052921317,0.000038468454,0.000020653906],"category_scores_gemma":[0.00026269208,0.000090361136,0.00004871246,0.00070742035,0.00005190007,0.000353948,0.00008124901,0.0001222276,0.000055718865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.508028e-7,0.000043221837,0.00019943182,0.000022725366,0.0000028112063,0.000008803591,0.00098328,0.00003055865,0.0003457812,0.9974597,0.00002327794,0.0008796443],"study_design_scores_gemma":[0.0002557061,0.000025913372,0.0002911551,0.00002615088,0.0000012683985,0.000011297733,0.0001903023,0.014526376,0.002772683,0.9813966,0.00037479214,0.0001277255],"about_ca_topic_score_codex":0.0000012941575,"about_ca_topic_score_gemma":0.0000070567103,"teacher_disagreement_score":0.7146408,"about_ca_system_score_codex":0.00003489066,"about_ca_system_score_gemma":0.000025017927,"threshold_uncertainty_score":0.36848202},"labels":[],"label_agreement":null},{"id":"W1984238924","doi":"10.2991/iccnce.2013.32","title":"On the Tree Inclusion Problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Tree (set theory); Computer science; Time complexity; K-ary tree; Algorithm; Inclusion (mineral); Mathematics; Tree structure; Theoretical computer science; Mathematical optimization; Combinatorics; Binary tree","score_opus":0.018946320464185443,"score_gpt":0.2726178480970612,"score_spread":0.25367152763287576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984238924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03540771,0.000021248363,0.617523,0.030371817,0.00006457788,0.00065417896,1.3968584e-7,0.00025061602,0.31570673],"genre_scores_gemma":[0.96498466,0.0000026982711,0.026454655,0.0017980529,0.000013618869,0.000069728936,1.3883802e-7,0.000004917347,0.006671508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919474,0.000079857484,0.00006889282,0.00017514212,0.00028650023,0.00019488159],"domain_scores_gemma":[0.99898726,0.00033958766,0.000016085027,0.0005567948,0.00005189488,0.00004837915],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030369594,0.000056826488,0.000042042633,0.00004913059,0.0003240391,0.00008468981,0.0011912956,0.000017650413,0.00036151023],"category_scores_gemma":[0.000045403216,0.000027785873,0.000024680445,0.0003030063,0.000045671713,0.00030093745,0.0017421813,0.000114019684,0.0012816618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.0885703e-7,0.000015875345,0.000011888392,7.1627477e-7,0.0000012732645,6.06968e-7,0.00016634708,0.000014347175,0.0014824718,0.93376565,0.004591385,0.059948556],"study_design_scores_gemma":[0.00006198098,0.00006651992,0.00026583488,0.0000041095172,1.372014e-7,0.000001236285,0.000011636912,0.013247976,0.003905279,0.9805725,0.0018128767,0.000049891834],"about_ca_topic_score_codex":0.00001819573,"about_ca_topic_score_gemma":0.000006089421,"teacher_disagreement_score":0.929577,"about_ca_system_score_codex":0.000015380529,"about_ca_system_score_gemma":0.00001341748,"threshold_uncertainty_score":0.999496},"labels":[],"label_agreement":null},{"id":"W1984264511","doi":"10.1016/j.tcs.2005.09.028","title":"H-Coloring dichotomy revisited","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Greedy coloring; Complete coloring; Combinatorics; Discrete mathematics; Complexity of constraint satisfaction; Computational complexity theory; Automaton; Constraint (computer-aided design); Fractional coloring; List coloring; Constraint satisfaction; Graph coloring; Time complexity; Computer science; Local consistency; Theoretical computer science; Algorithm; Graph","score_opus":0.015057328051587939,"score_gpt":0.29933949641029667,"score_spread":0.28428216835870873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984264511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023811955,0.00005890368,0.96277,0.001721215,0.00022020821,0.00022588654,6.718613e-7,0.00044989522,0.010741277],"genre_scores_gemma":[0.69588387,0.0000062484664,0.30323738,0.0006440771,0.00018478734,0.000010286055,2.3389343e-7,0.000007929609,0.000025180187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646163,0.00014995891,0.0003065983,0.0009754897,0.0011094655,0.0009968862],"domain_scores_gemma":[0.99742424,0.0003654603,0.000059860376,0.0014053156,0.0002651778,0.00047993433],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00248951,0.00020853993,0.00022472024,0.00039331426,0.00059121265,0.00056012056,0.0047234083,0.000048470138,0.00009769015],"category_scores_gemma":[0.00018288646,0.00017441002,0.000080562,0.0027257765,0.003075098,0.0018338722,0.0020349578,0.00035714186,0.00049826305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006219807,0.00003580035,0.00004994603,0.0000033922026,0.0000022788995,0.000011883096,0.00016213796,0.00019545223,0.0012511607,0.88965267,0.00003456055,0.108594485],"study_design_scores_gemma":[0.0003089225,0.00016082155,0.0006830332,0.00003433129,0.0000022980912,0.0000665386,0.0000028315758,0.59506047,0.014967431,0.38531166,0.0030617102,0.00033993064],"about_ca_topic_score_codex":5.179318e-7,"about_ca_topic_score_gemma":1.7676668e-7,"teacher_disagreement_score":0.67207193,"about_ca_system_score_codex":0.00012510786,"about_ca_system_score_gemma":0.0001130466,"threshold_uncertainty_score":0.99963796},"labels":[],"label_agreement":null},{"id":"W1984989930","doi":"10.1016/j.ejc.2008.09.010","title":"Local Steiner convexity","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Steiner tree problem; Vertex (graph theory); Convexity; Convex set; Regular polygon; Graph; Discrete mathematics; Convex optimization; Geometry","score_opus":0.03156079600770018,"score_gpt":0.25557173935320465,"score_spread":0.22401094334550448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984989930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06027404,0.00041855202,0.92535007,0.00032850084,0.0007616582,0.000040954743,3.2387862e-7,0.000041048606,0.012784844],"genre_scores_gemma":[0.9945851,0.000104083556,0.0045066066,0.00012862029,0.000064172375,1.4968838e-7,1.1562005e-7,0.000017803672,0.0005933748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978216,0.0006877033,0.00041522426,0.00014846625,0.0006569633,0.00027000796],"domain_scores_gemma":[0.99838835,0.00013943913,0.00027299806,0.00043268362,0.0005148253,0.00025172185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015251122,0.000119664866,0.00020580707,0.0001961721,0.0001579798,0.000041681997,0.001599632,0.000016612817,0.000012595373],"category_scores_gemma":[0.00015475228,0.00009999311,0.000120255034,0.0005890575,0.0002219659,0.00056977477,0.00029789467,0.00049722113,0.00011527679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008456446,0.00045585976,0.002872961,0.000019503195,0.00007412776,0.010908047,0.0011213797,0.0006134789,0.0005985805,0.9497974,0.0102280285,0.023226071],"study_design_scores_gemma":[0.013384155,0.007871612,0.06277543,0.00022912964,0.000039182032,0.017708955,0.00031110022,0.009988224,0.016166374,0.5150256,0.3546724,0.0018278268],"about_ca_topic_score_codex":2.098071e-7,"about_ca_topic_score_gemma":2.8949282e-8,"teacher_disagreement_score":0.93431103,"about_ca_system_score_codex":0.000057251622,"about_ca_system_score_gemma":0.00010943025,"threshold_uncertainty_score":0.40776008},"labels":[],"label_agreement":null},{"id":"W1985078507","doi":"10.1006/eujc.2000.0382","title":"Jump-number of Means on Graphs","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Idempotence; Vertex (graph theory); Jump; Graph; Discrete mathematics","score_opus":0.018218568695760166,"score_gpt":0.27622258504412533,"score_spread":0.2580040163483652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985078507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6131214,0.0003708474,0.070255674,0.0006353263,0.001235542,0.00014180603,0.0000029017606,0.000074470234,0.31416208],"genre_scores_gemma":[0.9951002,0.0001879889,0.0035278895,0.00009638897,0.00003632094,1.8316243e-7,1.4775425e-7,0.000022176317,0.0010287039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976163,0.0006996234,0.0005159099,0.00015948883,0.00075186376,0.0002568308],"domain_scores_gemma":[0.9984638,0.00018442457,0.00029740768,0.0005254562,0.0003438773,0.00018505217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016622109,0.00013386682,0.00024303136,0.00022222004,0.00007651995,0.00004715958,0.0016645575,0.000018052633,0.000127912],"category_scores_gemma":[0.00009844035,0.00011274684,0.00018179856,0.00087533734,0.00010021097,0.00037683512,0.00009770612,0.00043614706,0.00019064164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009228436,0.0003615165,0.001322292,0.000013709255,0.000048066333,0.0005270298,0.00044222828,0.00039238305,0.00020394407,0.94376296,0.0019486325,0.050884947],"study_design_scores_gemma":[0.0035335456,0.0028519945,0.014376744,0.00025895258,0.000025677318,0.000737324,0.00004546156,0.00064971054,0.0045665046,0.8974156,0.07501436,0.0005241633],"about_ca_topic_score_codex":3.255252e-7,"about_ca_topic_score_gemma":4.4740844e-8,"teacher_disagreement_score":0.38197884,"about_ca_system_score_codex":0.00003096253,"about_ca_system_score_gemma":0.000047020018,"threshold_uncertainty_score":0.4597683},"labels":[],"label_agreement":null},{"id":"W1985281184","doi":"10.1016/j.dam.2009.04.004","title":"Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Upper and lower bounds; Mathematical proof; Independence number; Graph; Discrete mathematics; Independent set","score_opus":0.02630681998353096,"score_gpt":0.31734610857314616,"score_spread":0.2910392885896152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985281184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017778628,0.00007387981,0.9850201,0.00038930564,0.00013516087,0.002441869,0.00004589183,0.0002317871,0.009884124],"genre_scores_gemma":[0.26934844,0.0000051913266,0.7291172,0.00027337615,0.000069814436,0.0005953355,0.000012211903,0.000045487555,0.00053292746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964605,0.00002453921,0.0005472556,0.00091661076,0.00081989635,0.0012312107],"domain_scores_gemma":[0.99720216,0.0007353702,0.00014576419,0.0012945541,0.00027480122,0.00034738134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014639207,0.00038046332,0.0004881213,0.00034879264,0.00053568836,0.0005065907,0.0020731224,0.00015374734,0.000022104336],"category_scores_gemma":[0.00017990971,0.0003547009,0.00018137928,0.0011146414,0.0000976523,0.0005546413,0.00034302147,0.0002933462,0.0000312983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069139656,0.00012486159,0.0000074180275,0.00016040984,0.000024198687,0.0000023627642,0.0009657383,0.00033376773,0.016786762,0.96926403,0.00025783243,0.0120035065],"study_design_scores_gemma":[0.00073138624,0.00029304874,0.0000377529,0.000084060426,0.000015228081,0.000019969473,0.00027259052,0.046781167,0.012163974,0.9382254,0.0009002769,0.00047518432],"about_ca_topic_score_codex":0.0000010860368,"about_ca_topic_score_gemma":5.27088e-7,"teacher_disagreement_score":0.26757059,"about_ca_system_score_codex":0.00009752139,"about_ca_system_score_gemma":0.00015049092,"threshold_uncertainty_score":0.9998905},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01376915242437346,"score_gpt":0.29312911589385715,"score_spread":0.27935996346948366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985423710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4569794,0.00021401045,0.5301382,0.0018732641,0.000076308075,0.00086139404,0.0000054426855,0.0002878115,0.009564175],"genre_scores_gemma":[0.94482815,0.000035815403,0.053657707,0.0003354138,0.000031446165,0.000098198536,0.000001922272,0.00003613556,0.0009752367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975301,0.00010638875,0.0003592542,0.00049534795,0.0004886352,0.0010202972],"domain_scores_gemma":[0.9978992,0.00076855725,0.000057413814,0.0010927123,0.00003322602,0.00014889977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006552392,0.00024689938,0.00030356384,0.0002663517,0.00011606486,0.00011899996,0.0015573777,0.00007852217,0.00024086272],"category_scores_gemma":[0.0003410904,0.00021878032,0.00008673295,0.0009977061,0.00008372924,0.00022489401,0.00018325956,0.00044630145,0.0007334883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003254673,0.00016349755,0.000014414956,0.000019943775,0.000014332663,0.000020080637,0.0009819635,0.0027586287,0.00055158325,0.96053904,0.00006975918,0.034834176],"study_design_scores_gemma":[0.00037752892,0.00043422048,0.000093983945,0.000083411,0.000003141693,0.000017354558,0.00001681957,0.020775424,0.006456917,0.9709636,0.00047089384,0.00030671773],"about_ca_topic_score_codex":0.0000036035515,"about_ca_topic_score_gemma":0.000027216864,"teacher_disagreement_score":0.48784873,"about_ca_system_score_codex":0.00022585032,"about_ca_system_score_gemma":0.00010263228,"threshold_uncertainty_score":0.9427753},"labels":[],"label_agreement":null},{"id":"W1985501593","doi":"10.1007/s11425-009-0192-6","title":"A conjecture on k-factor-critical and 3-γ-critical graphs","year":2010,"lang":"en","type":"article","venue":"Science in China Series A Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Domination analysis; Dominating set; Critical graph; Bound graph; Neighbourhood (mathematics); Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.01666036097839081,"score_gpt":0.33114757451013227,"score_spread":0.31448721353174147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985501593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9657373,0.000027474216,0.024911745,0.005451072,0.00073692005,0.0002696585,0.000007840102,0.0001536499,0.0027043526],"genre_scores_gemma":[0.85277396,0.000008735184,0.14704883,0.00008908407,0.000019672825,0.000016152517,1.19183376e-7,0.000009840133,0.00003363058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753904,0.000048792976,0.00028250384,0.00061319146,0.0008054155,0.0007110234],"domain_scores_gemma":[0.9977064,0.0009828629,0.000037216098,0.00087596994,0.00010408083,0.000293434],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011403109,0.00020663517,0.0002431073,0.00042163228,0.00040605455,0.00054755143,0.0015456498,0.00009112766,0.000035617068],"category_scores_gemma":[0.004771635,0.00016324487,0.000040775965,0.0015069093,0.003848869,0.0015604993,0.00057572173,0.00077849266,0.00001693079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005383741,0.0000992113,0.0003386176,0.000054788863,7.3829057e-7,0.000032873202,0.0019865076,0.0000024980754,0.0077726725,0.98778594,0.0000063197026,0.0019144756],"study_design_scores_gemma":[0.00012463461,0.00023591402,0.003518255,0.00005566535,0.0000011469582,0.00022659107,0.0001814474,0.006989557,0.0047892947,0.98356694,0.00008955692,0.00022100334],"about_ca_topic_score_codex":0.0000033046656,"about_ca_topic_score_gemma":0.000023432029,"teacher_disagreement_score":0.122137085,"about_ca_system_score_codex":0.00002656725,"about_ca_system_score_gemma":0.00015774216,"threshold_uncertainty_score":0.9988621},"labels":[],"label_agreement":null},{"id":"W1985638002","doi":"10.1016/j.dam.2007.10.015","title":"Partition into cliques for cubic graphs: Planar case, complexity and approximation","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Induced subgraph isomorphism problem; Disjoint sets; Discrete mathematics; Clique-sum; Cograph; Clique; Chordal graph; Induced subgraph; Partition problem; Planar graph; Frequency partition of a graph; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.06445379228865139,"score_gpt":0.3174664405960601,"score_spread":0.2530126483074087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985638002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09367829,0.000047893136,0.9039667,0.00013520573,0.000022918439,0.00076756446,0.000012471262,0.00018014993,0.0011888149],"genre_scores_gemma":[0.45373705,0.000030171024,0.54589856,0.000048601993,0.00001583719,0.00021871598,0.000021964555,0.000014317585,0.000014780562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879813,0.000026147158,0.00030877278,0.00034012395,0.00023832411,0.0002884988],"domain_scores_gemma":[0.99893475,0.00027057613,0.0001377803,0.0004755067,0.000073809526,0.00010757039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039363833,0.00016960735,0.0002390477,0.00012816976,0.00043510343,0.00007351182,0.00030552765,0.000064629596,0.000002773937],"category_scores_gemma":[0.000046991874,0.00015143515,0.00005486441,0.00026256853,0.00030350065,0.0003184159,0.00011418868,0.00011103883,0.000008971243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001313327,0.000048173584,0.000012175234,0.00021751624,0.000014693276,0.000020547463,0.00301662,0.0000083157265,0.0015957013,0.99337393,0.00013142182,0.0015477422],"study_design_scores_gemma":[0.0003341678,0.00006487803,0.00002831054,0.00001717089,0.000007933153,0.00030786195,0.00034749086,0.041143212,0.00479114,0.9526495,0.0001213871,0.00018694377],"about_ca_topic_score_codex":0.000005539927,"about_ca_topic_score_gemma":0.000012174059,"teacher_disagreement_score":0.36005875,"about_ca_system_score_codex":0.000025712232,"about_ca_system_score_gemma":0.000020638023,"threshold_uncertainty_score":0.6175346},"labels":[],"label_agreement":null},{"id":"W1985793060","doi":"10.1016/j.disc.2006.08.010","title":"Retractions onto series-parallel posets","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Partially ordered set; Mathematics; Combinatorics; Homomorphism; Star product; Series (stratigraphy); Discrete mathematics; Algebraic number","score_opus":0.02578994077376497,"score_gpt":0.3219776912850309,"score_spread":0.29618775051126595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985793060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060574305,0.000054334138,0.95151705,0.00053607946,0.00016203805,0.00021943102,0.00000426813,0.00024998345,0.04119938],"genre_scores_gemma":[0.21887624,0.000022502481,0.77550024,0.00011906664,0.00007197157,0.000016145272,0.000005479802,0.000030560062,0.005357792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983604,0.000033870532,0.00033572203,0.00028855162,0.00048125783,0.00050021074],"domain_scores_gemma":[0.9983869,0.00025587616,0.00011145642,0.00095881626,0.000105955,0.0001809533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093964895,0.00016049817,0.00018249502,0.00015214183,0.00021165184,0.00013442984,0.000928972,0.00007383007,0.000045118275],"category_scores_gemma":[0.00020074636,0.00013967563,0.00009533146,0.00054624066,0.00010129594,0.00078768196,0.00025659616,0.0002565174,0.000227632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105345425,0.00007442027,0.000056709483,0.000035335266,0.000019525656,0.000037925834,0.0013978792,0.000036716956,0.0014806626,0.994218,0.00038373133,0.002248541],"study_design_scores_gemma":[0.0003897397,0.0001778712,0.0012034179,0.000062407955,0.000011310585,0.00024140625,0.00094729033,0.010297993,0.0051755067,0.9707162,0.010277481,0.0004993982],"about_ca_topic_score_codex":0.0000038675616,"about_ca_topic_score_gemma":0.000031921783,"teacher_disagreement_score":0.21281882,"about_ca_system_score_codex":0.000060446087,"about_ca_system_score_gemma":0.000036149737,"threshold_uncertainty_score":0.56958073},"labels":[],"label_agreement":null},{"id":"W1985797130","doi":"10.1016/j.dam.2004.01.005","title":"Minimum average distance of strong orientations of graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Multipartite; Upper and lower bounds; Eulerian path; Girth (graph theory); Planar graph; Graph; Connectivity; Discrete mathematics; Lagrangian","score_opus":0.018001465331463636,"score_gpt":0.2891017829121568,"score_spread":0.2711003175806932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985797130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041226264,0.000030767216,0.9480187,0.000037361562,0.000033968237,0.00030371055,0.000023104278,0.000046412348,0.010279682],"genre_scores_gemma":[0.72004265,0.000008330487,0.27986884,0.000006319815,0.00000387998,0.000025707039,0.0000041199823,0.000010891741,0.000029250645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986008,0.000011698289,0.00044617124,0.00023630803,0.00045107765,0.00025395525],"domain_scores_gemma":[0.9986151,0.00016309215,0.00027013314,0.0007858687,0.000092419876,0.00007339222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022393868,0.00013736429,0.00027284547,0.00013685747,0.00006576597,0.000021234526,0.0008076711,0.000039499042,0.0000091499105],"category_scores_gemma":[0.00004013975,0.00012312701,0.000089505666,0.0006867832,0.00023955319,0.0001845633,0.00018996446,0.00010810411,0.0000088232655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067162155,0.00010813585,0.000014157023,0.00014687775,0.00001977663,0.0000014716558,0.0024528345,0.001381335,0.01094392,0.9845263,0.000004507283,0.00039400524],"study_design_scores_gemma":[0.0005272423,0.000050429546,0.000048658854,0.000055200973,0.000008599442,0.0000019973324,0.0006423493,0.0017585821,0.053665683,0.9430854,0.000020634385,0.00013527849],"about_ca_topic_score_codex":0.0000021414469,"about_ca_topic_score_gemma":0.0000029607845,"teacher_disagreement_score":0.6788164,"about_ca_system_score_codex":0.000024779709,"about_ca_system_score_gemma":0.000056256205,"threshold_uncertainty_score":0.5020974},"labels":[],"label_agreement":null},{"id":"W1986161890","doi":"10.1016/j.ejc.2008.09.022","title":"On the geodesic pre-hull number of a graph","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Hull; Geodesic; Bipartite graph; Convex hull; Graph; Discrete mathematics; Regular polygon; Geometry","score_opus":0.027576156594967358,"score_gpt":0.2700224635671326,"score_spread":0.24244630697216524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986161890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79029804,0.000221565,0.18567795,0.00058585504,0.00061029714,0.00011276679,8.964977e-7,0.000028011049,0.022464588],"genre_scores_gemma":[0.9977153,0.00012703729,0.0016053752,0.00012657198,0.000033560857,4.402543e-7,6.823401e-8,0.000018962872,0.00037269088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974129,0.0009802184,0.00044961268,0.00013870731,0.0007761013,0.00024246752],"domain_scores_gemma":[0.9978043,0.00058539835,0.0004448001,0.00060458435,0.00043274835,0.00012820544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020058453,0.00012643069,0.00020509143,0.00016265968,0.00016820992,0.000032293083,0.0020269991,0.0000151836175,0.000021709733],"category_scores_gemma":[0.00036685445,0.000082566745,0.00017472336,0.0008425463,0.00020146322,0.0002839953,0.00021922776,0.00051613577,0.00005799813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060530503,0.00022945779,0.0014846952,0.000007783025,0.000039696155,0.00051318883,0.0007667432,0.00018011633,0.00019261817,0.991578,0.0034526032,0.0014945819],"study_design_scores_gemma":[0.0019477782,0.0017846484,0.02309174,0.00015414113,0.00001476061,0.0016994608,0.00005651401,0.00047522955,0.003780176,0.95872045,0.0079437895,0.00033130843],"about_ca_topic_score_codex":3.4777932e-7,"about_ca_topic_score_gemma":2.6704962e-8,"teacher_disagreement_score":0.20741722,"about_ca_system_score_codex":0.000028472401,"about_ca_system_score_gemma":0.00007694982,"threshold_uncertainty_score":0.37667024},"labels":[],"label_agreement":null},{"id":"W1986861105","doi":"10.1016/s0095-8956(03)00031-5","title":"Bounded size components—partitions and transversals","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Bounded function; Degree (music); Vertex (graph theory); Graph; Constant (computer programming); Component (thermodynamics); Frequency partition of a graph; Induced subgraph; Vertex connectivity; Discrete mathematics; Graph power; Line graph; Computer science; Physics","score_opus":0.016114984336661697,"score_gpt":0.265491512526323,"score_spread":0.24937652818966133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986861105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7611409,0.0014693112,0.20577146,0.002213395,0.011433358,0.0004930801,0.000009232869,0.0001432733,0.017326035],"genre_scores_gemma":[0.99085605,0.00011271728,0.008609691,0.00007245644,0.00009655865,0.000002923742,1.8211759e-7,0.000012129269,0.00023731275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790597,0.0007762549,0.0004188777,0.0001632022,0.00044334965,0.00029232464],"domain_scores_gemma":[0.99800235,0.0009478798,0.0002300589,0.00031149242,0.00028841637,0.00021981534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019981058,0.00014716979,0.00031230255,0.00013445604,0.00025974284,0.00018441225,0.00059475674,0.0000659263,0.00008336279],"category_scores_gemma":[0.0007947145,0.00012890121,0.00012119515,0.00036051974,0.00032904657,0.0014702906,0.00006524113,0.0003288245,0.0000052416563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023303909,0.000099968966,0.0000509271,0.000007950046,0.000052266507,0.000041795924,0.0005309859,0.000009332456,0.004792153,0.99377745,0.00009834307,0.00030575547],"study_design_scores_gemma":[0.0014704556,0.00048362292,0.00014682364,0.000022697437,0.000012757749,0.00031048903,0.00019551573,0.0000061357036,0.009668742,0.968447,0.019103043,0.00013267604],"about_ca_topic_score_codex":4.9998704e-7,"about_ca_topic_score_gemma":2.996635e-7,"teacher_disagreement_score":0.22971517,"about_ca_system_score_codex":0.00004598536,"about_ca_system_score_gemma":0.00012174375,"threshold_uncertainty_score":0.5256439},"labels":[],"label_agreement":null},{"id":"W1987809901","doi":"10.5555/1873601.1873628","title":"Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Combinatorics; Parity (physics); Mathematics; Ackermann function; Time complexity; Subdivision; Discrete mathematics; Vertex (graph theory); Graph; Inverse; Geometry","score_opus":0.01978642089397287,"score_gpt":0.29402099037229334,"score_spread":0.2742345694783205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987809901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6527158,0.0003444906,0.30946776,0.005685002,0.0027351275,0.0025573014,0.00017490043,0.0011665784,0.025153028],"genre_scores_gemma":[0.8906796,0.0002703315,0.10771524,0.0004658555,0.0003002025,0.00012174621,0.000039098075,0.00007311522,0.00033480284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953496,0.0002730713,0.00069564814,0.0015233435,0.0010380879,0.0011202468],"domain_scores_gemma":[0.99700737,0.00028786153,0.000333956,0.0016726402,0.00024195864,0.0004562384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013055442,0.00051543786,0.00051140966,0.00019881697,0.00063036504,0.0005510226,0.0013927575,0.00023649202,0.00007295918],"category_scores_gemma":[0.0002560743,0.0004596269,0.0001814672,0.0007906207,0.00033699285,0.0013312522,0.0012538201,0.0011916786,0.00011647896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008951654,0.0020466354,0.009452774,0.00026878822,0.0005003774,0.0007262701,0.008110292,0.00019923145,0.14191979,0.5393721,0.0018810491,0.29462758],"study_design_scores_gemma":[0.0071917158,0.0025429893,0.053483985,0.00039214126,0.00008072758,0.0002542521,0.00045555164,0.21591444,0.065386966,0.6335759,0.017124757,0.0035965375],"about_ca_topic_score_codex":0.0001290229,"about_ca_topic_score_gemma":0.00009772328,"teacher_disagreement_score":0.29103103,"about_ca_system_score_codex":0.000077437995,"about_ca_system_score_gemma":0.00010253705,"threshold_uncertainty_score":0.99978554},"labels":[],"label_agreement":null},{"id":"W1988192783","doi":"10.5784/23-1-46","title":"An algorithm for the (r,s)-domination number of a tree","year":2007,"lang":"en","type":"article","venue":"Orion/ORiON","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Neighbourhood (mathematics); Combinatorics; Vertex (graph theory); Mathematics; Graph; Function (biology); Tree (set theory); Domination analysis; Discrete mathematics; Algorithm","score_opus":0.021198265349127925,"score_gpt":0.3456694556178839,"score_spread":0.324471190268756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988192783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010086043,0.00007260128,0.98773,0.00031914588,0.00046524536,0.00042600353,0.0000052612927,0.00006727561,0.0008283793],"genre_scores_gemma":[0.62574095,0.000050421033,0.37252057,0.000104949286,0.0004301573,0.000074202704,0.000014174527,0.00002911752,0.0010354373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985444,0.0000781237,0.00025670562,0.00032618415,0.00044702535,0.00034758632],"domain_scores_gemma":[0.99813765,0.0006418681,0.00013228085,0.0006985458,0.00030053416,0.00008909273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018538195,0.0001197626,0.00013798628,0.00012327703,0.00021803309,0.000057169305,0.0008742768,0.00007434012,0.000018764382],"category_scores_gemma":[0.000101114936,0.00008899286,0.0000907212,0.0006319215,0.000095534626,0.000641333,0.00010057127,0.00013532028,0.000025140173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036311507,0.000079911784,0.00020129229,0.000006931098,0.000009752043,0.0000025301797,0.00041557426,0.000027465056,0.0031043976,0.13077782,0.00012796425,0.86521006],"study_design_scores_gemma":[0.0036235712,0.0010983757,0.0165932,0.00007027316,0.00004075001,0.000085905005,0.0006958327,0.47507453,0.11346592,0.33535463,0.053150196,0.00074682414],"about_ca_topic_score_codex":0.00002293094,"about_ca_topic_score_gemma":0.000039689367,"teacher_disagreement_score":0.8644632,"about_ca_system_score_codex":0.00006990836,"about_ca_system_score_gemma":0.000049772298,"threshold_uncertainty_score":0.36290234},"labels":[],"label_agreement":null},{"id":"W1988645991","doi":"10.1016/j.cor.2012.01.005","title":"A Tabu search algorithm for the network pricing problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Wilfrid Laurier University; SNC-Lavalin (Canada)","funders":"","keywords":"Tabu search; Guided Local Search; Mathematical optimization; Computer science; Combinatorial optimization; Flow network; Algorithm; Mathematics","score_opus":0.08855724499197673,"score_gpt":0.39515374008068405,"score_spread":0.30659649508870734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988645991","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063016743,0.0014566192,0.99113125,0.0033398517,0.000494517,0.002308632,0.0000057374045,0.00015019577,0.00048300857],"genre_scores_gemma":[0.095666796,0.00011763236,0.89991933,0.00027829045,0.0014114002,0.001057424,0.0000135780165,0.00004413163,0.0014914136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949493,0.0009013254,0.00034211928,0.0005765275,0.0012212271,0.00200949],"domain_scores_gemma":[0.9942721,0.0029418273,0.000020768508,0.0013367066,0.0010678676,0.00036069163],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008297322,0.00020060867,0.00020951948,0.0002901779,0.0031607503,0.0009910872,0.0029418815,0.00008629362,0.000020986741],"category_scores_gemma":[0.00015885403,0.00014629822,0.00011928537,0.0028069105,0.00039823356,0.0013409449,0.0017061086,0.0008972108,0.00015187262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010985397,0.00016114464,0.0002050451,0.000022008024,0.00007107967,0.0000033030817,0.0024636146,0.0862132,0.00027508446,0.35155293,0.010129109,0.5488925],"study_design_scores_gemma":[0.00036475234,0.00016454126,0.00041152767,0.000033253797,0.0000034291124,0.000024581524,0.00016727336,0.9714524,0.00044954335,0.0038331577,0.02289858,0.00019693079],"about_ca_topic_score_codex":0.00006813715,"about_ca_topic_score_gemma":0.000022424458,"teacher_disagreement_score":0.88523924,"about_ca_system_score_codex":0.0001953387,"about_ca_system_score_gemma":0.00036215832,"threshold_uncertainty_score":0.998137},"labels":[],"label_agreement":null},{"id":"W1989224319","doi":"10.1016/j.jctb.2008.07.003","title":"Excluding a group-labelled graph","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Mathematics; Graph; Abelian group; Robertson–Seymour theorem; Discrete mathematics; Line graph; 1-planar graph","score_opus":0.025041027880452885,"score_gpt":0.2730869488318363,"score_spread":0.24804592095138345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989224319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4796389,0.0024384134,0.4878167,0.0010195599,0.018810835,0.00044587674,0.0000027159274,0.00026152696,0.009565475],"genre_scores_gemma":[0.98595214,0.00036651723,0.012586645,0.000083696956,0.0005641765,0.0000047174076,3.2136944e-7,0.000024335503,0.00041747146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971985,0.0006584905,0.0006264832,0.00023231319,0.00083641725,0.00044777288],"domain_scores_gemma":[0.99754936,0.0006641623,0.00048549898,0.00054652814,0.0004997863,0.00025464865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002482114,0.00021470591,0.0004624933,0.00043732798,0.0004576523,0.000093603,0.0018065668,0.00009577464,0.0000505603],"category_scores_gemma":[0.00059923076,0.00018017058,0.00027210696,0.0009777136,0.00039506634,0.0022297911,0.0003575532,0.00056886865,0.000014907676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070049043,0.00014362887,0.00015239046,0.000008232465,0.000073316725,0.0003757601,0.0008432489,0.000020744048,0.0029701425,0.9927277,0.00042203185,0.0015622941],"study_design_scores_gemma":[0.0018073603,0.001000739,0.00015576242,0.000035332858,0.000008588916,0.0012548389,0.00012149205,0.000021118678,0.005151478,0.9826306,0.007610557,0.00020211171],"about_ca_topic_score_codex":7.675692e-7,"about_ca_topic_score_gemma":1.9409958e-7,"teacher_disagreement_score":0.5063132,"about_ca_system_score_codex":0.00007472951,"about_ca_system_score_gemma":0.00015720884,"threshold_uncertainty_score":0.7347143},"labels":[],"label_agreement":null},{"id":"W1989358594","doi":"10.1016/j.dam.2014.06.007","title":"Constructions of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-critical<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si12.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs","year":2014,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Vertex (graph theory); Graph; Combinatorics; Algorithm; Discrete mathematics","score_opus":0.018204848653324352,"score_gpt":0.25829085320337314,"score_spread":0.24008600455004878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989358594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7150432,0.0013630074,0.02434282,0.0010670737,0.0040379306,0.00023528197,0.001536966,0.0007872875,0.25158644],"genre_scores_gemma":[0.9489768,0.0016940251,0.03900299,0.0016358478,0.002330092,0.0026900528,0.0017187526,0.0015837325,0.00036770196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.979624,0.0007518755,0.004554628,0.003969271,0.0058990284,0.0052012443],"domain_scores_gemma":[0.979621,0.005662549,0.0041266307,0.0075436076,0.00054765755,0.002498558],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004749096,0.0022746504,0.0011857705,0.0012572876,0.0035344807,0.0029940186,0.006892463,0.0038314546,0.040790208],"category_scores_gemma":[0.0045977766,0.003741434,0.0037620575,0.0030559485,0.0061314255,0.0030096471,0.006583895,0.0039946088,0.004306504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017334912,0.0009857189,0.000010776081,0.003977095,0.0024926094,0.0011996301,0.0036450808,0.0024737683,0.005561507,0.93358934,0.041848447,0.0024825584],"study_design_scores_gemma":[0.003351159,0.0019531151,0.00003819485,0.002342765,0.002208814,0.002103241,0.0033151808,0.53945833,0.4318634,0.0071076974,0.0033683202,0.002889778],"about_ca_topic_score_codex":0.0007291121,"about_ca_topic_score_gemma":0.0008723333,"teacher_disagreement_score":0.9264816,"about_ca_system_score_codex":0.000052914547,"about_ca_system_score_gemma":0.0025901208,"threshold_uncertainty_score":0.99899924},"labels":[],"label_agreement":null},{"id":"W1989578968","doi":"10.1016/j.dam.2007.05.044","title":"On bags and bugs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Science and Engineering Research Board","keywords":"Combinatorics; Mathematics; Chordal graph; Discrete mathematics; Graph; Indifference graph","score_opus":0.01574263487328406,"score_gpt":0.2900160010133184,"score_spread":0.2742733661400344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989578968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045246944,0.000022154301,0.89239293,0.00012926973,0.000040560964,0.00023892839,0.000001038526,0.00014288988,0.061785296],"genre_scores_gemma":[0.7076694,0.0000095688065,0.29178956,0.00020399726,0.00002214303,0.0000150661535,9.843884e-7,0.000018682345,0.0002706154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987875,0.000007294691,0.0002045343,0.0002881863,0.00035177154,0.0003606753],"domain_scores_gemma":[0.9986804,0.00048543763,0.00006457902,0.00060763897,0.000025077137,0.00013683863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072088715,0.00013964843,0.0001561517,0.00012250693,0.00011465901,0.00007559087,0.0005221772,0.00004984996,0.00000956324],"category_scores_gemma":[0.00007346703,0.00011386749,0.000030000918,0.0002894109,0.00011001246,0.00010911809,0.00026024986,0.00016198309,0.00010148206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007836543,0.000030443249,0.000004101812,0.000030674782,0.0000065509444,0.0000070677265,0.00074402307,0.000008607281,0.0033334957,0.98706955,0.00008162763,0.008676026],"study_design_scores_gemma":[0.00020144062,0.00004391886,0.0000901247,0.000022247308,0.0000029357475,0.000010046309,0.00020816996,0.0022378906,0.01233715,0.9843801,0.00029005235,0.00017591614],"about_ca_topic_score_codex":3.5962842e-7,"about_ca_topic_score_gemma":0.0000013122005,"teacher_disagreement_score":0.6624224,"about_ca_system_score_codex":0.00001877843,"about_ca_system_score_gemma":0.000010433785,"threshold_uncertainty_score":0.46433815},"labels":[],"label_agreement":null},{"id":"W1989763262","doi":"10.5539/jmr.v1n1p25","title":"Perfect Glued Graphs at Complete Clones","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Cograph; Split graph; Clique-sum; Indifference graph; Disjoint sets; Chromatic scale; Discrete mathematics; Pathwidth; Block graph; Graph; 1-planar graph; Line graph","score_opus":0.13600706403871263,"score_gpt":0.41446255105119795,"score_spread":0.27845548701248535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989763262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66467553,0.0020769094,0.31026804,0.008131183,0.00043287582,0.00082194345,0.000008041814,0.000121409474,0.013464063],"genre_scores_gemma":[0.84209657,0.0003193517,0.15601279,0.000092528804,0.00013018581,0.000004142417,4.0180012e-7,0.000023092365,0.0013209429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950818,0.0005696975,0.0006859894,0.00024762217,0.0026509457,0.00076396717],"domain_scores_gemma":[0.99548864,0.0017436479,0.00028821907,0.00085883634,0.0012665079,0.00035415753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007625949,0.00016596855,0.00043001559,0.0011049514,0.00040773372,0.0002451148,0.0026913707,0.00007971723,0.00008319205],"category_scores_gemma":[0.0010939979,0.00012484385,0.00024795323,0.0013952274,0.00024908813,0.0005925707,0.00050477963,0.0009943899,0.0002036456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015163879,0.0010281161,0.00022644708,0.00017372565,0.0001116495,0.0006779849,0.003491306,0.00018322878,0.084526606,0.8677852,0.008440574,0.033203486],"study_design_scores_gemma":[0.0008774298,0.0015204551,0.0013510843,0.00017730851,0.0000063512334,0.0010517448,0.00021547094,0.009968546,0.008577521,0.972714,0.0033248847,0.00021519094],"about_ca_topic_score_codex":9.82909e-7,"about_ca_topic_score_gemma":0.0000020576583,"teacher_disagreement_score":0.17742103,"about_ca_system_score_codex":0.0001903008,"about_ca_system_score_gemma":0.00015911995,"threshold_uncertainty_score":0.5090985},"labels":[],"label_agreement":null},{"id":"W1989806198","doi":"10.1109/csss.2012.41","title":"On the Decomposition of Posets","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Set (abstract data type); Decomposition; Combinatorics; Space (punctuation); Chain (unit); Mathematics; Computer science; Algorithm; Discrete mathematics; Physics; Chemistry","score_opus":0.02695638876271974,"score_gpt":0.33423375290629787,"score_spread":0.30727736414357815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989806198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2459993,0.000042253527,0.7108711,0.0014675342,0.00010852136,0.00011050218,4.8634655e-7,0.00004792119,0.041352384],"genre_scores_gemma":[0.9907076,0.0000012469742,0.008866565,0.00025408377,0.00001017853,0.000003305611,1.5696666e-7,0.0000016581952,0.00015520379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995396,0.000064240325,0.000052284588,0.000057825575,0.00014984938,0.00013619968],"domain_scores_gemma":[0.9993142,0.0003007677,0.000017476706,0.0003093543,0.000024722429,0.000033476546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032744414,0.000030113137,0.000032603817,0.00003631623,0.000043052358,0.000009725995,0.00039145825,0.000010230658,0.00006207596],"category_scores_gemma":[0.000028159142,0.000016765443,0.000021129797,0.0001639488,0.00003220421,0.00020954742,0.000090358386,0.000048365906,0.00009602186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027358751,0.000029278805,0.00016298954,7.197293e-7,0.0000018616919,1.0743404e-7,0.000086002845,0.0000074825484,0.0034897053,0.99215484,0.0002943059,0.0037699516],"study_design_scores_gemma":[0.00016269133,0.00017193738,0.011812489,0.000012284542,0.0000012882994,0.000009821827,0.00003819176,0.0044560432,0.2722556,0.7101235,0.00084306614,0.00011309273],"about_ca_topic_score_codex":0.0000014820681,"about_ca_topic_score_gemma":2.8793227e-7,"teacher_disagreement_score":0.7447083,"about_ca_system_score_codex":0.0000068889576,"about_ca_system_score_gemma":0.0000047190606,"threshold_uncertainty_score":0.12341988},"labels":[],"label_agreement":null},{"id":"W1989905036","doi":"10.1016/j.disc.2005.09.030","title":"List homomorphisms of graphs with bounded degrees","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Bounded function; Combinatorics; Discrete mathematics; Contrast (vision); Upper and lower bounds; Degree (music); Graph homomorphism; Computational complexity theory; Graph; Computer science; Algorithm; Line graph; Artificial intelligence","score_opus":0.01541211956355663,"score_gpt":0.25741590942436116,"score_spread":0.24200378986080454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989905036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12487552,0.00012872872,0.8564857,0.00013146353,0.000037722974,0.0002792697,0.000011864082,0.00014608823,0.017903639],"genre_scores_gemma":[0.68536735,0.0000043659775,0.31409577,0.000010786469,0.000010791198,0.000016213862,0.000003694738,0.000017747818,0.00047326865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985649,0.00004082023,0.00030806067,0.00024884762,0.0005219803,0.00031536372],"domain_scores_gemma":[0.99859595,0.00017761337,0.00018118709,0.00084822526,0.00013285465,0.00006415014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002860231,0.00016424351,0.0002604861,0.00016000301,0.000104226754,0.00010140082,0.0009161069,0.000041302585,0.0000166096],"category_scores_gemma":[0.000033615594,0.000118597614,0.000081167746,0.0006696814,0.0003501937,0.0002939794,0.00017822668,0.00011577872,0.0000137743655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068279965,0.00009114171,0.00030281776,0.00007836854,0.000016329439,0.000015512162,0.00026407457,0.00008270165,0.0010768418,0.9977411,0.000073484414,0.0002507684],"study_design_scores_gemma":[0.00035666113,0.00015292855,0.00040726806,0.00008372578,0.000010937685,0.000038307404,0.0001172147,0.0109516755,0.008189225,0.979313,0.0001637524,0.0002152691],"about_ca_topic_score_codex":0.000021848318,"about_ca_topic_score_gemma":0.000023663064,"teacher_disagreement_score":0.56049186,"about_ca_system_score_codex":0.00001698353,"about_ca_system_score_gemma":0.000040551156,"threshold_uncertainty_score":0.48362705},"labels":[],"label_agreement":null},{"id":"W1990093945","doi":"10.1016/j.ejc.2004.01.003","title":"Coloring face hypergraphs on surfaces","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Hypergraph; Mathematics; Vertex (graph theory); Upper and lower bounds; Surface (topology); Graph; Discrete mathematics; Geometry","score_opus":0.023794382802791874,"score_gpt":0.26164787578767273,"score_spread":0.23785349298488087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990093945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6992016,0.0006520916,0.2776297,0.0011442776,0.0017185899,0.00010514609,7.210479e-7,0.00009063393,0.019457253],"genre_scores_gemma":[0.9948634,0.00012641233,0.0047135106,0.00009819208,0.000045424615,2.4608715e-7,8.7867654e-8,0.0000217719,0.00013096987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807394,0.00039004278,0.00037582283,0.0001834393,0.0006703505,0.00030643702],"domain_scores_gemma":[0.9986463,0.00016151681,0.00028376898,0.00041153477,0.00028245675,0.00021438238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016531114,0.00014545086,0.00020153642,0.00029471924,0.0001539859,0.0001326777,0.0017020572,0.000017160124,0.0000031626594],"category_scores_gemma":[0.00019677347,0.0001238744,0.00012154548,0.00081184605,0.000071260285,0.0005389927,0.00021210246,0.00051429967,0.00008828578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046839676,0.00025349678,0.00040599797,0.000009613196,0.000037546626,0.001056345,0.00065899256,0.01690298,0.0016989978,0.9741409,0.00026164803,0.004526635],"study_design_scores_gemma":[0.00904899,0.008963882,0.015970793,0.0004890327,0.000025864876,0.00096633896,0.00053804525,0.0005586041,0.03605355,0.8898943,0.03640445,0.0010861182],"about_ca_topic_score_codex":2.8228112e-7,"about_ca_topic_score_gemma":7.489143e-8,"teacher_disagreement_score":0.2956618,"about_ca_system_score_codex":0.000078911224,"about_ca_system_score_gemma":0.000081080274,"threshold_uncertainty_score":0.50514513},"labels":[],"label_agreement":null},{"id":"W1990117560","doi":"10.4153/cmb-2010-034-8","title":"A New Sufficient Condition for a Graph To Be (<i>g</i>, <i>f</i>, <i>n</i>)-Critical","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Qinglan Project of Jiangsu Province of China; Government of Jiangsu Province","keywords":"Mathematics; Combinatorics; Graph; Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.02173126923665959,"score_gpt":0.2996863677020775,"score_spread":0.27795509846541794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990117560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012098426,0.000043924614,0.8620305,0.12945552,0.000095177485,0.0007655613,0.000032145632,0.00013116901,0.006236167],"genre_scores_gemma":[0.39008638,0.0000032635185,0.55909365,0.04711871,0.00021187178,0.00021395744,0.000016238724,0.00004769615,0.003208229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975717,0.00006695795,0.0003320713,0.0005728576,0.00040292824,0.0010534532],"domain_scores_gemma":[0.9961539,0.0006904507,0.000029235322,0.00071133475,0.00017552855,0.0022395875],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005630685,0.00022049113,0.00028446908,0.00038856684,0.00025191842,0.0002441871,0.0010414863,0.000098854885,0.0011819117],"category_scores_gemma":[0.0013864377,0.00021759988,0.00015012789,0.0006480486,0.00008857811,0.000104821396,0.000062524785,0.00019660775,0.002398018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010580676,0.00004682941,5.4442086e-7,0.000018221435,0.000004141291,0.000030137724,0.00026324025,0.000021770888,0.0002521775,0.8825871,0.11317686,0.0035884455],"study_design_scores_gemma":[0.00035644334,0.00046230882,0.00002194854,0.00005558796,0.000007755615,0.000050278373,0.00005118613,0.0010057865,0.0007284344,0.74934185,0.24758479,0.0003336253],"about_ca_topic_score_codex":0.000092455564,"about_ca_topic_score_gemma":0.00020929413,"teacher_disagreement_score":0.38887653,"about_ca_system_score_codex":0.00014825749,"about_ca_system_score_gemma":0.00038374233,"threshold_uncertainty_score":0.9997311},"labels":[],"label_agreement":null},{"id":"W1990242495","doi":"10.1016/j.dam.2003.07.001","title":"A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval graph; Mathematics; Graph; Algorithm; Interval (graph theory); Simple (philosophy); Unit interval; SIMPLE algorithm; Combinatorics; Simple graph; Unit (ring theory); Line graph; Pathwidth","score_opus":0.045052827599361286,"score_gpt":0.31071194466239943,"score_spread":0.26565911706303813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990242495","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021424561,0.000050382754,0.9930312,0.000041991254,0.000056167482,0.0008404681,0.000033778448,0.00006901244,0.003734567],"genre_scores_gemma":[0.12680052,0.000028026232,0.87254083,0.00008580471,0.00001909292,0.00038557636,0.000017379876,0.00003564742,0.00008711382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865067,0.000040021627,0.00037678576,0.0002645415,0.0003251026,0.0003428848],"domain_scores_gemma":[0.99783033,0.0010054285,0.00019742383,0.00075400324,0.00014416524,0.00006865386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087987597,0.0001681731,0.00024782744,0.00011368164,0.00016724135,0.00006688259,0.0008473075,0.00005686322,0.000025391613],"category_scores_gemma":[0.00014493271,0.000118299795,0.00014092783,0.00055072975,0.00016866748,0.00014676373,0.00015012157,0.00015059138,0.000020411208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000637194,0.000073357776,0.0000016622035,0.00008905968,0.000051090046,6.2868423e-7,0.0008909409,0.000022469081,0.0012206344,0.88592094,0.00008050601,0.11164233],"study_design_scores_gemma":[0.00042593293,0.00007549741,0.000006476182,0.00002101371,0.000022704276,0.000006354058,0.00093026937,0.050485443,0.020089285,0.9268503,0.00092973106,0.0001570017],"about_ca_topic_score_codex":0.00000211627,"about_ca_topic_score_gemma":0.000002543697,"teacher_disagreement_score":0.12465806,"about_ca_system_score_codex":0.000013522464,"about_ca_system_score_gemma":0.000035652192,"threshold_uncertainty_score":0.48241258},"labels":[],"label_agreement":null},{"id":"W1990318969","doi":"10.1007/s00012-007-2030-4","title":"Not every full duality is strong!","year":2007,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Duality (order theory); Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.025290600793800626,"score_gpt":0.2904640971381592,"score_spread":0.26517349634435855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990318969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16172543,0.000073523544,0.8156997,0.0016276264,0.00031536215,0.0001992668,0.00001981519,0.0003671775,0.019972097],"genre_scores_gemma":[0.9802355,0.00001794064,0.016225059,0.0010427035,0.00007465289,0.0000013402852,0.000004968663,0.000017420922,0.0023804074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979732,0.000104143764,0.00020471554,0.00052452175,0.00055528147,0.0006381179],"domain_scores_gemma":[0.9981916,0.00031879768,0.000079170146,0.0010101564,0.00015426548,0.00024602382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000914176,0.00016885082,0.000167452,0.00026483106,0.00018323315,0.00008217435,0.0013859493,0.00008926154,0.00018232274],"category_scores_gemma":[0.000060429713,0.00017590035,0.000112642374,0.0009009729,0.0001810909,0.0011298093,0.00052393816,0.00026083566,0.00023251494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086946784,0.000059923175,0.00054844265,0.000008888517,0.00004402112,0.00016990986,0.0013406589,0.000011011053,0.0026473892,0.97321534,0.0031078625,0.018759588],"study_design_scores_gemma":[0.0054691257,0.0013038961,0.03910381,0.0001020529,0.00007257473,0.00020908253,0.004059075,0.0077500492,0.2492034,0.39957595,0.2898669,0.0032840976],"about_ca_topic_score_codex":0.000088982226,"about_ca_topic_score_gemma":0.000054169792,"teacher_disagreement_score":0.81851006,"about_ca_system_score_codex":0.00012924548,"about_ca_system_score_gemma":0.00008421704,"threshold_uncertainty_score":0.7173008},"labels":[],"label_agreement":null},{"id":"W1990357453","doi":"10.1006/jctb.2001.2068","title":"Totally Free Expansions of Matroids","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; National Security Agency","keywords":"Matroid; Combinatorics; Mathematics; Duality (order theory); Extension (predicate logic); Graphic matroid; Element (criminal law); Discrete mathematics; Rank (graph theory); Computer science","score_opus":0.015787991316954807,"score_gpt":0.2546160460856362,"score_spread":0.2388280547686814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990357453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51181436,0.0063011544,0.37233365,0.0056656515,0.031357754,0.00084302854,0.000032556156,0.00029757436,0.07135428],"genre_scores_gemma":[0.9855386,0.00015980675,0.0131230615,0.00004254677,0.00032391294,0.000002399221,1.4737871e-7,0.000018193765,0.0007913464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769956,0.00042870172,0.0006479934,0.00015697458,0.00076142943,0.00030531618],"domain_scores_gemma":[0.9973552,0.00055103103,0.0004973473,0.00083375664,0.00057946926,0.00018320118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014805049,0.00015763537,0.00040576642,0.00028716752,0.00012541798,0.00006903655,0.002292825,0.00008244048,0.00023787322],"category_scores_gemma":[0.00088838924,0.00013116845,0.00023577856,0.00059032737,0.00028980407,0.0014608024,0.0004549225,0.00039047378,0.000011625997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023597915,0.00017140417,0.000030391051,0.000011950801,0.00005073277,0.000055113363,0.0006738945,0.000038353184,0.0050987653,0.9895655,0.0011387999,0.0029291096],"study_design_scores_gemma":[0.0012630037,0.001166612,0.00006763657,0.00004545542,0.000010354566,0.00020349518,0.00017475165,0.00006520248,0.012625701,0.9798149,0.004432499,0.00013042717],"about_ca_topic_score_codex":6.429075e-7,"about_ca_topic_score_gemma":2.2516419e-7,"teacher_disagreement_score":0.47372422,"about_ca_system_score_codex":0.00004425641,"about_ca_system_score_gemma":0.00007249252,"threshold_uncertainty_score":0.5348894},"labels":[],"label_agreement":null},{"id":"W1990755119","doi":"10.1016/j.dam.2011.04.005","title":"Dichotomy for tree-structured trigraph list homomorphism problems","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Tree (set theory); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.0410811667948333,"score_gpt":0.27026961887385204,"score_spread":0.22918845207901872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990755119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042811353,0.000063336505,0.9694778,0.00006490212,0.000109507426,0.0018847277,0.00002640969,0.00035659038,0.023735631],"genre_scores_gemma":[0.31950325,0.000014683612,0.67903167,0.00008295348,0.000046090263,0.0008913911,0.00001701712,0.00005859284,0.00035436044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978233,0.000018410952,0.0004918384,0.0005737568,0.00043851082,0.00065419875],"domain_scores_gemma":[0.9979564,0.00020140463,0.00024544093,0.0012776352,0.00010774259,0.00021140027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049989665,0.00032617143,0.00041713633,0.00023086896,0.00023774078,0.00012796141,0.001748205,0.00012291629,0.000045952722],"category_scores_gemma":[0.00004850338,0.00026586835,0.0001895898,0.0006403732,0.0002418068,0.00027602806,0.0002901597,0.00022425642,0.000037570047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027149114,0.00010626732,0.000014253633,0.0001990714,0.00005055262,0.0000043055898,0.004419567,0.0000054561788,0.0067228475,0.98320454,0.00028611248,0.004959879],"study_design_scores_gemma":[0.0009551386,0.00010513573,0.0000641463,0.000031934756,0.000024307466,0.0000138153255,0.00020502778,0.006938087,0.020497084,0.9690643,0.0017018223,0.0003992124],"about_ca_topic_score_codex":0.0000039967094,"about_ca_topic_score_gemma":0.000012842096,"teacher_disagreement_score":0.3152221,"about_ca_system_score_codex":0.000029492112,"about_ca_system_score_gemma":0.000043089865,"threshold_uncertainty_score":0.9999794},"labels":[],"label_agreement":null},{"id":"W1990809933","doi":"10.1016/s0166-218x(01)00237-2","title":"On the computational complexity of strong edge coloring","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Mathematics; Edge coloring; Combinatorics; Computational complexity theory; Graph coloring; Time complexity; Graph; Completeness (order theory); Matching (statistics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Graph power; Artificial intelligence; Computer science; Line graph","score_opus":0.09358971132498799,"score_gpt":0.3031898687250434,"score_spread":0.2096001574000554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990809933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020103376,0.000014952421,0.92122144,0.0004474554,0.000034094814,0.00037726667,0.0000090362955,0.000077227254,0.057715137],"genre_scores_gemma":[0.8502447,0.0000018795162,0.14956777,0.0000653949,0.0000123542,0.00003453415,0.0000018502582,0.000011000714,0.00006053157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987306,0.00003013094,0.00027605836,0.00021035015,0.0005026659,0.00025018904],"domain_scores_gemma":[0.9982096,0.00092772255,0.00014862671,0.00060111587,0.00005735206,0.000055566234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035575565,0.00013024261,0.00018985913,0.00006986892,0.00017271764,0.0000543002,0.0009613517,0.000029721792,0.000100213045],"category_scores_gemma":[0.00006184299,0.00009034327,0.0000611644,0.00034055117,0.00033958297,0.00008943562,0.00027316483,0.00018219762,0.0001031372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030018161,0.000076507626,0.0000024706496,0.000032775202,0.000015704245,8.1134203e-7,0.0008875059,0.0024845002,0.00026560604,0.9953597,0.00019554736,0.00067582197],"study_design_scores_gemma":[0.00014489304,0.00003103413,0.000031989362,0.000017296568,0.0000026260757,0.0000017890465,0.00015650992,0.2642678,0.0011486161,0.7340795,0.00003476579,0.00008319946],"about_ca_topic_score_codex":5.019513e-7,"about_ca_topic_score_gemma":4.7153935e-7,"teacher_disagreement_score":0.8301413,"about_ca_system_score_codex":0.000025770034,"about_ca_system_score_gemma":0.000010113745,"threshold_uncertainty_score":0.36840916},"labels":[],"label_agreement":null},{"id":"W1990941137","doi":"10.1002/jgt.20565","title":"Vizing's conjecture: a survey and recent results","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Furman University","keywords":"Conjecture; Counterexample; Cartesian product; Mathematics; Combinatorics; Domination analysis; Product (mathematics); Graph; Upper and lower bounds; Discrete mathematics; Graph theory","score_opus":0.06090426272339177,"score_gpt":0.294004860554233,"score_spread":0.23310059783084125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990941137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33078244,0.0075517083,0.6483178,0.0008577589,0.0016796313,0.00037410457,0.000027717126,0.000112555856,0.010296282],"genre_scores_gemma":[0.9788031,0.001134912,0.019686148,0.0002116032,0.000051346546,0.0000013282192,5.3647375e-7,0.000014772868,0.00009623586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749696,0.0010993849,0.00048395022,0.00023132384,0.0003837231,0.0003046533],"domain_scores_gemma":[0.9976615,0.0008541974,0.00040581322,0.00045606896,0.00039371118,0.00022871776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007399147,0.00014337052,0.00026265584,0.00044839576,0.00011528056,0.00006363274,0.0009976504,0.00006742127,0.000023775408],"category_scores_gemma":[0.00097360957,0.00010643273,0.00009856641,0.00069422607,0.00027124555,0.00053503644,0.00020882499,0.00043959264,0.0000055492246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003087395,0.0002312887,0.004338917,0.00001696067,0.00021265695,0.00034878412,0.004669136,0.000008753976,0.0012572244,0.8628891,0.0011218069,0.121817976],"study_design_scores_gemma":[0.001152199,0.0006607418,0.038176768,0.000035978304,0.000008084482,0.00043906766,0.00008568075,0.000025032758,0.0029299385,0.95477825,0.0015368038,0.00017144969],"about_ca_topic_score_codex":0.000006220008,"about_ca_topic_score_gemma":0.000009592071,"teacher_disagreement_score":0.6480207,"about_ca_system_score_codex":0.000020830286,"about_ca_system_score_gemma":0.000086913795,"threshold_uncertainty_score":0.43402007},"labels":[],"label_agreement":null},{"id":"W1991223992","doi":"10.1016/j.dam.2007.08.013","title":"Planar graph bipartization in linear time","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Planar graph; Combinatorics; Planar; Graph; Vertex (graph theory); Transversal (combinatorics); Planar straight-line graph; Time complexity; Discrete mathematics; Mathematical analysis; Pathwidth; Line graph; Computer science","score_opus":0.01678555882454132,"score_gpt":0.2884691405430597,"score_spread":0.2716835817185184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991223992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016152961,0.00002022888,0.9679788,0.00007851834,0.000038861624,0.00033679255,0.0000022132276,0.0001663068,0.015225347],"genre_scores_gemma":[0.33626783,0.000012418912,0.6630683,0.00014000856,0.000050461345,0.000040694198,0.00001852765,0.000040272836,0.0003614679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984516,0.000015812348,0.0003844965,0.00030122502,0.00038858457,0.0004582819],"domain_scores_gemma":[0.9988783,0.00025945166,0.00010337221,0.000614369,0.000036173053,0.00010834486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010606563,0.00015339552,0.00020358092,0.00032604532,0.000072114126,0.000048432004,0.00070202764,0.00007432315,0.000017468223],"category_scores_gemma":[0.000054626038,0.00013863234,0.00004368528,0.0010697562,0.000076127835,0.00019910774,0.00013483503,0.00017894724,0.0003163114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013316673,0.00008180001,0.00005060711,0.000041983494,0.000008235611,0.00001651582,0.0012723431,0.0002537967,0.014903824,0.9806042,0.00008041282,0.0026730176],"study_design_scores_gemma":[0.000496883,0.00003958462,0.0002541065,0.00003666223,0.000004331341,0.000008498264,0.00020440399,0.048247203,0.016058521,0.9339495,0.0003786929,0.00032165338],"about_ca_topic_score_codex":0.0000012725492,"about_ca_topic_score_gemma":0.0000059471467,"teacher_disagreement_score":0.32011488,"about_ca_system_score_codex":0.00003407085,"about_ca_system_score_gemma":0.000021148451,"threshold_uncertainty_score":0.56532633},"labels":[],"label_agreement":null},{"id":"W1991265104","doi":"10.1145/2537800","title":"New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation","keywords":"Cover (algebra); Combinatorics; Mathematics; Edge coloring; Graph coloring; Graph; Vertex cover; Discrete mathematics; Computer science; Graph power; Line graph; Engineering","score_opus":0.03570242712076727,"score_gpt":0.3221715244481421,"score_spread":0.28646909732737486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991265104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028690486,0.000014030873,0.99360526,0.0018851805,0.0004729422,0.00045414377,0.000015702863,0.00021416745,0.00046955305],"genre_scores_gemma":[0.5318277,0.000006443612,0.4649021,0.0008466137,0.00006551281,0.00008149273,0.0000048699003,0.000024299361,0.0022409502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984969,0.00022124528,0.00023882388,0.00050819275,0.00024270455,0.00029216774],"domain_scores_gemma":[0.99667877,0.0023330431,0.000061761486,0.0005699635,0.00014202057,0.00021441515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787786,0.00015425163,0.00016281393,0.00029994972,0.00035028433,0.00013642471,0.00062705355,0.000058278092,0.0000071660234],"category_scores_gemma":[0.00033303216,0.00015576092,0.000053394822,0.0004921313,0.00004919494,0.000427189,0.000031038482,0.00016311073,0.00007693173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005148509,0.00006402897,0.0000021540784,0.00001890145,0.000030140201,7.926191e-7,0.0009107501,0.04367115,0.0004748739,0.22636282,0.0004318542,0.72751766],"study_design_scores_gemma":[0.0029321765,0.00066393026,0.00020711696,0.00003833967,0.000014513979,0.000011616967,0.000047126552,0.08070351,0.004942137,0.9017888,0.008330766,0.0003199663],"about_ca_topic_score_codex":0.0000039829984,"about_ca_topic_score_gemma":0.0000029547582,"teacher_disagreement_score":0.7271977,"about_ca_system_score_codex":0.00004323384,"about_ca_system_score_gemma":0.000052469695,"threshold_uncertainty_score":0.6351746},"labels":[],"label_agreement":null},{"id":"W1991507146","doi":"10.1007/s003730170006","title":"Diagonal Flips in Labelled Planar Triangulations","year":2001,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Combinatorics; Diagonal; Mathematics; Triangulation; Planar; Sequence (biology); Class (philosophy); Upper and lower bounds; Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.02099190701356197,"score_gpt":0.2671143189203534,"score_spread":0.24612241190679146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991507146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94887173,0.001757386,0.041916974,0.0012485617,0.0004485331,0.00035371666,0.0000043986993,0.00019417111,0.005204526],"genre_scores_gemma":[0.9980438,0.00039133572,0.0011066259,0.000075424025,0.000006707447,0.000022559452,0.0000026980915,0.0000067780766,0.00034410687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989683,0.00007687974,0.00016299324,0.00026976434,0.0002285462,0.00029351885],"domain_scores_gemma":[0.99930584,0.0001858782,0.000034057477,0.00031288055,0.00004928032,0.00011208646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133403,0.00010186589,0.0001387181,0.00032100495,0.00014897334,0.00006768796,0.00039419718,0.000053918997,0.000007890343],"category_scores_gemma":[0.00004541609,0.00009783419,0.000037781312,0.0015477485,0.000059332044,0.00027002997,0.000101850586,0.00017767544,0.00000826221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011019955,0.00008097708,0.029027479,0.000003033417,0.0000049306664,0.000044125507,0.00016225285,0.000010557952,0.000036680594,0.965323,0.00010577909,0.0051901964],"study_design_scores_gemma":[0.0010072605,0.00007026238,0.031459134,0.0000071011664,0.0000015269286,0.000017871438,0.00003094654,0.0028785018,0.000030533458,0.9612796,0.003086499,0.00013079679],"about_ca_topic_score_codex":0.000015444819,"about_ca_topic_score_gemma":0.000017210199,"teacher_disagreement_score":0.049172033,"about_ca_system_score_codex":0.000020777328,"about_ca_system_score_gemma":0.000027812588,"threshold_uncertainty_score":0.39895624},"labels":[],"label_agreement":null},{"id":"W1991583924","doi":"10.1002/jgt.20580","title":"High-girth cubic graphs are homomorphic to the Clebsch graph","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Cubic graph; Foster graph; Edge coloring; Discrete mathematics; Triangle-free graph; Symmetric graph; Graph homomorphism; Petersen graph; Windmill graph; Graph power; Odd graph; Graph; Voltage graph; Line graph; 1-planar graph","score_opus":0.0306625239425227,"score_gpt":0.260962884872394,"score_spread":0.2303003609298713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991583924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5760018,0.0026203336,0.41531566,0.0022179123,0.002042869,0.00061097805,0.000016784941,0.00021815769,0.0009555166],"genre_scores_gemma":[0.9823535,0.0002905402,0.01598637,0.0010557724,0.00015049275,0.000019069694,3.7069495e-7,0.00003559209,0.00010828753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957691,0.001183092,0.0007872264,0.0004347194,0.0010682177,0.0007576344],"domain_scores_gemma":[0.9961217,0.00070228503,0.0007342426,0.0012551408,0.0006854404,0.00050119875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005118832,0.00034765003,0.0005258904,0.0011480926,0.00046714515,0.00015859575,0.0045658574,0.000116794225,0.0001084902],"category_scores_gemma":[0.0003095037,0.00020247957,0.0006022828,0.0030436402,0.0003915852,0.00095032714,0.0004950324,0.001040437,0.000103324244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047787654,0.00026303038,0.0019340732,0.000014855109,0.00023149118,0.0003209565,0.0017426559,0.000105902625,0.0015737896,0.9721525,0.0017492407,0.019433666],"study_design_scores_gemma":[0.0005639988,0.00070584676,0.017917858,0.0000866377,0.00003229409,0.0004196005,0.0004407634,0.00001562852,0.0035524922,0.97437733,0.0015769588,0.0003105655],"about_ca_topic_score_codex":0.000010009249,"about_ca_topic_score_gemma":0.000028216062,"teacher_disagreement_score":0.40635172,"about_ca_system_score_codex":0.000038756018,"about_ca_system_score_gemma":0.00009501843,"threshold_uncertainty_score":0.84845746},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Toroid; Combinatorics; Planar; Planar graph; Chordal graph; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.004346590744890076,"score_gpt":0.23853025931039273,"score_spread":0.23418366856550266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991595634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68969095,0.0012889589,0.30745885,0.00045400384,0.000041141066,0.00054204516,0.000005787092,0.000053835145,0.00046443424],"genre_scores_gemma":[0.9687346,0.000061801904,0.03103894,0.000007778643,0.000015743733,0.00000963283,0.0000028607255,0.000013092367,0.000115527815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986924,0.0000749985,0.00027063143,0.0002208035,0.00032123644,0.00041994487],"domain_scores_gemma":[0.9986961,0.00057369395,0.00013610454,0.00048604398,0.000081554215,0.000026519525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003867027,0.00014322184,0.00017807484,0.0000787229,0.0001400762,0.00008632015,0.00050611637,0.000045695953,0.000004829815],"category_scores_gemma":[0.00010747027,0.0000877485,0.00002776078,0.000431171,0.00020065457,0.00021324729,0.00012077705,0.00023497165,0.0000017079693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029792065,0.000030753505,0.0005317171,0.00004878257,0.000018245957,0.0000019380961,0.00034037148,0.00040772304,0.0083739385,0.9879464,0.000011605154,0.002258717],"study_design_scores_gemma":[0.00050609204,0.0002567176,0.0002680754,0.00003933836,0.0000061614614,0.000017673497,0.000027290327,0.02941188,0.026464282,0.9427167,0.0001299185,0.00015586229],"about_ca_topic_score_codex":0.000015961894,"about_ca_topic_score_gemma":0.0002686016,"teacher_disagreement_score":0.27904367,"about_ca_system_score_codex":0.000046495825,"about_ca_system_score_gemma":0.000080908794,"threshold_uncertainty_score":0.357828},"labels":[],"label_agreement":null},{"id":"W1991670069","doi":"10.1016/s0166-218x(01)00268-2","title":"Domination analysis of some heuristics for the traveling salesman problem","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Southern Taiwan Science Park","keywords":"Travelling salesman problem; Digraph; Mathematics; Combinatorics; Heuristics; Bottleneck traveling salesman problem; Integer (computer science); Christofides algorithm; Upper and lower bounds; Discrete mathematics; Algorithm; Mathematical optimization; Computer science","score_opus":0.03373754081539889,"score_gpt":0.289320133767459,"score_spread":0.25558259295206015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991670069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020356972,0.00009522102,0.9950454,0.00021247946,0.000023343247,0.00066250033,0.000017671815,0.000053493783,0.0018541545],"genre_scores_gemma":[0.5718787,0.000053574,0.4276733,0.000035945304,0.000024536424,0.00016077272,0.00000804145,0.000017688624,0.00014746057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986629,0.00001670359,0.00041965037,0.0002481582,0.0003837033,0.0002689032],"domain_scores_gemma":[0.9977232,0.0011324087,0.0002468465,0.00074043113,0.000108529784,0.00004854027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065627473,0.0001384111,0.00030703578,0.0001935281,0.00017054076,0.00007069366,0.0009215983,0.0000481724,0.000012388439],"category_scores_gemma":[0.000087669454,0.00009657246,0.00016769442,0.0010331128,0.000121543395,0.00013162184,0.00013774363,0.000105271785,0.000008303384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039663364,0.00006173996,0.000003026776,0.00010652313,0.00024675153,3.1928212e-7,0.0022686701,0.0032234658,0.0018457698,0.98457855,0.00004601512,0.0076152114],"study_design_scores_gemma":[0.00019376205,0.000021059906,0.000022445827,0.000009097212,0.0002164007,5.7648043e-7,0.00020797922,0.663431,0.0021941608,0.3335065,0.00009495572,0.00010206447],"about_ca_topic_score_codex":5.9553497e-7,"about_ca_topic_score_gemma":0.00000186898,"teacher_disagreement_score":0.6602075,"about_ca_system_score_codex":0.000022165937,"about_ca_system_score_gemma":0.000008954438,"threshold_uncertainty_score":0.39381108},"labels":[],"label_agreement":null},{"id":"W1991809010","doi":"10.1145/2213977.2214060","title":"The freezing threshold for k-colourings of a random graph","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Kempe Foundation","keywords":"Random graph; Combinatorics; Mathematics; Graph; Discrete mathematics; Random regular graph; 1-planar graph; Line graph","score_opus":0.030189687331009643,"score_gpt":0.3034710440275536,"score_spread":0.27328135669654396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991809010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031213483,0.00061686494,0.9623951,0.0004943657,0.00019550968,0.00042435137,8.435087e-7,0.000067358065,0.004592135],"genre_scores_gemma":[0.9676219,0.000021636937,0.031544987,0.00006637143,0.000041875584,0.00007740076,1.440819e-7,0.0000065805207,0.0006191042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907905,0.000034924895,0.00014841593,0.0001249599,0.00020350613,0.0004091295],"domain_scores_gemma":[0.9984164,0.0009007444,0.000052014908,0.00047358306,0.00008300247,0.00007423443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013748362,0.00006662247,0.000105047075,0.00006481922,0.00021653996,0.000041466476,0.0009052291,0.000024006064,0.00000426042],"category_scores_gemma":[0.00012383795,0.000039320952,0.00010509108,0.00028273466,0.000113852344,0.00040830832,0.000227059,0.000073740375,0.000004953445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005415924,0.000022490933,0.0011410005,0.000007467806,0.000015430947,1.2319539e-7,0.0002451568,0.000017636143,0.0031068947,0.9881793,0.00040756701,0.006802767],"study_design_scores_gemma":[0.0026608952,0.00015394665,0.0010948098,0.000017698303,0.000007630978,0.000008183074,0.00017718396,0.008750583,0.12716779,0.8472748,0.012458866,0.00022765236],"about_ca_topic_score_codex":0.000004093437,"about_ca_topic_score_gemma":0.0000047137332,"teacher_disagreement_score":0.9364084,"about_ca_system_score_codex":0.000009263563,"about_ca_system_score_gemma":0.000015051955,"threshold_uncertainty_score":0.1682156},"labels":[],"label_agreement":null},{"id":"W1991963660","doi":"10.1016/s0095-8956(03)00039-x","title":"The linear delta-matroid parity problem","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Matroid; Matroid partitioning; Oriented matroid; Weighted matroid; Minimax; Combinatorics; Mathematics; Parity (physics); Discrete mathematics; Generalization; Graphic matroid; Mathematical optimization; Mathematical analysis; Physics","score_opus":0.01284547565339551,"score_gpt":0.27372730726499367,"score_spread":0.26088183161159817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991963660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09546268,0.00851757,0.8094148,0.006150691,0.03852988,0.0015610904,0.000009449534,0.0003731625,0.0399807],"genre_scores_gemma":[0.9632435,0.00048617888,0.034438506,0.00010398423,0.00057319726,0.000013379311,3.6506387e-7,0.000037783284,0.0011031361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966437,0.0013294293,0.000619728,0.000188512,0.0007413039,0.0004773249],"domain_scores_gemma":[0.99676234,0.0011910744,0.00048276305,0.0006509203,0.00070621516,0.00020671893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064743785,0.00018623492,0.00030901885,0.00011045227,0.0006150652,0.0002635008,0.0018610796,0.000084762025,0.000022602067],"category_scores_gemma":[0.0014682951,0.00011940165,0.00021217763,0.000567268,0.0003611526,0.0013088887,0.00020971538,0.00067820743,0.000014465234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034667258,0.000075072305,0.00005743113,0.000007925916,0.000054982724,0.000033563458,0.00021758737,0.000055549808,0.0003332031,0.9960042,0.00040027397,0.0024135304],"study_design_scores_gemma":[0.0007163182,0.00055629027,0.00002179686,0.00001806398,0.000007830531,0.00023529542,0.00013665267,0.000024206278,0.0075820372,0.8916751,0.09890081,0.00012557974],"about_ca_topic_score_codex":6.808057e-7,"about_ca_topic_score_gemma":7.345874e-7,"teacher_disagreement_score":0.8677808,"about_ca_system_score_codex":0.0000760988,"about_ca_system_score_gemma":0.00032095556,"threshold_uncertainty_score":0.48690578},"labels":[],"label_agreement":null},{"id":"W1992234658","doi":"10.1016/j.ejc.2015.02.013","title":"Boxicity and cubicity of product graphs","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Austrian Science Fund","keywords":"Intersection graph; Mathematics; Combinatorics; Cartesian product; Graph; Sublinear function; Discrete mathematics; Line graph","score_opus":0.038455324322367514,"score_gpt":0.272555753371019,"score_spread":0.2341004290486515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992234658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83751523,0.0019660299,0.15160646,0.00047805076,0.0008439083,0.00010824833,0.0000010609557,0.000031704738,0.007449312],"genre_scores_gemma":[0.99379694,0.0000783898,0.00598717,0.000026571966,0.00003194985,1.1603897e-7,7.194926e-8,0.000011140755,0.00006765239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979782,0.000699449,0.00040603158,0.00015239092,0.0005769148,0.00018699824],"domain_scores_gemma":[0.9980554,0.00009386071,0.00039454785,0.00037594748,0.0008062172,0.00027400538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035553663,0.00010240223,0.00022967791,0.00023631881,0.00004821311,0.00004743165,0.0009948639,0.000010739105,9.567219e-7],"category_scores_gemma":[0.0005970305,0.0000849383,0.00006484872,0.00065099826,0.00014758151,0.00052518514,0.00034036388,0.00031487356,0.000003959899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011047732,0.00041336459,0.01435789,0.00005098418,0.00006274487,0.000447856,0.0015666082,0.00011241134,0.0024403746,0.9575051,0.002517153,0.020415021],"study_design_scores_gemma":[0.0032731302,0.0029125682,0.029230118,0.00011009646,0.000021842656,0.00072236394,0.00014451891,0.0005589564,0.019237276,0.933644,0.009762236,0.00038288126],"about_ca_topic_score_codex":5.7415934e-7,"about_ca_topic_score_gemma":7.142345e-8,"teacher_disagreement_score":0.15628171,"about_ca_system_score_codex":0.000026580165,"about_ca_system_score_gemma":0.00009282597,"threshold_uncertainty_score":0.3463683},"labels":[],"label_agreement":null},{"id":"W1992400796","doi":"10.1016/s0012-365x(01)00054-1","title":"On the divisibility of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Mathematics; Combinatorics; Divisibility rule; Perfect graph; Perfect graph theorem; Conjecture; Trivially perfect graph; Induced subgraph; Split graph; Discrete mathematics; Graph; Clique number; Vertex (graph theory); Partition (number theory); Cograph; Chromatic scale; Line graph; Pathwidth","score_opus":0.04652455214468322,"score_gpt":0.2935728521492843,"score_spread":0.2470483000046011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992400796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24582748,0.00011607469,0.70680183,0.0017279723,0.00009659991,0.0005534178,0.000011336916,0.00014446353,0.0447208],"genre_scores_gemma":[0.98147255,0.0000096657695,0.018115107,0.00007871015,0.0000044351364,0.000013698766,2.3763174e-7,0.000007975073,0.00029763777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988506,0.00008898918,0.00023130524,0.00019180703,0.00042819305,0.0002090962],"domain_scores_gemma":[0.99754655,0.000968164,0.00010002992,0.0012801359,0.000057419948,0.000047718604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060050044,0.00010121947,0.00014657821,0.00006489442,0.000095118216,0.000042329317,0.0011770675,0.000026152164,0.00012803137],"category_scores_gemma":[0.00043487965,0.00005796968,0.00010104845,0.00045965222,0.00018732873,0.00012467641,0.00023158493,0.00014022163,0.00009090501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.375262e-7,0.000078143756,0.000036701986,0.000026901758,0.000008830348,0.000001173215,0.0011491898,0.000017434784,0.00014638671,0.9970771,0.00025710586,0.0012000594],"study_design_scores_gemma":[0.00007162388,0.000064408676,0.00009205741,0.000026571626,0.00000212807,0.0000018451423,0.00007768338,0.054689348,0.002234624,0.9426198,0.000047977966,0.00007194087],"about_ca_topic_score_codex":7.0337575e-7,"about_ca_topic_score_gemma":5.061713e-7,"teacher_disagreement_score":0.73564506,"about_ca_system_score_codex":0.000009781768,"about_ca_system_score_gemma":0.0000043703603,"threshold_uncertainty_score":0.2363935},"labels":[],"label_agreement":null},{"id":"W1992428436","doi":"10.1016/j.jctb.2013.07.001","title":"Characterizing graphic matroids by a system of linear equations","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Rank (graph theory); Construct (python library); System of linear equations; Binary number; Linear equation; Mathematics; Oriented matroid; Combinatorics; Matroid partitioning; Discrete mathematics; Computer science; Mathematical analysis; Arithmetic; Programming language","score_opus":0.011407239103333898,"score_gpt":0.25369649348407347,"score_spread":0.24228925438073956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992428436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4194393,0.0009374006,0.56663173,0.0012013284,0.008539173,0.0006657499,0.000016487149,0.00015448563,0.0024143287],"genre_scores_gemma":[0.99533105,0.000034776192,0.0042084465,0.000026732803,0.00023552994,0.000011082843,0.0000010370374,0.000017737786,0.00013363374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755687,0.0005617512,0.00077479455,0.00016169604,0.0006346642,0.0003102572],"domain_scores_gemma":[0.99711025,0.00060232164,0.00077606644,0.00047806493,0.00085431803,0.00017898642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018662357,0.00016681726,0.00043866187,0.00033779538,0.0001745343,0.00011794779,0.0013357152,0.0000863282,0.000038400925],"category_scores_gemma":[0.0003788644,0.00013944897,0.00020531828,0.0006843767,0.00020978149,0.0022305944,0.00020707822,0.0003654188,0.000017554277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012937581,0.000079086596,0.00004605323,0.00004627444,0.000063522086,0.000007644744,0.00042772485,0.000009491584,0.049002487,0.94909024,0.00013347763,0.0009645932],"study_design_scores_gemma":[0.0012927254,0.0011760906,0.0001079928,0.00019626973,0.000021569136,0.0001400891,0.0010265561,0.00058800046,0.044726525,0.94871426,0.001768417,0.00024150539],"about_ca_topic_score_codex":0.0000033363765,"about_ca_topic_score_gemma":7.34372e-8,"teacher_disagreement_score":0.57589173,"about_ca_system_score_codex":0.000063076695,"about_ca_system_score_gemma":0.000120420074,"threshold_uncertainty_score":0.5686564},"labels":[],"label_agreement":null},{"id":"W1992434757","doi":"10.1142/s0129054100000259","title":"FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Supertree; Combinatorics; Mathematics; Tree (set theory); Vertex (graph theory); Minor (academic); Bounded function; Embedding; Discrete mathematics; Computer science; Graph; Biology; Artificial intelligence; Phylogenetic tree","score_opus":0.0312662277924988,"score_gpt":0.3391405770950674,"score_spread":0.3078743493025686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992434757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29359227,0.00004040091,0.7030054,0.0018091733,0.0007616432,0.000055770288,0.0000017629052,0.00001114456,0.0007224528],"genre_scores_gemma":[0.84227216,0.000034527926,0.15728498,0.00017800933,0.00013079053,0.0000013425384,6.376866e-7,0.0000035323433,0.00009404727],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743146,0.000055615634,0.0005490343,0.00023759952,0.0014891332,0.00023715499],"domain_scores_gemma":[0.9976573,0.00025930005,0.0002739812,0.00034550112,0.0013286,0.00013530141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010440452,0.000106487874,0.00016469187,0.0007137593,0.00016854134,0.00037391332,0.0040314076,0.000022869324,0.00020624617],"category_scores_gemma":[0.0000693496,0.00009344855,0.00011300502,0.00068925455,0.00052979466,0.0018898126,0.00031336173,0.0001526743,0.000024303057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067979614,0.00034078167,0.0024304686,0.0000044223566,0.00012521792,0.00005971343,0.0011449513,0.031183,0.0072552706,0.3378368,0.00021120686,0.6193402],"study_design_scores_gemma":[0.006087428,0.0024898548,0.14559828,0.00073636265,0.00004162308,0.003169481,0.00032908306,0.32069924,0.047721285,0.4524248,0.019371033,0.0013315256],"about_ca_topic_score_codex":0.000008503235,"about_ca_topic_score_gemma":0.0000047505728,"teacher_disagreement_score":0.6180087,"about_ca_system_score_codex":0.0001786867,"about_ca_system_score_gemma":0.0004554122,"threshold_uncertainty_score":0.7491425},"labels":[],"label_agreement":null},{"id":"W1992517803","doi":"10.1016/j.jalgor.2004.04.011","title":"A polynomial-time algorithm for near-unanimity graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Time complexity; Unanimity; Algorithm; Combinatorics; Polynomial; Mathematics; Computer science; Discrete mathematics","score_opus":0.016181630222047556,"score_gpt":0.2872839656478463,"score_spread":0.27110233542579876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992517803","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005499127,0.00041066014,0.9917136,0.0011995763,0.0006646909,0.0002678261,0.0000133973,0.00005635418,0.00017480372],"genre_scores_gemma":[0.0064994306,0.000049717815,0.99262273,0.0002336647,0.0003273895,0.000009633986,9.994026e-7,0.00002745943,0.00022898962],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779767,0.00008184788,0.00058736256,0.0002992196,0.00067414565,0.000559772],"domain_scores_gemma":[0.9979412,0.00023986374,0.00041827653,0.00046155526,0.00060425804,0.00033486728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013021443,0.00020794332,0.00041398127,0.00033352416,0.00027316192,0.0002540574,0.0015749586,0.00010042749,0.000013925795],"category_scores_gemma":[0.00015331592,0.00017532388,0.00041794003,0.00073311984,0.00018099353,0.0011376041,0.00019198368,0.00040765645,0.000038135386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000978124,0.00044798033,0.0000272383,0.000017910364,0.00020292107,0.00027568016,0.0006743121,0.0012491499,0.0039703962,0.006935403,0.0036191547,0.982482],"study_design_scores_gemma":[0.017560497,0.0073682293,0.0015478578,0.00030854295,0.00011146982,0.004402134,0.00017912655,0.23134631,0.045470092,0.6353648,0.0546672,0.0016737506],"about_ca_topic_score_codex":0.000008880475,"about_ca_topic_score_gemma":7.80766e-7,"teacher_disagreement_score":0.9808083,"about_ca_system_score_codex":0.0001499167,"about_ca_system_score_gemma":0.0004579985,"threshold_uncertainty_score":0.71494997},"labels":[],"label_agreement":null},{"id":"W1992684615","doi":"10.1016/j.jctb.2007.09.004","title":"Oriented star packings","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Digraph; Combinatorics; Disjoint sets; Mathematics; Star (game theory); Vertex (graph theory); Packing problems; Hypergraph; Stars; Discrete mathematics; Graph; Physics; Astrophysics","score_opus":0.010867677503855932,"score_gpt":0.27922039294997053,"score_spread":0.2683527154461146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992684615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26693043,0.0005110886,0.71025985,0.0005998861,0.014352148,0.00021718805,0.0000019545143,0.00012601052,0.0070014414],"genre_scores_gemma":[0.9811851,0.00004430426,0.01742962,0.00012039708,0.0007176166,9.999736e-7,3.8016137e-7,0.000022405375,0.00047917306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997532,0.0003077433,0.0006364376,0.00018876759,0.0008464031,0.0004886496],"domain_scores_gemma":[0.99720913,0.0007264396,0.0004886916,0.000489022,0.0008107376,0.000276001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062031355,0.00017462822,0.0003307778,0.00036458895,0.00018478087,0.00011126724,0.0013940693,0.00009103048,0.000052915973],"category_scores_gemma":[0.0008657706,0.00014469252,0.0001768026,0.00085246406,0.0002433241,0.0018533405,0.000275687,0.0005295919,0.000013673916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011271293,0.00009518311,0.00013003577,0.00000667315,0.0000470392,0.00021468247,0.00062212883,0.0000043918726,0.002669885,0.9894654,0.00020601554,0.0054114177],"study_design_scores_gemma":[0.0010962723,0.0009161559,0.0002654035,0.00002942568,0.000006981813,0.00022522162,0.0003092136,0.000007368675,0.02404247,0.9254724,0.04747333,0.00015577878],"about_ca_topic_score_codex":7.12196e-7,"about_ca_topic_score_gemma":4.5892787e-7,"teacher_disagreement_score":0.7142547,"about_ca_system_score_codex":0.00011147879,"about_ca_system_score_gemma":0.0001574733,"threshold_uncertainty_score":0.59003896},"labels":[],"label_agreement":null},{"id":"W1993089254","doi":"10.1016/s0012-365x(03)00138-9","title":"The Petersen graph is not 3-edge-colorable—a new proof","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Petersen graph; Mathematics; Combinatorics; Graph; Combinatorial proof; Discrete mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Line graph; Voltage graph; Computer science; Graph power","score_opus":0.03119521382550538,"score_gpt":0.2955282700129855,"score_spread":0.2643330561874801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993089254","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035578469,0.00028647482,0.9642904,0.0025060475,0.0002749496,0.000730728,0.0000053827457,0.00017993638,0.028168278],"genre_scores_gemma":[0.3207967,0.00021180014,0.6335429,0.0015972189,0.00013998906,0.00021115593,0.000003915998,0.00014885867,0.04334747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978117,0.00014154997,0.00037013183,0.00039214228,0.00064287736,0.0006416059],"domain_scores_gemma":[0.9974521,0.0005797654,0.00015938582,0.0014831716,0.000106951054,0.00021862432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009654935,0.00023039259,0.00023140053,0.00009979122,0.000461451,0.00040882308,0.0016451249,0.00006560493,0.000034819623],"category_scores_gemma":[0.00047073653,0.00014963634,0.00015710553,0.0007435273,0.00019461999,0.00038659843,0.0002706701,0.0002706831,0.00019795945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057501984,0.000036263413,0.000019363006,0.00003679595,0.00003490934,0.00000885095,0.0025685013,0.000021388107,0.00041480042,0.9907552,0.0029207584,0.003177434],"study_design_scores_gemma":[0.00034991163,0.00009372869,0.000022220589,0.00003931213,0.00001105764,0.000034804183,0.0004002775,0.007140072,0.02182146,0.94504654,0.024742573,0.00029805765],"about_ca_topic_score_codex":0.0000025207046,"about_ca_topic_score_gemma":0.0000052240325,"teacher_disagreement_score":0.33074746,"about_ca_system_score_codex":0.000035877063,"about_ca_system_score_gemma":0.00013689905,"threshold_uncertainty_score":0.6101993},"labels":[],"label_agreement":null},{"id":"W1993237896","doi":"10.1016/j.disc.2008.05.038","title":"The circular chromatic number of hypergraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Mathematics; Generalization; Combinatorics; Mathematical proof; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.023709070813125177,"score_gpt":0.29308402407486295,"score_spread":0.26937495326173777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993237896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3427465,0.00032358765,0.64125496,0.0003211753,0.00011901429,0.00035959782,0.000003484465,0.0001409408,0.01473076],"genre_scores_gemma":[0.8963302,0.00011968131,0.10299942,0.000026808193,0.000015372014,0.000027042584,8.3496474e-7,0.00001874399,0.00046189956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985381,0.00007501089,0.00034918505,0.00018287853,0.0005445914,0.00031023112],"domain_scores_gemma":[0.9980343,0.0004938092,0.00015038479,0.0011452577,0.000102403326,0.000073854884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045409086,0.00012884094,0.00020878726,0.000049027265,0.0003163025,0.000041733823,0.0013265301,0.00003696626,0.000014805261],"category_scores_gemma":[0.00021022986,0.00008147699,0.00013635031,0.00054270076,0.00039301848,0.00020617529,0.00026199906,0.0001227178,0.000105445855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020431664,0.000061118335,0.0005181678,0.00010856265,0.000046117475,0.000020621157,0.0024138978,0.00002916744,0.0013280482,0.9945631,0.00015552358,0.0007536205],"study_design_scores_gemma":[0.0003006328,0.000046953908,0.00061497436,0.00007141095,0.0000108861395,0.00035597925,0.0003559584,0.048033636,0.005539087,0.9435218,0.00089448213,0.00025422254],"about_ca_topic_score_codex":0.000001854237,"about_ca_topic_score_gemma":4.83466e-7,"teacher_disagreement_score":0.55358374,"about_ca_system_score_codex":0.000014560665,"about_ca_system_score_gemma":0.000044534678,"threshold_uncertainty_score":0.33225352},"labels":[],"label_agreement":null},{"id":"W1993350312","doi":"10.1016/j.disc.2012.12.003","title":"Efficient domination in circulant graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Mathematics; Circulant graph; Combinatorics; Wreath product; Dominating set; Discrete mathematics; Graph; Line graph; Product (mathematics); Voltage graph; Vertex (graph theory)","score_opus":0.016434020257279764,"score_gpt":0.27905689023469377,"score_spread":0.262622869977414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993350312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35631633,0.00004117231,0.63842654,0.00032528283,0.00006398188,0.00047412518,0.000001080211,0.000087165245,0.004264307],"genre_scores_gemma":[0.9256169,0.0000036964113,0.074137196,0.000035991103,0.0000060660127,0.000085647975,0.0000014683679,0.0000104446135,0.00010256751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874914,0.00005839151,0.00026809945,0.00024035037,0.00036623533,0.0003178112],"domain_scores_gemma":[0.99903136,0.00017519441,0.0000743958,0.00056941423,0.00007331163,0.00007631179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043923798,0.00011469527,0.00015349619,0.00025099728,0.000055862933,0.00012522594,0.00066929014,0.000039049122,0.000036558613],"category_scores_gemma":[0.00012378207,0.00009290093,0.000056476256,0.00063420535,0.00006323509,0.0001745909,0.0001998923,0.00012733613,0.00027063838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.792327e-7,0.00010311557,0.00016699219,0.00005400663,0.000005422785,0.000008499522,0.0022616251,0.0012554235,0.0022822565,0.9895213,0.00004298583,0.004297463],"study_design_scores_gemma":[0.00019485658,0.000017815133,0.0012396174,0.000036230445,0.0000010756029,0.000007737173,0.00019989129,0.504719,0.0007286901,0.49272102,0.000015229435,0.00011884743],"about_ca_topic_score_codex":0.000009397751,"about_ca_topic_score_gemma":0.0000023867392,"teacher_disagreement_score":0.5693006,"about_ca_system_score_codex":0.00004192233,"about_ca_system_score_gemma":0.000017506032,"threshold_uncertainty_score":0.378839},"labels":[],"label_agreement":null},{"id":"W1993587964","doi":"10.1016/j.disc.2009.12.007","title":"Domination of generalized Cartesian products","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Mathematics; Cartesian product; Combinatorics; Discrete mathematics; Cartesian coordinate system; Algebra over a field; Pure mathematics; Geometry","score_opus":0.017179675835678223,"score_gpt":0.29458408373626477,"score_spread":0.27740440790058657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993587964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3057008,0.000026977566,0.68740994,0.0007649815,0.00024081055,0.00039001225,0.00000485111,0.000108178516,0.0053534233],"genre_scores_gemma":[0.582994,0.0000023534606,0.4166248,0.000011191897,0.000028595132,0.000013962063,0.0000022482727,0.000009418358,0.00031339884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899226,0.00003733839,0.00024209022,0.00020385571,0.00032946919,0.00019498849],"domain_scores_gemma":[0.99868196,0.00009924981,0.00013224434,0.0008409119,0.00018891096,0.000056710054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005078968,0.00009670664,0.00016567319,0.000110899484,0.000054928,0.000045952234,0.00072098087,0.000042519307,0.000017037368],"category_scores_gemma":[0.00037025506,0.00007858432,0.00004703771,0.0004126874,0.0001081204,0.0002719008,0.00015760906,0.00014583363,0.000020856087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019185118,0.000040278497,0.00003262263,0.00007442318,0.0000067768437,0.0000016488259,0.0010334199,0.0000071735417,0.12724125,0.8689965,0.00005095003,0.0025130336],"study_design_scores_gemma":[0.0004838276,0.0000681072,0.0002573874,0.000029464645,0.000009316976,0.0000236838,0.00010701515,0.052032225,0.30876443,0.6371896,0.0007927511,0.00024217648],"about_ca_topic_score_codex":0.000001684992,"about_ca_topic_score_gemma":0.0000039003253,"teacher_disagreement_score":0.2772932,"about_ca_system_score_codex":0.000007013017,"about_ca_system_score_gemma":0.00003919524,"threshold_uncertainty_score":0.32045758},"labels":[],"label_agreement":null},{"id":"W1993739399","doi":"10.5539/jmr.v3n1p148","title":"Net Tape Graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; 1-planar graph; Graph; Ribbon; Indifference graph; Discrete mathematics; Line graph; Chordal graph; Geometry","score_opus":0.21256792913739325,"score_gpt":0.4109825260800115,"score_spread":0.19841459694261826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993739399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14339375,0.00094588427,0.7976132,0.00081614475,0.00049075356,0.0004771011,0.0000019619988,0.00007539818,0.056185823],"genre_scores_gemma":[0.49855766,0.00024809083,0.50018847,0.000033897253,0.000082479615,0.000007534067,1.0719951e-7,0.000027415346,0.0008543651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962793,0.0003857134,0.0005817297,0.00017742671,0.001968151,0.0006076979],"domain_scores_gemma":[0.9965042,0.0008346073,0.00024679676,0.00077739556,0.0013268124,0.00031021851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008075674,0.00011553124,0.00027933903,0.0010825315,0.00017287546,0.00013512578,0.003033181,0.00007039611,0.00017001666],"category_scores_gemma":[0.00091925083,0.00008599328,0.00015712362,0.0013191694,0.00027421975,0.00074132654,0.00058078987,0.0009955182,0.00016132218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030958257,0.00059204485,0.00023805472,0.00008840405,0.00006555405,0.00033535284,0.0051981644,0.0000070129686,0.0029056922,0.9777167,0.002956116,0.009865986],"study_design_scores_gemma":[0.00032729996,0.0005362122,0.00030430767,0.00008418597,0.0000031692166,0.00037367162,0.00058147585,0.002145579,0.007285613,0.9870254,0.0012268465,0.000106280924],"about_ca_topic_score_codex":0.0000038659373,"about_ca_topic_score_gemma":0.0000016666506,"teacher_disagreement_score":0.3551639,"about_ca_system_score_codex":0.000058462032,"about_ca_system_score_gemma":0.00021483154,"threshold_uncertainty_score":0.56364554},"labels":[],"label_agreement":null},{"id":"W1994346013","doi":"10.4153/cmb-2012-046-3","title":"The <i>f</i>-Chromatic Index of a Graph Whose <i>f</i>-Core Has Maximum Degree 2","year":2013,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Research in Fundamental Sciences; School of Mathematics, Institute for Research in Fundamental Sciences","keywords":"Combinatorics; Mathematics; Graph; Graph power; Vertex (graph theory); Degree (music); Edge coloring; Discrete mathematics; Bound graph; Line graph; Physics","score_opus":0.03712894046586018,"score_gpt":0.24669559014851455,"score_spread":0.20956664968265437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994346013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19225137,0.0016803059,0.61427754,0.09813421,0.0005875029,0.0053047077,0.000043872282,0.0005580065,0.087162495],"genre_scores_gemma":[0.9782385,0.0000154825,0.018641973,0.0008977604,0.000038331516,0.00026613264,0.0000019027822,0.000044354056,0.00185556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997288,0.00014939315,0.0005615508,0.0004057979,0.0005880451,0.0010072085],"domain_scores_gemma":[0.9960542,0.001152982,0.00014138401,0.0015096301,0.00025782408,0.00088399433],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007899323,0.00025888212,0.0003543561,0.00026590851,0.00049871224,0.0003753935,0.0024162,0.000117494434,0.0020882224],"category_scores_gemma":[0.0008264762,0.00018222767,0.00016677225,0.0007587248,0.0008622896,0.00016169681,0.00027096967,0.00037072293,0.0064005693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008504364,0.00009926312,0.00021643667,0.00021026205,0.00007814228,0.00009569081,0.0008118131,0.000020157979,0.00045835885,0.901529,0.06495015,0.031522173],"study_design_scores_gemma":[0.00026444448,0.00007361218,0.00048439167,0.00009845555,0.000006334135,0.00007004664,0.00014820506,0.0032989748,0.00022354405,0.9728504,0.022227017,0.000254578],"about_ca_topic_score_codex":0.001405664,"about_ca_topic_score_gemma":0.0011301637,"teacher_disagreement_score":0.78598714,"about_ca_system_score_codex":0.000096933574,"about_ca_system_score_gemma":0.00036943684,"threshold_uncertainty_score":0.998824},"labels":[],"label_agreement":null},{"id":"W1994512037","doi":"10.1016/s0304-3975(01)00263-8","title":"Density via duality","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Homomorphism; Mathematics; Duality (order theory); Partially ordered set; Directed graph; Combinatorics; Discrete mathematics","score_opus":0.024775744892119242,"score_gpt":0.28839810292029566,"score_spread":0.2636223580281764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994512037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026218226,0.000031324762,0.96373934,0.0014092495,0.00041919062,0.00015466641,5.829685e-7,0.00036911498,0.0076582944],"genre_scores_gemma":[0.83339965,0.0000042028587,0.16583724,0.0006338543,0.00008062686,0.000004582045,1.330426e-7,0.0000066910857,0.00003303231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632317,0.0002488447,0.0002697694,0.0009980885,0.0012161733,0.0009439796],"domain_scores_gemma":[0.9971351,0.00037774022,0.000055243327,0.0016389481,0.00028982197,0.0005031298],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002296245,0.00020081775,0.00022148278,0.00023892646,0.00069112494,0.00041170855,0.004150838,0.000053966087,0.00021257553],"category_scores_gemma":[0.00017579678,0.00016854606,0.00008517104,0.0022097765,0.0051666363,0.0011702081,0.002198974,0.00034056013,0.00072139787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029768978,0.0000693369,0.00008090402,0.0000030909778,0.000002174298,0.000027152068,0.00022951044,0.000030486464,0.0008826081,0.9181397,0.000056238834,0.08047581],"study_design_scores_gemma":[0.0001209361,0.000099758014,0.00062690536,0.0000054295024,0.000001086048,0.000070103946,0.0000012049816,0.48593983,0.0057205292,0.50711286,0.00012197989,0.00017941672],"about_ca_topic_score_codex":0.0000019480515,"about_ca_topic_score_gemma":3.9114005e-7,"teacher_disagreement_score":0.8071814,"about_ca_system_score_codex":0.00008062176,"about_ca_system_score_gemma":0.000034280973,"threshold_uncertainty_score":0.9975407},"labels":[],"label_agreement":null},{"id":"W1994609765","doi":"10.1007/s00373-006-0653-4","title":"Coloring Vertices and Faces of Locally Planar Graphs","year":2006,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Outerplanar graph; Graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.011546693249279157,"score_gpt":0.23584856605866827,"score_spread":0.22430187280938912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994609765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817954,0.0034995873,0.01310845,0.000109264176,0.00014992061,0.00013765403,0.0000032966368,0.00008075668,0.0011156986],"genre_scores_gemma":[0.99764955,0.00042456336,0.0018294437,0.000020399173,0.0000030075557,0.000008572744,8.914794e-7,0.0000067608457,0.00005683998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891216,0.000046875186,0.00019870164,0.00029694728,0.00027700877,0.00026834125],"domain_scores_gemma":[0.9993195,0.00015842657,0.00007718603,0.00026573546,0.000091224574,0.00008792399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025233263,0.00012715666,0.00018859579,0.0002237447,0.00016069894,0.00008149961,0.00037972172,0.00005495174,8.819798e-7],"category_scores_gemma":[0.000016726148,0.00011573383,0.000036567577,0.0007353153,0.00021947279,0.0003314529,0.00015889676,0.000120770535,6.635993e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010671082,0.00005131693,0.032595024,0.00003852516,0.000011158722,0.000009192142,0.00009001333,0.000008957373,0.00074392033,0.96390283,0.000054237,0.0024841751],"study_design_scores_gemma":[0.00045412543,0.0002257335,0.023289306,0.00002005061,0.0000060451516,0.000009166561,0.00006234079,0.001022888,0.0019962594,0.972141,0.00062437094,0.00014866922],"about_ca_topic_score_codex":0.000070524584,"about_ca_topic_score_gemma":0.000011009791,"teacher_disagreement_score":0.01585415,"about_ca_system_score_codex":0.0000071470517,"about_ca_system_score_gemma":0.000018623585,"threshold_uncertainty_score":0.47194886},"labels":[],"label_agreement":null},{"id":"W1995160715","doi":"10.1016/j.ejc.2009.11.009","title":"Circuit and fractional circuit covers of matroids","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Mathematics; Conjecture; Combinatorics; Cover (algebra); Circumference; Graphic matroid; Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.02325855087543759,"score_gpt":0.25863036851149096,"score_spread":0.23537181763605336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995160715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15081978,0.00093973015,0.8222717,0.00047432556,0.00069185416,0.00008022782,0.0000019552467,0.000031796942,0.024688618],"genre_scores_gemma":[0.99842954,0.00011164165,0.0011604121,0.00010797715,0.000051088264,6.922728e-8,1.7766091e-7,0.00000964954,0.00012944585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830616,0.00033311252,0.0004178955,0.00013991866,0.0006063751,0.00019655962],"domain_scores_gemma":[0.9985941,0.00017181368,0.0004048494,0.00027463594,0.00038041174,0.00017415665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014216711,0.00010597809,0.0002106866,0.00026502679,0.00007894542,0.00006690009,0.00083033805,0.000018191406,0.0000094374445],"category_scores_gemma":[0.00017906113,0.00009963549,0.00009001702,0.00046595893,0.000082138824,0.00061150116,0.00009158475,0.00036984528,0.000009213364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026353737,0.00014783863,0.0012659169,0.000009347276,0.000028618788,0.00028059148,0.00027488865,0.00012728319,0.0034777895,0.97676617,0.0005674648,0.01702771],"study_design_scores_gemma":[0.0023192575,0.0023975414,0.07168182,0.000091115806,0.000018285415,0.001018219,0.000075912634,0.00033866006,0.0017554966,0.9111443,0.008875669,0.000283728],"about_ca_topic_score_codex":1.3546001e-7,"about_ca_topic_score_gemma":1.1039677e-8,"teacher_disagreement_score":0.84760976,"about_ca_system_score_codex":0.00004664028,"about_ca_system_score_gemma":0.00007682341,"threshold_uncertainty_score":0.40630174},"labels":[],"label_agreement":null},{"id":"W1995612970","doi":"10.1016/s0012-365x(02)00260-1","title":"On cop-win graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Calgary; Université de Montréal","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Discrete mathematics; Indifference graph; Graph","score_opus":0.034749443931359224,"score_gpt":0.290733015575863,"score_spread":0.2559835716445038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995612970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023991106,0.00016426461,0.87480444,0.0010096116,0.00019498126,0.00039775265,0.00000837994,0.00045219067,0.098977275],"genre_scores_gemma":[0.83619857,0.000048094636,0.15901867,0.0004494196,0.000030717558,0.000046272366,0.0000021259061,0.000041168674,0.004164961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856013,0.00005505666,0.00022496967,0.0002962309,0.00048882223,0.00037479567],"domain_scores_gemma":[0.99837977,0.00035857252,0.00007469771,0.0010144166,0.000046744808,0.00012578342],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027142162,0.00016026726,0.00018070955,0.00016259284,0.00013373278,0.00012658605,0.0010671917,0.00004713114,0.0002092441],"category_scores_gemma":[0.00017780624,0.00012858352,0.00009988059,0.000543224,0.000098036566,0.00025121862,0.00020640544,0.0001912377,0.0010398504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012911094,0.0000814933,0.000009225697,0.000025412553,0.000010113284,0.000016518981,0.00095208496,0.000041156083,0.000129834,0.99414504,0.0016802974,0.0029075518],"study_design_scores_gemma":[0.00021744911,0.00011220804,0.00001700919,0.00004279742,0.000002887704,0.000013706823,0.000060155253,0.09770012,0.0010645018,0.89976245,0.00081380137,0.00019291643],"about_ca_topic_score_codex":5.119445e-7,"about_ca_topic_score_gemma":4.881973e-7,"teacher_disagreement_score":0.81220746,"about_ca_system_score_codex":0.00002240715,"about_ca_system_score_gemma":0.0000055682463,"threshold_uncertainty_score":0.999738},"labels":[],"label_agreement":null},{"id":"W1995632009","doi":"10.1016/j.ejc.2012.02.002","title":"Immersing complete digraphs","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Eulerian path; Immersion (mathematics); Graph; Simple (philosophy); Degree (music); Discrete mathematics; Pure mathematics; Physics","score_opus":0.03739444157553979,"score_gpt":0.2731345082850047,"score_spread":0.2357400667094649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995632009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07598087,0.0025993125,0.8910917,0.0004408356,0.0027339053,0.000075218886,8.5612714e-7,0.000055478115,0.027021835],"genre_scores_gemma":[0.991082,0.000058900063,0.008522074,0.000084773856,0.00014256935,1.2525446e-7,1.8427794e-7,0.00002017133,0.00008919798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776024,0.000737576,0.0003988134,0.00010660259,0.0005488751,0.0004478681],"domain_scores_gemma":[0.99846417,0.00018565632,0.00033090703,0.00039050324,0.00027854065,0.0003502252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027624387,0.00012434434,0.0001933615,0.00029962623,0.00015153136,0.0000977961,0.0014120805,0.000013043591,0.000007747954],"category_scores_gemma":[0.00010892278,0.000108125154,0.00014431741,0.0007356892,0.00007779234,0.0011851449,0.0002802899,0.00042418024,0.00007999399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024636644,0.00025639252,0.004952374,0.00001350311,0.000052507807,0.00024213595,0.0011864295,0.000034316457,0.0023387724,0.9634176,0.0017743391,0.025706982],"study_design_scores_gemma":[0.008385705,0.0035168128,0.105751894,0.0004371251,0.0000934472,0.006607254,0.00086143194,0.0016214041,0.008527658,0.39215955,0.4699522,0.002085502],"about_ca_topic_score_codex":1.3828628e-7,"about_ca_topic_score_gemma":1.0258395e-8,"teacher_disagreement_score":0.9151011,"about_ca_system_score_codex":0.000050694383,"about_ca_system_score_gemma":0.000030707022,"threshold_uncertainty_score":0.4409216},"labels":[],"label_agreement":null},{"id":"W1996212671","doi":"10.1109/icc.2012.6363762","title":"Carving-decomposition based algorithms for the maximum path coloring problem","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Cardinality (data modeling); Path (computing); Approximation algorithm; Disjoint sets; Mathematics; Algorithm; Computer science; Discrete mathematics; Graph; Database","score_opus":0.041602706309320975,"score_gpt":0.3298041118872781,"score_spread":0.28820140557795715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996212671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009294397,0.00012121688,0.99500155,0.0010480877,0.00025138372,0.00063204905,0.0000027633141,0.00016346117,0.0018500333],"genre_scores_gemma":[0.5082477,0.000003785004,0.4907409,0.00030816032,0.00012878246,0.00030644966,0.0000024777335,0.000012950886,0.00024882524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882144,0.00006641605,0.0001322153,0.00021581676,0.00025169857,0.0005123871],"domain_scores_gemma":[0.99866205,0.00061685644,0.000042524614,0.00047342296,0.00009945326,0.00010567193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689958,0.00010178354,0.00008837852,0.000068056484,0.00032744659,0.00010721041,0.00076719205,0.000033857952,0.000019571116],"category_scores_gemma":[0.000027913344,0.00006684923,0.00007071712,0.0003034753,0.000047698068,0.00062454416,0.00018799044,0.00011043011,0.000026729713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053453314,0.00023468294,0.0018348406,0.00006489291,0.000043923355,0.0000026091545,0.0007115921,0.0022042901,0.00637068,0.77240276,0.0011636247,0.21491264],"study_design_scores_gemma":[0.0010285116,0.00030088122,0.00197204,0.000030303725,0.000013447897,0.000015932694,0.00015042722,0.84824944,0.029665254,0.09784748,0.020323073,0.0004032363],"about_ca_topic_score_codex":0.0000124711205,"about_ca_topic_score_gemma":0.0000028354752,"teacher_disagreement_score":0.84604514,"about_ca_system_score_codex":0.00005429178,"about_ca_system_score_gemma":0.000034767658,"threshold_uncertainty_score":0.27260324},"labels":[],"label_agreement":null},{"id":"W1996626788","doi":"10.1112/s0024611500012168","title":"Convex Bodies, Graphs and Partial Orders","year":2000,"lang":"en","type":"article","venue":"Proceedings of the London Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Pointwise; Combinatorics; Convex polytope; Regular polygon; Convex set; Polytope; Mixed volume; Subderivative; Convex body; Convex geometry; Convex analysis; Convex hull; Product (mathematics); Discrete mathematics; Geometry; Mathematical analysis; Convex optimization","score_opus":0.014188926602624495,"score_gpt":0.25693648866429797,"score_spread":0.24274756206167347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996626788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9761711,0.00026744825,0.007885812,0.004882866,0.00005496688,0.00066971953,0.0000033826361,0.0002453876,0.0098193465],"genre_scores_gemma":[0.9446473,0.0002004697,0.05300233,0.0005348207,0.000024157707,0.000045367375,1.7799199e-7,0.00002223374,0.0015231125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861354,0.000008258113,0.00025665158,0.00030313368,0.00046154473,0.00035687655],"domain_scores_gemma":[0.99930423,0.00015441925,0.00008761269,0.00021126302,0.00013193127,0.00011054815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005703758,0.00014589391,0.0002432717,0.000018345494,0.00021024207,0.000107857995,0.0009803801,0.00007645846,0.00010769989],"category_scores_gemma":[0.0001349341,0.0000959565,0.00020087678,0.00036578666,0.00061196974,0.00042129945,0.00037240956,0.0002377594,0.000017791534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014573637,0.000086821085,0.00063716853,0.00023472308,0.000043940174,1.7772211e-7,0.002159644,0.0000020342616,0.002990239,0.9863317,0.0018565228,0.005642426],"study_design_scores_gemma":[0.00038392746,0.000054173244,0.000251294,0.000061312334,0.000013126961,0.000016137043,0.00015182384,0.01395175,0.011816869,0.9717368,0.0014100287,0.00015275023],"about_ca_topic_score_codex":0.0000021162673,"about_ca_topic_score_gemma":8.526494e-8,"teacher_disagreement_score":0.045116518,"about_ca_system_score_codex":0.000016560318,"about_ca_system_score_gemma":0.000017099956,"threshold_uncertainty_score":0.39129925},"labels":[],"label_agreement":null},{"id":"W1996859829","doi":"10.1016/j.aml.2006.01.017","title":"Tree coloring of distance graphs with a real interval set","year":2006,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Arboricity; Vertex (graph theory); Discrete mathematics; Graph; Vertex connectivity; Interval (graph theory); Degeneracy (biology); Planar graph","score_opus":0.015141743432573712,"score_gpt":0.24804148813283733,"score_spread":0.23289974470026362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996859829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22821717,0.0000062727822,0.7603091,0.00023148274,0.000021911701,0.00023893679,0.0000030844956,0.000104305895,0.010867728],"genre_scores_gemma":[0.7030315,0.0000023797922,0.29674965,0.0000832632,0.000014525491,0.000057316323,0.0000023353796,0.000018792283,0.000040236995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985939,0.000016355458,0.00030381206,0.00030542523,0.0004335315,0.0003469765],"domain_scores_gemma":[0.9988356,0.00022404398,0.00018171151,0.00066998095,0.000037831833,0.00005078239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028163346,0.00016892087,0.00026801272,0.00014497212,0.00006632268,0.00004987077,0.00083553593,0.000030439069,0.0000036284498],"category_scores_gemma":[0.0000063896496,0.0001395207,0.00005653253,0.0005422504,0.0002267717,0.00016084428,0.00017187455,0.00014382908,0.00000967245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026281372,0.00007711825,0.00013339617,0.000117680276,0.000022730346,0.000016607775,0.00066093245,0.00018872188,0.047569714,0.9496461,0.00042315255,0.0011175221],"study_design_scores_gemma":[0.0023239134,0.00026199623,0.00100978,0.00028019046,0.000041449464,0.000054142016,0.0006609749,0.01286032,0.10504014,0.87591904,0.00057435606,0.00097370014],"about_ca_topic_score_codex":0.000012878368,"about_ca_topic_score_gemma":0.000029559891,"teacher_disagreement_score":0.47481433,"about_ca_system_score_codex":0.00003060795,"about_ca_system_score_gemma":0.000016714745,"threshold_uncertainty_score":0.56894886},"labels":[],"label_agreement":null},{"id":"W1996888602","doi":"10.1016/j.disc.2011.05.037","title":"Decomposition tree of a lexicographic product of binary structures","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Lexicographical order; Binary number; Mathematics; Arithmetic","score_opus":0.040228358571186555,"score_gpt":0.31151545552536747,"score_spread":0.2712870969541809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996888602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61922467,0.00021537124,0.3750899,0.000036177615,0.00007158386,0.00036685035,0.000010235082,0.00007662968,0.004908581],"genre_scores_gemma":[0.7362888,0.0000096767935,0.26365617,0.000003639225,0.0000061408036,0.000007418237,0.0000016722441,0.000008932419,0.000017547582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988413,0.00006439597,0.0003613394,0.0002154997,0.0003244101,0.00019308193],"domain_scores_gemma":[0.998688,0.000082495135,0.00024516688,0.0008032786,0.00012853245,0.000052565563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030470671,0.00012220476,0.00024433513,0.00026533086,0.000040001512,0.0000113027445,0.00082837645,0.000033148917,0.00002207723],"category_scores_gemma":[0.000062709965,0.0000969924,0.00010970936,0.0006007761,0.00022998091,0.00025674456,0.0002225862,0.00009197275,0.0000025174365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026986243,0.00019558996,0.0005558327,0.00040431376,0.0000516111,0.000005576103,0.005448732,0.000020631407,0.05550247,0.93328464,0.00001797593,0.004485626],"study_design_scores_gemma":[0.00019025737,0.00025231836,0.0046860133,0.000083461935,0.000013857366,0.000015119463,0.00018213566,0.0047418657,0.19630215,0.7933913,0.0000053126346,0.000136224],"about_ca_topic_score_codex":0.000004921362,"about_ca_topic_score_gemma":0.0000021288377,"teacher_disagreement_score":0.14079967,"about_ca_system_score_codex":0.0000063126977,"about_ca_system_score_gemma":0.000025195519,"threshold_uncertainty_score":0.39552355},"labels":[],"label_agreement":null},{"id":"W1996889656","doi":"10.1016/s0166-218x(99)00217-6","title":"Biconvex graphs: ordering and algorithms","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Row; Row and column spaces; Mathematics; Combinatorics; Bipartite graph; Matrix (chemical analysis); Vertex (graph theory); Property (philosophy); Context (archaeology); Permutation (music); Discrete mathematics; Algorithm; Graph; Computer science","score_opus":0.0166004784493937,"score_gpt":0.270519379893698,"score_spread":0.2539189014443043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996889656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071285285,0.00017236324,0.8817416,0.00020563854,0.000040865914,0.00046505488,0.0000041935878,0.00039078362,0.045694206],"genre_scores_gemma":[0.249981,0.00023621632,0.7487681,0.000170127,0.000030984807,0.00010155766,0.0000033534177,0.000042757023,0.00066590804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986646,0.000015094942,0.0002456109,0.0003751767,0.0003136854,0.00038580754],"domain_scores_gemma":[0.99895436,0.00015372057,0.000053377615,0.0006752817,0.000023854289,0.0001394008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031664775,0.00018255947,0.00022672665,0.00011053432,0.00016109085,0.00016311368,0.000648482,0.00005520066,0.00010081645],"category_scores_gemma":[0.000015209933,0.00015701374,0.000043995173,0.00046108928,0.00015094606,0.00024014949,0.00021195147,0.00016689034,0.00012324529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039890438,0.000034640878,0.000007261676,0.00006905013,0.000018394378,0.0000069839352,0.0012826284,0.000038412356,0.0016978601,0.8831617,0.00003786132,0.113641195],"study_design_scores_gemma":[0.00039441796,0.000036805188,0.00006561239,0.000029027413,0.0000070464994,0.00003028437,0.00022439277,0.057030138,0.0032495349,0.9369016,0.0017050932,0.00032601258],"about_ca_topic_score_codex":0.0000017971398,"about_ca_topic_score_gemma":8.0026024e-7,"teacher_disagreement_score":0.17869571,"about_ca_system_score_codex":0.000010939252,"about_ca_system_score_gemma":0.000014817807,"threshold_uncertainty_score":0.64028347},"labels":[],"label_agreement":null},{"id":"W1997048861","doi":"10.1016/j.tcs.2010.12.005","title":"On the complexity of reconfiguration problems","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":258,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Mathematics; Time complexity; Transformation (genetics); PSPACE; NP-complete; Computer science; Computational complexity theory; Combinatorics; Theoretical computer science; Algorithm","score_opus":0.04184605298491346,"score_gpt":0.2974343397464628,"score_spread":0.2555882867615493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997048861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103911705,0.000002151212,0.8822166,0.004071025,0.00044021508,0.0002753094,0.0000013261019,0.00008805465,0.008993648],"genre_scores_gemma":[0.93816423,7.0346226e-7,0.061448947,0.00032199587,0.00004181478,0.000010047066,2.5916754e-7,0.000004720767,0.000007282377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774927,0.00017203993,0.0002515033,0.0005487584,0.00084617716,0.00043223947],"domain_scores_gemma":[0.9971123,0.00083044486,0.00009103326,0.0015036652,0.00030806597,0.00015448694],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034165403,0.00012903297,0.00014880381,0.00016171887,0.00044798045,0.00021139464,0.0037956184,0.00004014512,0.00013212439],"category_scores_gemma":[0.00043438462,0.00007825829,0.000057810375,0.0013087108,0.012964038,0.00045492273,0.00065142073,0.00048563466,0.000069656024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006344228,0.000046949983,0.0000083760915,0.0000032556925,0.000001575672,8.205675e-7,0.00020384937,0.000074633856,0.017742187,0.96987176,0.000019362116,0.012020893],"study_design_scores_gemma":[0.00006967686,0.00016399675,0.00039716644,0.000010166621,5.7518486e-7,0.000009515372,0.0000020814778,0.20673047,0.035295915,0.7572078,0.000032976404,0.00007964717],"about_ca_topic_score_codex":0.0000019042903,"about_ca_topic_score_gemma":0.000002051881,"teacher_disagreement_score":0.83425254,"about_ca_system_score_codex":0.00001602732,"about_ca_system_score_gemma":0.00010043109,"threshold_uncertainty_score":0.98972213},"labels":[],"label_agreement":null},{"id":"W1997448354","doi":"10.1007/s10922-006-9042-9","title":"Transmission Link Dimensioning and Service Assignment for Differentiated Protection","year":2006,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Institut National de la Recherche Scientifique; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Polytechnique Montréal","keywords":"Dimensioning; Computer science; Survivability; Transmission (telecommunications); Reliability (semiconductor); Computer network; Mathematical optimization; Service (business); Link (geometry); Distributed computing; Session (web analytics); Telecommunications","score_opus":0.02169622228251448,"score_gpt":0.24747677780108204,"score_spread":0.22578055551856757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997448354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017826336,0.0018439416,0.978502,0.0008626856,0.00023891965,0.0005721979,1.844309e-7,0.000016625965,0.00013713456],"genre_scores_gemma":[0.9845003,0.00023604346,0.0144814085,0.000046411064,0.0003019346,0.000030887084,7.050304e-7,0.0000097058055,0.00039264202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890816,0.000115706265,0.000347168,0.00015912364,0.00026856476,0.00020126789],"domain_scores_gemma":[0.99942154,0.000054371005,0.00023179567,0.00011500215,0.000106427884,0.00007085627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086070073,0.00009550016,0.0001801026,0.0001081412,0.0001977856,0.00015294662,0.000150337,0.000033535493,4.9269005e-7],"category_scores_gemma":[0.0000019371055,0.000070246046,0.00003616404,0.00020541654,0.0000113026845,0.00024311134,0.00007857074,0.000098237855,3.0820343e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006973825,0.0002641501,0.0011321213,0.0023833155,0.0005336413,0.0001360358,0.0005730225,0.27228016,0.0051946007,0.26368207,0.0030102388,0.4501133],"study_design_scores_gemma":[0.0025120254,0.0006875176,0.0072713583,0.0012372823,0.000069250906,0.00013119612,0.00011240155,0.9082314,0.000106426334,0.042493325,0.036879886,0.00026797957],"about_ca_topic_score_codex":0.0000058171545,"about_ca_topic_score_gemma":9.769902e-7,"teacher_disagreement_score":0.9666739,"about_ca_system_score_codex":0.000030260366,"about_ca_system_score_gemma":0.0000053807494,"threshold_uncertainty_score":0.28645507},"labels":[],"label_agreement":null},{"id":"W1997569066","doi":"10.1016/j.jda.2014.01.002","title":"Corrections to “Finding dominators via disjoint set union” [J. Discrete Algorithms 23 (2013) 2–20]","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Benbria (Canada); Université du Québec en Outaouais","funders":"","keywords":"Disjoint sets; Set (abstract data type); Algorithm; Computer science; Mathematics; Combinatorics","score_opus":0.019056176328588144,"score_gpt":0.30864762417329683,"score_spread":0.2895914478447087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997569066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007062428,0.0002165118,0.98448205,0.0042066574,0.0029773728,0.00035641668,0.00003436572,0.000110800924,0.00055336946],"genre_scores_gemma":[0.5499224,0.00024249732,0.44444877,0.0006069454,0.0018535872,0.00005720628,0.000023797722,0.00016119036,0.0026836176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948289,0.000730796,0.0011621373,0.00070409797,0.0014928522,0.0010812664],"domain_scores_gemma":[0.99583954,0.0005958027,0.00073435716,0.0011265127,0.00062958436,0.0010741946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033062282,0.00049190654,0.00077811966,0.00111681,0.0005785876,0.0004382382,0.0024780459,0.00016429828,0.00005268739],"category_scores_gemma":[0.0004653389,0.00040009164,0.0005039885,0.0018853477,0.00023348011,0.0018873008,0.00081250485,0.0010705127,0.00016482432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003876282,0.00057790475,0.0027361098,0.00014711377,0.0009988147,0.0007295387,0.009859954,0.018247535,0.011282316,0.03884868,0.021476973,0.89470744],"study_design_scores_gemma":[0.0063302247,0.006806903,0.007716817,0.0010125085,0.0002520296,0.0029418285,0.0018257169,0.6278001,0.019049192,0.170696,0.1520347,0.0035339396],"about_ca_topic_score_codex":0.000038693117,"about_ca_topic_score_gemma":0.000027445796,"teacher_disagreement_score":0.8911735,"about_ca_system_score_codex":0.00029676792,"about_ca_system_score_gemma":0.00015532754,"threshold_uncertainty_score":0.9998451},"labels":[],"label_agreement":null},{"id":"W1997658699","doi":"10.1016/j.disc.2006.10.011","title":"The structure of well-covered graphs with no cycles of length 4","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Discrete mathematics; Equivalence relation; Graph; Vector space; Independent set","score_opus":0.010903874820202587,"score_gpt":0.2742881681302803,"score_spread":0.2633842933100777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997658699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44425678,0.00013632423,0.54785836,0.000062629406,0.000078811725,0.00037566235,0.000020644136,0.00005104692,0.0071597383],"genre_scores_gemma":[0.89118415,0.00001995781,0.1086482,0.000008914203,0.0000091272805,0.0000010530003,0.0000010500737,0.000013610196,0.00011395837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855906,0.00004073274,0.00036179597,0.00017495653,0.00056085206,0.0003026271],"domain_scores_gemma":[0.9978983,0.00065664185,0.00028069597,0.0009025388,0.00020138167,0.000060478025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005451232,0.00013664177,0.00022255615,0.00009380911,0.00010706969,0.000035193952,0.001105859,0.000044466622,0.000009592217],"category_scores_gemma":[0.00011823818,0.000075393924,0.00007497794,0.0004982746,0.0003631714,0.00016935464,0.0001923857,0.00014593238,0.000004937236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004708956,0.000036478454,0.0003867684,0.00014617958,0.000057588102,0.0000036897495,0.0012913021,0.00006926129,0.012909319,0.9837107,0.00002781605,0.0013138277],"study_design_scores_gemma":[0.00048997765,0.00029482367,0.0011596918,0.00014360296,0.000017588922,0.000020868489,0.0009868186,0.0052368143,0.15797079,0.83320457,0.00023998263,0.00023446357],"about_ca_topic_score_codex":0.0000035097023,"about_ca_topic_score_gemma":0.000018947878,"teacher_disagreement_score":0.44692734,"about_ca_system_score_codex":0.000010336178,"about_ca_system_score_gemma":0.000032287546,"threshold_uncertainty_score":0.3074475},"labels":[],"label_agreement":null},{"id":"W1997694836","doi":"10.1016/j.ejc.2014.04.009","title":"Connected obstructions to full graph homomorphisms","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Homomorphism; Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.015460049152079302,"score_gpt":0.24380856122834915,"score_spread":0.22834851207626986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997694836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09234514,0.00009301996,0.89755946,0.00081644655,0.0017078636,0.00008025463,9.393793e-7,0.000074078605,0.007322792],"genre_scores_gemma":[0.97711295,0.00001791143,0.022363616,0.00019133984,0.0001191086,6.805723e-7,3.099469e-7,0.000026407793,0.00016767187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974843,0.000919775,0.0004827631,0.00021043913,0.0005694463,0.00033323493],"domain_scores_gemma":[0.997673,0.00027335447,0.00029474383,0.00060532533,0.0007275773,0.0004260369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019463063,0.0001501137,0.000241178,0.0005226951,0.00019446833,0.00014961674,0.0018640549,0.00001915642,0.000012921029],"category_scores_gemma":[0.0006800478,0.00013599436,0.00013488867,0.001456676,0.000076736374,0.0004325597,0.00030267696,0.00044096628,0.00014020929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028034974,0.00009213223,0.00014175163,0.000005573914,0.00002685527,0.00016403668,0.00023865968,0.00043905585,0.0021341683,0.98223203,0.001728199,0.012769507],"study_design_scores_gemma":[0.002687115,0.003945054,0.009551243,0.0001013574,0.000023428738,0.00139828,0.00009307983,0.0011213276,0.0028297892,0.88344365,0.09420078,0.00060487626],"about_ca_topic_score_codex":2.0497708e-7,"about_ca_topic_score_gemma":1.5238112e-7,"teacher_disagreement_score":0.88476783,"about_ca_system_score_codex":0.000049306676,"about_ca_system_score_gemma":0.00004489774,"threshold_uncertainty_score":0.5545689},"labels":[],"label_agreement":null},{"id":"W1998044937","doi":"10.1016/s0012-365x(00)00181-3","title":"The ultimate categorical matching in a graph","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Categorical variable; Factor-critical graph; Matching (statistics); Graph; Edge-transitive graph; Discrete mathematics; Graph power; Line graph; Statistics","score_opus":0.02454482641561275,"score_gpt":0.3128628851969006,"score_spread":0.28831805878128786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998044937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041348044,0.00015386121,0.9501053,0.0011364691,0.00009067404,0.00025018712,7.8622173e-7,0.00013028694,0.006784399],"genre_scores_gemma":[0.9119507,0.00021028829,0.08697495,0.00008607619,0.000029848057,0.00007141516,0.0000013658004,0.000027326185,0.00064804236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984377,0.0000905804,0.00032082494,0.00024669865,0.000395631,0.000508559],"domain_scores_gemma":[0.99844337,0.00057266117,0.00007974659,0.0007780813,0.000040067243,0.000086087755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008903147,0.00014190147,0.00016635713,0.00011964486,0.00024912195,0.00025003916,0.0013364406,0.000040736777,0.0000062761947],"category_scores_gemma":[0.00013608614,0.00008968626,0.00007455536,0.00085277937,0.00011045394,0.00031396016,0.00034721583,0.00026082984,0.00008413543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055407536,0.000040912226,0.00016667192,0.000017053972,0.0000072277735,0.00006415063,0.002181434,0.0002183172,0.0001683155,0.9928528,0.000039309387,0.0042382427],"study_design_scores_gemma":[0.00016691368,0.00001899756,0.00022041668,0.00001922742,0.0000015362633,0.00006043461,0.00043441294,0.05560936,0.000114050796,0.9427343,0.00049066194,0.00012969573],"about_ca_topic_score_codex":0.000011652022,"about_ca_topic_score_gemma":0.000028878037,"teacher_disagreement_score":0.87060267,"about_ca_system_score_codex":0.000039587325,"about_ca_system_score_gemma":0.000023260967,"threshold_uncertainty_score":0.36572996},"labels":[],"label_agreement":null},{"id":"W1998140754","doi":"10.1016/s0012-365x(99)00206-x","title":"Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Combinatorics; Variable (mathematics); Combinatorial optimization; Discrete mathematics; Metaheuristic; Mathematical optimization","score_opus":0.024019720620125168,"score_gpt":0.28211261587146697,"score_spread":0.2580928952513418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998140754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031614304,0.00017569856,0.9618266,0.00037104866,0.00010948942,0.0010804283,0.000032039006,0.0003645863,0.032878637],"genre_scores_gemma":[0.55488867,0.000026752201,0.4406478,0.000119572665,0.000113206865,0.0005144434,0.000012521184,0.0000819279,0.0035950711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975475,0.00015232222,0.00041994252,0.00046941053,0.00065333256,0.0007574704],"domain_scores_gemma":[0.9972455,0.00080658274,0.00008498529,0.0015528465,0.0001539811,0.00015609687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014600336,0.00025262416,0.00030523166,0.0001652102,0.0005645817,0.0003816148,0.0022139745,0.00008488595,0.00011130527],"category_scores_gemma":[0.00005286067,0.00016417835,0.00022531235,0.0013006501,0.00020512842,0.00041145209,0.00021781406,0.00025043113,0.00009641088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012076766,0.000054186774,0.000028052207,0.00022239392,0.000047568246,0.0000060163525,0.0010756188,0.00028891274,0.00011616251,0.99317056,0.00016829166,0.004810176],"study_design_scores_gemma":[0.000512129,0.00014335498,0.000033886936,0.0001433954,0.000026233969,0.000107944565,0.00091296044,0.4229778,0.00058593496,0.57232445,0.0019014182,0.0003305121],"about_ca_topic_score_codex":0.0000055870437,"about_ca_topic_score_gemma":7.16173e-7,"teacher_disagreement_score":0.55172724,"about_ca_system_score_codex":0.00003796713,"about_ca_system_score_gemma":0.000070759255,"threshold_uncertainty_score":0.6694998},"labels":[],"label_agreement":null},{"id":"W1998427290","doi":"10.1016/s0304-3975(03)00221-4","title":"Generating and characterizing the perfect elimination orderings of a chordal graph","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Amortized analysis; Oracle; Initialization; Clique; Treewidth; Discrete mathematics; Constant (computer programming); Graph; Algorithm; Computer science; Data structure; Pathwidth; Line graph","score_opus":0.01231511195538729,"score_gpt":0.26704502216468384,"score_spread":0.25472991020929653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998427290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34638187,0.000041642335,0.65247077,0.0004105026,0.00011522541,0.00012009452,2.8744924e-7,0.000038217822,0.0004213918],"genre_scores_gemma":[0.8767375,0.000010746889,0.123010404,0.00019971766,0.000025469679,0.0000075960024,1.1661411e-7,0.000005481361,0.000003009578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979566,0.00026783734,0.00022917161,0.00050852186,0.00058875734,0.00044915365],"domain_scores_gemma":[0.9985512,0.00044272406,0.000081399325,0.0005870515,0.00020737493,0.00013027573],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0031582818,0.0001361889,0.00015576054,0.00019050237,0.00058481854,0.00028711508,0.0013198116,0.000028959437,0.000009465223],"category_scores_gemma":[0.00034138258,0.00009250257,0.00004220873,0.0013655225,0.0031316609,0.0006626013,0.0005971374,0.00020659219,0.000003126364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031379332,0.000015905905,0.00007931145,0.000007079125,0.0000021659148,0.0000017102968,0.00061551126,0.0000783773,0.03167571,0.94059753,8.488862e-7,0.0269227],"study_design_scores_gemma":[0.000285356,0.00035470165,0.0026761438,0.000041560597,0.0000045238794,0.00012102595,0.000038101698,0.5465344,0.085325845,0.36427066,0.000080911785,0.0002667593],"about_ca_topic_score_codex":0.0000011659914,"about_ca_topic_score_gemma":2.3394628e-7,"teacher_disagreement_score":0.5763269,"about_ca_system_score_codex":0.00001975128,"about_ca_system_score_gemma":0.000071512855,"threshold_uncertainty_score":0.9995812},"labels":[],"label_agreement":null},{"id":"W1999197342","doi":"10.4153/cjm-2011-084-9","title":"Uniquely <i>D</i>-colourable Digraphs with Large Girth","year":2011,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Girth (graph theory); Automorphism; Graph","score_opus":0.03200467889537613,"score_gpt":0.23513788894870047,"score_spread":0.20313321005332435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999197342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23793815,0.00045597774,0.7386999,0.00038585087,0.00023155239,0.00026580296,0.0000115024395,0.00004106572,0.02197017],"genre_scores_gemma":[0.7284286,0.000014278085,0.27105302,0.00015818079,0.0000107960395,0.0000026143944,1.8659757e-7,0.000019600355,0.00031274123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870825,0.000061094215,0.00032389714,0.00011947356,0.00028112868,0.00050616055],"domain_scores_gemma":[0.99807477,0.00009722894,0.0002666358,0.00044853784,0.0003650056,0.0007478024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000883077,0.0001295173,0.00023177684,0.00041886198,0.00015917337,0.00009178966,0.0012775366,0.000048072925,0.000081624996],"category_scores_gemma":[0.00012321993,0.000095637784,0.00007686641,0.0005813499,0.00012091468,0.00055484765,0.00003323389,0.00030553556,0.000020132056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000833257,0.00008831123,0.0046409317,0.000047608693,0.00006891833,0.00081062934,0.006483403,0.0000151636,0.000046839657,0.98613006,0.00088675326,0.0007730717],"study_design_scores_gemma":[0.0010445049,0.0009850636,0.0024281167,0.00032315345,0.000033061584,0.0020119394,0.001414942,0.0013245092,0.0032686398,0.97887796,0.007826931,0.00046115083],"about_ca_topic_score_codex":0.00015292519,"about_ca_topic_score_gemma":0.00586889,"teacher_disagreement_score":0.4904904,"about_ca_system_score_codex":0.00006449494,"about_ca_system_score_gemma":0.001003231,"threshold_uncertainty_score":0.38999957},"labels":[],"label_agreement":null},{"id":"W1999565878","doi":"10.1016/j.disc.2008.04.023","title":"Achieving maximum chromatic index in multigraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Multigraph; Upper and lower bounds; Edge coloring; Bipartite graph; Multiplicity (mathematics); Discrete mathematics; Graph","score_opus":0.02820827059957298,"score_gpt":0.28811301385298915,"score_spread":0.25990474325341617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999565878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39600492,0.00010830579,0.5996391,0.00015141885,0.000058035726,0.00030560777,0.0000016587054,0.00016563156,0.0035652916],"genre_scores_gemma":[0.8480744,0.000034470966,0.15159982,0.00005124379,0.00001426398,0.000037006586,0.0000013654424,0.00002157865,0.00016589893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811155,0.00009010346,0.00043206595,0.0003465322,0.0005115082,0.00050824194],"domain_scores_gemma":[0.998465,0.00030408404,0.00012100859,0.0009421138,0.000045177527,0.00012259735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047681908,0.00020361919,0.00030413468,0.0003700929,0.00015936336,0.00006646055,0.0012195739,0.0000697793,0.000020064439],"category_scores_gemma":[0.00023184413,0.00017676855,0.00010062854,0.0010089697,0.00017451134,0.0005334569,0.0003859409,0.00028799125,0.00009751691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004039513,0.0013077784,0.06383128,0.0013526386,0.00014073902,0.0013811587,0.058054686,0.002460833,0.008873716,0.8440486,0.0004376156,0.018070567],"study_design_scores_gemma":[0.0014336408,0.00012637278,0.03423311,0.00040645915,0.0000066503385,0.0003315636,0.0008109276,0.3896728,0.0016177549,0.570262,0.00022196204,0.000876741],"about_ca_topic_score_codex":0.000007988601,"about_ca_topic_score_gemma":0.00001005383,"teacher_disagreement_score":0.45206943,"about_ca_system_score_codex":0.000046697874,"about_ca_system_score_gemma":0.00004696561,"threshold_uncertainty_score":0.7208412},"labels":[],"label_agreement":null},{"id":"W1999576733","doi":"10.1007/s00453-007-9045-2","title":"Maximum Induced Matchings for Chordal Graphs in Linear Time","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Indifference graph; Split graph; Maximal independent set; Treewidth; Discrete mathematics; Pathwidth; Bipartite graph; Time complexity; Cograph; Line graph; Graph; 1-planar graph","score_opus":0.017835605613190888,"score_gpt":0.3055982628954908,"score_spread":0.28776265728229994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999576733","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12252527,0.000041263087,0.8748266,0.0006450799,0.00030021387,0.0005473312,0.0000063288862,0.00019154669,0.0009163785],"genre_scores_gemma":[0.3129738,0.0000061124106,0.68538046,0.0005472939,0.00019557404,0.0000749817,0.000011578941,0.00005217653,0.0007580553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981343,0.00004884093,0.00029605956,0.0004886855,0.00031816348,0.0007139097],"domain_scores_gemma":[0.9987393,0.0004153989,0.000062463725,0.0005304934,0.00009811141,0.00015422142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013841629,0.0001637388,0.00020358298,0.00043490593,0.000107283275,0.000052264295,0.0010854113,0.0001047718,0.0000136826775],"category_scores_gemma":[0.00010944105,0.00016230407,0.00009482504,0.0009591724,0.000060780247,0.00043198734,0.00025561976,0.00030876513,0.00012473264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018481504,0.00032724426,0.00034852212,0.000036365203,0.000046279638,0.00015914997,0.0013169303,0.000041650448,0.050476246,0.14893812,0.0006395783,0.7974851],"study_design_scores_gemma":[0.0018975115,0.0004255852,0.0022113847,0.000036062684,0.000004172838,0.000044621545,0.00005162132,0.061213233,0.04902981,0.87797993,0.006509786,0.00059628824],"about_ca_topic_score_codex":0.00002436645,"about_ca_topic_score_gemma":0.000009117981,"teacher_disagreement_score":0.7968888,"about_ca_system_score_codex":0.000058187685,"about_ca_system_score_gemma":0.000051692958,"threshold_uncertainty_score":0.66185683},"labels":[],"label_agreement":null},{"id":"W1999881617","doi":"10.1017/s0004972708000099","title":"OUTER AUTOMORPHISM GROUPS OF CERTAIN TREE PRODUCTS OF ABELIAN GROUPS","year":2008,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Abelian group; Tree (set theory); Automorphism; Non-abelian group; Rank of an abelian group; Inner automorphism; Elementary abelian group; Automorphism group; Pure mathematics; Combinatorics; Discrete mathematics","score_opus":0.03869099300674883,"score_gpt":0.2705307745244882,"score_spread":0.23183978151773937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999881617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8256052,0.00013910873,0.10231499,0.06367303,0.0004300417,0.002538269,0.00006711402,0.00028189932,0.0049503557],"genre_scores_gemma":[0.848074,0.000013880739,0.14507423,0.00010935922,0.000039840812,0.000019522551,0.0000011104809,0.00002349695,0.0066445475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973123,0.00020368949,0.00073989114,0.00039893217,0.0008807337,0.0004644327],"domain_scores_gemma":[0.9973739,0.0003663081,0.00041997578,0.0014439301,0.00027793477,0.0001179685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981706,0.0002286026,0.00054494943,0.000043990738,0.0001264651,0.000013338112,0.0021727828,0.00014042547,0.00023508849],"category_scores_gemma":[0.0004059496,0.00015766846,0.0005181993,0.00062602054,0.0012744804,0.00008194298,0.000637078,0.0003194819,0.000051808533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063068546,0.0020009042,0.0016937061,0.0025893678,0.00040906057,0.00001879765,0.010601545,0.000144226,0.045173224,0.8139928,0.121514454,0.0017988739],"study_design_scores_gemma":[0.0028724123,0.00077609683,0.019362649,0.0009876102,0.00011784297,0.00030825034,0.0010481069,0.0027510768,0.35636234,0.5997502,0.014551607,0.0011118036],"about_ca_topic_score_codex":0.000016886494,"about_ca_topic_score_gemma":3.3900187e-7,"teacher_disagreement_score":0.31118912,"about_ca_system_score_codex":0.000039022605,"about_ca_system_score_gemma":0.000067432884,"threshold_uncertainty_score":0.64295334},"labels":[],"label_agreement":null},{"id":"W2000105603","doi":"10.1007/s00373-010-0940-y","title":"König–Egerváry Graphs are Non-Edmonds","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Combinatorics; Mathematics; Mathematical proof; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.01007385019446178,"score_gpt":0.24956467204907634,"score_spread":0.23949082185461457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000105603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97617984,0.0005846671,0.0144709805,0.0006223679,0.001997449,0.00030812682,0.000007211917,0.00039297107,0.005436368],"genre_scores_gemma":[0.9969761,0.00019772966,0.002208728,0.00018017292,0.000015939851,0.00003358399,0.0000019861368,0.000021822512,0.00036395123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979739,0.00005417792,0.00023450163,0.0006029938,0.00048544555,0.00064897456],"domain_scores_gemma":[0.99811137,0.00014780513,0.000114252056,0.0010410473,0.00020759844,0.0003779486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005422601,0.0002518367,0.0002693611,0.00042075786,0.00041927077,0.00023533835,0.0012448276,0.00016520714,0.000011785637],"category_scores_gemma":[0.00006326974,0.0002336413,0.00013053176,0.0016865765,0.0002520982,0.00055768975,0.0005047957,0.0007429383,0.000022742508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000589958,0.00010367595,0.020149339,0.000019516061,0.0000150282485,0.000040016585,0.00014955367,8.748804e-7,0.0017649289,0.9716237,0.00063652126,0.005490934],"study_design_scores_gemma":[0.00054668804,0.00012685212,0.019436123,0.000011928484,0.0000053927647,0.000031769523,0.000054045984,0.0010600388,0.001705651,0.9734939,0.0032038193,0.00032384257],"about_ca_topic_score_codex":0.000012228979,"about_ca_topic_score_gemma":0.000012725004,"teacher_disagreement_score":0.020796226,"about_ca_system_score_codex":0.00001197685,"about_ca_system_score_gemma":0.00004910055,"threshold_uncertainty_score":0.9527616},"labels":[],"label_agreement":null},{"id":"W2000356104","doi":"10.1016/j.aml.2007.02.004","title":"Maximum fractional factors in graphs","year":2007,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.021361806272424247,"score_gpt":0.27780491159254783,"score_spread":0.2564431053201236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000356104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25194553,0.000004390893,0.7423938,0.00037750613,0.00008008227,0.00019188311,6.527127e-7,0.00010318767,0.004902951],"genre_scores_gemma":[0.74793416,0.0000021836256,0.25117418,0.00080190453,0.000020656464,0.000020405927,0.0000025517018,0.000019863724,0.000024090696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983702,0.000011561245,0.00030976845,0.00031766552,0.0004877828,0.0005030377],"domain_scores_gemma":[0.998665,0.0005938941,0.00009161474,0.00052748574,0.000020295027,0.00010172438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007990306,0.00016314385,0.00017949927,0.00043298703,0.00008053433,0.00005850891,0.000770196,0.000057318768,0.000022341494],"category_scores_gemma":[0.00003431724,0.00015129488,0.000059182985,0.0007505889,0.000095473755,0.00022883457,0.00016610653,0.00030240868,0.00008489966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069590037,0.00011794171,0.00060097716,0.000028360242,0.000013140922,0.000029281931,0.0010844965,0.00014099789,0.046548553,0.94913906,0.00029400905,0.0019962485],"study_design_scores_gemma":[0.00047486607,0.000015641324,0.0039142263,0.000017827686,0.000002803056,0.000013108247,0.00033934478,0.0008561325,0.025895782,0.9674202,0.00069619366,0.00035387793],"about_ca_topic_score_codex":0.000004602833,"about_ca_topic_score_gemma":0.000008888396,"teacher_disagreement_score":0.49598864,"about_ca_system_score_codex":0.00007215613,"about_ca_system_score_gemma":0.0000151731665,"threshold_uncertainty_score":0.6169626},"labels":[],"label_agreement":null},{"id":"W2000440641","doi":"10.1016/j.disc.2003.10.024","title":"Absorbing sets in arc-coloured tournaments","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Université de Montréal","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Monochromatic color; Combinatorics; Arc (geometry); Path (computing); Section (typography); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.027925092144595185,"score_gpt":0.3189830667795664,"score_spread":0.2910579746349712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000440641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2749332,0.000103176746,0.7182346,0.00083422894,0.000115043316,0.0003748453,0.0000029786688,0.00014038158,0.0052615716],"genre_scores_gemma":[0.8219398,0.00002397538,0.17775615,0.0000932851,0.000012097808,0.000026705142,0.0000014850218,0.000018246461,0.00012826102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985004,0.000041574087,0.00032101513,0.0002723089,0.00042293957,0.00044175412],"domain_scores_gemma":[0.9990375,0.00010368661,0.00009799697,0.00061409874,0.00003856381,0.00010814119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005027143,0.00014773889,0.00020347153,0.00020073607,0.00008344129,0.00012901002,0.0009664493,0.00005093571,0.000013366533],"category_scores_gemma":[0.00014731855,0.00012939995,0.000063258776,0.00054111873,0.00005910769,0.00040531644,0.0003264951,0.00023089138,0.00011170562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008135573,0.00023496614,0.00031410198,0.00010549683,0.0000234631,0.00018630043,0.009709011,0.0021332537,0.0023145992,0.98168373,0.00004526462,0.0032416726],"study_design_scores_gemma":[0.0007671693,0.000054188647,0.00044015155,0.00016724829,0.0000023171299,0.000029215746,0.00033055103,0.011370585,0.0031507507,0.98339385,0.0000861449,0.00020783897],"about_ca_topic_score_codex":0.000006719335,"about_ca_topic_score_gemma":0.000013240072,"teacher_disagreement_score":0.5470066,"about_ca_system_score_codex":0.00012795285,"about_ca_system_score_gemma":0.000054112064,"threshold_uncertainty_score":0.5276777},"labels":[],"label_agreement":null},{"id":"W2000945011","doi":"10.1016/j.jcss.2007.01.003","title":"Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Treewidth; Bounded function; Combinatorics; Mathematics; Induced subgraph isomorphism problem; Isomorphism (crystallography); Discrete mathematics; Subgraph isomorphism problem; Graph; Pathwidth; Line graph; Chemistry","score_opus":0.020491964852345043,"score_gpt":0.29002053605459854,"score_spread":0.2695285712022535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000945011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4389847,0.00089215004,0.5592711,0.00013195537,0.00035296413,0.000089308436,6.481012e-7,0.000013964854,0.00026324787],"genre_scores_gemma":[0.91365546,0.000067187386,0.08612991,0.00006818698,0.0000626917,6.386109e-7,1.060673e-7,0.0000039780716,0.000011829571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975264,0.00018827642,0.00077038363,0.00029147704,0.0008870639,0.00033636647],"domain_scores_gemma":[0.9981651,0.00045422354,0.00056926237,0.00020415969,0.0003808286,0.0002264465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004201663,0.00015097583,0.0003944148,0.00080616854,0.0003264452,0.0003066501,0.0008947406,0.000052501106,0.0000016025335],"category_scores_gemma":[0.00001831257,0.00010974631,0.00009883197,0.0011062905,0.0008233308,0.0010139482,0.0001758542,0.00015606043,5.843125e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012029086,0.00013940007,0.040316258,0.00022874521,0.00011508831,0.0001505544,0.0032961986,0.00024916482,0.002061164,0.89716345,0.00022461194,0.05593508],"study_design_scores_gemma":[0.0090161385,0.010701964,0.239212,0.0020814969,0.00011413143,0.009424979,0.006723293,0.11081378,0.011590771,0.5973098,0.001363151,0.0016484649],"about_ca_topic_score_codex":0.000013141865,"about_ca_topic_score_gemma":0.0000107420165,"teacher_disagreement_score":0.4746708,"about_ca_system_score_codex":0.000028107583,"about_ca_system_score_gemma":0.00012371303,"threshold_uncertainty_score":0.44753247},"labels":[],"label_agreement":null},{"id":"W2001146041","doi":"10.1016/j.jda.2013.08.002","title":"Acyclic coloring with few division vertices","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Wheel graph; Subdivision; Path graph; Complete coloring; Discrete mathematics; Graph; Graph power; Line graph","score_opus":0.01441011631649932,"score_gpt":0.27871174020359285,"score_spread":0.26430162388709355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001146041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2863914,0.00053367583,0.7105642,0.0013538484,0.00026835361,0.00018177181,7.951908e-7,0.000037723235,0.0006682464],"genre_scores_gemma":[0.8705376,0.000086423584,0.12898232,0.00008024536,0.00011688385,0.0000073231404,2.5645065e-7,0.00001510905,0.0001738799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821454,0.00010498293,0.00035114677,0.0002000038,0.0007547794,0.00037455955],"domain_scores_gemma":[0.9985406,0.00020740982,0.00029386525,0.0003689838,0.00033555622,0.00025361916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047647124,0.0001428996,0.0002447923,0.00022238861,0.00014018673,0.00029411053,0.0012110717,0.000039001417,0.000038185164],"category_scores_gemma":[0.0000770127,0.00009031001,0.00009583266,0.0005238179,0.000097905104,0.0026583828,0.00025446323,0.00035499694,0.000053907934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002189732,0.00042579474,0.014573661,0.00010609252,0.0005649693,0.0007244503,0.0035076393,0.0041082497,0.025900396,0.022185668,0.0015505693,0.9261335],"study_design_scores_gemma":[0.012132154,0.015825514,0.2535386,0.001932314,0.00016451023,0.0024239414,0.0024775157,0.34832168,0.075367905,0.26764822,0.017218003,0.0029496185],"about_ca_topic_score_codex":0.000015119623,"about_ca_topic_score_gemma":0.000001502383,"teacher_disagreement_score":0.9231839,"about_ca_system_score_codex":0.00004991415,"about_ca_system_score_gemma":0.000059157923,"threshold_uncertainty_score":0.36827353},"labels":[],"label_agreement":null},{"id":"W2001490112","doi":"10.1007/s10479-010-0813-z","title":"Using size for bounding expressions of graph invariants","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Bounding overwatch; Vertex (graph theory); Graph; Theory of computation; Upper and lower bounds; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.41827483331012116,"score_gpt":0.5393114654582573,"score_spread":0.12103663214813609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001490112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6195061,0.00007741426,0.37682724,0.0018009659,0.00015623657,0.0007328679,0.000040280967,0.00002377728,0.0008350998],"genre_scores_gemma":[0.824229,0.00003134038,0.17537324,0.000023847711,0.000037993097,0.000065158136,0.000002029116,0.000010884197,0.00022651996],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978316,0.00028057437,0.0003514289,0.00032141068,0.00070897036,0.00050603715],"domain_scores_gemma":[0.9952387,0.0014858539,0.00004155817,0.0008981952,0.002183466,0.00015220344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035366304,0.00008813807,0.00018830679,0.0006133108,0.0006623736,0.00014200083,0.0013342028,0.000080249585,0.00006140238],"category_scores_gemma":[0.0040844013,0.00007997143,0.0000973805,0.0014794458,0.00045443626,0.00090169656,0.00046545416,0.00042031083,0.0000041364065],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016812115,0.00009853287,0.00010081283,0.000021784317,0.000013274647,9.557906e-7,0.00038229994,0.0009587123,0.63688684,0.36031854,0.00017858738,0.0010228523],"study_design_scores_gemma":[0.00043347655,0.0002728823,0.0007098306,0.00009239261,0.0000022964102,0.0000075488615,0.0002532617,0.07859649,0.73775,0.1809734,0.00073581847,0.00017262707],"about_ca_topic_score_codex":0.00009838289,"about_ca_topic_score_gemma":0.00008380177,"teacher_disagreement_score":0.20472287,"about_ca_system_score_codex":0.0000067427286,"about_ca_system_score_gemma":0.00040443472,"threshold_uncertainty_score":0.5094509},"labels":[],"label_agreement":null},{"id":"W2001998099","doi":"10.7151/dmgt.1377","title":"Couterexample to a conjecture on the structure of bipartite partionable graphs","year":2007,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Cartesian product; Conjecture; Disjoint sets; Partition (number theory); Counterexample; Discrete mathematics; Vertex (graph theory); Graph; Edge-transitive graph; Graph power; Line graph","score_opus":0.021057523586209024,"score_gpt":0.28829805335352093,"score_spread":0.2672405297673119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001998099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33907267,0.00008768369,0.655762,0.00212484,0.00021027871,0.00095402455,0.000040027204,0.00018130562,0.0015671639],"genre_scores_gemma":[0.9871823,0.0000047061726,0.011817923,0.0005891005,0.000025958805,0.00002698641,0.000003778855,0.000029102446,0.00032010267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712384,0.00035593903,0.00053802936,0.0005217687,0.000806403,0.00065404555],"domain_scores_gemma":[0.9956585,0.0020302988,0.00021107345,0.00170291,0.00014724971,0.00024994463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023602326,0.00030417956,0.00036928532,0.00049388886,0.00035694975,0.0000813477,0.0017044599,0.0001002728,0.0002790161],"category_scores_gemma":[0.00054898503,0.00014828761,0.00022610952,0.0018516723,0.00035937264,0.00024170172,0.0003777152,0.00031706906,0.000071701186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000966792,0.00012317226,0.00009314116,0.000047518723,0.000046323068,0.0000066166026,0.0023232554,0.000083189996,0.014805355,0.97959197,0.0003986306,0.002384181],"study_design_scores_gemma":[0.00019122349,0.0001480584,0.00068095146,0.00012777935,0.00000993797,0.00001317062,0.0005856932,0.00009659906,0.053396374,0.94403934,0.00049808156,0.0002127644],"about_ca_topic_score_codex":0.0000016659801,"about_ca_topic_score_gemma":0.000007830316,"teacher_disagreement_score":0.6481097,"about_ca_system_score_codex":0.000020359388,"about_ca_system_score_gemma":0.00003707938,"threshold_uncertainty_score":0.6046993},"labels":[],"label_agreement":null},{"id":"W2002026379","doi":"10.1006/jctb.2002.2112","title":"The Quadrangulation Conjecture for Orientable Surfaces","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bijection, injection and surjection; Bijection; Combinatorics; Mathematics; Conjecture; Bipartite graph; Planar; Integer (computer science); Genus; Graph","score_opus":0.016320060838556773,"score_gpt":0.26806094596182506,"score_spread":0.2517408851232683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002026379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17375782,0.011761268,0.7501391,0.010699966,0.04496342,0.0017235941,0.00001601597,0.00022348897,0.006715314],"genre_scores_gemma":[0.9931084,0.00018015859,0.0044511594,0.000047549067,0.00055041193,0.0000093989465,3.9986085e-7,0.000016583808,0.0016359537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983482,0.00035739705,0.0003991732,0.00013496954,0.00045235563,0.00030791096],"domain_scores_gemma":[0.997012,0.0016579422,0.00037520996,0.0003710126,0.00048791114,0.000095916876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023439399,0.00012699861,0.00021983747,0.00008432369,0.0005544265,0.0002707956,0.001126013,0.00006581424,0.000029477316],"category_scores_gemma":[0.0007250164,0.000080939426,0.00015203412,0.00036254327,0.00019755673,0.0012419522,0.00009686128,0.00024277915,0.0000049317086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037738367,0.000039631468,0.000026116062,0.000006112676,0.00004088167,0.000004967357,0.0005193719,0.00016647167,0.00059682695,0.99131036,0.0011311695,0.0057807188],"study_design_scores_gemma":[0.0009604991,0.00064530264,0.000035864403,0.0000120475415,0.000007715546,0.00005557567,0.00017611889,0.0006054607,0.0034847904,0.9097025,0.08421938,0.00009477056],"about_ca_topic_score_codex":4.5272304e-7,"about_ca_topic_score_gemma":7.00274e-7,"teacher_disagreement_score":0.81935054,"about_ca_system_score_codex":0.000054102326,"about_ca_system_score_gemma":0.000048312904,"threshold_uncertainty_score":0.42642567},"labels":[],"label_agreement":null},{"id":"W2003347187","doi":"10.1155/2008/597408","title":"Bipartite Toughness and <i>k</i>‐Factors in Bipartite Graphs","year":2008,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Algorithm; Bipartite graph; Artificial intelligence; Computer science; Mathematics; Graph; Combinatorics","score_opus":0.04947404051399971,"score_gpt":0.33014125648272574,"score_spread":0.280667215968726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003347187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9174107,0.0002320916,0.08041975,0.00087792217,0.00013474828,0.0000720078,0.0000010885495,0.000011850631,0.0008398911],"genre_scores_gemma":[0.9097968,0.00036347826,0.08973205,0.000054965396,0.000022210948,0.0000023716161,7.886436e-8,0.000004504787,0.00002354702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982104,0.00004113171,0.00052178506,0.00017637924,0.0008308024,0.00021955911],"domain_scores_gemma":[0.9986039,0.00072219345,0.00023779659,0.00011773351,0.00017259807,0.00014580453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012720107,0.0001180186,0.000256572,0.00038511227,0.00011275439,0.00015984524,0.0008947899,0.00003588348,0.0000201916],"category_scores_gemma":[0.00047612228,0.00007841667,0.000057064044,0.00038624366,0.00058705255,0.0008266828,0.0002650821,0.00015411778,0.00000358118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006223471,0.00025369538,0.0061750044,0.00003761348,0.000027137005,0.000115781266,0.0039503737,0.000029276616,0.0016358554,0.9861462,0.00003297362,0.0015898341],"study_design_scores_gemma":[0.0004250969,0.00016135283,0.0018942215,0.00020356555,0.00000453226,0.0011125151,0.00055332883,0.017067455,0.0037857797,0.9745027,0.00013549038,0.0001539898],"about_ca_topic_score_codex":0.000002654907,"about_ca_topic_score_gemma":0.0000029197174,"teacher_disagreement_score":0.017038178,"about_ca_system_score_codex":0.000017247054,"about_ca_system_score_gemma":0.000057202247,"threshold_uncertainty_score":0.31977388},"labels":[],"label_agreement":null},{"id":"W200335736","doi":"","title":"A family of chromatically unique 5-bridge graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bridge (graph theory); Biology; Anatomy","score_opus":0.026595281798719724,"score_gpt":0.27698040310182404,"score_spread":0.2503851213031043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W200335736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97302735,0.00016566843,0.020687804,0.00015427808,0.00043384524,0.00023185831,0.000002275533,0.00018222783,0.005114701],"genre_scores_gemma":[0.98846734,0.00006831743,0.011222034,0.000103556566,0.0000020664054,0.000019647507,0.0000012037887,0.000014383993,0.00010148249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829876,0.00016675805,0.00031080397,0.0003356204,0.0005109218,0.00037713812],"domain_scores_gemma":[0.99831265,0.0002620713,0.0000975221,0.0009490504,0.00022234223,0.00015633603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039480373,0.00014917247,0.00026544905,0.0002133446,0.00013619587,0.000019579158,0.0013660162,0.00007084858,0.000007697354],"category_scores_gemma":[0.0001378876,0.0001439605,0.00010819893,0.0010967146,0.00032240848,0.00039695503,0.00035793585,0.0002100649,0.00004814598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008508306,0.00012988572,0.0021382507,0.000015646214,0.000017361923,0.000058796017,0.00026098255,0.000004025017,0.0053360118,0.9906881,0.00063764595,0.00070477906],"study_design_scores_gemma":[0.000535365,0.00021299931,0.045140274,0.000021668253,0.000002078546,0.000037210946,0.000005657725,0.00071092724,0.008040773,0.9449139,0.00022047448,0.00015862053],"about_ca_topic_score_codex":0.00002239022,"about_ca_topic_score_gemma":7.094155e-7,"teacher_disagreement_score":0.045774158,"about_ca_system_score_codex":0.000032640055,"about_ca_system_score_gemma":0.00014657286,"threshold_uncertainty_score":0.58705384},"labels":[],"label_agreement":null},{"id":"W2004476852","doi":"10.1016/j.dam.2012.03.019","title":"Hardness results on the gapped consecutive-ones property problem","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Logical matrix; Time complexity; Algebraic number; Binary number; Integer (computer science); Polynomial; Discrete mathematics; Computational complexity theory; Algebraic combinatorics; Computer science; Algorithm; Arithmetic","score_opus":0.048037758935888325,"score_gpt":0.2913822552962249,"score_spread":0.2433444963603366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004476852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011657199,0.00008186689,0.6123472,0.003916408,0.00026127943,0.0031206745,0.000040516188,0.000594664,0.3679802],"genre_scores_gemma":[0.8525027,0.000016861972,0.14389521,0.00046776186,0.000100464786,0.00052229397,0.000008437358,0.000051620962,0.002434635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977544,0.00009114093,0.00041366476,0.00037789092,0.0006393116,0.0007236017],"domain_scores_gemma":[0.99745846,0.0007054111,0.00020494865,0.0013744436,0.000083399325,0.00017335433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015557348,0.00027236284,0.00028873404,0.00008653094,0.0003402486,0.00016711673,0.0014295721,0.0000743463,0.000015464731],"category_scores_gemma":[0.00019744011,0.00013102886,0.000080191,0.00050636684,0.0002775592,0.0002832954,0.0005018891,0.00033016648,0.0005000089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049146336,0.00015852907,0.0000068558197,0.00006388755,0.000030072515,0.0000013137616,0.004899365,0.000013140628,0.0025388817,0.9886232,0.0022078298,0.0014078023],"study_design_scores_gemma":[0.0017177197,0.00020514327,0.00015859904,0.00025882642,0.000038527378,0.000048694757,0.0036435747,0.00944012,0.053521432,0.89906216,0.030761091,0.0011441052],"about_ca_topic_score_codex":0.000002038705,"about_ca_topic_score_gemma":9.463557e-7,"teacher_disagreement_score":0.8408455,"about_ca_system_score_codex":0.00003969372,"about_ca_system_score_gemma":0.00004887674,"threshold_uncertainty_score":0.64267695},"labels":[],"label_agreement":null},{"id":"W2004536047","doi":"10.5555/365411.365806","title":"On universally easy classes for NP-complete problems","year":2001,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Time complexity; NP-complete; Computer science; P versus NP problem; Mathematics; Polynomial; Regular language; Discrete mathematics; Theoretical computer science; Combinatorics; Automaton","score_opus":0.05071034637469949,"score_gpt":0.3023161627498708,"score_spread":0.25160581637517127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004536047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026267807,0.000015775935,0.9543275,0.0017895391,0.000089883535,0.00037612746,0.000002530478,0.00023831642,0.040533546],"genre_scores_gemma":[0.6731101,0.000055655255,0.26157522,0.0032141074,0.00012537949,0.00013775518,0.000009048108,0.000054092652,0.061718598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998843,0.000046247387,0.000110202694,0.00036553538,0.00024590743,0.00038910809],"domain_scores_gemma":[0.99881774,0.00041590614,0.00003236091,0.00051269867,0.00011796409,0.0001033359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023854362,0.000106560896,0.00010650215,0.00015215464,0.00013809734,0.0000878081,0.00096878945,0.00003349582,0.000054593347],"category_scores_gemma":[0.000062632695,0.000089172405,0.00006498782,0.00044433022,0.000059554935,0.00040640685,0.00014845101,0.000095523,0.00013255684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030045085,0.000044414755,0.00011911503,0.000006680966,0.000008578655,0.000008260245,0.000039068702,0.00082084077,0.0010628736,0.9891721,0.0021659422,0.0065220757],"study_design_scores_gemma":[0.0008009513,0.0005938675,0.0003269022,0.0000124627995,0.000001796675,0.00001883439,0.000017479733,0.032921437,0.00063986843,0.6722729,0.29215252,0.00024096764],"about_ca_topic_score_codex":0.0000067518413,"about_ca_topic_score_gemma":0.0000396153,"teacher_disagreement_score":0.6927523,"about_ca_system_score_codex":0.000040691695,"about_ca_system_score_gemma":0.000044671688,"threshold_uncertainty_score":0.3636345},"labels":[],"label_agreement":null},{"id":"W2004911149","doi":"10.1016/j.disc.2006.03.036","title":"Building blocks for the variety of absolute retracts","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"","keywords":"Mathematics; Variety (cybernetics); Absolute (philosophy); Combinatorics; Discrete mathematics; Statistics","score_opus":0.023892377948431385,"score_gpt":0.30585175003877385,"score_spread":0.28195937209034244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004911149","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065263417,0.0001359901,0.9904396,0.00036390725,0.0000642305,0.00037929762,0.00001006743,0.00006934023,0.0020112102],"genre_scores_gemma":[0.40179035,0.0000064342066,0.5974627,0.000026196632,0.000052301548,0.00003680599,0.000001188319,0.000015753647,0.0006082639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988016,0.000022565637,0.00032406548,0.00019876889,0.00034492408,0.0003081058],"domain_scores_gemma":[0.99772066,0.0011417724,0.00017969204,0.00079424656,0.00012698228,0.00003666244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000827941,0.000117393014,0.00018354299,0.000056603312,0.0001664226,0.00008169428,0.0011037502,0.000048402042,0.000005322347],"category_scores_gemma":[0.00020947463,0.00007693495,0.00012747574,0.00034106328,0.00012836719,0.0001840829,0.00022946791,0.00012452573,0.000003284091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039066726,0.000037833233,0.000011272491,0.00007375646,0.000018333534,9.760223e-7,0.00029745913,0.0006280504,0.0025078622,0.99488246,0.0005635773,0.000974512],"study_design_scores_gemma":[0.00016992954,0.000038472353,0.00012701999,0.00003443954,0.000012103161,0.0000067865285,0.000047218553,0.23859733,0.007696685,0.7514897,0.0016759811,0.00010435057],"about_ca_topic_score_codex":0.0000093765075,"about_ca_topic_score_gemma":0.0000031281445,"teacher_disagreement_score":0.39526403,"about_ca_system_score_codex":0.0000171443,"about_ca_system_score_gemma":0.000029236666,"threshold_uncertainty_score":0.3137316},"labels":[],"label_agreement":null},{"id":"W2005110454","doi":"10.1016/j.dam.2011.04.006","title":"The<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-extended graft construction","year":2011,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Homomorphism; Digraph; Enumeration; Bipartite graph; Algorithm; Mathematics; Combinatorics; Computer science; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.022255737254391842,"score_gpt":0.25491510821285335,"score_spread":0.2326593709584615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005110454","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32756528,0.00087531435,0.02466722,0.0004773941,0.002592558,0.00012474642,0.0002546439,0.00039910807,0.64304376],"genre_scores_gemma":[0.9648726,0.0010774991,0.029051242,0.00072373415,0.0012062873,0.0015065906,0.00044161247,0.00075841165,0.00036203585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9889569,0.00039909518,0.0022589613,0.0020980723,0.0032696952,0.0030172432],"domain_scores_gemma":[0.98979986,0.0022312712,0.002454146,0.0040476047,0.00024274016,0.0012243928],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.002978588,0.0010569434,0.0004501399,0.0005600839,0.0023973756,0.0019149451,0.004041435,0.0018769464,0.15298776],"category_scores_gemma":[0.0013609513,0.0017496645,0.0016524193,0.0016480859,0.0033511263,0.001607674,0.0033517245,0.0020713508,0.0030295753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010898503,0.00034483892,0.000008620899,0.0013556419,0.0012545112,0.00061907637,0.004338073,0.00054031104,0.0029455337,0.9309503,0.05212178,0.0044314987],"study_design_scores_gemma":[0.0018938249,0.0011597539,0.00006359947,0.0009227402,0.0009410786,0.0013220096,0.003965656,0.103080675,0.8724721,0.011024742,0.0013556927,0.0017981442],"about_ca_topic_score_codex":0.00037358422,"about_ca_topic_score_gemma":0.00052718085,"teacher_disagreement_score":0.9199255,"about_ca_system_score_codex":0.000023265724,"about_ca_system_score_gemma":0.0013379392,"threshold_uncertainty_score":0.99941885},"labels":[],"label_agreement":null},{"id":"W2005291561","doi":"10.1016/j.disc.2008.05.050","title":"Secure domination critical graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Dominating set; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.029806303907930015,"score_gpt":0.3212700661383915,"score_spread":0.29146376223046144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005291561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020839904,0.000080452606,0.96909285,0.00072738103,0.000108524466,0.00016334133,0.0000040314085,0.00019459268,0.008788941],"genre_scores_gemma":[0.7204649,0.000024445437,0.27902156,0.000078815065,0.000023751329,0.000023980356,0.0000024506148,0.000015273543,0.0003448471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862635,0.000062680985,0.00023228982,0.00026135953,0.00048902154,0.00032828632],"domain_scores_gemma":[0.998629,0.0004231624,0.000049608,0.0006418271,0.00013359268,0.00012286377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031011435,0.0001322266,0.000166474,0.00014113646,0.00024092216,0.00006689686,0.00076223386,0.00005735777,0.0000326986],"category_scores_gemma":[0.0004783516,0.00011151644,0.0000906266,0.00048971537,0.000249437,0.00050692324,0.00022071158,0.00017538114,0.00013689742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019072462,0.00005343241,0.000038673734,0.000042007123,0.000006075523,0.000040305153,0.0019575949,0.000007916792,0.0003538138,0.9966126,0.00028974825,0.0005959342],"study_design_scores_gemma":[0.00018712855,0.00005602332,0.00014700479,0.000028146465,0.000003898586,0.00014942703,0.00013334883,0.03777669,0.002299034,0.9586275,0.0004040564,0.00018771659],"about_ca_topic_score_codex":6.5644485e-7,"about_ca_topic_score_gemma":5.492887e-7,"teacher_disagreement_score":0.69962496,"about_ca_system_score_codex":0.000021392552,"about_ca_system_score_gemma":0.000032119784,"threshold_uncertainty_score":0.45475087},"labels":[],"label_agreement":null},{"id":"W2005353392","doi":"10.1016/j.comgeo.2008.11.004","title":"Not being (super)thin or solid is hard: A study of grid Hamiltonicity","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Shahrekord University of Medical Sciences; Academy of Finland; National Science Foundation","keywords":"Hamiltonian path; Combinatorics; Bipartite graph; Mathematics; Planar graph; Hamiltonian (control theory); Hamiltonian path problem; Grid; Discrete mathematics; Regular polygon; Square tiling; Graph; Mathematical optimization; Geometry","score_opus":0.060117465416775547,"score_gpt":0.336238186652695,"score_spread":0.27612072123591946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005353392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7078462,0.000039708357,0.2911632,0.00013410771,0.0001957099,0.0002605501,0.000013302132,0.00008883811,0.00025838235],"genre_scores_gemma":[0.95121294,0.000007926496,0.04765898,0.0003283748,0.00007356954,0.000018006165,0.00000623571,0.000015423095,0.0006785391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972449,0.00016446137,0.00046929842,0.0005879225,0.0011552878,0.00037813894],"domain_scores_gemma":[0.9979032,0.00080223044,0.00013787656,0.0005707148,0.00044260806,0.00014337184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053208903,0.00019046065,0.00033800528,0.00061652355,0.00036256027,0.000050518054,0.001182415,0.000057884932,0.00011509608],"category_scores_gemma":[0.00025433637,0.00017148507,0.00010014903,0.0019689964,0.00017915001,0.00053710653,0.00064100453,0.0002986452,0.000076836775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010572262,0.008970464,0.13041799,0.00031843985,0.0010750918,0.0009740732,0.046270143,0.67142195,0.0031114344,0.10120854,0.011757335,0.023417333],"study_design_scores_gemma":[0.0047316146,0.0028069606,0.4242566,0.00008188199,0.000024001287,0.0004019928,0.00079603825,0.47320536,0.00669578,0.08510584,0.0008757588,0.0010181627],"about_ca_topic_score_codex":0.000023296923,"about_ca_topic_score_gemma":0.000002895152,"teacher_disagreement_score":0.29383862,"about_ca_system_score_codex":0.000062487874,"about_ca_system_score_gemma":0.00023312002,"threshold_uncertainty_score":0.69929576},"labels":[],"label_agreement":null},{"id":"W2005620597","doi":"10.1016/j.disc.2006.09.042","title":"Reachability problems in edge-colored digraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Reachability; Tournament; Vertex (graph theory); Colored; Monochromatic color; Discrete mathematics; Arc (geometry); Graph; Geometry; Physics","score_opus":0.02504517896934749,"score_gpt":0.3048842009482493,"score_spread":0.2798390219789018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005620597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13971218,0.00008392413,0.8449051,0.00019526287,0.00008857245,0.0006212532,0.0000026317084,0.00019186149,0.0141992],"genre_scores_gemma":[0.8539986,0.000009129306,0.14558464,0.000042214546,0.00001932238,0.00004059157,0.0000026482319,0.000019706664,0.0002831542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979281,0.00007215801,0.0005124563,0.0004121757,0.00045998348,0.00061513326],"domain_scores_gemma":[0.9980828,0.0005161921,0.00011655432,0.0010603055,0.00007968734,0.00014443006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026344361,0.00017981217,0.00026174798,0.00028882688,0.000079383164,0.000086675886,0.0011388579,0.000082645995,0.000011202662],"category_scores_gemma":[0.0003601623,0.00015096288,0.00009570644,0.0011463452,0.00018098722,0.00040445582,0.00036044949,0.00028391444,0.000045939112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013831228,0.00038918637,0.0063929856,0.00027557433,0.000017813638,0.000036317255,0.009625424,0.00012373283,0.0024564406,0.96662474,0.0000533484,0.013990593],"study_design_scores_gemma":[0.0004227529,0.000102479265,0.005745916,0.000087365996,0.0000029021771,0.000014043078,0.00042542507,0.014752449,0.0026387195,0.97502047,0.00048866996,0.00029880577],"about_ca_topic_score_codex":0.000012167793,"about_ca_topic_score_gemma":0.0000918885,"teacher_disagreement_score":0.7142864,"about_ca_system_score_codex":0.000073122734,"about_ca_system_score_gemma":0.000033967033,"threshold_uncertainty_score":0.61560875},"labels":[],"label_agreement":null},{"id":"W2005661925","doi":"10.1016/j.jctb.2015.02.004","title":"Projective geometries in exponentially dense matroids. II","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Rank (graph theory); Combinatorics; Graphic matroid; Mathematics; Integer (computer science); Constant (computer programming); Prime (order theory); Prime power; Projective plane; Matroid partitioning; Discrete mathematics; Computer science; Geometry","score_opus":0.023206630527263093,"score_gpt":0.28658820357473674,"score_spread":0.26338157304747367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005661925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9005606,0.0015013148,0.079974495,0.0010393109,0.011918102,0.00050796225,0.0000035240796,0.000101067875,0.0043936265],"genre_scores_gemma":[0.992786,0.000049467246,0.00627153,0.000041589785,0.0003825853,0.000008039197,3.6670002e-7,0.000020042922,0.00044039602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970539,0.00069164747,0.0006496622,0.0002333736,0.00093799963,0.00043342193],"domain_scores_gemma":[0.9974757,0.00041997113,0.0004444829,0.0004471115,0.00094911753,0.00026362768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049606794,0.00020233872,0.00045763704,0.00087824697,0.00014503166,0.0001685704,0.0015059971,0.000101703765,0.000015360609],"category_scores_gemma":[0.0020577384,0.00017234343,0.00014304643,0.0014772092,0.00027552972,0.0027007735,0.00062545977,0.0005604194,0.000009398853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024861917,0.00023083077,0.00031195633,0.00000829287,0.000048945978,0.0002512101,0.0035739923,0.00008811571,0.0009546063,0.9895503,0.0003426304,0.0021529242],"study_design_scores_gemma":[0.0023910198,0.002167312,0.00019712413,0.0000413419,0.000006810186,0.00028149073,0.0010472353,0.00001915636,0.009776328,0.9786096,0.0052738893,0.00018868879],"about_ca_topic_score_codex":0.000004147175,"about_ca_topic_score_gemma":0.0000024001695,"teacher_disagreement_score":0.09222538,"about_ca_system_score_codex":0.00023301829,"about_ca_system_score_gemma":0.0006354765,"threshold_uncertainty_score":0.7027961},"labels":[],"label_agreement":null},{"id":"W2005947941","doi":"10.1007/s11083-010-9163-3","title":"Dualities and Dual Pairs in Heyting Algebras","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heyting algebra; Mathematics; Homomorphism; Dual (grammatical number); Core (optical fiber); Algebra over a field; Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Linguistics","score_opus":0.016288944898138293,"score_gpt":0.2882060357094795,"score_spread":0.2719170908113412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005947941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804458,0.000063960244,0.013923773,0.0010785698,0.00015644381,0.00007635775,6.0436525e-7,0.00007311443,0.004181372],"genre_scores_gemma":[0.9723953,0.0000053199537,0.026585916,0.00014557446,0.000032941098,0.000008901993,3.6446372e-7,0.0000064015207,0.00081930705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992771,0.000048412363,0.00009093288,0.00020623025,0.00014122861,0.00023607534],"domain_scores_gemma":[0.99947375,0.00016412162,0.00001744336,0.00025336718,0.000039082315,0.000052256844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043784577,0.0000624174,0.000071382376,0.000098831726,0.000064912325,0.00007570595,0.00021657012,0.00003651355,0.000045347246],"category_scores_gemma":[0.00018015952,0.000057033532,0.000010201859,0.00031597514,0.00010192681,0.00033946332,0.00024038593,0.0002426029,0.00002588604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004878421,0.00002735491,0.021043636,0.000012757667,0.000004199519,0.000036225665,0.002133961,0.0000111006275,0.004640423,0.9240915,0.00013419273,0.04785974],"study_design_scores_gemma":[0.0014117501,0.00013018485,0.06475641,0.000039090177,0.0000021777466,0.00014288822,0.001299398,0.014779794,0.0072137173,0.88739353,0.022139769,0.00069127127],"about_ca_topic_score_codex":0.000020888121,"about_ca_topic_score_gemma":0.0001298491,"teacher_disagreement_score":0.047168467,"about_ca_system_score_codex":0.000004718603,"about_ca_system_score_gemma":0.0000288891,"threshold_uncertainty_score":0.232576},"labels":[],"label_agreement":null},{"id":"W2006186391","doi":"10.1016/j.tcs.2015.01.028","title":"Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Mathematics; Combinatorics; Injective function; Bijection; Treewidth; Homomorphism; Bounded function; Surjective function; Discrete mathematics; Algebra homomorphism; Graph; Tree-depth; 1-planar graph; Pathwidth; Chordal graph; Line graph","score_opus":0.04165431843452008,"score_gpt":0.29213325162119763,"score_spread":0.2504789331866776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006186391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12603344,0.000054054362,0.8649451,0.00066548225,0.00030144153,0.0002911021,0.000004025848,0.00016185237,0.0075435103],"genre_scores_gemma":[0.82228523,0.000004651992,0.17732881,0.0003267624,0.000026066054,0.000006790611,5.9639035e-7,0.000010267045,0.000010826515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960337,0.00027081757,0.00040964005,0.0009694256,0.0014911777,0.00082519563],"domain_scores_gemma":[0.9966943,0.0006127141,0.0001222598,0.0012285444,0.000535863,0.00080630323],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030323048,0.00028086445,0.0003986757,0.00050933793,0.0003308593,0.00039044983,0.0028798725,0.00007976991,0.000012815626],"category_scores_gemma":[0.00036383994,0.00022734603,0.000079364065,0.002011581,0.015195701,0.00071078545,0.0012548373,0.00032469834,0.00002707071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007719032,0.00010267759,0.0000670779,0.000007649185,0.0000075493217,0.000031131465,0.00032328753,0.000038531598,0.0004666701,0.9574565,0.00001780289,0.041403886],"study_design_scores_gemma":[0.0009072736,0.0012954077,0.00042859465,0.000041040435,0.000004077231,0.00008867238,0.00001861994,0.1078811,0.005694723,0.88335156,0.000036659523,0.00025224243],"about_ca_topic_score_codex":0.0000042910247,"about_ca_topic_score_gemma":0.00000152785,"teacher_disagreement_score":0.6962518,"about_ca_system_score_codex":0.00007516656,"about_ca_system_score_gemma":0.0004706663,"threshold_uncertainty_score":0.9874844},"labels":[],"label_agreement":null},{"id":"W2006409610","doi":"10.1016/j.dam.2009.04.014","title":"Limited packings in graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Packing problems; Graph; Upper and lower bounds; Set packing; Simple graph; Discrete mathematics; Computer science","score_opus":0.01961147427158829,"score_gpt":0.2841082372443037,"score_spread":0.2644967629727154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006409610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06712497,0.00007043402,0.87007535,0.0008416264,0.00004888418,0.0006735804,0.0000023884215,0.0004210485,0.060741697],"genre_scores_gemma":[0.774251,0.000018121898,0.22531016,0.00030224948,0.000010239819,0.000029106024,0.0000028813947,0.00001354191,0.00006269292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840087,0.000019447401,0.00033684756,0.00036347075,0.0003972363,0.00048214776],"domain_scores_gemma":[0.9987393,0.00016616662,0.00009869978,0.00085237663,0.00003522017,0.00010823034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044072658,0.0001879543,0.0002555407,0.0003027014,0.00007222222,0.00011652093,0.0010658203,0.000071088514,0.000009790653],"category_scores_gemma":[0.000058436843,0.00016508217,0.00006624371,0.0011586414,0.00006763401,0.00025099886,0.00016203949,0.00024900792,0.00007854257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005433486,0.00008478706,0.000016858232,0.000018385479,0.000004164567,0.000012202631,0.0012494492,0.000039121715,0.0059277737,0.98197776,0.000058145484,0.010605932],"study_design_scores_gemma":[0.00034711778,0.000046781628,0.00047523197,0.000030226707,0.0000023091695,0.000006379395,0.00015574983,0.009003427,0.004194544,0.9853583,0.00016116079,0.00021879954],"about_ca_topic_score_codex":8.0051456e-7,"about_ca_topic_score_gemma":0.0000017559893,"teacher_disagreement_score":0.707126,"about_ca_system_score_codex":0.000032254287,"about_ca_system_score_gemma":0.000021716389,"threshold_uncertainty_score":0.6731855},"labels":[],"label_agreement":null},{"id":"W2006429817","doi":"10.1002/net.21490","title":"Shortest paths avoiding forbidden subpaths","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shortest path problem; Distance; K shortest path routing; Combinatorics; Yen's algorithm; Longest path problem; Euclidean shortest path; Constrained Shortest Path First; Shortest Path Faster Algorithm; Widest path problem; Path (computing); Mathematics; Discrete mathematics; Computer science; Graph; Dijkstra's algorithm; Computer network","score_opus":0.01678287490000113,"score_gpt":0.25743815220359384,"score_spread":0.2406552773035927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006429817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021877944,0.00045441752,0.96829575,0.00034029063,0.0004162272,0.0003220344,4.0671156e-7,0.00029533711,0.007997589],"genre_scores_gemma":[0.98730195,0.00004902228,0.011325211,0.00031498313,0.00024179711,0.00008080267,0.0000022666618,0.0000190765,0.00066489144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998348,0.00013886376,0.00018687539,0.00040596048,0.00027704728,0.0006432808],"domain_scores_gemma":[0.99853045,0.0003603973,0.000049537288,0.0007583859,0.00011163125,0.00018962474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049311615,0.00014479685,0.0001499784,0.00009240596,0.00025233807,0.00024189513,0.0011851587,0.00009538067,0.0001192053],"category_scores_gemma":[0.00007421996,0.00013119155,0.00007104585,0.0005578495,0.00007155532,0.0008339493,0.00044849652,0.0004701162,0.00038852883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008755026,0.00010111686,0.012449036,0.000011363985,0.000039642346,0.00007621104,0.0006438776,0.013303406,0.0011778978,0.38078842,0.01889661,0.5725037],"study_design_scores_gemma":[0.00026874195,0.00010668471,0.005939898,0.000032995824,0.0000030751196,0.000029634544,0.00006401827,0.85908365,0.0003122677,0.13005823,0.0037310931,0.00036969545],"about_ca_topic_score_codex":0.00002118389,"about_ca_topic_score_gemma":0.000008428412,"teacher_disagreement_score":0.965424,"about_ca_system_score_codex":0.000036799727,"about_ca_system_score_gemma":0.000025344938,"threshold_uncertainty_score":0.53498363},"labels":[],"label_agreement":null},{"id":"W2006528126","doi":"10.1016/j.disc.2007.11.062","title":"Factor-critical property in 3-dominating-critical graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Discrete mathematics; Conjecture; Neighbourhood (mathematics); Graph","score_opus":0.05002103674915585,"score_gpt":0.33888864272112684,"score_spread":0.288867605971971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006528126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08506288,0.00015926003,0.9000688,0.0015577606,0.00022727788,0.00054653065,0.000014414927,0.00032523624,0.012037834],"genre_scores_gemma":[0.8151318,0.000015531528,0.18438832,0.00007215625,0.000019297893,0.00004337578,0.0000010544837,0.000023424363,0.00030502686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975628,0.00015412597,0.00046581044,0.00046164033,0.00066956197,0.00068605377],"domain_scores_gemma":[0.9974764,0.0013109379,0.000042358017,0.00081425626,0.00014109789,0.00021494745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042725148,0.00022828476,0.00034134756,0.00024870224,0.00021238066,0.000099182704,0.0011233531,0.00009200382,0.000050907358],"category_scores_gemma":[0.002161737,0.0001560296,0.00011698484,0.00072874833,0.0006406998,0.0006504143,0.00043904906,0.00040804618,0.000114152506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006861524,0.00023337468,0.00068482157,0.00017230553,0.0000061354785,0.0002487788,0.0036400245,0.000006528784,0.0007829169,0.99256027,0.00007157131,0.0015864255],"study_design_scores_gemma":[0.00054966076,0.00018599669,0.0011826844,0.00024156233,0.000004674992,0.00031194463,0.00040602253,0.09014376,0.002898665,0.9032735,0.00024938548,0.00055212644],"about_ca_topic_score_codex":0.0000054219213,"about_ca_topic_score_gemma":0.0000036076196,"teacher_disagreement_score":0.7300689,"about_ca_system_score_codex":0.000049813225,"about_ca_system_score_gemma":0.00007156692,"threshold_uncertainty_score":0.6362702},"labels":[],"label_agreement":null},{"id":"W2006587062","doi":"10.1006/jctb.2001.2082","title":"Branch-Width and Well-Quasi-Ordering in Matroids and Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Bounded function; Combinatorics; Mathematics; Class (philosophy); Graphic matroid; Discrete mathematics; Tree (set theory); Computer science; Mathematical analysis","score_opus":0.010457935432773438,"score_gpt":0.24424879096954472,"score_spread":0.23379085553677129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006587062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97141457,0.0042404546,0.017985892,0.00092086266,0.0024795916,0.00018683671,8.315542e-7,0.000045210665,0.00272576],"genre_scores_gemma":[0.99589956,0.0010352276,0.0027643207,0.00005088571,0.00010975813,0.0000022647257,6.137327e-8,0.000014075865,0.0001238281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835163,0.00035243906,0.00042253901,0.00020346703,0.00035307702,0.00031684295],"domain_scores_gemma":[0.9988352,0.00040713802,0.0002055991,0.00026549448,0.00011784299,0.0001687206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015247323,0.0001649019,0.00034397191,0.0003787833,0.00012811454,0.0001728576,0.0005553133,0.00007348746,0.000040242536],"category_scores_gemma":[0.00021528994,0.00014581694,0.00006415741,0.0004951573,0.00027852965,0.0015396145,0.00025566356,0.0004297831,0.0000029111561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022636796,0.00008805263,0.0010020342,0.000023712122,0.00002232026,0.000079753074,0.000993591,0.0000120066325,0.0011804147,0.981176,0.00004578575,0.015149967],"study_design_scores_gemma":[0.0015276904,0.00072440546,0.0008081101,0.000057767855,0.00000474967,0.0003637275,0.00013105561,0.00017718402,0.0014499421,0.9927877,0.0018106815,0.00015694277],"about_ca_topic_score_codex":0.0000012839866,"about_ca_topic_score_gemma":0.0000011019581,"teacher_disagreement_score":0.024485018,"about_ca_system_score_codex":0.000029586958,"about_ca_system_score_gemma":0.000020904321,"threshold_uncertainty_score":0.5946242},"labels":[],"label_agreement":null},{"id":"W2006938312","doi":"10.1016/j.disc.2005.03.024","title":"Brian Alspach and his work","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Lethbridge","funders":"","keywords":"Mathematics; Work (physics); Discrete mathematics; Mathematical economics; Calculus (dental); Engineering; Medicine","score_opus":0.02155731934103933,"score_gpt":0.2930603300607516,"score_spread":0.2715030107197123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006938312","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03492759,0.00040875323,0.94783485,0.0028272031,0.000054694894,0.00023557614,0.000003204252,0.00020669328,0.013501444],"genre_scores_gemma":[0.39949334,0.000036458398,0.59788334,0.0001909401,0.00007291081,0.00001733405,0.0000014912995,0.000021128462,0.0022830488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895364,0.00003738037,0.00018679154,0.00024557443,0.00027337208,0.0003032417],"domain_scores_gemma":[0.99898636,0.00017114825,0.000060006023,0.0006167614,0.00003584099,0.00012989387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036237587,0.00012277206,0.00015706055,0.00008385769,0.00010684177,0.00015732678,0.0005901906,0.000040504372,0.000035335965],"category_scores_gemma":[0.00009410069,0.000102267164,0.000041635318,0.00034336213,0.000098577475,0.0003590546,0.00033134487,0.00012732475,0.00015790736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040900577,0.000056263092,0.0002771396,0.00005184914,0.00002099339,0.00000953547,0.0037481685,0.000050700906,0.0002528132,0.94029313,0.0011282453,0.054107074],"study_design_scores_gemma":[0.00089504156,0.00012936043,0.0011344859,0.00019635801,0.000020380947,0.00010475855,0.00048613417,0.10718475,0.0037331402,0.8444947,0.040734112,0.0008867867],"about_ca_topic_score_codex":8.12297e-7,"about_ca_topic_score_gemma":0.0000024299914,"teacher_disagreement_score":0.36456576,"about_ca_system_score_codex":0.000022093125,"about_ca_system_score_gemma":0.000014102193,"threshold_uncertainty_score":0.4170334},"labels":[],"label_agreement":null},{"id":"W2007560929","doi":"10.1016/j.dam.2008.01.026","title":"Polarity of chordal graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Indifference graph; Pathwidth; Cograph; Bipartite graph; Split graph; Interval graph; Discrete mathematics; Maximal independent set; Distance-hereditary graph; Strong perfect graph theorem; Treewidth; Modular decomposition; Graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.027902754545618,"score_gpt":0.27988077025463104,"score_spread":0.251978015709013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007560929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10331238,0.000051628056,0.8708377,0.000061006922,0.00004064001,0.00029885603,0.0000072467114,0.00014493115,0.025245612],"genre_scores_gemma":[0.65369713,0.000021440206,0.3461488,0.000027155864,0.000009032274,0.000019092913,0.0000019943188,0.000012774927,0.0000626032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855375,0.000019359215,0.00033391974,0.00027051632,0.0004953072,0.00032715846],"domain_scores_gemma":[0.998563,0.00017492336,0.00014665091,0.00093744503,0.00006984519,0.00010813192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225883,0.00015324114,0.00027984506,0.00014578448,0.0001383233,0.000020564807,0.0010941045,0.00006052268,0.000016954546],"category_scores_gemma":[0.000050740455,0.00013206834,0.00009936602,0.0006087743,0.00027877218,0.0001835534,0.00035663278,0.00018774046,0.000043634704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005272905,0.00008540916,0.000072633055,0.000060938015,0.000016877562,0.0000081324615,0.0013370843,0.000012369474,0.013947705,0.9836207,0.00005312923,0.00077973],"study_design_scores_gemma":[0.00035980082,0.000048612004,0.00049015915,0.000015874792,0.000005893275,0.000051060462,0.00013348593,0.0033045735,0.035030324,0.96015054,0.00017905569,0.00023061938],"about_ca_topic_score_codex":0.0000030686178,"about_ca_topic_score_gemma":8.304045e-7,"teacher_disagreement_score":0.55038476,"about_ca_system_score_codex":0.000014369201,"about_ca_system_score_gemma":0.000045479515,"threshold_uncertainty_score":0.538559},"labels":[],"label_agreement":null},{"id":"W2008238596","doi":"10.1145/1250790.1250847","title":"Interval completion with few edges","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Computation; Minification; Graph; Interval (graph theory); Mathematics; Algorithm; Discrete mathematics; NP-complete; Computer science; Time complexity; Mathematical optimization","score_opus":0.03496718699044837,"score_gpt":0.3128576553151562,"score_spread":0.2778904683247078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008238596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021397362,0.000018999473,0.9529982,0.00037962128,0.000054495038,0.00007199088,1.3834892e-7,0.00015607965,0.024923075],"genre_scores_gemma":[0.8754301,0.0000014856031,0.12314533,0.00020732284,0.000026454047,0.0000020413165,5.5751025e-7,0.00000453605,0.0011821707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992247,0.000025449854,0.00008326217,0.00019334264,0.000228276,0.00024495873],"domain_scores_gemma":[0.9994116,0.000101716825,0.000019306617,0.00031506905,0.00007612483,0.00007619102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047323736,0.000060509028,0.0000673146,0.000102152975,0.00006512954,0.000051833307,0.00050805206,0.000016432461,0.000042244064],"category_scores_gemma":[0.000013140961,0.000042463165,0.000019374873,0.00035834662,0.00007697067,0.00030503017,0.00015294128,0.00009132903,0.000104063416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003713169,0.000039950897,0.0020291917,0.0000052682553,0.0000076210263,0.00002826451,0.0001690702,0.00001883185,0.0013021328,0.89003617,0.0003737895,0.10595256],"study_design_scores_gemma":[0.0037315537,0.0034753282,0.20617893,0.00018137449,0.000010546607,0.0005864974,0.00095739367,0.027795598,0.24028741,0.416949,0.098080255,0.0017660989],"about_ca_topic_score_codex":0.0000072351995,"about_ca_topic_score_gemma":0.000051838357,"teacher_disagreement_score":0.85403275,"about_ca_system_score_codex":0.00002168316,"about_ca_system_score_gemma":0.000013039579,"threshold_uncertainty_score":0.17315976},"labels":[],"label_agreement":null},{"id":"W2008773627","doi":"10.1016/j.jctb.2005.11.001","title":"Obstructions to branch-decomposition of matroids","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Net (polyhedron); Characterization (materials science); Class (philosophy); Minor (academic); Set (abstract data type); Pairwise comparison; Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.009228262069560421,"score_gpt":0.29100298755742676,"score_spread":0.28177472548786636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008773627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49803165,0.00034194157,0.48825663,0.0027542661,0.0071308715,0.00025847403,0.000006576146,0.000068110916,0.0031514994],"genre_scores_gemma":[0.9624008,0.000022743397,0.03674028,0.000063822874,0.00058475364,0.000002640881,3.013395e-7,0.000011966189,0.00017269123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827325,0.00028657686,0.00056105066,0.000138096,0.0005056676,0.0002353815],"domain_scores_gemma":[0.9982752,0.00026467638,0.0003428778,0.00039312473,0.00054355385,0.00018055511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825889,0.00012423965,0.00031365268,0.00034688073,0.00012241777,0.000066713714,0.0010143105,0.000057850895,0.000056877987],"category_scores_gemma":[0.00021605272,0.0001122054,0.00016452833,0.0006021439,0.0001294615,0.0015410559,0.00017838892,0.00026353332,0.000015392914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005066501,0.000097692006,0.000036207417,0.000008024336,0.000036171576,0.0000055019386,0.00049268745,0.00056172005,0.021170035,0.96339816,0.00023214844,0.01345502],"study_design_scores_gemma":[0.00071909593,0.00082259224,0.00026993442,0.000036853275,0.00000881602,0.00019974101,0.000082918385,0.000024532306,0.06904114,0.91857046,0.010110961,0.00011296518],"about_ca_topic_score_codex":5.66136e-7,"about_ca_topic_score_gemma":4.808794e-7,"teacher_disagreement_score":0.46436915,"about_ca_system_score_codex":0.00008789916,"about_ca_system_score_gemma":0.00009958025,"threshold_uncertainty_score":0.45756036},"labels":[],"label_agreement":null},{"id":"W2008914847","doi":"10.1016/s0166-218x(99)00163-8","title":"Pancyclicity and NP-completeness in planar graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Completeness (order theory); Combinatorics; NP-complete; Planar; Planar graph; Discrete mathematics; Graph; Time complexity; Computer science","score_opus":0.018394195643940105,"score_gpt":0.2686029003853998,"score_spread":0.2502087047414597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008914847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.667103,0.00014265669,0.28763962,0.00035637524,0.000034959427,0.00077280455,0.00001394122,0.0002715491,0.04366509],"genre_scores_gemma":[0.8277246,0.00011415277,0.17167076,0.00020435132,0.000013765633,0.00009922436,0.000005107812,0.000026291915,0.0001417365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852806,0.000028911629,0.00031488747,0.00039566946,0.000307574,0.00042487337],"domain_scores_gemma":[0.99892765,0.00022284064,0.00005814993,0.00066127593,0.000015449648,0.00011464785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037971244,0.00018814203,0.0002924933,0.00015550565,0.000104963234,0.000095674186,0.0007186667,0.00006275476,0.000041989264],"category_scores_gemma":[0.000016129268,0.00016446365,0.000039231447,0.0005568342,0.00014442865,0.00020554123,0.00012378917,0.00020130555,0.000063773885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012561852,0.00006507471,0.00016084977,0.000074208445,0.0000092064065,0.000013727412,0.0014188574,0.000043551732,0.001782307,0.9772307,0.000031722466,0.019157182],"study_design_scores_gemma":[0.00047088924,0.00002457039,0.0012554851,0.000028642038,0.0000035201183,0.000020656315,0.00014453613,0.008294314,0.0008823329,0.988052,0.0005578213,0.00026521145],"about_ca_topic_score_codex":0.000008473583,"about_ca_topic_score_gemma":0.000014033963,"teacher_disagreement_score":0.1606216,"about_ca_system_score_codex":0.000017595003,"about_ca_system_score_gemma":0.000013993038,"threshold_uncertainty_score":0.6706633},"labels":[],"label_agreement":null},{"id":"W2009261722","doi":"10.1016/s0012-365x(01)00369-7","title":"Total domination in complements of graphs containing no K4,4","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.03916226416454757,"score_gpt":0.3101956242073229,"score_spread":0.27103336004277534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009261722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46465752,0.00011741654,0.5042656,0.00019824017,0.00016107867,0.00070244033,0.000015917114,0.000102560116,0.029779265],"genre_scores_gemma":[0.91301453,0.000007968742,0.08674163,0.000014597016,0.0000058905066,0.000016462323,0.000002369617,0.00000892405,0.00018762637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987416,0.00006275507,0.00037837558,0.00018594606,0.0003744615,0.00025681444],"domain_scores_gemma":[0.9990148,0.000227239,0.00019802806,0.00041682503,0.000094521216,0.000048620383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044427702,0.00010628358,0.00021101312,0.00021486175,0.000045583078,0.000038217768,0.00051840534,0.000030037556,0.00007950469],"category_scores_gemma":[0.00020712365,0.00009705016,0.000057747187,0.0004663901,0.000074905314,0.00031292654,0.00020710495,0.000107711814,0.000050760038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008761116,0.00019212239,0.001223076,0.0001394057,0.000019960036,0.00001270559,0.0063174325,0.000114941984,0.002234398,0.9832919,0.00006739736,0.006377869],"study_design_scores_gemma":[0.0013378981,0.00027200696,0.0015186175,0.00018939626,0.0000054284974,0.000013712594,0.00072876096,0.62338954,0.0025236898,0.3696554,0.00008451653,0.000281033],"about_ca_topic_score_codex":0.000003917153,"about_ca_topic_score_gemma":0.0000034429881,"teacher_disagreement_score":0.6232746,"about_ca_system_score_codex":0.000027717997,"about_ca_system_score_gemma":0.0000063974517,"threshold_uncertainty_score":0.39575905},"labels":[],"label_agreement":null},{"id":"W2009792106","doi":"10.1002/jgt.20123","title":"Spanning subgraphs of graphs partitioned into two isomorphic pieces","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Countable set; Induced subgraph; Cograph; Discrete mathematics; Induced subgraph isomorphism problem; Graph; Pathwidth; Line graph; Voltage graph; Vertex (graph theory)","score_opus":0.01714410709455434,"score_gpt":0.2990813890537635,"score_spread":0.2819372819592092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009792106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50619584,0.0057136766,0.48476616,0.00141982,0.0005623641,0.00019495131,0.00000602951,0.00007771662,0.0010634384],"genre_scores_gemma":[0.9656857,0.00036862714,0.03356275,0.0001967123,0.00012122783,0.0000048911484,9.62161e-7,0.000016315424,0.000042791813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677217,0.0006522678,0.00094243744,0.0002897602,0.0008810366,0.00046229913],"domain_scores_gemma":[0.9969305,0.0006109145,0.00089086295,0.00066129694,0.0006417546,0.00026470766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004017192,0.00023275947,0.00049459346,0.0015371949,0.00022043005,0.00008003292,0.0017881147,0.000076603865,0.000079118094],"category_scores_gemma":[0.00026097606,0.00019472052,0.0005036585,0.0017538033,0.0005055701,0.001540719,0.00020152537,0.0005504173,0.000022297305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030699035,0.00027328444,0.0032436186,0.00003612478,0.00020073979,0.000059553204,0.001965996,0.002193831,0.0138510335,0.9416921,0.0004759669,0.03570072],"study_design_scores_gemma":[0.0011381091,0.0004463335,0.0012090281,0.00012776235,0.00003013605,0.00018819315,0.0002457303,0.00037499293,0.020851932,0.97391003,0.001250826,0.00022689733],"about_ca_topic_score_codex":0.0000045953007,"about_ca_topic_score_gemma":0.000013050369,"teacher_disagreement_score":0.45948988,"about_ca_system_score_codex":0.000039481376,"about_ca_system_score_gemma":0.000116655414,"threshold_uncertainty_score":0.7940472},"labels":[],"label_agreement":null},{"id":"W2010049762","doi":"10.1016/j.disopt.2006.01.001","title":"Facets of the independent path-matching polytope","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Matching (statistics); Mathematics; Combinatorics; Path (computing); Birkhoff polytope; Convex polytope; Independent set; Convex hull; Intersection (aeronautics); Matroid; Regular polygon; Convex set; Computer science; Convex optimization; Graph","score_opus":0.007936245868375578,"score_gpt":0.2477247421725551,"score_spread":0.23978849630417953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010049762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012393355,0.000060010156,0.9832856,0.0003572616,0.000112631526,0.00018178491,0.0000040722102,0.000047250032,0.003558018],"genre_scores_gemma":[0.9390572,0.0000069548905,0.06050607,0.00003686908,0.000018283721,0.000007762536,0.0000059979243,0.000008773607,0.00035214404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989373,0.000111038986,0.0001838541,0.00020522777,0.0003822888,0.00018028163],"domain_scores_gemma":[0.9992502,0.00004065346,0.000115734525,0.00048792383,0.0000792416,0.000026243786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022232924,0.00008263501,0.000087918386,0.00006501845,0.000134912,0.00006430189,0.0007227067,0.000039894112,0.000015170617],"category_scores_gemma":[0.000029295143,0.000058668455,0.000057477777,0.00046888413,0.000057986257,0.0004235035,0.00029615447,0.00010793412,0.0000037940338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038972144,0.000017120277,0.00086230313,0.0000057415255,0.0000034982043,7.2712385e-7,0.00017746033,0.8402511,0.0018683865,0.15598346,0.000026207517,0.0008000817],"study_design_scores_gemma":[0.00050907413,0.00004541298,0.008655564,0.00005619941,0.0000062706613,0.00000791356,0.000093281196,0.88431144,0.018414745,0.08750283,0.00014643246,0.0002508454],"about_ca_topic_score_codex":0.000055734174,"about_ca_topic_score_gemma":0.000009056662,"teacher_disagreement_score":0.9266638,"about_ca_system_score_codex":0.000026084314,"about_ca_system_score_gemma":0.000033137378,"threshold_uncertainty_score":0.23924302},"labels":[],"label_agreement":null},{"id":"W2010884279","doi":"10.1007/s10878-013-9656-2","title":"A 0.5358-approximation for Bandpass-2","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates - Technology Futures","keywords":"Partition (number theory); Theory of computation; Mathematics; Matching (statistics); Travelling salesman problem; Combinatorics; Approximation algorithm; Band-pass filter; Partition problem; Bipartite graph; Discrete mathematics; Algorithm; Graph; Physics; Optics","score_opus":0.013518144185773052,"score_gpt":0.27259833383196913,"score_spread":0.25908018964619606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010884279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011890403,0.000043210886,0.9951225,0.000979535,0.0019472621,0.0003822846,4.535879e-7,0.000025662175,0.0003100668],"genre_scores_gemma":[0.19642168,0.00002543202,0.80299807,0.000058763628,0.0003800376,0.000034508994,0.0000025381162,0.000014463133,0.00006449731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988215,0.000093096154,0.0004048166,0.00011673702,0.00038352588,0.00018031104],"domain_scores_gemma":[0.99775517,0.00022304908,0.00041244595,0.0001990075,0.001311354,0.00009894671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006408696,0.000087904,0.00017815141,0.00022829948,0.00009992429,0.00021348524,0.000549126,0.00006353701,0.000024553798],"category_scores_gemma":[0.00042427218,0.000075706695,0.00010023155,0.0003938568,0.000026005879,0.0021081932,0.000054525706,0.00012536939,0.000006683439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008999169,0.00017859093,0.00005284981,0.000024581712,0.000036911213,0.0000016913388,0.00024740314,0.17532286,0.0012339513,0.809953,0.0023351987,0.0105230035],"study_design_scores_gemma":[0.0017741972,0.00045299123,0.00004871697,0.000019994586,0.0000066974203,0.000015221343,0.000015753283,0.4934157,0.0021973618,0.50133586,0.0006177315,0.00009977831],"about_ca_topic_score_codex":0.0000010902459,"about_ca_topic_score_gemma":2.3413651e-8,"teacher_disagreement_score":0.31809285,"about_ca_system_score_codex":0.00007090045,"about_ca_system_score_gemma":0.00012539575,"threshold_uncertainty_score":0.30872294},"labels":[],"label_agreement":null},{"id":"W2011612932","doi":"10.1007/s10589-007-9122-0","title":"Benders, metric and cutset inequalities for multicommodity capacitated network design","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; HEC Montréal","funders":"","keywords":"Mathematics; Metric (unit); Inequality; Context (archaeology); Mathematical optimization; Mathematical analysis","score_opus":0.059124732364864485,"score_gpt":0.325472630503332,"score_spread":0.26634789813846754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011612932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000837051,0.00023359159,0.9982721,0.00039825006,0.000024927342,0.0007561215,0.000019642926,0.0001058599,0.000105765],"genre_scores_gemma":[0.13138023,0.00003307733,0.867995,0.00022618813,0.000047225076,0.00015720776,0.00010663581,0.000008962958,0.000045463832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.00006416972,0.00023449291,0.00029094168,0.00016031033,0.00023653019],"domain_scores_gemma":[0.9976827,0.001666393,0.00008915295,0.00015280502,0.00028958617,0.000119375945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007740533,0.00010328878,0.00011244159,0.00019959145,0.00048825986,0.00011430119,0.0001861832,0.00004544754,0.0000035001367],"category_scores_gemma":[0.00007432684,0.00010791909,0.000021595644,0.0007825475,0.0001219166,0.00028751747,0.0000852091,0.00007064681,0.0000013763538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060071643,0.000018648425,0.00006685432,0.0000068782474,0.000007513501,9.597518e-8,0.00007989999,0.59803194,0.0000021560136,0.3968876,0.00012666635,0.004765736],"study_design_scores_gemma":[0.00035312795,0.000028644694,0.0005659748,0.0000034521534,0.00000466745,0.000004915746,0.00005425722,0.83064634,0.000017819171,0.16745628,0.00075760175,0.00010688731],"about_ca_topic_score_codex":0.000002184271,"about_ca_topic_score_gemma":0.0000013124655,"teacher_disagreement_score":0.23261443,"about_ca_system_score_codex":0.00002523447,"about_ca_system_score_gemma":0.000037938393,"threshold_uncertainty_score":0.4400813},"labels":[],"label_agreement":null},{"id":"W2011663983","doi":"10.1016/s0012-365x(00)00127-8","title":"On constructible graphs, infinite bridged graphs and weakly cop-win graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Vertex (graph theory); Induced subgraph; Retract; Graph; Discrete mathematics; Bipartite graph; Pure mathematics","score_opus":0.016283508460044168,"score_gpt":0.2735630802026106,"score_spread":0.25727957174256644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011663983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9349084,0.00033337434,0.032661982,0.00041624397,0.0001824581,0.000800696,0.00005967081,0.0005836633,0.030053517],"genre_scores_gemma":[0.91837627,0.00042960024,0.07948248,0.00042972862,0.000015291913,0.000063838044,0.0000140206175,0.00006895791,0.001119835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724203,0.00015634632,0.0005247299,0.0006648703,0.0007134921,0.0006985165],"domain_scores_gemma":[0.99751043,0.0006659732,0.00015615766,0.0012617563,0.000097376826,0.00030832662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062068,0.00039478324,0.0004658392,0.00049395114,0.0003694305,0.0003415375,0.0010756521,0.00012098979,0.00019148174],"category_scores_gemma":[0.00013538118,0.00034328757,0.00017998379,0.0013563604,0.0006275946,0.0005560398,0.00022439883,0.00043238793,0.00017348696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026582537,0.00007886238,0.00027061856,0.00008536948,0.000050247276,0.000028918,0.00096409314,0.00004358147,0.00052486703,0.98667437,0.00039087184,0.010861632],"study_design_scores_gemma":[0.0006730433,0.00023170664,0.0004821847,0.00013732299,0.00001626258,0.0001068011,0.0001515578,0.0061714235,0.0017003599,0.9893331,0.00054885104,0.00044738673],"about_ca_topic_score_codex":0.000010619879,"about_ca_topic_score_gemma":0.000005872114,"teacher_disagreement_score":0.0468205,"about_ca_system_score_codex":0.00002259236,"about_ca_system_score_gemma":0.000047123016,"threshold_uncertainty_score":0.9999019},"labels":[],"label_agreement":null},{"id":"W2012753180","doi":"10.1007/s00373-014-1497-y","title":"Graphical Representations of Graphic Frame Matroids","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matroid; Graphic matroid; Combinatorics; Mathematics; Graph; Matroid partitioning; Discrete mathematics; Dual graph; Planar graph","score_opus":0.02808379344953137,"score_gpt":0.29715217956220635,"score_spread":0.269068386112675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012753180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7059524,0.0035177981,0.2790538,0.0014716778,0.0010730561,0.00053167995,0.000012985946,0.00044859573,0.007937982],"genre_scores_gemma":[0.99564296,0.00019777635,0.0039998614,0.00004736111,0.000005492891,0.000019345707,0.0000017217479,0.0000098087585,0.000075668846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984596,0.000119911725,0.00025545948,0.0003563866,0.00051536015,0.00029330415],"domain_scores_gemma":[0.99844414,0.00018613902,0.000089117515,0.0006806861,0.00030573673,0.00029420393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049643574,0.0001337647,0.00021282963,0.00045199497,0.00011272432,0.00006566026,0.000680874,0.000085458865,0.0000021102571],"category_scores_gemma":[0.00015914522,0.0001247991,0.000094884264,0.002227877,0.00029870134,0.0003771883,0.0003167542,0.00024310741,0.0000032914234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008642732,0.00009271065,0.020497303,0.0000113375345,0.00001628091,0.000008149867,0.00025671028,0.000006011631,0.00013989753,0.97783464,0.00033004532,0.0007982539],"study_design_scores_gemma":[0.00045472564,0.00023289006,0.006597116,0.000010249499,0.0000060889547,0.000018915487,0.00015955933,0.0010253491,0.00031935849,0.990649,0.00038912514,0.00013765115],"about_ca_topic_score_codex":0.000020172334,"about_ca_topic_score_gemma":0.0000018044645,"teacher_disagreement_score":0.28969055,"about_ca_system_score_codex":0.000010253306,"about_ca_system_score_gemma":0.0000560748,"threshold_uncertainty_score":0.50891596},"labels":[],"label_agreement":null},{"id":"W2013280510","doi":"10.1007/s10878-015-9871-0","title":"New analysis and computational study for the planar connected dominating set problem","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Matrix multiplication; Planar; Matrix (chemical analysis); Discrete mathematics; Algorithm; Graph; Computer science; Physics","score_opus":0.028811646897640365,"score_gpt":0.31579021679778535,"score_spread":0.286978569900145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013280510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00377963,0.00008072675,0.9945837,0.0006085903,0.00048709317,0.0004189809,0.0000016605785,0.000015133617,0.00002445779],"genre_scores_gemma":[0.4652695,0.0000044692597,0.53450745,0.00002076129,0.00016255294,0.0000061251653,0.0000037381121,0.000007215885,0.000018159364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985419,0.00021991265,0.00040545454,0.0001426508,0.00055361586,0.00013646118],"domain_scores_gemma":[0.99708897,0.0010353383,0.00044728108,0.00015020496,0.0011314639,0.00014675396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018159617,0.00009314005,0.00023837238,0.0003220646,0.00016683507,0.00022316072,0.00047020084,0.00003495624,0.0000024557735],"category_scores_gemma":[0.0005322246,0.000066298155,0.000072709045,0.0011439514,0.000028406155,0.0006034346,0.000070656795,0.00013875337,2.558124e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001784939,0.000077356955,0.0012979379,0.000002850893,0.00032565638,0.0000035084831,0.0015106384,0.94695127,0.0000035257015,0.04743647,0.00034586634,0.0018664394],"study_design_scores_gemma":[0.0043224716,0.00089973095,0.0005696743,0.0000070535402,0.00017636345,0.0000160149,0.0004203986,0.8467325,0.000019011091,0.14666808,0.00007890155,0.00008980202],"about_ca_topic_score_codex":0.000009241652,"about_ca_topic_score_gemma":0.0000014368551,"teacher_disagreement_score":0.4614899,"about_ca_system_score_codex":0.0000579031,"about_ca_system_score_gemma":0.00023678434,"threshold_uncertainty_score":0.27035603},"labels":[],"label_agreement":null},{"id":"W2013329579","doi":"10.1155/2011/135481","title":"The Modified Negative Decision Number in Graphs","year":2011,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.06287889222005405,"score_gpt":0.3579722105927675,"score_spread":0.29509331837271346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013329579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2487808,0.000106425265,0.7295482,0.00086344534,0.00032040963,0.00013529004,7.294685e-7,0.000012095253,0.020232605],"genre_scores_gemma":[0.69655454,0.00013815655,0.3032232,0.00003495,0.000014643024,0.0000034417512,1.2770982e-8,0.0000031161105,0.000027979937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998166,0.000047989124,0.00053851574,0.0001336713,0.00091519865,0.00019860608],"domain_scores_gemma":[0.99729824,0.0019256547,0.00027660563,0.00014631494,0.00026329377,0.00008987449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026419412,0.00009190848,0.00016649671,0.00016355608,0.00013285395,0.000227676,0.0018334077,0.000029863111,0.00003110613],"category_scores_gemma":[0.001110432,0.000048844027,0.00006926788,0.00036125377,0.0004830036,0.00057978526,0.0002981854,0.00016380716,0.000012539564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011129645,0.0001234442,0.00011473793,0.000004383623,0.000015249641,0.0000226412,0.001812577,0.000010898984,0.000044291788,0.9848402,0.00001780026,0.012982656],"study_design_scores_gemma":[0.0002381611,0.00006688193,0.0003450018,0.000108939115,0.0000021089043,0.00022096712,0.000555528,0.016667088,0.00046788037,0.98124444,0.000022916236,0.00006010386],"about_ca_topic_score_codex":0.0000033440692,"about_ca_topic_score_gemma":0.000005199262,"teacher_disagreement_score":0.44777372,"about_ca_system_score_codex":0.00002207581,"about_ca_system_score_gemma":0.00005256438,"threshold_uncertainty_score":0.3406958},"labels":[],"label_agreement":null},{"id":"W2013432272","doi":"10.1007/s00373-009-0870-8","title":"Fast Winning Strategies in Avoider-Enforcer Games","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Graph; Mathematical economics; Complete graph; Planarity testing; Set (abstract data type); Complete bipartite graph; Order (exchange); Computer science; Economics","score_opus":0.013567615020505925,"score_gpt":0.26867636386001625,"score_spread":0.25510874883951035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013432272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84434766,0.0033959914,0.12313734,0.0012019785,0.00042705992,0.0003803539,0.0000016397648,0.00041906856,0.026688905],"genre_scores_gemma":[0.9981373,0.00019755088,0.00133242,0.00014968328,0.0000051306442,0.0000064293604,6.739353e-7,0.0000056030563,0.0001652316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879533,0.000056176403,0.00017751673,0.0003240349,0.0002592234,0.00038773002],"domain_scores_gemma":[0.99936616,0.00007837647,0.000043800872,0.00035049496,0.000059474547,0.00010171835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029418783,0.00014251599,0.00016706309,0.0003120675,0.00013577024,0.0002618433,0.0005044667,0.000060268863,0.0000027561532],"category_scores_gemma":[0.00002177832,0.00013300934,0.000041931584,0.001136418,0.000077735196,0.00083967455,0.00011782772,0.0002708343,0.0000035777343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004517817,0.00004061192,0.0021871217,0.0000060950015,0.0000028815402,0.000025711146,0.0005346988,0.00006997286,0.00013491056,0.97564065,0.00005219884,0.02130062],"study_design_scores_gemma":[0.00039432,0.00017252658,0.015441883,0.000019840803,0.0000010771171,0.0000099260715,0.00038682116,0.0023921996,0.00019150319,0.9804094,0.00041269272,0.00016783188],"about_ca_topic_score_codex":0.000011092648,"about_ca_topic_score_gemma":0.0000034941886,"teacher_disagreement_score":0.15378961,"about_ca_system_score_codex":0.000020362288,"about_ca_system_score_gemma":0.000043455373,"threshold_uncertainty_score":0.5423963},"labels":[],"label_agreement":null},{"id":"W2013441256","doi":"10.1016/j.disc.2011.02.017","title":"Helly theorems for 3-Steiner and 3-monophonic convexity in graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Steiner tree problem; Discrete mathematics; Graph","score_opus":0.04527375080292364,"score_gpt":0.2889499057836746,"score_spread":0.24367615498075093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013441256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1462731,0.0002008443,0.84572434,0.00010240365,0.00009381007,0.000724158,0.00001206917,0.00009931697,0.006769948],"genre_scores_gemma":[0.7666808,0.000034902885,0.23285475,0.000060644597,0.00000882712,0.00009322142,0.0000020599377,0.000021576263,0.00024322452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988212,0.000051904666,0.00027293927,0.00031190115,0.00017687512,0.00036520156],"domain_scores_gemma":[0.99888855,0.00027953263,0.00008577804,0.00059293164,0.00005716147,0.00009604411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309904,0.0001538493,0.00022912982,0.0001610465,0.000073178606,0.00005784946,0.00065602583,0.00005855924,0.000014539332],"category_scores_gemma":[0.0001269042,0.00012243347,0.000066221,0.00032787607,0.00020422437,0.00029684088,0.00024992056,0.00012733974,0.00001730288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014553822,0.000055990422,0.00032077244,0.0000962225,0.0000106138,0.000005276682,0.004234966,0.0000023073303,0.00042209346,0.99330014,0.000016400334,0.0015206889],"study_design_scores_gemma":[0.0004285188,0.00011021487,0.00037003955,0.000038403432,0.0000038131682,0.000008791125,0.0002658238,0.0262829,0.0027598867,0.9694879,0.00007474359,0.00016893826],"about_ca_topic_score_codex":0.000006279546,"about_ca_topic_score_gemma":0.000012394861,"teacher_disagreement_score":0.6204077,"about_ca_system_score_codex":0.000015019615,"about_ca_system_score_gemma":0.00002474197,"threshold_uncertainty_score":0.49926922},"labels":[],"label_agreement":null},{"id":"W2013473240","doi":"10.4153/cmb-2009-045-6","title":"Hamiltonian Properties of Generalized Halin Graphs","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.025002392929088308,"score_gpt":0.24698558806614634,"score_spread":0.22198319513705803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013473240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58987886,0.0021098729,0.23691788,0.08786592,0.00027352205,0.0021597543,0.000030948442,0.00058579573,0.08017743],"genre_scores_gemma":[0.9596558,0.000009120348,0.037730776,0.0011753668,0.00001590982,0.00001638982,9.05457e-7,0.000011864329,0.001383832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983914,0.00011251109,0.0003259862,0.0002996454,0.0003150553,0.0005554142],"domain_scores_gemma":[0.99849695,0.00005985177,0.000055676424,0.0007136743,0.00011969845,0.00055413484],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004569178,0.00015534837,0.0002793284,0.0002959849,0.00011093499,0.00007139572,0.0010344875,0.00007749107,0.00082580466],"category_scores_gemma":[0.00029387436,0.00012924006,0.00010387975,0.00042155033,0.00018781515,0.00007564629,0.00005393335,0.00016386896,0.0012255214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005806295,0.000037986763,0.0000073126,0.00003314415,0.000008840442,0.000031214026,0.00028388528,0.000011170122,0.0035316895,0.99026006,0.0018295163,0.003959358],"study_design_scores_gemma":[0.00039201812,0.00013878223,0.00017797823,0.00014084914,0.0000057680345,0.000040813855,0.00003808847,0.0023823704,0.0137645155,0.96565616,0.016947791,0.00031485604],"about_ca_topic_score_codex":0.0002880867,"about_ca_topic_score_gemma":0.00022602169,"teacher_disagreement_score":0.36977696,"about_ca_system_score_codex":0.00006174413,"about_ca_system_score_gemma":0.00019709585,"threshold_uncertainty_score":0.99955213},"labels":[],"label_agreement":null},{"id":"W2013474931","doi":"10.1016/j.dam.2008.01.011","title":"Efficient algorithms for Roman domination on some classes of graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Interval graph; Domination analysis; Graph; Time complexity; Minimum weight; Chordal graph; Discrete mathematics; 1-planar graph","score_opus":0.03393014591615173,"score_gpt":0.3040478813041502,"score_spread":0.2701177353879985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013474931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116449095,0.000027854943,0.8793503,0.00007891422,0.00006675171,0.0008303711,0.000014887794,0.00010377024,0.003078046],"genre_scores_gemma":[0.6220733,0.000011865432,0.37758675,0.000036184967,0.000016944734,0.00016971985,0.0000066487137,0.000022005448,0.00007660266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984629,0.000016367518,0.00035924962,0.00032556418,0.0005176545,0.0003182288],"domain_scores_gemma":[0.99841195,0.00053336006,0.00020525,0.00067189365,0.00009885486,0.00007871566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003791433,0.00017283931,0.00028306345,0.00023470027,0.00017404738,0.000024883553,0.0007123043,0.00006112675,0.0000031864324],"category_scores_gemma":[0.00007423281,0.00014438492,0.0001188361,0.0003981194,0.00017993257,0.000082810315,0.00014073907,0.000103406266,0.000016723849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017711098,0.00018343302,0.0000013392568,0.00010684858,0.000017179565,0.000001862705,0.0010145673,0.0011640064,0.006154637,0.9891786,0.00007556218,0.0020842573],"study_design_scores_gemma":[0.0007651475,0.00019848753,0.000060398455,0.00003732065,0.000009110482,0.000007781189,0.00018242229,0.1708454,0.053504795,0.77407414,0.000091497146,0.00022351679],"about_ca_topic_score_codex":4.5507193e-7,"about_ca_topic_score_gemma":1.9383334e-7,"teacher_disagreement_score":0.5056242,"about_ca_system_score_codex":0.00003096976,"about_ca_system_score_gemma":0.00003521056,"threshold_uncertainty_score":0.5887846},"labels":[],"label_agreement":null},{"id":"W2013664277","doi":"10.1006/jctb.2002.2128","title":"Packing Odd Circuits in Eulerian Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Eulerian path; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Integer (computer science); Discrete mathematics; Computer science; Mathematical analysis; Telecommunications","score_opus":0.02289851368456595,"score_gpt":0.26171793746704963,"score_spread":0.2388194237824837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013664277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7974227,0.006670744,0.09816537,0.003878197,0.039479535,0.0010127057,0.0000073660285,0.00034940618,0.053014],"genre_scores_gemma":[0.99807745,0.00019980082,0.0011341622,0.00007690596,0.0002664438,0.0000033726808,1.456515e-7,0.000019635652,0.00022205283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972318,0.0007155958,0.0006601654,0.00023198636,0.0006764435,0.00048402548],"domain_scores_gemma":[0.99808913,0.0004892643,0.00040349402,0.00051003427,0.00030597806,0.00020209035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025359632,0.0001986301,0.00041845776,0.00060434133,0.00014535179,0.00019421591,0.0016542075,0.000103838145,0.00015225179],"category_scores_gemma":[0.0006300155,0.00017848393,0.00018408787,0.0012059674,0.00020659069,0.002270086,0.00022105535,0.0006380079,0.000019788054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010046649,0.00013993967,0.00038025543,0.000009775771,0.000028589528,0.00024799386,0.001148948,0.00003562798,0.0011722539,0.98121756,0.00016140884,0.015357168],"study_design_scores_gemma":[0.0013855529,0.000533755,0.00040704876,0.000072741,0.0000043787145,0.0002342017,0.00017117128,0.00008009055,0.002528288,0.98954827,0.004839308,0.00019522333],"about_ca_topic_score_codex":9.4501786e-7,"about_ca_topic_score_gemma":0.0000010823219,"teacher_disagreement_score":0.2006548,"about_ca_system_score_codex":0.00009852037,"about_ca_system_score_gemma":0.00005991348,"threshold_uncertainty_score":0.7278363},"labels":[],"label_agreement":null},{"id":"W2013713597","doi":"10.1016/s0012-365x(99)00355-6","title":"On hamiltonian connectedness of K1,4-free graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Social connectedness; Pancyclic graph; Discrete mathematics; Graph; Hamiltonian (control theory); Connectivity; Pathwidth; Line graph","score_opus":0.017383883880047038,"score_gpt":0.28031229433020755,"score_spread":0.2629284104501605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013713597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60508084,0.00012471137,0.2948833,0.00067058037,0.00017946042,0.0007242621,0.00005980606,0.00042674807,0.09785027],"genre_scores_gemma":[0.89604694,0.00003394298,0.101940766,0.00013666262,0.000014984323,0.000030212665,0.000004420772,0.000036060697,0.001755987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983697,0.00007670442,0.00034992816,0.0003065491,0.00054312235,0.0003540214],"domain_scores_gemma":[0.99749047,0.0004351409,0.00010596139,0.0017689297,0.00008430488,0.00011520854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003596583,0.0001805164,0.0002860548,0.0001700619,0.0000971261,0.000060175233,0.0019180902,0.000060971208,0.00026542743],"category_scores_gemma":[0.00021849123,0.0001476976,0.00012196874,0.00067702145,0.00019749576,0.00023034132,0.0002002631,0.00016974624,0.00013334173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014937127,0.00011108665,0.000015290561,0.00007056517,0.000022256761,0.000010672437,0.00129337,0.00014163376,0.00039036668,0.9919594,0.0002343996,0.0057360195],"study_design_scores_gemma":[0.00047799954,0.00016867285,0.00011966285,0.00010042037,0.000005747856,0.000011169412,0.000087041546,0.013635199,0.0041046916,0.9808058,0.0002860135,0.00019758295],"about_ca_topic_score_codex":0.000003527856,"about_ca_topic_score_gemma":0.0000035195778,"teacher_disagreement_score":0.29096612,"about_ca_system_score_codex":0.000017574233,"about_ca_system_score_gemma":0.000030522697,"threshold_uncertainty_score":0.6022934},"labels":[],"label_agreement":null},{"id":"W2013957545","doi":"10.1016/j.disc.2011.02.008","title":"Extending precolourings of circular cliques","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Conjecture; Clique number; Chromatic scale; Clique; Graph; Discrete mathematics","score_opus":0.05201806543424768,"score_gpt":0.305140009474376,"score_spread":0.2531219440401283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013957545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07939055,0.00009063648,0.90106976,0.000022099102,0.000056581408,0.00019976114,0.0000020069535,0.0001288983,0.019039681],"genre_scores_gemma":[0.6392802,0.000017334109,0.3604652,0.000011827828,0.000007967874,0.000014723257,4.1477674e-7,0.0000132734995,0.00018906387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989164,0.000048218797,0.0002920648,0.00020806641,0.00027357528,0.00026170566],"domain_scores_gemma":[0.99887985,0.0001139397,0.00015567939,0.0006941752,0.00008217273,0.00007420242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005309733,0.000110386856,0.00019798563,0.00012653855,0.000055345903,0.000027629128,0.0009704844,0.000041356016,0.00004799256],"category_scores_gemma":[0.00014410302,0.000093808136,0.00009013675,0.00027187847,0.00010647792,0.00034965845,0.00033860837,0.00010451976,0.000027371138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027483666,0.000075886586,0.00034339004,0.00016836642,0.000022335898,0.000010156865,0.0060551544,0.0000030049996,0.002101679,0.9893933,0.0000128553975,0.0018111406],"study_design_scores_gemma":[0.00013126186,0.00011110861,0.0006858113,0.000096413525,0.00000798399,0.000017451677,0.00027675505,0.0075828307,0.06930004,0.9214872,0.00012341604,0.00017972809],"about_ca_topic_score_codex":0.000003016122,"about_ca_topic_score_gemma":4.6317282e-7,"teacher_disagreement_score":0.5598896,"about_ca_system_score_codex":0.000016910628,"about_ca_system_score_gemma":0.000021140135,"threshold_uncertainty_score":0.38253847},"labels":[],"label_agreement":null},{"id":"W2014252825","doi":"10.1016/s0304-3975(98)00342-9","title":"The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Victoria","funders":"","keywords":"Colored; Combinatorics; Parameterized complexity; Chordal graph; Mathematics; Pathwidth; Vertex (graph theory); Discrete mathematics; Upper and lower bounds; Tree (set theory); Bounded function; Graph; Line graph","score_opus":0.021004933285101487,"score_gpt":0.28023671478497736,"score_spread":0.25923178149987586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014252825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2731883,0.0002429994,0.7029465,0.0022774246,0.00052146526,0.0012287172,0.0000069086473,0.00021557687,0.019372152],"genre_scores_gemma":[0.9878764,0.000029386472,0.011370268,0.000495425,0.000028646173,0.0000300675,1.4123722e-7,0.000012527004,0.0001571015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966303,0.00039133284,0.000322932,0.00081926613,0.0011091067,0.0007270424],"domain_scores_gemma":[0.99759996,0.0006539372,0.00008775354,0.0012668092,0.00013803043,0.00025350074],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003213336,0.0002243304,0.0002481536,0.00016073076,0.00079653406,0.0004320896,0.0029304181,0.000054080145,0.000057759913],"category_scores_gemma":[0.000068396796,0.00013722682,0.00008100782,0.0012337123,0.0074659316,0.0003460953,0.0006459792,0.0002784033,0.000035767353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006953753,0.00007960652,0.0001278931,0.000009649899,0.000007756718,0.000003804036,0.00052297424,0.0005364802,0.0010403803,0.9503799,0.000042770083,0.047179256],"study_design_scores_gemma":[0.0005402875,0.001176791,0.0016457441,0.00008336615,0.0000048480097,0.000039507344,0.000015161674,0.19934043,0.0090632895,0.78635615,0.0014377327,0.00029670916],"about_ca_topic_score_codex":0.000004144034,"about_ca_topic_score_gemma":0.0000012446459,"teacher_disagreement_score":0.7146881,"about_ca_system_score_codex":0.000045959634,"about_ca_system_score_gemma":0.00009037793,"threshold_uncertainty_score":0.9952352},"labels":[],"label_agreement":null},{"id":"W2014294736","doi":"10.1287/moor.1080.0337","title":"Finding the Exact Integrality Gap for Small Traveling Salesman Problems","year":2008,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Mathematics; Conjecture; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Graph; Relaxation (psychology); Combinatorial optimization; Metric (unit); Discrete mathematics; Mathematical optimization","score_opus":0.38378126360936615,"score_gpt":0.4339300606441794,"score_spread":0.05014879703481323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014294736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1366117,0.00007588714,0.8590629,0.0011807136,0.000035618377,0.0013309023,0.000009561661,0.000044438075,0.0016482408],"genre_scores_gemma":[0.7081387,0.00005355176,0.2897903,0.000013247257,0.00003538082,0.00038059065,0.000007428164,0.000019483781,0.0015613219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975859,0.00031354188,0.00046836332,0.00032848987,0.00076836394,0.00053534145],"domain_scores_gemma":[0.99592185,0.0018507036,0.000045078734,0.0010808972,0.0010087368,0.00009273491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005256696,0.00012800132,0.00021990034,0.00027184284,0.0012894856,0.00018490755,0.001964526,0.00006198601,0.000017590206],"category_scores_gemma":[0.0017251321,0.00008709268,0.000109318156,0.0010259968,0.00050472404,0.0003303302,0.00040916193,0.00047037928,0.000025003588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075724793,0.00029135065,0.000077134886,0.00022224772,0.000034926976,0.0000033227564,0.012150365,0.007173084,0.014607787,0.96340597,0.00017506306,0.0018511578],"study_design_scores_gemma":[0.00050431397,0.00028906035,0.00017722874,0.00016219907,0.0000049561045,0.00005775482,0.0013274355,0.70694757,0.021880167,0.2678207,0.0005955802,0.00023306161],"about_ca_topic_score_codex":0.000038508093,"about_ca_topic_score_gemma":0.00009982789,"teacher_disagreement_score":0.69977444,"about_ca_system_score_codex":0.000068742,"about_ca_system_score_gemma":0.0002647111,"threshold_uncertainty_score":0.9917811},"labels":[],"label_agreement":null},{"id":"W2014824669","doi":"10.1016/j.jctb.2012.10.002","title":"Cops and robbers in a random graph","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Hungarian Scientific Research Fund; Nemzeti Kutatási és Technológiai Hivatal; Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Random graph; Random regular graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.010801777342243853,"score_gpt":0.2653487859544998,"score_spread":0.25454700861225593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014824669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8713535,0.0069855466,0.10033463,0.0010600947,0.014015038,0.00047284111,0.0000016747204,0.0000722429,0.005704438],"genre_scores_gemma":[0.99629974,0.00019237061,0.0031085622,0.000050862272,0.00025905363,0.0000032881449,1.1137855e-7,0.000010351685,0.00007562724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805397,0.0006443473,0.00041087746,0.000115766234,0.0003853995,0.00038963687],"domain_scores_gemma":[0.99843824,0.0006900598,0.00023968922,0.00025306188,0.00015007328,0.00022889205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041059237,0.00013541126,0.00034248523,0.00035186578,0.000088739514,0.00008570558,0.00064229546,0.00006828496,0.000018176339],"category_scores_gemma":[0.00048696468,0.00011031311,0.00009400569,0.00054429827,0.00022381172,0.0023986802,0.000196354,0.00039629568,0.0000027526937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012484174,0.000094985684,0.0019627286,0.0000075263583,0.000027528384,0.000026988411,0.0012880937,0.000013681446,0.0004891995,0.99229884,0.00007291816,0.002469115],"study_design_scores_gemma":[0.0035976204,0.00033991702,0.0009861059,0.00003572448,0.000006391486,0.00024235484,0.0002723699,0.000009488355,0.0018835904,0.98865974,0.003833854,0.00013285327],"about_ca_topic_score_codex":0.0000012227913,"about_ca_topic_score_gemma":6.0453254e-7,"teacher_disagreement_score":0.124946274,"about_ca_system_score_codex":0.00004586287,"about_ca_system_score_gemma":0.00008381788,"threshold_uncertainty_score":0.4498438},"labels":[],"label_agreement":null},{"id":"W2014924232","doi":"10.1016/j.jctb.2014.06.004","title":"Colouring graphs when the number of colours is almost the maximum degree","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Degree (music); Chromatic scale; Constant (computer programming); Discrete mathematics","score_opus":0.018647920120497957,"score_gpt":0.27657573051166157,"score_spread":0.25792781039116364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014924232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8387158,0.00092033244,0.09333359,0.01825756,0.01897313,0.0010318762,0.000012648655,0.00011801009,0.028637063],"genre_scores_gemma":[0.9964766,0.0000696171,0.0023907714,0.00035436626,0.00032638313,0.0000074266313,1.6898679e-7,0.000023553474,0.00035110154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962865,0.0014291137,0.00067741453,0.00020369522,0.0009737093,0.0004295524],"domain_scores_gemma":[0.99512357,0.0022236898,0.0008275607,0.000963311,0.0007225845,0.00013931708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061865444,0.00022106164,0.00043609255,0.00011991885,0.0004659511,0.00017906551,0.003559301,0.00010007022,0.00011168463],"category_scores_gemma":[0.0008278637,0.00012276895,0.00030992535,0.0006054139,0.0008595876,0.0008867002,0.0005586373,0.0007018466,0.000013761851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057434733,0.000073184085,0.0008369131,0.000011933623,0.00011283695,0.000010508828,0.002106849,0.000020966245,0.00032908184,0.9895631,0.001244803,0.0051154643],"study_design_scores_gemma":[0.0008949708,0.00047809363,0.0005890559,0.000044578035,0.000026625017,0.00024027897,0.0005933679,0.00004663517,0.0064378236,0.9721114,0.018398419,0.00013873512],"about_ca_topic_score_codex":0.0000050775934,"about_ca_topic_score_gemma":0.0000018177678,"teacher_disagreement_score":0.15776081,"about_ca_system_score_codex":0.000048501683,"about_ca_system_score_gemma":0.0001622457,"threshold_uncertainty_score":0.6614126},"labels":[],"label_agreement":null},{"id":"W2015119735","doi":"10.1016/j.aam.2013.10.001","title":"Dominating circuits in regular matroids","year":2013,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Vertex (graph theory); Disjoint sets; Simple graph; Graphic matroid; Graph; Matroid partitioning; Discrete mathematics; Connectivity","score_opus":0.011976984798428804,"score_gpt":0.2799651368871039,"score_spread":0.2679881520886751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015119735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0508067,0.00087297504,0.8951569,0.00015168425,0.00011047775,0.0011343374,7.418153e-7,0.00018261356,0.051583566],"genre_scores_gemma":[0.5849633,0.0000936887,0.4144722,0.000050938426,0.000015218042,0.00030176647,6.226326e-7,0.000019041254,0.00008320281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980363,0.000034155742,0.00052035623,0.00042658445,0.00040964372,0.000572924],"domain_scores_gemma":[0.99830693,0.00064103404,0.00014695791,0.00078650774,0.000040090978,0.000078505385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006868228,0.00019773135,0.00031754532,0.00034344854,0.000056299956,0.000096854004,0.0012181696,0.00007053721,0.000024828623],"category_scores_gemma":[0.00017163165,0.00018814768,0.000036416626,0.0010874964,0.00011545813,0.0008973396,0.00035226045,0.0003125043,0.00019670819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001112457,0.00010148218,0.00025643513,0.00013975952,0.0000016704067,0.000009804688,0.0011231584,0.0006542442,0.0038210177,0.87793785,0.000009870361,0.115943566],"study_design_scores_gemma":[0.00048838125,0.000019036946,0.000216551,0.00010794618,7.776087e-7,0.000009457983,0.00060058216,0.02070641,0.003443982,0.9739599,0.00021532919,0.00023160843],"about_ca_topic_score_codex":0.0000027276858,"about_ca_topic_score_gemma":0.000011256847,"teacher_disagreement_score":0.5341566,"about_ca_system_score_codex":0.0001019572,"about_ca_system_score_gemma":0.000027172302,"threshold_uncertainty_score":0.767244},"labels":[],"label_agreement":null},{"id":"W2015142077","doi":"10.1016/s0166-218x(01)00299-2","title":"Pushing vertices in digraphs without long induced cycles","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Digraph; Bipartite graph; Mathematics; Chordal graph; Characterization (materials science); Discrete mathematics; Permutation (music); Class (philosophy); Permutation graph; Graph; Computer science","score_opus":0.04205290952623685,"score_gpt":0.29742326292808546,"score_spread":0.2553703534018486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015142077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6166109,0.00016350497,0.353464,0.0002708858,0.000072523064,0.0006391861,0.0000018128387,0.00032584238,0.028451346],"genre_scores_gemma":[0.9174246,0.000027792472,0.08229164,0.000070824455,0.000018607534,0.00008166144,0.0000011749207,0.000028377426,0.000055288183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979943,0.000037029615,0.00041680556,0.0004499037,0.00052880007,0.00057317043],"domain_scores_gemma":[0.9985048,0.00028350097,0.00013867859,0.0009074054,0.000031182273,0.00013442308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045742473,0.00023710255,0.00032051743,0.00029948508,0.00013153971,0.00024774284,0.0013011303,0.00008794592,0.000027736854],"category_scores_gemma":[0.000085597625,0.00020773665,0.0000691792,0.000875762,0.000095395066,0.0005715487,0.00039494384,0.00033894865,0.00013394248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009692699,0.00025103128,0.001616841,0.00018857255,0.000035747373,0.000041446234,0.01014267,0.00016522194,0.015006544,0.952437,0.0000345049,0.020070774],"study_design_scores_gemma":[0.0015632656,0.000094177834,0.0031666134,0.00027235624,0.000020994958,0.000031499283,0.0016047425,0.1794169,0.02522661,0.7873655,0.00012934725,0.001107985],"about_ca_topic_score_codex":0.000005050543,"about_ca_topic_score_gemma":0.000029882929,"teacher_disagreement_score":0.30081373,"about_ca_system_score_codex":0.00004016293,"about_ca_system_score_gemma":0.000011305197,"threshold_uncertainty_score":0.8471255},"labels":[],"label_agreement":null},{"id":"W2015153338","doi":"10.1016/j.disc.2011.06.016","title":"The adaptable choosability number grows with the choosability number","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multigraph; Integer (computer science); Colored; Infinity; Discrete mathematics; Graph; Computer science","score_opus":0.034086144093716846,"score_gpt":0.2841479216427549,"score_spread":0.250061777549038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015153338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15107596,0.00008232684,0.67863727,0.0029583352,0.00024737415,0.0018734082,0.000014028997,0.00047297045,0.16463831],"genre_scores_gemma":[0.9192292,0.00001521662,0.07845355,0.000117557276,0.00004889574,0.00021566042,0.0000014444175,0.00003976304,0.0018786809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997189,0.00032466475,0.00041382376,0.00053576933,0.00079339196,0.0007433607],"domain_scores_gemma":[0.9953183,0.0010677979,0.00020102311,0.0030159277,0.00022523325,0.0001717376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023192663,0.00030134464,0.00028652116,0.000016902504,0.0008240288,0.00029355247,0.0027912299,0.00007340042,0.00023502106],"category_scores_gemma":[0.0003519533,0.00013875628,0.00015033511,0.0006754789,0.000963947,0.00062714994,0.00073421665,0.0004876633,0.00042893345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043457578,0.00019154453,0.006604495,0.00006523732,0.000065167886,0.0000058380206,0.005088523,0.000009492854,0.000023862034,0.9855645,0.00086355105,0.001474341],"study_design_scores_gemma":[0.00040045578,0.00008374458,0.0057068244,0.00004003313,0.000027531554,0.00007899507,0.0027195807,0.0092324605,0.0015352295,0.97514397,0.004575182,0.0004560184],"about_ca_topic_score_codex":0.000056986726,"about_ca_topic_score_gemma":0.00008769515,"teacher_disagreement_score":0.76815325,"about_ca_system_score_codex":0.00009478016,"about_ca_system_score_gemma":0.000093230956,"threshold_uncertainty_score":0.63378465},"labels":[],"label_agreement":null},{"id":"W2015471596","doi":"10.1145/2462356.2462381","title":"Robust geometric spanners","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Robustness (evolution); Combinatorics; Treewidth; Mathematics; Computer science; Dimension (graph theory); Graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.04245050275022487,"score_gpt":0.2705574150106879,"score_spread":0.22810691226046304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015471596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010304346,0.000053167827,0.9419074,0.0010661585,0.00009363013,0.00013841539,1.09619734e-7,0.00021160708,0.046225183],"genre_scores_gemma":[0.7389711,0.000011986758,0.24691886,0.00044357174,0.000030027531,0.000036632562,3.9508137e-7,0.000008222431,0.013579192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990717,0.00003197071,0.000087270724,0.00024260665,0.00024530754,0.00032111767],"domain_scores_gemma":[0.9991298,0.000120999925,0.00001723349,0.0005103547,0.00009564231,0.00012600535],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017408031,0.000066440814,0.00006798636,0.00036973142,0.000064336455,0.00014303054,0.00096834253,0.000024560668,0.000614316],"category_scores_gemma":[0.00008313823,0.00005173704,0.000033386354,0.0018018121,0.00004445081,0.0008300134,0.00030001317,0.00009670926,0.0028236676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001263142,0.00005409238,0.0014753465,0.0000061268665,0.000012970011,0.000009251379,0.000067585,0.0015348672,0.000923153,0.746783,0.019909453,0.22922286],"study_design_scores_gemma":[0.001165688,0.0003973594,0.04216792,0.00001457788,0.0000034401162,0.0000642587,0.00026451136,0.27728018,0.0240247,0.62780464,0.025653787,0.0011589387],"about_ca_topic_score_codex":0.000042684704,"about_ca_topic_score_gemma":0.00000154344,"teacher_disagreement_score":0.7286668,"about_ca_system_score_codex":0.000020031252,"about_ca_system_score_gemma":0.000017818247,"threshold_uncertainty_score":0.99795276},"labels":[],"label_agreement":null},{"id":"W2015501288","doi":"10.1287/opre.1080.0635","title":"Conflict Resolution in the Scheduling of Television Commercials","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Association of Canadian Universities for Research in Astronomy","keywords":"Weighting; Combinatorics; Scheduling (production processes); Partition (number theory); Mathematics; Extension (predicate logic); Computer science; Upper and lower bounds; Generalization; Mathematical optimization","score_opus":0.15234418232633448,"score_gpt":0.45514144534738327,"score_spread":0.3027972630210488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015501288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45546088,0.0012474043,0.49807057,0.029399406,0.000075561875,0.001840248,0.000007498302,0.00006675261,0.0138316825],"genre_scores_gemma":[0.9762471,0.00011903773,0.023295976,0.00013150794,0.000032619864,0.000030349893,0.000004024786,0.0000033252963,0.0001360606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687797,0.0013182954,0.0002710792,0.00025207584,0.00090438087,0.00037621293],"domain_scores_gemma":[0.99809504,0.0005924526,0.000014305925,0.000793056,0.00045787933,0.000047256628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00638272,0.00006539719,0.00011580643,0.0005106881,0.00045495512,0.00019708577,0.0014436858,0.000051152125,0.000016623375],"category_scores_gemma":[0.00091133796,0.00004719998,0.00003400127,0.0022916882,0.00017383261,0.0005294493,0.00016076126,0.0005121354,0.00003827526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019780471,0.0001966877,0.000114044575,0.00000557945,0.0000024486842,0.000008247309,0.0023399177,0.018320734,0.0336749,0.8940163,0.0002473265,0.051054012],"study_design_scores_gemma":[0.0013731527,0.0013616984,0.02779611,0.00020510105,0.0000023599173,0.000030717467,0.0018974219,0.86375207,0.024692018,0.06913292,0.009393587,0.00036286225],"about_ca_topic_score_codex":0.0000916537,"about_ca_topic_score_gemma":0.00007936062,"teacher_disagreement_score":0.8454313,"about_ca_system_score_codex":0.00005122437,"about_ca_system_score_gemma":0.00012571737,"threshold_uncertainty_score":0.3499193},"labels":[],"label_agreement":null},{"id":"W2015593095","doi":"10.1002/jgt.10079","title":"3‐colorability of 4‐regular hamiltonian graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Pancyclic graph; Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.02249071109048013,"score_gpt":0.2640508079551846,"score_spread":0.24156009686470448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015593095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6710443,0.0051140273,0.31728166,0.0008844101,0.0007743471,0.00029062972,0.0000064702795,0.00007284905,0.0045313127],"genre_scores_gemma":[0.9808008,0.00024317714,0.018643267,0.00009558024,0.000037392787,0.0000024422216,1.045807e-7,0.00001433588,0.00016292173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701834,0.0007876408,0.0007673167,0.00025367158,0.00077862997,0.00039438478],"domain_scores_gemma":[0.9970377,0.0006497898,0.0006257135,0.00090126187,0.0005520739,0.00023344689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037994739,0.00018311893,0.00045507937,0.00083346496,0.00012360749,0.000045582892,0.0020140351,0.00009277522,0.00015100946],"category_scores_gemma":[0.00040611747,0.00014671359,0.0005054748,0.0014038042,0.00063477305,0.0008502421,0.00020308781,0.00048699242,0.000012750212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012178076,0.0003629242,0.0020431278,0.000036819692,0.00012641255,0.0000755242,0.0008670288,0.00011243882,0.006985707,0.9503661,0.00041108252,0.038491055],"study_design_scores_gemma":[0.0005964647,0.0005392671,0.0049198624,0.00004926071,0.000016352491,0.0001582555,0.00010671619,0.00029156657,0.006964281,0.98543745,0.0007678575,0.00015266673],"about_ca_topic_score_codex":0.0000010792116,"about_ca_topic_score_gemma":0.0000011489745,"teacher_disagreement_score":0.3097565,"about_ca_system_score_codex":0.000037565966,"about_ca_system_score_gemma":0.00003942161,"threshold_uncertainty_score":0.59828067},"labels":[],"label_agreement":null},{"id":"W2015635736","doi":"10.1016/s0012-365x(01)00073-5","title":"Homomorphisms to powers of digraphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Bishop's University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Chromatic scale; Discrete mathematics; Homomorphic encryption; Path (computing); Polynomial; Power (physics); Computer science; Encryption","score_opus":0.029800373251303396,"score_gpt":0.2820215675189948,"score_spread":0.2522211942676914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015635736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02886391,0.0001235292,0.94546497,0.0005898357,0.00009267884,0.0003241096,0.000010696322,0.00012908311,0.02440118],"genre_scores_gemma":[0.7465132,0.00001709622,0.25241286,0.00009922501,0.000010386956,0.000018788614,6.9819424e-7,0.000017592307,0.00091015495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986883,0.000033581568,0.00028588605,0.00023516436,0.00044444492,0.0003126373],"domain_scores_gemma":[0.99857026,0.00016857058,0.000091785434,0.0009317633,0.00008314267,0.00015449803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025640312,0.00012963392,0.00022120595,0.00021509094,0.000059255188,0.000050736926,0.001139421,0.00003519857,0.00010241819],"category_scores_gemma":[0.00015245494,0.0001093724,0.00010086613,0.0008349297,0.000102221085,0.00021777806,0.00029574442,0.00009738809,0.00020598438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021218714,0.000105717874,0.00004793717,0.000061615545,0.00002078935,0.000011614739,0.004278043,0.00007526897,0.0018913468,0.9888123,0.00073770265,0.003955494],"study_design_scores_gemma":[0.0005696478,0.00048036408,0.00017306712,0.00018814976,0.000015685031,0.000042969717,0.00079543795,0.0759214,0.023435578,0.89480215,0.0029232022,0.00065234414],"about_ca_topic_score_codex":0.0000012241909,"about_ca_topic_score_gemma":6.592128e-7,"teacher_disagreement_score":0.7176493,"about_ca_system_score_codex":0.000014374777,"about_ca_system_score_gemma":0.000006584014,"threshold_uncertainty_score":0.4460077},"labels":[],"label_agreement":null},{"id":"W2015784652","doi":"10.1016/j.disc.2009.05.007","title":"The firefighter problem for cubic graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Vertex (graph theory); Graph; Discrete mathematics; Time complexity","score_opus":0.02183635650630993,"score_gpt":0.30538479815737224,"score_spread":0.2835484416510623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015784652","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020058763,0.00022216351,0.98576695,0.0036006365,0.00007985926,0.0007952986,0.0000052884566,0.00018277633,0.007341169],"genre_scores_gemma":[0.22498375,0.00007622429,0.7705658,0.00048032956,0.000066946785,0.00024489514,0.0000056787017,0.000034633078,0.0035417192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867755,0.000036936224,0.00026746318,0.0002486935,0.00031601216,0.00045332452],"domain_scores_gemma":[0.9983681,0.0004934914,0.00009896515,0.0008590772,0.00009779296,0.000082614744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061862665,0.00014572176,0.0001508418,0.00006017521,0.0004187474,0.00027781626,0.0013482423,0.000040484654,0.0000033972585],"category_scores_gemma":[0.00010411312,0.00008537164,0.00013511012,0.00033866853,0.00008937671,0.00027562954,0.000116892545,0.000119708755,0.00003283622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046777577,0.00002867802,0.0000030968715,0.000022642922,0.00000970855,0.0000012299374,0.0006008496,0.000009558716,0.00029801574,0.98254913,0.0008498476,0.015622583],"study_design_scores_gemma":[0.00017557743,0.00012320548,0.00002582059,0.000024873974,0.000004217182,0.000006999899,0.000051749612,0.022913147,0.0013375736,0.96869665,0.006509933,0.00013025002],"about_ca_topic_score_codex":2.2380591e-7,"about_ca_topic_score_gemma":0.0000011343486,"teacher_disagreement_score":0.22297788,"about_ca_system_score_codex":0.000017220447,"about_ca_system_score_gemma":0.000024070581,"threshold_uncertainty_score":0.34813544},"labels":[],"label_agreement":null},{"id":"W2015967296","doi":"10.1016/j.disopt.2005.08.008","title":"Berge’s theorem for the maximum charge problem","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Mathematics; Generalization; Combinatorics; Charge (physics); Graph; Matching (statistics); Discrete mathematics; Mathematical analysis; Statistics; Quantum mechanics; Physics","score_opus":0.011853492358565813,"score_gpt":0.2624375729190806,"score_spread":0.2505840805605148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015967296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004269584,0.00015569078,0.9901495,0.0020115247,0.00011766982,0.00072748004,0.000010475843,0.00013693872,0.006648043],"genre_scores_gemma":[0.15684378,0.00008280433,0.83694595,0.000299849,0.00027160093,0.00063615065,0.00013956799,0.000058862275,0.004721412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889207,0.000061856124,0.0001782319,0.000305575,0.0002364664,0.00032581834],"domain_scores_gemma":[0.9990562,0.00018587406,0.00008127585,0.00049998664,0.0001407595,0.000035871188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004488966,0.00011803397,0.00009082053,0.000072123505,0.00034885496,0.00017051006,0.00074936746,0.000042630814,0.000042229694],"category_scores_gemma":[0.000039861363,0.00007956,0.00007469219,0.00044129512,0.0000793549,0.0005069401,0.0001317729,0.00007919474,0.000016216134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013726218,0.00001501206,0.000040562263,0.000006921211,0.000007052126,4.1055526e-7,0.00006619934,0.28003088,0.00009977879,0.715303,0.00055002334,0.0038664648],"study_design_scores_gemma":[0.00027309818,0.000038360115,0.00004181915,0.00000640331,0.0000049898126,0.0000019318366,0.000013871437,0.80222696,0.0008378217,0.19280858,0.003628142,0.00011800127],"about_ca_topic_score_codex":0.000012308842,"about_ca_topic_score_gemma":0.00000538228,"teacher_disagreement_score":0.5224944,"about_ca_system_score_codex":0.000026795888,"about_ca_system_score_gemma":0.000026978701,"threshold_uncertainty_score":0.32443625},"labels":[],"label_agreement":null},{"id":"W2016857938","doi":"10.1016/j.disc.2011.05.032","title":"Cycles in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-traceable oriented graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of South Africa","keywords":"Combinatorics; Tournament; Digraph; Mathematics; Conjecture; Vertex (graph theory); Girth (graph theory); Order (exchange); Discrete mathematics; Graph","score_opus":0.025869409061803416,"score_gpt":0.2693643896109582,"score_spread":0.2434949805491548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016857938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9449077,0.00019394277,0.04878656,0.00010177271,0.00038173786,0.00015354207,0.000049007936,0.00025521746,0.005170492],"genre_scores_gemma":[0.9194545,0.00014975516,0.07951639,0.000175674,0.000096470816,0.00022886929,0.00004974581,0.00013657146,0.0001920327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602383,0.00012944812,0.0008733064,0.0008188536,0.0010674815,0.0010870759],"domain_scores_gemma":[0.99675596,0.00051893777,0.0005017191,0.0017982017,0.00009771753,0.0003274722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011879513,0.00045072022,0.00036415685,0.0003134879,0.00041411843,0.0003067698,0.0017731772,0.00034734048,0.00005419781],"category_scores_gemma":[0.00046947898,0.0004766533,0.00039772986,0.0009849407,0.00047014712,0.0010660815,0.001103274,0.0006585837,0.00068869453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008768506,0.00028791823,0.000066228415,0.00031795417,0.00010673752,0.00021839527,0.0043355394,0.00020024604,0.0007286704,0.99296725,0.000120364486,0.00056301354],"study_design_scores_gemma":[0.0006709327,0.0002901483,0.00012454494,0.00039513133,0.000055134846,0.00012332067,0.0010597233,0.88719296,0.008229007,0.1009556,0.00039496346,0.00050854846],"about_ca_topic_score_codex":0.00009584973,"about_ca_topic_score_gemma":0.000101505066,"teacher_disagreement_score":0.89201164,"about_ca_system_score_codex":0.000025375804,"about_ca_system_score_gemma":0.00018718034,"threshold_uncertainty_score":0.9997685},"labels":[],"label_agreement":null},{"id":"W2016874427","doi":"10.1016/j.disc.2008.02.004","title":"Circle graphs and the cycle double cover conjecture","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Eulerian path; Graph; Cover (algebra); Discrete mathematics; Pure mathematics","score_opus":0.019056370746055845,"score_gpt":0.2714743867348818,"score_spread":0.25241801598882596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016874427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3008598,0.000784434,0.6729333,0.0022281727,0.00015137532,0.00089221104,0.000008126635,0.0003162959,0.02182628],"genre_scores_gemma":[0.9777948,0.00010438213,0.021131195,0.00020447027,0.000014528409,0.0000325219,0.0000011959379,0.0000163198,0.0007005379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885744,0.000061666804,0.00019451366,0.00024572673,0.00035215213,0.0002885057],"domain_scores_gemma":[0.9986597,0.00037059383,0.00007974885,0.0007586358,0.00004620372,0.00008514847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042243925,0.00013021273,0.00021164484,0.000061005176,0.00034797358,0.000104785475,0.00074831647,0.000045500114,0.000019446148],"category_scores_gemma":[0.000060935632,0.00008335964,0.00008176369,0.00035415762,0.00061824045,0.00028035426,0.00034636768,0.00019132816,0.00006502219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021198228,0.000022031456,0.000061790284,0.000029930126,0.000021833088,0.000016387856,0.0041468064,0.00008552214,0.00006320728,0.99485385,0.00022095631,0.00045646928],"study_design_scores_gemma":[0.0019625064,0.00003321944,0.00024153075,0.00001914696,0.000007607283,0.00020236088,0.0001336235,0.028905919,0.00093043287,0.96687704,0.00051144505,0.00017518757],"about_ca_topic_score_codex":0.000005685675,"about_ca_topic_score_gemma":0.0000013175086,"teacher_disagreement_score":0.676935,"about_ca_system_score_codex":0.000009751113,"about_ca_system_score_gemma":0.00002634208,"threshold_uncertainty_score":0.33993077},"labels":[],"label_agreement":null},{"id":"W2016898545","doi":"10.1007/s00453-010-9435-8","title":"Subgraphs of 4-Regular Planar Graphs","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Planar graph; Combinatorics; Outerplanar graph; Planar straight-line graph; Book embedding; Mathematics; Graph; Line graph; Discrete mathematics; Butterfly graph; Planar; Computer science; Voltage graph; 1-planar graph","score_opus":0.00926994731122339,"score_gpt":0.2584284739058766,"score_spread":0.2491585265946532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016898545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29073927,0.0002565321,0.6994094,0.0011334477,0.0013045641,0.0004881489,0.000029111772,0.00045654585,0.006182957],"genre_scores_gemma":[0.7699878,0.000012497569,0.22966133,0.00007708967,0.000046575507,0.000016161322,0.000003676672,0.000016508058,0.00017831994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985182,0.00006005603,0.00022638349,0.0003825365,0.0004246134,0.00038817796],"domain_scores_gemma":[0.9983479,0.0001680296,0.000083924104,0.0011011268,0.00014485,0.00015417073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004232553,0.0001380073,0.00019373772,0.0003194936,0.00009517619,0.000036082776,0.0015851889,0.000089295325,0.000036719535],"category_scores_gemma":[0.000066575296,0.00012660399,0.00012322032,0.0009217268,0.00030078404,0.00034265217,0.00017500465,0.00036591818,0.00004452488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072287085,0.000064353066,0.00042776068,0.000008788694,0.000025081134,0.000020603302,0.00012167754,0.000002183109,0.06825943,0.86305135,0.0003837905,0.06762773],"study_design_scores_gemma":[0.00044993949,0.00014401034,0.0028827228,0.000010116349,0.0000057498696,0.000054631353,0.000021998636,0.0038715152,0.15532455,0.8296596,0.0072936406,0.00028156076],"about_ca_topic_score_codex":0.000020384583,"about_ca_topic_score_gemma":0.000010899502,"teacher_disagreement_score":0.47924858,"about_ca_system_score_codex":0.000005346861,"about_ca_system_score_gemma":0.000043028023,"threshold_uncertainty_score":0.51627606},"labels":[],"label_agreement":null},{"id":"W2017143580","doi":"10.1007/s10878-011-9386-2","title":"Some results on the injective chromatic number of graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Injective function; Combinatorics; Mathematics; Chromatic scale; Graph; Vertex (graph theory); Monomorphism; Edge coloring; Brooks' theorem; Discrete mathematics; Graph power; Line graph","score_opus":0.025532179805133403,"score_gpt":0.2815818603931285,"score_spread":0.2560496805879951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017143580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12492523,0.00015698184,0.84592295,0.0017016438,0.0108143445,0.0009414557,0.0000081838825,0.000084229156,0.015444976],"genre_scores_gemma":[0.94688666,0.000051403804,0.052834924,0.00005881578,0.00013451619,0.000003051397,4.3112837e-7,0.000010915955,0.000019307116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982506,0.0003447573,0.0005373255,0.000120750345,0.0005933347,0.000153247],"domain_scores_gemma":[0.997693,0.00045864814,0.00075973244,0.00036552417,0.0006393985,0.00008370196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012705516,0.000101838596,0.00021219083,0.00019887196,0.00009064655,0.00003485965,0.0008651792,0.000058193542,0.000018018509],"category_scores_gemma":[0.0010452828,0.00006719391,0.00011362801,0.00068066607,0.00010322052,0.00082590256,0.0000912156,0.000256807,0.0000060700227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037998732,0.00021784386,0.00006134139,0.000005718979,0.00004557848,0.0000072963653,0.0013765317,0.010249707,0.00007593691,0.98706007,0.00028766625,0.0002323471],"study_design_scores_gemma":[0.0014720117,0.00080778974,0.0002564678,0.00007459145,0.000011112248,0.00002613713,0.000061756575,0.0120138265,0.0060204696,0.9791456,0.000020488422,0.00008977052],"about_ca_topic_score_codex":0.0000032857868,"about_ca_topic_score_gemma":4.0935973e-8,"teacher_disagreement_score":0.8219614,"about_ca_system_score_codex":0.000050362763,"about_ca_system_score_gemma":0.0001286079,"threshold_uncertainty_score":0.2740088},"labels":[],"label_agreement":null},{"id":"W2017360257","doi":"10.1016/j.tcs.2011.11.010","title":"On sum coloring and sum multi-coloring for restricted families of graphs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy coloring; Complete coloring; Combinatorics; Graph coloring; Mathematics; Brooks' theorem; Fractional coloring; Edge coloring; List coloring; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.04880908630460297,"score_gpt":0.30058764518823616,"score_spread":0.2517785588836332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017360257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33073884,0.000018701054,0.6679817,0.000040970855,0.00023816642,0.00031354645,0.000002575015,0.00009882388,0.0005667008],"genre_scores_gemma":[0.7355984,0.000011493031,0.26428577,0.000053556945,0.000013054163,0.000024281535,2.1059476e-7,0.000008338646,0.0000049148593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974886,0.00011005783,0.00031784,0.00080403325,0.0005590225,0.0007204228],"domain_scores_gemma":[0.9975166,0.0010341383,0.00009364794,0.0007709535,0.00031431043,0.00027036807],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013750545,0.000201442,0.00027812753,0.00054928137,0.00040743157,0.00011289621,0.002154548,0.000058508424,0.0000048601146],"category_scores_gemma":[0.0003910319,0.00016853375,0.00007143421,0.0015855714,0.004140525,0.00061435916,0.0011085909,0.00021016267,0.0000042461725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008415584,0.000099229044,0.0003274789,0.000020442661,0.000005712973,0.0000051513366,0.0008210022,0.000043236734,0.0026359875,0.98561573,0.0000027217757,0.010339155],"study_design_scores_gemma":[0.0007486269,0.0012570379,0.008240324,0.00006404598,0.0000050059302,0.000010131288,0.000035891815,0.23467055,0.050402004,0.7042824,0.000012077131,0.00027189136],"about_ca_topic_score_codex":0.0000068648787,"about_ca_topic_score_gemma":0.0000013268628,"teacher_disagreement_score":0.40485954,"about_ca_system_score_codex":0.000035112083,"about_ca_system_score_gemma":0.00008175558,"threshold_uncertainty_score":0.9985696},"labels":[],"label_agreement":null},{"id":"W2017923854","doi":"10.1016/j.disc.2014.10.002","title":"Cycle-maximal triangle-free graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Counterexample; Conjecture; Discrete mathematics; Homomorphism; Upper and lower bounds; Vertex (graph theory); Graph","score_opus":0.019972228845571226,"score_gpt":0.2811180102016201,"score_spread":0.2611457813560489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017923854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0085403295,0.00005072134,0.9592845,0.00088916667,0.00015165038,0.00024639632,0.000006266294,0.00032706556,0.030503899],"genre_scores_gemma":[0.4014038,0.000014518623,0.596947,0.0003478355,0.00009837474,0.00006442139,0.000005493438,0.00005756445,0.001060932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798965,0.00013611985,0.0003761901,0.00039073764,0.0005925369,0.00051478983],"domain_scores_gemma":[0.9969947,0.00052501995,0.0001457501,0.0020609398,0.00008689014,0.0001867501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010725749,0.00021193844,0.0003256258,0.0002025759,0.00017099813,0.0002019121,0.0025073495,0.00007023437,0.000035859845],"category_scores_gemma":[0.00091746676,0.00017360934,0.00017766401,0.0006121547,0.00015171284,0.00044006627,0.00076458143,0.00021519286,0.00021640939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048856564,0.00005106202,0.000025599476,0.000047270623,0.000015948315,0.0000061533556,0.00057707896,0.000037834354,0.00025330734,0.9922083,0.0005434962,0.0062290793],"study_design_scores_gemma":[0.0005472393,0.00009205441,0.000048598242,0.000025952,0.0000065405607,0.00001922512,0.00005212655,0.06926189,0.0009737606,0.9263952,0.0023522216,0.00022520164],"about_ca_topic_score_codex":0.0000020062482,"about_ca_topic_score_gemma":0.0000026912876,"teacher_disagreement_score":0.3928635,"about_ca_system_score_codex":0.000022201513,"about_ca_system_score_gemma":0.000024684166,"threshold_uncertainty_score":0.70795834},"labels":[],"label_agreement":null},{"id":"W2018074536","doi":"10.1017/s0963548301004965","title":"The Chromatic Number of Graph Powers","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Mathematics; Graph; Combinatorics; Chromatic scale; Friendship graph; Windmill graph; Discrete mathematics; Graph power; Line graph","score_opus":0.028188386149385156,"score_gpt":0.28389335437364815,"score_spread":0.255704968224263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018074536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6868468,0.00085563655,0.29645047,0.0011175472,0.0012742694,0.0009092809,0.0000011368544,0.0004526078,0.012092278],"genre_scores_gemma":[0.9890395,0.000022251248,0.010784032,0.000026070287,0.000014154188,0.000007484587,2.6940702e-7,0.000012758798,0.00009350313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973875,0.00037722127,0.0005437505,0.00047203564,0.0006426628,0.0005768278],"domain_scores_gemma":[0.9962804,0.0015064811,0.00024371319,0.0014853034,0.0003563167,0.00012778467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018614506,0.00018694779,0.00026555656,0.00007432451,0.0005842313,0.00012927376,0.002224397,0.00006593098,0.000013760008],"category_scores_gemma":[0.00076008943,0.00014625404,0.00015410599,0.0017070725,0.0004279413,0.0002878745,0.0008992896,0.00035683482,0.000051418316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024109847,0.00020390454,0.00867572,0.0000712141,0.000020943357,0.000003174162,0.00069757743,0.00016351313,0.000053453634,0.9758581,0.00016147485,0.014088535],"study_design_scores_gemma":[0.00029390116,0.000065070315,0.001509243,0.000030166248,0.000003012664,0.000016530184,0.000030752355,0.07472271,0.00040617833,0.92243236,0.00032338264,0.00016669078],"about_ca_topic_score_codex":0.0000049152727,"about_ca_topic_score_gemma":6.9542386e-7,"teacher_disagreement_score":0.30219272,"about_ca_system_score_codex":0.000116002375,"about_ca_system_score_gemma":0.00003428831,"threshold_uncertainty_score":0.59640664},"labels":[],"label_agreement":null},{"id":"W2018084637","doi":"10.1016/j.ejc.2004.07.014","title":"Homomorphism bounded classes of graphs","year":2005,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Bounded function; Planar graph; Discrete mathematics; 1-planar graph; Graph; Class (philosophy); Chordal graph","score_opus":0.020602692775760423,"score_gpt":0.26433551195402494,"score_spread":0.2437328191782645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018084637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42331225,0.0031755876,0.5361601,0.0019811178,0.0016936633,0.00016823295,0.0000025861345,0.00009426495,0.03341216],"genre_scores_gemma":[0.9829383,0.00020695478,0.016440906,0.00007731301,0.00006583197,2.101856e-7,1.6631238e-7,0.000020579944,0.00024973587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764067,0.00060737535,0.00062959164,0.00015065368,0.0006981924,0.00027351239],"domain_scores_gemma":[0.9978849,0.00020403757,0.00058160146,0.000498617,0.00063700345,0.0001938057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001961327,0.00013469903,0.00027425526,0.0004134622,0.000092942275,0.000080431564,0.0018956277,0.000019949415,0.000012935596],"category_scores_gemma":[0.00020898774,0.0001180631,0.00017725574,0.0008813929,0.00015764878,0.00074454874,0.00025831218,0.0004193782,0.000033448978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000291144,0.00027155573,0.00061355013,0.000014322327,0.00004409402,0.00026578063,0.00035386192,0.00011405452,0.0017120045,0.97662246,0.0019348094,0.018024385],"study_design_scores_gemma":[0.0040904814,0.0025254765,0.009256967,0.00017352737,0.00003277741,0.00091878895,0.000108147695,0.00095982465,0.018103559,0.8227426,0.14054812,0.00053975335],"about_ca_topic_score_codex":1.9721101e-7,"about_ca_topic_score_gemma":1.568492e-7,"teacher_disagreement_score":0.55962604,"about_ca_system_score_codex":0.000051939875,"about_ca_system_score_gemma":0.000104301245,"threshold_uncertainty_score":0.48144737},"labels":[],"label_agreement":null},{"id":"W2018251139","doi":"10.1016/s0012-365x(00)00083-2","title":"Forbidden minors to graphs with small feedback sets","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Constructive; Treewidth; Pathwidth; Minor (academic); Vertex (graph theory); Discrete mathematics; Chordal graph; 1-planar graph; Constructive proof; Robertson–Seymour theorem; Maximal independent set; Clique-sum; Indifference graph; Graph; Line graph; Computer science","score_opus":0.03692080333076946,"score_gpt":0.29245304638469843,"score_spread":0.25553224305392896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018251139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21385528,0.000031363576,0.7715837,0.00069884694,0.000053043637,0.00048677702,0.0000048178194,0.0002022662,0.0130839255],"genre_scores_gemma":[0.21171273,0.00001622834,0.7850556,0.0003289875,0.000024390269,0.00008232178,0.0000043397213,0.00005114884,0.0027242885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982298,0.000044380846,0.00025692466,0.0004156218,0.00047265374,0.0005806135],"domain_scores_gemma":[0.99823153,0.00017235897,0.00008618462,0.001112466,0.00011518264,0.00028226033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033908768,0.00022905754,0.00025120785,0.00022066072,0.00013922375,0.00018943974,0.0013909716,0.000050820046,0.000031144373],"category_scores_gemma":[0.000078218785,0.00016999527,0.00008004647,0.0010840268,0.00009177233,0.00028854562,0.00038503204,0.00015853351,0.0002749765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006131351,0.0002013051,0.0014800244,0.00016445461,0.00009455531,0.00022176463,0.0074612475,0.00033785094,0.00070468494,0.96273476,0.00080032845,0.025737735],"study_design_scores_gemma":[0.001078844,0.00076202396,0.0012404589,0.00029523365,0.00003012672,0.00036954103,0.0013274272,0.020044073,0.0036952563,0.96367246,0.006375215,0.00110932],"about_ca_topic_score_codex":0.0000063164516,"about_ca_topic_score_gemma":0.00004224617,"teacher_disagreement_score":0.024628414,"about_ca_system_score_codex":0.000030277753,"about_ca_system_score_gemma":0.000036262707,"threshold_uncertainty_score":0.6932206},"labels":[],"label_agreement":null},{"id":"W2018547288","doi":"10.1002/jgt.10073","title":"Bi‐arc graphs and the complexity of list homomorphisms","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Homomorphism; Graph homomorphism; Discrete mathematics; Vertex (graph theory); Graph; Line graph; Graph power","score_opus":0.0487071365618233,"score_gpt":0.2748106614581519,"score_spread":0.22610352489632862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018547288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5284723,0.02699076,0.41943505,0.009487778,0.0012350712,0.00078869605,0.000024291205,0.00011622648,0.013449796],"genre_scores_gemma":[0.99171996,0.0009531116,0.0069265324,0.00021341468,0.000032343425,0.0000023186865,1.15763164e-7,0.0000111964755,0.00014101877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973715,0.00095967366,0.0005730355,0.00018401908,0.00061805855,0.00029369362],"domain_scores_gemma":[0.99723125,0.0010973837,0.0005705381,0.00060273474,0.0003344554,0.00016363566],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0039832536,0.00015945033,0.00043209747,0.0005226178,0.00022763034,0.000079050296,0.0015813208,0.000054261604,0.000089265974],"category_scores_gemma":[0.00030153847,0.00009637835,0.00032085323,0.0009474717,0.0040978948,0.0005068326,0.0002719474,0.000514711,0.000003815684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020757655,0.00009064998,0.00026730285,0.000015236595,0.00008187283,0.000030041529,0.0008199528,0.0000106946645,0.00056668604,0.9893486,0.00027582305,0.008285597],"study_design_scores_gemma":[0.001574702,0.00022871906,0.001049115,0.000043238393,0.000020410407,0.00036846107,0.00014078392,0.00069853547,0.0009346327,0.99455667,0.0002792408,0.00010550325],"about_ca_topic_score_codex":0.0000039995552,"about_ca_topic_score_gemma":0.000002157489,"teacher_disagreement_score":0.46324763,"about_ca_system_score_codex":0.000012827567,"about_ca_system_score_gemma":0.000021357759,"threshold_uncertainty_score":0.9986124},"labels":[],"label_agreement":null},{"id":"W2018558025","doi":"10.1016/j.tcs.2014.10.009","title":"Approximation algorithms for digraph width parameters","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Digraph; Pathwidth; Mathematics; Combinatorics; Bounded function; Discrete mathematics; Partial k-tree; Approximation algorithm; Directed graph; Algorithm; Graph","score_opus":0.022550280587743977,"score_gpt":0.29856726809895917,"score_spread":0.2760169875112152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018558025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005847376,0.00000981755,0.9909377,0.00081497617,0.00047234882,0.0004556732,0.0000018144029,0.00029385806,0.0011664153],"genre_scores_gemma":[0.48116198,0.0000010691618,0.51843274,0.00030076422,0.000055121793,0.00003464565,8.9944695e-7,0.0000073674632,0.0000053827853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682665,0.00017960997,0.0002893657,0.0009697712,0.0008556469,0.0008789791],"domain_scores_gemma":[0.9970633,0.001031507,0.000081982056,0.0011613852,0.00030679232,0.0003550371],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035621733,0.00020805492,0.00023463328,0.00035583862,0.00058499933,0.00054724555,0.0033809396,0.000055075587,0.0000056285144],"category_scores_gemma":[0.00039938252,0.00017116866,0.00011650036,0.001638617,0.0032997,0.0010805498,0.0007600315,0.00018437082,0.00003818646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009026924,0.000031711596,0.000012820299,0.000007867167,0.0000025847999,5.482466e-7,0.0001229607,0.0003357549,0.00034916523,0.79371256,0.000017010552,0.20539798],"study_design_scores_gemma":[0.00018217179,0.00022146375,0.000079045945,0.000008379505,0.0000014842603,0.000006908249,0.000001561663,0.49849,0.0044607287,0.49630007,0.000115087445,0.00013306517],"about_ca_topic_score_codex":8.839415e-7,"about_ca_topic_score_gemma":1.6041953e-7,"teacher_disagreement_score":0.49815425,"about_ca_system_score_codex":0.000049164188,"about_ca_system_score_gemma":0.00006737574,"threshold_uncertainty_score":0.9994128},"labels":[],"label_agreement":null},{"id":"W2019249538","doi":"10.1016/j.dam.2010.01.005","title":"An implicit representation of chordal comparability graphs in linear time","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Comparability; Chordal graph; Representation (politics); Interval graph; Discrete mathematics; Combinatorics; Graph; 1-planar graph","score_opus":0.02053967500338945,"score_gpt":0.3343552338514482,"score_spread":0.3138155588480588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019249538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75979954,0.0000025540844,0.23657404,0.000038832062,0.000041818716,0.0004631885,0.0000072608054,0.000086479384,0.0029863142],"genre_scores_gemma":[0.749382,0.0000012434738,0.25051752,0.000011169639,0.000011666894,0.00003938274,0.00001155941,0.000012371657,0.000013075505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983941,0.000042244807,0.00048254544,0.00039809238,0.00038493812,0.00029811857],"domain_scores_gemma":[0.9979265,0.00028516774,0.00017371839,0.001425394,0.00007931925,0.000109952205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007187099,0.00015159238,0.0003381007,0.00018964839,0.00005374852,0.000041074683,0.0010691253,0.00008020502,0.000028153101],"category_scores_gemma":[0.00007818657,0.00013694025,0.00006694281,0.0008033285,0.00020167007,0.0003066593,0.0001979215,0.00032604818,0.000049189173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017193055,0.00022200307,0.00053587125,0.000051520125,0.000007105578,0.0000013155236,0.0011987564,0.00023028874,0.3260894,0.67002666,0.000008165206,0.0016116772],"study_design_scores_gemma":[0.00042266684,0.000056282206,0.0028686358,0.000010364968,0.0000042533497,0.0000045551383,0.00015996367,0.14475936,0.05432479,0.7971838,0.000013624712,0.00019167551],"about_ca_topic_score_codex":0.000009271977,"about_ca_topic_score_gemma":0.000017115522,"teacher_disagreement_score":0.27176464,"about_ca_system_score_codex":0.000012639388,"about_ca_system_score_gemma":0.000031151714,"threshold_uncertainty_score":0.55842614},"labels":[],"label_agreement":null},{"id":"W2019436781","doi":"10.1016/j.disc.2014.03.024","title":"Elimination schemes and lattices","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Chordal graph; Induced subgraph; Vertex (graph theory); Distributive property; Discrete mathematics; Graph; Pure mathematics","score_opus":0.020247368989053133,"score_gpt":0.3001867631316433,"score_spread":0.27993939414259017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019436781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032734443,0.000060150884,0.9595518,0.0005942606,0.000030473797,0.00008985219,6.025668e-7,0.000097321994,0.0068410565],"genre_scores_gemma":[0.7102148,0.000013328885,0.2893969,0.000054058022,0.00001923096,0.000009111878,9.180809e-7,0.000008056981,0.00028362384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992795,0.000040334187,0.00012722779,0.00017270519,0.0002162177,0.00016404374],"domain_scores_gemma":[0.9991939,0.00026733548,0.000059645135,0.00037149296,0.000047540994,0.000060084843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000452308,0.00008019223,0.0001025751,0.00007032833,0.00008856197,0.00013234957,0.00037082133,0.000027145119,0.0000060660236],"category_scores_gemma":[0.000254209,0.000064595486,0.000021457181,0.00015817807,0.000073600204,0.00035914226,0.00020646967,0.00006862232,0.000032160842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.899497e-7,0.0000114715685,0.000052173098,0.000054265896,0.0000040401446,4.7935345e-7,0.00063287164,0.0000046659843,0.00041340367,0.98325205,0.000016548673,0.015557467],"study_design_scores_gemma":[0.0001467279,0.00005128143,0.0002819168,0.00003338286,0.000004188128,0.000007718538,0.00011427574,0.26763454,0.0031551744,0.72643495,0.0020041277,0.00013170815],"about_ca_topic_score_codex":3.7124315e-7,"about_ca_topic_score_gemma":6.056619e-7,"teacher_disagreement_score":0.67748034,"about_ca_system_score_codex":0.0000063359253,"about_ca_system_score_gemma":0.000005857232,"threshold_uncertainty_score":0.26341274},"labels":[],"label_agreement":null},{"id":"W2020054908","doi":"10.1016/s0304-3975(00)00005-0","title":"Finding houses and holes in graphs","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Domino; Mathematics; Graph; Discrete mathematics; Chemistry","score_opus":0.023300947401377867,"score_gpt":0.30398486310987827,"score_spread":0.2806839157085004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020054908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3967161,0.0000514664,0.60159725,0.0004053718,0.00010396127,0.00009335743,2.4719756e-7,0.000106538464,0.00092572096],"genre_scores_gemma":[0.9230555,0.000040316907,0.07661353,0.00024910926,0.000023528963,0.0000060492816,9.513946e-8,0.00000658186,0.00000525592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759805,0.00012986391,0.0002074989,0.0007457369,0.00058562687,0.00073322747],"domain_scores_gemma":[0.9985669,0.00042608025,0.00003369585,0.0006357067,0.000076797885,0.00026081866],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017402162,0.00015468292,0.00017857573,0.0005899269,0.00031438188,0.00040090983,0.0020456552,0.000039752926,0.000011192166],"category_scores_gemma":[0.00013317053,0.0001304406,0.000032197753,0.002643218,0.005047093,0.001028581,0.0013647783,0.000250382,0.000022603797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073852225,0.000029402776,0.0037715647,0.0000028853915,9.0454984e-7,0.000056418146,0.00032556514,0.00007121131,0.00047858997,0.94788194,0.0000023923571,0.047371715],"study_design_scores_gemma":[0.00023306302,0.00011948335,0.010262487,0.000031214942,6.7731196e-7,0.00010815084,0.000013699581,0.11456208,0.0012473266,0.87319046,0.000041092775,0.00019023615],"about_ca_topic_score_codex":0.0000028745199,"about_ca_topic_score_gemma":0.0000024461574,"teacher_disagreement_score":0.5263394,"about_ca_system_score_codex":0.000037008285,"about_ca_system_score_gemma":0.000057477802,"threshold_uncertainty_score":0.9976606},"labels":[],"label_agreement":null},{"id":"W2020154454","doi":"10.1145/2556646","title":"Constraint Satisfaction Problems Solvable by Local Consistency Methods","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Narodowe Centrum Nauki; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Constraint satisfaction problem; Local consistency; Consistency (knowledge bases); Constraint (computer-aided design); Constraint satisfaction; Mathematics; Computer science; Weak consistency; Mathematical optimization; Discrete mathematics; Strong consistency; Statistics","score_opus":0.029095741414015133,"score_gpt":0.33548799274915386,"score_spread":0.30639225133513875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020154454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054383986,0.0002531302,0.98800546,0.004762745,0.000528846,0.0000883239,6.5606736e-7,0.000015455747,0.00090696034],"genre_scores_gemma":[0.59150404,0.00002501192,0.40787837,0.0003214006,0.00005709752,0.0000019958602,5.287373e-8,0.000007551525,0.00020450776],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982439,0.0006671699,0.00034046415,0.00013034663,0.00038840543,0.00022966102],"domain_scores_gemma":[0.9976086,0.00063257746,0.00035220615,0.0010830724,0.00021708911,0.00010644837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028995567,0.00008871441,0.00018718075,0.00007554572,0.00016184323,0.000082756844,0.0023836317,0.00004590506,0.000018364583],"category_scores_gemma":[0.0018042771,0.000054280223,0.00013603766,0.00026931768,0.0002588175,0.00040577597,0.0006297352,0.00041159213,0.0000090615895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003249483,0.00007454421,0.002178103,0.000032154298,0.00009928394,0.00000553669,0.00042422645,0.0024152582,0.09695037,0.10810015,0.012497092,0.7771908],"study_design_scores_gemma":[0.00061028876,0.00029841956,0.0015923466,0.000076975375,0.0000149411335,0.0005760389,0.00008436924,0.01050576,0.032032155,0.9358866,0.018174924,0.00014714718],"about_ca_topic_score_codex":0.000009181124,"about_ca_topic_score_gemma":0.0000037421537,"teacher_disagreement_score":0.8277865,"about_ca_system_score_codex":0.00006822354,"about_ca_system_score_gemma":0.00010203654,"threshold_uncertainty_score":0.44294205},"labels":[],"label_agreement":null},{"id":"W2020187144","doi":"","title":"A nearly linear time algorithm for the half integral disjoint paths packing","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Binary logarithm; Bounded function; Mathematics; Disjoint sets; Time complexity; Planar graph; Vertex (graph theory); Running time; Graph; Discrete mathematics; Algorithm","score_opus":0.034362486039546725,"score_gpt":0.294476237236862,"score_spread":0.2601137511973153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020187144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012517683,0.00011724,0.99578446,0.0012789685,0.00013610433,0.00041094614,0.0000062496474,0.00020834454,0.0008059452],"genre_scores_gemma":[0.044379767,0.000041052044,0.94408506,0.00062143477,0.00025680018,0.00014329283,0.0000040894956,0.000032878845,0.010435599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855286,0.00007107695,0.0001883258,0.00037038192,0.00034256544,0.00047479355],"domain_scores_gemma":[0.9982921,0.000671329,0.000045634686,0.000720475,0.00016319333,0.0001072787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053304184,0.00014514347,0.0001519671,0.0000803319,0.00048057275,0.00009926574,0.001236637,0.000044643377,0.000049570725],"category_scores_gemma":[0.00013219449,0.00008596172,0.00015037574,0.00043521266,0.00021074586,0.00046710114,0.00037307155,0.00023082455,0.00020758845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017916016,0.00008535175,0.000079971134,0.000005061335,0.00004454348,0.000048598315,0.0014995245,0.00011790102,0.0007011428,0.085807085,0.002081052,0.90951186],"study_design_scores_gemma":[0.00033619272,0.00018078243,0.00020692158,0.000008943698,0.0000027093731,0.0000741239,0.000057193633,0.96792895,0.0022131584,0.017755186,0.0110633075,0.0001725465],"about_ca_topic_score_codex":0.000027411756,"about_ca_topic_score_gemma":0.0000073413626,"teacher_disagreement_score":0.96781105,"about_ca_system_score_codex":0.000033655746,"about_ca_system_score_gemma":0.00007785885,"threshold_uncertainty_score":0.36962256},"labels":[],"label_agreement":null},{"id":"W2020320404","doi":"10.1016/j.disc.2010.05.028","title":"Maximum independent sets in 3- and 4-regular Hamiltonian graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Indifference graph; Maximal independent set; Hamiltonian path; Chordal graph; Hamiltonian path problem; Discrete mathematics; Hamiltonian (control theory); Pathwidth; Independent set; 1-planar graph; Planar graph; Graph; Line graph","score_opus":0.01348230672936073,"score_gpt":0.281595797223699,"score_spread":0.26811349049433825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020320404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8801459,0.000068206726,0.11562175,0.0005879498,0.00020590995,0.00038588268,0.000005967727,0.00012216934,0.002856251],"genre_scores_gemma":[0.85588664,0.000015199553,0.1438429,0.00006548094,0.000012022269,0.00002764436,0.0000018023646,0.000020279414,0.0001280212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985203,0.000048101192,0.00026888665,0.00035707364,0.00040635842,0.0003992507],"domain_scores_gemma":[0.9987422,0.00013514166,0.000074955555,0.0008518997,0.00004356323,0.00015224253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006789217,0.00017077668,0.00021162441,0.0002587767,0.000089735986,0.00016482224,0.00083996454,0.0000942818,0.000017440636],"category_scores_gemma":[0.00011507504,0.00014605315,0.000049725953,0.00044416482,0.00017575017,0.00036686155,0.00048042522,0.0004377817,0.000028694096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043485666,0.0000912665,0.0024175688,0.000092177186,0.000013658237,0.000068363646,0.0036220653,0.000012175322,0.0072065354,0.97744346,0.000034215107,0.008994187],"study_design_scores_gemma":[0.00035171845,0.00003536193,0.0043632365,0.00003338062,0.0000020486793,0.000060714683,0.00021611249,0.019416196,0.001619888,0.97343236,0.00025154743,0.00021740964],"about_ca_topic_score_codex":0.000006240829,"about_ca_topic_score_gemma":0.000094274474,"teacher_disagreement_score":0.028221158,"about_ca_system_score_codex":0.000013095807,"about_ca_system_score_gemma":0.000029337047,"threshold_uncertainty_score":0.59558743},"labels":[],"label_agreement":null},{"id":"W2021090044","doi":"10.1155/jamds.2005.107","title":"Minmax strongly connected subgraphs with node penalties","year":2005,"lang":"lv","type":"article","venue":"Journal of Applied Mathematics and Decision Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.03769871982691585,"score_gpt":0.31933893997815027,"score_spread":0.2816402201512344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021090044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46289116,0.0012160129,0.5315281,0.0004315506,0.00013270829,0.00020977079,0.000003754211,0.000013930892,0.003573001],"genre_scores_gemma":[0.3243055,0.00040753456,0.6750795,0.00008077918,0.000094965966,0.0000025202378,7.219465e-8,0.000012169889,0.000016909644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99455094,0.000018675912,0.0011677552,0.0004940157,0.0031667538,0.0006018586],"domain_scores_gemma":[0.9946679,0.0023015281,0.0012139729,0.0004891214,0.00091730437,0.00041019815],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004576493,0.00033851957,0.00072714844,0.000895325,0.0006140123,0.0010708582,0.0018712942,0.00010221631,0.00006030664],"category_scores_gemma":[0.000292769,0.00020727068,0.00013359802,0.0016054492,0.0014134761,0.0010561061,0.00040192474,0.00046372102,0.000026037067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005006738,0.00053277187,0.00008513703,0.00010173441,0.00009956784,0.00005764928,0.005308419,0.006315326,0.0021823666,0.8092492,0.0008760407,0.1746911],"study_design_scores_gemma":[0.0031716863,0.0023342613,0.00028305245,0.0009510574,0.00009542966,0.0010783518,0.012972553,0.11200946,0.005180796,0.85830486,0.0028554115,0.00076309446],"about_ca_topic_score_codex":0.0000014480775,"about_ca_topic_score_gemma":0.000009383799,"teacher_disagreement_score":0.17392801,"about_ca_system_score_codex":0.000054981756,"about_ca_system_score_gemma":0.0004978578,"threshold_uncertainty_score":0.99996614},"labels":[],"label_agreement":null},{"id":"W2021388036","doi":"10.1155/2013/675057","title":"On the Topological and Uniform Structure of Diversities","year":2013,"lang":"en","type":"article","venue":"Journal of Function Spaces and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Topology (electrical circuits); Pure mathematics; Combinatorics","score_opus":0.015419962705169285,"score_gpt":0.253992109887509,"score_spread":0.23857214718233968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021388036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7038617,0.00020246276,0.29027832,0.004996588,0.000030506217,0.00012995386,0.0000021375345,0.000005276184,0.0004930724],"genre_scores_gemma":[0.9981483,0.00009006365,0.0015491263,0.000100334604,0.000025060932,0.0000023957043,8.4771614e-8,8.566562e-7,0.00008377567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996956,0.000018602572,0.00008055675,0.00005068578,0.000106842715,0.000047731653],"domain_scores_gemma":[0.99948007,0.00018144576,0.000105162464,0.000092042115,0.000107106745,0.00003416779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008148272,0.00003211956,0.000055820372,0.00004837409,0.00012229614,0.00004660529,0.00013299736,0.00001787248,0.000042267075],"category_scores_gemma":[0.00001278772,0.000016940214,0.00001699534,0.00011476266,0.000114374445,0.00018868005,0.000052730324,0.000094783994,0.00000115777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073156575,0.000009457324,0.0005615863,0.0000028144589,0.000010318037,8.4751356e-8,0.00009431894,0.000050886596,0.001925395,0.9898277,0.00028026162,0.0072298516],"study_design_scores_gemma":[0.00020226128,0.00043344183,0.029220637,0.000009732389,0.000010010302,0.00003794417,0.0019292693,0.00084822054,0.0010920165,0.9575823,0.008576286,0.000057862493],"about_ca_topic_score_codex":0.0000035787562,"about_ca_topic_score_gemma":0.0000010750831,"teacher_disagreement_score":0.2942866,"about_ca_system_score_codex":0.00000448212,"about_ca_system_score_gemma":0.000007851218,"threshold_uncertainty_score":0.094061546},"labels":[],"label_agreement":null},{"id":"W2022480780","doi":"10.1016/j.disc.2012.12.018","title":"The bondage number of graphs on topological surfaces and Teschner’s conjecture","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Chordal graph; Pathwidth; Vertex (graph theory); 1-planar graph; Discrete mathematics; Indifference graph; Upper and lower bounds; Graph; Line graph","score_opus":0.01831219561700593,"score_gpt":0.3010492263508283,"score_spread":0.2827370307338224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022480780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94959855,0.00023969164,0.03475821,0.0020018634,0.00007727954,0.00052408024,0.000006458358,0.00009698763,0.012696889],"genre_scores_gemma":[0.96475184,0.00005372136,0.034560774,0.00005704368,0.0000064951328,0.000022011362,4.5856174e-7,0.0000089533905,0.0005386857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893737,0.00007998737,0.00021969854,0.00019900457,0.0003035981,0.00026036258],"domain_scores_gemma":[0.99818057,0.0010015256,0.000101265214,0.0005786035,0.00006463745,0.000073384086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036249662,0.00012859073,0.00018011623,0.000030967938,0.0001743956,0.0001443438,0.00067994284,0.000056471363,0.000045327644],"category_scores_gemma":[0.00021111548,0.00006694067,0.000055744305,0.00021664768,0.0004305878,0.00016268746,0.00027320092,0.00017917526,0.000050576833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023866714,0.000024565483,0.00044368996,0.0000264012,0.000012239251,0.0000018385022,0.00051421736,0.000007872857,0.00042529395,0.9968837,0.00018997725,0.0014678524],"study_design_scores_gemma":[0.00012561453,0.00008480798,0.00077219045,0.000024727067,0.0000029006171,0.000016001279,0.0003592803,0.006897299,0.001977952,0.9893352,0.00029716012,0.00010689006],"about_ca_topic_score_codex":0.0000054831867,"about_ca_topic_score_gemma":0.0000016463504,"teacher_disagreement_score":0.015153315,"about_ca_system_score_codex":0.0000060773555,"about_ca_system_score_gemma":0.000011142093,"threshold_uncertainty_score":0.27297613},"labels":[],"label_agreement":null},{"id":"W2022616211","doi":"10.1016/j.jctb.2005.03.002","title":"Deeply asymmetric planar graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Planar graph; Outerplanar graph; Combinatorics; Mathematics; Graph; Book embedding; Planar; Planar straight-line graph; Automorphism; Simple (philosophy); Graph automorphism; Discrete mathematics; 1-planar graph; Line graph; Computer science; Pathwidth; Voltage graph; Computer graphics (images)","score_opus":0.011642004230155597,"score_gpt":0.26561462763841154,"score_spread":0.25397262340825594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022616211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1959842,0.009713136,0.6834527,0.009794286,0.037062626,0.001011322,0.000014528224,0.0005993067,0.062367857],"genre_scores_gemma":[0.9735113,0.00019967067,0.024675732,0.00024166577,0.000876704,0.0000034405716,4.4276834e-7,0.000025196592,0.00046584065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973161,0.0005375687,0.00062591577,0.0002182706,0.00085535174,0.00044677293],"domain_scores_gemma":[0.99746644,0.0007143269,0.0004699192,0.00055932725,0.00051090174,0.00027905343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002855431,0.00020604093,0.00039638704,0.0008005359,0.00020598623,0.00018402639,0.0020616536,0.00010014596,0.000044459182],"category_scores_gemma":[0.00069531886,0.00017193596,0.00024908362,0.0015071451,0.00020421002,0.0025274365,0.00018266788,0.0005733563,0.000039546452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046555392,0.00012676667,0.00009660517,0.0000058288533,0.00006406777,0.00006745831,0.00026595758,0.0000458383,0.00039216742,0.9682299,0.00083690754,0.02940297],"study_design_scores_gemma":[0.0011718558,0.000831084,0.00016257298,0.000020064434,0.000010851971,0.00032492614,0.00008256127,0.00003293393,0.006730068,0.94011617,0.050332487,0.00018440766],"about_ca_topic_score_codex":6.031047e-7,"about_ca_topic_score_gemma":5.048406e-7,"teacher_disagreement_score":0.7775271,"about_ca_system_score_codex":0.000104513805,"about_ca_system_score_gemma":0.00017186506,"threshold_uncertainty_score":0.70113444},"labels":[],"label_agreement":null},{"id":"W2022623224","doi":"10.1016/s0012-365x(00)00213-2","title":"Hedetniemi's conjecture — a survey","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Product (mathematics); Chromatic scale; Discrete mathematics; Geometry","score_opus":0.039637011896771324,"score_gpt":0.3202211428898492,"score_spread":0.2805841309930779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022623224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040826533,0.000108869135,0.9481309,0.0003760738,0.00010029784,0.00022832713,0.000009921272,0.0002323721,0.009986722],"genre_scores_gemma":[0.854973,0.000055170996,0.14205413,0.0002180322,0.000052276057,0.00003019606,0.0000139145395,0.000037792543,0.002565448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984477,0.00013654122,0.0002537774,0.00031675652,0.00041773645,0.00042747444],"domain_scores_gemma":[0.9981773,0.0004886827,0.000090148984,0.0010092722,0.00009372221,0.00014087453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008647606,0.0001730428,0.00022833222,0.00010534564,0.00012751583,0.00017429766,0.001227381,0.000066068664,0.00007256008],"category_scores_gemma":[0.00037225604,0.0001370833,0.00007750388,0.000724019,0.00009686201,0.0003071499,0.00034652185,0.00019781965,0.00022266094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016615537,0.00014314528,0.0036082664,0.00007500035,0.000051828647,0.00012802678,0.0024433895,0.00014959047,0.00059665524,0.98460096,0.0012023835,0.00698415],"study_design_scores_gemma":[0.0006872709,0.00016420662,0.00401851,0.000075386146,0.000008605301,0.00026713847,0.00021697748,0.074742265,0.0016426907,0.9114678,0.006029928,0.0006792486],"about_ca_topic_score_codex":0.000010051164,"about_ca_topic_score_gemma":0.000027368336,"teacher_disagreement_score":0.8141465,"about_ca_system_score_codex":0.000027108657,"about_ca_system_score_gemma":0.00003896484,"threshold_uncertainty_score":0.5590095},"labels":[],"label_agreement":null},{"id":"W2022783208","doi":"10.1016/j.jctb.2007.12.006","title":"Bisimplicial vertices in even-hole-free graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Induced subgraph; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics; Graph power; Line graph","score_opus":0.0179379954215226,"score_gpt":0.2737250461514349,"score_spread":0.2557870507299123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022783208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750513,0.00073283963,0.0132975,0.00086106505,0.0061223754,0.00022537686,0.0000035676867,0.000072271,0.003633708],"genre_scores_gemma":[0.996571,0.000181308,0.0026910694,0.00008202601,0.0003366406,0.000004626619,2.7062302e-7,0.00001852515,0.00011453955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971169,0.0006457716,0.00070440554,0.00023539305,0.0008296281,0.00046789186],"domain_scores_gemma":[0.9976741,0.0006268017,0.00038616135,0.0007376909,0.0003725052,0.00020273731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020551216,0.00020617984,0.00045381577,0.0005924156,0.00021933918,0.00008184419,0.0027828664,0.00010995323,0.000028356211],"category_scores_gemma":[0.0010216956,0.00017866831,0.00020486416,0.0011725307,0.0003770657,0.00225314,0.00048103943,0.000617568,0.000009222567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011152914,0.00018112262,0.001204409,0.0000078616495,0.000033930755,0.00040488676,0.0008707316,0.000066977416,0.001142116,0.9928593,0.0002957203,0.0018176625],"study_design_scores_gemma":[0.0022339148,0.0008545583,0.0016714402,0.00003804818,0.0000051649167,0.000352829,0.00018760301,0.00002366443,0.004511273,0.9866561,0.0032732214,0.00019213988],"about_ca_topic_score_codex":0.000003135151,"about_ca_topic_score_gemma":0.0000037890188,"teacher_disagreement_score":0.021519698,"about_ca_system_score_codex":0.000087648565,"about_ca_system_score_gemma":0.00027345176,"threshold_uncertainty_score":0.7285882},"labels":[],"label_agreement":null},{"id":"W2022970434","doi":"10.1016/s0012-365x(03)00246-2","title":"Graph covers using t-colourable vertex sets","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Edge cover; Vertex cover; Clique graph; Vertex (graph theory); Graph; Discrete mathematics; Simplex graph; Cover (algebra); Clique; Line graph; Graph power","score_opus":0.038138243317135084,"score_gpt":0.31519214250982835,"score_spread":0.2770538991926933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022970434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08007611,0.00010446598,0.9013857,0.00006978719,0.0002064874,0.00029127783,0.0000051188863,0.00015623575,0.017704803],"genre_scores_gemma":[0.5577309,0.000017787694,0.44161922,0.000120366414,0.0000047217754,0.000014418926,0.000001627083,0.000033042914,0.00045790552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834996,0.00011355025,0.00026150508,0.00031931206,0.00045280415,0.00050287327],"domain_scores_gemma":[0.9985704,0.00024416388,0.00010843993,0.00084761466,0.00008045224,0.00014892172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005960378,0.00018217714,0.00022785288,0.0001541721,0.0002221585,0.00016726014,0.00077451114,0.00006188162,0.00005026379],"category_scores_gemma":[0.00029292426,0.00016034495,0.00010857521,0.00073014456,0.00011132516,0.00049658463,0.00015001482,0.0001752169,0.00009265475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021921874,0.000051785493,0.00008756221,0.000044567147,0.00002545476,0.00002072568,0.00079061225,0.00087823626,0.0020806838,0.99556845,0.000163029,0.00028666755],"study_design_scores_gemma":[0.00031519617,0.000045129524,0.000013953466,0.00004893535,0.000009818402,0.000058070316,0.00030610122,0.09274652,0.006430071,0.89915705,0.00060131785,0.00026786234],"about_ca_topic_score_codex":0.000002821595,"about_ca_topic_score_gemma":0.0000012532288,"teacher_disagreement_score":0.4776548,"about_ca_system_score_codex":0.000058676975,"about_ca_system_score_gemma":0.00007889753,"threshold_uncertainty_score":0.6538677},"labels":[],"label_agreement":null},{"id":"W2023293538","doi":"10.1007/s00453-005-1185-7","title":"Book Embeddability of Series–Parallel Digraphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Embedding; Series (stratigraphy); Transitive relation; Discrete mathematics; Monotonic function; Set (abstract data type); Point (geometry); Computer science; Geometry","score_opus":0.00755424390658528,"score_gpt":0.2535625659565984,"score_spread":0.2460083220500131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023293538","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058619007,0.002283656,0.97796607,0.0011882703,0.00020327352,0.00037278072,0.000015348354,0.00028245937,0.011826267],"genre_scores_gemma":[0.3730502,0.000105418134,0.61398476,0.00063857815,0.00022764044,0.0001059933,0.00001722677,0.000047776794,0.011822425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984357,0.00010384537,0.00029621247,0.00040841335,0.00037525172,0.00038058133],"domain_scores_gemma":[0.9986114,0.00013403736,0.0000870198,0.0009418038,0.00014676395,0.00007897409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030475,0.00013801843,0.00021043375,0.0001320697,0.00009067848,0.000036796537,0.0010241749,0.00005914696,0.000071812465],"category_scores_gemma":[0.00003580218,0.00012814357,0.00011734541,0.0006030662,0.00030221595,0.0007118609,0.00029421994,0.00015590808,0.00004146626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007336194,0.0004724071,0.0015139184,0.000062774554,0.000042437972,0.000036768328,0.00025019707,0.0005875562,0.004936353,0.9182676,0.019277316,0.054479297],"study_design_scores_gemma":[0.0007600249,0.00030925192,0.006754642,0.000019427895,0.0000072078383,0.000048745413,0.000024160036,0.012439121,0.03859063,0.8329144,0.10766017,0.0004721929],"about_ca_topic_score_codex":0.000050732204,"about_ca_topic_score_gemma":0.0000064999344,"teacher_disagreement_score":0.3671883,"about_ca_system_score_codex":0.000026834097,"about_ca_system_score_gemma":0.00005948621,"threshold_uncertainty_score":0.52255434},"labels":[],"label_agreement":null},{"id":"W2024156610","doi":"10.1016/j.disc.2008.05.016","title":"On the complexity of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si15.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>H</mml:mi></mml:math>-colouring planar graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Planar graph; Scroll; Graph; Discrete mathematics; Planar; Algorithm; Computer science; Computer graphics (images); Theology","score_opus":0.040968302843498644,"score_gpt":0.2736410474955918,"score_spread":0.23267274465209317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024156610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661823,0.00009004099,0.02954512,0.0004455964,0.0002274831,0.00014673916,0.000075257485,0.00015827434,0.0031292022],"genre_scores_gemma":[0.9713001,0.000092576825,0.02791099,0.00029394726,0.00008670229,0.00011370935,0.000032011812,0.000085484025,0.000084424435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996537,0.0001458669,0.00072680746,0.0005882334,0.0012371226,0.0007649275],"domain_scores_gemma":[0.9961376,0.0011962806,0.00057787914,0.0017770274,0.00009228757,0.00021889522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010276829,0.00037569934,0.00034006315,0.00017250385,0.00076445437,0.00018244151,0.0019254155,0.0002280858,0.000028663266],"category_scores_gemma":[0.00052471104,0.00033462225,0.0004545688,0.0005982274,0.0011296897,0.00044029506,0.00078846456,0.00061375817,0.00032985292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080129576,0.00018110084,0.0000139832855,0.0002597307,0.00014104685,0.00012959004,0.0026008338,0.0004696116,0.00071691396,0.9950161,0.00026474925,0.00012619086],"study_design_scores_gemma":[0.00042345034,0.00034264932,0.00009070215,0.00030500707,0.00004392442,0.00018268901,0.00044610596,0.82088643,0.008237867,0.16854048,0.00016988105,0.00033082845],"about_ca_topic_score_codex":0.00004284533,"about_ca_topic_score_gemma":0.000029536735,"teacher_disagreement_score":0.8264756,"about_ca_system_score_codex":0.000018918947,"about_ca_system_score_gemma":0.00015868837,"threshold_uncertainty_score":0.9999106},"labels":[],"label_agreement":null},{"id":"W2024656522","doi":"10.1007/s00453-012-9624-8","title":"3-Colouring AT-Free Graphs in Polynomial Time","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Indifference graph; Pathwidth; Interval graph; Combinatorics; Time complexity; Mathematics; Maximal independent set; Cograph; Theory of computation; Discrete mathematics; Split graph; Strong perfect graph theorem; Modular decomposition; Graph; Computer science; 1-planar graph; Line graph; Algorithm","score_opus":0.012299008694531984,"score_gpt":0.2583412557159052,"score_spread":0.24604224702137323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024656522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8985843,0.0014492972,0.06996425,0.0029076089,0.0015127711,0.00094625354,0.000022291542,0.0007829289,0.02383026],"genre_scores_gemma":[0.8914749,0.000013373657,0.105477065,0.00024272886,0.00026499224,0.000055671688,0.0000034447426,0.00003364381,0.0024341652],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982507,0.000117856354,0.00019628368,0.00031572423,0.00031464937,0.00080477033],"domain_scores_gemma":[0.99857956,0.00019262577,0.000046676607,0.00094278425,0.000028335575,0.0002100166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059545843,0.00014071514,0.0001672814,0.00029509753,0.00011930512,0.000040562107,0.0015816716,0.000071733106,0.00007774696],"category_scores_gemma":[0.00009915613,0.00014019675,0.00006995753,0.0006903363,0.000092221286,0.00073966506,0.0013215396,0.00023221326,0.0006715742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028212243,0.0014746753,0.04080679,0.00006450917,0.00017571397,0.0003609098,0.006698969,0.00019477667,0.06728963,0.33473626,0.038823273,0.5090924],"study_design_scores_gemma":[0.011100218,0.000817987,0.15161176,0.00016554282,0.000031017244,0.00067244144,0.00013414396,0.0985379,0.19586441,0.44109094,0.09592097,0.0040526567],"about_ca_topic_score_codex":0.000019861105,"about_ca_topic_score_gemma":0.0000059755807,"teacher_disagreement_score":0.50503975,"about_ca_system_score_codex":0.00013090772,"about_ca_system_score_gemma":0.000029683657,"threshold_uncertainty_score":0.8631952},"labels":[],"label_agreement":null},{"id":"W2024728183","doi":"10.1016/j.jctb.2006.07.001","title":"Homomorphisms and edge-colourings of planar graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Conjecture; Homomorphism; Mathematics; Planar graph; Graph; Discrete mathematics; Odd graph; 1-planar graph; Chordal graph","score_opus":0.007651886994791469,"score_gpt":0.23357519337335866,"score_spread":0.2259233063785672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024728183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9456118,0.001967827,0.039969765,0.00062821014,0.005164285,0.000276253,0.000007782833,0.00006498007,0.0063091135],"genre_scores_gemma":[0.9929002,0.00007864297,0.0065519945,0.000024050567,0.00020440965,0.000001988431,3.8337578e-7,0.000013730874,0.00022459622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820644,0.00029699272,0.00055250025,0.00016426393,0.0005090677,0.000270723],"domain_scores_gemma":[0.9981771,0.00045754836,0.0005278912,0.00032798768,0.0003909354,0.0001185097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016939807,0.00015613662,0.00040164578,0.00033701674,0.00012573593,0.00007652568,0.0009086102,0.00008126896,0.000013872507],"category_scores_gemma":[0.000171807,0.00013201156,0.00013249433,0.00045978313,0.00046201184,0.0010388534,0.00016058034,0.0003085286,0.0000014848811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050517725,0.00010349476,0.0003893164,0.0000193095,0.000035782603,0.00006883244,0.0001701304,0.0000136397475,0.0035131918,0.99389005,0.00027531083,0.0010157423],"study_design_scores_gemma":[0.001130461,0.0008670669,0.001005502,0.00003901058,0.000011676656,0.00026283096,0.00007069398,0.0000069469856,0.017489929,0.97632074,0.0026681153,0.00012702927],"about_ca_topic_score_codex":0.0000036483766,"about_ca_topic_score_gemma":5.366128e-7,"teacher_disagreement_score":0.04728842,"about_ca_system_score_codex":0.000029017314,"about_ca_system_score_gemma":0.00009354154,"threshold_uncertainty_score":0.53832746},"labels":[],"label_agreement":null},{"id":"W2025257509","doi":"10.1016/s0166-218x(01)00197-4","title":"Antidirected hamiltonian paths between specified vertices of a tournament","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Hamiltonian path; Combinatorics; Hamiltonian path problem; Hamiltonian (control theory); Neighbourhood (mathematics); Discrete mathematics; Graph; Mathematical optimization; Mathematical analysis","score_opus":0.04023299807498762,"score_gpt":0.27597158219442364,"score_spread":0.23573858411943602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025257509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2046846,0.00025466207,0.7379644,0.0003295528,0.00008730955,0.00085339835,0.000022257129,0.00032821644,0.05547564],"genre_scores_gemma":[0.79274756,0.000056189438,0.20690937,0.000024169585,0.000036629215,0.000030086398,0.0000025945208,0.00002406046,0.00016937472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798733,0.000035770347,0.00053435715,0.00035772187,0.0006374262,0.00044737742],"domain_scores_gemma":[0.9980765,0.000326716,0.000347527,0.0010189093,0.00007673424,0.00015358567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035986817,0.00021750339,0.00042469203,0.00017439038,0.000110129746,0.00008838988,0.001199776,0.00007147701,0.00009188933],"category_scores_gemma":[0.00007638507,0.00018492149,0.00010084642,0.0006566057,0.000139308,0.00020358156,0.00036057993,0.00019696123,0.0000921113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001526225,0.00037463842,0.0003370179,0.0003900998,0.00017906417,0.000022153159,0.008928465,0.000056349316,0.035031248,0.9212366,0.00044773682,0.03298137],"study_design_scores_gemma":[0.0031833432,0.00049018156,0.0048583345,0.00048703843,0.00015961852,0.000026088175,0.001635342,0.10290399,0.252071,0.62916887,0.003161483,0.0018546875],"about_ca_topic_score_codex":0.0000016291094,"about_ca_topic_score_gemma":0.0000010874611,"teacher_disagreement_score":0.58806294,"about_ca_system_score_codex":0.00003734233,"about_ca_system_score_gemma":0.000014727625,"threshold_uncertainty_score":0.754088},"labels":[],"label_agreement":null},{"id":"W2025282997","doi":"10.1016/j.dam.2004.01.001","title":"Stable skew partition problem","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Mathematics; Skew; Partition (number theory); Combinatorics; Computer science","score_opus":0.0208943018571142,"score_gpt":0.2776431011556697,"score_spread":0.2567487992985555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025282997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037917367,0.000028543827,0.95239806,0.00027786772,0.00002974917,0.0004555925,0.0000034609304,0.0002907584,0.042724248],"genre_scores_gemma":[0.25154188,0.0000143630305,0.74796396,0.00009189121,0.00002533357,0.00015399228,0.0000065805884,0.00002351198,0.00017849561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849653,0.000011423954,0.00028058622,0.0003315336,0.00042967364,0.00045024848],"domain_scores_gemma":[0.9988817,0.00006953379,0.000105195104,0.00076601305,0.00005195904,0.00012560957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036534414,0.00016499398,0.00019345085,0.000089772526,0.00016145674,0.00015414722,0.0007650085,0.000054805205,0.000024120369],"category_scores_gemma":[0.000020928466,0.00014221098,0.000055248132,0.000481091,0.0000861204,0.0003479722,0.00027794353,0.00016548124,0.0003919518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028485247,0.00007693864,0.0000013308778,0.000080358834,0.000010030501,0.0000042858965,0.0009812338,0.00063052354,0.005984458,0.99091923,0.000057677782,0.0012510575],"study_design_scores_gemma":[0.00036736147,0.000033082906,0.0000071636596,0.000034675413,0.0000046462324,0.000007705479,0.000121847275,0.0013214608,0.022317661,0.97493285,0.0006670496,0.00018449362],"about_ca_topic_score_codex":0.0000023395537,"about_ca_topic_score_gemma":0.0000018527384,"teacher_disagreement_score":0.24775013,"about_ca_system_score_codex":0.00006690422,"about_ca_system_score_gemma":0.000062129664,"threshold_uncertainty_score":0.5799195},"labels":[],"label_agreement":null},{"id":"W2026675463","doi":"10.1016/s0012-365x(02)00447-8","title":"Vertices contained in all or in no minimum total dominating set of a tree","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Vertex (graph theory); Graph; Tree (set theory); Discrete mathematics","score_opus":0.0440434861314269,"score_gpt":0.3371172881744353,"score_spread":0.2930738020430084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026675463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91006017,0.00006852392,0.078679,0.0001466084,0.000075922326,0.00054678624,0.0000066549337,0.000040990253,0.010375321],"genre_scores_gemma":[0.8838701,0.0000047082144,0.115732096,0.00002290193,0.0000058661262,0.000029564346,0.0000012086165,0.00001261169,0.0003209052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984189,0.00015836301,0.000505153,0.00024049275,0.0003136178,0.00036343205],"domain_scores_gemma":[0.9984503,0.0008193017,0.00014228445,0.00046527272,0.00006211001,0.000060773044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009777239,0.00013978023,0.00031794715,0.0002138523,0.00002146154,0.000042970263,0.00054875715,0.00005082258,0.000025777834],"category_scores_gemma":[0.0014204424,0.00010902898,0.000051626637,0.00059768744,0.000077976576,0.00031157106,0.00015817035,0.00014833646,0.000015387746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022287788,0.00053167046,0.0025470355,0.0010294766,0.00005836329,0.0002892261,0.04108439,0.0004672239,0.017706286,0.93116546,0.000053368152,0.0048446273],"study_design_scores_gemma":[0.006117045,0.000861586,0.0011605227,0.00093232567,0.000017051694,0.0000779828,0.007851073,0.60257673,0.025882458,0.35341656,0.00023067943,0.0008760137],"about_ca_topic_score_codex":0.000008332388,"about_ca_topic_score_gemma":0.0000820259,"teacher_disagreement_score":0.6021095,"about_ca_system_score_codex":0.000046524903,"about_ca_system_score_gemma":0.000060412236,"threshold_uncertainty_score":0.4446073},"labels":[],"label_agreement":null},{"id":"W2026680711","doi":"10.1142/s179383091100136x","title":"DIAMETER-CONSTRAINED STEINER TREES","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Bounded function; Gomory–Hu tree; Tree (set theory); k-minimum spanning tree; Connected dominating set; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; K-ary tree; Minimum spanning tree; Topology (electrical circuits); Tree structure; Computer science; Binary tree; Telecommunications","score_opus":0.034321574150032993,"score_gpt":0.28542185600936626,"score_spread":0.25110028185933325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026680711","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084052497,0.00009694803,0.98691136,0.00011713418,0.000014395229,0.0003981974,0.000017889955,0.00012841304,0.011475153],"genre_scores_gemma":[0.11013757,0.0000475186,0.8886672,0.000050344617,0.000041567895,0.0004889341,0.0000061018254,0.000019359433,0.00054136704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902457,0.000019340308,0.0002225756,0.00031616254,0.00017443937,0.00024291841],"domain_scores_gemma":[0.99894625,0.00011256828,0.00007898645,0.0006610471,0.00006478653,0.00013635849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021009408,0.00013689316,0.00015606216,0.00010026025,0.00017411691,0.00009144992,0.00057396607,0.000039704024,0.000028313301],"category_scores_gemma":[0.000017725546,0.00011144895,0.00005230215,0.00034569224,0.00018717624,0.00023937594,0.00021886962,0.00009835496,0.000035897167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.9003463e-7,0.00007832289,0.000023015118,0.000016928767,0.00001593386,0.0000014444149,0.0009532555,0.000001438209,0.00037525938,0.9338393,0.0000130243225,0.06468148],"study_design_scores_gemma":[0.00029158205,0.00007395642,0.00039870598,0.000020026871,0.000014852504,0.000029225796,0.0004856212,0.05877356,0.002075222,0.9352109,0.0023108383,0.00031550642],"about_ca_topic_score_codex":0.0000054631337,"about_ca_topic_score_gemma":0.000002656087,"teacher_disagreement_score":0.109297045,"about_ca_system_score_codex":0.000007868444,"about_ca_system_score_gemma":0.000017968201,"threshold_uncertainty_score":0.45447564},"labels":[],"label_agreement":null},{"id":"W2026687552","doi":"10.1016/j.ejc.2014.04.008","title":"Universality of intervals of line graph order","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Mathematics; Combinatorics; Universality (dynamical systems); Line graph; Graph; Discrete mathematics; Physics","score_opus":0.02152212209297294,"score_gpt":0.26989417466615184,"score_spread":0.2483720525731789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026687552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13609828,0.0001738668,0.8575277,0.00019788528,0.0004426179,0.000042479413,9.277706e-7,0.000013039008,0.005503201],"genre_scores_gemma":[0.991805,0.00005881056,0.007968095,0.000025613563,0.000026321897,4.6755407e-8,1.5478214e-7,0.000012621624,0.0001033266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974023,0.0011726447,0.0006211628,0.00012099019,0.00051434815,0.00016853814],"domain_scores_gemma":[0.99711055,0.00027831068,0.00076331926,0.0004883622,0.0012332391,0.0001262369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036282202,0.00010161389,0.00031160054,0.00032093833,0.000033296114,0.000017819157,0.0016362845,0.000016778813,0.000008423626],"category_scores_gemma":[0.00058059744,0.00008670864,0.00014665582,0.0009850302,0.00015552947,0.00034204178,0.00032865396,0.0002898344,0.0000046078153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007173959,0.00032131892,0.0015758723,0.000066779,0.000067610796,0.00006171136,0.0005785876,0.0005081989,0.002524609,0.97829586,0.0003172656,0.0156104285],"study_design_scores_gemma":[0.0059137456,0.0074260533,0.015874572,0.0004448554,0.000056964902,0.00016191005,0.00023061977,0.0037895604,0.03860917,0.90842843,0.018525291,0.0005388457],"about_ca_topic_score_codex":7.2833524e-7,"about_ca_topic_score_gemma":1.0988659e-7,"teacher_disagreement_score":0.85570675,"about_ca_system_score_codex":0.000020449059,"about_ca_system_score_gemma":0.00005523497,"threshold_uncertainty_score":0.35358757},"labels":[],"label_agreement":null},{"id":"W2027444730","doi":"10.1016/j.dam.2009.06.001","title":"On the packing chromatic number of some lattices","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Vertex (graph theory); Wheel graph; Lattice (music); Integer (computer science); Graph; Planar graph; Set packing; Discrete mathematics; Set (abstract data type); Graph power; Computer science; Physics","score_opus":0.024180041491205256,"score_gpt":0.30785306982656063,"score_spread":0.28367302833535535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027444730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26813054,0.00005164726,0.6410251,0.0017818367,0.000069486436,0.0009163918,0.000004946911,0.0002569183,0.087763086],"genre_scores_gemma":[0.9242371,0.0000074409863,0.07529633,0.0003323703,0.000021365717,0.00002312422,8.661289e-7,0.0000127986705,0.000068610876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985758,0.000031430733,0.00032229233,0.00022750226,0.00053153903,0.0003114258],"domain_scores_gemma":[0.9978141,0.0008605729,0.00020766591,0.0010229798,0.000036083344,0.000058578225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005544418,0.00016441185,0.00024498955,0.00006005392,0.00012883382,0.000088043606,0.0012044664,0.000043856868,0.000041534568],"category_scores_gemma":[0.00010523712,0.0001018385,0.00007700973,0.00037815294,0.00011760325,0.00019915782,0.00015028538,0.0001793809,0.00016750945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003446877,0.00006723157,0.0000021380924,0.000050471528,0.000013701839,0.0000016886197,0.0012234895,0.00005303648,0.0035162312,0.9930441,0.000068584624,0.0019558733],"study_design_scores_gemma":[0.00013320244,0.00003867669,0.000044813696,0.000069563146,0.000006654338,0.000004432416,0.00019698247,0.009164165,0.0110370945,0.9791564,0.00002351967,0.0001245048],"about_ca_topic_score_codex":3.20999e-7,"about_ca_topic_score_gemma":1.4097172e-7,"teacher_disagreement_score":0.6561066,"about_ca_system_score_codex":0.000018221772,"about_ca_system_score_gemma":0.000019945355,"threshold_uncertainty_score":0.41528535},"labels":[],"label_agreement":null},{"id":"W2027568724","doi":"10.1016/j.disc.2008.05.033","title":"Sweeping graphs with large clique number","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Clique; Enhanced Data Rates for GSM Evolution; Monotonic function; Clique number; Discrete mathematics; Upper and lower bounds; Clique-sum; Chordal graph; Graph; Computer science; 1-planar graph","score_opus":0.0245550563354613,"score_gpt":0.29721376348614753,"score_spread":0.27265870715068624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027568724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08447641,0.000029513942,0.894789,0.00018078636,0.000039531533,0.00023012227,0.0000043356113,0.00024284796,0.02000747],"genre_scores_gemma":[0.69268495,0.000030114428,0.3063238,0.00014306259,0.000019106976,0.00003430581,0.0000028488398,0.000029786468,0.00073204824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983519,0.00006363176,0.00024822593,0.0003291311,0.0004889449,0.00051820744],"domain_scores_gemma":[0.9985542,0.00018968688,0.00010619828,0.0009044558,0.000104474646,0.00014097431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003806866,0.0001845117,0.00023673395,0.00009375771,0.00029409473,0.00006798943,0.00088492513,0.000053352163,0.000041649397],"category_scores_gemma":[0.00007271231,0.00013803861,0.00008416502,0.00065377954,0.00015581891,0.00048005357,0.00028759724,0.00023192842,0.00021220034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000546118,0.00007537483,0.0015881063,0.000050675797,0.00002450468,0.0001017215,0.0023366183,0.000016793754,0.00009305464,0.99542034,0.00013804874,0.00014929543],"study_design_scores_gemma":[0.0011768028,0.00018727178,0.0010895344,0.00021134737,0.00001442806,0.0009721188,0.0007721146,0.037903916,0.004009313,0.95049787,0.0023198023,0.0008454884],"about_ca_topic_score_codex":0.0000024875044,"about_ca_topic_score_gemma":0.0000047076164,"teacher_disagreement_score":0.60820854,"about_ca_system_score_codex":0.00003255553,"about_ca_system_score_gemma":0.000052890515,"threshold_uncertainty_score":0.5629051},"labels":[],"label_agreement":null},{"id":"W2027818420","doi":"10.1007/s00373-008-0806-8","title":"Paired Domination Vertex Critical Graphs","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Domination analysis; Graph; Neighbourhood (mathematics); Upper and lower bounds; Discrete mathematics","score_opus":0.025413394764800368,"score_gpt":0.2717497073206486,"score_spread":0.24633631255584826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027818420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8112664,0.003310181,0.17316806,0.0021534525,0.0019879455,0.00052688643,0.000007145232,0.0008559119,0.0067239963],"genre_scores_gemma":[0.9969673,0.0004678428,0.0022428597,0.00013129275,0.000004838049,0.00002444438,0.0000017596923,0.000011380518,0.00014825392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841803,0.000113563576,0.00019160844,0.00042274926,0.00045002063,0.00040403553],"domain_scores_gemma":[0.9987148,0.0003473223,0.000036420057,0.00048025578,0.00020321176,0.00021796735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031046398,0.00015947802,0.00018348334,0.0002924325,0.0005092508,0.00007764811,0.0005521939,0.00008695197,0.0000059889967],"category_scores_gemma":[0.0001849513,0.00015275404,0.000084961226,0.0011989519,0.00034314702,0.0005670009,0.00022369596,0.00022280007,0.000013435743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008217711,0.00010458996,0.0030268538,0.000012437501,0.000007737798,0.000061111816,0.00022715585,6.388404e-7,0.000120389755,0.99046403,0.00053762353,0.0054292018],"study_design_scores_gemma":[0.000533619,0.00018235297,0.010740686,0.000009160045,0.0000037289976,0.00008849973,0.000026015614,0.0023219134,0.00046919272,0.98464674,0.00077704166,0.00020106728],"about_ca_topic_score_codex":0.000006690699,"about_ca_topic_score_gemma":7.360114e-7,"teacher_disagreement_score":0.18570091,"about_ca_system_score_codex":0.00002201677,"about_ca_system_score_gemma":0.000040947198,"threshold_uncertainty_score":0.62291294},"labels":[],"label_agreement":null},{"id":"W2027879769","doi":"10.1016/j.disc.2007.08.059","title":"Equitable coloring planar graphs with large girth","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Edge coloring; Discrete mathematics; Planar graph; Graph coloring; Graph; Line graph; Graph power","score_opus":0.023172484547257583,"score_gpt":0.2980767138213042,"score_spread":0.2749042292740466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027879769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038085155,0.00007486,0.94257545,0.00008165348,0.00006040091,0.00025762088,0.000006976957,0.00021883236,0.018639036],"genre_scores_gemma":[0.62583286,0.000010046924,0.37301823,0.000094247356,0.000028246543,0.000019469931,0.0000045244938,0.000034622502,0.00095778605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978395,0.000027931608,0.00027878326,0.0003287174,0.00058146636,0.00094360835],"domain_scores_gemma":[0.9984819,0.00031385146,0.000114611226,0.0008165416,0.00008875398,0.00018433029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015088279,0.0001883007,0.00023016601,0.0002030819,0.00026407803,0.00014013458,0.0010188685,0.000052148553,0.000019282093],"category_scores_gemma":[0.0000699292,0.00014122704,0.000060264,0.0008175123,0.000092792216,0.0004944905,0.00029485338,0.00021659481,0.00006960798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016111177,0.00006852475,0.0005422734,0.00007186088,0.00002658262,0.000076678705,0.0013246504,0.000025259056,0.00054349384,0.9967419,0.00007738814,0.00048529188],"study_design_scores_gemma":[0.0015000331,0.0005668336,0.0006263558,0.00023932362,0.00002400636,0.00014430577,0.0025050568,0.021047441,0.015009489,0.95301557,0.0044585806,0.0008630175],"about_ca_topic_score_codex":0.0000023982977,"about_ca_topic_score_gemma":0.000027009897,"teacher_disagreement_score":0.5877477,"about_ca_system_score_codex":0.000038080885,"about_ca_system_score_gemma":0.000036190428,"threshold_uncertainty_score":0.5759072},"labels":[],"label_agreement":null},{"id":"W2027949548","doi":"10.1155/ijmms.2005.863","title":"A degree condition for the existence of <i>k</i>‐factors with prescribed properties","year":2005,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Algorithm; Artificial intelligence; Mathematics; Computer science","score_opus":0.10370997729914164,"score_gpt":0.3398088615019204,"score_spread":0.23609888420277877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027949548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15574831,0.0002963956,0.84056807,0.0025792005,0.00006671479,0.00021878365,0.0000032651915,0.000008445723,0.0005108333],"genre_scores_gemma":[0.71431994,0.000035227084,0.28552878,0.000030869087,0.000035778106,0.000007486102,7.078818e-8,0.0000032129592,0.000038635284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853516,0.000020486246,0.00039732788,0.00010589161,0.00080414,0.00013702639],"domain_scores_gemma":[0.99779344,0.0011631034,0.0003719051,0.00012492,0.00049048255,0.000056142442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012053135,0.000086394044,0.00017726509,0.000104551575,0.00011166804,0.00015195146,0.0012224439,0.000019650468,0.000010441963],"category_scores_gemma":[0.0005098224,0.000038601564,0.0000647804,0.00013689253,0.00057740376,0.00060173805,0.00011804372,0.000079403006,8.698615e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026671463,0.00019669317,0.000048597594,0.00007492423,0.00007911286,0.0000018513228,0.0029620081,0.00026758935,0.002079648,0.986307,0.000038863058,0.007916999],"study_design_scores_gemma":[0.0009197042,0.00089364906,0.00020216804,0.00070614414,0.000045880763,0.0004236766,0.0024338686,0.14437209,0.03058992,0.81851554,0.00070111814,0.0001962478],"about_ca_topic_score_codex":0.0000010025614,"about_ca_topic_score_gemma":0.0000024824199,"teacher_disagreement_score":0.55857164,"about_ca_system_score_codex":0.000015512222,"about_ca_system_score_gemma":0.00007318199,"threshold_uncertainty_score":0.22716253},"labels":[],"label_agreement":null},{"id":"W2027966825","doi":"10.1016/j.ejc.2013.10.007","title":"Semilattice polymorphisms and chordal graphs","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semilattice; Chordal graph; Mathematics; Combinatorics; Indifference graph; Discrete mathematics; Graph","score_opus":0.013216061297907762,"score_gpt":0.234110532029467,"score_spread":0.22089447073155924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027966825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6378569,0.0029745423,0.33485335,0.0024778387,0.0015168826,0.0002204281,7.853309e-7,0.00009474263,0.020004528],"genre_scores_gemma":[0.99030125,0.00016803006,0.008998119,0.000182268,0.000046897632,5.4860834e-7,9.4343406e-8,0.000020072544,0.00028270355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981993,0.0005206193,0.00037179055,0.00016686713,0.00045665255,0.00028481084],"domain_scores_gemma":[0.9984951,0.00018994148,0.00026016802,0.00035840197,0.00038832985,0.000308063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001334899,0.00013186569,0.0001861428,0.00027252283,0.00012136264,0.00021740109,0.0011574156,0.000017321145,0.000018999635],"category_scores_gemma":[0.00016131799,0.000110136454,0.000076164026,0.0005685776,0.000110054876,0.0010100842,0.0003356561,0.00041946722,0.000075092576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017089626,0.00015515022,0.0038359503,0.000016267526,0.000057088757,0.0005656696,0.0006907691,0.000018680754,0.004025641,0.93937165,0.0041906126,0.047055423],"study_design_scores_gemma":[0.0025002658,0.0016119585,0.06369794,0.00009622047,0.000019956635,0.0016049839,0.000112571826,0.0012272993,0.0021254108,0.91258556,0.013891927,0.0005259116],"about_ca_topic_score_codex":8.3414676e-7,"about_ca_topic_score_gemma":2.9455945e-8,"teacher_disagreement_score":0.35244435,"about_ca_system_score_codex":0.000023710158,"about_ca_system_score_gemma":0.000035131612,"threshold_uncertainty_score":0.4491234},"labels":[],"label_agreement":null},{"id":"W2028416100","doi":"10.1016/j.dam.2007.03.028","title":"On the restricted homomorphism problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Digraph; Combinatorics; Conjecture; Bipartite graph; Algebra homomorphism; Graph homomorphism; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.03203550194932333,"score_gpt":0.26153920296882865,"score_spread":0.22950370101950532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028416100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034725726,0.000027880888,0.8509843,0.001400238,0.000049236714,0.0010419547,0.000005582614,0.0004086673,0.11135643],"genre_scores_gemma":[0.7354765,0.000040008024,0.26268634,0.0004698804,0.00003878949,0.00030658868,0.0000045581405,0.000043339183,0.00093398447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983069,0.000038280894,0.00028070866,0.0003375002,0.000620458,0.00041615978],"domain_scores_gemma":[0.99760896,0.00079476245,0.0001268502,0.0013125709,0.00005665457,0.000100193785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029953083,0.0001961873,0.00019871775,0.00010820602,0.00043692446,0.00007492518,0.0015597395,0.000058462356,0.00003426665],"category_scores_gemma":[0.00009982833,0.00012152435,0.00007036575,0.000783405,0.00024512084,0.00011740565,0.00034247595,0.0003239859,0.0004073619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005780656,0.00006576855,0.0000013933908,0.000015278729,0.0000129415985,0.000017822615,0.0011700413,0.0000610492,0.0018782899,0.99435294,0.0019616392,0.00045706469],"study_design_scores_gemma":[0.00025406873,0.00006113423,0.000044503,0.000022058844,0.00000384959,0.000041329356,0.00010938058,0.0061218925,0.0044876765,0.9878407,0.0008017537,0.00021161982],"about_ca_topic_score_codex":0.0000010356039,"about_ca_topic_score_gemma":3.8603665e-7,"teacher_disagreement_score":0.70075077,"about_ca_system_score_codex":0.000031944044,"about_ca_system_score_gemma":0.000051374816,"threshold_uncertainty_score":0.5235949},"labels":[],"label_agreement":null},{"id":"W2028544177","doi":"10.1016/j.disc.2009.08.013","title":"Absolute retracts and varieties generated by chordal graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Mathematics; Chordal graph; Treewidth; Combinatorics; Discrete mathematics; Interval graph; Indifference graph; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.013144400365500943,"score_gpt":0.27025405220967247,"score_spread":0.2571096518441715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028544177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3571445,0.00020242902,0.6359625,0.00060689537,0.00024401642,0.00042609323,0.000020148198,0.0003429976,0.0050504105],"genre_scores_gemma":[0.70736104,0.000074452706,0.29040298,0.00014595542,0.00004433329,0.000047898342,0.000012628777,0.00003977873,0.0018709089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863,0.000040426054,0.00024650828,0.000334525,0.00036740463,0.00038113495],"domain_scores_gemma":[0.9987244,0.0001813876,0.000096843585,0.00072387693,0.00009453052,0.00017897967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052900315,0.00018168762,0.00019790647,0.00010326386,0.00019252449,0.00029001944,0.00072593795,0.000104179395,0.000027793993],"category_scores_gemma":[0.0001815006,0.00015076577,0.00004784012,0.00038588833,0.00024878548,0.00044768045,0.00030215512,0.00042780416,0.000028496079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003632034,0.000047019108,0.000058659334,0.000045947203,0.000021697811,0.000008339332,0.0011904205,0.000002805516,0.0536679,0.9414303,0.001819473,0.0017038529],"study_design_scores_gemma":[0.00032249236,0.00008306862,0.00028100703,0.000013938881,0.000009302778,0.000058585178,0.000104273604,0.048833217,0.018257197,0.92766595,0.003990277,0.0003806848],"about_ca_topic_score_codex":0.000004495738,"about_ca_topic_score_gemma":0.0000070362794,"teacher_disagreement_score":0.35021657,"about_ca_system_score_codex":0.000006711295,"about_ca_system_score_gemma":0.000026640548,"threshold_uncertainty_score":0.614805},"labels":[],"label_agreement":null},{"id":"W2028556486","doi":"10.1007/s00224-011-9333-8","title":"The Complexity of the List Homomorphism Problem for Graphs","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Concordia University; McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Constraint satisfaction problem; Homomorphism; Combinatorics; Mathematics; Algebraic number; Discrete mathematics; Computational complexity theory; Graph; Computer science; Algorithm","score_opus":0.09207204870786918,"score_gpt":0.28761644459718155,"score_spread":0.19554439588931238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028556486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06958145,0.00073625555,0.91928387,0.00021400079,0.0012023143,0.0018840205,0.000017622524,0.00014589219,0.0069345944],"genre_scores_gemma":[0.98975664,0.0000034211632,0.009908312,0.000016651733,0.000035270383,0.000023259083,4.6772755e-7,0.000016427424,0.00023955523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728173,0.0009608248,0.0006117445,0.00029867253,0.0004257379,0.00042130233],"domain_scores_gemma":[0.9960842,0.0014855936,0.0006193394,0.0013541459,0.00039705695,0.00005968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049214377,0.00016686905,0.0003412216,0.000087608336,0.0005902821,0.000049782186,0.0032398652,0.00005264356,0.0000017731414],"category_scores_gemma":[0.0001584688,0.00009624876,0.00022688342,0.0005636332,0.0019240538,0.000115966075,0.0006105463,0.00018198075,0.0000020969433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049913626,0.00004872679,0.0002382908,0.00013374501,0.000047778874,3.5527268e-7,0.0025581438,0.000119953336,0.00069794763,0.993498,0.00009142636,0.002515671],"study_design_scores_gemma":[0.0003238625,0.00014427384,0.0012376107,0.00018723097,0.000009399439,0.000018143894,0.00034478944,0.012293944,0.004669146,0.9803484,0.0002952607,0.00012790214],"about_ca_topic_score_codex":0.000053865144,"about_ca_topic_score_gemma":0.0000064824903,"teacher_disagreement_score":0.9201752,"about_ca_system_score_codex":0.000023611243,"about_ca_system_score_gemma":0.00007207795,"threshold_uncertainty_score":0.70892566},"labels":[],"label_agreement":null},{"id":"W2028666977","doi":"10.1016/j.disc.2009.11.002","title":"Balanced Cayley graphs and balanced planar graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Cayley graph; Chordal graph; Indifference graph; Discrete mathematics; Pathwidth; Clique-sum; Planar graph; 1-planar graph; Graph; Line graph","score_opus":0.016906704231970684,"score_gpt":0.28275048225219723,"score_spread":0.2658437780202266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028666977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26413032,0.00087368157,0.71090126,0.0023872936,0.0002549316,0.0010772095,0.000038954742,0.0010934001,0.019242935],"genre_scores_gemma":[0.83422863,0.00015370702,0.16479607,0.00043284128,0.000016310029,0.000022745799,0.0000086420705,0.000023295854,0.00031775946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997957,0.00006982696,0.00036609752,0.00051307346,0.00050244917,0.00059158663],"domain_scores_gemma":[0.99831355,0.00021284758,0.00014226168,0.0010131459,0.00007962669,0.00023857759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043970929,0.00028194868,0.0003786462,0.00023837882,0.00020802529,0.00020236589,0.0010251808,0.00008857997,0.000010981712],"category_scores_gemma":[0.000120449644,0.0002360046,0.00010811019,0.0007349405,0.00016178029,0.00048536266,0.00013667266,0.0002517725,0.000033257264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010599464,0.000058227284,0.0003508262,0.000047409012,0.000020663136,0.000028746888,0.0011568922,0.000011749895,0.0031442803,0.9903571,0.00028526387,0.0045282515],"study_design_scores_gemma":[0.00049700344,0.00016940065,0.0024444584,0.00007067423,0.0000084909325,0.000048157184,0.0001513585,0.011767194,0.0015539293,0.9827614,0.00018825571,0.00033972206],"about_ca_topic_score_codex":0.0000024720205,"about_ca_topic_score_gemma":0.0000027266217,"teacher_disagreement_score":0.5700983,"about_ca_system_score_codex":0.000020499549,"about_ca_system_score_gemma":0.000026573796,"threshold_uncertainty_score":0.9623988},"labels":[],"label_agreement":null},{"id":"W2028766875","doi":"10.1016/j.dam.2014.10.017","title":"On triangulating <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-outerplanar graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Outerplanar graph; Graph; Discrete mathematics; Geometry; Pathwidth; Line graph","score_opus":0.017658212282446108,"score_gpt":0.2632708256364772,"score_spread":0.2456126133540311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028766875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7846969,0.000046831105,0.2038823,0.00016841228,0.00030439874,0.00019085422,0.000039633418,0.00033591912,0.010334798],"genre_scores_gemma":[0.90678644,0.000033291075,0.091773994,0.00052622234,0.00023648854,0.00030070284,0.00008317453,0.00016165734,0.0000980379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574655,0.000093061,0.0008839139,0.00093097007,0.001298869,0.0010466342],"domain_scores_gemma":[0.99548906,0.0013783162,0.0006687573,0.002042828,0.000066447676,0.00035457284],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014530105,0.0005222262,0.0004284267,0.00025038602,0.0006435473,0.00051215244,0.0017719644,0.00037458408,0.000027270185],"category_scores_gemma":[0.00047102603,0.0005429789,0.00043926263,0.00064273976,0.00034570447,0.0004727075,0.00090814946,0.00068602985,0.000991057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001179074,0.00014083431,0.0000021946869,0.00033976353,0.0001320555,0.00005183028,0.0015423653,0.0009849959,0.002162348,0.99158776,0.00020750462,0.0027304573],"study_design_scores_gemma":[0.0008356684,0.00028016578,0.000010873121,0.00024102014,0.000066523695,0.000059168593,0.00032474278,0.826742,0.0059214877,0.16455907,0.00047652997,0.00048277015],"about_ca_topic_score_codex":0.000017372406,"about_ca_topic_score_gemma":0.000016206639,"teacher_disagreement_score":0.8270287,"about_ca_system_score_codex":0.000023457305,"about_ca_system_score_gemma":0.00012035081,"threshold_uncertainty_score":0.9997868},"labels":[],"label_agreement":null},{"id":"W2028813890","doi":"10.1016/j.disc.2004.12.005","title":"Disjoint paths in arborescences","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Disjoint sets; Vertex (graph theory); Arc (geometry); Directed graph; Discrete mathematics; Tree (set theory); Graph","score_opus":0.021412973483374637,"score_gpt":0.30044547099507074,"score_spread":0.2790324975116961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028813890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0640418,0.0002187343,0.9210558,0.0016666326,0.00007886679,0.000332495,0.0000037986101,0.00019114919,0.012410733],"genre_scores_gemma":[0.66663456,0.000027766344,0.3329042,0.0000860806,0.000038546277,0.000027675524,0.0000010294906,0.000012130519,0.00026804712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863476,0.000051947118,0.00030327582,0.0002682262,0.00036929565,0.00037250033],"domain_scores_gemma":[0.99898905,0.00016674711,0.00007160374,0.0006513808,0.000031937157,0.00008928013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005044249,0.0001313623,0.00017951967,0.00015211779,0.00005514351,0.00010529422,0.000978994,0.000038483005,0.00002704055],"category_scores_gemma":[0.00014486875,0.00010395176,0.000057798312,0.00047858225,0.00008881022,0.00047706068,0.00029543776,0.0001740603,0.00015158449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027924802,0.0001270178,0.00047630872,0.0000449894,0.00000567421,0.00002075694,0.0035649939,0.000288533,0.0005023635,0.9693896,0.00008157581,0.025495404],"study_design_scores_gemma":[0.00039871325,0.00006817007,0.0011000292,0.00013631476,0.0000027246197,0.000017638737,0.0005148962,0.41597682,0.0036958922,0.57597333,0.0017330887,0.0003823485],"about_ca_topic_score_codex":0.0000026684925,"about_ca_topic_score_gemma":0.000023740693,"teacher_disagreement_score":0.6025927,"about_ca_system_score_codex":0.00004359445,"about_ca_system_score_gemma":0.000029351553,"threshold_uncertainty_score":0.42390296},"labels":[],"label_agreement":null},{"id":"W2028974574","doi":"10.1016/j.dam.2008.08.003","title":"Tree-width of graphs without a 3×3 grid minor","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Minor (academic); Combinatorics; Grid; Tree (set theory); Treewidth; Discrete mathematics; Graph; Pathwidth; Line graph; Geometry; Humanities","score_opus":0.02752094913056216,"score_gpt":0.27632646765058766,"score_spread":0.2488055185200255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028974574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10044424,0.000089285226,0.84913206,0.00008276942,0.00009021144,0.0006369031,0.000013250784,0.00024007338,0.049271204],"genre_scores_gemma":[0.53603953,0.000034305536,0.46349183,0.000042957312,0.000024077108,0.00006623193,0.000004198395,0.000027332128,0.00026954178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980825,0.000024828692,0.00045756513,0.00037694056,0.0006265873,0.00043156525],"domain_scores_gemma":[0.99817634,0.00021079702,0.00023261132,0.0011493356,0.000084762476,0.00014612875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031693737,0.00022954849,0.00042007313,0.00021657578,0.00014318318,0.000027828717,0.0012798826,0.00006976064,0.000022041388],"category_scores_gemma":[0.00005137142,0.00018924383,0.00013593581,0.00071835174,0.00035588723,0.00019858062,0.00035257544,0.00018072764,0.00006443046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018415209,0.00015725174,0.0002448159,0.00014627587,0.00004263526,0.000014628329,0.0028882814,0.000021725064,0.011514341,0.9812543,0.00034914384,0.003348201],"study_design_scores_gemma":[0.001085202,0.00015071484,0.00054253824,0.00006477679,0.000023306364,0.000095189134,0.00041962863,0.011277395,0.05530319,0.93003434,0.00044664997,0.00055706355],"about_ca_topic_score_codex":0.0000024355536,"about_ca_topic_score_gemma":0.0000024888209,"teacher_disagreement_score":0.4355953,"about_ca_system_score_codex":0.000014946043,"about_ca_system_score_gemma":0.000058447768,"threshold_uncertainty_score":0.771714},"labels":[],"label_agreement":null},{"id":"W2029352747","doi":"10.1016/j.disc.2007.12.088","title":"On the complexity of crossings in permutations","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Permutation (music); Minification; Discrete mathematics; Rank (graph theory); Complete bipartite graph; Monochromatic color; Graph; Mathematical optimization","score_opus":0.10620018999446688,"score_gpt":0.3393784880129924,"score_spread":0.23317829801852552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029352747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53163064,0.000014485271,0.45762768,0.0011098742,0.00002173916,0.00020402082,0.0000059388544,0.000035080728,0.009350573],"genre_scores_gemma":[0.95905393,0.000002871229,0.040672828,0.00006200902,0.000003434148,0.00001229515,7.5442637e-7,0.000005913119,0.0001859529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991344,0.000060821174,0.00021461135,0.00012804203,0.00029500498,0.00016709234],"domain_scores_gemma":[0.99879384,0.00051240105,0.00008104212,0.000530473,0.000052994605,0.000029270075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031931096,0.00007438873,0.00012728391,0.00008344052,0.00016762946,0.000030244291,0.0006806053,0.000019664656,0.00002036883],"category_scores_gemma":[0.00028656377,0.000047974845,0.000048788363,0.0004555186,0.0007692856,0.00013155329,0.00013487136,0.00013207649,0.000025549196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018818146,0.000055463708,0.000081638434,0.00001489587,0.0000028222296,0.00000503129,0.006388285,0.00012113517,0.00024354698,0.99295956,0.000057664973,0.00006806747],"study_design_scores_gemma":[0.00011473413,0.0000316988,0.0015515888,0.000034317898,7.188421e-7,0.0000120956865,0.00023179656,0.049557343,0.0015365585,0.9468462,0.000020572219,0.000062374136],"about_ca_topic_score_codex":0.0000058481155,"about_ca_topic_score_gemma":0.000005168924,"teacher_disagreement_score":0.42742333,"about_ca_system_score_codex":0.000017837488,"about_ca_system_score_gemma":0.000035144338,"threshold_uncertainty_score":0.2834465},"labels":[],"label_agreement":null},{"id":"W2029406200","doi":"10.1007/s00012-004-1819-7","title":"Finite posets and topological spaces in locally finite varieties","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Champlain Regional College; Concordia University","funders":"","keywords":"Mathematics; Partially ordered set; Homotopy; Type (biology); Variety (cybernetics); Pure mathematics; Space (punctuation); Star product; Topological space; Topology (electrical circuits); Discrete mathematics; Combinatorics; Computer science","score_opus":0.014693610085184085,"score_gpt":0.2526336100076269,"score_spread":0.23793999992244283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029406200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40989128,0.0011764403,0.5545324,0.016815864,0.00018183129,0.00042090673,0.000014502883,0.00043192983,0.016534861],"genre_scores_gemma":[0.9822796,0.00017729055,0.016147912,0.0005569065,0.000029277247,0.0000028913764,0.0000024122846,0.000007636097,0.00079610193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871194,0.00014946562,0.00013931855,0.00039070842,0.00022958044,0.00037896272],"domain_scores_gemma":[0.99877864,0.000636582,0.000040254527,0.0003675267,0.000052547628,0.00012442359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028066675,0.00013983643,0.0001587066,0.00026920164,0.000113455295,0.00011978778,0.0006648864,0.000091220376,0.00007244508],"category_scores_gemma":[0.00015181536,0.00013002052,0.000035422996,0.00056885363,0.0003118873,0.0008882825,0.000467252,0.00023955973,0.00004361292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040143354,0.000052756426,0.002155014,0.000006115174,0.000012196985,0.00013660674,0.0022411083,0.0012336504,0.00009389773,0.97458196,0.00014301017,0.019303516],"study_design_scores_gemma":[0.003393509,0.00093287986,0.017312184,0.00008024697,0.000015518364,0.00007054103,0.0020064067,0.13808958,0.0025641373,0.7526231,0.081638895,0.0012730025],"about_ca_topic_score_codex":0.000066126515,"about_ca_topic_score_gemma":0.00016848157,"teacher_disagreement_score":0.5723883,"about_ca_system_score_codex":0.00004701573,"about_ca_system_score_gemma":0.000046641602,"threshold_uncertainty_score":0.53020823},"labels":[],"label_agreement":null},{"id":"W2029854525","doi":"10.1016/j.jcss.2003.12.001","title":"Approximation algorithms for classes of graphs excluding single-crossing graphs as minors","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Clique-sum; 1-planar graph; Partial k-tree; Pathwidth; Chordal graph; Combinatorics; Indifference graph; Mathematics; Discrete mathematics; Maximal independent set; Tree-depth; Planar graph; Independent set; Vertex cover; Cograph; Time complexity; Graph; Line graph","score_opus":0.06961559235493293,"score_gpt":0.3323560924359493,"score_spread":0.2627405000810164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029854525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29727295,0.0004759259,0.701362,0.00011447408,0.00048657422,0.00013520762,8.092274e-7,0.0000173505,0.00013468304],"genre_scores_gemma":[0.71104485,0.000008930742,0.28886017,0.000016757476,0.000060020073,0.0000019300956,9.281061e-8,0.0000036277345,0.0000036188521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979674,0.00010584088,0.0006474662,0.00027186112,0.0007066444,0.00030076533],"domain_scores_gemma":[0.99828386,0.00035166147,0.0006455713,0.00016634067,0.0004245271,0.00012802152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021981178,0.0001373024,0.0003579654,0.00065092026,0.00050684443,0.0006047759,0.0009005125,0.00004590524,2.6871774e-7],"category_scores_gemma":[0.000043549026,0.00010083044,0.00016302791,0.00093888945,0.00052373135,0.0014795328,0.00012771736,0.000104594066,3.7992768e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005172482,0.00017732488,0.001423323,0.000517036,0.0000745812,0.000032004224,0.004446792,0.008612424,0.010302701,0.8570702,0.000036742254,0.11725512],"study_design_scores_gemma":[0.0037342124,0.0060230917,0.002407978,0.00264507,0.000045737717,0.0033194418,0.0034106525,0.19158223,0.041967485,0.74394935,0.0002089692,0.00070577284],"about_ca_topic_score_codex":0.0000070369297,"about_ca_topic_score_gemma":0.0000011579713,"teacher_disagreement_score":0.4137719,"about_ca_system_score_codex":0.00004785849,"about_ca_system_score_gemma":0.00020027818,"threshold_uncertainty_score":0.5831868},"labels":[],"label_agreement":null},{"id":"W2029943728","doi":"10.1016/j.jctb.2012.07.004","title":"A generalization of Littleʼs Theorem on Pfaffian orientations","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Pfaffian; Disjoint sets; Matching (statistics); Discrete mathematics; Cograph; Graph; Chordal graph; 1-planar graph","score_opus":0.01697318881866508,"score_gpt":0.2949306128611698,"score_spread":0.2779574240425047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029943728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44751278,0.0008582273,0.51978534,0.00075356977,0.018483743,0.00042956948,0.000011032635,0.00009066896,0.012075094],"genre_scores_gemma":[0.99313325,0.000049727365,0.0059701786,0.000058602407,0.0005802835,0.0000033920887,0.0000011677682,0.00001532691,0.0001880494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777585,0.0006770303,0.0005192025,0.00011420494,0.000610743,0.00030295944],"domain_scores_gemma":[0.9978287,0.0004955771,0.0005371066,0.0004178445,0.0005352763,0.00018548779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023180656,0.00014009538,0.00027930748,0.00031321635,0.00013564882,0.00005386145,0.000835636,0.00006945502,0.000060119986],"category_scores_gemma":[0.0006227396,0.0001130216,0.00014892376,0.0006890876,0.00020399617,0.0017226886,0.00012337671,0.0002412868,0.000008466305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044719066,0.00023296189,0.00032521176,0.000009586824,0.000043857235,0.000003897801,0.0017087001,0.00014490118,0.0020794082,0.9925693,0.00014280617,0.0022921553],"study_design_scores_gemma":[0.0007779843,0.00083379756,0.00035816416,0.000038213504,0.000012778479,0.000051557767,0.00027450852,0.000027411612,0.035838857,0.9577775,0.0038895272,0.00011967271],"about_ca_topic_score_codex":6.161531e-7,"about_ca_topic_score_gemma":1.4632101e-7,"teacher_disagreement_score":0.5456205,"about_ca_system_score_codex":0.000065853936,"about_ca_system_score_gemma":0.00011078161,"threshold_uncertainty_score":0.46088868},"labels":[],"label_agreement":null},{"id":"W2030195206","doi":"10.1007/s11425-011-4222-9","title":"Toughness and [a, b]-factors with inclusion/exclusion properties","year":2011,"lang":"en","type":"article","venue":"Science China Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Graph; Inclusion (mineral); Combinatorics; Toughness; Factor (programming language); Discrete mathematics; Composite material; Physics; Computer science","score_opus":0.04418725558374218,"score_gpt":0.26822547693627613,"score_spread":0.22403822135253396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030195206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8264234,0.00006185092,0.16908123,0.00009519742,0.000071553906,0.00024264459,4.92128e-7,0.00012956122,0.003894096],"genre_scores_gemma":[0.8617914,0.000010671528,0.13798459,0.000022213411,0.000006565299,0.000008496527,9.5083145e-8,0.000009434496,0.00016656338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980064,0.00003129664,0.00018631012,0.00045719426,0.00087655796,0.00044226687],"domain_scores_gemma":[0.9987578,0.000047724254,0.000098140124,0.0007567831,0.00014252988,0.00019704844],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010841528,0.00017204812,0.00017438001,0.00025313415,0.0013022361,0.0001693764,0.0018654494,0.000031415173,0.000012366376],"category_scores_gemma":[0.00019437585,0.00009909666,0.000020488678,0.0012674199,0.0012948905,0.0016846637,0.003953484,0.00014936012,0.000009329138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024893501,0.0003942119,0.0030738104,0.00020945177,0.000010402731,0.00003145391,0.1951675,0.000028116978,0.028933302,0.76314765,0.000010918672,0.008968278],"study_design_scores_gemma":[0.00041573268,0.00055493927,0.015087473,0.00029793524,0.000008772773,0.0001292744,0.0022293383,0.05340254,0.1515145,0.77564555,0.00006022446,0.00065372995],"about_ca_topic_score_codex":0.00001493981,"about_ca_topic_score_gemma":0.000004850093,"teacher_disagreement_score":0.19293816,"about_ca_system_score_codex":0.00004231027,"about_ca_system_score_gemma":0.00015464977,"threshold_uncertainty_score":0.9999979},"labels":[],"label_agreement":null},{"id":"W2030552895","doi":"10.1007/s00224-007-1325-3","title":"Algorithms in the W-Hierarchy","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hierarchy; Intersection (aeronautics); Mathematical proof; Extension (predicate logic); Set (abstract data type); Mathematics; Upper and lower bounds; Algorithm; Computer science; State (computer science); Discrete mathematics; Finite-state machine; Combinatorics; Theoretical computer science; Programming language; Engineering","score_opus":0.0302898493409319,"score_gpt":0.31553094789313363,"score_spread":0.2852410985522017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030552895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113554046,0.0004779067,0.8770537,0.00007344604,0.00039130574,0.0003174102,5.864129e-7,0.00008309704,0.008048524],"genre_scores_gemma":[0.9920801,0.0000022292938,0.007611573,0.00007377514,0.00011510114,0.000002898566,4.664228e-7,0.000009789998,0.00010406279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970555,0.0010333585,0.0005058944,0.0003007109,0.00058576814,0.00051876745],"domain_scores_gemma":[0.99595094,0.0028701033,0.00016960964,0.00085435004,0.00009783893,0.000057174333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016545834,0.00013336093,0.0002459705,0.00033075718,0.00012558427,0.00007114197,0.0022120979,0.00005271568,0.0000014852823],"category_scores_gemma":[0.00015203586,0.00009459269,0.000069478956,0.0010895835,0.00021120433,0.00017101472,0.00025812842,0.00029926907,0.000017052329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017678989,0.00004590408,0.00034622976,0.000034864093,0.000009150084,0.000033485525,0.005394362,0.0011714284,0.00033405988,0.95781535,0.000022735861,0.034774777],"study_design_scores_gemma":[0.0017206545,0.00052341074,0.02229135,0.0005994526,0.000008610391,0.00047189943,0.0074990625,0.14929405,0.0033893462,0.81064457,0.0027845707,0.00077304756],"about_ca_topic_score_codex":0.000019863217,"about_ca_topic_score_gemma":0.0000020992788,"teacher_disagreement_score":0.87852603,"about_ca_system_score_codex":0.000038480695,"about_ca_system_score_gemma":0.000036592082,"threshold_uncertainty_score":0.57344884},"labels":[],"label_agreement":null},{"id":"W2031098440","doi":"10.5539/jmr.v5n3p11","title":"On $(2,t)$-Choosability of Triangle-Free Graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Rangsit University","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.1055819822700717,"score_gpt":0.398705257670632,"score_spread":0.29312327540056027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031098440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8428475,0.00034412617,0.1406788,0.0036055928,0.00025945783,0.0009987835,0.0000052425785,0.00003519663,0.011225299],"genre_scores_gemma":[0.85427415,0.000074270094,0.14509167,0.000026531521,0.000051705243,0.000019735255,1.3811035e-7,0.000022166645,0.0004396091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947742,0.00070287025,0.0009515611,0.00021501767,0.0028166657,0.00053968217],"domain_scores_gemma":[0.9902229,0.005105961,0.00043160922,0.0016467302,0.0022925301,0.00030031326],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.010300942,0.00013641505,0.00049125234,0.0011478872,0.000121502926,0.00014800568,0.003955113,0.00008643597,0.0002126684],"category_scores_gemma":[0.00840749,0.00009695386,0.00026792384,0.0013986373,0.0004112409,0.0007048785,0.000683306,0.0010353497,0.00011461944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006057458,0.001354272,0.00018275657,0.00028096273,0.00008269189,0.000032201482,0.001227386,0.000081020225,0.009167273,0.96618813,0.00903482,0.012307897],"study_design_scores_gemma":[0.0007815475,0.00089387957,0.00042400105,0.00014510586,0.0000025730558,0.000047740945,0.00028358586,0.0025238707,0.009768866,0.9849448,0.000101355785,0.000082641534],"about_ca_topic_score_codex":0.00000963342,"about_ca_topic_score_gemma":0.0000015620674,"teacher_disagreement_score":0.018756688,"about_ca_system_score_codex":0.000101023536,"about_ca_system_score_gemma":0.0002337259,"threshold_uncertainty_score":0.9999451},"labels":[],"label_agreement":null},{"id":"W2031490867","doi":"10.1006/jctb.2000.1967","title":"On the Excluded Minors for Quaternary Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; National Security Agency","keywords":"Matroid; Disjoint sets; Combinatorics; Minor (academic); Rank (graph theory); Hyperplane; Mathematics; Characterization (materials science); Graphic matroid; Discrete mathematics; Physics; Law; Political science","score_opus":0.01675583223072613,"score_gpt":0.27798542796126846,"score_spread":0.26122959573054233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031490867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.893822,0.00044513418,0.07684356,0.007007274,0.009879013,0.00088616385,0.000010169479,0.00011743727,0.010989265],"genre_scores_gemma":[0.99213016,0.000070575545,0.0032877557,0.00039494273,0.000708461,0.000021492539,4.6249428e-7,0.000028108276,0.003358017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979088,0.00054474437,0.0004499204,0.00018018132,0.0005619306,0.00035447587],"domain_scores_gemma":[0.9969809,0.001816025,0.0002500941,0.00056953414,0.0002555638,0.0001278487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002629562,0.0001778769,0.00028663562,0.00013248734,0.00029077494,0.00017220691,0.0019996567,0.00006831734,0.0003021988],"category_scores_gemma":[0.00040338183,0.00011168582,0.0002565666,0.00031064285,0.000219493,0.0008257967,0.000095265495,0.00036096742,0.00003113082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025049532,0.00009603048,0.000008966127,0.0000065823338,0.000052423486,0.00002534559,0.00035790593,0.00007372174,0.00043605067,0.98562723,0.0018460788,0.008964721],"study_design_scores_gemma":[0.0010514926,0.0016760359,0.000027719547,0.000032315056,0.000008137664,0.00009926717,0.00008729479,0.00010224395,0.006742592,0.96968466,0.020360028,0.00012822481],"about_ca_topic_score_codex":5.983505e-7,"about_ca_topic_score_gemma":1.3918084e-7,"teacher_disagreement_score":0.0983082,"about_ca_system_score_codex":0.00005750793,"about_ca_system_score_gemma":0.00009911985,"threshold_uncertainty_score":0.45544153},"labels":[],"label_agreement":null},{"id":"W2031691607","doi":"10.1007/s10878-012-9547-y","title":"Paired versus double domination in K 1,r -free graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Induced subgraph; Vertex (graph theory); Domination analysis; Graph; Bipartite graph; Discrete mathematics","score_opus":0.026302531656783684,"score_gpt":0.29455605431372744,"score_spread":0.26825352265694374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031691607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011265336,0.00076509255,0.96602166,0.0014416085,0.018361539,0.00024763355,6.133678e-7,0.000040173738,0.0018563238],"genre_scores_gemma":[0.82579756,0.00013098282,0.17356655,0.00002566196,0.0004136647,0.0000063885514,0.0000018229349,0.000015637319,0.000041749827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984158,0.00019491719,0.00042305668,0.00010296283,0.00056960323,0.0002936052],"domain_scores_gemma":[0.9985484,0.00021372431,0.0003433373,0.00031493435,0.0004029456,0.0001766506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016893535,0.00009967206,0.00018740968,0.0005269995,0.000061268394,0.0000791923,0.0007692394,0.000088528766,0.00001434327],"category_scores_gemma":[0.00057865935,0.000096442316,0.000081704755,0.0010550448,0.000040111954,0.0031449962,0.00013293063,0.00024187387,0.0000032722191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010322349,0.0003492175,0.00057061785,0.000008631321,0.000021046531,0.000009306345,0.0004987763,0.068518735,0.00010395229,0.92511564,0.0008167665,0.0029550702],"study_design_scores_gemma":[0.051704388,0.0014971746,0.0009774688,0.00013109617,0.000036525547,0.000084544976,0.00015207946,0.08259235,0.0052338704,0.8540721,0.0029302218,0.00058820966],"about_ca_topic_score_codex":0.0000033669291,"about_ca_topic_score_gemma":3.5366438e-7,"teacher_disagreement_score":0.8145322,"about_ca_system_score_codex":0.00016357466,"about_ca_system_score_gemma":0.00010889282,"threshold_uncertainty_score":0.39328033},"labels":[],"label_agreement":null},{"id":"W2031928820","doi":"10.1007/s00373-012-1224-5","title":"Paired-Domination in Claw-Free Graphs","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Claw; Mathematics; Combinatorics; Discrete mathematics; Biology","score_opus":0.01856724002713184,"score_gpt":0.25932418640361954,"score_spread":0.2407569463764877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031928820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95393354,0.0048679626,0.03208891,0.00085099874,0.0013569946,0.000512388,0.000004560645,0.00031924518,0.0060654073],"genre_scores_gemma":[0.99769396,0.0002873837,0.0017665557,0.000091020716,0.000008876874,0.00003638664,0.0000017328152,0.000011405358,0.00010266431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984381,0.00013481356,0.00021031068,0.0002971754,0.0003646179,0.0005549722],"domain_scores_gemma":[0.9988146,0.00017059708,0.00006220412,0.00067418866,0.00007795523,0.00020048989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000873322,0.00015610842,0.00017670731,0.00047271978,0.000150119,0.000079688616,0.0007950252,0.000090280344,0.000003735886],"category_scores_gemma":[0.00010362679,0.00015063712,0.00006115671,0.0016948181,0.000107950276,0.0009590341,0.00041656915,0.00025182756,0.000007470025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006098388,0.00014019571,0.05166003,0.0000126416835,0.000005037088,0.000005188812,0.000369272,0.0000010470824,0.00006471585,0.9371585,0.00024902847,0.010328223],"study_design_scores_gemma":[0.0007843444,0.000078365025,0.050499234,0.000011283711,0.0000024024116,0.000010581551,0.00006027292,0.00061975315,0.00032724545,0.94630444,0.0011156058,0.00018645714],"about_ca_topic_score_codex":0.000015072659,"about_ca_topic_score_gemma":0.000006100171,"teacher_disagreement_score":0.04376044,"about_ca_system_score_codex":0.000037496244,"about_ca_system_score_gemma":0.000019869689,"threshold_uncertainty_score":0.61428034},"labels":[],"label_agreement":null},{"id":"W2032266235","doi":"10.1007/s11425-010-3079-7","title":"Constructive proof of deficiency theorem of (g, f)-factor","year":2010,"lang":"en","type":"article","venue":"Science in China Series A Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Constructive proof; Constructive; Combinatorics; Discrete mathematics; Graph; Decomposition theorem","score_opus":0.013783485229141917,"score_gpt":0.2927466861251646,"score_spread":0.27896320089602267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032266235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9281069,0.000014442818,0.06545779,0.00008923674,0.00031065816,0.000321246,0.000008176347,0.000028093811,0.0056634373],"genre_scores_gemma":[0.776372,0.0000028754182,0.22357717,0.0000024891144,0.000005467838,0.00000799244,7.6912734e-8,0.0000052860228,0.000026627213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979084,0.000036845424,0.00048121772,0.00035242137,0.00081365654,0.00040742758],"domain_scores_gemma":[0.998109,0.00023679069,0.00031229414,0.0009653474,0.00029182862,0.000084763706],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015139673,0.00014024005,0.00029442628,0.00042581584,0.00011290206,0.000055575147,0.0024773343,0.000050011633,0.00002772381],"category_scores_gemma":[0.0013299627,0.00010907983,0.000053227683,0.0024832273,0.0039998614,0.0013413669,0.00059690984,0.0002908831,0.0000018041274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056536423,0.00012777183,0.0011969095,0.00009678543,0.0000011580645,0.0000017703809,0.0064396965,0.000027720509,0.07632375,0.91234905,6.34319e-7,0.003429107],"study_design_scores_gemma":[0.00011266957,0.00013548338,0.002779896,0.000047008383,9.722063e-7,0.000039165905,0.00066575926,0.0048250277,0.2587656,0.7325111,0.0000052071236,0.000112095724],"about_ca_topic_score_codex":0.000005802331,"about_ca_topic_score_gemma":0.000017270417,"teacher_disagreement_score":0.18244188,"about_ca_system_score_codex":0.000024698335,"about_ca_system_score_gemma":0.0004064941,"threshold_uncertainty_score":0.9987107},"labels":[],"label_agreement":null},{"id":"W2032278054","doi":"10.1007/s00224-014-9557-5","title":"On the Parameterized Complexity of Computing Balanced Partitions in Graphs","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Combinatorics; Vertex (graph theory); Partition (number theory); Vertex cover; Mathematics; Neighbourhood (mathematics); Time complexity; Feedback vertex set; Graph partition; Constant (computer programming); Graph; Bisection; Computer science; Geometry","score_opus":0.057347222567492515,"score_gpt":0.30228049710186444,"score_spread":0.24493327453437191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032278054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54710186,0.00003179609,0.4505613,0.000088613604,0.00021006826,0.00032567116,0.0000031956588,0.00007843596,0.0015990571],"genre_scores_gemma":[0.99481386,0.00000137427,0.0050415536,0.00007262536,0.000029455481,0.000007389266,0.000001918646,0.000015346572,0.000016470494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487233,0.002894902,0.0008223386,0.00041524222,0.00051612227,0.0004790729],"domain_scores_gemma":[0.99167436,0.0063728923,0.0005439658,0.0011620997,0.00017270895,0.00007399282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067347735,0.00021265038,0.00061396265,0.00030638464,0.00020890878,0.000057323137,0.0016265012,0.00006337881,0.000006870931],"category_scores_gemma":[0.0006644717,0.00016104034,0.00014872485,0.0009959762,0.0007758318,0.00010986494,0.00036226303,0.0003242563,0.000010724726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004347043,0.00008999281,0.00047112262,0.00008569577,0.000024149549,0.0000011569604,0.001232768,0.018638972,0.002368505,0.97528064,0.000015820717,0.0017477077],"study_design_scores_gemma":[0.0006330578,0.00020961427,0.005121348,0.00053602003,0.000003947829,0.00000814514,0.00022109617,0.33961025,0.002095231,0.65136725,0.000015758458,0.00017829896],"about_ca_topic_score_codex":0.00003341072,"about_ca_topic_score_gemma":0.0000026562527,"teacher_disagreement_score":0.44771203,"about_ca_system_score_codex":0.000034757108,"about_ca_system_score_gemma":0.000034334967,"threshold_uncertainty_score":0.6567035},"labels":[],"label_agreement":null},{"id":"W2032387361","doi":"10.1016/j.ejc.2010.06.002","title":"A conjecture of Welsh revisited","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Combinatorics; Conjecture; Mathematics; Welsh; Simple (philosophy); Discrete mathematics","score_opus":0.011226861763532355,"score_gpt":0.2564675826925108,"score_spread":0.24524072092897845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032387361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48395276,0.0010043995,0.48321316,0.0012399679,0.0029014535,0.00018507561,0.0000031787558,0.00007418387,0.027425816],"genre_scores_gemma":[0.99059093,0.000039677685,0.009056007,0.0000525116,0.00007831122,1.0986908e-7,1.7623425e-7,0.000016417298,0.00016586676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982268,0.00045750092,0.00047786714,0.00012945419,0.000508613,0.00019973613],"domain_scores_gemma":[0.99797255,0.00018558669,0.0005176756,0.00053923717,0.0006112867,0.00017366189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022682946,0.0001087908,0.00024194717,0.00026633864,0.00005821694,0.000059002767,0.0017850715,0.000024608707,0.000021462203],"category_scores_gemma":[0.0005022588,0.00008819037,0.00012952804,0.00075113634,0.000102293365,0.0003628075,0.00024649204,0.0008254143,0.000018706402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028870747,0.000141687,0.0012843311,0.000028045419,0.000036096826,0.00052002165,0.0003415536,0.000021899174,0.018399006,0.9647257,0.0016259915,0.012846832],"study_design_scores_gemma":[0.006172417,0.003778803,0.026983999,0.00031610805,0.00004863483,0.0025639005,0.00008448515,0.000912806,0.04315087,0.7099281,0.2052404,0.0008195159],"about_ca_topic_score_codex":1.3377205e-7,"about_ca_topic_score_gemma":6.955348e-8,"teacher_disagreement_score":0.50663817,"about_ca_system_score_codex":0.000012801574,"about_ca_system_score_gemma":0.0000732724,"threshold_uncertainty_score":0.3596299},"labels":[],"label_agreement":null},{"id":"W2032487621","doi":"10.1145/1970398.1970400","title":"Complexity of conservative constraint satisfaction problems","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Unary operation; Constraint satisfaction problem; Mathematics; Constraint satisfaction; Constraint (computer-aided design); Constraint logic programming; Set (abstract data type); Constraint programming; Time complexity; Complexity of constraint satisfaction; Mathematical proof; Constraint graph; Local consistency; Constraint satisfaction dual problem; Variable (mathematics); Discrete mathematics; Computer science; Mathematical optimization; Programming language","score_opus":0.16576442378401363,"score_gpt":0.32053909798757435,"score_spread":0.15477467420356072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032487621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012010832,0.000014476308,0.98520035,0.0005435931,0.00013090785,0.00031996483,0.000038621034,0.00014148782,0.0015997989],"genre_scores_gemma":[0.669648,0.000003940199,0.330145,0.00014422297,0.0000037430925,0.000026397605,0.000004261858,0.000005445033,0.000018972552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984904,0.00018819414,0.00033779888,0.00036183806,0.0003978117,0.00022397433],"domain_scores_gemma":[0.99837595,0.00056203606,0.00014624896,0.00046754556,0.0003586937,0.000089515706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027670249,0.00015309766,0.00019658967,0.00024605665,0.00021059257,0.000021151754,0.0006286067,0.000059411777,0.00024755715],"category_scores_gemma":[0.00004948295,0.00014580012,0.00010282581,0.00058607676,0.00068313937,0.00038293895,0.000023037212,0.00025137226,0.00005813881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059715545,0.00031445533,0.00059804996,0.000025608979,0.00007669454,0.0000060206326,0.0009979744,0.04329232,0.00031288379,0.92084503,0.000011908534,0.033459324],"study_design_scores_gemma":[0.00041779532,0.00035884845,0.034202706,0.00002164947,0.0000060003163,0.000031633943,0.00008068935,0.019593913,0.0017323183,0.9433887,0.000015805843,0.00014996094],"about_ca_topic_score_codex":0.00007661943,"about_ca_topic_score_gemma":0.000031416443,"teacher_disagreement_score":0.6576372,"about_ca_system_score_codex":0.000056499004,"about_ca_system_score_gemma":0.00011721421,"threshold_uncertainty_score":0.5945556},"labels":[],"label_agreement":null},{"id":"W2032633417","doi":"","title":"A fractional model of the border gateway protocol (BGP)","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Border Gateway Protocol; Computer science; Interior gateway protocol; Default-free zone; Routing protocol; Computer network; Path vector protocol; Shortest path problem; Routing (electronic design automation); Distributed computing; Graph; Link-state routing protocol; Theoretical computer science","score_opus":0.04968345540949942,"score_gpt":0.355288407323582,"score_spread":0.3056049519140826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032633417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018448688,0.0000011622946,0.96433926,0.00056228973,0.0000239324,0.0137775615,0.0000010183394,0.000053398067,0.019396493],"genre_scores_gemma":[0.62199944,0.000001772023,0.28598204,0.0007783219,0.000047531947,0.06046378,3.2580436e-7,0.000021307162,0.030705495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990878,0.000049144986,0.00012255624,0.00017284318,0.00040515247,0.00016251343],"domain_scores_gemma":[0.99920684,0.000061650186,0.000045545738,0.0005198708,0.00012688556,0.00003919162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014208486,0.00006026975,0.00006587822,0.00004658334,0.00014645793,0.000009601218,0.0008223685,0.000025829318,0.00009770031],"category_scores_gemma":[0.000039350016,0.000035861238,0.00005640962,0.00035798457,0.00014794407,0.00030974258,0.00028562598,0.00012815707,0.000020805746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053712574,0.00027965952,0.0019095197,0.000020892878,0.000018117018,0.00000361627,0.00049453176,0.045388147,0.011783724,0.9327344,0.0028178107,0.004495873],"study_design_scores_gemma":[0.0005288869,0.000047399102,0.0015332145,0.0000074495124,5.6131296e-7,0.000027782835,0.00000883077,0.776235,0.036990337,0.17987198,0.0046305507,0.00011802164],"about_ca_topic_score_codex":0.000007283921,"about_ca_topic_score_gemma":0.000002518734,"teacher_disagreement_score":0.75286245,"about_ca_system_score_codex":0.00001455725,"about_ca_system_score_gemma":0.00015889684,"threshold_uncertainty_score":0.15281789},"labels":[],"label_agreement":null},{"id":"W2032795059","doi":"10.1504/ijitcc.2011.042124","title":"On the top-down evaluation of tree inclusion problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Information Technology Communications and Convergence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Tree (set theory); Mathematics; Space (punctuation); Matching (statistics); Node (physics); Set (abstract data type); Discrete mathematics; Computer science; Physics; Statistics","score_opus":0.03999548666942057,"score_gpt":0.32010495912081555,"score_spread":0.28010947245139495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032795059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2564964,0.0009948612,0.7008951,0.024961775,0.0005140132,0.00062118535,0.000010320056,0.00007245973,0.015433935],"genre_scores_gemma":[0.97050583,0.00042306376,0.02889863,0.00014583627,0.0000037233585,0.000015503898,0.0000015418015,0.0000016227892,0.0000042508614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862164,0.00012287135,0.0004966881,0.000052425297,0.0006307268,0.00007562691],"domain_scores_gemma":[0.9962924,0.00019139524,0.0006154977,0.000670278,0.002206025,0.000024398689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001767339,0.00006304378,0.00008710507,0.00060366985,0.00018746855,0.00002500259,0.0033856055,0.00005559614,0.00005486292],"category_scores_gemma":[0.00038824993,0.00004414798,0.00003859626,0.00043095436,0.00028287037,0.0011693857,0.0014955723,0.00024795436,0.0000085155925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016951126,0.00004210783,0.00054771896,0.0000014336345,0.000031722215,1.6527396e-7,0.0013308863,0.000015565367,0.00032460486,0.8018705,0.00004106513,0.19577727],"study_design_scores_gemma":[0.00053283304,0.0002076072,0.0022097286,0.000073175805,0.000011981263,0.000043132593,0.0005750403,0.020236911,0.010700301,0.9636874,0.001642148,0.000079733676],"about_ca_topic_score_codex":0.0000054472057,"about_ca_topic_score_gemma":0.0000028836514,"teacher_disagreement_score":0.7140094,"about_ca_system_score_codex":0.000050034403,"about_ca_system_score_gemma":0.00011970092,"threshold_uncertainty_score":0.6291354},"labels":[],"label_agreement":null},{"id":"W2033055525","doi":"10.5555/365411.365423","title":"I/O-efficient algorithms for graphs of bounded treewidth","year":2001,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Treewidth; Tree decomposition; Partial k-tree; Bounded function; Computer science; Tree-depth; Shortest path problem; Combinatorics; Pathwidth; 1-planar graph; Graph algorithms; Algorithm; Graph; Discrete mathematics; Mathematics; Chordal graph; Theoretical computer science; Line graph","score_opus":0.042809701453073244,"score_gpt":0.32966203564579555,"score_spread":0.2868523341927223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033055525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02533439,0.000067421315,0.96839637,0.00035726372,0.00011986497,0.00032363308,0.000002913135,0.00010719853,0.005290953],"genre_scores_gemma":[0.621018,0.000014241031,0.37658742,0.00010758701,0.000020260299,0.00005323141,0.0000015082918,0.000011548713,0.0021861927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878365,0.000036814632,0.00019844146,0.0003116613,0.0003059747,0.0003634862],"domain_scores_gemma":[0.9988985,0.00021578587,0.000054351498,0.0005666965,0.00016913482,0.000095500545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042321743,0.00009660944,0.0001498912,0.00021298516,0.00009484789,0.000037402828,0.0008339675,0.00003446124,0.000028595967],"category_scores_gemma":[0.00005355191,0.000079279154,0.00011659351,0.00080188544,0.00011705354,0.00010153237,0.00015305135,0.00006081149,0.000011109739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025542176,0.00012911299,0.00017935311,0.000008314282,0.000013476099,0.0000039442857,0.000117266216,0.0006333546,0.0012351095,0.9321964,0.00017308124,0.065285064],"study_design_scores_gemma":[0.0008706693,0.00031561914,0.0004658784,0.000008340987,0.0000031547827,0.000016870825,0.00005319548,0.37119094,0.009354761,0.6135111,0.004027558,0.00018191281],"about_ca_topic_score_codex":0.000010818069,"about_ca_topic_score_gemma":0.0000065673244,"teacher_disagreement_score":0.59568363,"about_ca_system_score_codex":0.000019595856,"about_ca_system_score_gemma":0.000043509794,"threshold_uncertainty_score":0.323291},"labels":[],"label_agreement":null},{"id":"W2033177498","doi":"10.1016/j.jctb.2004.11.001","title":"Planar graphs without cycles of length from 4 to 7 are 3-colorable","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Planar graph; Combinatorics; Mathematics; Conjecture; Graph coloring; Graph; Plane (geometry); Discrete mathematics; Geometry","score_opus":0.014152304707623579,"score_gpt":0.2708427278237021,"score_spread":0.25669042311607854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033177498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9013063,0.0005247546,0.09067319,0.0011076159,0.004841419,0.00028825653,0.0000216237,0.000065401175,0.0011714417],"genre_scores_gemma":[0.9813344,0.000052788873,0.018211087,0.00009468329,0.00021692594,0.0000041279,6.1528584e-7,0.000020806545,0.00006459902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761975,0.00035668467,0.00064121524,0.0002444159,0.0007761444,0.00036180133],"domain_scores_gemma":[0.9975355,0.00041404055,0.00064678886,0.00058830396,0.00053659885,0.0002787453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001432451,0.00020919717,0.0006003382,0.00038223137,0.0001492356,0.00009607755,0.0018033405,0.000099666446,0.000026596266],"category_scores_gemma":[0.00052014407,0.00017671309,0.00019712189,0.00071767473,0.00023143073,0.0013073765,0.00021333311,0.000405081,0.000011267248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001209463,0.00018504848,0.0008772646,0.000011518268,0.00010917873,0.00007540925,0.0010403353,0.0006473445,0.005218719,0.98977804,0.00013132075,0.00071638025],"study_design_scores_gemma":[0.001671496,0.0011072129,0.0012561984,0.00014354159,0.000014515801,0.00004080278,0.00048212966,0.000003253508,0.043409508,0.9504202,0.0012749524,0.00017621541],"about_ca_topic_score_codex":0.000014413419,"about_ca_topic_score_gemma":0.0000047069766,"teacher_disagreement_score":0.08002807,"about_ca_system_score_codex":0.00009439845,"about_ca_system_score_gemma":0.00022631856,"threshold_uncertainty_score":0.7206151},"labels":[],"label_agreement":null},{"id":"W2033972173","doi":"10.7151/dmgt.1205","title":"On maximal finite antichains in the homomorphism order of directed graphs","year":2003,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Homomorphism; Mathematics; Combinatorics; Algebra homomorphism; Tree (set theory); Discrete mathematics; Order (exchange); Dual (grammatical number)","score_opus":0.019116565520654952,"score_gpt":0.2735449358042366,"score_spread":0.2544283702835817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033972173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26926565,0.00043299454,0.69995886,0.0011892006,0.00034056272,0.0016478063,0.000024446212,0.0003925875,0.026747884],"genre_scores_gemma":[0.98444283,0.00003765203,0.014895543,0.00022069168,0.000005597584,0.00011829735,0.0000032306905,0.0000311663,0.00024496243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580926,0.0017002155,0.0005763974,0.0005255843,0.00080325216,0.0005852945],"domain_scores_gemma":[0.9947539,0.0031635086,0.00021166688,0.0016345739,0.00013192797,0.00010440777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033234,0.0003233768,0.00044954752,0.0007697557,0.00022916467,0.000069873095,0.001749199,0.00009942886,0.00011788962],"category_scores_gemma":[0.0018155515,0.00016896,0.00022505767,0.003307805,0.0005245638,0.0002914711,0.00015691739,0.00041079975,0.000048675305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048262293,0.00064173905,0.00015787699,0.000060871072,0.000027089713,0.000032811367,0.0035341585,0.000068351845,0.0003915595,0.99387,0.00006084825,0.0011063978],"study_design_scores_gemma":[0.0005444479,0.00013819397,0.00086379144,0.00016887726,0.000010621256,0.000023892138,0.0009317153,0.0008962928,0.0009900843,0.99512106,0.000064060485,0.00024695985],"about_ca_topic_score_codex":0.0000013746277,"about_ca_topic_score_gemma":0.0000030548479,"teacher_disagreement_score":0.7151772,"about_ca_system_score_codex":0.000014093809,"about_ca_system_score_gemma":0.000054535474,"threshold_uncertainty_score":0.68899894},"labels":[],"label_agreement":null},{"id":"W2034079307","doi":"10.1007/s00012-007-2012-6","title":"Bounded width problems and algebras","year":2007,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Homomorphism; Bounded function; Mathematics; Partially ordered set; Combinatorics; Discrete mathematics; Type (biology); Variety (cybernetics)","score_opus":0.01613953013336916,"score_gpt":0.25178421176180993,"score_spread":0.23564468162844077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034079307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24647544,0.0003398267,0.7321526,0.0010217368,0.00018880967,0.000345669,0.0000029500907,0.0004470843,0.019025877],"genre_scores_gemma":[0.9620248,0.00006876395,0.03622251,0.00036230433,0.00004150166,0.0000024609387,0.0000035209555,0.000020068022,0.0012540333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984601,0.000063119915,0.00016007022,0.0004554789,0.00033062135,0.00053062005],"domain_scores_gemma":[0.99880785,0.00022365093,0.000060920167,0.0005716542,0.00009398059,0.00024195803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006628975,0.00015297833,0.00014410846,0.00029218523,0.00021290188,0.00013465884,0.0007978995,0.000072362396,0.000030769108],"category_scores_gemma":[0.000049311344,0.00015151281,0.000045771056,0.00081693707,0.00025867586,0.0010325674,0.00041446794,0.00018812092,0.000043363398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012550341,0.000027279839,0.0008647058,0.000009895656,0.000023649493,0.0000812911,0.0012245855,0.000003818794,0.0012398041,0.9702603,0.0002143887,0.026037687],"study_design_scores_gemma":[0.0012465833,0.00026207406,0.0066023422,0.00003419721,0.000011790679,0.000096036274,0.0003864327,0.0013060069,0.007743019,0.935769,0.04599226,0.0005502486],"about_ca_topic_score_codex":0.000068104055,"about_ca_topic_score_gemma":0.00008729439,"teacher_disagreement_score":0.7155494,"about_ca_system_score_codex":0.00006344412,"about_ca_system_score_gemma":0.000046041456,"threshold_uncertainty_score":0.6178513},"labels":[],"label_agreement":null},{"id":"W2034251757","doi":"10.1016/j.disc.2008.01.038","title":"Maximal planar graphs of inscribable type and diagonal flips","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Diagonal; Combinatorics; Type (biology); Planar; Discrete mathematics; Chordal graph; Graph; Geometry; Computer science","score_opus":0.038431571477227956,"score_gpt":0.2788313624387978,"score_spread":0.24039979096156985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034251757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69283634,0.000594334,0.29732937,0.00021263795,0.00012449748,0.00031406173,0.000021263048,0.00013431757,0.008433161],"genre_scores_gemma":[0.79111207,0.00015707265,0.20827089,0.00003859195,0.0000135102555,0.000007865571,0.0000043909426,0.000016823611,0.00037877678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989192,0.000035984736,0.00023710559,0.00020966001,0.00034288093,0.0002551993],"domain_scores_gemma":[0.99905133,0.0001795225,0.00008869883,0.00046939304,0.000112739275,0.00009832042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023295516,0.00012142255,0.00021703362,0.00012938022,0.00011565623,0.000024377097,0.00052043214,0.000043286447,0.000013642888],"category_scores_gemma":[0.0001388066,0.000100914054,0.00004215303,0.000530219,0.00025768942,0.00026533668,0.00019588847,0.00012241448,0.000013703995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013964475,0.00006826274,0.0012859637,0.00010658508,0.000025495168,0.00003256989,0.0020013019,0.000011937258,0.0018889587,0.99375397,0.0002724909,0.0005384709],"study_design_scores_gemma":[0.0004981973,0.00029710535,0.002222901,0.00007373241,0.000010330127,0.00024771824,0.00024677604,0.016343893,0.0064843427,0.97229445,0.0009523976,0.0003281798],"about_ca_topic_score_codex":0.0000030521423,"about_ca_topic_score_gemma":0.0000012937656,"teacher_disagreement_score":0.09827573,"about_ca_system_score_codex":0.000008325248,"about_ca_system_score_gemma":0.00004469228,"threshold_uncertainty_score":0.41151556},"labels":[],"label_agreement":null},{"id":"W2034408278","doi":"10.1007/s10878-008-9151-3","title":"Computing monotone disjoint paths on polytopes","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polytope; Digraph; Combinatorics; Disjoint sets; Mathematics; Monotone polygon; Vertex (graph theory); Polyhedron; Discrete mathematics; Cardinality (data modeling); Submodular set function; Time complexity; Degeneracy (biology); Convex polytope; Regular polygon; Graph; Computer science; Convex set; Convex optimization","score_opus":0.018289594816103014,"score_gpt":0.272463716427228,"score_spread":0.25417412161112496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034408278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02450704,0.00007695166,0.971706,0.00035614986,0.002540525,0.000118073156,4.3289958e-7,0.000041437386,0.0006534178],"genre_scores_gemma":[0.84564793,0.0000988763,0.15375507,0.00008086668,0.00037367232,8.4853184e-7,7.7497856e-7,0.000013791372,0.000028139406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982192,0.00019546313,0.0004926187,0.0001683302,0.0006917095,0.00023268544],"domain_scores_gemma":[0.9983836,0.00023357828,0.0004627686,0.0002840394,0.00049255893,0.00014344724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061669305,0.00012984485,0.00026168922,0.00030535122,0.00023822232,0.00007502234,0.00068635895,0.00006310232,0.000009619931],"category_scores_gemma":[0.00031346502,0.00011189163,0.000116733696,0.00056247204,0.00006647621,0.0007676795,0.00013053702,0.00031725477,0.000007317194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017999807,0.00033368444,0.0003329546,0.0000059890203,0.000031716685,0.0001395714,0.00059905887,0.7661259,0.0003308215,0.22671877,0.00036326735,0.0048382413],"study_design_scores_gemma":[0.005311951,0.0028066305,0.0014434294,0.00016880594,0.0000151507775,0.00056150113,0.00006105692,0.8986103,0.009255153,0.08033807,0.000916405,0.0005115244],"about_ca_topic_score_codex":0.000001377003,"about_ca_topic_score_gemma":2.1555927e-8,"teacher_disagreement_score":0.82114094,"about_ca_system_score_codex":0.000102298465,"about_ca_system_score_gemma":0.00013636949,"threshold_uncertainty_score":0.45628083},"labels":[],"label_agreement":null},{"id":"W2034904496","doi":"10.1016/j.dam.2006.07.019","title":"Efficient algorithms for finding critical subgraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Algorithm; Combinatorics","score_opus":0.04092502635496184,"score_gpt":0.3561048761321663,"score_spread":0.3151798497772045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034904496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005479184,0.000041035564,0.9855627,0.00014705786,0.00014231888,0.0006392038,0.000009254691,0.00022070804,0.00775857],"genre_scores_gemma":[0.32434803,0.0000013743643,0.675373,0.000065167165,0.000051146373,0.00008055218,0.0000031649408,0.000026307633,0.000051239385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776524,0.000010888101,0.0004217073,0.0004582113,0.00052429945,0.00081963686],"domain_scores_gemma":[0.9970579,0.0017790364,0.0000864793,0.0007507794,0.00010952477,0.00021628142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016826321,0.00021254798,0.00026424343,0.0002359976,0.0002838651,0.00013708066,0.00096857216,0.00008966709,0.000009806693],"category_scores_gemma":[0.0002888847,0.00018659893,0.0001336485,0.0005974653,0.00019737688,0.000075119264,0.00028782134,0.00019142988,0.00004852197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011681191,0.000090350855,0.0000024579208,0.000112297304,0.000012238351,0.0000063500133,0.00088266423,0.00014199509,0.004275533,0.98792917,0.00004746634,0.006487829],"study_design_scores_gemma":[0.0005143178,0.00007688793,0.00002884822,0.000037983824,0.00001428384,0.00001646975,0.00065547647,0.19130057,0.021866078,0.78466094,0.00043844202,0.00038973123],"about_ca_topic_score_codex":3.8303918e-7,"about_ca_topic_score_gemma":7.108424e-7,"teacher_disagreement_score":0.31886885,"about_ca_system_score_codex":0.000046587957,"about_ca_system_score_gemma":0.00002971788,"threshold_uncertainty_score":0.76092833},"labels":[],"label_agreement":null},{"id":"W2035099047","doi":"10.1109/focs.2011.30","title":"Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Royal Military College Saint-Jean","funders":"","keywords":"Disjoint sets; Logarithm; Computer science; Linear programming relaxation; Constant (computer programming); Network congestion; Approximation algorithm; Combinatorics; Steiner tree problem; Cluster analysis; Mathematics; Discrete mathematics; Linear programming; Algorithm; Computer network; Network packet","score_opus":0.03368651481046178,"score_gpt":0.25387899571054057,"score_spread":0.22019248090007879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035099047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10736162,0.000074189586,0.85062397,0.00024435215,0.00013311034,0.0003749683,0.0000015901277,0.00029582245,0.04089035],"genre_scores_gemma":[0.8995988,0.000013789729,0.09988927,0.00013357044,0.0000070150513,0.000033287488,0.000001271385,0.000010327875,0.0003126823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988387,0.00008368703,0.00014201383,0.00035552168,0.00023798739,0.00034208337],"domain_scores_gemma":[0.9992236,0.000054233995,0.000035005145,0.00051949325,0.00006151999,0.000106177526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033350472,0.00011362381,0.00011937326,0.0002686059,0.000049043625,0.000032352855,0.00061204983,0.00004206492,0.0000665529],"category_scores_gemma":[0.000020192087,0.00008374104,0.000025515594,0.000640037,0.00011305376,0.0004937019,0.000100977784,0.00017403711,0.00008316525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083292965,0.00012349334,0.01722362,0.000008963344,0.000008984605,0.0001703864,0.0010201102,0.00001849797,0.0003686056,0.95027024,0.000121178564,0.030582644],"study_design_scores_gemma":[0.0009979623,0.00064402545,0.079710975,0.000047213038,0.0000024105493,0.000070234004,0.00022497236,0.0032843775,0.005540104,0.90867865,0.00041109504,0.0003879877],"about_ca_topic_score_codex":0.00008812957,"about_ca_topic_score_gemma":0.00021967398,"teacher_disagreement_score":0.79223716,"about_ca_system_score_codex":0.000025090441,"about_ca_system_score_gemma":0.000040052284,"threshold_uncertainty_score":0.34148604},"labels":[],"label_agreement":null},{"id":"W2035278325","doi":"10.1016/j.jctb.2004.12.005","title":"A bound on the chromatic number of the square of a planar graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta; University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Bounded function; Square (algebra); Chromatic scale; Planar; Graph; Upper and lower bounds; Quadratic equation; Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.012947762145866733,"score_gpt":0.27311524414740057,"score_spread":0.26016748200153383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035278325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9835163,0.000270423,0.0050508734,0.0034149555,0.0026227932,0.00036347343,0.00000735781,0.000019830464,0.0047340365],"genre_scores_gemma":[0.9985304,0.000027142689,0.0009686737,0.00010574151,0.00021167182,0.0000036479926,1.013095e-7,0.000012341513,0.00014027399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972039,0.0008778453,0.0006351176,0.00012382286,0.00091703865,0.00024227555],"domain_scores_gemma":[0.9967207,0.0012195854,0.0008237868,0.00078070886,0.0003821447,0.000073106305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002431265,0.0001564724,0.00036615258,0.00011805626,0.0001906019,0.000055944744,0.0022124627,0.00006508037,0.00008445817],"category_scores_gemma":[0.0006131261,0.00008232146,0.0003085094,0.0007105243,0.0005902157,0.00058543537,0.00018528014,0.00044089285,0.0000062423424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004774019,0.00016316684,0.00018934606,0.000024645286,0.00008254019,0.0000050152585,0.0012309746,0.00005512483,0.0011296137,0.99543834,0.0004368833,0.00076694967],"study_design_scores_gemma":[0.00070611236,0.0005023073,0.00043860867,0.00014363517,0.000015139903,0.000109761946,0.00032039423,0.00002157752,0.020789796,0.974409,0.0024573696,0.00008629413],"about_ca_topic_score_codex":0.0000014510357,"about_ca_topic_score_gemma":0.0000011754375,"teacher_disagreement_score":0.021029335,"about_ca_system_score_codex":0.00005029492,"about_ca_system_score_gemma":0.00017405584,"threshold_uncertainty_score":0.41113433},"labels":[],"label_agreement":null},{"id":"W2035362312","doi":"10.1016/s0304-3975(02)00725-9","title":"Algorithms for vertex-partitioning problems on graphs with fixed clique-width","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Chordal graph; Independent set; Time complexity; Maximal independent set; Induced subgraph isomorphism problem; Discrete mathematics; Vertex (graph theory); Treewidth; Indifference graph; Clique-width; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.024320585121181022,"score_gpt":0.29363236843299273,"score_spread":0.2693117833118117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035362312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010767539,0.000019673475,0.98430616,0.00044784645,0.00033902738,0.0006672669,0.0000027776491,0.00026036447,0.003189348],"genre_scores_gemma":[0.6151882,0.0000028069148,0.3842214,0.0004500469,0.000020807396,0.00008116344,8.6609805e-7,0.000014567678,0.00002013748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961923,0.00022554272,0.0002934909,0.0011727248,0.001007628,0.0011083668],"domain_scores_gemma":[0.99714136,0.0008398187,0.00008467236,0.0011006936,0.0004139075,0.00041955052],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022761817,0.00027728063,0.00026744732,0.0003529005,0.0008776131,0.0005182422,0.0021940442,0.000060378956,0.00002192137],"category_scores_gemma":[0.00020802525,0.00020624968,0.00009240677,0.002110927,0.0031914425,0.0008481994,0.00029458487,0.00030775764,0.000043429118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031913834,0.00009930636,0.00007756023,0.000011465459,0.00000666106,0.000007441754,0.00019201223,0.0010678575,0.00030457118,0.9814135,0.000028872098,0.016758848],"study_design_scores_gemma":[0.0006200015,0.0014848898,0.0001655222,0.00007032504,0.0000035152796,0.00004046243,0.000006827567,0.18538153,0.01127923,0.8003318,0.00030446448,0.00031148584],"about_ca_topic_score_codex":7.256156e-7,"about_ca_topic_score_gemma":5.444702e-7,"teacher_disagreement_score":0.60442066,"about_ca_system_score_codex":0.000079490936,"about_ca_system_score_gemma":0.00021967203,"threshold_uncertainty_score":0.9995213},"labels":[],"label_agreement":null},{"id":"W2035398735","doi":"10.48550/arxiv.1407.7017","title":"On the Complexity of the Positive Semidefinite Zero Forcing Number","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Chordal graph; Forcing (mathematics); Combinatorics; Zero (linguistics); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.11534970538443647,"score_gpt":0.22891752316699493,"score_spread":0.11356781778255846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035398735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3405275,0.0000074054824,0.64371985,0.00053323933,0.00029784013,0.00045136493,0.000029893896,0.00007503613,0.0143578425],"genre_scores_gemma":[0.9981568,0.000013295794,0.0006200366,0.00030640245,0.000020746498,0.0000012222606,0.0000028831253,0.000016071084,0.00086255244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976754,0.00075006054,0.00018899322,0.0007831712,0.00022118093,0.00038118818],"domain_scores_gemma":[0.99580806,0.0011634132,0.00034321393,0.0023499485,0.00024633744,0.00008899547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069789164,0.00027274774,0.000305571,0.00010799773,0.00037776283,0.00006703202,0.0040617306,0.00015903285,0.000034381028],"category_scores_gemma":[0.00018035845,0.0001900746,0.00033437318,0.0007396321,0.0010551263,0.000159974,0.0043973243,0.0010421658,0.00008358196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032828568,0.00003525197,0.0009735789,0.000022900522,0.000053746724,0.000012801065,0.00018764837,0.05373704,0.00004442279,0.9446438,0.00017191803,0.00008406482],"study_design_scores_gemma":[0.0001815923,0.000029790826,0.0019816332,0.00016209642,0.000018709121,0.0000030303318,0.0000291352,0.10456171,0.0012194439,0.891565,0.00005008874,0.00019773467],"about_ca_topic_score_codex":0.00009456989,"about_ca_topic_score_gemma":0.000017882574,"teacher_disagreement_score":0.6576293,"about_ca_system_score_codex":0.00014382343,"about_ca_system_score_gemma":0.000118658616,"threshold_uncertainty_score":0.7751017},"labels":[],"label_agreement":null},{"id":"W2035543139","doi":"10.1016/j.jda.2011.03.004","title":"Parameterized complexity of even/odd subgraph problems","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Parameterized complexity; Combinatorics; Induced subgraph isomorphism problem; Mathematics; Cograph; Vertex (graph theory); Pathwidth; Eulerian path; Discrete mathematics; Induced subgraph; Graph; Line graph; Voltage graph; Lagrangian","score_opus":0.10129136067345934,"score_gpt":0.3090173922446653,"score_spread":0.20772603157120595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035543139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1250439,0.0004938772,0.87147474,0.0002084724,0.00043124767,0.0002823021,0.00001663395,0.000043880045,0.002004964],"genre_scores_gemma":[0.61198217,0.0002045727,0.3876644,0.000023481405,0.000053194777,0.0000042749343,7.975634e-7,0.000015835116,0.000051279832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747616,0.00027961817,0.0008260327,0.00024010085,0.000767754,0.0004103132],"domain_scores_gemma":[0.9977054,0.00013799503,0.0008110821,0.0006033433,0.00049592764,0.00024624035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012625746,0.0001884005,0.00051486015,0.00038834332,0.00008116554,0.000044975688,0.0018224658,0.00006910866,0.000059089798],"category_scores_gemma":[0.00009554711,0.00014374412,0.00034634955,0.000763026,0.0005029849,0.000966377,0.000289092,0.00038939004,0.000007473637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017251496,0.0027645433,0.017639542,0.00058737455,0.0020701836,0.0009336574,0.021144155,0.0004063221,0.13862865,0.61551577,0.000906548,0.19767812],"study_design_scores_gemma":[0.0029288735,0.003034797,0.028022407,0.00025194723,0.000054567037,0.00042690325,0.0002681407,0.012644253,0.04899886,0.9023189,0.0004817739,0.00056858093],"about_ca_topic_score_codex":0.000045438203,"about_ca_topic_score_gemma":0.0000048112356,"teacher_disagreement_score":0.48693827,"about_ca_system_score_codex":0.000032738615,"about_ca_system_score_gemma":0.00010941274,"threshold_uncertainty_score":0.5861715},"labels":[],"label_agreement":null},{"id":"W2035562488","doi":"10.1016/j.laa.2014.02.005","title":"Integrally normalizable matrices and zero–nonzero patterns","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integrally closed; Mathematics; Diagonal; Zero (linguistics); Matrix (chemical analysis); Combinatorics; Integer (computer science); Diagonal matrix; Geometry; Computer science","score_opus":0.011184300179782948,"score_gpt":0.2670817599558682,"score_spread":0.25589745977608525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035562488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02637447,0.0005239866,0.970017,0.00064953143,0.000031174113,0.00026809017,0.0000069783064,0.00012266278,0.0020060749],"genre_scores_gemma":[0.96543133,0.0012648023,0.031169342,0.00048357784,0.00011008916,0.00020472918,0.000011848653,0.000018393277,0.0013059088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910414,0.000040107905,0.00014768298,0.00034363894,0.00013805735,0.00022639304],"domain_scores_gemma":[0.99920815,0.00013942353,0.000048664988,0.00038334128,0.00007804205,0.00014239404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021490012,0.00010821376,0.00011439837,0.00015873036,0.0002276943,0.000120671044,0.00044554507,0.000047903923,0.000011991617],"category_scores_gemma":[0.000026906357,0.00009343793,0.000021470374,0.00047328882,0.000050773495,0.00037494604,0.0002800669,0.00013930058,0.000059207207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023287296,0.000030555057,0.0010565475,0.000035027053,0.000008218282,4.0525936e-7,0.00014163536,0.0000095101595,0.0006302125,0.95767856,0.0003041515,0.04010284],"study_design_scores_gemma":[0.00085654046,0.00027865174,0.0069631017,0.000054995427,0.000024957062,0.000068157715,0.00009305738,0.23529358,0.0059398655,0.46247548,0.28721645,0.0007351549],"about_ca_topic_score_codex":0.000010144163,"about_ca_topic_score_gemma":0.0000053102967,"teacher_disagreement_score":0.9390568,"about_ca_system_score_codex":0.000004263368,"about_ca_system_score_gemma":0.000011757196,"threshold_uncertainty_score":0.3810288},"labels":[],"label_agreement":null},{"id":"W2035616518","doi":"10.1109/bdcloud.2014.118","title":"On the Graph Decomposition","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Directed acyclic graph; Disjoint sets; Node (physics); Graph; Path (computing); Decomposition; Directed graph; Combinatorics; Algorithm; Theoretical computer science; Mathematics; Computer network; Chemistry","score_opus":0.01674793590351749,"score_gpt":0.30186062514033907,"score_spread":0.2851126892368216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035616518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015349058,0.0000032524497,0.92730314,0.0032807267,0.000060071416,0.000063099396,7.764254e-8,0.000098404256,0.053842187],"genre_scores_gemma":[0.9866898,0.0000012549532,0.011242156,0.001672404,0.000015093697,0.0000097250195,1.990804e-7,0.000002783178,0.00036655736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936444,0.00012506015,0.000050022656,0.00014569456,0.00017488364,0.00013988758],"domain_scores_gemma":[0.9989157,0.000524667,0.000012759351,0.00048494726,0.000026547235,0.000035403067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004175164,0.000044366847,0.00003512005,0.000055643748,0.0001347547,0.000062548366,0.0006676143,0.000012725763,0.00004957612],"category_scores_gemma":[0.000052633102,0.000024619829,0.00002986762,0.00025575107,0.00004147737,0.00012885248,0.0000938092,0.00008184258,0.00029542236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019017651,0.000009335202,0.000012742568,3.5530476e-7,0.0000013320837,2.7567634e-7,0.00001857903,0.00005942289,0.000554692,0.9883344,0.0008247362,0.010182228],"study_design_scores_gemma":[0.000057825495,0.000072517214,0.00035747766,0.0000025718653,2.3667347e-7,0.0000020236605,0.0000030770068,0.018222578,0.0062508993,0.9736944,0.0012926075,0.000043774613],"about_ca_topic_score_codex":0.0000015917377,"about_ca_topic_score_gemma":0.000001627689,"teacher_disagreement_score":0.9713408,"about_ca_system_score_codex":0.000006291502,"about_ca_system_score_gemma":0.00000403285,"threshold_uncertainty_score":0.3797155},"labels":[],"label_agreement":null},{"id":"W2035637517","doi":"10.1016/j.tcs.2007.09.031","title":"On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Split graph; Chordal graph; Mathematics; Combinatorics; Clique problem; Treewidth; Cograph; Independent set; Clique graph; Block graph; Perfect graph; Discrete mathematics; Graph; Pathwidth; 1-planar graph; Line graph; Graph power","score_opus":0.00919946598330105,"score_gpt":0.27909322103857703,"score_spread":0.26989375505527596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035637517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055539876,0.00008252193,0.93337923,0.0014987186,0.00032949436,0.0005586692,0.0000027735957,0.00023378004,0.008374952],"genre_scores_gemma":[0.8997304,0.000018118919,0.098902315,0.0012266707,0.00006319673,0.000016113481,6.003047e-7,0.000014684493,0.000027899316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995487,0.00039458976,0.00040067857,0.0011104628,0.0013111241,0.0012961657],"domain_scores_gemma":[0.99600786,0.0017745501,0.0000963265,0.0013480124,0.0002532097,0.0005200608],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.009802774,0.00030346442,0.00031536393,0.0003702579,0.0010437311,0.0008257877,0.0036210674,0.00008397918,0.000020505071],"category_scores_gemma":[0.00015668674,0.00018751042,0.00009181525,0.002579253,0.010275148,0.0009340592,0.0016947694,0.0006510518,0.00006276813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016605912,0.000043582248,0.00006345053,0.000006378037,0.000006540928,0.000019927513,0.0006016826,0.000058305617,0.00015153739,0.98243386,0.00012400438,0.016324662],"study_design_scores_gemma":[0.0008282392,0.00036419384,0.00033434056,0.000025081708,0.0000032210771,0.000063630396,0.000009835626,0.056181755,0.003087253,0.9383725,0.00047244996,0.00025747952],"about_ca_topic_score_codex":0.000007505128,"about_ca_topic_score_gemma":0.0000025956222,"teacher_disagreement_score":0.84419054,"about_ca_system_score_codex":0.00006802562,"about_ca_system_score_gemma":0.0001506412,"threshold_uncertainty_score":0.9924183},"labels":[],"label_agreement":null},{"id":"W2035672135","doi":"10.1142/s0218196713500215","title":"CSP DICHOTOMY FOR SPECIAL POLYADS","year":2013,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Conjecture; Homomorphism; Bounded function; Class (philosophy); Discrete mathematics; Constraint satisfaction problem; Unanimity; Computer science","score_opus":0.014575788118619308,"score_gpt":0.31065270864338135,"score_spread":0.29607692052476203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035672135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17757936,0.00006994885,0.8187626,0.0022196607,0.00089048006,0.00011668231,0.0000011883266,0.000010738574,0.00034933386],"genre_scores_gemma":[0.9455664,0.000021282052,0.053024426,0.0002588639,0.001046477,0.0000069311527,0.0000019896402,0.0000054112515,0.000068179674],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999096,0.000034609468,0.00026460752,0.00010989239,0.00038405982,0.000110862886],"domain_scores_gemma":[0.99865043,0.00021116635,0.00019468661,0.00005462505,0.0008107916,0.00007829766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022123764,0.0000663985,0.00009687231,0.00023667338,0.000050032537,0.00024642627,0.0005022543,0.000025457997,0.000025889918],"category_scores_gemma":[0.00006812648,0.000057310874,0.000065711625,0.000096939635,0.000040661656,0.0010157474,0.00008065395,0.00009195693,0.000010999888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085510095,0.00008780703,0.0009484732,0.0000069897856,0.00012780337,0.000018723602,0.0006531645,0.0005777546,0.0018303882,0.31131014,0.0033873478,0.6809659],"study_design_scores_gemma":[0.0012845926,0.00029852404,0.013198304,0.000030821357,0.000005069279,0.00021663142,0.00006509595,0.043906238,0.0012574109,0.9367406,0.0028765749,0.00012014842],"about_ca_topic_score_codex":0.000002915083,"about_ca_topic_score_gemma":5.901124e-7,"teacher_disagreement_score":0.7679871,"about_ca_system_score_codex":0.000032819116,"about_ca_system_score_gemma":0.0000469834,"threshold_uncertainty_score":0.23762943},"labels":[],"label_agreement":null},{"id":"W2035697452","doi":"10.1016/j.jctb.2015.03.005","title":"Matroids denser than a clique","year":2015,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Matroid; Combinatorics; Mathematics; Function (biology); Clique; Rank (graph theory); Exponential function; Integer (computer science); Simple (philosophy); Quadratic equation; Discrete mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.023236955092811526,"score_gpt":0.3042449549892352,"score_spread":0.28100799989642367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035697452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31846562,0.008646362,0.52084476,0.0050559314,0.12240071,0.001892018,0.000058006703,0.0006358233,0.022000799],"genre_scores_gemma":[0.9656645,0.00047235112,0.02787158,0.00016833146,0.0036746557,0.000030064055,0.000004956243,0.00011841617,0.0019951407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945029,0.0018030297,0.0011348155,0.00048693345,0.0014560261,0.00061631505],"domain_scores_gemma":[0.99372315,0.0005848563,0.0014213662,0.0015415634,0.0022005595,0.00052849355],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.007386555,0.0005062729,0.0010688966,0.00058708806,0.00015534078,0.00053297245,0.004871877,0.00050919474,0.00004165247],"category_scores_gemma":[0.0012772718,0.00043185963,0.00057915,0.0004805233,0.00038992474,0.0013975576,0.0032786424,0.0026038114,0.000029210247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014837827,0.00014502995,0.00006699396,0.00006730857,0.00021195442,0.00034606695,0.0011266085,0.0002702528,0.00020136824,0.99258196,0.0021946265,0.0013040645],"study_design_scores_gemma":[0.001120223,0.0009655015,0.000037168236,0.00020683366,0.00003523501,0.00048648668,0.00018797517,0.000055663102,0.0022017746,0.98190475,0.012386177,0.00041219825],"about_ca_topic_score_codex":0.0000035405565,"about_ca_topic_score_gemma":0.0000013365395,"teacher_disagreement_score":0.6471989,"about_ca_system_score_codex":0.00035141737,"about_ca_system_score_gemma":0.0016778021,"threshold_uncertainty_score":0.9998133},"labels":[],"label_agreement":null},{"id":"W2035974993","doi":"10.1016/j.dam.2004.02.014","title":"Multi-terminal multipath flows: synthesis","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Path (computing); Flow network; Disjoint sets; Shortest path problem; Undirected graph; Flow (mathematics); Enhanced Data Rates for GSM Evolution; Polynomial; Discrete mathematics; Maximum flow problem; Multi-commodity flow problem; Topology (electrical circuits); Graph; Computer science; Geometry; Telecommunications","score_opus":0.02898757932986056,"score_gpt":0.2962409616097549,"score_spread":0.2672533822798943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035974993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027153684,0.000032676064,0.96855325,0.00012583531,0.000063082785,0.0004682724,0.000009038281,0.00034564818,0.003248537],"genre_scores_gemma":[0.34931037,0.000009626696,0.6503451,0.000048563248,0.000026093536,0.00017484098,0.0000017219566,0.000029149156,0.000054533037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793947,0.000021805135,0.0003918994,0.00052178174,0.000531438,0.0005935982],"domain_scores_gemma":[0.99807113,0.00029648622,0.00013770125,0.0012315525,0.000059845184,0.00020327195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044505473,0.00028834312,0.0003401297,0.00016940241,0.0002100568,0.00016379717,0.001541233,0.00009402078,0.000021121828],"category_scores_gemma":[0.00016030316,0.00024518187,0.0001239051,0.00045533935,0.00013451745,0.0003097646,0.00049267965,0.0002461792,0.0004535882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014799975,0.00042639507,0.000008965874,0.00020239086,0.000049118895,0.000090021196,0.003798039,0.0015751364,0.036257945,0.94387126,0.000016268456,0.013689683],"study_design_scores_gemma":[0.0025856488,0.000107693864,0.00020392978,0.0002927608,0.000055044027,0.00016443613,0.0014428203,0.16864832,0.1227148,0.70183736,0.0004729466,0.0014742537],"about_ca_topic_score_codex":0.0000035001024,"about_ca_topic_score_gemma":0.0000055343185,"teacher_disagreement_score":0.3221567,"about_ca_system_score_codex":0.00006541111,"about_ca_system_score_gemma":0.00006867815,"threshold_uncertainty_score":0.9998226},"labels":[],"label_agreement":null},{"id":"W2036371515","doi":"10.1016/s0012-365x(01)00273-4","title":"The stable set polytope and some operations on graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Polytope; Mathematics; Chordal graph; Independent set; Discrete mathematics; Indifference graph; Split graph; Set (abstract data type); Maximal independent set; Clique; 1-planar graph; Graph; Computer science","score_opus":0.03863547424493796,"score_gpt":0.29495089754384707,"score_spread":0.2563154232989091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036371515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22060378,0.0041946433,0.70661527,0.021858552,0.00062889815,0.0023815231,0.00009845781,0.00083936966,0.04277948],"genre_scores_gemma":[0.9123515,0.0009481139,0.075556345,0.0006722274,0.000061655825,0.000117260606,0.0000040353843,0.00004723188,0.010241625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895394,0.000060311373,0.00017609968,0.00020827504,0.0003003046,0.00030104522],"domain_scores_gemma":[0.99875,0.00035280132,0.000033099845,0.0007347145,0.00003983096,0.00008960884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034145918,0.00011643516,0.00011236496,0.00006778215,0.00057546986,0.00040103213,0.0006585139,0.00002816834,0.000019818644],"category_scores_gemma":[0.00012416932,0.00007237801,0.000038421113,0.00027860986,0.00015093976,0.00040281273,0.00022579543,0.00014841025,0.00009530248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.998788e-7,0.000022716626,0.000008024348,0.000009750156,0.000009468186,0.0000026437858,0.0011380119,0.00008348842,0.00015676678,0.9963602,0.000463601,0.0017444184],"study_design_scores_gemma":[0.00019440692,0.00010575631,0.000034638815,0.00002839151,0.000004378194,0.000014900971,0.00035862456,0.27541068,0.0011529472,0.7201667,0.0023499383,0.00017863022],"about_ca_topic_score_codex":0.0000019077486,"about_ca_topic_score_gemma":0.00000393299,"teacher_disagreement_score":0.6917477,"about_ca_system_score_codex":0.000012649185,"about_ca_system_score_gemma":0.000007812387,"threshold_uncertainty_score":0.4426107},"labels":[],"label_agreement":null},{"id":"W2036553843","doi":"10.1016/j.disc.2010.03.033","title":"The complexity of colouring by locally semicomplete digraphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Homomorphism; Mathematics; Discrete mathematics; Combinatorics; Polynomial","score_opus":0.03142701722840945,"score_gpt":0.2938779925286236,"score_spread":0.26245097530021416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036553843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13621862,0.00010962214,0.855488,0.0010737805,0.00021688397,0.00044280654,0.00003406478,0.000158409,0.0062578283],"genre_scores_gemma":[0.8768845,0.000019072519,0.12274302,0.000039966686,0.000018086213,0.000022080363,0.0000033136969,0.000019584808,0.0002503687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984368,0.00006363243,0.00038392865,0.00023541812,0.00048411082,0.00039612243],"domain_scores_gemma":[0.9978036,0.00060075213,0.00020580132,0.0011489341,0.00013128253,0.000109610475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008025783,0.0001534869,0.000222422,0.0000564341,0.0003151767,0.0001393953,0.0020284355,0.000052739888,0.000012033042],"category_scores_gemma":[0.00022337862,0.00010199405,0.00010864547,0.00037844936,0.0011175905,0.00019666698,0.0005279295,0.0003732522,0.000018450468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046155074,0.000042189076,0.00007960439,0.00004256605,0.000020144842,0.0000014213983,0.00051903835,0.0000058420715,0.039631795,0.95786697,0.0003543067,0.00143151],"study_design_scores_gemma":[0.00022417655,0.000060677674,0.00013598004,0.000030375393,0.0000052952128,0.00001554817,0.00016786718,0.047943756,0.025465818,0.9230944,0.0026657202,0.0001904043],"about_ca_topic_score_codex":0.000005674332,"about_ca_topic_score_gemma":0.000028480423,"teacher_disagreement_score":0.7406659,"about_ca_system_score_codex":0.000010073065,"about_ca_system_score_gemma":0.000032824584,"threshold_uncertainty_score":0.41591966},"labels":[],"label_agreement":null},{"id":"W2037002007","doi":"10.1016/s0012-365x(00)00260-0","title":"Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Cubic graph; Corollary; Combinatorics; Discrete mathematics; Planar graph; Exponential function; Constructive; Hamiltonian path; Algorithm; Hamiltonian (control theory); Graph; Line graph; Voltage graph; Mathematical analysis; Computer science","score_opus":0.04762917201134028,"score_gpt":0.3176212309829411,"score_spread":0.26999205897160083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037002007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0472972,0.00015500908,0.9466462,0.00033582703,0.00022364444,0.0011662805,0.00007887888,0.0001639759,0.0039329664],"genre_scores_gemma":[0.41207865,0.00019132368,0.58319175,0.00073055865,0.000178079,0.0009228102,0.000038813698,0.00018267022,0.0024853426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968851,0.00011723237,0.00056835613,0.00080317206,0.00063527684,0.000990842],"domain_scores_gemma":[0.9977635,0.00057337177,0.00023481998,0.0011652013,0.000097414275,0.00016565275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007439528,0.00040728634,0.00052949635,0.00054814125,0.00030094036,0.00028910494,0.0015207108,0.00015599433,0.00008922371],"category_scores_gemma":[0.0000895264,0.00037816606,0.00034611044,0.0014168478,0.00018228307,0.0007568853,0.00025140442,0.00038551455,0.000053967135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053004584,0.00067102816,0.00021925941,0.00039287648,0.00016846468,0.00023741335,0.03415985,0.00005189122,0.0020758852,0.91478014,0.0011856011,0.046004612],"study_design_scores_gemma":[0.0014561708,0.00030887756,0.00012706898,0.0002634586,0.00001501049,0.00006318927,0.0006417,0.05515149,0.0031966409,0.9349495,0.0032696745,0.00055719214],"about_ca_topic_score_codex":0.0000066121447,"about_ca_topic_score_gemma":0.000026267913,"teacher_disagreement_score":0.36478144,"about_ca_system_score_codex":0.000086295026,"about_ca_system_score_gemma":0.000059750197,"threshold_uncertainty_score":0.999867},"labels":[],"label_agreement":null},{"id":"W2037328176","doi":"10.1007/s00453-001-0017-7","title":"On Rooted Node-Connectivity Problems","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Node (physics); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Physics","score_opus":0.020230128070829564,"score_gpt":0.2773567718637909,"score_spread":0.2571266437929613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037328176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04360359,0.000054792406,0.94343966,0.0016651776,0.000230228,0.0002840093,0.0000026737855,0.00040899558,0.010310851],"genre_scores_gemma":[0.9611113,0.000016570952,0.03700405,0.00049453764,0.000093097085,0.000056179186,0.000002680479,0.000023602594,0.0011979562],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983023,0.00012739774,0.00014871969,0.00053287897,0.00039205828,0.0004966497],"domain_scores_gemma":[0.9985057,0.00034376126,0.000048733542,0.00086713035,0.00009174286,0.0001429013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038018962,0.0001544051,0.00015632254,0.00017284777,0.00017483611,0.00009030497,0.001005496,0.000064562,0.000050910578],"category_scores_gemma":[0.00014359159,0.00013987781,0.000068866626,0.0008661941,0.00007679983,0.00041693225,0.00025138023,0.0002924262,0.00046533215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045262575,0.00041726662,0.00044069267,0.000011665456,0.00004311909,0.00018955738,0.00030109193,0.001500645,0.002685381,0.47587928,0.0011656841,0.51732033],"study_design_scores_gemma":[0.0010784044,0.00046813264,0.0031408402,0.000044013592,0.000003952008,0.00012146693,0.000011264876,0.18185712,0.008096508,0.7877423,0.016879803,0.00055617973],"about_ca_topic_score_codex":0.000021403368,"about_ca_topic_score_gemma":0.0000070829296,"teacher_disagreement_score":0.9175077,"about_ca_system_score_codex":0.00006134771,"about_ca_system_score_gemma":0.000040377578,"threshold_uncertainty_score":0.59810585},"labels":[],"label_agreement":null},{"id":"W2037789845","doi":"10.1016/j.jctb.2003.09.001","title":"Excluding any graph as a minor allows a low tree-width 2-coloring","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Graph minor; Graph; Edge coloring; Graph coloring; Conjecture; Fractional coloring; Discrete mathematics; List coloring; Graph power; Graph factorization; Line graph","score_opus":0.015315810349520103,"score_gpt":0.2745306702123444,"score_spread":0.2592148598628243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037789845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84218466,0.000993073,0.13519049,0.0013790072,0.012676199,0.00047158304,0.0000023193859,0.0001973125,0.0069053518],"genre_scores_gemma":[0.986439,0.00012424272,0.012310491,0.00013062346,0.00067055225,0.000011175635,3.392964e-7,0.000035314857,0.0002782607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675286,0.00044261804,0.0007617947,0.0003503808,0.0010048342,0.00068750326],"domain_scores_gemma":[0.9973529,0.000507345,0.0005957599,0.00063727266,0.00051410514,0.00039259065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028466212,0.00031643067,0.00056990265,0.00057516777,0.00035715362,0.00030584654,0.0021361557,0.000135457,0.000040022147],"category_scores_gemma":[0.000857571,0.00027626668,0.00038614147,0.001107099,0.00031977097,0.002828043,0.0004287985,0.00071324524,0.000027534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010820092,0.00021599374,0.00009910688,0.000023724975,0.000113998234,0.0004581526,0.0012678034,0.00035001402,0.0067230226,0.9852896,0.000039791652,0.004336827],"study_design_scores_gemma":[0.0028332998,0.0015846394,0.00016844252,0.00016379381,0.000018201828,0.0005314779,0.00029777337,0.000011278706,0.0277322,0.964175,0.0021939166,0.00028997654],"about_ca_topic_score_codex":0.0000045995425,"about_ca_topic_score_gemma":0.000002415088,"teacher_disagreement_score":0.14425433,"about_ca_system_score_codex":0.00024086397,"about_ca_system_score_gemma":0.00043872805,"threshold_uncertainty_score":0.99996895},"labels":[],"label_agreement":null},{"id":"W2037821860","doi":"10.1016/s0012-365x(00)00247-8","title":"Characterization of Zm-well-covered graphs for some classes of graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics; Characterization (materials science); Discrete mathematics; Indifference graph; Chordal graph; Graph","score_opus":0.027794869945388264,"score_gpt":0.29900215391933355,"score_spread":0.2712072839739453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037821860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.419404,0.000032090957,0.5793183,0.00008314264,0.00007337669,0.0004489924,0.000040177372,0.000048732683,0.00055119547],"genre_scores_gemma":[0.9324289,0.00017619914,0.066927694,0.000037451635,0.00001699057,0.00005791866,0.000036309077,0.000029602339,0.0002889552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850714,0.000045636076,0.00051852356,0.00024779208,0.00038746957,0.000293465],"domain_scores_gemma":[0.9983292,0.0002985882,0.00039055332,0.0007126991,0.00020174304,0.00006721668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003856594,0.00015856652,0.00035208184,0.00027458332,0.000064696316,0.000036736812,0.0008057959,0.00005608734,0.00001577171],"category_scores_gemma":[0.00012286621,0.00013708393,0.00018560453,0.00059479295,0.00015228459,0.00058392243,0.00015333151,0.00007445043,0.0000063119132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023552733,0.000118602926,0.00022866263,0.00032281608,0.000036317768,0.0000015044457,0.00060227007,0.000015427016,0.13113862,0.8665366,0.000014558163,0.00096105906],"study_design_scores_gemma":[0.00042360302,0.00017297371,0.0003986058,0.000092200156,0.000015689222,0.000007592994,0.00010838022,0.015686793,0.1279893,0.8547227,0.00021306911,0.00016909686],"about_ca_topic_score_codex":0.000001434619,"about_ca_topic_score_gemma":9.1059115e-7,"teacher_disagreement_score":0.51302487,"about_ca_system_score_codex":0.000011860336,"about_ca_system_score_gemma":0.00003537079,"threshold_uncertainty_score":0.55901206},"labels":[],"label_agreement":null},{"id":"W2038115433","doi":"10.1007/s11083-012-9278-9","title":"On Infinite–finite Duality Pairs of Directed Graphs","year":2012,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Royal Military College of Canada","funders":"","keywords":"Antichain; Duality (order theory); Directed graph; Constraint satisfaction problem; Construct (python library); Constraint (computer-aided design)","score_opus":0.03131159960911015,"score_gpt":0.30981490368774756,"score_spread":0.27850330407863744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038115433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62447906,0.00043693607,0.3188158,0.000690869,0.00085431244,0.00047172437,0.000018663004,0.0007372064,0.05349542],"genre_scores_gemma":[0.98564124,0.000011267391,0.013737643,0.00018802893,0.000018518962,0.000012755243,0.0000022799386,0.0000100029465,0.00037828003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998653,0.00021191868,0.00017933441,0.00020545303,0.000359758,0.00039053228],"domain_scores_gemma":[0.9982926,0.0006642904,0.000071542716,0.000685781,0.00015887692,0.00012687795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065341895,0.00010835627,0.00014706336,0.00019477941,0.00006824002,0.000019242854,0.0005205274,0.00005163024,0.00013337198],"category_scores_gemma":[0.0005097245,0.00009251027,0.00005746949,0.0012838541,0.00011630743,0.00037998654,0.00019236204,0.00016920322,0.00014441452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003327045,0.00028123747,0.017948596,0.000019499925,0.0000271788,0.000002414918,0.0008261079,0.00010282239,0.0007202402,0.9650074,0.0005997328,0.014431486],"study_design_scores_gemma":[0.0017344073,0.0005408568,0.15491538,0.00009055911,0.00001480946,0.000010739772,0.00011001568,0.0060018846,0.018159572,0.7921807,0.025302462,0.0009385993],"about_ca_topic_score_codex":0.0000099436775,"about_ca_topic_score_gemma":0.0000023583013,"teacher_disagreement_score":0.36116216,"about_ca_system_score_codex":0.000012606017,"about_ca_system_score_gemma":0.000027813045,"threshold_uncertainty_score":0.37724593},"labels":[],"label_agreement":null},{"id":"W2038193038","doi":"10.1016/j.ejc.2011.09.024","title":"A stability theorem on fractional covering of triangles by edges","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Discrete mathematics","score_opus":0.05720135198896756,"score_gpt":0.2618078043544493,"score_spread":0.20460645236548172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038193038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3591928,0.0004573383,0.60594934,0.00012858446,0.0010075294,0.00010578821,0.000006168488,0.00003504525,0.033117425],"genre_scores_gemma":[0.9973921,0.000049012488,0.0024355932,0.000028915165,0.000031676496,2.7932748e-7,2.0267039e-7,0.000014176453,0.00004801129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784374,0.00080155174,0.00045778783,0.00014985885,0.00056265853,0.00018438681],"domain_scores_gemma":[0.9982264,0.00038087295,0.0004764204,0.00038068055,0.00040201566,0.00013359978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002596299,0.00011199107,0.00021341754,0.00015610603,0.00007020469,0.00003020538,0.001135228,0.000017121556,0.00003906731],"category_scores_gemma":[0.00044443054,0.000092305985,0.00012413716,0.00037188537,0.00012152302,0.0004515241,0.0001658911,0.00037666506,0.000013853492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044317712,0.0009689299,0.002382311,0.000027540227,0.000074382915,0.00016148646,0.0016973501,0.000033810997,0.0038263784,0.9709068,0.0009777842,0.018500052],"study_design_scores_gemma":[0.0043655853,0.0060378527,0.021802275,0.00019969784,0.000023793453,0.00017574178,0.00037043742,0.0003308446,0.17702237,0.77503246,0.01411843,0.0005204996],"about_ca_topic_score_codex":4.4503423e-7,"about_ca_topic_score_gemma":3.517896e-8,"teacher_disagreement_score":0.6381993,"about_ca_system_score_codex":0.000054851575,"about_ca_system_score_gemma":0.000057599766,"threshold_uncertainty_score":0.3764129},"labels":[],"label_agreement":null},{"id":"W2038298858","doi":"10.1016/j.dam.2011.11.034","title":"Vertex covers and eternal dominating sets","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Neighbourhood (mathematics); Dominating set; Vertex cover; Domination analysis; Guard (computer science); Graph; Discrete mathematics; Computer science","score_opus":0.032096494888659774,"score_gpt":0.2774815119098863,"score_spread":0.2453850170212265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038298858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08034475,0.000032790773,0.8541403,0.000029251394,0.000056713547,0.0002861184,0.0000035549722,0.00014056079,0.06496596],"genre_scores_gemma":[0.61065423,0.000009464214,0.38917953,0.000054778302,0.0000060978145,0.000023654102,7.8526864e-7,0.000014442154,0.000057026937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988554,0.000016208498,0.00021682496,0.00029280252,0.0002948231,0.00032392054],"domain_scores_gemma":[0.9990496,0.00018692458,0.000103399245,0.0005056229,0.000030334786,0.00012411419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003643213,0.000151935,0.00018422765,0.00008487816,0.00012406216,0.00008392866,0.0006438071,0.0000478544,0.000025085616],"category_scores_gemma":[0.000048024533,0.00013030457,0.00003743082,0.00019000318,0.00013054839,0.00024405764,0.00044590724,0.00015748916,0.000055601613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008947236,0.00003136798,0.000038352802,0.000055023498,0.000018331473,0.000011410921,0.005134344,0.0000026419514,0.0038395459,0.97840697,0.000030467118,0.012422583],"study_design_scores_gemma":[0.000541579,0.000055927714,0.00027662993,0.000041047206,0.000010039659,0.0000344899,0.0006647857,0.026566654,0.01383937,0.9576068,0.00007517037,0.00028752134],"about_ca_topic_score_codex":0.0000024445017,"about_ca_topic_score_gemma":9.174446e-7,"teacher_disagreement_score":0.5303095,"about_ca_system_score_codex":0.00001814121,"about_ca_system_score_gemma":0.000017340943,"threshold_uncertainty_score":0.53136665},"labels":[],"label_agreement":null},{"id":"W2038330747","doi":"10.1016/j.laa.2010.12.024","title":"On the graph complement conjecture for minimum rank","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Complement (music); Complement graph; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.050713857503554616,"score_gpt":0.3019592891236169,"score_spread":0.2512454316200623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038330747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008830548,0.00020531604,0.98459935,0.002893899,0.00003373947,0.0015163338,0.000035552108,0.00008147422,0.0018037811],"genre_scores_gemma":[0.9684062,0.0000614651,0.027851457,0.0014783791,0.00008164331,0.0016929907,0.00001400016,0.000016374845,0.00039749447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992615,0.000033236254,0.00012289075,0.0002695088,0.00011613756,0.00019670643],"domain_scores_gemma":[0.998952,0.0004027462,0.0000417474,0.00045941686,0.000073938885,0.00007015694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020590187,0.00009132471,0.00008243148,0.000057016812,0.00034491674,0.000031312044,0.0005712497,0.000029178485,0.000044358818],"category_scores_gemma":[0.000026773429,0.000060167393,0.00004533397,0.0002710898,0.00007131639,0.00007463565,0.00010524422,0.000100018995,0.000040856015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008003197,0.00004084397,0.0000066293683,0.0000058281908,0.000011511854,1.2010398e-7,0.00027846574,0.000002175402,0.0003240149,0.9952901,0.0005848833,0.0034474528],"study_design_scores_gemma":[0.00036625625,0.00016162598,0.00020321523,0.000005638987,0.0000071456693,0.0000030986835,0.00005585616,0.0070902854,0.0066487584,0.9466682,0.038657315,0.0001326253],"about_ca_topic_score_codex":0.0000013468722,"about_ca_topic_score_gemma":0.0000021868377,"teacher_disagreement_score":0.95957565,"about_ca_system_score_codex":0.0000047879103,"about_ca_system_score_gemma":0.000016025551,"threshold_uncertainty_score":0.26528555},"labels":[],"label_agreement":null},{"id":"W2038607380","doi":"10.1007/s00454-003-2872-2","title":"Metric Embeddings?Beyond One-Dimensional Distortion","year":2004,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Defense Advanced Research Projects Agency; Hebrew University of Jerusalem; National Science Foundation","keywords":"Pairwise comparison; Mathematics; Embedding; Distortion (music); Metric (unit); Combinatorics; Graph; Metric space; Discrete mathematics; Computer science; Artificial intelligence; Statistics","score_opus":0.016334324780769453,"score_gpt":0.29402775613076054,"score_spread":0.2776934313499911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038607380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12183662,0.00032595155,0.8748202,0.00081063015,0.00030688354,0.00020338364,0.00001985643,0.00023390456,0.0014425777],"genre_scores_gemma":[0.84165,0.0000036432598,0.15757687,0.00039073217,0.000083590305,0.000020213123,0.00009500048,0.000020627229,0.00015929677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686724,0.0000860349,0.00039860408,0.0007099054,0.0014187469,0.00051946286],"domain_scores_gemma":[0.9984095,0.0003788673,0.00015983246,0.0004571794,0.0003362034,0.00025838643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052142545,0.00023880001,0.00025055002,0.0011211765,0.0003614527,0.0001790159,0.0009133156,0.00008478664,0.00008024668],"category_scores_gemma":[0.00022021767,0.00024305415,0.00016888775,0.003535131,0.00016782017,0.0010320633,0.0004483277,0.00032584215,0.00034765183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026753354,0.00015940423,0.00059849006,0.000016391135,0.00005696444,0.000027114631,0.00013641032,0.41844404,0.0002667118,0.57089657,0.00012351369,0.009247653],"study_design_scores_gemma":[0.0012332769,0.00019856774,0.0357271,0.000039338076,0.000012240261,0.00005885027,0.000028032895,0.041924655,0.0009940112,0.91882044,0.00045433032,0.0005091401],"about_ca_topic_score_codex":0.00001561649,"about_ca_topic_score_gemma":0.000001783753,"teacher_disagreement_score":0.7198134,"about_ca_system_score_codex":0.0002801583,"about_ca_system_score_gemma":0.00019831407,"threshold_uncertainty_score":0.991146},"labels":[],"label_agreement":null},{"id":"W203922734","doi":"","title":"On the (r, s) domination number of a graph.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph; Vertex (graph theory)","score_opus":0.01994224594606359,"score_gpt":0.28376223699266157,"score_spread":0.263819991046598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203922734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98345983,0.000025347535,0.0050952095,0.00058317825,0.0004849821,0.00018262242,8.206462e-7,0.000060458744,0.010107537],"genre_scores_gemma":[0.9986427,0.000018403258,0.0009802394,0.000100469915,0.00000201207,0.000020584645,4.2790404e-7,0.000006758304,0.0002284463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988888,0.00015465032,0.00014331813,0.00019930983,0.00042234574,0.00019158404],"domain_scores_gemma":[0.9984569,0.0006254958,0.00007298094,0.0006635191,0.00013616882,0.000044955726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040806728,0.000084619795,0.00010710278,0.0000786188,0.00017648905,0.0000145863605,0.0008926911,0.00003486438,0.00003392719],"category_scores_gemma":[0.00019066074,0.000060033333,0.00006656321,0.0007317909,0.00017986141,0.00021182718,0.00014719581,0.0001562024,0.00011023158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010794199,0.000079195575,0.0007876433,0.000002276231,0.0000079244965,0.000007771319,0.00029780404,0.000006497214,0.0002685064,0.9967983,0.001105838,0.00062747987],"study_design_scores_gemma":[0.0003363562,0.00006501902,0.0022325406,0.000008765191,9.406802e-7,0.000015834685,0.000010669983,0.00041809067,0.0070331986,0.9896465,0.00016401288,0.000068090674],"about_ca_topic_score_codex":0.000005827194,"about_ca_topic_score_gemma":3.492444e-7,"teacher_disagreement_score":0.015182814,"about_ca_system_score_codex":0.000021338963,"about_ca_system_score_gemma":0.000035190133,"threshold_uncertainty_score":0.24480882},"labels":[],"label_agreement":null},{"id":"W2039459495","doi":"10.1016/j.tcs.2013.11.010","title":"Approximating the minimum independent dominating set in perturbed graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dominating set; Mathematics; Combinatorics; Set (abstract data type); Maximal independent set; Independent set; Discrete mathematics; Chordal graph; Computer science; Graph; 1-planar graph; Vertex (graph theory)","score_opus":0.015547689309879731,"score_gpt":0.2804480771253872,"score_spread":0.2649003878155075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039459495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26810387,0.000028915641,0.7266497,0.0019844202,0.00024995444,0.0005574345,4.683028e-7,0.00012798503,0.0022972785],"genre_scores_gemma":[0.87406594,0.000001981285,0.12522511,0.00057028094,0.000042142266,0.00007255121,3.0334087e-7,0.000010182928,0.00001147895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956881,0.0004426172,0.0004927978,0.00093942246,0.0013049,0.0011322098],"domain_scores_gemma":[0.9966736,0.0013894871,0.00011472293,0.001287471,0.0002623661,0.000272365],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.004815111,0.0002451845,0.00025757478,0.00041951053,0.0006743005,0.0009824213,0.005601953,0.00006291815,0.000060446993],"category_scores_gemma":[0.0005135722,0.0001574775,0.000083255785,0.0029868097,0.003765644,0.0014866889,0.0026828584,0.000635452,0.00012831732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036053061,0.000037440026,0.00024604614,0.0000067340898,0.000002242741,0.000009549073,0.0018837821,0.00019189119,0.00164464,0.94811505,0.00001535244,0.047843687],"study_design_scores_gemma":[0.00018649141,0.000062068764,0.0016411785,0.00002382594,6.877961e-7,0.000028055809,0.00008240455,0.5162815,0.0012862452,0.4802542,0.0000053176,0.00014801102],"about_ca_topic_score_codex":0.000015423975,"about_ca_topic_score_gemma":0.0000018637064,"teacher_disagreement_score":0.6059621,"about_ca_system_score_codex":0.000093367176,"about_ca_system_score_gemma":0.00011397945,"threshold_uncertainty_score":0.9997782},"labels":[],"label_agreement":null},{"id":"W2039582686","doi":"10.1007/s004530010019","title":"Linear-Time Algorithms for Partial \\boldmath k -Tree Complements","year":2000,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Time complexity; Combinatorics; Complement (music); Discrete mathematics; Algorithm; Graph; Vertex (graph theory); Theory of computation","score_opus":0.03424946569837089,"score_gpt":0.32753183504768374,"score_spread":0.29328236934931284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039582686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003547445,0.00008649629,0.98993677,0.0012042117,0.00026155793,0.00090883265,0.00009579717,0.000469273,0.0034896352],"genre_scores_gemma":[0.018213725,0.000030229121,0.9688437,0.0007058817,0.0007709526,0.00035085191,0.000086520915,0.00007398185,0.010924135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740356,0.000109179025,0.00037458213,0.0007149137,0.00051914155,0.0008785975],"domain_scores_gemma":[0.99833053,0.00028466788,0.00006901863,0.00091673847,0.00014333514,0.00025573347],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051707187,0.00025287655,0.0003012091,0.0001285796,0.00032266075,0.00012406494,0.0016052463,0.00008187683,0.00063980685],"category_scores_gemma":[0.00004272908,0.00024354794,0.00016695117,0.000518753,0.00013219267,0.000550454,0.0002448832,0.00019606546,0.0012720098],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046168367,0.0001731476,0.00001581501,0.000009974664,0.00005666868,0.000020936122,0.00015953227,0.000118246884,0.0007384688,0.015097801,0.0031845956,0.9803786],"study_design_scores_gemma":[0.0017433283,0.00043027062,0.00013541595,0.000017584029,0.000012379802,0.00003059072,0.000009642985,0.7399095,0.009585808,0.05010469,0.19752961,0.000491126],"about_ca_topic_score_codex":0.0000114949535,"about_ca_topic_score_gemma":0.000001528795,"teacher_disagreement_score":0.97988755,"about_ca_system_score_codex":0.00005214662,"about_ca_system_score_gemma":0.00007613057,"threshold_uncertainty_score":0.99950564},"labels":[],"label_agreement":null},{"id":"W2039732465","doi":"10.1007/s00373-006-0684-x","title":"Some Recent Progress and Applications in Graph Minor Theory","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Graph minor; Minor (academic); Combinatorics; Robertson–Seymour theorem; Mathematics; Extremal graph theory; Discrete mathematics; Conjecture; Graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.014278547458238774,"score_gpt":0.2798043015966379,"score_spread":0.26552575413839913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039732465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7903586,0.049867976,0.15398434,0.000745494,0.0005105095,0.001820875,0.0000067736,0.00040342766,0.0023019756],"genre_scores_gemma":[0.9952064,0.0027076844,0.0017866434,0.000089742,0.000012682228,0.00008736887,0.0000021798573,0.000011922526,0.00009537123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878675,0.00006480947,0.00018490678,0.0003736958,0.00021562267,0.00037423967],"domain_scores_gemma":[0.9991095,0.00022452878,0.000050518687,0.00037769537,0.000074242336,0.00016351315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096165977,0.00012958911,0.00013946909,0.00040288543,0.00016793513,0.000078380006,0.00039756557,0.000065514614,9.4444675e-7],"category_scores_gemma":[0.00001886949,0.00011644642,0.000026906455,0.0014016737,0.000249741,0.00029824817,0.00022837242,0.00019632379,0.0000013718562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009271389,0.000101731515,0.02368769,0.000014636563,0.0000052118103,0.000008131158,0.00016976566,2.3441545e-7,0.000019334113,0.9084095,0.0000112300495,0.06756331],"study_design_scores_gemma":[0.0003628829,0.00007202048,0.02979519,0.000007721698,0.0000023417194,0.0000073331876,0.000102145474,0.000039301816,0.00025701016,0.9666901,0.00252427,0.00013965587],"about_ca_topic_score_codex":0.0000022966863,"about_ca_topic_score_gemma":0.000004148868,"teacher_disagreement_score":0.20484778,"about_ca_system_score_codex":0.00001800199,"about_ca_system_score_gemma":0.000018231352,"threshold_uncertainty_score":0.47485474},"labels":[],"label_agreement":null},{"id":"W2039826584","doi":"10.3390/a6010043","title":"Computational Study on a PTAS for Planar Dominating Set Problem","year":2013,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dominating set; Mathematics; Polynomial-time approximation scheme; Approximation algorithm; Planar; Planar graph; Combinatorics; Planar straight-line graph; Bounded function; Computational complexity theory; Graph; Independent set; Discrete mathematics; Algorithm; Pathwidth; Computer science; Line graph; Mathematical analysis","score_opus":0.03896625998283992,"score_gpt":0.3349611390252531,"score_spread":0.2959948790424132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039826584","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025760436,0.000014765669,0.97074896,0.0007057019,0.00009903715,0.0018532166,0.000014065841,0.00014153043,0.000662304],"genre_scores_gemma":[0.43300563,3.6351975e-7,0.5656673,0.00021177897,0.00007611669,0.0006773857,0.000012689705,0.00001756032,0.0003312173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998534,0.000095103045,0.00019705933,0.0004206867,0.00040425494,0.00034886255],"domain_scores_gemma":[0.9986569,0.00065692025,0.00006569775,0.00032992603,0.00019604024,0.00009447357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048876,0.00012799939,0.0001458703,0.00014315474,0.000220295,0.0001592194,0.0006971774,0.000029740124,0.000013493295],"category_scores_gemma":[0.00005899082,0.00011142676,0.000048000056,0.00032115713,0.000040665214,0.0004102927,0.00012243899,0.00013798886,0.00016890072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057085384,0.0015036738,0.002047442,0.00006174582,0.00022875637,0.00007868868,0.010272753,0.01784282,0.0003071375,0.28125533,0.008014471,0.67833006],"study_design_scores_gemma":[0.0016010428,0.0012890968,0.003506078,0.000019256699,0.000003900957,0.000016828562,0.0006433557,0.5759477,0.00014387758,0.41611665,0.00044977645,0.00026242223],"about_ca_topic_score_codex":0.000020222527,"about_ca_topic_score_gemma":0.0000014331603,"teacher_disagreement_score":0.6780677,"about_ca_system_score_codex":0.00003814218,"about_ca_system_score_gemma":0.000037819867,"threshold_uncertainty_score":0.45438513},"labels":[],"label_agreement":null},{"id":"W2040122307","doi":"10.1016/j.tcs.2011.05.021","title":"Shortest paths between shortest paths","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"K shortest path routing; Shortest path problem; Shortest Path Faster Algorithm; Combinatorics; Yen's algorithm; Euclidean shortest path; Mathematics; Distance; Sequence (biology); Vertex (graph theory); Control reconfiguration; Floyd–Warshall algorithm; Longest path problem; Discrete mathematics; Graph; Computer science; Dijkstra's algorithm; Biology","score_opus":0.03888412546932748,"score_gpt":0.2914092214865761,"score_spread":0.25252509601724865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040122307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048215672,0.000035658606,0.9348867,0.00024407935,0.00050409476,0.00033004064,0.000006137948,0.0005297363,0.015247907],"genre_scores_gemma":[0.80959433,0.000005700123,0.18987802,0.0002844902,0.00017959808,0.000017533735,0.0000013538195,0.000020867497,0.00001812749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944699,0.00027508606,0.00053279445,0.0015813734,0.0015561152,0.0015847684],"domain_scores_gemma":[0.9956252,0.00063184707,0.000103005776,0.0022941337,0.00041798892,0.00092781434],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0032609382,0.000396801,0.0004295266,0.00047619356,0.0007417792,0.00046166888,0.007635751,0.00011435017,0.00016551507],"category_scores_gemma":[0.00024187063,0.00033121402,0.00014811732,0.0029017108,0.006629492,0.0016764265,0.0032855957,0.00059793255,0.0004363696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007736511,0.00009745499,0.0031761709,0.0000036539925,0.000007016323,0.00007077055,0.000775256,0.000010908795,0.00035198432,0.9191293,0.0000235606,0.07634618],"study_design_scores_gemma":[0.00028073697,0.0007380388,0.022533672,0.000044403434,0.00001042179,0.000073928044,0.000018588007,0.081242956,0.011388638,0.88279945,0.00018064973,0.00068853045],"about_ca_topic_score_codex":0.0000066940406,"about_ca_topic_score_gemma":9.914463e-7,"teacher_disagreement_score":0.76137865,"about_ca_system_score_codex":0.00009597539,"about_ca_system_score_gemma":0.00024722697,"threshold_uncertainty_score":0.999914},"labels":[],"label_agreement":null},{"id":"W2040241884","doi":"10.1016/j.disc.2007.10.002","title":"Open irredundance and maximum degree in graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Vertex (graph theory); Graph; Cardinality (data modeling); Discrete mathematics; Independent set; Computer science","score_opus":0.07577418455312727,"score_gpt":0.3270013896165228,"score_spread":0.2512272050633955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040241884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30421165,0.0005718169,0.64735746,0.00094919425,0.00011781927,0.0011013636,0.000009167143,0.00016855747,0.04551295],"genre_scores_gemma":[0.64108884,0.00014739462,0.35786954,0.00010390874,0.000008164305,0.000056618024,0.0000015226973,0.000021566275,0.00070245593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987174,0.000057019475,0.000259472,0.00034788984,0.00027357118,0.00034464707],"domain_scores_gemma":[0.9988787,0.00017541564,0.00007632697,0.0007228997,0.000038680377,0.00010797695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004416222,0.0001436756,0.00023728967,0.00015599719,0.0001481232,0.0001624943,0.0018116646,0.000042528904,0.000010189319],"category_scores_gemma":[0.000114304385,0.00012344458,0.00003422983,0.0005998624,0.00021952597,0.00074974005,0.0013073675,0.00017085472,0.000030467985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009687635,0.00009979896,0.002164545,0.000076012315,0.000011432615,0.00013703873,0.0046145613,0.000014657217,0.00025852476,0.98080873,0.00017232166,0.011632664],"study_design_scores_gemma":[0.000460854,0.00005248223,0.0043235426,0.00006680346,0.0000014917584,0.0001365933,0.0001718016,0.010021557,0.00044164227,0.98378044,0.00032500556,0.00021776426],"about_ca_topic_score_codex":0.000013373582,"about_ca_topic_score_gemma":0.000022768261,"teacher_disagreement_score":0.33687717,"about_ca_system_score_codex":0.000020599997,"about_ca_system_score_gemma":0.00004231779,"threshold_uncertainty_score":0.5033924},"labels":[],"label_agreement":null},{"id":"W2040255444","doi":"10.1016/j.jctb.2011.09.001","title":"Decomposing locally semicomplete digraphs into strong spanning subdigraphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Digraph; Combinatorics; Partition (number theory); Disjoint sets; Arc (geometry); Discrete mathematics","score_opus":0.02491616962830137,"score_gpt":0.27327887964117825,"score_spread":0.24836271001287688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040255444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21304055,0.0014434598,0.7685273,0.00016554353,0.008464023,0.00031227944,0.0000022084782,0.00019793838,0.007846649],"genre_scores_gemma":[0.95489746,0.00007421678,0.04458106,0.000061490864,0.00029410375,0.000004066718,5.9915357e-7,0.000036192698,0.000050808674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650544,0.00073578145,0.0009246202,0.000352489,0.0008294408,0.00065225706],"domain_scores_gemma":[0.9969352,0.00050202804,0.000754891,0.00072865677,0.00070375437,0.000375498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028962633,0.00033759838,0.0005894188,0.0006751426,0.000406377,0.00023638378,0.0026057623,0.00013013606,0.000057985915],"category_scores_gemma":[0.0002418729,0.00029826857,0.00037551852,0.0009797928,0.00048467054,0.0030364841,0.0005118695,0.000802137,0.000009850378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001027467,0.0001343566,0.0009338424,0.000019217265,0.00013256604,0.00016425464,0.0029154883,0.000029962875,0.0046594683,0.9840257,0.0000558195,0.005901817],"study_design_scores_gemma":[0.0011571866,0.001146099,0.00037344536,0.0001235149,0.000022228858,0.0002978257,0.00052252575,0.00007344332,0.021484967,0.97266686,0.0018082885,0.000323607],"about_ca_topic_score_codex":0.000008781557,"about_ca_topic_score_gemma":0.0000022607599,"teacher_disagreement_score":0.74185693,"about_ca_system_score_codex":0.00010427347,"about_ca_system_score_gemma":0.00021636543,"threshold_uncertainty_score":0.99994695},"labels":[],"label_agreement":null},{"id":"W2040573390","doi":"10.1007/s003730070024","title":"Longest Cycles in Almost Claw-Free Graphs","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Claw; Mathematics; Chordal graph; Graph; Pancyclic graph; Clique-sum; Discrete mathematics; 1-planar graph; Biology","score_opus":0.01351657810913522,"score_gpt":0.2533493710628817,"score_spread":0.23983279295374646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040573390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9824823,0.0033293916,0.0011837615,0.00080652116,0.00029461007,0.0003108423,0.0000074096697,0.00025759568,0.011327566],"genre_scores_gemma":[0.99596095,0.002247598,0.0011378397,0.00016916405,0.000006697746,0.000030962015,0.0000024024744,0.000017618508,0.000426741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981229,0.00011568387,0.0002562013,0.00054374937,0.00040123228,0.0005602773],"domain_scores_gemma":[0.9985274,0.0001577186,0.000043232212,0.001006397,0.00006185441,0.00020341948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040984777,0.00021352655,0.00024135518,0.00038281138,0.00020517869,0.00015440125,0.0013801645,0.000107409476,0.0000341977],"category_scores_gemma":[0.000035842462,0.00020671099,0.0000771255,0.0020301107,0.00020556175,0.000528072,0.00031446366,0.00035284265,0.00002315536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014655492,0.0001419605,0.019655893,0.000012820486,0.000007995669,0.0000697154,0.0002110093,0.000011706664,0.000024531366,0.93699443,0.00039101386,0.042464256],"study_design_scores_gemma":[0.0008876314,0.00014579836,0.034764275,0.000020759864,0.0000025045279,0.00002624708,0.000035877958,0.0007039942,0.00012465371,0.9600782,0.0029515584,0.00025850374],"about_ca_topic_score_codex":0.000051223262,"about_ca_topic_score_gemma":0.000036217007,"teacher_disagreement_score":0.04220575,"about_ca_system_score_codex":0.000025650348,"about_ca_system_score_gemma":0.000030940308,"threshold_uncertainty_score":0.84294295},"labels":[],"label_agreement":null},{"id":"W2040632432","doi":"10.1016/j.ejc.2015.02.009","title":"Planar emulators conjecture is nearly true for cubic graphs","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Cubic graph; Planar; Planar graph; Polyhedral graph; Graph; Discrete mathematics; 1-planar graph; Chordal graph; Computer science; Line graph; Computer graphics (images)","score_opus":0.040647873983149146,"score_gpt":0.28536969998990297,"score_spread":0.24472182600675382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040632432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12026788,0.0015683165,0.8700099,0.0014558581,0.0027778088,0.00028884003,0.000008699738,0.00008944092,0.0035332679],"genre_scores_gemma":[0.9885661,0.000028473343,0.010598087,0.00032067616,0.00012025696,9.881059e-7,7.379096e-7,0.0000424038,0.00032229506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755514,0.0005466225,0.0005077569,0.00023745059,0.0007128797,0.00044014753],"domain_scores_gemma":[0.99753827,0.00023045637,0.0004193073,0.0005338929,0.000775348,0.00050272635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028966428,0.00019476895,0.00031023036,0.00037223517,0.00014829838,0.00019592427,0.0019058047,0.000037131937,0.0000038361945],"category_scores_gemma":[0.00034879317,0.00016364148,0.00021726941,0.0007952114,0.00008878587,0.0006551686,0.00016139043,0.0004754316,0.000033405824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014224258,0.0001569222,0.0011057362,0.000024092857,0.00009733117,0.00053388905,0.0025550623,0.00021304365,0.00019701892,0.95991594,0.028206233,0.0068524717],"study_design_scores_gemma":[0.004065115,0.0028734833,0.00071411696,0.000053215623,0.000022385637,0.00040078931,0.00016034,0.0010575161,0.0012936555,0.9144274,0.07457266,0.0003593042],"about_ca_topic_score_codex":3.5316444e-7,"about_ca_topic_score_gemma":8.131617e-8,"teacher_disagreement_score":0.8682982,"about_ca_system_score_codex":0.00007520208,"about_ca_system_score_gemma":0.00018330416,"threshold_uncertainty_score":0.6673106},"labels":[],"label_agreement":null},{"id":"W2040720394","doi":"10.1016/j.jctb.2012.05.002","title":"Spectrally degenerate graphs: Hereditary case","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"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":"Degenerate energy levels; Combinatorics; Upper and lower bounds; Converse; Mathematics; Spectral radius; Vertex (graph theory); Graph; Degree (music); Discrete mathematics; Physics; Quantum mechanics; Mathematical analysis; Geometry","score_opus":0.016353382331158694,"score_gpt":0.27266766040740703,"score_spread":0.25631427807624835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040720394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84588,0.005473278,0.10296995,0.00084122,0.038338784,0.0003445843,0.000007829134,0.00017123514,0.005973143],"genre_scores_gemma":[0.9857959,0.00008351096,0.0121305855,0.000107989195,0.0016394076,0.000003365789,4.1743797e-7,0.00002400007,0.00021480335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972755,0.00076245295,0.00056854764,0.00016899355,0.00059708976,0.0006274207],"domain_scores_gemma":[0.997853,0.00042851586,0.00038945238,0.0005365948,0.00041894123,0.00037348617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035331803,0.00022377931,0.00037135018,0.00031522143,0.0002555303,0.00013855915,0.0011661183,0.00009820134,0.00007688211],"category_scores_gemma":[0.00032345788,0.0001841774,0.00024033221,0.00065837184,0.00022814827,0.003780683,0.0002562457,0.0005580991,0.00001890083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040309722,0.00016877943,0.00017641878,0.000009570198,0.0000857439,0.002575121,0.0006679342,0.000020479369,0.0011884719,0.99160635,0.0008165772,0.002281458],"study_design_scores_gemma":[0.0008729566,0.0006728919,0.00007474953,0.000019759309,0.000017717959,0.020612938,0.000266357,0.000011378455,0.015684623,0.95544773,0.0060972916,0.00022160175],"about_ca_topic_score_codex":0.0000016173558,"about_ca_topic_score_gemma":7.4733475e-7,"teacher_disagreement_score":0.13991594,"about_ca_system_score_codex":0.00007948399,"about_ca_system_score_gemma":0.00014579801,"threshold_uncertainty_score":0.7510537},"labels":[],"label_agreement":null},{"id":"W2041621858","doi":"10.1007/s10878-008-9203-8","title":"Well paired-dominated graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Prince Edward Island","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Induced subgraph; Matching (statistics); Cardinality (data modeling); Set (abstract data type); Discrete mathematics; Theory of computation; Graph; Computer science; Vertex (graph theory); Algorithm","score_opus":0.014786778482132978,"score_gpt":0.2552395727820874,"score_spread":0.24045279429995445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041621858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117753325,0.0001541989,0.98229444,0.00050316105,0.0036057567,0.00013618941,4.0557322e-7,0.00005847383,0.0014720383],"genre_scores_gemma":[0.8019154,0.00029033527,0.19734396,0.000085569816,0.00021460485,0.0000025071129,0.0000015189135,0.000019451347,0.00012664075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820447,0.0002348114,0.0004961929,0.00015694225,0.00067168596,0.00023592611],"domain_scores_gemma":[0.9979874,0.00017211583,0.00045149977,0.00029974812,0.00087676867,0.00021244973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007076648,0.0001261324,0.00025479845,0.00042190938,0.00019737282,0.00006021562,0.00086562027,0.000084316394,0.00003076427],"category_scores_gemma":[0.0004202601,0.000112607595,0.00014408141,0.0010533938,0.00009861284,0.0012892433,0.00010398444,0.0002835012,0.000011676636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039627455,0.0005345721,0.000897543,0.000014507131,0.00008981512,0.0003926609,0.0006820245,0.39398834,0.0006796927,0.5941485,0.0062933816,0.0018827015],"study_design_scores_gemma":[0.008900744,0.001936341,0.00051808776,0.00008709692,0.000030013192,0.0012076491,0.00004734007,0.34873334,0.008662185,0.62440103,0.0048843212,0.0005918944],"about_ca_topic_score_codex":0.000001258752,"about_ca_topic_score_gemma":2.7835407e-8,"teacher_disagreement_score":0.7901401,"about_ca_system_score_codex":0.000072801784,"about_ca_system_score_gemma":0.0002330591,"threshold_uncertainty_score":0.45920044},"labels":[],"label_agreement":null},{"id":"W2042269609","doi":"10.1016/j.disc.2004.05.003","title":"Tight bounds on maximal and maximum matchings","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Planar graph; Discrete mathematics; Graph; Class (philosophy); Degree (music); Computer science","score_opus":0.01734329773186264,"score_gpt":0.28195897687854693,"score_spread":0.26461567914668427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042269609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14147097,0.00007600687,0.84241265,0.0017944064,0.00009610465,0.00025711453,0.0000058501064,0.00022703933,0.0136598395],"genre_scores_gemma":[0.64931834,0.000025725576,0.34958884,0.00034569122,0.000040996085,0.000025170973,0.0000027649473,0.000036397483,0.0006160683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859524,0.000026543536,0.00022060049,0.00034437716,0.00043152628,0.00038170902],"domain_scores_gemma":[0.99894875,0.00011929314,0.000076463686,0.00067145296,0.000038276547,0.00014575562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372054,0.00018571549,0.00019795388,0.00013022682,0.00019006818,0.00026454136,0.00069928315,0.0000554566,0.000014109392],"category_scores_gemma":[0.000070015485,0.00014841634,0.000058403908,0.00027377007,0.00015180458,0.00037494846,0.0003444757,0.00021544893,0.00014457571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006124334,0.000058908026,0.000019465942,0.00005721731,0.000011381879,0.000030277819,0.0018721564,0.0000527002,0.00042071202,0.99519664,0.00003419786,0.0022402476],"study_design_scores_gemma":[0.00038745586,0.00013897967,0.0001318037,0.000074263226,0.0000037803104,0.000057588717,0.00011226501,0.0024880904,0.0021422303,0.99364066,0.00062162906,0.00020125246],"about_ca_topic_score_codex":0.0000030925191,"about_ca_topic_score_gemma":0.0000015853168,"teacher_disagreement_score":0.50784737,"about_ca_system_score_codex":0.000046813664,"about_ca_system_score_gemma":0.00003397323,"threshold_uncertainty_score":0.60522425},"labels":[],"label_agreement":null},{"id":"W2042465032","doi":"10.1016/j.ejc.2011.03.013","title":"Interleaved adjoints of directed graphs","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.039698541488880044,"score_gpt":0.25137634195446207,"score_spread":0.21167780046558202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042465032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26817134,0.0016981164,0.6650537,0.00022837547,0.0028207724,0.00021857065,0.0000026810796,0.00019183935,0.061614595],"genre_scores_gemma":[0.98419636,0.00008437917,0.015511199,0.000036093345,0.00001422176,1.878406e-7,1.3639068e-7,0.00001969224,0.00013773142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976021,0.00089898513,0.0006484714,0.00014417141,0.0004634989,0.0002427766],"domain_scores_gemma":[0.9979149,0.00009267576,0.00071335473,0.00047189265,0.00061117706,0.00019598623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001999329,0.00012387962,0.00029079322,0.00042585947,0.000052509924,0.000026521164,0.0018476414,0.000013907065,0.000021195343],"category_scores_gemma":[0.00024889846,0.00010542376,0.00016657537,0.00087414205,0.000113062975,0.00043991755,0.0003187107,0.0003458941,0.000021460051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015223424,0.00078357063,0.004209127,0.00004642653,0.000172468,0.00083102647,0.006501937,0.000006757964,0.0021275529,0.934381,0.0022928945,0.048495017],"study_design_scores_gemma":[0.004589923,0.0066566835,0.083802424,0.0005390351,0.000028237431,0.00065178855,0.0003446508,0.0005232915,0.028815322,0.86657846,0.006799066,0.0006711343],"about_ca_topic_score_codex":7.3378385e-7,"about_ca_topic_score_gemma":1.1499431e-7,"teacher_disagreement_score":0.71602505,"about_ca_system_score_codex":0.000030470144,"about_ca_system_score_gemma":0.00006660504,"threshold_uncertainty_score":0.4299056},"labels":[],"label_agreement":null},{"id":"W2042811967","doi":"10.1016/j.dam.2006.10.015","title":"Generalization of matching extensions in graphs (II)","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Generalization; Matching (statistics); Discrete mathematics; Graph","score_opus":0.015407767139256798,"score_gpt":0.27308289447956163,"score_spread":0.25767512734030484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042811967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18472718,0.00003876604,0.8076205,0.000069613954,0.000025122747,0.0002471654,0.0000026509467,0.00007026729,0.007198687],"genre_scores_gemma":[0.6810975,0.000008013001,0.3187595,0.000019471256,0.000008063585,0.00002671572,0.0000066212056,0.000012986328,0.000061124854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873906,0.000020407164,0.00040987844,0.00023883031,0.00032871653,0.0002630977],"domain_scores_gemma":[0.9990895,0.000108289605,0.00014627105,0.0005700588,0.000048857553,0.00003701575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034603302,0.00012684897,0.00021914652,0.00025288304,0.00009610611,0.00003056975,0.0005377669,0.0000496399,0.0000070553674],"category_scores_gemma":[0.000017397824,0.00011346601,0.00005242227,0.0007803847,0.00007220592,0.00016771036,0.00028754896,0.000108593136,0.000007454712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020958598,0.00008029929,0.000030793355,0.000045941866,0.0000030642016,0.000002322978,0.00071128906,0.0033252104,0.045756504,0.949565,0.000038986305,0.00043852534],"study_design_scores_gemma":[0.0002134355,0.000013520843,0.0002626508,0.000033537184,0.0000028884904,0.000003110632,0.000122018086,0.022422053,0.012418413,0.96435255,0.000030345109,0.00012546174],"about_ca_topic_score_codex":0.000019868636,"about_ca_topic_score_gemma":0.000021635436,"teacher_disagreement_score":0.49637032,"about_ca_system_score_codex":0.000019089099,"about_ca_system_score_gemma":0.0000199876,"threshold_uncertainty_score":0.46270096},"labels":[],"label_agreement":null},{"id":"W204285469","doi":"","title":"Packing Three-Vertex Paths in 2-Connected Cubic Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Polyhedral graph; Cubic graph; Chordal graph; 1-planar graph; Graph; Line graph","score_opus":0.02290155658983611,"score_gpt":0.2636769478942789,"score_spread":0.2407753913044428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204285469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919552,0.0003394707,0.003836139,0.00026026205,0.0011812228,0.0002993071,0.000001163129,0.00030143998,0.0018258042],"genre_scores_gemma":[0.9978471,0.00006538214,0.0018352899,0.00012616599,0.000003479502,0.000037614176,0.0000023252624,0.000023241862,0.00005944452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767333,0.00018734703,0.00031363295,0.00060257525,0.0005274913,0.0006956358],"domain_scores_gemma":[0.9982354,0.00037109907,0.00008425907,0.0010053103,0.00013556311,0.00016838493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004717107,0.0002201019,0.00028743624,0.00043768107,0.00025237072,0.00005961387,0.0014660637,0.00010482686,0.00002207574],"category_scores_gemma":[0.00022389572,0.00022333565,0.000100028985,0.0021601808,0.00017616256,0.00075698906,0.00042847643,0.0004461976,0.00012060041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125312945,0.00012571909,0.040037844,0.000006697161,0.0000113695305,0.000283189,0.00046809745,0.000017058455,0.0008235852,0.954427,0.00029006766,0.0034968522],"study_design_scores_gemma":[0.0010904932,0.00010684651,0.041686796,0.000031093354,0.0000013592114,0.00004443026,0.00001613943,0.004088335,0.0017527915,0.95069593,0.00021378194,0.00027197806],"about_ca_topic_score_codex":0.000056608093,"about_ca_topic_score_gemma":0.000045175337,"teacher_disagreement_score":0.0058918656,"about_ca_system_score_codex":0.00009343592,"about_ca_system_score_gemma":0.00010841727,"threshold_uncertainty_score":0.9107363},"labels":[],"label_agreement":null},{"id":"W2042880596","doi":"10.1016/s0012-365x(00)00075-3","title":"Stable 2-pairs and (X,Y)-intersection graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Intersection (aeronautics); Discrete mathematics","score_opus":0.022613387874989576,"score_gpt":0.286789227492788,"score_spread":0.26417583961779845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042880596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1138301,0.00009793571,0.8722693,0.0002456771,0.00009184919,0.0001770171,0.0000016991668,0.00019177789,0.013094681],"genre_scores_gemma":[0.8806484,0.00010870402,0.117606856,0.00007235048,0.00002099369,0.000023861701,0.0000018786028,0.00002079721,0.0014961761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989914,0.00003946291,0.00017848192,0.00025083977,0.00024848877,0.0002913618],"domain_scores_gemma":[0.9991782,0.00011815506,0.00006126929,0.0004881624,0.000052088653,0.00010213234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003457485,0.00011957257,0.00014083792,0.00014029989,0.00013504215,0.00015058549,0.0004023707,0.000036997364,0.000028464709],"category_scores_gemma":[0.000068809684,0.000100926525,0.000047969355,0.0004389785,0.00009372088,0.00048837526,0.00022863164,0.00012077961,0.000040298997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067566984,0.00004626214,0.0005453294,0.00005377766,0.000019116693,0.000020463225,0.0017805414,0.000026884434,0.0008680701,0.99104166,0.00018601459,0.005405105],"study_design_scores_gemma":[0.0002567726,0.000093952534,0.0002682327,0.000045781188,0.0000058314836,0.00012023256,0.00072989025,0.06729558,0.0011490779,0.92829514,0.0015275612,0.00021192546],"about_ca_topic_score_codex":0.0000049925275,"about_ca_topic_score_gemma":0.000006738729,"teacher_disagreement_score":0.7668183,"about_ca_system_score_codex":0.000021624552,"about_ca_system_score_gemma":0.000012160404,"threshold_uncertainty_score":0.41156644},"labels":[],"label_agreement":null},{"id":"W2043020651","doi":"10.1016/s0012-365x(03)00084-0","title":"On upper domination Ramsey numbers for graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Domination analysis; Graph; Independence number; Integer (computer science); Dominating set; Upper and lower bounds; Cardinality (data modeling); Discrete mathematics; Vertex (graph theory)","score_opus":0.020983167306812715,"score_gpt":0.3109859675149543,"score_spread":0.29000280020814156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043020651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013087428,0.000017714472,0.9692879,0.00022726489,0.00014361742,0.00052590616,0.000006038517,0.00010249836,0.016601654],"genre_scores_gemma":[0.47833553,0.000008121955,0.519796,0.00018689246,0.000013145703,0.00016183994,0.000006151132,0.000034640092,0.0014576411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987423,0.000067426365,0.00022330922,0.0002871295,0.00034332337,0.00033652183],"domain_scores_gemma":[0.99844384,0.00064176763,0.00009340894,0.00063495064,0.00009681548,0.00008923708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065797544,0.00014803841,0.0001673289,0.00014594667,0.00015333496,0.00011422624,0.0005412697,0.000055328233,0.00002462375],"category_scores_gemma":[0.0006101833,0.00012271064,0.000127666,0.00036920447,0.0000675415,0.00026612295,0.000051618943,0.00010818813,0.000070203525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056574654,0.00005425029,0.0000127450685,0.000043754935,0.000011892307,0.0000012184445,0.00067729206,0.000051949155,0.00019214797,0.99745643,0.00033029154,0.0011623913],"study_design_scores_gemma":[0.00042199867,0.000092185204,0.000010098362,0.000030369452,0.000004718497,0.000006084786,0.00015001395,0.013973144,0.004640451,0.97948027,0.0010288615,0.00016182013],"about_ca_topic_score_codex":3.8424e-7,"about_ca_topic_score_gemma":7.0705306e-7,"teacher_disagreement_score":0.4652481,"about_ca_system_score_codex":0.0000344572,"about_ca_system_score_gemma":0.000026178914,"threshold_uncertainty_score":0.5003995},"labels":[],"label_agreement":null},{"id":"W2043779144","doi":"10.1006/jctb.2001.2077","title":"The Numbers of Dependent k-Sets in a Graph Are Log Concave","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Graph; Mathematics; Complement graph; Discrete mathematics; Graph power; Line graph","score_opus":0.01685087307057495,"score_gpt":0.2667885007855626,"score_spread":0.24993762771498765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043779144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91035974,0.009537462,0.032367546,0.004773947,0.024139734,0.0011171432,0.000014903436,0.00010862947,0.01758089],"genre_scores_gemma":[0.9986206,0.0004436621,0.0005735329,0.00003858596,0.00009991191,0.0000042255047,7.8759065e-8,0.000012280443,0.00020711702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971207,0.00084491755,0.00071378326,0.00016930456,0.0007744744,0.00037684286],"domain_scores_gemma":[0.9969001,0.0012623939,0.0007540615,0.000525453,0.00042495868,0.00013307619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002932208,0.00016284698,0.00039278917,0.00024386693,0.00016814054,0.00010165648,0.0017961188,0.00008589155,0.00003993881],"category_scores_gemma":[0.0007663954,0.00011396363,0.00018804523,0.0006965063,0.00046590556,0.0008845644,0.00025706828,0.000553902,0.000005962104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005149662,0.00014338065,0.000859864,0.0000109574385,0.00005777025,0.00014306637,0.0009792143,0.00008251112,0.0002963784,0.9926636,0.00027312193,0.0039751767],"study_design_scores_gemma":[0.0015153674,0.0005099696,0.0004952588,0.000062074556,0.0000064729315,0.00015313081,0.0007948194,0.00005997436,0.003618479,0.9909198,0.0017398462,0.00012475412],"about_ca_topic_score_codex":0.00000248247,"about_ca_topic_score_gemma":0.000007888699,"teacher_disagreement_score":0.08826086,"about_ca_system_score_codex":0.00008491391,"about_ca_system_score_gemma":0.00006544721,"threshold_uncertainty_score":0.46473017},"labels":[],"label_agreement":null},{"id":"W2044097137","doi":"10.1002/jgt.10133","title":"Graphs embedded in the plane with a bounded number of accumulation points","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Bounded function; Planar graph; Vertex (graph theory); 1-planar graph; Discrete mathematics; Plane (geometry); Chordal graph; Characterization (materials science); Graph; Geometry; Mathematical analysis; Computer science","score_opus":0.027516363535805933,"score_gpt":0.3258557425078503,"score_spread":0.2983393789720444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044097137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8603009,0.00020427401,0.13546436,0.00017404804,0.00012530008,0.00019879823,0.000001332308,0.000011697543,0.0035192957],"genre_scores_gemma":[0.98239255,0.000031339885,0.017403265,0.00012274513,0.000011611555,0.0000033469148,3.2592874e-7,0.000009873662,0.000024962208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970481,0.0013056535,0.00048827575,0.00016072487,0.0007178434,0.00027942946],"domain_scores_gemma":[0.99778736,0.00092977396,0.00047178546,0.0004959291,0.0002426627,0.00007251869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048010796,0.00013932878,0.00027208938,0.00049421366,0.00008423326,0.00006277388,0.0010520602,0.00005503023,0.00003755783],"category_scores_gemma":[0.00027596473,0.00008237722,0.00014194287,0.0014456487,0.00024736385,0.0006672698,0.000035651196,0.00042752502,0.0000040501704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036210212,0.00015734548,0.009173349,0.000011907678,0.000051248113,0.00007877488,0.0019629942,0.00017424562,0.0004560408,0.986593,0.000037599206,0.0009414086],"study_design_scores_gemma":[0.0011512906,0.00025164775,0.007287302,0.000067487446,0.000010933107,0.0006916164,0.0006322775,0.000060355724,0.0015242582,0.9881105,0.00010736615,0.000104988896],"about_ca_topic_score_codex":0.0000018702303,"about_ca_topic_score_gemma":0.0000065306717,"teacher_disagreement_score":0.12209162,"about_ca_system_score_codex":0.000021793388,"about_ca_system_score_gemma":0.00011180212,"threshold_uncertainty_score":0.33592457},"labels":[],"label_agreement":null},{"id":"W2044878800","doi":"10.1016/s0012-365x(99)00323-4","title":"On the girth of digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Girth (graph theory); Counterexample; Order (exchange); Discrete mathematics","score_opus":0.020229973716509912,"score_gpt":0.2800074361875158,"score_spread":0.25977746247100586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044878800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3999429,0.00011001184,0.42251456,0.0018986403,0.00007323663,0.0006399454,0.00001635812,0.00019737931,0.17460696],"genre_scores_gemma":[0.97102976,0.000028208011,0.027007727,0.0001615628,0.0000105476065,0.000020150921,7.6212643e-7,0.000013639043,0.0017276356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989863,0.000060979753,0.00020096646,0.00015796236,0.00038422277,0.000209575],"domain_scores_gemma":[0.9982948,0.0006008238,0.00006276561,0.0009611372,0.00003478273,0.00004569893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037985994,0.000100282734,0.00013560765,0.00005902784,0.00008880956,0.000046117853,0.0011373444,0.000024782892,0.00029295575],"category_scores_gemma":[0.00009945668,0.000057352183,0.00008944084,0.00043819225,0.00014933237,0.00011979719,0.00008805213,0.00012344436,0.00014869536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003789216,0.00004341319,0.000008822783,0.000017784876,0.000010459844,0.0000018129317,0.0009746119,0.00008096103,0.000121657606,0.9930301,0.00019261865,0.0055139787],"study_design_scores_gemma":[0.00009862322,0.00008345907,0.000064413696,0.000046074758,0.0000026810299,0.0000040668406,0.00009053827,0.016834786,0.0032262844,0.97889215,0.0005639267,0.000093013536],"about_ca_topic_score_codex":0.0000010692298,"about_ca_topic_score_gemma":6.132927e-7,"teacher_disagreement_score":0.5710869,"about_ca_system_score_codex":0.0000063318703,"about_ca_system_score_gemma":0.0000135838545,"threshold_uncertainty_score":0.32076603},"labels":[],"label_agreement":null},{"id":"W2045037050","doi":"10.1016/j.ipl.2010.05.019","title":"Upper signed k-domination in a general graph","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Domination analysis; Mathematics; Upper and lower bounds; Graph; Computer science; Discrete mathematics; Vertex (graph theory)","score_opus":0.007070255514333437,"score_gpt":0.258272288875039,"score_spread":0.25120203336070557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045037050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37194332,0.000004700622,0.623632,0.0031258361,0.00016282429,0.0001337803,5.444691e-7,0.00011050471,0.0008864561],"genre_scores_gemma":[0.9297992,6.770251e-7,0.06693844,0.0031653985,0.00002343317,0.00004018491,0.00000753007,0.0000047375875,0.000020379033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895996,0.000031849155,0.00028251228,0.00013165733,0.00032922043,0.000264785],"domain_scores_gemma":[0.9994516,0.000036526744,0.000118633834,0.00023467017,0.00010560674,0.00005296459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050711696,0.00009624413,0.00008185049,0.00060979975,0.00012555646,0.00035008616,0.0005347925,0.000051504627,0.000009645693],"category_scores_gemma":[0.00009799072,0.000092473114,0.0000306381,0.0008315356,0.00007233839,0.0068426747,0.00007701485,0.00028607188,0.00005517693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038565828,0.000050386894,0.0026626182,0.00010698071,0.0000059985246,0.000007736281,0.00884484,0.002120355,0.21586756,0.10283298,0.0007824741,0.6666795],"study_design_scores_gemma":[0.00504641,0.00012185902,0.0633734,0.0001698901,0.0000070194274,0.00012854482,0.00038481693,0.7364271,0.06284763,0.11108003,0.01874342,0.001669838],"about_ca_topic_score_codex":0.000006357926,"about_ca_topic_score_gemma":0.000004694493,"teacher_disagreement_score":0.7343068,"about_ca_system_score_codex":0.000030590945,"about_ca_system_score_gemma":0.00005313701,"threshold_uncertainty_score":0.4960774},"labels":[],"label_agreement":null},{"id":"W2045237424","doi":"10.1016/j.jctb.2008.01.003","title":"Locally planar graphs are 5-choosable","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Graph; Computer science; Mathematics; Combinatorics; Telecommunications; Computer graphics (images)","score_opus":0.01650812458121698,"score_gpt":0.25320838278942615,"score_spread":0.23670025820820917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045237424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4654458,0.004596354,0.46933648,0.0036452923,0.03279272,0.00086708035,0.00001722927,0.00050613267,0.02279293],"genre_scores_gemma":[0.98918587,0.00039481072,0.00880734,0.00019424745,0.00048425017,0.00000451587,5.374269e-7,0.000029328987,0.0008991092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729,0.00051399297,0.00061154936,0.00023437163,0.0008916132,0.00045847535],"domain_scores_gemma":[0.9973579,0.0004690096,0.0005934552,0.0006081078,0.0006738926,0.00029760253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017665039,0.00021926627,0.00047193456,0.00035699786,0.00037576686,0.000098611956,0.0019493342,0.0001106818,0.00005066655],"category_scores_gemma":[0.0005382401,0.00018359054,0.00024520946,0.00079051126,0.000424313,0.002042561,0.00018983353,0.00061123027,0.000028240594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081880385,0.0001358272,0.00058769877,0.000010298339,0.000070013884,0.0006964763,0.00039820175,0.000054595166,0.0005469877,0.99369216,0.0022420564,0.0007468556],"study_design_scores_gemma":[0.0012892414,0.00083197886,0.0004851484,0.00004796703,0.000007259189,0.0013104215,0.00016160306,0.00001579213,0.004519972,0.97586447,0.01526109,0.00020503884],"about_ca_topic_score_codex":0.0000011164916,"about_ca_topic_score_gemma":4.5504456e-7,"teacher_disagreement_score":0.52374005,"about_ca_system_score_codex":0.0000742771,"about_ca_system_score_gemma":0.00027594678,"threshold_uncertainty_score":0.7486605},"labels":[],"label_agreement":null},{"id":"W2045251507","doi":"10.1016/j.disc.2009.01.018","title":"Vertex domination of generalized Petersen graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Dominating set; Vertex (graph theory); Mathematics; Domination analysis; Neighbourhood (mathematics); Modulo; Discrete mathematics; Graph","score_opus":0.01943357779614378,"score_gpt":0.30040339959807083,"score_spread":0.28096982180192703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045251507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10324393,0.00007398045,0.8877922,0.0004395429,0.00007931272,0.00027290903,0.0000041985463,0.00011204449,0.007981846],"genre_scores_gemma":[0.7549702,0.000018059125,0.24472336,0.00006309765,0.0000068904533,0.00000586085,0.0000031631905,0.000007455448,0.0002019018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988285,0.000058408084,0.000294836,0.0001975318,0.00039196122,0.00022879783],"domain_scores_gemma":[0.9989251,0.00012252165,0.00014112334,0.0006422742,0.00010061277,0.00006839992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036565925,0.0001179872,0.00021336724,0.00017363463,0.000057038356,0.000048562706,0.00072360935,0.000039658025,0.000014362354],"category_scores_gemma":[0.000116758354,0.00009821025,0.00010697533,0.00045467028,0.00006754547,0.00031577097,0.000091422335,0.00008137122,0.000018899813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057583857,0.000056926227,0.000008980735,0.000028531449,0.000009913194,0.0000040088153,0.0011447355,0.000034521592,0.011699035,0.97996557,0.000075070115,0.006966958],"study_design_scores_gemma":[0.00038464958,0.000111045156,0.0003106171,0.000036215402,0.0000062924437,0.000008783013,0.00007602235,0.049833655,0.013584694,0.9354493,0.000066635504,0.00013206953],"about_ca_topic_score_codex":9.954299e-7,"about_ca_topic_score_gemma":5.0389497e-7,"teacher_disagreement_score":0.6517263,"about_ca_system_score_codex":0.000016708409,"about_ca_system_score_gemma":0.00001912559,"threshold_uncertainty_score":0.40048978},"labels":[],"label_agreement":null},{"id":"W2045836875","doi":"10.1016/j.disc.2013.02.021","title":"Hamilton paths in generalized Petersen graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.021707420690217437,"score_gpt":0.2835553962889854,"score_spread":0.261847975598768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045836875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6005882,0.00012371015,0.3867798,0.0004950737,0.00015647386,0.00090622815,0.000004332649,0.00026166037,0.010684546],"genre_scores_gemma":[0.680686,0.00005591961,0.31783402,0.00020989106,0.00002061047,0.00020082082,0.000005271261,0.00003597301,0.00095150934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829763,0.00010426549,0.00036625974,0.0003393552,0.0003986208,0.0004938702],"domain_scores_gemma":[0.9986034,0.00017251041,0.00009510341,0.0009266857,0.00007157372,0.00013069468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038364806,0.00018731624,0.00025859004,0.00025893966,0.000069545196,0.00019851806,0.0010738719,0.000060611128,0.00007763646],"category_scores_gemma":[0.00008481317,0.00015262596,0.00010037119,0.00064132706,0.0000951681,0.0006232794,0.0002645012,0.00019110354,0.00035853722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028533061,0.000102813225,0.00034960292,0.00008400516,0.000016656813,0.000031570205,0.005274123,0.00011320182,0.0053039845,0.9844674,0.0003065969,0.0039471826],"study_design_scores_gemma":[0.00045239105,0.000046453453,0.0008086981,0.000052731346,0.0000024248154,0.00001390358,0.00027922852,0.116411135,0.0012308934,0.8801684,0.000261735,0.0002720273],"about_ca_topic_score_codex":0.000026966896,"about_ca_topic_score_gemma":0.000010384838,"teacher_disagreement_score":0.11629794,"about_ca_system_score_codex":0.000035089517,"about_ca_system_score_gemma":0.000021631207,"threshold_uncertainty_score":0.62239057},"labels":[],"label_agreement":null},{"id":"W2046344378","doi":"10.1016/j.aml.2010.05.007","title":"A note on graph minors and strong products","year":2010,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Cartesian product; Graph; Graph minor; Distance-regular graph; Symmetric graph; Voltage graph; Minor (academic); Line graph; Discrete mathematics; Petersen graph; Humanities","score_opus":0.015458386186772864,"score_gpt":0.26141048036740355,"score_spread":0.2459520941806307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046344378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.508663,0.000006840605,0.48089933,0.0045198146,0.00019308689,0.00059435767,0.000001714453,0.00021440873,0.0049074483],"genre_scores_gemma":[0.51565355,0.000002327736,0.48322672,0.00092318415,0.000060007293,0.000060004953,9.57947e-7,0.000023158598,0.000050077906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867,0.000011304348,0.00017164019,0.0004302341,0.000349048,0.00036776398],"domain_scores_gemma":[0.9986526,0.0002453335,0.00007816208,0.00089310185,0.000027192495,0.00010362167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037902393,0.00017269365,0.0001659041,0.00017706549,0.00012418148,0.00011227205,0.0006723378,0.000047320707,0.000004737349],"category_scores_gemma":[0.000065161774,0.00015037546,0.000028689408,0.00034674437,0.00019070874,0.0001382041,0.00021459821,0.00039250092,0.000065305336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003975115,0.000049282986,0.0000055391615,0.00004936379,0.000008094435,0.000006061485,0.0006716108,0.000013709831,0.31298342,0.67928433,0.0003751894,0.006549434],"study_design_scores_gemma":[0.0014549555,0.0001485301,0.00040913193,0.000065756074,0.00002501062,0.00008677316,0.0001592725,0.0063732527,0.31971383,0.6668762,0.0034966304,0.0011906711],"about_ca_topic_score_codex":8.890009e-7,"about_ca_topic_score_gemma":0.000002037841,"teacher_disagreement_score":0.012408151,"about_ca_system_score_codex":0.00001003609,"about_ca_system_score_gemma":0.000015228654,"threshold_uncertainty_score":0.6132133},"labels":[],"label_agreement":null},{"id":"W2046384546","doi":"10.1016/j.dam.2006.04.018","title":"Minimum edge ranking spanning trees of split graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Discrete mathematics; Chordal graph; k-minimum spanning tree; Indifference graph; Time complexity; Graph; K-ary tree; Tree structure; Binary tree","score_opus":0.01762151411447972,"score_gpt":0.27094719792071237,"score_spread":0.25332568380623266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046384546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10674736,0.00013206153,0.85252815,0.000057618738,0.000057954465,0.00039990645,0.000005846751,0.00018379527,0.039887287],"genre_scores_gemma":[0.62795115,0.000004981076,0.37177896,0.000015992984,0.000028484137,0.000035636815,0.0000050067647,0.000024705141,0.00015504616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802744,0.000023671315,0.0005346803,0.00037918903,0.0005594206,0.00047558383],"domain_scores_gemma":[0.99830645,0.00034245942,0.0002665488,0.0009393769,0.000072522955,0.00007263371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005264977,0.00022924792,0.0003854007,0.00025234322,0.00013033683,0.00009043498,0.001155505,0.000074158874,0.000014662589],"category_scores_gemma":[0.00003339746,0.00020233903,0.00013578101,0.0007500514,0.00020284657,0.00021677797,0.0003737928,0.00017412659,0.00003086101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010205848,0.00007261873,0.00007080443,0.000120648816,0.00001761357,0.0000038993553,0.0007437046,0.000165393,0.023360597,0.97281045,0.0000884629,0.0025356293],"study_design_scores_gemma":[0.00048756824,0.0000381949,0.00031896582,0.00007286322,0.000013869388,0.000006966751,0.00028110115,0.018333185,0.023930458,0.9560708,0.0001734175,0.00027262708],"about_ca_topic_score_codex":0.0000058171645,"about_ca_topic_score_gemma":0.0000039648685,"teacher_disagreement_score":0.5212038,"about_ca_system_score_codex":0.000021116839,"about_ca_system_score_gemma":0.00003068952,"threshold_uncertainty_score":0.8251146},"labels":[],"label_agreement":null},{"id":"W2046684958","doi":"10.1137/100803870","title":"Gallai's Theorem for List Coloring of Digraphs","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Complete coloring; Fractional coloring; Greedy coloring; Vertex (graph theory); List coloring; Discrete mathematics; Generalization; Brooks' theorem; Graph; Graph coloring; Graph power; Line graph","score_opus":0.058209093472088747,"score_gpt":0.311648151051908,"score_spread":0.25343905757981927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046684958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031929165,0.00009425406,0.9482208,0.00012021787,0.00023441594,0.0003547909,0.000008319016,0.00005662066,0.018981414],"genre_scores_gemma":[0.74085915,0.00005211689,0.25869334,0.000040162347,0.00005020345,0.000018124203,4.3559965e-7,0.000027977414,0.00025847886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830014,0.00007719337,0.0005241359,0.00020438214,0.0004856908,0.00040843678],"domain_scores_gemma":[0.9980901,0.00048874796,0.00041487158,0.00059362996,0.000231192,0.00018146582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012766744,0.0001804245,0.00031768603,0.00026221643,0.00019206807,0.00009853444,0.0013780063,0.00005588729,0.00004403662],"category_scores_gemma":[0.00032580347,0.00013209731,0.00025762885,0.00035693735,0.00016484591,0.00037391324,0.00016854791,0.0002842776,0.000010134479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057654062,0.00013384575,0.000082165134,0.0000945796,0.000051963176,0.000014306891,0.0025753218,0.00002099097,0.0008364839,0.994263,0.00007891993,0.0017907693],"study_design_scores_gemma":[0.00048002522,0.00071112224,0.00010356447,0.00021285945,0.000013505969,0.00009308402,0.00039554486,0.005017353,0.01777364,0.9746616,0.00035057758,0.00018711359],"about_ca_topic_score_codex":6.562782e-7,"about_ca_topic_score_gemma":0.0000011208024,"teacher_disagreement_score":0.70893,"about_ca_system_score_codex":0.000033000128,"about_ca_system_score_gemma":0.00005239067,"threshold_uncertainty_score":0.53867716},"labels":[],"label_agreement":null},{"id":"W2046755592","doi":"10.1016/j.disc.2008.05.031","title":"Brambles and independent packings in chordal graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Indifference graph; Treewidth; Discrete mathematics; Pathwidth; Disjoint sets; Maximal independent set; Interval graph; Independent set; Cograph; Graph; 1-planar graph; Line graph","score_opus":0.027302086804797048,"score_gpt":0.28550113844060665,"score_spread":0.2581990516358096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046755592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7581134,0.00019074233,0.2378577,0.00024408549,0.000046309797,0.00025712623,0.0000026047628,0.00010314064,0.0031849232],"genre_scores_gemma":[0.92307794,0.00011427442,0.076547824,0.000053849766,0.000008465477,0.000018726294,0.0000010179253,0.000013883824,0.00016401109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870014,0.000049592985,0.00024663654,0.00029005655,0.00038104542,0.0003325005],"domain_scores_gemma":[0.9991524,0.00017275008,0.00006794686,0.00046902703,0.000035572375,0.0001022591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003802289,0.00013950358,0.00019854802,0.00021758836,0.00011213078,0.00007267459,0.0005671504,0.000052697847,0.00000771864],"category_scores_gemma":[0.0001059225,0.00011857766,0.000043686876,0.00046612343,0.00017692699,0.00039950028,0.00036523136,0.00020219629,0.000017195267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056039007,0.00008429693,0.007695422,0.00007450153,0.000012065575,0.00012534276,0.007479724,0.000022859202,0.0007051885,0.98133826,0.000049739643,0.0024070211],"study_design_scores_gemma":[0.000577638,0.000081142214,0.0097584175,0.0000778936,0.0000026446564,0.00022989606,0.0004093919,0.018783033,0.0018386074,0.96775526,0.00017057346,0.00031549658],"about_ca_topic_score_codex":0.000008622242,"about_ca_topic_score_gemma":0.000012948927,"teacher_disagreement_score":0.16496457,"about_ca_system_score_codex":0.00002011254,"about_ca_system_score_gemma":0.000026562913,"threshold_uncertainty_score":0.48354566},"labels":[],"label_agreement":null},{"id":"W2047259180","doi":"10.1016/j.laa.2008.10.006","title":"Primitive digraphs with the largest scrambling index","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Scrambling; Digraph; Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Multipartite; Integer (computer science); Ergodic theory; Order (exchange); Discrete mathematics; Graph; Pure mathematics; Physics","score_opus":0.020602022031945,"score_gpt":0.2681112607611701,"score_spread":0.2475092387292251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047259180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18123956,0.00092568964,0.81250745,0.00336851,0.000007872294,0.0006034585,0.000005722882,0.00012385762,0.0012178902],"genre_scores_gemma":[0.99258494,0.00031842155,0.0062731663,0.0003244696,0.000037804664,0.00018815383,0.0000022010086,0.000008338095,0.00026250008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992833,0.000029178227,0.00007756819,0.00027336387,0.00015612644,0.00018047393],"domain_scores_gemma":[0.9992842,0.00017916651,0.000035298486,0.00032107334,0.00009488673,0.00008535765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011444776,0.00008476645,0.00007487608,0.0000673033,0.0005929679,0.00004503734,0.00033836876,0.000028752174,0.000002194936],"category_scores_gemma":[0.00001390632,0.000054233642,0.000015463627,0.000570879,0.00020623498,0.0002373441,0.00016046302,0.00017208107,0.000013906544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057716593,0.000036746456,0.002318669,0.000006111849,0.00001594727,0.0000023880928,0.0005825296,0.000021572312,0.00044034838,0.99017483,0.000041224543,0.0063538784],"study_design_scores_gemma":[0.003610546,0.0008262456,0.35759887,0.00010167404,0.00007059817,0.0010499171,0.0013361607,0.18178022,0.013724778,0.22384998,0.21392404,0.0021269836],"about_ca_topic_score_codex":0.0000034587497,"about_ca_topic_score_gemma":0.000004433028,"teacher_disagreement_score":0.8113454,"about_ca_system_score_codex":0.0000040618625,"about_ca_system_score_gemma":0.000030881794,"threshold_uncertainty_score":0.45606896},"labels":[],"label_agreement":null},{"id":"W2047444378","doi":"10.1016/j.dam.2006.02.003","title":"Improved bottleneck domination algorithms","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bottleneck; Dominating set; Chordal graph; Mathematics; Combinatorics; Treewidth; Time complexity; Independent set; Maximal independent set; Interval graph; Discrete mathematics; Algorithm; Graph; Pathwidth; 1-planar graph; Computer science; Vertex (graph theory); Line graph","score_opus":0.01158698130081266,"score_gpt":0.2668749870525507,"score_spread":0.25528800575173805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047444378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033183962,0.000036282498,0.9666254,0.00015216201,0.00006673445,0.00041496145,0.000004644524,0.000264667,0.029116742],"genre_scores_gemma":[0.26392198,0.0000060999246,0.7350126,0.000050525246,0.00008847852,0.00013291238,0.000015353718,0.000032176133,0.0007398836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984421,0.000016669801,0.00034474317,0.00037694527,0.00040311224,0.0004163913],"domain_scores_gemma":[0.99871916,0.00017334767,0.00014906102,0.0008094578,0.00007380729,0.00007518273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041927132,0.0001937491,0.00021806009,0.00013388664,0.00014728818,0.0001688459,0.00088572875,0.000074054675,0.000016080796],"category_scores_gemma":[0.000029127401,0.00016875997,0.00007343721,0.0004638056,0.00009300323,0.0002803449,0.00028478628,0.00015548938,0.00010509989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034530851,0.000071510345,0.0000018615807,0.000040186944,0.000007811991,0.0000028109127,0.000207289,0.000063119114,0.03373785,0.9559867,0.0001604817,0.009716938],"study_design_scores_gemma":[0.0004895503,0.000030343557,0.000045296576,0.000011894388,0.0000069268913,0.000008015253,0.00009880266,0.16056594,0.044283397,0.79359895,0.0005845181,0.00027636223],"about_ca_topic_score_codex":0.0000052242153,"about_ca_topic_score_gemma":0.0000029698763,"teacher_disagreement_score":0.26060358,"about_ca_system_score_codex":0.000049849004,"about_ca_system_score_gemma":0.000029321025,"threshold_uncertainty_score":0.6881832},"labels":[],"label_agreement":null},{"id":"W2047516023","doi":"10.1109/csss.2012.30","title":"A Linear-Space Top-Down Algorithm for Tree Inclusion Problem","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Tree (set theory); Matching (statistics); Space (punctuation); Algorithm; Set (abstract data type); Mathematics; Node (physics); Discrete mathematics; Computer science; Physics; Statistics","score_opus":0.02293158598130023,"score_gpt":0.31821254069168653,"score_spread":0.2952809547103863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047516023","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005331728,0.00018351662,0.9890615,0.0016247745,0.00015809761,0.0005307942,0.0000026969685,0.0002222631,0.007683237],"genre_scores_gemma":[0.030931545,0.000009460131,0.96095914,0.00025629142,0.00019470518,0.00010904665,0.000002747808,0.000014903474,0.007522148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849844,0.000063070365,0.00015375043,0.0003005913,0.0003451947,0.0006389252],"domain_scores_gemma":[0.99882627,0.00023968388,0.000043760167,0.0005423903,0.00012787896,0.0002200126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086067757,0.00012955794,0.00013640532,0.00012221436,0.0003668862,0.00004518225,0.0009001292,0.00006160358,0.000032612123],"category_scores_gemma":[0.000054480304,0.0001011966,0.000079393496,0.00047637953,0.000049250724,0.0008878342,0.0020183453,0.00012807795,0.00007882439],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008608646,0.00011723779,0.00015496452,0.000012166842,0.000008593487,0.0000012153195,0.0009302628,0.000013148002,0.0017596668,0.26605767,0.0012569475,0.7296795],"study_design_scores_gemma":[0.0015752653,0.00051379605,0.0002924758,0.000029742232,0.000007423665,0.000035088942,0.00010355887,0.43500286,0.060439404,0.29652992,0.20483845,0.00063199],"about_ca_topic_score_codex":0.000009991084,"about_ca_topic_score_gemma":0.000006038724,"teacher_disagreement_score":0.72904754,"about_ca_system_score_codex":0.00004766845,"about_ca_system_score_gemma":0.000043397435,"threshold_uncertainty_score":0.41266775},"labels":[],"label_agreement":null},{"id":"W2047779705","doi":"10.1016/j.jctb.2003.11.001","title":"A short proof of non-GF(5)-representability of matroids","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; National Security Agency","keywords":"Matroid; Proof of concept; GF(2); Mathematics; Combinatorics; Computer science; Finite field","score_opus":0.012493688221346536,"score_gpt":0.29328536457964816,"score_spread":0.2807916763583016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047779705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78718764,0.00022649899,0.20764025,0.00025276223,0.0027865793,0.00036408452,0.0000052276446,0.000021004826,0.0015159638],"genre_scores_gemma":[0.9910158,0.000020627598,0.00873463,0.000008239121,0.0001622667,0.000004136155,2.8795094e-7,0.000014407339,0.00003961534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971048,0.00039747314,0.0010185927,0.00022188664,0.0009425504,0.00031469905],"domain_scores_gemma":[0.9970224,0.00039787727,0.00060212094,0.0008283874,0.0009823598,0.0001668502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033777463,0.00018515669,0.0006544299,0.0002768355,0.00007576843,0.000035635698,0.001784469,0.00009838671,0.000021225143],"category_scores_gemma":[0.0006410239,0.00015331192,0.00032911444,0.0007271391,0.0006393865,0.0013386561,0.00044273722,0.00038794754,0.0000010304603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017857851,0.00056475913,0.0008574442,0.000089160996,0.000112058595,0.000032381515,0.0010131194,0.0005793467,0.019792618,0.9702274,0.00002153825,0.004924388],"study_design_scores_gemma":[0.0010932048,0.0011578398,0.0006742019,0.00006431865,0.0000120186605,0.0000731597,0.00016093306,0.0000122556785,0.29861015,0.69793123,0.00011584213,0.000094848685],"about_ca_topic_score_codex":0.000003851173,"about_ca_topic_score_gemma":5.8879544e-7,"teacher_disagreement_score":0.27881753,"about_ca_system_score_codex":0.000101980084,"about_ca_system_score_gemma":0.00037798818,"threshold_uncertainty_score":0.6251879},"labels":[],"label_agreement":null},{"id":"W2048023919","doi":"10.2298/yjor130704039h","title":"A note on r-equitable k-colorings of trees","year":2013,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Partition (number theory); Mathematics; Graph; Order (exchange); Discrete mathematics; Economics","score_opus":0.08322712656480684,"score_gpt":0.4109221989972904,"score_spread":0.3276950724324835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048023919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7697638,0.0005621022,0.19693115,0.0103060035,0.00026115135,0.0009997416,0.000006020714,0.000037455717,0.02113252],"genre_scores_gemma":[0.9631916,0.00008898411,0.03474022,0.000038197915,0.00006687112,0.000033186767,3.6919207e-7,0.000012429373,0.0018281423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965585,0.0005016275,0.0005504139,0.00022152833,0.0015680813,0.00059984514],"domain_scores_gemma":[0.9956349,0.00073939766,0.00007963304,0.00063587073,0.0026784637,0.00023172621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034298205,0.00011096569,0.00026237709,0.0011844225,0.00039503287,0.00034166768,0.0018334206,0.00006251295,0.00022435597],"category_scores_gemma":[0.0010924729,0.000084941326,0.00011781655,0.001548456,0.00026165767,0.001779504,0.00042000148,0.00080753554,0.00022013542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011591925,0.00067938253,0.0004857227,0.00003338892,0.00008903447,0.00007305634,0.0018785984,0.028319804,0.2526122,0.67452335,0.004008311,0.037181243],"study_design_scores_gemma":[0.0059054196,0.015589402,0.020393273,0.0008435173,0.000022882276,0.00059313665,0.0022168113,0.1490123,0.5411192,0.24449389,0.018754577,0.0010556044],"about_ca_topic_score_codex":0.000081980455,"about_ca_topic_score_gemma":0.000041902524,"teacher_disagreement_score":0.43002945,"about_ca_system_score_codex":0.0001276022,"about_ca_system_score_gemma":0.0005513444,"threshold_uncertainty_score":0.35083848},"labels":[],"label_agreement":null},{"id":"W2048261494","doi":"10.1016/j.tcs.2008.01.038","title":"Partitioned probe comparability graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Combinatorics; Cograph; Split graph; Mathematics; Discrete mathematics; Pathwidth; Comparability graph; Indifference graph; Chordal graph; Line graph; Graph","score_opus":0.031434286364695405,"score_gpt":0.29781324708134405,"score_spread":0.2663789607166486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048261494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09654353,0.000027281667,0.8990535,0.0007681387,0.00030862374,0.0002906961,0.0000013540857,0.00043206866,0.0025747896],"genre_scores_gemma":[0.79388785,0.000006296356,0.20569701,0.00032785363,0.00004096034,0.000021206297,7.809691e-7,0.000006952424,0.000011113946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601066,0.00028148407,0.00035657175,0.0010944811,0.0012801922,0.000976629],"domain_scores_gemma":[0.9969838,0.00038779445,0.00006739012,0.0016269725,0.00040555585,0.0005284703],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020803649,0.00022554092,0.00027832517,0.00030307437,0.0012348607,0.00021243429,0.0038722013,0.00005101159,0.000065048305],"category_scores_gemma":[0.00016755328,0.00018716401,0.00011196586,0.002852242,0.011545114,0.0013345106,0.0014542394,0.0003396319,0.00032384414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013908399,0.00012836089,0.0006671318,0.000004980165,0.0000029004511,0.000031672495,0.00035043154,0.00014471968,0.00071072544,0.9944105,0.00004892191,0.0034857362],"study_design_scores_gemma":[0.00025777187,0.00021358077,0.006865731,0.000010434172,0.0000013031154,0.0001593761,0.0000027608596,0.15280011,0.0058576902,0.83347183,0.00010633444,0.00025308286],"about_ca_topic_score_codex":0.000001687099,"about_ca_topic_score_gemma":4.2196058e-7,"teacher_disagreement_score":0.6973443,"about_ca_system_score_codex":0.00007600334,"about_ca_system_score_gemma":0.0002207633,"threshold_uncertainty_score":0.9911449},"labels":[],"label_agreement":null},{"id":"W2048457435","doi":"10.1016/j.dam.2007.06.002","title":"Fire containment in grids of dimension three and higher","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Manitoba","keywords":"Conjecture; Mathematics; Combinatorics; Outbreak; Vertex (graph theory); Lattice (music); Square lattice; Integer (computer science); Discrete mathematics; Computer science; Graph","score_opus":0.017490995095231006,"score_gpt":0.28066873052227853,"score_spread":0.26317773542704753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048457435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34594056,0.00016145916,0.6445236,0.00010021342,0.000041800722,0.00044244877,0.0000017243575,0.000047465146,0.008740696],"genre_scores_gemma":[0.8738048,0.000013322086,0.12608373,0.00003092453,0.000007962638,0.000012420241,9.460229e-7,0.000010078447,0.000035826346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887645,0.000008018852,0.00031206865,0.00021919917,0.000313332,0.0002709027],"domain_scores_gemma":[0.9991143,0.00024804354,0.0000962192,0.00044679648,0.000024339108,0.000070356415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006990067,0.00011644906,0.00021369499,0.000089187466,0.000036106616,0.000019195539,0.0003357019,0.0000502944,0.0000076840915],"category_scores_gemma":[0.000014764704,0.00009513105,0.000025028956,0.00027890623,0.000108497494,0.00009529068,0.0003226211,0.000115239854,0.0000059063823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016738102,0.000059616956,0.00021957699,0.00008191539,0.0000074392397,0.0000081397,0.00080222555,0.00001215353,0.011424971,0.9740948,0.000010026011,0.013262372],"study_design_scores_gemma":[0.0008997367,0.0001001089,0.007013892,0.00010177109,0.000006264781,0.0000050717313,0.00037743,0.0073753283,0.024164801,0.95957714,0.00012652893,0.0002519318],"about_ca_topic_score_codex":0.0000033820795,"about_ca_topic_score_gemma":0.000010226168,"teacher_disagreement_score":0.5278642,"about_ca_system_score_codex":0.000028353323,"about_ca_system_score_gemma":0.000010636399,"threshold_uncertainty_score":0.38793316},"labels":[],"label_agreement":null},{"id":"W2048794017","doi":"10.1145/1367064.1367070","title":"Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> <sup>3</sup> ) Time","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar; Decomposition; Planar graph; Mathematics; Graph; Discrete mathematics; Computer science","score_opus":0.017709346758674253,"score_gpt":0.2716123867468868,"score_spread":0.25390303998821256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048794017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08109193,0.000084830004,0.91724956,0.0005011362,0.000086562446,0.000310883,0.000046670073,0.00017534579,0.00045308453],"genre_scores_gemma":[0.66772115,0.00023275611,0.3313138,0.00024422933,0.0000261848,0.00007519386,0.000012084462,0.000036339046,0.00033827676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787205,0.00017362538,0.00041087376,0.0005315916,0.0005430895,0.00046877586],"domain_scores_gemma":[0.9982444,0.00034539637,0.00007647786,0.001088836,0.000097599994,0.0001472828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030742533,0.00022769706,0.00031597418,0.00065509666,0.00023534244,0.000025157844,0.0012968454,0.00011715082,0.00006403303],"category_scores_gemma":[0.000017410683,0.00023778032,0.00017877591,0.0015035735,0.00023887932,0.00071693055,0.000021293987,0.00045912236,0.00014471282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075297133,0.0042737564,0.0004559498,0.00010900059,0.00030559322,0.0005855556,0.0074683107,0.46734884,0.028264977,0.0122855175,0.0008100294,0.4773395],"study_design_scores_gemma":[0.010711894,0.0036786383,0.0048762695,0.00040871513,0.000060822807,0.001655062,0.00029915877,0.6008521,0.24017207,0.13195059,0.0027552994,0.002579401],"about_ca_topic_score_codex":0.00004148658,"about_ca_topic_score_gemma":0.0000036318804,"teacher_disagreement_score":0.5866292,"about_ca_system_score_codex":0.000060562747,"about_ca_system_score_gemma":0.000074564814,"threshold_uncertainty_score":0.96963996},"labels":[],"label_agreement":null},{"id":"W2048827438","doi":"10.1016/j.dam.2007.05.054","title":"Skew partitions in perfect graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Skew; Mathematics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.02124849550104199,"score_gpt":0.3031963948444367,"score_spread":0.28194789934339476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048827438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049175154,0.00004115046,0.8939442,0.000102299324,0.000045738372,0.00038014865,0.0000023317366,0.0001742088,0.056134738],"genre_scores_gemma":[0.6867212,0.000013536982,0.31297642,0.000078031124,0.00001542559,0.000060590068,0.0000036560293,0.000018806566,0.000112317946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838287,0.0000142428635,0.00036167778,0.00032246485,0.00036673815,0.00055198267],"domain_scores_gemma":[0.9986696,0.00032310237,0.00007856425,0.00076398964,0.000033322667,0.00013139282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010986514,0.00016087046,0.00020904519,0.0002965538,0.00010991047,0.0000767521,0.0007867099,0.000063030224,0.00003498692],"category_scores_gemma":[0.00004813626,0.00014394552,0.000071768765,0.0010382258,0.000115814946,0.00019826557,0.00023926444,0.00024301518,0.00014958002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004514911,0.00008256336,0.00007384269,0.0000380455,0.000006521172,0.000015558297,0.0009475226,0.000037047612,0.0026536519,0.9911801,0.000036836984,0.004923803],"study_design_scores_gemma":[0.00030023156,0.000027663156,0.00064187904,0.000027470845,0.0000034992913,0.000009524791,0.00022971151,0.0023185674,0.006608939,0.98906744,0.0005497932,0.00021530774],"about_ca_topic_score_codex":0.0000023257069,"about_ca_topic_score_gemma":0.000023419965,"teacher_disagreement_score":0.63754606,"about_ca_system_score_codex":0.00004064177,"about_ca_system_score_gemma":0.000026101648,"threshold_uncertainty_score":0.5869928},"labels":[],"label_agreement":null},{"id":"W2048900104","doi":"10.46298/dmtcs.3401","title":"An upper bound for the chromatic number of line graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Multigraph; Mathematics; Line graph; Discrete mathematics; Graph; Bounded function; Upper and lower bounds; Chromatic polynomial; Chromatic scale; Clique number; Perfect graph; Friendship graph; Bound graph; Critical graph; Graph power","score_opus":0.018968031415611628,"score_gpt":0.33203150706922924,"score_spread":0.3130634756536176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048900104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040256154,0.00004687562,0.9565977,0.0012459577,0.00017602443,0.00066434435,0.000008355222,0.0001248378,0.0008797751],"genre_scores_gemma":[0.5466151,0.00000512058,0.45308658,0.00016408517,0.00006632247,0.000036461497,8.799791e-7,0.000014581494,0.000010835888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649924,0.00011922147,0.000630231,0.00071600114,0.0011998438,0.0008354533],"domain_scores_gemma":[0.9951264,0.0017514658,0.00020224316,0.0021726657,0.0004424487,0.00030475037],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0034071833,0.00029013873,0.00038880223,0.00019021696,0.00069696933,0.00055020396,0.00553726,0.000065397064,0.00008151851],"category_scores_gemma":[0.00027737246,0.00018101052,0.00021012759,0.0014228576,0.005055673,0.0011597616,0.0008750183,0.00023837296,0.00004790722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009021808,0.00016589045,0.000022419277,0.000051648367,0.000014913167,9.3420704e-7,0.0015747925,0.00040560326,0.0010233464,0.9847762,0.000017648905,0.011937585],"study_design_scores_gemma":[0.00016047657,0.0001156637,0.000034147164,0.00003218006,0.0000093043445,0.000024162358,0.000037993585,0.51099205,0.0029162602,0.48549747,0.000040954794,0.00013929392],"about_ca_topic_score_codex":0.0000010233942,"about_ca_topic_score_gemma":8.967056e-7,"teacher_disagreement_score":0.5105865,"about_ca_system_score_codex":0.0000402164,"about_ca_system_score_gemma":0.00013070233,"threshold_uncertainty_score":0.99984324},"labels":[],"label_agreement":null},{"id":"W2048988825","doi":"10.1016/j.dam.2006.02.009","title":"Digraph matrix partitions and trigraph homomorphisms","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University; Simon Fraser University","funders":"","keywords":"Digraph; Homomorphism; Mathematics; Combinatorics; Partition (number theory); Graph homomorphism; Directed graph; Matrix (chemical analysis); Discrete mathematics; Undirected graph; Graph; Algebra over a field; Line graph; Voltage graph; Pure mathematics","score_opus":0.012057152574411534,"score_gpt":0.26709409134703294,"score_spread":0.2550369387726214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048988825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033559095,0.00028618696,0.9362702,0.00031142187,0.000046576493,0.00054080517,0.000022796725,0.0003879456,0.028575001],"genre_scores_gemma":[0.71040916,0.00004525875,0.28891018,0.00004574325,0.000040665505,0.00015671858,0.0000143560255,0.00002768999,0.00035021946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983956,0.000021081734,0.00035537014,0.0003972618,0.0003805646,0.00045007755],"domain_scores_gemma":[0.99870116,0.00023194827,0.00012156944,0.00077326247,0.000045951143,0.00012609699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030958492,0.00021661268,0.00026371883,0.00023041725,0.0002616828,0.00021588756,0.0006132236,0.00007032121,0.000018524192],"category_scores_gemma":[0.000017135639,0.00018769802,0.00008666998,0.0007305489,0.00026609542,0.00025408829,0.00024925073,0.00017412128,0.00006650112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033126503,0.00007498908,0.000029812049,0.000045112716,0.000012190616,0.000007282207,0.00016846924,0.000046525805,0.003170856,0.99535716,0.00038136015,0.00070293195],"study_design_scores_gemma":[0.0003762257,0.00002769335,0.00030803386,0.000016468826,0.000013559074,0.000023459652,0.00011557447,0.0034641789,0.0026754339,0.9917607,0.0009634703,0.00025524234],"about_ca_topic_score_codex":0.00000513574,"about_ca_topic_score_gemma":0.0000055146775,"teacher_disagreement_score":0.6768501,"about_ca_system_score_codex":0.000014379684,"about_ca_system_score_gemma":0.000020320116,"threshold_uncertainty_score":0.7654103},"labels":[],"label_agreement":null},{"id":"W2049572715","doi":"10.1137/13090465x","title":"On List Coloring and List Homomorphism of Permutation and Interval Graphs","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Permutation graph; Discrete mathematics; Indifference graph; Chordal graph; Bipartite graph; Graph coloring; Interval graph; Pathwidth; 1-planar graph; Homomorphism; Cograph; Maximal independent set; Interval (graph theory); Edge coloring; Time complexity; Graph; Line graph; Graph power","score_opus":0.018303993312181067,"score_gpt":0.2873615626007403,"score_spread":0.26905756928855923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049572715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7363089,0.00007712669,0.260672,0.00045272388,0.00011824725,0.00013248426,0.0000032555402,0.000026737625,0.0022085442],"genre_scores_gemma":[0.97651404,0.00006828862,0.02322227,0.00006492776,0.000025544075,0.0000032436958,4.843771e-7,0.000014309187,0.000086902415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987071,0.00012827375,0.00034755148,0.00019101804,0.00041459728,0.00021141993],"domain_scores_gemma":[0.9985978,0.000598682,0.0002663785,0.00028318758,0.000097604825,0.00015631909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009647379,0.00014600743,0.00025531297,0.00024848137,0.00018342766,0.0002076899,0.00037115475,0.00004253591,0.000008979866],"category_scores_gemma":[0.00038002594,0.00011257099,0.00006410423,0.00019990058,0.00019751742,0.00030075497,0.00014994633,0.000324882,0.0000033227657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034028344,0.00006917773,0.00014950009,0.00012071793,0.000024973748,0.000014366432,0.0020184396,0.00007995841,0.0013647198,0.9897522,0.00004488621,0.006327032],"study_design_scores_gemma":[0.0006788462,0.0012351298,0.0006487974,0.0005184265,0.000013293022,0.00029470742,0.0003010822,0.059524007,0.0022821946,0.93418854,0.00011900602,0.00019597725],"about_ca_topic_score_codex":0.0000010783002,"about_ca_topic_score_gemma":0.0000018593988,"teacher_disagreement_score":0.24020515,"about_ca_system_score_codex":0.000023867327,"about_ca_system_score_gemma":0.000014794501,"threshold_uncertainty_score":0.4590512},"labels":[],"label_agreement":null},{"id":"W2049916150","doi":"10.1016/j.disc.2010.01.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si37.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>G</mml:mi></mml:math>-parking functions, acyclic orientations and spanning trees","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Bijection; Mathematics; Graph; Combinatorics; Vertex (graph theory); Discrete mathematics; Function (biology)","score_opus":0.020716285225112926,"score_gpt":0.2785681418201496,"score_spread":0.2578518565950367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049916150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87727726,0.00011569959,0.11964002,0.00025216537,0.00052718667,0.00009765485,0.000037946476,0.00020807504,0.001843979],"genre_scores_gemma":[0.92087525,0.00006904668,0.078069694,0.00015117424,0.0002486583,0.00017799911,0.00006167006,0.000093214934,0.0002533194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972057,0.00007187377,0.000601029,0.00064302806,0.0007846378,0.00069374754],"domain_scores_gemma":[0.9971772,0.0008023817,0.00041606388,0.0012353031,0.0000888005,0.0002802786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080835045,0.0003310955,0.00024154776,0.00020093529,0.00089210895,0.0006565367,0.00091796473,0.00024818565,0.000029654975],"category_scores_gemma":[0.00065547565,0.0003531544,0.00024369874,0.0005704341,0.00041732896,0.00100806,0.00083888974,0.00067793037,0.0003243886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026750517,0.00008873064,0.00006151183,0.00016159481,0.00009315627,0.00004619311,0.0026993223,0.0002755742,0.0031084802,0.9913658,0.00011596284,0.00195693],"study_design_scores_gemma":[0.00044881905,0.00016133134,0.0001800565,0.00020774653,0.00008590907,0.00018605252,0.0013815896,0.9710275,0.0029981,0.02152567,0.0014199094,0.00037730052],"about_ca_topic_score_codex":0.000029730361,"about_ca_topic_score_gemma":0.000098349155,"teacher_disagreement_score":0.97075194,"about_ca_system_score_codex":0.000013041261,"about_ca_system_score_gemma":0.00014595408,"threshold_uncertainty_score":0.99989206},"labels":[],"label_agreement":null},{"id":"W2050352628","doi":"10.1145/1806689.1806785","title":"Odd cycle packing","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Packing problems; Digraph; Disjoint sets; Mathematics; Feedback arc set; Vertex (graph theory); Directed graph; Upper and lower bounds; Graph; Integer (computer science); Discrete mathematics; Computer science; Line graph","score_opus":0.014804844332414633,"score_gpt":0.30164827369806535,"score_spread":0.2868434293656507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050352628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104194336,0.000007984554,0.81235236,0.00076972076,0.00031038557,0.00006235476,1.8402477e-7,0.00028184344,0.08202083],"genre_scores_gemma":[0.8880684,0.0000010192539,0.11052211,0.00017509695,0.00003713724,0.0000037671625,1.185426e-7,0.0000040765417,0.0011883153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934083,0.000018482897,0.00006092811,0.00018915493,0.00016819676,0.00022241309],"domain_scores_gemma":[0.99924594,0.000083996296,0.000012787629,0.00053764594,0.000040166247,0.000079470614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024854796,0.00004777208,0.000046001845,0.000062195206,0.00008300944,0.00008354472,0.00077481405,0.000025730418,0.00015890764],"category_scores_gemma":[0.000060497452,0.000038943064,0.00002557372,0.0002640724,0.000048344442,0.00039723757,0.0002586812,0.00020270527,0.00032044834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.5975166e-7,0.000009909703,0.00045900565,8.512228e-7,0.000001369452,0.0000050850826,0.000056025292,0.000006033489,0.026401388,0.91810757,0.00013578807,0.054816328],"study_design_scores_gemma":[0.00021478697,0.000035868346,0.0033672247,0.0000027420213,5.347911e-7,0.000028288554,0.000019557789,0.035243776,0.050998054,0.8898878,0.019999176,0.00020219799],"about_ca_topic_score_codex":0.000005464483,"about_ca_topic_score_gemma":0.000021150989,"teacher_disagreement_score":0.78387403,"about_ca_system_score_codex":0.0000039247825,"about_ca_system_score_gemma":0.000017733519,"threshold_uncertainty_score":0.4118822},"labels":[],"label_agreement":null},{"id":"W2050872937","doi":"10.1007/s00453-013-9745-8","title":"Practical and Efficient Circle Graph Recognition","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Circle graph; Lexicographical order; Combinatorics; Mathematics; Algorithm; Theory of computation; Computer science; Graph; Pathwidth; Discrete mathematics; Inverse; Line graph","score_opus":0.02781378277119005,"score_gpt":0.2996522708988027,"score_spread":0.27183848812761263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050872937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052860864,0.000059205704,0.94094735,0.0039696842,0.00014019581,0.00032237667,0.000002076971,0.00016345042,0.0015348224],"genre_scores_gemma":[0.5495178,0.000024001376,0.44981787,0.00033112057,0.0000651441,0.00009180858,0.0000032056291,0.000013670034,0.0001353819],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988842,0.000093483424,0.00012285067,0.0003504238,0.0002436865,0.0003053777],"domain_scores_gemma":[0.99909216,0.00025222247,0.00003594613,0.00033782312,0.00012347134,0.00015838514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023172992,0.00008295905,0.000090935566,0.000119484444,0.00012291876,0.00016360605,0.00024548123,0.000044826964,0.000053309195],"category_scores_gemma":[0.00012134592,0.00008142792,0.00003039565,0.00036778135,0.00012248954,0.00050531793,0.00021941909,0.00017389217,0.00055291393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040696436,0.000111753616,0.000028095503,0.000008719798,0.000014955469,0.000020854106,0.00018070506,0.000007779839,0.001769025,0.02921938,0.0010347633,0.96759987],"study_design_scores_gemma":[0.0008420591,0.00030729247,0.0064366097,0.00003078645,0.00000923815,0.00024549893,0.0001470575,0.17784262,0.013737019,0.7983711,0.0015018973,0.0005288343],"about_ca_topic_score_codex":0.00003712891,"about_ca_topic_score_gemma":0.0000010245506,"teacher_disagreement_score":0.96707106,"about_ca_system_score_codex":0.000015116835,"about_ca_system_score_gemma":0.00003120014,"threshold_uncertainty_score":0.71067744},"labels":[],"label_agreement":null},{"id":"W2051028069","doi":"10.1016/j.jcss.2004.07.003","title":"A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computational complexity theory; Bipartite graph; Compaction; Mathematics; Equivalence (formal languages); Combinatorics; Computational problem; Constraint satisfaction problem; Computer science; Chordal graph; Time complexity; Discrete mathematics; Theoretical computer science; Graph; Algorithm; Artificial intelligence","score_opus":0.10570888928428386,"score_gpt":0.33144506100960225,"score_spread":0.2257361717253184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051028069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.775033,0.00025120267,0.2231852,0.0012220033,0.00010370411,0.00013506968,0.000008294531,0.000012559892,0.000048948226],"genre_scores_gemma":[0.8928648,0.000026180882,0.10692258,0.00009224815,0.00008409028,0.0000010555601,0.0000010178319,0.0000031699608,0.000004821659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981015,0.00022314287,0.0005130666,0.00032599954,0.0006400605,0.00019623047],"domain_scores_gemma":[0.9985511,0.00036652165,0.0004684699,0.00011664564,0.00027794755,0.00021931874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014931269,0.00013257824,0.0003050244,0.00037493967,0.0003440039,0.00026211143,0.00025438066,0.00003876269,3.3535116e-7],"category_scores_gemma":[0.000016180387,0.0000962238,0.000023776614,0.00036026497,0.00047798862,0.0013718554,0.00015477244,0.00013185084,3.8138376e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026262128,0.00032353576,0.03992294,0.0006670783,0.00033544292,0.000056383153,0.011196056,0.053698674,0.02571524,0.7577057,0.0010598196,0.10669291],"study_design_scores_gemma":[0.0013344075,0.0015101137,0.20818812,0.00018685567,0.000016222044,0.0015750618,0.00026597158,0.78077304,0.0001121748,0.005583851,0.00027826024,0.0001759375],"about_ca_topic_score_codex":0.000019761768,"about_ca_topic_score_gemma":0.000029138535,"teacher_disagreement_score":0.75212187,"about_ca_system_score_codex":0.000051925952,"about_ca_system_score_gemma":0.00005248578,"threshold_uncertainty_score":0.39238924},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2051748292","doi":"10.1006/jcta.2001.3225","title":"The Largest Small Octagon","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Quadratic growth; Conjecture; Combinatorics; Unit (ring theory); Mathematics; Quadratic equation; Computer science; Geometry; Algorithm; Mathematics education","score_opus":0.019666642754590416,"score_gpt":0.2502709973929753,"score_spread":0.2306043546383849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051748292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31766948,0.034487627,0.40130517,0.035990763,0.11155969,0.0020292809,0.000014717656,0.0007675052,0.096175775],"genre_scores_gemma":[0.9895349,0.0011448851,0.004368327,0.00017603657,0.0011502359,0.0000076012293,1.5563852e-7,0.000031301577,0.0035865265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777526,0.0006426805,0.0004713012,0.00015327723,0.00054397574,0.00041350225],"domain_scores_gemma":[0.99724364,0.0011487836,0.00038714998,0.000604686,0.00044287188,0.00017286827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029412431,0.00015499684,0.00024766874,0.00012049113,0.000491989,0.00032807435,0.0022420143,0.00006904528,0.00005649367],"category_scores_gemma":[0.0008250789,0.00009893837,0.0001880873,0.0004946723,0.00028056017,0.0009445967,0.0003013567,0.0005328196,0.000031399442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022253099,0.00007622682,0.00003530147,0.0000035232033,0.000041539017,0.000063538944,0.00033434678,0.000010601211,0.00032995277,0.98719656,0.0008543645,0.010831483],"study_design_scores_gemma":[0.0007348077,0.0006423914,0.00004345347,0.000017723542,0.0000062814115,0.00023600429,0.00011914124,0.000095990654,0.0032579831,0.869141,0.12558722,0.00011805067],"about_ca_topic_score_codex":4.994575e-7,"about_ca_topic_score_gemma":7.5616657e-7,"teacher_disagreement_score":0.67186546,"about_ca_system_score_codex":0.000056587716,"about_ca_system_score_gemma":0.000053267904,"threshold_uncertainty_score":0.41662574},"labels":[],"label_agreement":null},{"id":"W2052065965","doi":"10.4171/owr/2007/40","title":"Mini-Workshop: Topology of closed one-forms and Cohomology Jumping Loci","year":2008,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cohomology; Jumping; Topology (electrical circuits); Mathematics; Computer science; Pure mathematics; Biology; Combinatorics; Paleontology","score_opus":0.04119857093019811,"score_gpt":0.2976651709787299,"score_spread":0.2564666000485318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052065965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9238881,0.0008536595,0.06865013,0.0004965468,0.00024450273,0.00028978623,0.0000011788634,0.00011429943,0.0054618176],"genre_scores_gemma":[0.9806709,0.00015444023,0.017854108,0.000117670395,0.00003361352,0.0000196435,0.0000046563755,0.0000149490015,0.0011299864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977397,0.00012641845,0.0006003165,0.0006445346,0.00036635308,0.00052273314],"domain_scores_gemma":[0.9980534,0.00026370698,0.00034036336,0.0010160115,0.00015999927,0.00016655007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007135915,0.00017602218,0.00042164954,0.0002347626,0.0001847362,0.000015292637,0.000414987,0.00016689293,0.000039295555],"category_scores_gemma":[0.0003170774,0.00016501022,0.000084776715,0.00045747138,0.0007084264,0.00035245452,0.00049520185,0.00027859287,0.0000070263663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021748108,0.0010161573,0.32005128,0.00032128897,0.00045816452,0.020324519,0.0071783313,0.000363919,0.033334915,0.42828256,0.0027969687,0.1856544],"study_design_scores_gemma":[0.0022952924,0.0012606283,0.301995,0.00013927717,0.000052800744,0.047658134,0.00036729462,0.0031127797,0.080527514,0.54245704,0.01838168,0.0017525618],"about_ca_topic_score_codex":0.00004283416,"about_ca_topic_score_gemma":0.000021121064,"teacher_disagreement_score":0.18390183,"about_ca_system_score_codex":0.000035500536,"about_ca_system_score_gemma":0.00012562069,"threshold_uncertainty_score":0.67289215},"labels":[],"label_agreement":null},{"id":"W2052404722","doi":"10.7151/dmgt.1808","title":"Bipartition polynomials, the Ising model and domination in graphs","year":2015,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"European Social Fund; Austrian Science Fund; Vienna Science and Technology Fund","keywords":"Mathematics; Combinatorics; Ising model; Discrete mathematics; Statistical physics; Physics","score_opus":0.039834455206508294,"score_gpt":0.3003661581116008,"score_spread":0.2605317029050925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052404722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21809573,0.0005822123,0.77410614,0.0036775125,0.00013453906,0.00063459185,0.000003900749,0.00016724705,0.0025980962],"genre_scores_gemma":[0.9844005,0.000042143103,0.015038941,0.00016732067,0.000014108678,0.00010228367,0.0000022830714,0.000019619927,0.00021281253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978646,0.0005490524,0.00036573,0.00039714834,0.00045269958,0.00037077733],"domain_scores_gemma":[0.9984025,0.0004963063,0.00012612359,0.00073129276,0.00008208575,0.00016170114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003617252,0.00019592799,0.00023503498,0.00045449237,0.00022654438,0.00016307116,0.00072544924,0.00007057266,0.0000052432765],"category_scores_gemma":[0.0004383211,0.00010693284,0.00007939821,0.0009169223,0.0003512816,0.00086575485,0.00035502165,0.00021528624,0.000019571477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040113762,0.00008398979,0.00007033917,0.00002248611,0.000007795943,0.0000034383434,0.0049844906,0.0004651872,0.0007237246,0.98577917,0.00009232012,0.007726958],"study_design_scores_gemma":[0.00042454546,0.000028236245,0.00029332592,0.00007742968,0.0000064522974,0.000016614611,0.0012656773,0.06493809,0.00046297567,0.93230724,0.000020408675,0.00015899671],"about_ca_topic_score_codex":0.0000023271634,"about_ca_topic_score_gemma":0.0000060503494,"teacher_disagreement_score":0.76630473,"about_ca_system_score_codex":0.00003327041,"about_ca_system_score_gemma":0.00005359441,"threshold_uncertainty_score":0.43605947},"labels":[],"label_agreement":null},{"id":"W2052776056","doi":"10.1016/j.dam.2011.04.016","title":"Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Homomorphism; Combinatorics; Mathematics; Digraph; Discrete mathematics; Interval (graph theory); Interval graph; Characterization (materials science); Conjecture; Time complexity; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.053733698770790504,"score_gpt":0.2908855560509496,"score_spread":0.2371518572801591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052776056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08408007,0.00025794344,0.8464703,0.000117176365,0.00020726245,0.00094299595,0.000028787616,0.00055985077,0.06733564],"genre_scores_gemma":[0.72764444,0.000058207457,0.2718036,0.00012309343,0.000021138401,0.00010575459,0.000009149975,0.000044838882,0.00018982282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997669,0.000055024575,0.00054325757,0.00065967574,0.00045998086,0.0006130788],"domain_scores_gemma":[0.9979912,0.00018850945,0.0002372013,0.0012015117,0.000098815166,0.00028278062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005558279,0.00037794758,0.00048047185,0.00032050157,0.00019765946,0.00017022231,0.001512089,0.00012414159,0.0000697675],"category_scores_gemma":[0.00005558256,0.00032066467,0.00014967758,0.00069669116,0.00056003506,0.00043733983,0.0010398959,0.0003957909,0.00007117323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004183183,0.00012662381,0.000055191053,0.000119941185,0.00006855404,0.000027467617,0.0057002762,6.076115e-7,0.0016401435,0.9855584,0.00013097753,0.006529971],"study_design_scores_gemma":[0.00062883005,0.00021757018,0.00039039348,0.000107737666,0.000034091034,0.000062913394,0.0013435592,0.0033153254,0.00912807,0.9839869,0.00026310302,0.00052146474],"about_ca_topic_score_codex":0.000011886071,"about_ca_topic_score_gemma":0.000013719144,"teacher_disagreement_score":0.64356434,"about_ca_system_score_codex":0.000029746743,"about_ca_system_score_gemma":0.000027033864,"threshold_uncertainty_score":0.99992454},"labels":[],"label_agreement":null},{"id":"W2052851790","doi":"10.1016/j.disc.2006.11.026","title":"On realizations of point determining graphs, and obstructions to full homomorphisms","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph homomorphism; Vertex (graph theory); Graph; Homomorphism; Discrete mathematics; Induced subgraph; Wheel graph; Graph power; Line graph","score_opus":0.022561029521324626,"score_gpt":0.30560892087986674,"score_spread":0.28304789135854214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052851790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1602353,0.00001286971,0.8364502,0.00010503739,0.00005539195,0.00018667009,0.0000087973685,0.00006616045,0.0028795523],"genre_scores_gemma":[0.5971909,0.0000063330917,0.40264812,0.000048638096,0.000005901031,0.000009370225,0.0000019630284,0.000013272869,0.00007551684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989053,0.000025239651,0.00031489917,0.00022091182,0.00028110843,0.00025256304],"domain_scores_gemma":[0.9986584,0.0004168752,0.00010442081,0.0005717285,0.00009431898,0.00015421983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050244486,0.000112685855,0.00016654316,0.00032393794,0.00013512805,0.0000459802,0.00039215002,0.000037937814,0.0000069392217],"category_scores_gemma":[0.00029943127,0.000100182595,0.000045813234,0.000674565,0.000111374226,0.00016165448,0.0001981486,0.00009555124,0.000008377572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004874837,0.000029396153,0.000040712053,0.000030937714,0.0000083806035,0.0000057157226,0.0018454485,0.00012677752,0.0017097591,0.9923541,0.000024526107,0.003819379],"study_design_scores_gemma":[0.00016864743,0.00023591606,0.00043447493,0.00010309258,0.0000071270624,0.000051478488,0.0005857467,0.008977677,0.0054914816,0.98372287,0.00005727088,0.00016424939],"about_ca_topic_score_codex":0.0000018611817,"about_ca_topic_score_gemma":0.000008989069,"teacher_disagreement_score":0.4369556,"about_ca_system_score_codex":0.00001755661,"about_ca_system_score_gemma":0.0000142577055,"threshold_uncertainty_score":0.40853277},"labels":[],"label_agreement":null},{"id":"W2053148324","doi":"10.1007/s102550200048","title":"On the Monotonicity of (k;g,h)-graphs","year":2002,"lang":"en","type":"article","venue":"Acta Mathematicae Applicatae Sinica English Series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Monotonic function; Combinatorics; Mathematics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.026956837628792533,"score_gpt":0.26021423666772836,"score_spread":0.23325739903893583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053148324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57467693,0.0008013293,0.14582492,0.020949276,0.0005508827,0.006171312,0.00012594783,0.002577331,0.24832205],"genre_scores_gemma":[0.98360246,0.00012428657,0.015405342,0.0002408803,0.000030097452,0.0002969966,0.0000013897347,0.000029112613,0.00026940892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976662,0.00015694552,0.00052944076,0.0005493702,0.0006149154,0.00048315615],"domain_scores_gemma":[0.9938087,0.0026287157,0.00024998546,0.0029623618,0.00022105344,0.00012919144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008534969,0.0002680212,0.00041096576,0.0001216336,0.00023055867,0.00013051754,0.00319167,0.00009546259,0.00023568093],"category_scores_gemma":[0.0012969386,0.0001809798,0.0001835624,0.0009815859,0.00066701917,0.00070162606,0.00065668585,0.00038982256,0.00013034594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014621209,0.00024542326,0.000005803794,0.000043468717,0.000036087094,0.000001786211,0.0023209497,0.0000038026565,0.0009326458,0.9919795,0.002314043,0.002101907],"study_design_scores_gemma":[0.00030186836,0.00026339845,0.00005206911,0.00006470114,0.000013330417,0.000011855649,0.0004110494,0.002129345,0.020788908,0.9574392,0.01818838,0.00033588771],"about_ca_topic_score_codex":0.0000014657535,"about_ca_topic_score_gemma":0.0000013955972,"teacher_disagreement_score":0.40892553,"about_ca_system_score_codex":0.000020989854,"about_ca_system_score_gemma":0.000018037528,"threshold_uncertainty_score":0.73801416},"labels":[],"label_agreement":null},{"id":"W2053642853","doi":"10.1137/130929229","title":"Homological Face-Width Condition Forcing $K_6$-Minors in Graphs on Surfaces","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Mathematics; Combinatorics; Projective plane; Face (sociological concept); Graph; Minor (academic); Discrete mathematics; Surface (topology); Plane (geometry); Geometry","score_opus":0.0269461334175931,"score_gpt":0.3094823273796334,"score_spread":0.28253619396204027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053642853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60089934,0.000054013803,0.3916607,0.00074004394,0.00023470884,0.00027464653,0.000003954384,0.00009188792,0.006040683],"genre_scores_gemma":[0.97205615,0.00004716553,0.02741978,0.00021168549,0.000038755923,0.000010364729,0.0000018911041,0.000022074773,0.00019211092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724555,0.00045295022,0.0005643307,0.00034839107,0.0008049104,0.0005838494],"domain_scores_gemma":[0.9976609,0.0011646132,0.0003167126,0.00055664027,0.00007661004,0.00022452649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021195265,0.0002649469,0.0003846565,0.00046674145,0.0002612203,0.00029302906,0.0011045168,0.00010928829,0.00004084373],"category_scores_gemma":[0.0006758099,0.00019031142,0.00016586528,0.00055206224,0.00014942151,0.00047008277,0.00016225548,0.0008156512,0.000110304136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046176225,0.00020924745,0.00037967632,0.000044387663,0.000024614574,0.000096308475,0.0012048933,0.005767493,0.00054939894,0.98639905,0.00013973074,0.0051390207],"study_design_scores_gemma":[0.0006807174,0.0009312341,0.0012811226,0.00029090306,0.0000054699103,0.00015819639,0.00033347413,0.044119865,0.0019522004,0.9497832,0.0001678359,0.00029579495],"about_ca_topic_score_codex":9.319432e-7,"about_ca_topic_score_gemma":0.0000034405002,"teacher_disagreement_score":0.3711568,"about_ca_system_score_codex":0.00009348913,"about_ca_system_score_gemma":0.000031920434,"threshold_uncertainty_score":0.77606744},"labels":[],"label_agreement":null},{"id":"W2054709282","doi":"10.1016/j.disc.2011.06.011","title":"Finite Sholander trees, trees, and their betweenness","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Canada Research Chairs","keywords":"Betweenness centrality; Mathematics; Tree (set theory); Intersection (aeronautics); Characterization (materials science); Combinatorics; Discrete mathematics; Order (exchange)","score_opus":0.056277129533041564,"score_gpt":0.2814007296774125,"score_spread":0.2251236001443709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054709282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043291904,0.00021289823,0.94566983,0.00009053738,0.000058921592,0.00021803695,0.000015045208,0.00017301872,0.010269819],"genre_scores_gemma":[0.9191691,0.000037790196,0.08007968,0.000055122335,0.000028572416,0.000023949518,0.000004811077,0.000027010057,0.0005739148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987318,0.00006795576,0.00026105985,0.00034263812,0.00021032497,0.00038622072],"domain_scores_gemma":[0.99851495,0.00034283297,0.000091121816,0.0008364393,0.000056569494,0.00015805828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042134512,0.00021492275,0.00026514658,0.00013021831,0.00013995811,0.000107819535,0.0008777182,0.000066899374,0.000040047842],"category_scores_gemma":[0.00009640303,0.00014955814,0.00007006522,0.00033230058,0.00016792657,0.00043261796,0.00045610685,0.00017618065,0.00003725229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018770264,0.00022243765,0.0036418973,0.00013828631,0.00010963127,0.000044948756,0.030746173,0.00001903242,0.00037508213,0.93940073,0.00015180664,0.025131207],"study_design_scores_gemma":[0.00054375816,0.00019650879,0.003841909,0.000086243395,0.000013951545,0.000044922523,0.001144124,0.054373663,0.0031708789,0.93552506,0.0005605235,0.0004984769],"about_ca_topic_score_codex":0.0000043218834,"about_ca_topic_score_gemma":0.000016230473,"teacher_disagreement_score":0.87587726,"about_ca_system_score_codex":0.000012243894,"about_ca_system_score_gemma":0.000020961497,"threshold_uncertainty_score":0.6098804},"labels":[],"label_agreement":null},{"id":"W2054737785","doi":"10.2991/iccnce.2013.31","title":"On the Decomposition of Posets into Minimum Set Node-Disjoint Chains","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Disjoint sets; Node (physics); Decomposition; Set (abstract data type); Computer science; Combinatorics; Theoretical computer science; Mathematics; Engineering; Programming language; Chemistry","score_opus":0.02070350863579198,"score_gpt":0.3068935041415692,"score_spread":0.28618999550577723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054737785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46377695,0.000018022338,0.5156831,0.009696886,0.000090220106,0.00042550534,0.0000018874597,0.000092160546,0.010215276],"genre_scores_gemma":[0.983197,0.000003293939,0.01545893,0.00082386925,0.000011883401,0.000035856447,0.0000017253329,0.0000063563566,0.00046108957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989186,0.00013658314,0.0001680371,0.00023561405,0.00031298175,0.00022819689],"domain_scores_gemma":[0.9986076,0.00043038395,0.000054525844,0.00071260636,0.00012273512,0.000072195166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032922067,0.00009480429,0.00010282916,0.00010879215,0.00011014011,0.00006233422,0.0008909788,0.000032129035,0.000219167],"category_scores_gemma":[0.00006302064,0.000057388348,0.000058070404,0.00031837862,0.000106360334,0.00030123434,0.0002847709,0.00012313145,0.00037212716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009086684,0.00006854622,0.00005796468,0.000008094964,0.000011127804,0.0000016937142,0.00074751175,0.00012124216,0.029829297,0.95858216,0.0032105895,0.007352697],"study_design_scores_gemma":[0.0002866387,0.0003396546,0.0024950255,0.000033819502,0.0000016968122,0.000007662128,0.0001902173,0.14390987,0.09281087,0.7595833,0.00015079907,0.00019047291],"about_ca_topic_score_codex":0.00006308338,"about_ca_topic_score_gemma":0.000010309106,"teacher_disagreement_score":0.51942,"about_ca_system_score_codex":0.000027612772,"about_ca_system_score_gemma":0.000022457329,"threshold_uncertainty_score":0.4783066},"labels":[],"label_agreement":null},{"id":"W2054772581","doi":"10.1016/s0166-218x(99)00183-3","title":"The even adjacency split problem for graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Saskatchewan","funders":"","keywords":"Mathematics; Adjacency list; Combinatorics; Discrete mathematics","score_opus":0.016811688592944133,"score_gpt":0.2797410441744027,"score_spread":0.2629293555814586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054772581","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003912069,0.00018782108,0.9139444,0.0011328724,0.0000612015,0.0023765494,0.000016364456,0.00034606125,0.07802266],"genre_scores_gemma":[0.06500637,0.00019107551,0.92827606,0.00016254705,0.000060491646,0.0014432326,0.000010142146,0.000068955065,0.004781127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981767,0.00002251176,0.00037628555,0.0003869344,0.00042022878,0.00061736675],"domain_scores_gemma":[0.99792147,0.00062767934,0.00010564179,0.0011617717,0.00006488209,0.000118574746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007475816,0.00020944953,0.0002143319,0.00005654266,0.00053329545,0.00023383254,0.0017617573,0.00006146239,0.000040289902],"category_scores_gemma":[0.0000342241,0.0001378212,0.00013118629,0.00046606094,0.00016904404,0.0001878125,0.0001747033,0.00017089558,0.00016375612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015820564,0.00003704974,0.0000011406142,0.000059975227,0.000020517215,9.1280845e-7,0.00069995667,0.000044547414,0.0005064799,0.9381451,0.000503208,0.059965268],"study_design_scores_gemma":[0.00030588376,0.000046835765,0.00001027403,0.000018365887,0.000007838306,0.000006437487,0.00013071181,0.008010269,0.0011290862,0.9780347,0.012101733,0.00019787415],"about_ca_topic_score_codex":7.654659e-7,"about_ca_topic_score_gemma":0.00000239429,"teacher_disagreement_score":0.07324153,"about_ca_system_score_codex":0.00002468407,"about_ca_system_score_gemma":0.00004281634,"threshold_uncertainty_score":0.5620186},"labels":[],"label_agreement":null},{"id":"W2055422348","doi":"10.1016/j.dam.2011.07.016","title":"Maximizing edge-ratio is NP-complete","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Maximum cut; Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.06736649496454762,"score_gpt":0.2829218158582461,"score_spread":0.2155553208936985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055422348","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017205218,0.0000330371,0.88419783,0.00012118743,0.00007405618,0.00037449837,0.00000744713,0.00027064618,0.11320078],"genre_scores_gemma":[0.1864404,0.000013648665,0.8124533,0.0004660673,0.000044663022,0.00011202603,0.0000041626363,0.000046473626,0.0004192434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802196,0.000023647803,0.00041203087,0.0004904638,0.00048685918,0.00056506274],"domain_scores_gemma":[0.9980421,0.0001404065,0.00017035865,0.0013986272,0.000076503355,0.00017198722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044556163,0.0002594963,0.0003079467,0.00015852561,0.00021700947,0.00013863356,0.0016473703,0.000077619196,0.00016959468],"category_scores_gemma":[0.000035656503,0.00022740584,0.000105465304,0.00050708407,0.00015519846,0.00035521295,0.0006005663,0.00024344375,0.00071920926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006420712,0.000058532703,0.000007393241,0.000063722786,0.000026215917,0.000007708842,0.007276522,0.0000040401724,0.007148294,0.9820545,0.00037383725,0.002972857],"study_design_scores_gemma":[0.00032668552,0.000044845376,0.000042502008,0.000023880086,0.000012072815,0.000020321657,0.0004466359,0.014773144,0.027130315,0.95512134,0.0016576258,0.00040061047],"about_ca_topic_score_codex":0.00000283431,"about_ca_topic_score_gemma":0.0000010800143,"teacher_disagreement_score":0.18471988,"about_ca_system_score_codex":0.0000322782,"about_ca_system_score_gemma":0.000037094564,"threshold_uncertainty_score":0.92733413},"labels":[],"label_agreement":null},{"id":"W2055446353","doi":"10.4171/jems/320","title":"Triangle-intersecting families of graphs","year":2012,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Mathematics; Combinatorics","score_opus":0.03325261629935669,"score_gpt":0.2902592949186205,"score_spread":0.25700667861926385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055446353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2727866,0.0004105576,0.698566,0.00082443695,0.0006610335,0.00017379693,0.0000012525703,0.000038652182,0.026537677],"genre_scores_gemma":[0.9303199,0.000021081769,0.069244444,0.000103375365,0.00013951765,3.1340127e-7,1.9401687e-8,0.000014360607,0.00015697109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979375,0.0006239971,0.0005465086,0.00007870042,0.0005283315,0.00028494606],"domain_scores_gemma":[0.9982271,0.0005689757,0.0004988628,0.00041754582,0.00016239428,0.00012512636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005089101,0.00010152062,0.00025996487,0.000043729993,0.000109819885,0.000041171348,0.0015030993,0.000023132829,0.000015681951],"category_scores_gemma":[0.0007815283,0.000056525514,0.0007226144,0.00042000052,0.00018895204,0.00049987907,0.000533974,0.00038463264,0.000019401557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059233465,0.0013136127,0.004318238,0.000545092,0.000725513,0.000019056712,0.05503202,0.00015584423,0.033714917,0.8503215,0.008505119,0.04528988],"study_design_scores_gemma":[0.0026037402,0.00046440633,0.0113477735,0.0010924509,0.00014109472,0.00096599123,0.0083681885,0.004521753,0.026693346,0.94025785,0.0029442331,0.0005991692],"about_ca_topic_score_codex":1.6483297e-7,"about_ca_topic_score_gemma":2.5084017e-8,"teacher_disagreement_score":0.65753335,"about_ca_system_score_codex":0.000031031526,"about_ca_system_score_gemma":0.000020279856,"threshold_uncertainty_score":0.27931577},"labels":[],"label_agreement":null},{"id":"W2055499237","doi":"10.1006/jctb.2001.2091","title":"On a Conjecture of Lovász Concerning Bricks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Brick; Petersen graph; Cubic graph; Matching (statistics); Graph; Discrete mathematics; Line graph; Voltage graph; Engineering","score_opus":0.01866125685222832,"score_gpt":0.2619885753374605,"score_spread":0.24332731848523217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055499237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57583255,0.0052875923,0.32218683,0.0028825712,0.02677849,0.00084061426,0.000017027829,0.00023262558,0.06594172],"genre_scores_gemma":[0.99749136,0.000070685644,0.0016036532,0.000086227905,0.0002668072,0.0000012849392,1.3310627e-7,0.000015155191,0.00046471704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977665,0.0005155832,0.0005416705,0.00017399734,0.0007105367,0.00029169445],"domain_scores_gemma":[0.9972763,0.0010678434,0.000634021,0.00045456624,0.00041816165,0.000149092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013757247,0.00017204943,0.0004393168,0.0002584179,0.00011087633,0.000073512434,0.0013024054,0.00009689821,0.000251935],"category_scores_gemma":[0.0008518323,0.00013882761,0.00020052982,0.0005165081,0.0002972578,0.0008194342,0.00016860648,0.00056590396,0.000014266938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046628105,0.00012031555,0.000035521898,0.000013209126,0.000061565566,0.00008693852,0.0010269094,0.0001673934,0.0010784285,0.99091744,0.00061512756,0.005410894],"study_design_scores_gemma":[0.0015131601,0.0022011502,0.00002730472,0.0000880994,0.000009416689,0.00019628482,0.00011842898,0.00012269111,0.0117662335,0.9769919,0.0068197236,0.00014561642],"about_ca_topic_score_codex":5.401008e-7,"about_ca_topic_score_gemma":9.1081986e-8,"teacher_disagreement_score":0.4216588,"about_ca_system_score_codex":0.00006066703,"about_ca_system_score_gemma":0.00006550248,"threshold_uncertainty_score":0.5661226},"labels":[],"label_agreement":null},{"id":"W2055572845","doi":"10.1002/net.20450","title":"Proximity and remoteness in graphs: Results and conjectures","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Independence number; Vertex (graph theory); Upper and lower bounds; Matching (statistics); Graph; Order (exchange); Connectivity; Discrete mathematics; Statistics","score_opus":0.02974784007176186,"score_gpt":0.25870406774043736,"score_spread":0.2289562276686755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055572845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48515818,0.003957849,0.4998972,0.00044054454,0.00033926583,0.0007468903,0.00000278166,0.00024073037,0.009216543],"genre_scores_gemma":[0.9856488,0.00021962986,0.0139249815,0.0001400017,0.00001810624,0.0000064418123,5.5497867e-7,0.0000056235936,0.000035865203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990091,0.00011743993,0.00013662466,0.00035965702,0.000104311795,0.00027288572],"domain_scores_gemma":[0.9993749,0.00013235472,0.000036785703,0.00033744806,0.000033079163,0.00008539108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005476533,0.00009178846,0.00011782983,0.00010521847,0.00006732104,0.00004415947,0.00030397635,0.000075591066,0.0000012404156],"category_scores_gemma":[0.000059317757,0.000077708,0.00001308514,0.00036745783,0.00016895686,0.00029924678,0.0002631035,0.00022831808,5.876374e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006653921,0.000115398834,0.029105855,0.00004212705,0.00002635872,0.00021407717,0.005155494,0.00069379946,0.00009313249,0.4755127,0.00049784424,0.48787782],"study_design_scores_gemma":[0.0016895345,0.00023105554,0.21237786,0.00007458949,0.0000032233033,0.000067489724,0.000049815375,0.11448323,0.0003788852,0.6696896,0.00059290876,0.00036184164],"about_ca_topic_score_codex":0.000045260673,"about_ca_topic_score_gemma":0.000099693956,"teacher_disagreement_score":0.5004906,"about_ca_system_score_codex":0.000006716029,"about_ca_system_score_gemma":0.000011096795,"threshold_uncertainty_score":0.316884},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Interval (graph theory); Combinatorics; Discrete mathematics","score_opus":0.018577106685052972,"score_gpt":0.3012789117041017,"score_spread":0.28270180501904874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055646787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06202518,0.00058390637,0.93290883,0.0012259706,0.0000580367,0.000345457,0.0000013448035,0.00024931855,0.002601955],"genre_scores_gemma":[0.94670755,0.000044789787,0.05289229,0.00015313191,0.000023871142,0.000017133278,0.0000023412588,0.000015476739,0.00014343883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977346,0.00009477762,0.00041025184,0.0004063754,0.00040599532,0.00094800506],"domain_scores_gemma":[0.9984169,0.00038697,0.00010679476,0.00094732887,0.000048008085,0.00009401124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704743,0.00022518272,0.00029803842,0.00030137203,0.00007325279,0.00011588229,0.0015497991,0.00007672629,0.000023702562],"category_scores_gemma":[0.00035122945,0.00019711774,0.00011923584,0.0010932747,0.00008206213,0.00045669483,0.00020601258,0.0005124811,0.000049968374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011043485,0.00013791824,0.0000908421,0.000023890132,0.000010865938,0.00001698886,0.0009087167,0.00013253263,0.0012599163,0.97247636,0.000023478542,0.024907466],"study_design_scores_gemma":[0.00038488003,0.00033331456,0.0004163238,0.000062361665,0.0000041057187,0.00002825646,0.000039896055,0.048048843,0.005365784,0.9448841,0.000169316,0.00026282817],"about_ca_topic_score_codex":0.0000032027478,"about_ca_topic_score_gemma":0.00002809882,"teacher_disagreement_score":0.88468236,"about_ca_system_score_codex":0.0001457493,"about_ca_system_score_gemma":0.00008962976,"threshold_uncertainty_score":0.8038228},"labels":[],"label_agreement":null},{"id":"W2055751002","doi":"10.1016/j.disc.2014.03.015","title":"Recognition of prime graphs from a prime subgraph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Prime (order theory); Vertex (graph theory); Graph; Discrete mathematics; Singleton","score_opus":0.025591788007199887,"score_gpt":0.27737762576300273,"score_spread":0.2517858377558028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055751002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14490065,0.000054560318,0.8508067,0.000088221175,0.00007520792,0.00023917742,0.000022156866,0.00013293875,0.0036803808],"genre_scores_gemma":[0.67257786,0.000015408921,0.32722205,0.000035372675,0.0000222799,0.000021656251,0.000019121484,0.000021071324,0.000065189764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834776,0.00014050443,0.00040474994,0.00033053293,0.00047575255,0.00030069222],"domain_scores_gemma":[0.9979621,0.00052135903,0.000247464,0.0010149429,0.0001449529,0.000109157314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006304026,0.00016944848,0.00030363008,0.00020771519,0.000072824165,0.0000649898,0.00095611333,0.00007149381,0.000034486322],"category_scores_gemma":[0.00029814712,0.00014527369,0.00014725221,0.00058108836,0.00015816024,0.0003376312,0.00025171242,0.00015462103,0.00010163053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024967045,0.00029266873,0.0005220951,0.00016308903,0.0001095191,0.000004720774,0.003936818,0.0000102379645,0.033385407,0.8989337,0.00009006015,0.06252671],"study_design_scores_gemma":[0.00028139557,0.00009514802,0.00033180014,0.00009746438,0.000012657772,0.0000031036268,0.00006384783,0.018710533,0.061755776,0.9183573,0.00010482466,0.00018611063],"about_ca_topic_score_codex":0.0000134758075,"about_ca_topic_score_gemma":0.0000038381763,"teacher_disagreement_score":0.5276772,"about_ca_system_score_codex":0.000012572939,"about_ca_system_score_gemma":0.000024012386,"threshold_uncertainty_score":0.5924089},"labels":[],"label_agreement":null},{"id":"W205629517","doi":"","title":"Spanning trails that join given edges in 3-edge-connected graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.026175743226512723,"score_gpt":0.27252693756401697,"score_spread":0.24635119433750424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205629517","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9894916,0.00045546738,0.0007673153,0.0007088497,0.00072472525,0.00035466152,0.000002303286,0.0003279783,0.007167093],"genre_scores_gemma":[0.99750787,0.00006764971,0.0016059751,0.00012674986,0.000006544458,0.0000463867,0.0000034287252,0.000025950458,0.0006094569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975042,0.00031051572,0.00029302138,0.00065719127,0.0004704589,0.0007646576],"domain_scores_gemma":[0.9984237,0.0003595192,0.000066895176,0.0008830237,0.00007400386,0.0001928504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006518823,0.00024785777,0.0003232774,0.00041577072,0.00017614514,0.00016222017,0.0015442889,0.000117865326,0.0001932282],"category_scores_gemma":[0.00010018434,0.0002539319,0.00010941695,0.0016761394,0.0001580118,0.0009317988,0.00019673839,0.0004640472,0.00021230106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041736468,0.0001957458,0.009062661,0.000016093443,0.000024182416,0.00014742774,0.001457315,0.00009076644,0.0012102491,0.91870826,0.0008985275,0.06814703],"study_design_scores_gemma":[0.0013540905,0.00013137216,0.027721113,0.00006261959,0.0000027773106,0.00001681692,0.00006613827,0.0012666332,0.007947477,0.9588746,0.0022089116,0.0003474706],"about_ca_topic_score_codex":0.000033958146,"about_ca_topic_score_gemma":0.000013723946,"teacher_disagreement_score":0.06779957,"about_ca_system_score_codex":0.00007973007,"about_ca_system_score_gemma":0.00007033262,"threshold_uncertainty_score":0.9999913},"labels":[],"label_agreement":null},{"id":"W2056603572","doi":"10.1002/jgt.20125","title":"Erratum to: Factorizations and characterizations of induced‐hereditary and compositive properties","year":2005,"lang":"en","type":"erratum","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.024301531156611444,"score_gpt":0.27298535546477193,"score_spread":0.2486838243081605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056603572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16635849,0.06799742,0.6771941,0.0087327305,0.054708075,0.00372513,0.0007460886,0.00030102165,0.020236932],"genre_scores_gemma":[0.96029025,0.0060150856,0.01443431,0.000743217,0.0022022089,0.000034397162,0.000051241608,0.00016205681,0.016067225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976169,0.00046393988,0.00071016734,0.0003268512,0.00057701126,0.00030516766],"domain_scores_gemma":[0.9975105,0.00026780515,0.00073060056,0.00042349775,0.000824022,0.00024355495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085884024,0.00030972777,0.00064951304,0.001279946,0.0002090532,0.00011953838,0.0009266307,0.00025725673,0.000009858555],"category_scores_gemma":[0.0002917334,0.00025015805,0.00014141723,0.00080101757,0.00035919927,0.0009616417,0.00042429558,0.0011444505,0.0000013119978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010162626,0.0012184383,0.0006471338,0.0011216442,0.0023935114,0.00032432054,0.027745733,0.00011708352,0.14113633,0.6253802,0.09369617,0.10520317],"study_design_scores_gemma":[0.003439455,0.0069189216,0.06452147,0.008627059,0.00065987965,0.0028115462,0.0029503328,0.00081978564,0.01576633,0.8346963,0.055278525,0.003510394],"about_ca_topic_score_codex":0.000002355075,"about_ca_topic_score_gemma":0.0000032670703,"teacher_disagreement_score":0.7939318,"about_ca_system_score_codex":0.000041691077,"about_ca_system_score_gemma":0.00033067193,"threshold_uncertainty_score":0.99999505},"labels":[],"label_agreement":null},{"id":"W2057066268","doi":"10.1016/s0012-365x(01)00158-3","title":"A family of universal pseudo-homogeneous G-colourable graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Countable set; Homogeneous; Discrete mathematics; Graph isomorphism; Graph; Line graph","score_opus":0.028750135858627665,"score_gpt":0.26149008944714447,"score_spread":0.2327399535885168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057066268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4115012,0.0004938174,0.5474453,0.0002913051,0.00015744827,0.0005127417,0.000020724414,0.0002917962,0.03928566],"genre_scores_gemma":[0.82825714,0.00008886195,0.17023829,0.000046873367,0.0000052617233,0.000010317746,0.0000010027821,0.000022399925,0.0013298622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985028,0.000063845924,0.00030942186,0.00027383806,0.00046659974,0.00038351907],"domain_scores_gemma":[0.99850625,0.00022436155,0.00015304946,0.00088270125,0.000115703064,0.00011795136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027141155,0.00016350714,0.00027037,0.00019973375,0.000102384896,0.00005358503,0.0012081041,0.00006005905,0.00007299836],"category_scores_gemma":[0.00008540029,0.00014247738,0.0001333717,0.0007647571,0.00017860044,0.00029321,0.00028759823,0.00014354198,0.00009693802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004488013,0.00014903504,0.00006564466,0.00009312948,0.000040217874,0.000048395086,0.0022800302,0.00023254268,0.006247928,0.98808223,0.0004388834,0.0023175003],"study_design_scores_gemma":[0.0005254146,0.00023316013,0.00005793305,0.00007356762,0.000017087246,0.000058860198,0.0006029732,0.27031794,0.007973307,0.7194586,0.00034318972,0.00033799617],"about_ca_topic_score_codex":0.000005280722,"about_ca_topic_score_gemma":0.0000011993284,"teacher_disagreement_score":0.41675594,"about_ca_system_score_codex":0.000028540999,"about_ca_system_score_gemma":0.000018821518,"threshold_uncertainty_score":0.5810059},"labels":[],"label_agreement":null},{"id":"W2057179567","doi":"10.1016/j.disc.2011.03.026","title":"Graphs with equal eternal vertex cover and eternal domination numbers","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex cover; Vertex (graph theory); Domination analysis; Cover (algebra); Graph; Discrete mathematics","score_opus":0.029087318685136275,"score_gpt":0.2742533542844277,"score_spread":0.24516603559929143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057179567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18600808,0.000027061204,0.80330557,0.000029412517,0.000075005235,0.00018117146,0.0000044349867,0.000073277275,0.010295973],"genre_scores_gemma":[0.81952643,0.000013308185,0.17993031,0.00004997283,0.000009360021,0.000016194508,0.0000014660853,0.000018974086,0.000433994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865955,0.000056031982,0.00021449204,0.00029286498,0.0004643524,0.0003127367],"domain_scores_gemma":[0.999061,0.0001436695,0.00012461124,0.00045692953,0.00007745455,0.00013636194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003555579,0.00016988398,0.00018031933,0.00012356021,0.00011040913,0.00012558904,0.0005906734,0.000047797417,0.000056912097],"category_scores_gemma":[0.000046026962,0.00012606253,0.00004880718,0.00024397297,0.00019887536,0.00063288066,0.00022366144,0.00016844086,0.000062119354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058458096,0.00008126683,0.0018888591,0.000086067805,0.000060384256,0.000056188008,0.0081351325,0.000008179126,0.0004573146,0.9851438,0.000058344536,0.003966024],"study_design_scores_gemma":[0.0012869567,0.00045487823,0.0021644577,0.00016079163,0.000027221942,0.00023129194,0.0004070506,0.04879385,0.0044239,0.9414353,0.00012899241,0.0004853237],"about_ca_topic_score_codex":0.000011028512,"about_ca_topic_score_gemma":0.0000045839874,"teacher_disagreement_score":0.63351834,"about_ca_system_score_codex":0.000020601225,"about_ca_system_score_gemma":0.000024429397,"threshold_uncertainty_score":0.51406807},"labels":[],"label_agreement":null},{"id":"W2057654888","doi":"10.1016/j.jctb.2008.08.006","title":"Growth rates of minor-closed classes of matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Rank (graph theory); Minor (academic); Graphic matroid; Simple (philosophy); Class (philosophy); Matroid partitioning; Discrete mathematics","score_opus":0.020051602701198497,"score_gpt":0.281127115789744,"score_spread":0.2610755130885455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057654888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701073,0.0008846123,0.022829555,0.0002993514,0.003397712,0.00017298179,0.000005717189,0.000029792644,0.0022729805],"genre_scores_gemma":[0.9919604,0.000259502,0.007306596,0.000016288093,0.00019750092,0.0000016222235,3.3505202e-7,0.00001566167,0.00024205906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973224,0.0005826691,0.0008588352,0.0001620698,0.00078451383,0.00028954932],"domain_scores_gemma":[0.9963178,0.00092312094,0.0009234397,0.00045432287,0.0012414327,0.00013987868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015984115,0.00018138366,0.00061799906,0.00036653603,0.0001126096,0.000025351253,0.0015724486,0.000091645066,0.000039897506],"category_scores_gemma":[0.0008161764,0.00014911659,0.0002672122,0.00071801175,0.0007047723,0.0013005687,0.00024648875,0.00032688293,0.0000027372969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012300631,0.00021834184,0.0015740267,0.000053171112,0.000095645104,0.000068877576,0.00067600637,0.00001551815,0.019132363,0.9763001,0.00028485325,0.00035101778],"study_design_scores_gemma":[0.0011971551,0.0011836214,0.0011192479,0.000050445287,0.000011036186,0.00023441714,0.00016087586,0.000009493932,0.22622643,0.7691046,0.0005862936,0.00011638794],"about_ca_topic_score_codex":0.000002334683,"about_ca_topic_score_gemma":2.454183e-7,"teacher_disagreement_score":0.20719554,"about_ca_system_score_codex":0.00003933061,"about_ca_system_score_gemma":0.00031949786,"threshold_uncertainty_score":0.6080798},"labels":[],"label_agreement":null},{"id":"W2058105885","doi":"10.1145/1150334.1150337","title":"Bipartite roots of graphs","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Graph isomorphism; Complete bipartite graph; Discrete mathematics; Cograph; Time complexity; Edge-transitive graph; Line graph; Isomorphism (crystallography); Graph; Pathwidth; Voltage graph","score_opus":0.019697867541191533,"score_gpt":0.2844186336568095,"score_spread":0.264720766115618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058105885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008027884,0.00008783397,0.9899929,0.00048087467,0.0002191975,0.00014284457,0.000014258308,0.00016619287,0.0008679722],"genre_scores_gemma":[0.790545,0.000030447862,0.208572,0.000052969204,0.00002161468,0.00003853414,0.0000016688973,0.000015631309,0.000722159],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986404,0.000071104645,0.00024425497,0.00033554132,0.0003935164,0.00031515965],"domain_scores_gemma":[0.9984515,0.00019457343,0.00005744012,0.00111415,0.00010600116,0.00007634415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021214985,0.0001310222,0.00015602117,0.00037476872,0.00015006495,0.000036205834,0.0010853558,0.000057711648,0.000049708262],"category_scores_gemma":[0.000014417621,0.00012464143,0.00013529106,0.0011695017,0.00013250994,0.0003835977,0.000017225007,0.0002071117,0.0000674754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004205387,0.00085546414,0.00019734756,0.000027697271,0.00006876209,0.000030948857,0.00013731557,0.013964504,0.013691556,0.13916063,0.00019298919,0.8316307],"study_design_scores_gemma":[0.0012231679,0.00052574323,0.0097737545,0.000047360045,0.000019340994,0.00003992575,0.000039156646,0.023970636,0.18709607,0.77277184,0.0039847097,0.00050828705],"about_ca_topic_score_codex":0.00007312698,"about_ca_topic_score_gemma":0.000026596943,"teacher_disagreement_score":0.83112246,"about_ca_system_score_codex":0.000024163477,"about_ca_system_score_gemma":0.000033586908,"threshold_uncertainty_score":0.508273},"labels":[],"label_agreement":null},{"id":"W2058216532","doi":"10.1016/j.disc.2007.12.002","title":"On a cycle partition problem","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Partition (number theory); Circumference; Vertex (graph theory); Discrete mathematics; Graph; Chordal graph; Pathwidth; Line graph","score_opus":0.029932927174198425,"score_gpt":0.29276310488968144,"score_spread":0.262830177715483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058216532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06883495,0.000018722729,0.9007898,0.00037512626,0.000043423806,0.0002699454,0.0000030710667,0.0002456979,0.029419271],"genre_scores_gemma":[0.78971463,0.000014106801,0.20930767,0.000121576086,0.000021264812,0.000053789146,0.0000026072146,0.00001663383,0.00074769306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988919,0.00004169332,0.00018559433,0.00022581399,0.0003788993,0.00027611208],"domain_scores_gemma":[0.99903136,0.00016266455,0.00006603772,0.00060607394,0.000046615067,0.00008727053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021324163,0.00010987206,0.00012833808,0.000083744046,0.00017940465,0.00004529449,0.0005381599,0.000033020904,0.00002747966],"category_scores_gemma":[0.000081741404,0.00008872671,0.000060134167,0.00031292514,0.00008896793,0.00027634113,0.00013863474,0.00012464977,0.00040570978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003277672,0.00008460971,0.00001766934,0.00002822913,0.0000064606725,0.000024950177,0.0014540816,0.00029558333,0.00023721554,0.99673665,0.00037008018,0.0007412212],"study_design_scores_gemma":[0.00018076236,0.00011008972,0.000060198323,0.00004047088,0.000001586279,0.000043642875,0.00003501711,0.046963457,0.0022098708,0.9499493,0.0002667737,0.0001387769],"about_ca_topic_score_codex":8.3250325e-7,"about_ca_topic_score_gemma":5.7066256e-7,"teacher_disagreement_score":0.7208797,"about_ca_system_score_codex":0.000024694637,"about_ca_system_score_gemma":0.00002346065,"threshold_uncertainty_score":0.5214714},"labels":[],"label_agreement":null},{"id":"W2058537654","doi":"10.1016/j.disc.2004.06.019","title":"On minimal prime extensions of a four-vertex graph in a prime graph","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Circulant graph; Neighbourhood (mathematics); Vertex (graph theory); Discrete mathematics; Graph; Prime (order theory); Complement graph; Graph power; Line graph","score_opus":0.030063820658872933,"score_gpt":0.29746555709682104,"score_spread":0.2674017364379481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058537654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3693414,0.000083818064,0.62708056,0.00039154425,0.00008215778,0.0005889578,0.000011116861,0.00011564514,0.0023047961],"genre_scores_gemma":[0.8346898,0.00001603727,0.16509314,0.0000621726,0.0000065841127,0.0000329593,0.0000019559334,0.000024881427,0.00007244217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778295,0.00008257343,0.00053301686,0.00043782676,0.0006591193,0.0005045003],"domain_scores_gemma":[0.9979397,0.00043201452,0.00019947189,0.0011757175,0.000108771346,0.00014430023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698149,0.00023990504,0.0004111148,0.000573223,0.000083260195,0.00004819173,0.0011251055,0.000087518354,0.000012118054],"category_scores_gemma":[0.00039934274,0.00020029116,0.00019173704,0.001329012,0.00022999411,0.00028410886,0.000340431,0.00028179673,0.00004707531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028638064,0.0004162805,0.000062450694,0.00007532902,0.000025932495,0.0000665812,0.0026218798,0.0004693887,0.0065912213,0.9885817,0.00002045124,0.0010401112],"study_design_scores_gemma":[0.0008918589,0.00031115394,0.00083439756,0.00034767675,0.000007602704,0.000030327967,0.00016315744,0.0047117863,0.0123168165,0.9801299,0.000008790925,0.00024653686],"about_ca_topic_score_codex":0.000011320637,"about_ca_topic_score_gemma":0.0000134443,"teacher_disagreement_score":0.4653484,"about_ca_system_score_codex":0.000051278035,"about_ca_system_score_gemma":0.00010247747,"threshold_uncertainty_score":0.81676364},"labels":[],"label_agreement":null},{"id":"W2059051297","doi":"10.1016/j.ipl.2009.02.013","title":"An algorithm for computing simple k-factors","year":2009,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Simple (philosophy); Combinatorics; Algorithm; SIMPLE algorithm; Factor (programming language); Degenerate energy levels; Graphics; Computer science; Simple graph; Mathematics; Graph theory; Factor graph; Graph; Discrete mathematics","score_opus":0.01734897957320729,"score_gpt":0.30848656557231624,"score_spread":0.29113758599910894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059051297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028091058,0.000007375785,0.9701835,0.0010133744,0.00006951116,0.00019367137,0.0000032021437,0.000326725,0.000111619156],"genre_scores_gemma":[0.6532647,2.782867e-7,0.34142396,0.005217186,0.000043990793,0.0000048267816,0.000038366445,0.0000043900973,0.0000023418054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998927,0.000024493707,0.0002755192,0.000152245,0.00027789382,0.00034285244],"domain_scores_gemma":[0.99928033,0.000060449813,0.00015549532,0.00025885008,0.00015272269,0.00009212325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035651724,0.00011740959,0.00010367848,0.00022464013,0.00037760343,0.0005884112,0.00066590676,0.000035887682,0.00000142664],"category_scores_gemma":[0.00004076977,0.0001094102,0.000040170988,0.0004111514,0.000035326044,0.0072064195,0.00003284077,0.00011183986,0.000008344833],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026146738,0.0000121237035,0.00004879599,0.000014129225,0.0000018625535,3.5678755e-7,0.0020442284,0.0018796294,0.0008917041,0.0025766967,0.0002467444,0.99228114],"study_design_scores_gemma":[0.00036543355,0.00010877681,0.0012855881,0.0000173346,0.0000017330051,0.00000555479,0.00016752437,0.9811255,0.0039205626,0.009399466,0.003381019,0.00022151221],"about_ca_topic_score_codex":0.0000014012014,"about_ca_topic_score_gemma":8.7811976e-8,"teacher_disagreement_score":0.9920596,"about_ca_system_score_codex":0.000047402373,"about_ca_system_score_gemma":0.000042724292,"threshold_uncertainty_score":0.56740624},"labels":[],"label_agreement":null},{"id":"W2059398229","doi":"10.1137/110846828","title":"Planar Graphs Have Exponentially Many 3-Arboricities","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Planar graph; Combinatorics; Planar; Exponential growth; Colored; Projective test; Graph; Discrete mathematics; Class (philosophy); Planar straight-line graph; Outerplanar graph; 1-planar graph; Pathwidth; Line graph; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.03082149681854752,"score_gpt":0.29916580342904087,"score_spread":0.26834430661049335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059398229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037515704,0.00061877316,0.9425919,0.0006861399,0.0008268535,0.000253358,0.000007861542,0.00015478561,0.01734464],"genre_scores_gemma":[0.8371521,0.0001992495,0.16042048,0.00029436627,0.00035239814,0.000017250637,0.0000019791771,0.00005919122,0.001502963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712944,0.00017656028,0.0005411655,0.0002192674,0.0010566328,0.00087692885],"domain_scores_gemma":[0.9980198,0.000340091,0.00032868626,0.00073106424,0.00011641503,0.0004639024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013438502,0.00028417332,0.00033490622,0.0004203798,0.0003805479,0.0003721354,0.0014315431,0.000082696395,0.000078531084],"category_scores_gemma":[0.00015574266,0.00021518813,0.00023581178,0.00033896204,0.00013647856,0.0011474912,0.00019275944,0.0006427185,0.00019724206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001743013,0.00016883931,0.00021651125,0.00004395419,0.00006403457,0.00005898933,0.0028392668,0.00003720285,0.0006318915,0.99379534,0.0007379951,0.0013885443],"study_design_scores_gemma":[0.00057977164,0.0003384002,0.0005093721,0.00020704893,0.000023712222,0.0007390095,0.001343398,0.004073199,0.002634085,0.98626256,0.002778577,0.00051085197],"about_ca_topic_score_codex":7.752477e-7,"about_ca_topic_score_gemma":5.615473e-7,"teacher_disagreement_score":0.7996364,"about_ca_system_score_codex":0.00007778981,"about_ca_system_score_gemma":0.000047934926,"threshold_uncertainty_score":0.87751174},"labels":[],"label_agreement":null},{"id":"W2059447100","doi":"10.4153/cmb-2015-021-4","title":"On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold","year":2015,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Monopoly; Integer (computer science); Upper and lower bounds; Degree (music); Discrete mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.0221388638266732,"score_gpt":0.2591739011194038,"score_spread":0.2370350372927306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059447100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32454976,0.0015490813,0.31496146,0.1302302,0.00064231385,0.007554075,0.0008658728,0.0006069363,0.21904029],"genre_scores_gemma":[0.9902418,0.000017333583,0.007153496,0.00064153696,0.000016350436,0.00017837518,0.000010988901,0.000053119726,0.0016869629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742544,0.00019531457,0.00036307957,0.00061265397,0.0006947567,0.0007087848],"domain_scores_gemma":[0.99611676,0.0007320697,0.00017141832,0.0020588515,0.00025428878,0.00066663296],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010877202,0.00037263258,0.0005191859,0.0004008752,0.00014828364,0.00017158038,0.0027749708,0.00021812075,0.0009284136],"category_scores_gemma":[0.00047604291,0.00024003962,0.00014641002,0.00035643415,0.00055807584,0.000036340727,0.0006841154,0.0010642637,0.001183292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015640962,0.000049612278,0.000011283246,0.00014233176,0.000060605013,0.00009524609,0.00050305424,0.0007868781,0.0000039732417,0.99145764,0.006696574,0.00017713304],"study_design_scores_gemma":[0.00016898729,0.00012751282,0.000021928974,0.00042454933,0.000011075033,0.000019553803,0.000064702894,0.011826501,0.000052961423,0.98496026,0.002024858,0.0002971408],"about_ca_topic_score_codex":0.0005579913,"about_ca_topic_score_gemma":0.0013063819,"teacher_disagreement_score":0.6656921,"about_ca_system_score_codex":0.00024904657,"about_ca_system_score_gemma":0.00081989646,"threshold_uncertainty_score":0.99998486},"labels":[],"label_agreement":null},{"id":"W2059590924","doi":"10.1016/j.tcs.2010.07.017","title":"Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ϵ</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math>time","year":2010,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constant (computer programming); Minor (academic); Scroll; Grid; Planar; Mathematics; Factor (programming language); Combinatorics; Computer science; Discrete mathematics; Computer graphics (images); Geometry; Programming language; Humanities; Engineering","score_opus":0.013831030640454033,"score_gpt":0.2509247616131342,"score_spread":0.23709373097268016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059590924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7201959,0.0013892902,0.019735042,0.0013876646,0.004852016,0.00017124237,0.0012566112,0.0005344239,0.25047785],"genre_scores_gemma":[0.9753631,0.00103094,0.016144153,0.0017010926,0.0022227743,0.0013096981,0.0011197651,0.0009955218,0.00011296012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9786567,0.0013901443,0.003935916,0.0044383877,0.006236157,0.005342667],"domain_scores_gemma":[0.98292226,0.005295321,0.0035443483,0.0046129026,0.00071427977,0.0029109153],"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.0058398135,0.0018234503,0.0008573871,0.001918415,0.0035853956,0.0034785403,0.0074458527,0.0036563387,0.19143085],"category_scores_gemma":[0.0034339242,0.0033858712,0.002854798,0.004414275,0.012483192,0.0043623676,0.0061483523,0.004125734,0.0018364621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026640208,0.0009419942,0.000047745747,0.0016786157,0.0014196618,0.0015158886,0.0032455607,0.0021104156,0.01187865,0.89975274,0.070299886,0.004444842],"study_design_scores_gemma":[0.003298798,0.0037134283,0.00022224769,0.0018809775,0.0011909,0.003273414,0.0010247139,0.1689851,0.80602735,0.006750271,0.00082835276,0.0028044193],"about_ca_topic_score_codex":0.0014138331,"about_ca_topic_score_gemma":0.0010029088,"teacher_disagreement_score":0.89300245,"about_ca_system_score_codex":0.000040754596,"about_ca_system_score_gemma":0.0032842113,"threshold_uncertainty_score":0.99945104},"labels":[],"label_agreement":null},{"id":"W2059685480","doi":"10.1016/j.disc.2004.02.022","title":"A generalization of the theorem of Lekkerkerker and Boland","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Generalization; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.015036969796973682,"score_gpt":0.2766363574825042,"score_spread":0.26159938768553054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059685480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27629223,0.00021321351,0.71992403,0.00040232379,0.000027587446,0.00020899293,0.000005607292,0.000020208623,0.0029058077],"genre_scores_gemma":[0.91110134,0.000022239201,0.088616155,0.000027033124,0.000011487426,0.0000038663557,4.5061736e-7,0.000007000633,0.00021044085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992633,0.00005550419,0.00021983215,0.00010858921,0.00024113001,0.000111681555],"domain_scores_gemma":[0.99916947,0.00010510825,0.00014185312,0.0004892706,0.00006720937,0.00002708112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033211982,0.00006944044,0.00012956245,0.000044325137,0.00004388061,0.000018902208,0.00045960612,0.000026058262,0.000008642614],"category_scores_gemma":[0.000093529176,0.000041765477,0.000043914857,0.000247988,0.00016294105,0.00015449924,0.00024752165,0.000051308292,0.0000012028938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027612116,0.000028588047,0.00068251963,0.00007242417,0.000011943034,1.422213e-7,0.0023169462,0.00021459996,0.004741538,0.9893907,0.00003384272,0.0025039972],"study_design_scores_gemma":[0.00044424584,0.000054027412,0.0019792223,0.00012739455,0.00001639125,0.000016831907,0.00023258688,0.2533781,0.06978598,0.6732418,0.00056155,0.00016188262],"about_ca_topic_score_codex":0.0000014157051,"about_ca_topic_score_gemma":0.000003294706,"teacher_disagreement_score":0.6348091,"about_ca_system_score_codex":0.000006235137,"about_ca_system_score_gemma":0.00001607503,"threshold_uncertainty_score":0.17031467},"labels":[],"label_agreement":null},{"id":"W2059686109","doi":"10.1016/j.laa.2004.03.016","title":"On the even permutation polytope","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Polytope; Birkhoff polytope; Combinatorics; Permutation (music); Convex polytope; Permutation matrix; Uniform k 21 polytope; Regular polygon; Geometry; Convex analysis; Convex optimization; Convex set","score_opus":0.018182293792979764,"score_gpt":0.28678242200097576,"score_spread":0.268600128207996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059686109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0840651,0.0002455752,0.89761347,0.014899235,0.000024256926,0.0006373594,0.0000065554,0.00012595698,0.0023824943],"genre_scores_gemma":[0.99310416,0.000045710003,0.005419627,0.0008091455,0.000052485695,0.00021604195,0.0000040520176,0.0000072119797,0.0003415661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939,0.000025735468,0.00008687722,0.00021421461,0.00014631466,0.0001368652],"domain_scores_gemma":[0.99933106,0.00017023095,0.000027664799,0.00035883434,0.00005451544,0.000057698755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013275814,0.000065404354,0.000049413768,0.000048786114,0.00030030223,0.000053685777,0.00040571016,0.000025197132,0.000012645607],"category_scores_gemma":[0.000043533528,0.000045129458,0.000021699738,0.00037683788,0.00004522966,0.00015874232,0.00008701398,0.000117352865,0.00024659722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014186303,0.000023985975,0.0000032213964,0.0000017739297,0.0000031599536,2.6072104e-7,0.00015754017,0.0001175773,0.0013535185,0.99245524,0.000019912499,0.005862373],"study_design_scores_gemma":[0.00022273487,0.000065786466,0.0006097558,0.000007943565,0.000002961701,0.0000084779285,0.00005039274,0.0051508,0.010460915,0.97692317,0.006381115,0.000115978335],"about_ca_topic_score_codex":0.000002219934,"about_ca_topic_score_gemma":0.0000014043637,"teacher_disagreement_score":0.9090391,"about_ca_system_score_codex":0.000013940068,"about_ca_system_score_gemma":0.000031106378,"threshold_uncertainty_score":0.31695905},"labels":[],"label_agreement":null},{"id":"W2059857922","doi":"10.1016/j.dam.2008.08.017","title":"On probe permutation graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"National Science Council","keywords":"Combinatorics; Chordal graph; Mathematics; Permutation graph; Pathwidth; Split graph; Indifference graph; Treewidth; Discrete mathematics; Partial k-tree; Cograph; 1-planar graph; Graph; Line graph","score_opus":0.01724167408746066,"score_gpt":0.2901345644692842,"score_spread":0.27289289038182357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059857922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010513957,0.000012885447,0.9415747,0.0003888391,0.000032193006,0.00046793505,0.0000017386318,0.0002796854,0.046728097],"genre_scores_gemma":[0.71426487,0.0000050638732,0.28516737,0.0003472554,0.000013439566,0.000045005876,0.000005121867,0.00001348622,0.00013839247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986028,0.000016715274,0.00023760094,0.0003353239,0.00047184067,0.0003357175],"domain_scores_gemma":[0.99885124,0.00016050972,0.00009862018,0.00074512576,0.000045133016,0.00009935859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028962846,0.00017152492,0.00017740179,0.00016335204,0.00013767058,0.00012353543,0.0007568746,0.00005297187,0.000013213413],"category_scores_gemma":[0.000051224775,0.00014111416,0.00006614865,0.0005091959,0.000053630552,0.00019633726,0.00007588518,0.00017803427,0.00018714809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072059665,0.0000851759,5.8612005e-7,0.000018554294,0.0000054184834,0.000003874231,0.0009439469,0.000110612826,0.0060553188,0.9819748,0.000095604686,0.0106989425],"study_design_scores_gemma":[0.00022533664,0.00011607052,0.00006221687,0.000019599986,0.000003394415,0.000004933153,0.000086061875,0.009462688,0.006201826,0.9835853,0.00006009569,0.00017246399],"about_ca_topic_score_codex":1.566593e-7,"about_ca_topic_score_gemma":1.912318e-7,"teacher_disagreement_score":0.7037509,"about_ca_system_score_codex":0.000027576181,"about_ca_system_score_gemma":0.000021164318,"threshold_uncertainty_score":0.57544684},"labels":[],"label_agreement":null},{"id":"W2060148847","doi":"10.1016/s1570-8667(03)00002-9","title":"Algorithms for shortest paths and d-cycle problems","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Shortest path problem; Cyclomatic complexity; Mathematics; Yen's algorithm; Path (computing); Widest path problem; Combinatorics; Graph; Shortest Path Faster Algorithm; Algorithm; K shortest path routing; Dijkstra's algorithm; Computer science; Discrete mathematics; Software","score_opus":0.026545878178149074,"score_gpt":0.3063723455624698,"score_spread":0.2798264673843207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060148847","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037531438,0.0020225265,0.99230915,0.00051799114,0.00042791018,0.000351278,0.0000135462005,0.00003071753,0.0005737133],"genre_scores_gemma":[0.2107419,0.0005344164,0.78776723,0.00016429204,0.0002868974,0.000037157653,0.0000019943318,0.000049719216,0.000416402],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979171,0.0001430601,0.00055434863,0.0003282449,0.0005465724,0.0005106379],"domain_scores_gemma":[0.9982208,0.0003384313,0.00032590464,0.00038509385,0.00039923386,0.0003305195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015631198,0.00020714736,0.00036349104,0.0002489941,0.00019611107,0.00020965553,0.00075976964,0.00007897602,0.000009389298],"category_scores_gemma":[0.00030348697,0.00016262587,0.00018197649,0.0004293251,0.00014029857,0.0011009756,0.000121162004,0.00033265734,0.000003355064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012011921,0.00060273486,0.0022075782,0.00020045614,0.0005169209,0.00035958525,0.0028935429,0.0022711004,0.008954155,0.24393941,0.0018605079,0.7360739],"study_design_scores_gemma":[0.005196482,0.0038764891,0.0013777538,0.00026048775,0.00008025668,0.0023164507,0.000583625,0.1850818,0.008690463,0.74367476,0.047775194,0.0010862374],"about_ca_topic_score_codex":0.0000024458327,"about_ca_topic_score_gemma":0.0000015849977,"teacher_disagreement_score":0.7349877,"about_ca_system_score_codex":0.000047542104,"about_ca_system_score_gemma":0.00013268343,"threshold_uncertainty_score":0.6631691},"labels":[],"label_agreement":null},{"id":"W2060176530","doi":"10.1016/j.disc.2007.12.053","title":"Claw-free graphs are not universal fixers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.035678591440143834,"score_gpt":0.27477813120168937,"score_spread":0.23909953976154552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060176530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10326828,0.000091574904,0.8776703,0.0014011043,0.00021991422,0.00041210814,0.000034066787,0.00054550415,0.016357131],"genre_scores_gemma":[0.7082906,0.00009247921,0.2886162,0.00028694465,0.000042510594,0.00002099587,0.000005128979,0.000047384325,0.0025977588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820215,0.00006798358,0.00026098668,0.000367873,0.00062826043,0.00047273055],"domain_scores_gemma":[0.99767876,0.0002620489,0.00015080422,0.0016194102,0.00010818733,0.00018081184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002710452,0.00020441435,0.00026482015,0.00020151529,0.0002980723,0.000067273744,0.0022260088,0.000073433395,0.000031588217],"category_scores_gemma":[0.00023280554,0.00017978656,0.00015152765,0.0006836847,0.00032300333,0.0005151166,0.00071580656,0.00024883583,0.00013425693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010015977,0.000086660904,0.00028919123,0.00005850334,0.00003193065,0.0001880963,0.0026414995,0.000080023594,0.0003449871,0.99377006,0.0021427278,0.00035631968],"study_design_scores_gemma":[0.0012804614,0.00014861878,0.0010573096,0.00010802504,0.000015414395,0.00020662181,0.0012672235,0.0372933,0.0045733307,0.9510714,0.0022802728,0.00069805165],"about_ca_topic_score_codex":0.000003620273,"about_ca_topic_score_gemma":0.0000043144964,"teacher_disagreement_score":0.6050223,"about_ca_system_score_codex":0.00004520861,"about_ca_system_score_gemma":0.00005275013,"threshold_uncertainty_score":0.7331483},"labels":[],"label_agreement":null},{"id":"W2060658636","doi":"","title":"Complexity of generalized colourings of chordal graphs","year":2008,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Split graph; Treewidth; Pathwidth; Indifference graph; Discrete mathematics; Interval graph; Time complexity; Graph; 1-planar graph; Line graph","score_opus":0.02899952163028764,"score_gpt":0.2599973221002231,"score_spread":0.23099780046993545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060658636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804619,0.00023995356,0.006381766,0.00003402914,0.00037058504,0.0004620312,0.00009103964,0.00012089949,0.0118378],"genre_scores_gemma":[0.970515,0.0008488051,0.015890002,0.000022274573,0.000027247348,0.0000022788163,0.00034621166,0.000047726633,0.01230043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777234,0.00022697492,0.0003545561,0.0005991724,0.00065416755,0.0003927794],"domain_scores_gemma":[0.9977531,0.000120962,0.0005235924,0.00087920896,0.00055905565,0.00016407232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017022887,0.000310419,0.0006468567,0.0013718236,0.00017669398,0.000015202063,0.002335849,0.00028065048,0.00006011931],"category_scores_gemma":[0.00004329601,0.00036817152,0.00035979395,0.002110092,0.0004984757,0.00043941376,0.0002645298,0.00042991608,0.000009107531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015371256,0.0006490067,0.061617523,0.0007510315,0.0005219408,0.00047884675,0.000509578,0.0002851197,0.0015481096,0.9223568,0.0062719844,0.003472954],"study_design_scores_gemma":[0.014094365,0.0021928255,0.026155025,0.0011728603,0.00043655818,2.1957534e-7,0.024137879,0.003360394,0.5673721,0.25950345,0.0971475,0.004426831],"about_ca_topic_score_codex":0.0002960223,"about_ca_topic_score_gemma":0.008301853,"teacher_disagreement_score":0.6628533,"about_ca_system_score_codex":0.000091974696,"about_ca_system_score_gemma":0.00027533364,"threshold_uncertainty_score":0.99987704},"labels":[],"label_agreement":null},{"id":"W2060877605","doi":"10.1006/jctb.2001.2032","title":"Matroid 4-Connectivity: A Deletion–Contraction Theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Mathematics; Element (criminal law); Contraction (grammar); Discrete mathematics","score_opus":0.01198728508842466,"score_gpt":0.269787487247202,"score_spread":0.2578002021587773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060877605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2908029,0.00063441467,0.6867905,0.002066777,0.0098928455,0.0002854587,0.0000017747735,0.00015897729,0.009366293],"genre_scores_gemma":[0.9949049,0.00020330738,0.0035254126,0.000102304664,0.0008356236,0.00000588143,3.9363735e-7,0.00002176829,0.00040040593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972583,0.00085916044,0.00054729555,0.00023335108,0.0006899855,0.0004119051],"domain_scores_gemma":[0.9972033,0.00086728495,0.00054360833,0.00052496884,0.00065693824,0.00020393363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036107444,0.00020549262,0.00039602726,0.00034775786,0.0002669392,0.00023056265,0.0011650687,0.00011121652,0.00010587843],"category_scores_gemma":[0.0008820011,0.00017350323,0.0002422976,0.0007019403,0.0002038766,0.0031343282,0.00017650268,0.0005831366,0.000026085874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015326004,0.00015578668,0.0001393359,0.000005504676,0.00006837049,0.0001665136,0.0002590793,0.000059091137,0.0034527273,0.97876036,0.00014065189,0.015259975],"study_design_scores_gemma":[0.0012673642,0.0008381757,0.00025653283,0.000029670115,0.000014155287,0.0015255458,0.00018835114,0.00007508971,0.005921655,0.9677757,0.021926444,0.0001813108],"about_ca_topic_score_codex":0.0000014112283,"about_ca_topic_score_gemma":8.883535e-7,"teacher_disagreement_score":0.704102,"about_ca_system_score_codex":0.00014384602,"about_ca_system_score_gemma":0.0001683321,"threshold_uncertainty_score":0.7075256},"labels":[],"label_agreement":null},{"id":"W2061151678","doi":"10.7151/dmgt.1503","title":"Structure of the set of all minimal total dominating functions of some classes of graphs","year":2010,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Set (abstract data type); Discrete mathematics; Graph; Vertex (graph theory); Computer science","score_opus":0.0143643200391098,"score_gpt":0.2804135836343913,"score_spread":0.26604926359528147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061151678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9798976,0.00007931565,0.018668214,0.00016305223,0.0002930933,0.00038511647,0.00012955473,0.000029536095,0.00035448823],"genre_scores_gemma":[0.9825859,0.0000047981603,0.017239537,0.000008212082,0.000015492285,0.000012045118,0.0000031052698,0.000019951955,0.000110949484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974317,0.0003676521,0.00085351296,0.00032288567,0.00071769266,0.00030656627],"domain_scores_gemma":[0.9960583,0.0012443762,0.0008566257,0.0014693228,0.00028695338,0.00008440841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001014805,0.00023141343,0.0005661884,0.000414537,0.00011465999,0.000012755821,0.0015682648,0.00012767431,0.000099161916],"category_scores_gemma":[0.000722097,0.00012246607,0.00044738775,0.0010870751,0.0013671549,0.0003925081,0.0006309123,0.00037086915,0.0000011462294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040248196,0.00012404718,0.0003651914,0.00029186232,0.00006404797,3.5467318e-7,0.0019150882,0.000018446231,0.36131272,0.6346544,0.000013471083,0.0012001033],"study_design_scores_gemma":[0.00028735795,0.00009206761,0.0030037235,0.00016927035,0.00003782706,0.000015217724,0.001371425,0.00027413547,0.19125023,0.8033747,0.0000051940083,0.00011884722],"about_ca_topic_score_codex":0.0000025244174,"about_ca_topic_score_gemma":0.00000420711,"teacher_disagreement_score":0.17006248,"about_ca_system_score_codex":0.0000047934836,"about_ca_system_score_gemma":0.00007532963,"threshold_uncertainty_score":0.50373393},"labels":[],"label_agreement":null},{"id":"W2061237693","doi":"10.1007/s10107-005-0649-5","title":"Independent packings in structured graphs","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Indifference graph; Pathwidth; Mathematics; Cograph; Clique-sum; Split graph; 1-planar graph; Maximal independent set; Modular decomposition; Disjoint sets; Discrete mathematics; Interval graph; Treewidth; Partial k-tree; Graph; Line graph","score_opus":0.02153618353391824,"score_gpt":0.30257266948494643,"score_spread":0.2810364859510282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061237693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12103454,0.00014201833,0.87399423,0.000980369,0.000058919744,0.0006693223,4.633225e-7,0.00038548108,0.002734678],"genre_scores_gemma":[0.69807446,0.0000015954154,0.3017081,0.00006405286,0.000019279165,0.00004766318,4.5863374e-7,0.0000115329385,0.000072843264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980272,0.00008056299,0.0003456389,0.00039936212,0.00053504494,0.00061219616],"domain_scores_gemma":[0.9989996,0.00019635796,0.00006040961,0.0005454216,0.00004469312,0.00015349836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007594596,0.00016059355,0.00021905424,0.00026563957,0.00008007073,0.00020152381,0.00092852063,0.000079991136,0.000053940053],"category_scores_gemma":[0.00021459904,0.00013620938,0.00008302814,0.00077523506,0.000104540755,0.0005227067,0.00034970624,0.00036359596,0.00012152096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004619879,0.0000963061,0.00024908723,0.000029952698,0.0000052631276,0.000020579833,0.00071461784,0.000034547837,0.00025884286,0.6618151,0.0000071346126,0.33676392],"study_design_scores_gemma":[0.00041798697,0.00006516153,0.00041728793,0.0000573342,0.0000021750775,0.00004179875,0.00009599166,0.017917562,0.0021147595,0.97644895,0.0021853421,0.00023565971],"about_ca_topic_score_codex":0.0000022230222,"about_ca_topic_score_gemma":0.000016293376,"teacher_disagreement_score":0.5770399,"about_ca_system_score_codex":0.00007076866,"about_ca_system_score_gemma":0.000023343573,"threshold_uncertainty_score":0.55544573},"labels":[],"label_agreement":null},{"id":"W2061275745","doi":"10.1016/j.jctb.2011.06.004","title":"On the maximum size of a minimal k-edge connected augmentation","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Simple (philosophy); Mathematics; Undirected graph; Graph; Generalization; Enhanced Data Rates for GSM Evolution; Connectivity; Vertex connectivity; Simple graph; Degree (music); Discrete mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.025940067529460615,"score_gpt":0.2665166091183068,"score_spread":0.2405765415888462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061275745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95074344,0.00013622217,0.03097588,0.00062822696,0.0058945953,0.0003771546,0.0000050828735,0.000046784164,0.011192639],"genre_scores_gemma":[0.9967762,0.00001630054,0.0028787307,0.0000847071,0.00011764267,0.000004713247,1.6353468e-7,0.000012265363,0.000109253444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770844,0.00080566684,0.0005320168,0.0001442043,0.00057283,0.00023682178],"domain_scores_gemma":[0.9960644,0.0022357223,0.00062357885,0.00045250572,0.0005262693,0.00009751241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023257586,0.00014725233,0.0002898365,0.00014540533,0.00013307821,0.00004683816,0.001374095,0.00006409504,0.00025075488],"category_scores_gemma":[0.0016551107,0.000096795506,0.00016102119,0.00048152427,0.0003349953,0.0007768371,0.0001678258,0.0003375971,0.000008606065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002797935,0.0001808206,0.000035284902,0.0000083049445,0.0000708086,0.00002635024,0.0021090352,0.000003476746,0.0043603526,0.9890061,0.0001769526,0.0012245479],"study_design_scores_gemma":[0.0011129061,0.0020545798,0.00045935035,0.000038853515,0.000011599155,0.000047571833,0.00054733286,0.000012185707,0.066576354,0.9287548,0.00029009784,0.00009439124],"about_ca_topic_score_codex":0.0000014390293,"about_ca_topic_score_gemma":2.819202e-7,"teacher_disagreement_score":0.062216,"about_ca_system_score_codex":0.0000452357,"about_ca_system_score_gemma":0.00013608365,"threshold_uncertainty_score":0.3947206},"labels":[],"label_agreement":null},{"id":"W2061450212","doi":"10.1017/s0963548312000272","title":"Connectivity for Bridge-Addable Monotone Graph Classes","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Monotone polygon; Mathematics; Vertex (graph theory); Graph; Monotonic function; Discrete mathematics; Geometry","score_opus":0.058127070442409265,"score_gpt":0.3213482555105076,"score_spread":0.26322118506809833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061450212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33122182,0.00035252285,0.66526973,0.00021380867,0.0009733081,0.00097616203,0.000003662314,0.00042759895,0.0005613614],"genre_scores_gemma":[0.9566357,0.0000056932613,0.043009464,0.00008001418,0.000115085386,0.00007804667,0.000004293427,0.000029345112,0.00004235572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964731,0.00037939302,0.00048506708,0.0008174462,0.0004943235,0.0013506811],"domain_scores_gemma":[0.99529,0.0021943056,0.00022188082,0.001348683,0.00056597777,0.0003791919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003909139,0.00031946023,0.0004521012,0.00020514736,0.00070707727,0.00019720875,0.0015218762,0.00013999057,0.0000032791534],"category_scores_gemma":[0.0015184912,0.0003322678,0.00022593715,0.0014575935,0.000207139,0.0012775116,0.0010808599,0.00043278848,0.000019965346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001822068,0.00064840866,0.044066105,0.00014520016,0.000026537613,9.497818e-7,0.00042464517,0.00029508225,0.00028461244,0.9446772,0.00020180519,0.009211255],"study_design_scores_gemma":[0.0007726334,0.00018560438,0.023891121,0.000024839193,0.00000829767,0.000013134455,0.000017274975,0.031028949,0.0040340843,0.9381378,0.0014502342,0.0004360288],"about_ca_topic_score_codex":0.00001737788,"about_ca_topic_score_gemma":0.000001997587,"teacher_disagreement_score":0.6254139,"about_ca_system_score_codex":0.00031037495,"about_ca_system_score_gemma":0.00013259621,"threshold_uncertainty_score":0.9999129},"labels":[],"label_agreement":null},{"id":"W2061817817","doi":"10.1016/j.aim.2012.10.006","title":"Corrigendum to “Polytopes of high rank for the symmetric groups” [Adv. Math. 228 (2011) 3207–3222]","year":2012,"lang":"en","type":"erratum","venue":"Advances in Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Polytope; Rank (graph theory); Pure mathematics; Combinatorics","score_opus":0.03295857409913792,"score_gpt":0.314688810456261,"score_spread":0.2817302363571231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061817817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005390855,0.034365304,0.931492,0.00041528672,0.024836292,0.0025453242,0.0001385959,0.00013589775,0.00601741],"genre_scores_gemma":[0.006294781,0.018000511,0.8254122,0.00048286433,0.0022368033,0.0021154613,0.0000943932,0.00038529397,0.14497766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953241,0.00015362573,0.0012266914,0.000822144,0.0012332335,0.0012402019],"domain_scores_gemma":[0.99320275,0.0026506535,0.0008728008,0.0026696934,0.0003842736,0.00021983401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002052399,0.0006624783,0.0012477301,0.0010446176,0.00023154274,0.00012280342,0.00526194,0.0003835196,0.000060563758],"category_scores_gemma":[0.0011618716,0.00047261734,0.00031445175,0.0019527322,0.00031613503,0.0009861244,0.0011754321,0.0010054017,0.0001842426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003762647,0.0003215049,0.000019601535,0.001762158,0.000079007776,0.000007930986,0.0012650844,0.00024680683,0.000020203726,0.8951911,0.042118575,0.05893043],"study_design_scores_gemma":[0.0005663244,0.00027004565,0.000103008184,0.0005970761,0.00006933773,0.000021863683,0.00030240137,0.011758762,0.00028042024,0.6073571,0.37791538,0.0007582753],"about_ca_topic_score_codex":0.000017070712,"about_ca_topic_score_gemma":0.000049485647,"teacher_disagreement_score":0.3357968,"about_ca_system_score_codex":0.00017290688,"about_ca_system_score_gemma":0.0001790168,"threshold_uncertainty_score":0.99977255},"labels":[],"label_agreement":null},{"id":"W206221419","doi":"","title":"A note on critical sets","year":2002,"lang":"es","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Counterexample; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.06425381317664465,"score_gpt":0.37009303445390607,"score_spread":0.30583922127726143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206221419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41849723,0.0046140286,0.183994,0.18992503,0.012648868,0.0044509596,0.000462266,0.0033224255,0.1820852],"genre_scores_gemma":[0.9871303,0.00012396486,0.007564445,0.0008461052,0.00018180192,0.000023429979,0.0000023104383,0.00004404328,0.0040836437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577934,0.00040050916,0.00042612123,0.0010097284,0.0010316222,0.0013526625],"domain_scores_gemma":[0.9961168,0.0014772543,0.00007499208,0.0015625337,0.00019361322,0.00057481625],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043778404,0.00043210344,0.00040761585,0.00031530633,0.00037650112,0.00056161964,0.0017933758,0.0002582501,0.0015122237],"category_scores_gemma":[0.0006436856,0.00042995508,0.00022051731,0.0009540062,0.0007171338,0.00065634004,0.0005107869,0.0011262032,0.008086297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044520333,0.00077455275,0.00094314606,0.00010130017,0.000037557158,0.0006280225,0.0005129736,0.00015299873,0.0005096244,0.92019415,0.016429894,0.059671286],"study_design_scores_gemma":[0.0050899796,0.0075566694,0.025356574,0.0017412929,0.00013828492,0.00061017706,0.00012550743,0.20171808,0.0162152,0.5324306,0.20474333,0.0042743166],"about_ca_topic_score_codex":0.000010299448,"about_ca_topic_score_gemma":0.0000020997097,"teacher_disagreement_score":0.568633,"about_ca_system_score_codex":0.00011164027,"about_ca_system_score_gemma":0.00004509684,"threshold_uncertainty_score":0.9998152},"labels":[],"label_agreement":null},{"id":"W2062277114","doi":"10.1016/s0012-365x(02)00806-3","title":"Changing upper irredundance by edge addition","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of South Africa; National Research Foundation","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Vertex (graph theory); Graph; Discrete mathematics; Computer science","score_opus":0.01799772471379416,"score_gpt":0.2838632688220105,"score_spread":0.26586554410821633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062277114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043563466,0.00019194656,0.9762372,0.00015718932,0.00013476578,0.00020174113,0.000018518209,0.0001639047,0.018538397],"genre_scores_gemma":[0.49665233,0.000051124425,0.4945405,0.00034763722,0.00006859209,0.00014449305,0.000032832995,0.000071534814,0.008090952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857104,0.000075261894,0.00021449251,0.00029678506,0.00035785587,0.00048457316],"domain_scores_gemma":[0.99890655,0.00016417146,0.00009048702,0.0006702656,0.000060600334,0.000107893015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049095927,0.00015501524,0.00016380429,0.00013806937,0.00019741448,0.00014671337,0.0006173721,0.000047736223,0.00010494745],"category_scores_gemma":[0.00021121361,0.00013807905,0.00007344657,0.0006073712,0.00008165657,0.000497328,0.00013416793,0.00014813466,0.00021553437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.912711e-7,0.000052220257,0.000012794396,0.000051214545,0.000010902613,0.000004447377,0.0015653671,0.00001267676,0.0014185472,0.99259156,0.00190451,0.0023747936],"study_design_scores_gemma":[0.0004298627,0.000078995305,0.000012489929,0.00014715095,0.000008566724,0.000056503257,0.0010342594,0.029327033,0.043123994,0.89453834,0.030673556,0.0005692776],"about_ca_topic_score_codex":2.1883767e-7,"about_ca_topic_score_gemma":2.0019453e-7,"teacher_disagreement_score":0.49229598,"about_ca_system_score_codex":0.00003899723,"about_ca_system_score_gemma":0.000025504673,"threshold_uncertainty_score":0.56307006},"labels":[],"label_agreement":null},{"id":"W2062659098","doi":"10.1007/s00453-010-9442-9","title":"Complexity of Finding Graph Roots with Girth Conditions","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics; Graph; Theory of computation; Graph power; Line graph; Algorithm","score_opus":0.03151075115654251,"score_gpt":0.30656467509930185,"score_spread":0.27505392394275935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062659098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2749002,0.000019357167,0.7206496,0.00054840825,0.00023276485,0.00025702085,0.00004436224,0.0001707915,0.0031775043],"genre_scores_gemma":[0.8179756,0.0000012585695,0.18183959,0.000036030884,0.000029195107,0.000014531469,0.000006520151,0.000008946386,0.00008833094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882334,0.000051381285,0.00016358006,0.00030956944,0.00033355987,0.0003185403],"domain_scores_gemma":[0.9987592,0.00017038516,0.000088728324,0.00069691765,0.00015860386,0.00012615457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002314643,0.00011600827,0.00016677113,0.00021096284,0.00018393039,0.000042000338,0.0009042229,0.000047806407,0.00006921997],"category_scores_gemma":[0.000040683994,0.00009795212,0.000055594417,0.0007561777,0.0006669929,0.00037390296,0.00019109264,0.00035258228,0.000026319869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010424505,0.00010332927,0.0013225944,0.000011843604,0.00003432478,0.000020757134,0.00015291995,0.00003290165,0.021752937,0.96612793,0.0001643275,0.010265679],"study_design_scores_gemma":[0.0010330521,0.0003273992,0.046950348,0.000037121827,0.000011513802,0.0001389188,0.000060598766,0.014760015,0.07020706,0.8647317,0.0012956419,0.0004465777],"about_ca_topic_score_codex":0.000020888794,"about_ca_topic_score_gemma":0.00005231341,"teacher_disagreement_score":0.5430754,"about_ca_system_score_codex":0.000008801457,"about_ca_system_score_gemma":0.000064938096,"threshold_uncertainty_score":0.39943716},"labels":[],"label_agreement":null},{"id":"W2062725515","doi":"10.1016/j.crma.2010.06.022","title":"Inversion dans les tournois","year":2010,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Humanities; Physics; Philosophy","score_opus":0.034483484929260635,"score_gpt":0.29527650946981404,"score_spread":0.2607930245405534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062725515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3817104,0.0050490675,0.54651105,0.013294983,0.006069165,0.0007095021,0.00006100776,0.000570607,0.04602418],"genre_scores_gemma":[0.7674978,0.0012342385,0.1916436,0.00052228884,0.0008702909,0.00007462545,0.000026093549,0.00012386355,0.038007222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99662596,0.0004898976,0.00051965495,0.00078626425,0.00062383444,0.0009543829],"domain_scores_gemma":[0.99661756,0.00069048454,0.00023841212,0.0016337222,0.00032416303,0.0004956671],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009106754,0.00043686398,0.00042842428,0.00029606768,0.0005595276,0.0004361387,0.002328905,0.00048181578,0.0024604276],"category_scores_gemma":[0.0003896724,0.0004496277,0.00021646473,0.0008846942,0.0008518351,0.0010968129,0.0012176767,0.0020982625,0.0020848399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001854034,0.0002886521,0.0029195738,0.00020837373,0.00004710942,0.00021240435,0.0044299914,0.00018362117,0.06544963,0.7845409,0.03414358,0.10755766],"study_design_scores_gemma":[0.0010284288,0.00041101364,0.0075301826,0.00057355926,0.00003982493,0.00070026173,0.00064927107,0.20789506,0.06286942,0.25932163,0.4575526,0.0014287101],"about_ca_topic_score_codex":0.00032664175,"about_ca_topic_score_gemma":0.00044183547,"teacher_disagreement_score":0.5252192,"about_ca_system_score_codex":0.00011997031,"about_ca_system_score_gemma":0.00025973117,"threshold_uncertainty_score":0.99979556},"labels":[],"label_agreement":null},{"id":"W2063676786","doi":"10.5539/jmr.v2n4p79","title":"On Tape Graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Ribbon; Indifference graph; 1-planar graph; Chordal graph; Graph; Representation (politics); Discrete mathematics; Geometry","score_opus":0.08339038348370366,"score_gpt":0.4216306515457202,"score_spread":0.33824026806201657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063676786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75572646,0.00011101875,0.21666305,0.003130343,0.000911357,0.00038032446,0.0000017814591,0.000055514673,0.023020128],"genre_scores_gemma":[0.80100876,0.000050827763,0.197996,0.000049950377,0.00012176665,0.000005991525,9.681874e-8,0.000023135142,0.00074344035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961731,0.00023876478,0.00046622197,0.0001781787,0.0024141318,0.0005295978],"domain_scores_gemma":[0.9948017,0.0026206532,0.00020030417,0.0008833104,0.0011925563,0.00030148425],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.008646354,0.00011070887,0.00024169937,0.0011661411,0.00020797274,0.00023969552,0.0027743084,0.00008687508,0.000120138226],"category_scores_gemma":[0.002790728,0.00007953167,0.00014769576,0.0011106108,0.000263457,0.00045654507,0.00037369662,0.0023458742,0.00020918783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015753787,0.00034960546,0.000028082537,0.000032861157,0.000020503927,0.00011217078,0.0004847709,0.000018691684,0.023383696,0.96644515,0.002347708,0.006761026],"study_design_scores_gemma":[0.00032244704,0.0004898846,0.00008398782,0.00005694424,0.0000014372479,0.00025935846,0.000114173075,0.0032831316,0.009758986,0.9838008,0.0017431974,0.0000856362],"about_ca_topic_score_codex":8.867939e-7,"about_ca_topic_score_gemma":0.0000028159034,"teacher_disagreement_score":0.045282304,"about_ca_system_score_codex":0.000035989575,"about_ca_system_score_gemma":0.00021204242,"threshold_uncertainty_score":0.9999558},"labels":[],"label_agreement":null},{"id":"W2063861912","doi":"10.1016/j.jda.2012.06.001","title":"Acyclic colorings of graph subdivisions revisited","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Subdivision; Directed acyclic graph; Graph coloring; Complete coloring; Edge coloring; List coloring; Greedy coloring; Discrete mathematics; Graph; Graph power; Line graph","score_opus":0.026209169668095143,"score_gpt":0.32118895212746473,"score_spread":0.29497978245936957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063861912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14096622,0.0044806786,0.8505506,0.0008806826,0.000617844,0.00024126176,0.000015799505,0.000046871442,0.0022000705],"genre_scores_gemma":[0.90004635,0.0003652693,0.099240355,0.000058656813,0.0001588368,0.0000024253848,8.82109e-7,0.00001544213,0.00011176497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977504,0.00018619861,0.00064483285,0.00015051427,0.00078527123,0.00048279442],"domain_scores_gemma":[0.9978638,0.0003141065,0.0005965376,0.00049341307,0.00036806797,0.00036405068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015476758,0.00014924999,0.00038791896,0.00049145747,0.000099371406,0.000049249804,0.0013067854,0.000061593244,0.000028680348],"category_scores_gemma":[0.00026760742,0.00011344636,0.00028530927,0.0011465466,0.00014388005,0.0017363684,0.0003173272,0.00040277393,0.000012676372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003703973,0.0014365842,0.05239205,0.00026023143,0.0010062446,0.00023306509,0.005287776,0.00037594163,0.06877171,0.6750771,0.0046136505,0.19017525],"study_design_scores_gemma":[0.010103395,0.007070993,0.27622652,0.0019542123,0.000421134,0.0030087165,0.0018817205,0.013633796,0.17125426,0.43884557,0.07265858,0.0029411113],"about_ca_topic_score_codex":0.000003547122,"about_ca_topic_score_gemma":1.8316426e-7,"teacher_disagreement_score":0.7590802,"about_ca_system_score_codex":0.00003904931,"about_ca_system_score_gemma":0.000056235,"threshold_uncertainty_score":0.46262085},"labels":[],"label_agreement":null},{"id":"W2064696340","doi":"10.1016/j.disc.2011.08.022","title":"List monopolar partitions of claw-free graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Graph; Discrete mathematics; Claw","score_opus":0.05239536688332093,"score_gpt":0.29177298737165336,"score_spread":0.23937762048833244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064696340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037216812,0.00013146036,0.9148537,0.00015132152,0.000107933934,0.00031009072,0.000039362745,0.00019361732,0.046995725],"genre_scores_gemma":[0.60795766,0.000023243587,0.39166373,0.00003178718,0.000009754077,0.000030519048,0.0000026614114,0.000018404136,0.00026225168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987442,0.000057016598,0.00034285846,0.00022138623,0.00033429253,0.00030024003],"domain_scores_gemma":[0.997931,0.00013247048,0.00014754233,0.0015601586,0.000114587056,0.0001142388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036754843,0.00013216103,0.0002133868,0.00015093536,0.00010287362,0.00003599664,0.0016533309,0.000049192196,0.000091582566],"category_scores_gemma":[0.00019796463,0.00011269102,0.00012491802,0.0005283543,0.0002530439,0.00037452753,0.00049216294,0.0001374778,0.00004375128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028563952,0.00011171205,0.00020413949,0.00006098967,0.000020833566,0.0000053912177,0.0027545097,0.0000025005988,0.0006821697,0.9956459,0.00022860254,0.0002803984],"study_design_scores_gemma":[0.00016370184,0.00007728305,0.00021644136,0.000038569644,0.000008816908,0.0000071804575,0.00024259437,0.0029777952,0.010369132,0.985611,0.00015494614,0.00013250877],"about_ca_topic_score_codex":0.000011855228,"about_ca_topic_score_gemma":0.000009166316,"teacher_disagreement_score":0.5707408,"about_ca_system_score_codex":0.000011124958,"about_ca_system_score_gemma":0.00002652288,"threshold_uncertainty_score":0.45954064},"labels":[],"label_agreement":null},{"id":"W2064861714","doi":"10.1006/jctb.2002.2127","title":"A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Property (philosophy); Mathematics; Characterization (materials science); Minor (academic); Combinatorics; Flow (mathematics); Binary number; Graphic matroid; Set (abstract data type); Discrete mathematics; Computer science; Arithmetic; Law; Physics; Philosophy; Geometry","score_opus":0.01270040050646915,"score_gpt":0.22484422133202656,"score_spread":0.2121438208255574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064861714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91869324,0.00028190122,0.06841832,0.0055359052,0.003562889,0.0012483915,0.000016145212,0.00003726906,0.002205933],"genre_scores_gemma":[0.9977434,0.000028610953,0.0009053301,0.00004135925,0.00018497152,0.000008845189,3.4546153e-7,0.000018961135,0.0010681724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973882,0.00070997805,0.00055601314,0.0001610402,0.0009266962,0.0002581043],"domain_scores_gemma":[0.99755937,0.00020179396,0.00066659006,0.0007152495,0.0007824046,0.000074573116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016760139,0.00017968677,0.00038501754,0.000118546595,0.00018036267,0.0000706529,0.0019129801,0.000068277506,0.00003771798],"category_scores_gemma":[0.00017269365,0.00007589178,0.0001751305,0.0007641565,0.0005982553,0.0010134411,0.00027909703,0.0003932453,9.2769875e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029738566,0.00074973796,0.0010016803,0.0001480221,0.0003500224,0.000036345402,0.00557303,0.00032412732,0.08084166,0.87708837,0.00040833934,0.030504785],"study_design_scores_gemma":[0.0030696373,0.005022225,0.0033462488,0.0005161821,0.00013076012,0.00084822666,0.00071126333,0.0019948618,0.49303696,0.47762924,0.013150718,0.00054367364],"about_ca_topic_score_codex":6.1760613e-7,"about_ca_topic_score_gemma":7.148323e-7,"teacher_disagreement_score":0.4121953,"about_ca_system_score_codex":0.000044462657,"about_ca_system_score_gemma":0.000111228335,"threshold_uncertainty_score":0.3554825},"labels":[],"label_agreement":null},{"id":"W2065002346","doi":"10.1016/s0095-8956(02)00009-6","title":"Cliques in dense GF(q)-representable matroids","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Integer (computer science); Combinatorics; Finite field; Mathematics; Simple (philosophy); Minor (academic); GF(2); Discrete mathematics; Graphic matroid; Computer science; Humanities","score_opus":0.012786337624303767,"score_gpt":0.28651307951657945,"score_spread":0.2737267418922757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065002346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7632203,0.0035439625,0.16941388,0.0012753501,0.018246543,0.0006806271,0.000003412736,0.000184234,0.04343165],"genre_scores_gemma":[0.9887488,0.00015737834,0.010128886,0.000076491415,0.00018932272,0.0000053424596,1.727039e-7,0.000020481602,0.00067314657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967244,0.0013527194,0.00064703915,0.00022369098,0.0005950234,0.0004571248],"domain_scores_gemma":[0.9979411,0.0006235413,0.00032874124,0.0005574742,0.00036396677,0.00018517787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042711766,0.00018223867,0.00041282343,0.00039667008,0.00011304859,0.00017066173,0.0012208867,0.000096020805,0.00007894547],"category_scores_gemma":[0.0012239076,0.00015872852,0.00016054424,0.0007773798,0.00019067833,0.0020739855,0.0001887514,0.0005647316,0.000013453956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004865984,0.00014183646,0.0011720904,0.000008910676,0.00002643485,0.00020016645,0.00037553557,0.00007692863,0.0013503778,0.99519676,0.00024992303,0.0007144277],"study_design_scores_gemma":[0.001276347,0.0005419147,0.00015188847,0.000037142116,0.0000044828985,0.00032741483,0.000262884,0.00001399041,0.025213506,0.9597164,0.012295954,0.00015807684],"about_ca_topic_score_codex":0.000002485596,"about_ca_topic_score_gemma":0.0000014215505,"teacher_disagreement_score":0.22552843,"about_ca_system_score_codex":0.00012490516,"about_ca_system_score_gemma":0.00025308065,"threshold_uncertainty_score":0.64727616},"labels":[],"label_agreement":null},{"id":"W2065074947","doi":"10.1016/j.dam.2005.02.013","title":"On uniform k-partition problems","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Partition (number theory); Cardinality (data modeling); Combinatorics; Partition problem; Discrete mathematics; Scheduling (production processes); Set (abstract data type); Mathematical optimization; Computer science; Data mining","score_opus":0.021193475896767008,"score_gpt":0.2787988693872797,"score_spread":0.2576053934905127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065074947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00862332,0.000012307411,0.89691895,0.00048798672,0.000029929586,0.0004323741,0.0000029175078,0.00027839706,0.09321379],"genre_scores_gemma":[0.6211552,0.000010815636,0.3778523,0.00026965144,0.000055841676,0.00014167465,0.000007153482,0.000026605,0.00048073247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986137,0.0000114002205,0.0002637879,0.00029768297,0.0004401713,0.00037324618],"domain_scores_gemma":[0.99881357,0.00015631478,0.00009874914,0.0007850297,0.000037574504,0.00010878813],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003545647,0.0001626119,0.000163978,0.00011823697,0.00013411582,0.000111083355,0.00074027077,0.00005380146,0.000044963686],"category_scores_gemma":[0.00002993247,0.00013334562,0.000053464013,0.00035513547,0.00006673455,0.0002791056,0.0001843547,0.00018302041,0.00086415873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003642869,0.000086434884,6.566772e-7,0.0000385019,0.0000074841982,9.578439e-7,0.0007242049,0.0017615196,0.0021553882,0.9861586,0.00022323588,0.008839386],"study_design_scores_gemma":[0.00029152774,0.00006196913,0.000007066459,0.00003281975,0.0000035311964,0.0000051527422,0.0000650658,0.06532605,0.012124529,0.9195334,0.0023413997,0.0002075409],"about_ca_topic_score_codex":2.8987864e-7,"about_ca_topic_score_gemma":0.0000022249105,"teacher_disagreement_score":0.6125319,"about_ca_system_score_codex":0.000056988538,"about_ca_system_score_gemma":0.00002094184,"threshold_uncertainty_score":0.9999138},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.02151688624129685,"score_gpt":0.2811482681370374,"score_spread":0.2596313818957406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065185671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62430775,0.000054185108,0.37306535,0.00075119786,0.00001785128,0.00081659545,0.0000010639208,0.000063115294,0.0009228604],"genre_scores_gemma":[0.9829362,0.000004537199,0.016819173,0.000042951997,0.0000075489174,0.00013423158,7.566504e-7,0.000016979306,0.00003760857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978693,0.0002322315,0.0004553606,0.00032253042,0.00042244318,0.00069813326],"domain_scores_gemma":[0.99637234,0.0022283953,0.00018468733,0.0010680641,0.000099448574,0.000047058384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001641637,0.00017472015,0.0002497526,0.00009665695,0.00009689821,0.000078986384,0.001276785,0.00004361198,0.000044370707],"category_scores_gemma":[0.0011314492,0.000113248905,0.000076345896,0.0007928454,0.00022963205,0.0002855293,0.00025999954,0.00050405454,0.000045103578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002860262,0.00012120948,0.000178963,0.000056749785,0.000014083485,4.0458812e-7,0.0017810946,0.0013133251,0.007403216,0.98746294,0.0000055317605,0.0016596018],"study_design_scores_gemma":[0.00020101918,0.000101959,0.00006945982,0.000057910947,0.0000015609528,0.0000017797997,0.00006307955,0.26924035,0.015035919,0.7151288,0.0000016855879,0.00009650505],"about_ca_topic_score_codex":0.00005188217,"about_ca_topic_score_gemma":0.00002739192,"teacher_disagreement_score":0.35862845,"about_ca_system_score_codex":0.00013522399,"about_ca_system_score_gemma":0.00008190373,"threshold_uncertainty_score":0.46181566},"labels":[],"label_agreement":null},{"id":"W2065242306","doi":"10.1016/s0020-0190(01)00325-8","title":"A note on the Consecutive Ones Submatrix problem","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Permutation (music); Completeness (order theory); Row; Property (philosophy); Logical matrix; Column (typography); Existential quantification; Mathematics; Integer (computer science); Binary number; Matrix (chemical analysis); Row and column spaces; Discrete mathematics; Computer science; Arithmetic; Group (periodic table); Chemistry; Database; Programming language; Philosophy","score_opus":0.022599517655816973,"score_gpt":0.26169837773065996,"score_spread":0.239098860074843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065242306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014987461,0.000044697586,0.9000389,0.071926534,0.00010924221,0.00046879414,0.0000031493341,0.0003606322,0.012060612],"genre_scores_gemma":[0.9649156,0.0000055603073,0.014283286,0.020596905,0.000026877424,0.000070755275,0.0000020843577,0.0000067660812,0.000092197406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988226,0.000067370696,0.00024640205,0.00012992539,0.00044447047,0.00028918617],"domain_scores_gemma":[0.9991443,0.00020492461,0.00016684766,0.00031381802,0.00012121943,0.000048902602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037973432,0.00011774022,0.000082371786,0.00019140777,0.00039905586,0.0004889725,0.0007225328,0.0000324862,0.000023266219],"category_scores_gemma":[0.00011149262,0.00008021254,0.000037290512,0.00063306186,0.00014586333,0.0030512488,0.000092686496,0.00024227671,0.00053028256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005377824,0.000084888554,0.00015611989,0.00021218482,0.000029660312,0.00001550555,0.05251423,0.003949943,0.002586592,0.3251785,0.031401545,0.583817],"study_design_scores_gemma":[0.0022559238,0.00033631126,0.00088524166,0.00062023755,0.000015687192,0.00018666784,0.0011824993,0.7551307,0.021253115,0.062865354,0.1537462,0.0015220727],"about_ca_topic_score_codex":0.0000020204536,"about_ca_topic_score_gemma":3.1226892e-7,"teacher_disagreement_score":0.9499281,"about_ca_system_score_codex":0.000054616736,"about_ca_system_score_gemma":0.000025497466,"threshold_uncertainty_score":0.6815886},"labels":[],"label_agreement":null},{"id":"W2065255395","doi":"10.1016/j.disopt.2009.01.004","title":"On the feedback vertex set polytope of a series–parallel graph","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Chordal graph; Polytope; Pathwidth; Indifference graph; Feedback vertex set; Discrete mathematics; Subdivision; Graph; Line graph","score_opus":0.016480448800378945,"score_gpt":0.2701992797922433,"score_spread":0.2537188309918643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065255395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00224272,0.0000473959,0.9860125,0.00419256,0.0000711274,0.00028128776,0.0000070895635,0.00007463003,0.007070678],"genre_scores_gemma":[0.90322816,0.00009695882,0.09507663,0.0008130573,0.00001740222,0.000017894079,0.000026721336,0.000014722997,0.0007084416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988312,0.00013432962,0.00018631617,0.00026778964,0.00034121377,0.00023911968],"domain_scores_gemma":[0.9989482,0.00011230313,0.00009598156,0.0006789694,0.00010573534,0.000058803224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025986845,0.00012463023,0.00012926818,0.00012273646,0.00015185367,0.000076840835,0.00080416095,0.00004533764,0.000056592096],"category_scores_gemma":[0.00011552829,0.000086952365,0.000070576665,0.00083210727,0.00009980366,0.000611685,0.000085114785,0.00012480721,0.000016812794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067145425,0.00002314793,0.000016295562,0.0000027021747,0.000007980218,0.0000017045151,0.0002729674,0.329119,0.00016735496,0.668322,0.00049356127,0.0015061127],"study_design_scores_gemma":[0.0006361553,0.00075095345,0.000995064,0.000055388973,0.0000072170237,0.000009451831,0.00012258424,0.6572419,0.00257904,0.337143,0.00016151239,0.00029773565],"about_ca_topic_score_codex":0.0000029628873,"about_ca_topic_score_gemma":9.765682e-7,"teacher_disagreement_score":0.9009855,"about_ca_system_score_codex":0.000017745262,"about_ca_system_score_gemma":0.000030685234,"threshold_uncertainty_score":0.35458145},"labels":[],"label_agreement":null},{"id":"W2065396130","doi":"10.1016/j.disc.2012.05.023","title":"Obstructions to partitions of chordal graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chordal graph; Combinatorics; Discrete mathematics; Treewidth; Outerplanar graph; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.03427589843562042,"score_gpt":0.3221639786332235,"score_spread":0.2878880801976031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065396130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08533389,0.000048859874,0.9077877,0.00027280577,0.00017125277,0.00021684502,0.000016443611,0.000091125265,0.006061066],"genre_scores_gemma":[0.6623137,0.0000035795067,0.33745468,0.000026940783,0.000021790845,0.000035975612,0.0000015685301,0.000008810011,0.00013294331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989716,0.000036172343,0.00024102787,0.00012843331,0.00028032518,0.00034248535],"domain_scores_gemma":[0.9988557,0.00014198844,0.00006897324,0.000656509,0.00007821317,0.00019858849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029325855,0.00009354294,0.00015106553,0.0001633579,0.0001023475,0.000030628547,0.0005468573,0.000028186236,0.000039756243],"category_scores_gemma":[0.00015727188,0.000081107304,0.00008148003,0.0007232231,0.00008323359,0.0004085168,0.00022466514,0.00008829215,0.00010258904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.190442e-7,0.00007158771,0.0003895113,0.000027520251,0.000012059693,3.180168e-7,0.002200443,0.00005490593,0.0015552273,0.9947258,0.00017435981,0.000787352],"study_design_scores_gemma":[0.00014272187,0.00006924172,0.0018250005,0.000045375975,0.000012776685,0.000023207338,0.0006292484,0.0019914755,0.014064338,0.9794338,0.0015337786,0.00022907775],"about_ca_topic_score_codex":0.0000015647615,"about_ca_topic_score_gemma":0.0000013852937,"teacher_disagreement_score":0.5769798,"about_ca_system_score_codex":0.00001462572,"about_ca_system_score_gemma":0.000014788083,"threshold_uncertainty_score":0.330746},"labels":[],"label_agreement":null},{"id":"W2065415255","doi":"10.1016/j.tcs.2014.06.014","title":"H-coloring degree-bounded (acyclic) digraphs","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bounded function; Degree (music); Homomorphism; Conjecture; Upper and lower bounds; Discrete mathematics; Time complexity; Physics","score_opus":0.024553383233821717,"score_gpt":0.2900484033323826,"score_spread":0.26549502009856085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065415255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047781482,0.000018672183,0.933469,0.0007935204,0.00064510957,0.00020263986,4.803669e-7,0.0004994426,0.01658963],"genre_scores_gemma":[0.7732795,0.000003425023,0.22604765,0.0004941094,0.00012820387,0.000014225794,2.8823635e-7,0.000012567876,0.000020062547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954775,0.00030735822,0.00035450343,0.0012393582,0.0013302915,0.0012910004],"domain_scores_gemma":[0.9962978,0.0008854019,0.00008291721,0.001847018,0.0002760025,0.00061086286],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0037271,0.00028359905,0.00030398124,0.0005020998,0.0009068384,0.0008584656,0.0060723904,0.000069284775,0.000037876216],"category_scores_gemma":[0.00041096818,0.00023644166,0.00012481606,0.0029040964,0.0055690804,0.001448267,0.0024806235,0.00042464165,0.000251798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009013869,0.000040928793,0.00012386567,0.000005038636,0.0000033563322,0.000006908252,0.00017804402,0.00007381645,0.0011101003,0.8884695,0.000012516481,0.109966874],"study_design_scores_gemma":[0.0002480019,0.00022879588,0.0012762117,0.000019701456,0.0000020439902,0.00003327241,0.0000030987003,0.298584,0.0071010008,0.69165397,0.0005753862,0.00027447892],"about_ca_topic_score_codex":0.000002903027,"about_ca_topic_score_gemma":0.0000011062297,"teacher_disagreement_score":0.72549796,"about_ca_system_score_codex":0.00008389505,"about_ca_system_score_gemma":0.00011239033,"threshold_uncertainty_score":0.99930525},"labels":[],"label_agreement":null},{"id":"W2065521247","doi":"10.1016/j.ejc.2007.11.017","title":"Generalised dualities and maximal finite antichains in the homomorphism order of relational structures","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Homomorphism; Finitary; Digraph; Mathematics; Duality (order theory); Algebra homomorphism; Order (exchange); Discrete mathematics; Combinatorics; Partially ordered set; Treewidth; Pathwidth; Graph","score_opus":0.04494834000764881,"score_gpt":0.25531751028673677,"score_spread":0.21036917027908797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065521247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91172004,0.00096060324,0.084851615,0.0007210558,0.0002468751,0.000072436866,0.0000035374248,0.000008013236,0.0014158218],"genre_scores_gemma":[0.99196297,0.00022115388,0.00758686,0.00010482317,0.000038062724,2.2078328e-7,5.511091e-7,0.00000905487,0.000076326774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791056,0.000886682,0.00040252166,0.00010240528,0.0005406872,0.00015717291],"domain_scores_gemma":[0.9987092,0.00041972072,0.00026731176,0.00022781026,0.00032067636,0.00005525368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014419084,0.00009312949,0.00016720456,0.00024238783,0.00011609116,0.000031606298,0.0007147025,0.000015762816,0.0000046042796],"category_scores_gemma":[0.00030854344,0.00006545155,0.00004609082,0.00057684176,0.00022141595,0.00032088897,0.00013434439,0.00033657454,0.0000010374678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031445965,0.000071930896,0.0073315874,0.000010674954,0.000017396898,0.00074000703,0.0041812025,0.00094961986,0.00019903664,0.98581904,0.00025902453,0.000389016],"study_design_scores_gemma":[0.0044854134,0.0012326706,0.35543326,0.00007841341,0.000014886516,0.0027393498,0.00045477742,0.004730221,0.0006599679,0.6238727,0.0059127402,0.00038564266],"about_ca_topic_score_codex":0.0000010429642,"about_ca_topic_score_gemma":2.3445511e-7,"teacher_disagreement_score":0.36194637,"about_ca_system_score_codex":0.0000143249845,"about_ca_system_score_gemma":0.00007447244,"threshold_uncertainty_score":0.2669037},"labels":[],"label_agreement":null},{"id":"W2065561033","doi":"10.1016/j.camwa.2010.02.001","title":"Nordhaus–Gaddum relations for proximity and remoteness in graphs","year":2010,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015481601845962855,"score_gpt":0.27990784235674704,"score_spread":0.26442624051078417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065561033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01667411,0.000018985142,0.97998136,0.0009937873,0.000042841897,0.0016953207,0.0000062222853,0.00014446807,0.00044290468],"genre_scores_gemma":[0.13796164,0.0000056054296,0.8609666,0.00006419325,0.00002004552,0.0008800323,0.0000067095134,0.000018642326,0.000076534045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987974,0.00002086954,0.00026773804,0.00043357155,0.00018624213,0.00029416225],"domain_scores_gemma":[0.99804956,0.0006092123,0.00011820106,0.0009221573,0.00017247461,0.00012841276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039955953,0.00015472787,0.0001922561,0.00025192558,0.00025651988,0.00012383636,0.00076268235,0.00007159068,0.0000015877114],"category_scores_gemma":[0.000044784952,0.00013608176,0.000036516212,0.00085798034,0.00019922956,0.00037811915,0.00019585658,0.0002844656,0.000008472718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003824726,0.00014687242,0.00039192397,0.000064055705,0.000009341917,7.543677e-7,0.00046936484,0.000106335596,0.00042012858,0.9806471,0.000067190835,0.01767313],"study_design_scores_gemma":[0.00053834025,0.000051102405,0.0016296468,0.000029228846,0.0000079876945,0.000037811715,0.000035506117,0.1382943,0.00020603515,0.8562751,0.0026727442,0.00022224465],"about_ca_topic_score_codex":0.0000027181377,"about_ca_topic_score_gemma":0.000057173067,"teacher_disagreement_score":0.13818796,"about_ca_system_score_codex":0.000018837489,"about_ca_system_score_gemma":0.000068972564,"threshold_uncertainty_score":0.5549253},"labels":[],"label_agreement":null},{"id":"W2065615449","doi":"10.1016/j.jctb.2010.10.004","title":"Twins of rayless graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Cograph; Induced subgraph isomorphism problem; Graph; Discrete mathematics; Chordal graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.010228694232689501,"score_gpt":0.2727172146198766,"score_spread":0.26248852038718706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065615449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9174164,0.00025430537,0.054803006,0.0005171201,0.020977585,0.00021288196,0.0000047065864,0.00006187882,0.0057521113],"genre_scores_gemma":[0.99154794,0.000036004003,0.007948631,0.000028804468,0.00028926722,0.0000017628311,1.9098832e-7,0.000014688464,0.00013269349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790627,0.0003532797,0.00060607446,0.00016032136,0.00067865546,0.000295381],"domain_scores_gemma":[0.99720263,0.0005902056,0.0005982819,0.00064095116,0.00077682314,0.0001911067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028595969,0.00015750492,0.00041344904,0.0003585812,0.00011296914,0.00007632827,0.0020417126,0.00011010078,0.00006776407],"category_scores_gemma":[0.00070571125,0.0001281978,0.00024590886,0.0006686739,0.00046216187,0.0013983669,0.0002757341,0.00076435466,0.0000045624083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044494445,0.00012863363,0.00021993737,0.000012589505,0.0000480075,0.000032933684,0.0004088415,0.0000075464764,0.037046183,0.95805985,0.00009769056,0.003492818],"study_design_scores_gemma":[0.0009151306,0.0005956357,0.00026403528,0.000020838523,0.000008478386,0.00015460454,0.000100360354,0.000009432612,0.07435685,0.9182505,0.0052049654,0.0001191907],"about_ca_topic_score_codex":9.460789e-7,"about_ca_topic_score_gemma":9.217094e-7,"teacher_disagreement_score":0.07413155,"about_ca_system_score_codex":0.00001706327,"about_ca_system_score_gemma":0.00020496779,"threshold_uncertainty_score":0.5227755},"labels":[],"label_agreement":null},{"id":"W2066238480","doi":"10.1016/j.ejc.2009.09.003","title":"Homomorphisms of random paths","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; Nemzeti Kutatási és Technológiai Hivatal; National Science Foundation","keywords":"Homomorphism; Mathematics; Path (computing); Combinatorics; Core (optical fiber); Constraint (computer-aided design); Discrete mathematics; Constraint satisfaction problem; Algebra homomorphism; Computer science; Statistics","score_opus":0.015739098610519562,"score_gpt":0.25282456104128,"score_spread":0.23708546243076042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066238480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07992019,0.0013216891,0.8974104,0.0006268058,0.00086829247,0.000101913276,9.507367e-7,0.000038571612,0.01971119],"genre_scores_gemma":[0.9925836,0.00012544764,0.007014031,0.00008465543,0.000048078142,8.246463e-8,1.2590262e-7,0.000010494972,0.00013352811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782854,0.0006587235,0.00055895513,0.00012351184,0.0006068131,0.00022345598],"domain_scores_gemma":[0.9981885,0.0001777702,0.0005051421,0.0004367335,0.00052370044,0.00016813294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024497274,0.00011292179,0.00028919277,0.0002656706,0.00006202077,0.000049565046,0.0016331848,0.000015275491,0.0000065285312],"category_scores_gemma":[0.00027238682,0.00009369358,0.00016138205,0.00066768314,0.00006880461,0.00043528917,0.00011839632,0.00034259591,0.000017112894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014644169,0.00037361824,0.00017993977,0.000010408596,0.000030955707,0.001139082,0.00045934878,0.00019169848,0.0036851251,0.91617996,0.0012341442,0.07636927],"study_design_scores_gemma":[0.0100395335,0.005278221,0.012100914,0.00018233446,0.000024748131,0.0007601689,0.000052212137,0.0008521325,0.01405439,0.94328564,0.01295019,0.00041954176],"about_ca_topic_score_codex":5.8274807e-8,"about_ca_topic_score_gemma":6.558897e-9,"teacher_disagreement_score":0.91266334,"about_ca_system_score_codex":0.000028181948,"about_ca_system_score_gemma":0.00006356379,"threshold_uncertainty_score":0.38207135},"labels":[],"label_agreement":null},{"id":"W2066380283","doi":"10.1016/s0012-365x(99)00354-4","title":"Embedding trees into graphs of large girth","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Conjecture; Embedding; Discrete mathematics; Graph; Tree (set theory); Degree (music); Computer science","score_opus":0.015694521293340452,"score_gpt":0.3198006587394579,"score_spread":0.3041061374461175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066380283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2993545,0.00019506269,0.6864766,0.00016591245,0.000052311767,0.0002587631,0.000011802383,0.00018397455,0.013301106],"genre_scores_gemma":[0.77517974,0.000043011947,0.22384605,0.000036070716,0.000011638594,0.000013337279,0.0000026051032,0.000017882956,0.0008496768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855703,0.000060089085,0.00034081616,0.00025369728,0.00042853033,0.00035985734],"domain_scores_gemma":[0.9987171,0.00019018604,0.00009826664,0.00083812594,0.000060232178,0.00009604653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047947725,0.00014917602,0.0002560834,0.00015138996,0.00011643599,0.00006010272,0.0010567056,0.000047030786,0.00022908175],"category_scores_gemma":[0.00007423017,0.00012274297,0.00012512156,0.000592821,0.000111738336,0.00037281454,0.00019506263,0.00013015822,0.0000831817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071846207,0.00012847946,0.00012503234,0.00013323878,0.000031152198,0.000009533025,0.0067382175,0.0003036371,0.0011898209,0.9776906,0.000102822145,0.013540287],"study_design_scores_gemma":[0.00032986558,0.00008930512,0.00009882242,0.00009637134,0.0000073076603,0.000009538639,0.00040751093,0.13629283,0.005136728,0.85635376,0.00096024043,0.00021773278],"about_ca_topic_score_codex":0.0000031646125,"about_ca_topic_score_gemma":0.0000061499363,"teacher_disagreement_score":0.47582522,"about_ca_system_score_codex":0.00001424268,"about_ca_system_score_gemma":0.00002201865,"threshold_uncertainty_score":0.5005313},"labels":[],"label_agreement":null},{"id":"W2066393114","doi":"10.1016/j.disc.2011.02.022","title":"Structure of 4-connected claw-free graphs not containing a subdivision of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subdivision; Mathematics; Scroll; Combinatorics; Discrete mathematics","score_opus":0.025372589599595936,"score_gpt":0.25995595225731705,"score_spread":0.23458336265772112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066393114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7761726,0.0007783191,0.011923213,0.00025981743,0.0015548853,0.000094114526,0.00073890167,0.00022634442,0.20825185],"genre_scores_gemma":[0.9754569,0.0005094267,0.021277111,0.00049782475,0.0005544297,0.00035804205,0.0005738776,0.0006177273,0.00015466502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9892371,0.0005812833,0.0025157803,0.0018346874,0.0033481028,0.0024829938],"domain_scores_gemma":[0.98871547,0.0025756408,0.0030757512,0.0042094304,0.00039160112,0.0010321176],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024471795,0.0009993374,0.0005988977,0.0007805506,0.001158982,0.0009035817,0.0044774483,0.001879032,0.16184407],"category_scores_gemma":[0.0032978274,0.0016654956,0.0018533717,0.0019223947,0.0024373927,0.001763637,0.0038500885,0.0018462318,0.0004817525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016317539,0.00037911342,0.000029706951,0.0025210152,0.0014132565,0.0007524937,0.009028482,0.0006208502,0.008841773,0.9451092,0.028326083,0.0013462651],"study_design_scores_gemma":[0.0020429362,0.0020815746,0.0001263512,0.001962907,0.00082004117,0.0006194733,0.0029711588,0.18148547,0.80215245,0.0042228736,0.00020427257,0.001310474],"about_ca_topic_score_codex":0.00064725766,"about_ca_topic_score_gemma":0.0008273,"teacher_disagreement_score":0.9408863,"about_ca_system_score_codex":0.000016001999,"about_ca_system_score_gemma":0.0011894256,"threshold_uncertainty_score":0.9994167},"labels":[],"label_agreement":null},{"id":"W2066414833","doi":"10.1016/j.dam.2014.01.024","title":"Brushing without capacity restrictions","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland; Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Traverse; Graph; Mathematics; Vertex (graph theory); Brush; Cartesian product; Combinatorics","score_opus":0.030951904321558123,"score_gpt":0.28422814721289763,"score_spread":0.2532762428913395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066414833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018406004,0.0000056607046,0.9169297,0.00016363643,0.00006371186,0.00023604558,0.0000018102938,0.00033078788,0.06386265],"genre_scores_gemma":[0.55219734,0.0000033204742,0.44748974,0.0000740682,0.00004135452,0.00004547623,0.000001309394,0.000017501558,0.00012988299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850416,0.000038540562,0.00027583612,0.00035051443,0.00043114796,0.00039979623],"domain_scores_gemma":[0.99827003,0.0003214934,0.00012171888,0.0010870243,0.00005304539,0.00014669952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064668996,0.00017052531,0.00022543888,0.00013225277,0.00027454598,0.00018249151,0.0010297566,0.00006388818,0.000010113682],"category_scores_gemma":[0.00016243254,0.00014777703,0.000064096035,0.00050859136,0.00011745549,0.00027638345,0.0003246358,0.0002702332,0.00018072684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001590809,0.000031695454,0.000028275112,0.000031396172,0.00000958451,4.81582e-7,0.00079120445,0.00011105724,0.004315365,0.9917305,0.000086936285,0.0028619196],"study_design_scores_gemma":[0.00025658472,0.000028582914,0.00013501501,0.000022955863,0.000008132054,0.000010764486,0.00012925909,0.067143664,0.0049109734,0.9251694,0.0019295093,0.00025516038],"about_ca_topic_score_codex":0.000004834698,"about_ca_topic_score_gemma":0.000004475302,"teacher_disagreement_score":0.53379136,"about_ca_system_score_codex":0.000035327033,"about_ca_system_score_gemma":0.000022080772,"threshold_uncertainty_score":0.6026172},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Graph; Graph coloring; Discrete mathematics; Physics; Optics","score_opus":0.015671258234954296,"score_gpt":0.28858253892977803,"score_spread":0.27291128069482373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066530434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2728338,0.00014294994,0.7250887,0.00006178659,0.000042216267,0.0003708632,0.0000012645688,0.00013212248,0.0013262749],"genre_scores_gemma":[0.8702151,0.00002177745,0.12953971,0.000042108484,0.000023901484,0.00003150833,0.0000034178543,0.00003315575,0.00008928896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969613,0.000070824535,0.00047550656,0.00043110063,0.0006048104,0.0014564826],"domain_scores_gemma":[0.99786633,0.0008512316,0.00016694625,0.0009026737,0.000082315,0.00013047348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018208943,0.00027001672,0.00035218106,0.000348019,0.00015228971,0.000099335,0.0012493404,0.000073242365,0.000019574427],"category_scores_gemma":[0.00022033893,0.00022065475,0.000071789334,0.0011272607,0.00011472182,0.00044072143,0.00033772454,0.0005102195,0.00009123299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076300224,0.0004319353,0.002006781,0.00025420025,0.00008200894,0.000107768006,0.0019166683,0.000372293,0.0056077526,0.9875229,0.000009649349,0.001611724],"study_design_scores_gemma":[0.0024337606,0.0008765745,0.0021672698,0.00049367803,0.000019345009,0.000118186275,0.00020302489,0.12889577,0.018851375,0.8446696,0.00033825604,0.0009331648],"about_ca_topic_score_codex":0.0000070014557,"about_ca_topic_score_gemma":0.00011223972,"teacher_disagreement_score":0.59738135,"about_ca_system_score_codex":0.00023920697,"about_ca_system_score_gemma":0.00008558115,"threshold_uncertainty_score":0.89980394},"labels":[],"label_agreement":null},{"id":"W2066586325","doi":"10.1016/j.disc.2007.03.083","title":"The structure of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si23.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-subdivision-free toroidal graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Vertex (graph theory); Toroid; Torus; Discrete mathematics; Graph; Geometry; Physics","score_opus":0.016993430092239498,"score_gpt":0.25766892586190454,"score_spread":0.24067549576966504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066586325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54777867,0.0034507404,0.01581845,0.0010656447,0.0046784794,0.0001866314,0.0014062513,0.0005789352,0.42503616],"genre_scores_gemma":[0.9753569,0.0016970068,0.016309239,0.0012257205,0.0019207897,0.0007099308,0.0009360328,0.0012533343,0.0005910837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98131925,0.0009428179,0.0037022752,0.0030309595,0.006207505,0.004797176],"domain_scores_gemma":[0.9821678,0.0050846315,0.003954944,0.0062005688,0.0005526056,0.0020394577],"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.005475126,0.0016832211,0.0007582432,0.0010943281,0.0033809014,0.0029563033,0.007854158,0.0032357713,0.2152026],"category_scores_gemma":[0.004637209,0.0027731142,0.0032603974,0.0031487648,0.0043803863,0.0027291607,0.005823624,0.003383474,0.0018017],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014674594,0.00043015167,0.000016540725,0.0020642618,0.0019553679,0.0013029893,0.0053096167,0.0012013833,0.005019718,0.76848906,0.20897852,0.0037649388],"study_design_scores_gemma":[0.00265965,0.0023607912,0.00009481453,0.001998649,0.0013982104,0.0017923616,0.0044615185,0.06786167,0.90240747,0.008717174,0.0036170627,0.0026306103],"about_ca_topic_score_codex":0.00089387177,"about_ca_topic_score_gemma":0.0018813817,"teacher_disagreement_score":0.8973878,"about_ca_system_score_codex":0.00004269033,"about_ca_system_score_gemma":0.0021322374,"threshold_uncertainty_score":0.99959147},"labels":[],"label_agreement":null},{"id":"W2066666508","doi":"10.1016/j.ejc.2011.09.004","title":"Polynomial treewidth forces a large grid-like-minor","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Australian Research Council","keywords":"Treewidth; Combinatorics; Mathematics; Partial k-tree; Minor (academic); Graph minor; Tree-depth; Tree decomposition; 1-planar graph; Discrete mathematics; Graph; Clique-sum; Pathwidth; Chordal graph; Line graph; Graph power","score_opus":0.032144537609966384,"score_gpt":0.25239588175131195,"score_spread":0.22025134414134556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066666508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17348571,0.0014053517,0.7396115,0.00028987665,0.0065414766,0.00023084473,0.000006881042,0.00016302426,0.07826535],"genre_scores_gemma":[0.9896683,0.000065599954,0.0091231605,0.00014478882,0.00022095862,5.669576e-7,3.546409e-7,0.00003359593,0.00074265426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974644,0.00068389514,0.00054601865,0.00022296872,0.00059095054,0.0004917528],"domain_scores_gemma":[0.9981962,0.000113144524,0.00045850113,0.00055738457,0.00034880426,0.00032600196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022654678,0.00018535108,0.0002717114,0.00034993238,0.0001725732,0.00010551917,0.0024483406,0.00002594419,0.000036968635],"category_scores_gemma":[0.00015038582,0.0001555313,0.00019450593,0.0006455741,0.000084726715,0.0009066547,0.00048878836,0.0005011469,0.00009882999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011422549,0.0026217068,0.015934473,0.000087554756,0.00039645756,0.009985954,0.013606171,0.00003453826,0.0014277865,0.8180806,0.07387435,0.06280817],"study_design_scores_gemma":[0.02075463,0.013678222,0.088524066,0.00038916554,0.0001385483,0.003260524,0.0008878926,0.0021744105,0.017277448,0.16368096,0.6866454,0.0025887617],"about_ca_topic_score_codex":7.864769e-7,"about_ca_topic_score_gemma":4.3364574e-7,"teacher_disagreement_score":0.8161826,"about_ca_system_score_codex":0.000056130946,"about_ca_system_score_gemma":0.000100808626,"threshold_uncertainty_score":0.6342383},"labels":[],"label_agreement":null},{"id":"W2066869105","doi":"10.1016/j.disc.2010.03.013","title":"Ultracritical and hypercritical binary structures","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Binary number; Discrete mathematics; Arithmetic; Graph","score_opus":0.016442633351885966,"score_gpt":0.31152094399518226,"score_spread":0.2950783106432963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066869105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65038764,0.00006270978,0.34237957,0.0016226958,0.00022556633,0.00020648543,0.000009283437,0.00022092852,0.0048851087],"genre_scores_gemma":[0.7045918,0.000004706437,0.2952067,0.000086777225,0.00003952058,0.0000076206065,8.166925e-7,0.000011488389,0.000050547435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882495,0.00003473152,0.00018909799,0.0002846376,0.00031271906,0.00035386317],"domain_scores_gemma":[0.9986183,0.00048851117,0.000014816863,0.0006021431,0.00006467294,0.00021153707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028732396,0.00013710925,0.00016828114,0.00007740608,0.00013655695,0.00018233208,0.0006069857,0.00008171186,0.0000385228],"category_scores_gemma":[0.0005612405,0.00010730043,0.000043867734,0.00016773815,0.00040389562,0.00031972316,0.0003129047,0.0004216772,0.000030550742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001708556,0.00002888701,0.00006106717,0.00004679121,0.0000045569172,0.000025798208,0.00033166443,7.377331e-7,0.018330457,0.97956,0.00003238489,0.0015759186],"study_design_scores_gemma":[0.000152916,0.0000580264,0.0007224931,0.000012341889,0.00000559164,0.00023038739,0.00015651845,0.026279086,0.0036667702,0.9682163,0.00031080865,0.00018877398],"about_ca_topic_score_codex":8.0955147e-7,"about_ca_topic_score_gemma":0.0000015165582,"teacher_disagreement_score":0.05420418,"about_ca_system_score_codex":0.0000048100824,"about_ca_system_score_gemma":0.000021392963,"threshold_uncertainty_score":0.43755844},"labels":[],"label_agreement":null},{"id":"W2066946142","doi":"10.1016/j.dam.2007.02.006","title":"Lower bounds on the pathwidth of some grid-like graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Victoria","funders":"","keywords":"Mathematics; Pathwidth; Combinatorics; Upper and lower bounds; Vertex (graph theory); Chordal graph; Mathematical proof; Discrete mathematics; Matching (statistics); Grid; Graph; Line graph; Statistics","score_opus":0.02064470322813984,"score_gpt":0.27836073905114567,"score_spread":0.25771603582300584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066946142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105785616,0.000068263136,0.85481435,0.00030916993,0.0003477698,0.0008115293,0.000014200721,0.00019608276,0.03765299],"genre_scores_gemma":[0.9366483,0.000022051414,0.062404264,0.00058266876,0.00006949662,0.000051038955,0.0000037466043,0.000041060153,0.00017735467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783385,0.000026112104,0.00045712935,0.00034752596,0.00079597713,0.00053942023],"domain_scores_gemma":[0.99716026,0.00093574054,0.00021914781,0.0015009935,0.00007170213,0.000112182825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015657485,0.00023061651,0.0002810303,0.00018212131,0.00018597273,0.00008170423,0.0016223103,0.00007786461,0.00002069268],"category_scores_gemma":[0.000060685794,0.00014739721,0.00014259705,0.00070990727,0.0003266601,0.0001727334,0.00037422686,0.0002961113,0.00008336861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023610863,0.00012232228,0.0000056261624,0.000045935198,0.000024962283,0.000008070166,0.0010416658,0.000024327279,0.0046429546,0.9921572,0.00026290622,0.0016404161],"study_design_scores_gemma":[0.00027719035,0.00011385966,0.00006732528,0.000038753828,0.000007669963,0.000005115314,0.00043784548,0.001296349,0.020262482,0.9762977,0.000974195,0.00022153214],"about_ca_topic_score_codex":8.7838066e-7,"about_ca_topic_score_gemma":0.0000015936722,"teacher_disagreement_score":0.8308627,"about_ca_system_score_codex":0.000026927215,"about_ca_system_score_gemma":0.00003615004,"threshold_uncertainty_score":0.6010684},"labels":[],"label_agreement":null},{"id":"W2067092314","doi":"10.2478/spma-2014-0004","title":"On the Relationships between Zero Forcing Numbers and Certain Graph Coverings","year":2014,"lang":"en","type":"article","venue":"Special Matrices","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Cubic graph; Line graph; Voltage graph; Butterfly graph; Upper and lower bounds; Mathematical analysis","score_opus":0.02862864413862354,"score_gpt":0.2698224245484369,"score_spread":0.24119378040981337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067092314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54397106,0.00009447642,0.3942839,0.0026956883,0.00031427355,0.00035383189,0.0000038771345,0.00016088157,0.058121998],"genre_scores_gemma":[0.99636817,0.000018939885,0.0028398752,0.00008080487,0.00046777428,0.0000081614935,6.9668397e-7,0.000008744688,0.00020683784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884033,0.00021331193,0.00013611212,0.00026391464,0.00029849485,0.0002478325],"domain_scores_gemma":[0.99736947,0.0021101332,0.000073519914,0.00034346545,0.000024143417,0.000079247664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009226498,0.00010069141,0.00011014884,0.00014701037,0.0004888835,0.00019986444,0.0005963692,0.00004577041,0.000014065092],"category_scores_gemma":[0.00041375376,0.00007295325,0.00004062862,0.00059740286,0.00010369426,0.00035868192,0.00018213355,0.00027681136,0.00006279933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071142977,0.0000041760113,0.009441303,0.000006375914,0.000006713026,9.759726e-7,0.00042599748,0.000046698206,0.000019686358,0.9813029,0.0008125827,0.007925449],"study_design_scores_gemma":[0.00014444411,0.00006475819,0.018607747,0.000017873603,0.000004163958,0.0000017369559,0.00006667361,0.00047766193,0.00016728585,0.9727492,0.0075724707,0.00012598404],"about_ca_topic_score_codex":0.000024193523,"about_ca_topic_score_gemma":0.000022203061,"teacher_disagreement_score":0.45239708,"about_ca_system_score_codex":0.000021403834,"about_ca_system_score_gemma":0.000012146964,"threshold_uncertainty_score":0.37601462},"labels":[],"label_agreement":null},{"id":"W2067133893","doi":"10.1016/j.disc.2004.03.020","title":"Minimum chromaticity of circulant graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Circulant matrix; Combinatorics; Mathematics; Circulant graph; Chromaticity; Chromatic scale; Discrete mathematics; Graph; Graph power; Line graph; Computer science; Artificial intelligence","score_opus":0.02417981242639211,"score_gpt":0.2962456602513835,"score_spread":0.2720658478249914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067133893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19368702,0.000114830116,0.7979036,0.0003416613,0.000048718823,0.00026671324,0.000008324924,0.00012918095,0.007499961],"genre_scores_gemma":[0.7400881,0.000011354981,0.25969246,0.000040410523,0.000016880384,0.000011793655,0.0000014591492,0.000012225399,0.00012527943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998487,0.00005351116,0.00041998146,0.00023216486,0.00048799152,0.00031932953],"domain_scores_gemma":[0.9984813,0.00022590817,0.00018040906,0.00092053734,0.00008851765,0.000103381586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047007133,0.00014640251,0.00028058328,0.00015504779,0.00006758422,0.0000461773,0.001089104,0.000047446487,0.000036862224],"category_scores_gemma":[0.00013719681,0.000119560165,0.00012883624,0.00047727668,0.00014999838,0.00032964328,0.00027768302,0.00011599671,0.00007346826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025401225,0.00015093402,0.00008902266,0.00019329159,0.00003378181,0.0000053576405,0.002578794,0.00012264027,0.008830194,0.9840047,0.0001351659,0.0038535888],"study_design_scores_gemma":[0.0004324192,0.00010006341,0.00034678855,0.00012759643,0.000014622976,0.000039799837,0.0002573517,0.21400759,0.036712162,0.7472543,0.00038478256,0.00032253686],"about_ca_topic_score_codex":0.0000015446869,"about_ca_topic_score_gemma":0.000002079053,"teacher_disagreement_score":0.5464011,"about_ca_system_score_codex":0.000023853703,"about_ca_system_score_gemma":0.000033358538,"threshold_uncertainty_score":0.4875522},"labels":[],"label_agreement":null},{"id":"W206723634","doi":"10.1007/0-387-22444-0_1","title":"The Matching Lattice","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Lattice (music); Matching (statistics); Statistical physics; Computer science; Mathematics; Physics; Statistics","score_opus":0.029548271597124504,"score_gpt":0.2875761927472078,"score_spread":0.25802792115008333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206723634","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.5351675e-7,0.00050470955,0.2686537,0.0009322045,0.00021376873,0.00011778816,6.3397187e-7,0.00010250997,0.7294743],"genre_scores_gemma":[0.000026860347,0.00024141645,0.024857704,0.00072904566,0.000043282023,0.0000054945776,5.134776e-7,0.000027330583,0.97406834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986304,0.000039961975,0.00017840377,0.00037902434,0.00044729208,0.0003249329],"domain_scores_gemma":[0.99794596,0.000603929,0.0000768137,0.0012000779,0.00008800373,0.00008518986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000589034,0.00019211438,0.0001426193,0.000074330725,0.0003698405,0.0002567318,0.0017980842,0.00011016473,0.000111421614],"category_scores_gemma":[0.000027313183,0.00012139591,0.000102460755,0.00004772816,0.00012880418,0.00019427661,0.00045222175,0.0005259806,0.000748941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.523048e-7,0.0000012846039,1.224958e-7,0.0000032135604,0.000015124168,0.000013097462,0.000030788768,0.0000036267013,0.000002983319,0.97835886,0.0019790058,0.019590933],"study_design_scores_gemma":[0.00002481699,0.000007179772,3.4129522e-7,0.000009381344,0.0000013388253,0.000011006975,0.0000026242833,0.00006606139,0.0000136898425,0.5742407,0.42552733,0.00009553266],"about_ca_topic_score_codex":0.0000016255563,"about_ca_topic_score_gemma":0.0000067250016,"teacher_disagreement_score":0.4235483,"about_ca_system_score_codex":0.000038863593,"about_ca_system_score_gemma":0.00004677752,"threshold_uncertainty_score":0.96263707},"labels":[],"label_agreement":null},{"id":"W2067309928","doi":"10.1016/j.jctb.2003.12.005","title":"Inequivalent representations of matroids having no U3,6-minor","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Minor (academic); Combinatorics; Prime (order theory); Prime power; Graphic matroid; Discrete mathematics; Humanities","score_opus":0.015323233040096635,"score_gpt":0.29648798703544577,"score_spread":0.2811647539953491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067309928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62027013,0.00094664353,0.34885576,0.0018187604,0.016481737,0.0005486186,0.000011118852,0.0001270374,0.010940219],"genre_scores_gemma":[0.97707504,0.0000746212,0.021992521,0.00003149528,0.00043074606,0.000004306334,5.4514555e-7,0.000018240022,0.0003725124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976422,0.00033610562,0.0007595322,0.00019235314,0.00076138607,0.00030840744],"domain_scores_gemma":[0.9972458,0.00039497187,0.00064297597,0.00060559285,0.00094260427,0.00016806247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018211415,0.00016104098,0.00038923803,0.0003223174,0.00014923775,0.00009257689,0.0014216161,0.00007005034,0.000053087235],"category_scores_gemma":[0.00095377915,0.00014035292,0.0002332206,0.00058125344,0.00028662183,0.001707458,0.00035125166,0.00037748626,0.000014245215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048820366,0.00017957536,0.00017092655,0.000024800021,0.00006059735,0.000055787485,0.00072392443,0.00055339,0.012322554,0.9845208,0.000080892554,0.00081853627],"study_design_scores_gemma":[0.0016160803,0.0010182941,0.00031261324,0.00008711828,0.0000148389945,0.0001476872,0.00024988994,0.000011199055,0.03949162,0.9557051,0.0012127177,0.00013286505],"about_ca_topic_score_codex":0.0000039889806,"about_ca_topic_score_gemma":4.9087134e-7,"teacher_disagreement_score":0.3568049,"about_ca_system_score_codex":0.00011529512,"about_ca_system_score_gemma":0.00029538636,"threshold_uncertainty_score":0.5723426},"labels":[],"label_agreement":null},{"id":"W2067443412","doi":"10.1016/j.disc.2008.03.009","title":"Vertex arboricity of integer distance graph <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Arboricity; Combinatorics; Vertex (graph theory); Mathematics; Graph; Integer (computer science); Discrete mathematics; Planar graph; Computer science","score_opus":0.021571592716490357,"score_gpt":0.2563671469383798,"score_spread":0.23479555422188944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067443412","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45573065,0.0037194667,0.017642012,0.0013018957,0.006088381,0.00020726955,0.0013931966,0.000909136,0.513008],"genre_scores_gemma":[0.9697515,0.003978823,0.011912,0.002379225,0.0033786397,0.003263566,0.0020064935,0.0025761444,0.00075363566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9706969,0.001684843,0.0059529515,0.005478082,0.008703144,0.0074840267],"domain_scores_gemma":[0.9757306,0.005852637,0.0064684665,0.0072871167,0.0009004527,0.0037607118],"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.006264558,0.0029086908,0.0012676005,0.0021379532,0.0048357933,0.003991344,0.009550209,0.0057676644,0.3789556],"category_scores_gemma":[0.0065920246,0.0056623593,0.005962656,0.005441731,0.0075497017,0.004959309,0.007744431,0.0057189083,0.00464545],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031867085,0.0011622926,0.000045021716,0.0038441755,0.0038419352,0.0034260086,0.0059237713,0.0036118089,0.004023148,0.6636491,0.30449706,0.0027890156],"study_design_scores_gemma":[0.004557255,0.004135959,0.00013174638,0.004140978,0.003147627,0.0041575967,0.004562283,0.06352818,0.89572865,0.007122524,0.0036063953,0.005180802],"about_ca_topic_score_codex":0.0029039506,"about_ca_topic_score_gemma":0.0026956499,"teacher_disagreement_score":0.8917055,"about_ca_system_score_codex":0.00007997797,"about_ca_system_score_gemma":0.00426262,"threshold_uncertainty_score":0.9983644},"labels":[],"label_agreement":null},{"id":"W2067475075","doi":"10.1016/j.dam.2011.03.020","title":"Polynomial-time recognition of clique-width ≤3 graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Treewidth; Combinatorics; Mathematics; Clique-sum; Chordal graph; Bounded function; Discrete mathematics; Clique-width; Partial k-tree; 1-planar graph; Pathwidth; Graph; Line graph","score_opus":0.039311531153480864,"score_gpt":0.26537067493229455,"score_spread":0.2260591437788137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067475075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06278682,0.000038967424,0.76964396,0.000045194236,0.00008528054,0.0008287312,0.00002617339,0.00034272607,0.16620214],"genre_scores_gemma":[0.32884097,0.000021091399,0.6708158,0.000050691247,0.00001583137,0.00007061549,0.000009925329,0.000032283635,0.000142752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847466,0.000034083783,0.0004552235,0.00033074594,0.000349216,0.00035610117],"domain_scores_gemma":[0.9984762,0.00017754959,0.00026200188,0.00087388116,0.00009327873,0.00011706238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005492617,0.00018956681,0.00031561198,0.00021596349,0.00007548347,0.00003084081,0.000969407,0.00008559577,0.00012432925],"category_scores_gemma":[0.00005356595,0.00016755033,0.00011484412,0.0005263083,0.00018772445,0.00025114632,0.00029629265,0.00015849348,0.00030190856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006989174,0.000372557,0.000023977187,0.0002552632,0.00008841005,0.000008766816,0.0064980974,0.000003291306,0.063227855,0.8931304,0.0007086599,0.035612803],"study_design_scores_gemma":[0.00034360224,0.00009743729,0.000065798304,0.00004373285,0.00001587887,0.000007930694,0.00015367636,0.0017645515,0.12614767,0.87102395,0.00007450665,0.00026127903],"about_ca_topic_score_codex":0.000003657784,"about_ca_topic_score_gemma":7.3194315e-7,"teacher_disagreement_score":0.26605415,"about_ca_system_score_codex":0.000016905286,"about_ca_system_score_gemma":0.000036527003,"threshold_uncertainty_score":0.6832504},"labels":[],"label_agreement":null},{"id":"W2067491157","doi":"10.1016/s0020-0190(02)00478-7","title":"On the complexity of digraph packings","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Computer science; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.03886923167219776,"score_gpt":0.2733865819034409,"score_spread":0.23451735023124315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067491157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070916004,0.000011502342,0.91501164,0.0069060274,0.00006576494,0.00014852127,0.0000013715833,0.00008504685,0.0068541365],"genre_scores_gemma":[0.98583245,7.796078e-7,0.008545906,0.005598609,0.000003108967,0.000009962337,0.0000011373057,0.0000025723155,0.0000054535494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908066,0.00006943887,0.00022180668,0.000079836595,0.00036970284,0.0001785602],"domain_scores_gemma":[0.9992639,0.000119523924,0.00017839894,0.0003017749,0.00010619547,0.000030205536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267679,0.00007655001,0.00007372773,0.00015526275,0.00020142428,0.00015524699,0.0005352594,0.000018733996,0.000010529972],"category_scores_gemma":[0.00021556162,0.000052201012,0.0000369232,0.00061194936,0.00032897937,0.001858259,0.00003992533,0.00013977071,0.00002921433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005107938,0.000009959739,0.00009388354,0.000032016356,0.0000038498733,2.788176e-7,0.0017451006,0.00042116482,0.00072824914,0.9842945,0.0006752253,0.011990707],"study_design_scores_gemma":[0.00082562177,0.00011917637,0.002765731,0.00021179525,0.0000049825926,0.000026179554,0.00047901156,0.022087201,0.064031765,0.8935759,0.015386225,0.00048642597],"about_ca_topic_score_codex":0.0000015545418,"about_ca_topic_score_gemma":1.806059e-7,"teacher_disagreement_score":0.91491646,"about_ca_system_score_codex":0.000018731773,"about_ca_system_score_gemma":0.000033537875,"threshold_uncertainty_score":0.21286954},"labels":[],"label_agreement":null},{"id":"W2067731498","doi":"10.1016/s0166-218x(02)00415-8","title":"Stability number of bull- and chair-free graphs revisited","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Independent set; Chordal graph; Clique; Graph; Split graph; Discrete mathematics; Bounded function; 1-planar graph","score_opus":0.020516878573116577,"score_gpt":0.2839838116839609,"score_spread":0.26346693311084435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067731498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13346362,0.00013912385,0.80495846,0.000091422364,0.000033684373,0.00071900146,0.000021174472,0.00015044918,0.060423035],"genre_scores_gemma":[0.60840195,0.000034772416,0.39142776,0.00003105278,0.0000041764065,0.000036636775,0.0000020253945,0.000018433953,0.000043192213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842274,0.00005592293,0.00039811712,0.00038040197,0.00041451427,0.00032831373],"domain_scores_gemma":[0.99772227,0.00033575503,0.0001665605,0.0015565548,0.00009115383,0.00012769432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008836031,0.00018558664,0.00034603992,0.00007372842,0.00008778775,0.000050941424,0.0007877462,0.0000650538,0.000074169024],"category_scores_gemma":[0.0002720628,0.00015743212,0.00006731928,0.00058180536,0.0002650059,0.00015513854,0.0003617824,0.00016265496,0.000018911005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005274311,0.00006265199,0.00020783044,0.00024549043,0.000017893735,0.0000013419536,0.0008744611,0.000001397693,0.0034815688,0.9945393,0.00004895479,0.0005138325],"study_design_scores_gemma":[0.00040127095,0.000021497865,0.00008249341,0.000028556735,0.0000090239955,0.00001355151,0.00028796276,0.0008359274,0.016868295,0.98106915,0.00019822584,0.00018402345],"about_ca_topic_score_codex":0.0000010038361,"about_ca_topic_score_gemma":6.548206e-7,"teacher_disagreement_score":0.47493833,"about_ca_system_score_codex":0.0000145317545,"about_ca_system_score_gemma":0.000026025702,"threshold_uncertainty_score":0.6419895},"labels":[],"label_agreement":null},{"id":"W2068571612","doi":"10.1007/s00039-007-0599-6","title":"Szemerédi’s Lemma for the Analyst","year":2007,"lang":"hu","type":"article","venue":"Geometric and Functional Analysis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":229,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lemma (botany); Mathematics; Combinatorics; Graph; Graph theory; Discrete mathematics; Extremal graph theory; Line graph; Voltage graph","score_opus":0.04175281659476747,"score_gpt":0.2951102300940967,"score_spread":0.2533574134993292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068571612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003396358,0.021082127,0.9718842,0.0019285189,0.0005857137,0.0002811534,0.0000630077,0.00005019525,0.00072873425],"genre_scores_gemma":[0.9749705,0.00093255966,0.004718742,0.00040648362,0.0007757397,0.000038734364,0.000046948324,0.00002197778,0.0180883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660254,0.000074336705,0.0005675579,0.0009317876,0.001022264,0.0008015262],"domain_scores_gemma":[0.9939316,0.004314173,0.00017376798,0.0007131331,0.0005819501,0.00028539635],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.004637875,0.00029774127,0.0004667098,0.005502422,0.0010262346,0.00044260095,0.00062500086,0.0001346308,0.0004272836],"category_scores_gemma":[0.00037237423,0.00020117951,0.0008666158,0.03520605,0.000371529,0.00033361645,0.00038366936,0.00037737846,0.00013788037],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005267546,0.00029215758,0.033139873,0.00013492788,0.02277585,0.000043093918,0.0003351281,0.017205609,0.0000847855,0.3540049,0.010036221,0.5614207],"study_design_scores_gemma":[0.0010635013,0.00047452227,0.33272567,0.00001759874,0.0104282005,0.000040702893,0.0009260436,0.3819642,0.00011440364,0.0397616,0.2315856,0.0008979177],"about_ca_topic_score_codex":0.00013788689,"about_ca_topic_score_gemma":0.00013904441,"teacher_disagreement_score":0.9715742,"about_ca_system_score_codex":0.00009444045,"about_ca_system_score_gemma":0.00008546954,"threshold_uncertainty_score":0.98530114},"labels":[],"label_agreement":null},{"id":"W20688002","doi":"","title":"Minimum cost homomorphisms to oriented cycles with some loops","year":2009,"lang":"en","type":"article","venue":"Computing: The Australasian Theory Symposium","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Combinatorics; Partition (number theory); Algebra homomorphism; Mathematics; Loop (graph theory); Discrete mathematics; Vertex (graph theory); Graph homomorphism; Directed graph; Graph; Line graph","score_opus":0.014754832187541159,"score_gpt":0.27610765207257515,"score_spread":0.261352819885034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20688002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21352032,0.00013894457,0.7547222,0.021073798,0.0007771474,0.0021894642,0.0000136140825,0.0010670258,0.006497537],"genre_scores_gemma":[0.98381025,0.000006446651,0.01194981,0.0021251459,0.00029214466,0.000024253974,0.0000064647124,0.00004690886,0.0017386082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556017,0.0006880667,0.00049539737,0.0010890204,0.00077546254,0.0013918709],"domain_scores_gemma":[0.99607146,0.00063110504,0.00021937572,0.0022750988,0.00022998515,0.00057295576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016159898,0.00054120796,0.00045896164,0.00037007613,0.0007842036,0.0004271078,0.0038827849,0.00012443654,0.000019984225],"category_scores_gemma":[0.00009727877,0.00037431062,0.00016318157,0.0017137917,0.00050514465,0.00066848466,0.0006271845,0.0006620953,0.00030120238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029218395,0.00023149131,0.0001695384,0.0000116783685,0.00006430182,0.0001495077,0.0022144394,0.004918423,0.008257275,0.95638865,0.0008398331,0.026462657],"study_design_scores_gemma":[0.004361947,0.0049879495,0.016630111,0.0005805769,0.00012314391,0.0013433247,0.0017534306,0.014217543,0.074654914,0.8651864,0.013055399,0.003105266],"about_ca_topic_score_codex":0.000002868208,"about_ca_topic_score_gemma":0.0000014998835,"teacher_disagreement_score":0.7702899,"about_ca_system_score_codex":0.00012917553,"about_ca_system_score_gemma":0.00013689727,"threshold_uncertainty_score":0.9998709},"labels":[],"label_agreement":null},{"id":"W2068854468","doi":"10.1016/j.aam.2008.05.002","title":"Some open problems on excluding a uniform matroid","year":2008,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Minor (academic); Mathematics; Combinatorics; Graphic matroid; Discrete mathematics; Humanities","score_opus":0.0561847561376672,"score_gpt":0.33206183607365786,"score_spread":0.27587707993599064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068854468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012376961,0.0011004901,0.82257843,0.00030015488,0.00025702934,0.0026953362,0.000004977476,0.00043297422,0.16025364],"genre_scores_gemma":[0.2645686,0.0011350594,0.7330245,0.00024964148,0.0000605352,0.00046243233,0.0000023585224,0.000045677756,0.00045125463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790037,0.000022741153,0.0004634598,0.0005172865,0.000515368,0.00058075023],"domain_scores_gemma":[0.9981386,0.0005101902,0.0001907945,0.0010202084,0.000031241532,0.000108968605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006226118,0.00024656614,0.00037649553,0.00026334205,0.00023316446,0.00010813685,0.0027773802,0.000062563835,0.000008557432],"category_scores_gemma":[0.000080428224,0.0002161371,0.000044623514,0.00082645076,0.0001709724,0.0013015749,0.0010518217,0.0003360456,0.00018833704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001311527,0.00020609559,0.00003565448,0.00011318609,0.0000041825865,0.000025045669,0.0010345592,0.0027386816,0.0004721657,0.9884694,0.000033267115,0.0068545993],"study_design_scores_gemma":[0.0006709375,0.00008979879,0.000019797333,0.00011264231,0.0000012547316,0.000041169882,0.00013502827,0.007843089,0.0030876512,0.9841984,0.0035086176,0.00029162],"about_ca_topic_score_codex":0.0000012711348,"about_ca_topic_score_gemma":0.0000056022877,"teacher_disagreement_score":0.25219163,"about_ca_system_score_codex":0.000119876175,"about_ca_system_score_gemma":0.00005893838,"threshold_uncertainty_score":0.8813815},"labels":[],"label_agreement":null},{"id":"W2069229408","doi":"10.1016/j.tcs.2011.12.018","title":"Coloring vertices of a graph or finding a Meyniel obstruction","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Graph factorization; Graph power; Discrete mathematics; Graph coloring; Line graph","score_opus":0.05662253399805527,"score_gpt":0.3083479634721874,"score_spread":0.2517254294741321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069229408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20980984,0.000015887968,0.7868361,0.00004254031,0.00040581642,0.00014157074,5.9751784e-7,0.00012464245,0.0026230274],"genre_scores_gemma":[0.7333655,0.0000046398504,0.26654503,0.00003949283,0.00002519671,0.0000073849815,7.194637e-8,0.0000056038466,0.00000712719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974502,0.00013088854,0.00032954893,0.0006569911,0.0007925125,0.00063987426],"domain_scores_gemma":[0.9981773,0.0003663064,0.000110096684,0.0008483933,0.0002497199,0.00024821048],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016245344,0.00016223853,0.00022828621,0.00045868746,0.0003483647,0.00012251876,0.0030593567,0.000047861242,0.00007624166],"category_scores_gemma":[0.00022344696,0.00012130164,0.00007324518,0.0026797568,0.0037300268,0.0012935138,0.0012599515,0.00020877915,0.000020689673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066521556,0.000052635412,0.00024060869,0.000013482791,0.0000058741384,0.000014979566,0.0014619371,0.000036405458,0.0027657542,0.9718222,0.0000018526802,0.023517748],"study_design_scores_gemma":[0.00031512845,0.00065752014,0.002816296,0.000061394174,0.000006011591,0.000069706235,0.000052348067,0.123820595,0.0931281,0.77881,0.000012996825,0.00024987638],"about_ca_topic_score_codex":0.0000056949416,"about_ca_topic_score_gemma":0.0000010916551,"teacher_disagreement_score":0.52355564,"about_ca_system_score_codex":0.000043702636,"about_ca_system_score_gemma":0.00012992253,"threshold_uncertainty_score":0.99898124},"labels":[],"label_agreement":null},{"id":"W2069232411","doi":"10.5539/jmr.v2n2p104","title":"Clique Partitions of Glued Graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Clique-sum; Partition (number theory); Disjoint sets; Clique; Split graph; Cograph; Block graph; clone (Java method); Clique number; Chordal graph; Discrete mathematics; Graph; 1-planar graph","score_opus":0.09954003932687781,"score_gpt":0.4357319284140703,"score_spread":0.3361918890871925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069232411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62799406,0.000140398,0.36222893,0.0020323412,0.00038444638,0.00035078838,0.0000074904,0.000029733783,0.0068318406],"genre_scores_gemma":[0.786723,0.00006683806,0.21293588,0.000009796211,0.00005428315,0.0000059777058,1.5310685e-7,0.00001232302,0.00019174012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968252,0.00028717608,0.0006761304,0.0001371845,0.0016526005,0.00042168336],"domain_scores_gemma":[0.99508923,0.0016683965,0.00031842728,0.0007678048,0.0019151588,0.00024100416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008063096,0.00009009901,0.00028722605,0.0009398763,0.00014642802,0.000095915755,0.0020267717,0.000086125074,0.000100083955],"category_scores_gemma":[0.0021101683,0.000069278634,0.00017290396,0.0012044377,0.00042425946,0.0004957307,0.00036243806,0.0014802533,0.000032339056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013811415,0.00047454605,0.00015558764,0.00009988168,0.000037320053,0.00004385119,0.00092691975,0.00003377116,0.08242634,0.9120818,0.00088452187,0.0028216566],"study_design_scores_gemma":[0.00031658646,0.000307835,0.00027129456,0.00007829333,0.0000033248666,0.00019848238,0.00023701286,0.0027523718,0.044441637,0.9505031,0.0008167191,0.000073362324],"about_ca_topic_score_codex":0.0000022446666,"about_ca_topic_score_gemma":0.000009726984,"teacher_disagreement_score":0.15872897,"about_ca_system_score_codex":0.000023398232,"about_ca_system_score_gemma":0.0003157761,"threshold_uncertainty_score":0.6431046},"labels":[],"label_agreement":null},{"id":"W2069262458","doi":"10.1016/s0012-365x(02)00495-8","title":"On the monotonicity of the broadcast function","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Conjecture; Monotonic function; Broadcasting (networking); Graph; Function (biology); Discrete mathematics; Computer science; Computer network","score_opus":0.024571823278013213,"score_gpt":0.2714664504881405,"score_spread":0.24689462721012728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069262458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11566573,0.000046078196,0.8537861,0.00061411667,0.00017421709,0.000458223,0.0000032722583,0.000046127636,0.02920614],"genre_scores_gemma":[0.99158245,0.0000040420696,0.007764279,0.00014185128,0.000005794909,0.000019559082,1.415746e-7,0.000009101663,0.0004727624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892676,0.00016945064,0.00018272955,0.00014959172,0.00038845022,0.00018304434],"domain_scores_gemma":[0.9981586,0.0005277391,0.00012086541,0.0011064112,0.000057185916,0.000029213441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066035683,0.00009517399,0.00010650501,0.000031864827,0.00017062982,0.000044820084,0.0008992513,0.00002900678,0.000032781947],"category_scores_gemma":[0.0004887171,0.000045181794,0.00009676383,0.00042919462,0.00013887929,0.000099608864,0.00015456745,0.00017352708,0.0000336469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024091316,0.00003355926,0.000024224051,0.000013378197,0.000009144154,2.1364727e-7,0.00047880903,0.00016159285,0.00049103005,0.9981961,0.00009974489,0.0004897812],"study_design_scores_gemma":[0.000099466655,0.00005591252,0.00014195238,0.00003433749,0.0000053037365,0.000004069658,0.00019838667,0.0145599125,0.015231893,0.9688948,0.000700154,0.00007380515],"about_ca_topic_score_codex":9.3539956e-7,"about_ca_topic_score_gemma":8.2060996e-7,"teacher_disagreement_score":0.8759167,"about_ca_system_score_codex":0.000018109844,"about_ca_system_score_gemma":0.000029225097,"threshold_uncertainty_score":0.184246},"labels":[],"label_agreement":null},{"id":"W2069386249","doi":"10.1016/j.dam.2014.06.004","title":"Chasing robbers on random geometric graphs—An alternative approach","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Tel Aviv University; Ryerson University","keywords":"Mathematics; Combinatorics; Random graph; Random regular graph; Vertex (graph theory); Euclidean geometry; Graph; Upper and lower bounds; Discrete mathematics; Pathwidth; Line graph; Geometry","score_opus":0.02754310243246816,"score_gpt":0.2856310862076679,"score_spread":0.25808798377519976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069386249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013280274,0.000014658203,0.92859995,0.00004628245,0.000080836995,0.00057846674,0.0000029705666,0.00024833772,0.057148244],"genre_scores_gemma":[0.63514036,0.000008965344,0.36441958,0.000136011,0.00005552097,0.00011205143,0.000010428078,0.000042061813,0.00007505351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997387,0.00010112534,0.00039088837,0.0006802188,0.00083212875,0.00060862023],"domain_scores_gemma":[0.9974179,0.0006781636,0.0002278976,0.0013634566,0.00007001681,0.00024252373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001360053,0.00032320915,0.00043902302,0.0006744265,0.00026692945,0.00025220515,0.0016962673,0.0000845136,0.000008637447],"category_scores_gemma":[0.00017187699,0.00026317916,0.00012565625,0.0014654048,0.00016705031,0.00035414146,0.00030793692,0.00035010613,0.000088250905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003173897,0.00017429779,0.0000027830445,0.000057223708,0.000034062185,0.0000015850485,0.0015278152,0.002715873,0.0007135027,0.9782344,0.000020522131,0.01648617],"study_design_scores_gemma":[0.0014760453,0.00015416753,0.000016353857,0.000026000289,0.000012453275,0.000008272073,0.0003585955,0.27878663,0.00493282,0.7136906,0.00014718814,0.00039091104],"about_ca_topic_score_codex":0.0000026750356,"about_ca_topic_score_gemma":4.8173234e-7,"teacher_disagreement_score":0.62186,"about_ca_system_score_codex":0.000050423965,"about_ca_system_score_gemma":0.00002013217,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W2069528460","doi":"10.1016/j.disc.2007.11.044","title":"List-edge and list-total colorings of graphs embedded on hyperbolic surfaces","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Euler's formula; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.03229358121360019,"score_gpt":0.28555978410736266,"score_spread":0.25326620289376245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069528460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838832,0.00016002922,0.008038677,0.00010031476,0.000051775,0.0002615168,0.000011492817,0.00010157041,0.007391404],"genre_scores_gemma":[0.96555376,0.000093356764,0.03363255,0.000030103964,0.00000930101,0.000016749174,0.0000017695484,0.000020963465,0.00064142345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998458,0.000063698906,0.0003316316,0.00033241097,0.00047362343,0.00034057914],"domain_scores_gemma":[0.9984922,0.00042765043,0.00015704407,0.0006909466,0.000094676674,0.00013751061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032586502,0.00019867661,0.00034844762,0.00017625093,0.00016998436,0.00005110804,0.0006336417,0.0000636739,0.000013613196],"category_scores_gemma":[0.0001844049,0.0001649769,0.00009375433,0.00050724216,0.000421214,0.00029002022,0.00032461726,0.00017991575,0.000015933601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025506057,0.00018478165,0.0008361364,0.00022367245,0.00004301281,0.00004088723,0.0069977,0.00007560747,0.008059549,0.9829224,0.000107291904,0.00048350773],"study_design_scores_gemma":[0.0024038015,0.0017152712,0.00846131,0.00051508914,0.000047674803,0.0005886789,0.001912114,0.081146315,0.087527305,0.81332064,0.00082683674,0.0015350011],"about_ca_topic_score_codex":0.000007428423,"about_ca_topic_score_gemma":0.000002195025,"teacher_disagreement_score":0.16960174,"about_ca_system_score_codex":0.000015769252,"about_ca_system_score_gemma":0.00003319553,"threshold_uncertainty_score":0.67275625},"labels":[],"label_agreement":null},{"id":"W2069703039","doi":"10.1007/s00373-012-1246-z","title":"A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Infimum and supremum; Upper and lower bounds; Graph; Klein bottle; Surface (topology); Projective plane","score_opus":0.016220047580076866,"score_gpt":0.26878955691163486,"score_spread":0.252569509331558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069703039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99474937,0.00070219964,0.0010987718,0.00041222168,0.0004249519,0.00033347515,0.000003082428,0.000053805543,0.0022221117],"genre_scores_gemma":[0.9989147,0.0003325662,0.0002293725,0.0003067201,0.0000066289595,0.000038446302,9.0465574e-7,0.000013661366,0.00015695843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828553,0.00015360762,0.00018022588,0.00037816906,0.00040048672,0.00060196756],"domain_scores_gemma":[0.99858284,0.00054264243,0.00006352712,0.0005643847,0.00005511538,0.00019150627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085779297,0.00021066636,0.00021209833,0.00026604958,0.00023316394,0.00013747158,0.00048368776,0.00008158216,0.0000049099317],"category_scores_gemma":[0.000057722464,0.00014820303,0.000048409758,0.0013139419,0.0001739714,0.00041394183,0.0002515691,0.0003949268,0.00001115375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026869531,0.0001812955,0.019743282,0.00001102866,0.000008568206,0.0000054773536,0.0012098422,0.000020449295,0.00011303697,0.9767253,0.0002020611,0.0017528095],"study_design_scores_gemma":[0.0010139418,0.00043858206,0.042948563,0.000053439475,0.0000052976084,0.00001003455,0.00026030684,0.0028420838,0.0013262982,0.94939625,0.0013675616,0.0003376675],"about_ca_topic_score_codex":0.000025125619,"about_ca_topic_score_gemma":0.000005716874,"teacher_disagreement_score":0.027329056,"about_ca_system_score_codex":0.000027489896,"about_ca_system_score_gemma":0.000017948561,"threshold_uncertainty_score":0.6043544},"labels":[],"label_agreement":null},{"id":"W2070158492","doi":"10.1016/s0166-218x(03)00275-0","title":"On simplicial and co-simplicial vertices in graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; h-vector; Vertex (graph theory); Abstract simplicial complex; Simplicial homology; Simplicial complex; Neighbourhood (mathematics); Chordal graph; Independent set; Simplicial set; Simplicial manifold; Simplicial approximation theorem; Discrete mathematics; Graph; Pure mathematics","score_opus":0.019054387248265452,"score_gpt":0.3035012931768905,"score_spread":0.28444690592862504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070158492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58300453,0.0000584226,0.31883994,0.00014232894,0.00008859436,0.0009501902,0.000008796619,0.00019464934,0.09671256],"genre_scores_gemma":[0.9608635,0.000016383632,0.038783204,0.00020578763,0.000011862668,0.00007142896,0.0000018938986,0.000023122997,0.000022858796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840057,0.00004411288,0.00030987064,0.00040855032,0.0003765819,0.00046034224],"domain_scores_gemma":[0.9987039,0.0004898366,0.0000864261,0.00057457335,0.000021204689,0.00012404821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004894116,0.00020714228,0.00027221197,0.00022930594,0.00013084243,0.00012340382,0.0005308,0.000078945915,0.000013901846],"category_scores_gemma":[0.00013172238,0.00018211378,0.00004301948,0.0005173272,0.00013944639,0.0001679933,0.0001187122,0.00023425283,0.000048958416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014230339,0.000077786,0.000045823643,0.000037730948,0.0000075669327,0.000006300524,0.00094326976,0.000043857395,0.002538323,0.99406785,0.000041904008,0.002175349],"study_design_scores_gemma":[0.0005251111,0.0000696045,0.00017873265,0.000019940055,0.0000037055827,0.0000063636326,0.0002260834,0.0021419958,0.0063573173,0.98999345,0.000247046,0.00023064592],"about_ca_topic_score_codex":0.0000019128072,"about_ca_topic_score_gemma":0.000008473331,"teacher_disagreement_score":0.37785894,"about_ca_system_score_codex":0.000027941265,"about_ca_system_score_gemma":0.00003185373,"threshold_uncertainty_score":0.74263847},"labels":[],"label_agreement":null},{"id":"W2070606919","doi":"10.1007/s00454-007-1318-7","title":"Graph Treewidth and Geometric Thickness Parameters","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Centre de Recherches Mathématiques","keywords":"Arboricity; Treewidth; Combinatorics; Mathematics; Regular polygon; Conjecture; Upper and lower bounds; Partial k-tree; 1-planar graph; Graph; Crossing number (knot theory); Planar graph; Discrete mathematics; Pathwidth; Geometry; Chordal graph; Mathematical analysis; Line graph","score_opus":0.019270224172990538,"score_gpt":0.2982417351459352,"score_spread":0.2789715109729447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070606919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22364311,0.0005106842,0.774095,0.00025793817,0.00017340391,0.0001724493,0.000009233651,0.00014799951,0.0009902084],"genre_scores_gemma":[0.8356196,0.000019024983,0.16380505,0.0003610163,0.00003484578,0.00000847861,0.000023742401,0.000017888338,0.00011035294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720436,0.00010305743,0.00038523375,0.00069516996,0.00094836694,0.0006638002],"domain_scores_gemma":[0.997148,0.0017181748,0.00013129474,0.0004492708,0.00022560303,0.00032768882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014875022,0.00024736125,0.00026068595,0.0021042118,0.00030067016,0.00022841925,0.000873816,0.000095594725,0.000018656077],"category_scores_gemma":[0.0002728806,0.00023357348,0.00011666234,0.0055137086,0.00030196228,0.00075061346,0.0004477109,0.00034533546,0.00004548696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012166849,0.00017763511,0.03602981,0.00007903038,0.00017828039,0.00016978054,0.0005857064,0.034380138,0.0001848016,0.6311395,0.0002991843,0.29665443],"study_design_scores_gemma":[0.0012258899,0.0002838095,0.39432025,0.000035168792,0.000015280933,0.0001916967,0.00020327426,0.034020144,0.00043580946,0.5677725,0.00074978604,0.00074640336],"about_ca_topic_score_codex":0.00001640411,"about_ca_topic_score_gemma":0.0000044615936,"teacher_disagreement_score":0.6119765,"about_ca_system_score_codex":0.000053622345,"about_ca_system_score_gemma":0.00005831733,"threshold_uncertainty_score":0.952485},"labels":[],"label_agreement":null},{"id":"W2070790034","doi":"10.1016/s0166-218x(02)00198-1","title":"Edge dominating set and colorings on graphs with fixed clique-width","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Chordal graph; Discrete mathematics; Clique-sum; 1-planar graph; Brooks' theorem; Graph coloring; Indifference graph; Edge coloring; Independent set; Maximal independent set; Vertex (graph theory); Pathwidth; Dominating set; Bounded function; Graph; Line graph; Graph power","score_opus":0.02828176812337445,"score_gpt":0.26735332624816743,"score_spread":0.23907155812479297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070790034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2841811,0.000095427706,0.61170113,0.0004913137,0.000058488495,0.001476066,0.000014183567,0.0005536824,0.1014286],"genre_scores_gemma":[0.7427121,0.000028874096,0.25656834,0.00015928043,0.000014732184,0.00013217801,0.0000022227339,0.000035852965,0.00034643628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836105,0.000026354068,0.0002640777,0.00046134056,0.00044148008,0.0004456772],"domain_scores_gemma":[0.9984662,0.00048185614,0.00015306912,0.0006975153,0.000048220878,0.00015312791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033990838,0.00024583723,0.00028750615,0.00016257,0.00022269762,0.00016898013,0.0006218244,0.00006492148,0.000021042706],"category_scores_gemma":[0.000042766707,0.00018684231,0.0000404275,0.00050920923,0.00020284815,0.00020725149,0.00027487648,0.00027040506,0.000052501626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018855062,0.00006590782,0.000039727012,0.000115250055,0.000023834073,0.000014044375,0.0024472813,0.000026967522,0.0013966575,0.98908454,0.00014253378,0.0066244244],"study_design_scores_gemma":[0.0022695865,0.0007181376,0.00021076074,0.0002500798,0.0000320508,0.00007043511,0.0012278575,0.057621423,0.014541007,0.92113924,0.0009181075,0.0010013048],"about_ca_topic_score_codex":7.635042e-7,"about_ca_topic_score_gemma":0.0000018623377,"teacher_disagreement_score":0.458531,"about_ca_system_score_codex":0.000026916117,"about_ca_system_score_gemma":0.000009241199,"threshold_uncertainty_score":0.76192087},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"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","score_opus":0.019808836336700223,"score_gpt":0.31220657841205546,"score_spread":0.29239774207535524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071287219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29783532,0.00021376097,0.7002559,0.00035294576,0.00002188045,0.00022409363,0.0000011382989,0.000076648284,0.001018345],"genre_scores_gemma":[0.92859054,0.000030551488,0.071278736,0.00002737388,0.00001701598,0.000007978448,7.890734e-7,0.00000951923,0.00003752675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982995,0.000054883763,0.00038551787,0.00026625037,0.00035129828,0.00064258795],"domain_scores_gemma":[0.9986716,0.00047995834,0.0001439892,0.0006118618,0.000039987863,0.00005258539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007869588,0.00014843728,0.00027276744,0.00021317099,0.000052930263,0.000049932438,0.0010462288,0.00004981561,0.0000073481015],"category_scores_gemma":[0.00039328125,0.00013705705,0.00006924337,0.0007286947,0.00005201427,0.00035380005,0.00018844842,0.00035606898,0.0000058845035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009094925,0.000050270595,0.00010240982,0.000048324553,0.000010323088,0.0000067246306,0.0018343742,0.00080736034,0.0070022265,0.9762599,0.0000027398728,0.013866276],"study_design_scores_gemma":[0.00031906506,0.00028718906,0.00014880765,0.000117356394,0.0000033180481,0.0000130803855,0.000066969784,0.050262384,0.039389025,0.9091608,0.000053324085,0.00017868576],"about_ca_topic_score_codex":0.000004433512,"about_ca_topic_score_gemma":0.000009438948,"teacher_disagreement_score":0.6307552,"about_ca_system_score_codex":0.00013204753,"about_ca_system_score_gemma":0.0000950258,"threshold_uncertainty_score":0.55890244},"labels":[],"label_agreement":null},{"id":"W2071324240","doi":"10.1016/s0166-218x(02)00249-4","title":"On sum coloring of graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Greedy coloring; Combinatorics; Complete coloring; Edge coloring; Brooks' theorem; Graph coloring; Fractional coloring; List coloring; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Line graph","score_opus":0.023378729893770576,"score_gpt":0.28389298125915063,"score_spread":0.26051425136538003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071324240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061658956,0.000024777553,0.81294566,0.000026804362,0.00006946599,0.00036803976,0.0000028786546,0.00011251518,0.12479087],"genre_scores_gemma":[0.7817481,0.000007338932,0.21805319,0.00003338738,0.0000033792087,0.000041222298,7.3446716e-7,0.00001650128,0.00009613926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987206,0.000024882442,0.0002793568,0.00025697384,0.00040816603,0.00031005932],"domain_scores_gemma":[0.99853396,0.00039920717,0.00012889679,0.00080969,0.000044886623,0.00008334893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047370716,0.00014417803,0.00023234931,0.00015145952,0.000078008896,0.00003532603,0.0006841054,0.00004621054,0.000019933928],"category_scores_gemma":[0.00011869454,0.00012243225,0.00007165057,0.00053870026,0.00010558376,0.00009800998,0.00011715915,0.00014568807,0.000050799666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046773657,0.00006815993,0.0000067771352,0.00006232186,0.000013308774,0.0000019989982,0.00046060552,0.00011808136,0.0065126526,0.99222916,0.000035488443,0.00048679268],"study_design_scores_gemma":[0.00023706265,0.000057167115,0.0000108699005,0.000024652536,0.000003762979,0.000002832644,0.00016151702,0.0012420431,0.06939694,0.92856765,0.00016192286,0.0001335585],"about_ca_topic_score_codex":3.3076057e-7,"about_ca_topic_score_gemma":3.8208248e-7,"teacher_disagreement_score":0.72008914,"about_ca_system_score_codex":0.000018020228,"about_ca_system_score_gemma":0.000027352777,"threshold_uncertainty_score":0.49926424},"labels":[],"label_agreement":null},{"id":"W2071645752","doi":"10.1016/j.jda.2008.11.002","title":"Threshold dominating cliques in random graphs and interval routing","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Interval graph; Discrete mathematics; Interval (graph theory); Indifference graph; Chordal graph; Block graph; Split graph; Routing (electronic design automation); Clique; Pathwidth; Graph; Computer science; Line graph; 1-planar graph","score_opus":0.024496507497742983,"score_gpt":0.30680819512786284,"score_spread":0.2823116876301199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071645752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6644626,0.0015806768,0.33223614,0.00053797424,0.00023160975,0.00014189736,0.0000013632753,0.000030522522,0.0007771808],"genre_scores_gemma":[0.9238176,0.00048599616,0.07551057,0.00006326077,0.00006386139,0.0000023649,2.0184305e-7,0.000010981008,0.00004518832],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818254,0.00019685282,0.00060581986,0.000213581,0.00046056614,0.00034063193],"domain_scores_gemma":[0.9987829,0.0003818978,0.00032220304,0.00021130404,0.0001579651,0.00014375449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018676976,0.00014318488,0.00036835382,0.00041914987,0.00013192258,0.00008841533,0.0006886078,0.00005674338,0.0000032762273],"category_scores_gemma":[0.00027179753,0.000111463174,0.00013991115,0.00048273912,0.00018348613,0.0012337908,0.00028278818,0.0005992324,0.0000010132042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020119906,0.0006621979,0.17213804,0.00018465624,0.00052738737,0.009705629,0.039170604,0.0017355635,0.013580447,0.2075014,0.00065776793,0.5521243],"study_design_scores_gemma":[0.025693294,0.0031163201,0.06614406,0.0016646873,0.00004386237,0.010134497,0.0022594214,0.3530417,0.018333117,0.51755464,0.00045478367,0.0015595874],"about_ca_topic_score_codex":0.0000094822835,"about_ca_topic_score_gemma":0.0000044688354,"teacher_disagreement_score":0.55056477,"about_ca_system_score_codex":0.00004501415,"about_ca_system_score_gemma":0.000069977235,"threshold_uncertainty_score":0.45453364},"labels":[],"label_agreement":null},{"id":"W2071725273","doi":"10.1002/jgt.20554","title":"The plane-width of graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wheel graph; Chromatic scale; Vertex (graph theory); Graph; Windmill graph; Graph power; Geometric graph theory; Bound graph; Independent set","score_opus":0.028823839862715587,"score_gpt":0.2675951910981415,"score_spread":0.23877135123542592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071725273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29129592,0.00945501,0.66521823,0.0005344933,0.0024549314,0.00042179695,0.000008236681,0.00009481568,0.030516576],"genre_scores_gemma":[0.98604995,0.00051596237,0.013159141,0.00007536536,0.000036140784,0.000002071721,8.992209e-8,0.00001248301,0.00014882325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978986,0.0005273864,0.00055681885,0.00013795139,0.0005551173,0.00032417034],"domain_scores_gemma":[0.9973035,0.0009492149,0.0006013611,0.0006516602,0.00035201877,0.00014224963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040371465,0.00012821076,0.0002443592,0.00042663218,0.0001920999,0.000036385783,0.0024664532,0.000051375187,0.000028811382],"category_scores_gemma":[0.00024600778,0.000075268516,0.0003007907,0.00073262135,0.0005494091,0.0004808819,0.00018441415,0.00039793574,0.000006858868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027635138,0.00006989672,0.0010007333,0.000006922202,0.000095651354,0.000042589676,0.00094003434,0.0000042358643,0.0010407589,0.9718421,0.00022298457,0.02445775],"study_design_scores_gemma":[0.00031197205,0.0004022689,0.0035346942,0.00003048894,0.000010877174,0.0001629046,0.00020519548,0.00001374524,0.0089282645,0.9855893,0.0007246311,0.00008563911],"about_ca_topic_score_codex":0.0000019295524,"about_ca_topic_score_gemma":0.000001891184,"teacher_disagreement_score":0.694754,"about_ca_system_score_codex":0.000011717592,"about_ca_system_score_gemma":0.00008294121,"threshold_uncertainty_score":0.45833248},"labels":[],"label_agreement":null},{"id":"W2071879725","doi":"10.1007/s10107-010-0370-x","title":"Small Chvátal Rank","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Polytope; Combinatorics; Polyhedron; Mathematics; Facet (psychology); Unit cube; Context (archaeology); Rank (graph theory); Set (abstract data type); Integer (computer science); Graph; Integer programming; Birkhoff polytope; Cube (algebra); Polyhedral combinatorics; Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.03691911983242624,"score_gpt":0.3022590057215975,"score_spread":0.26533988588917123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071879725","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038191423,0.00001610781,0.9534179,0.00055934524,0.00014686695,0.0003364302,2.669432e-7,0.00045546473,0.0068762004],"genre_scores_gemma":[0.37080497,3.8384368e-7,0.6286514,0.000047603527,0.0000607036,0.000061936036,5.268241e-7,0.000014725887,0.00035777543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985012,0.000043345473,0.00023030229,0.00034782535,0.0003311088,0.00054624816],"domain_scores_gemma":[0.9985991,0.0003234179,0.000045037665,0.0007491732,0.0000677415,0.00021549151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008088507,0.00014038158,0.00017642073,0.00009465963,0.00015088491,0.00026196954,0.0011362351,0.00007906699,0.000090831156],"category_scores_gemma":[0.00049211,0.0001144389,0.00009587042,0.0004006757,0.00018559601,0.00026820658,0.00040921583,0.00050854374,0.0004807273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002334046,0.00009441436,0.000036220492,0.000033148848,0.0000059395434,0.000019138692,0.00022269302,6.578486e-7,0.0026523003,0.72896445,0.00001137627,0.26795733],"study_design_scores_gemma":[0.0003437084,0.000085140055,0.000057152538,0.0000245388,0.0000045872926,0.00011729468,0.000035833997,0.018375782,0.00487288,0.9619864,0.013810045,0.00028663964],"about_ca_topic_score_codex":0.0000012660564,"about_ca_topic_score_gemma":0.0000039798647,"teacher_disagreement_score":0.33261356,"about_ca_system_score_codex":0.000011140977,"about_ca_system_score_gemma":0.000028895936,"threshold_uncertainty_score":0.61789376},"labels":[],"label_agreement":null},{"id":"W2072137480","doi":"10.1007/bf02773060","title":"The number of 2-sat functions","year":2003,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Monotone polygon; Upper and lower bounds; Combinatorics; Boolean function; Cube (algebra); Set (abstract data type); Discrete mathematics; Unit cube","score_opus":0.029281526372517862,"score_gpt":0.3220856672973955,"score_spread":0.29280414092487766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072137480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06762793,0.0003316215,0.9229824,0.00033598175,0.0003472328,0.000071090246,9.050047e-7,0.000010956799,0.008291875],"genre_scores_gemma":[0.62936735,0.0001404939,0.36819,0.000060170678,0.00005753702,0.0000027338117,7.054015e-8,0.00001846132,0.002163161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868274,0.00011870775,0.0004722693,0.0000617753,0.00048631907,0.00017819075],"domain_scores_gemma":[0.99780566,0.0008898864,0.00041646016,0.0004300966,0.00038521,0.00007267725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001589128,0.000073523835,0.0001656494,0.00006566519,0.00013004056,0.0000583342,0.00080031285,0.000027997174,0.000015202378],"category_scores_gemma":[0.0007052809,0.00004367528,0.00012652398,0.00034543456,0.000117449876,0.0001995933,0.00006647289,0.00021134623,0.000048367794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004140983,0.00013292342,0.00064685516,0.00002237195,0.000048090522,0.00001017107,0.0004470931,0.00008383695,0.0006075606,0.9941974,0.00046159577,0.00333796],"study_design_scores_gemma":[0.0004349008,0.00010721938,0.00014711043,0.00008107028,0.000018717657,0.0012106253,0.0017612987,0.0012386118,0.0046841316,0.9794634,0.010741526,0.00011141592],"about_ca_topic_score_codex":3.0365408e-7,"about_ca_topic_score_gemma":8.56228e-7,"teacher_disagreement_score":0.56173944,"about_ca_system_score_codex":0.00002120758,"about_ca_system_score_gemma":0.00009180499,"threshold_uncertainty_score":0.17810263},"labels":[],"label_agreement":null},{"id":"W2072209133","doi":"10.1016/j.disc.2004.10.026","title":"The recognition of bound quivers using edge-coloured homomorphisms","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University; Thompson Rivers University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Upper and lower bounds; Quiver; Discrete mathematics; Directed graph; Enhanced Data Rates for GSM Evolution; Graph; Time complexity; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.048571281772499336,"score_gpt":0.3108193656923948,"score_spread":0.2622480839198955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072209133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21963422,0.00019740804,0.7746121,0.000492794,0.00014487599,0.00038576193,0.000012479537,0.000085528256,0.0044348356],"genre_scores_gemma":[0.5467666,0.000054188764,0.4526936,0.000048199254,0.00006488842,0.00001630503,0.0000034533964,0.000023415778,0.00032934058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987654,0.000079115955,0.00030508765,0.00017813139,0.00037873685,0.00029351533],"domain_scores_gemma":[0.998599,0.0003917365,0.00019960434,0.0006005582,0.00014430907,0.00006481138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006718482,0.00011477096,0.00015929289,0.000079848935,0.00028843054,0.00011960521,0.0008172677,0.00004397344,0.000014903166],"category_scores_gemma":[0.00018594696,0.00008183132,0.000087335226,0.00037036696,0.00026705445,0.00036747727,0.00021828103,0.0001312447,0.000044141594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039943985,0.00024718273,0.00003808298,0.00016091563,0.0001236051,0.000012395545,0.007289156,0.0009992191,0.016817514,0.8802834,0.00036892085,0.09361965],"study_design_scores_gemma":[0.00045362723,0.00008841853,0.00003131793,0.00010095284,0.000022153863,0.000035430123,0.00082527957,0.26444048,0.025699915,0.7068673,0.0011879115,0.00024724807],"about_ca_topic_score_codex":0.0000024026363,"about_ca_topic_score_gemma":0.0000055051687,"teacher_disagreement_score":0.32713237,"about_ca_system_score_codex":0.000055097593,"about_ca_system_score_gemma":0.000052173524,"threshold_uncertainty_score":0.33369845},"labels":[],"label_agreement":null},{"id":"W2072365573","doi":"10.1016/s0304-3975(97)00300-9","title":"On computing graph minor obstruction sets","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","score_opus":0.013123453322863778,"score_gpt":0.28759454073442914,"score_spread":0.27447108741156534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072365573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26984137,0.000013435906,0.72020966,0.00043930198,0.0004443253,0.00018010043,0.0000011151411,0.00035046812,0.008520222],"genre_scores_gemma":[0.8570502,0.0000039484853,0.14219216,0.00062114873,0.00008371744,0.000003794944,6.565703e-7,0.000011320325,0.000033094544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601704,0.00022674484,0.00032260994,0.0011626026,0.0012526881,0.0010183224],"domain_scores_gemma":[0.99746823,0.0005644586,0.00005754612,0.0013080791,0.00017257089,0.0004291361],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015967779,0.0002627982,0.00023748283,0.00040613188,0.00088818563,0.00051407807,0.0035238971,0.00006551036,0.0002954858],"category_scores_gemma":[0.00008957656,0.00022305283,0.00010484537,0.0026048978,0.0036136296,0.0008790144,0.00063297764,0.00041289706,0.00055254006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017389797,0.00004452534,0.000015449808,0.000002858599,0.0000024138149,0.000015100317,0.00017043264,0.001642161,0.00017071847,0.7139547,0.000028101398,0.28393614],"study_design_scores_gemma":[0.00023175718,0.00028297375,0.0008684895,0.000026643724,0.0000015017648,0.00007195322,0.000002901633,0.35471627,0.0021743816,0.6413053,0.000079482525,0.00023829084],"about_ca_topic_score_codex":0.0000019234799,"about_ca_topic_score_gemma":2.1383835e-7,"teacher_disagreement_score":0.5872088,"about_ca_system_score_codex":0.00008446091,"about_ca_system_score_gemma":0.00008045011,"threshold_uncertainty_score":0.99909794},"labels":[],"label_agreement":null},{"id":"W2074364524","doi":"10.1002/jgt.20571","title":"On characterizing Vizing's edge colouring bound","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Domination analysis; Logarithm; Bounded function; Upper and lower bounds; Multiplicity (mathematics); Graph; Edge coloring; Discrete mathematics; Vertex (graph theory); Line graph; Graph power; Geometry","score_opus":0.038400955960673284,"score_gpt":0.27935740087532934,"score_spread":0.24095644491465606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074364524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7852529,0.00043347655,0.20317015,0.00014179491,0.0011568329,0.00013063685,0.0000013168109,0.00006986349,0.009643018],"genre_scores_gemma":[0.9904892,0.0000694464,0.00869442,0.00043506126,0.00012460958,0.0000030082422,1.222309e-7,0.000021960295,0.00016219872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979645,0.00041344672,0.00046363994,0.00023097209,0.0004936691,0.0004337466],"domain_scores_gemma":[0.9980632,0.00049359846,0.0004694742,0.0005212881,0.00022756743,0.00022488929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029325238,0.0001783079,0.0002926723,0.0007569166,0.00022712321,0.00010929887,0.0016193755,0.000069084075,0.00007428871],"category_scores_gemma":[0.0002516601,0.0001449583,0.00025555398,0.00055556244,0.00019808649,0.0010071996,0.00021001064,0.0006155914,0.00004098545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038093605,0.00016018876,0.00037534887,0.000012237436,0.00007855089,0.0002648162,0.0016810679,0.000006280493,0.011805712,0.9716611,0.000108800385,0.013464954],"study_design_scores_gemma":[0.0004932855,0.00069923344,0.0055397796,0.00012337681,0.000010148058,0.00023211872,0.000112504094,0.000039462993,0.019888667,0.9721775,0.0004966621,0.00018723692],"about_ca_topic_score_codex":7.655764e-7,"about_ca_topic_score_gemma":3.973961e-7,"teacher_disagreement_score":0.20523627,"about_ca_system_score_codex":0.000054690903,"about_ca_system_score_gemma":0.00008135458,"threshold_uncertainty_score":0.5911228},"labels":[],"label_agreement":null},{"id":"W2074524916","doi":"10.1007/s10732-013-9224-z","title":"Applying local search to the feedback vertex set problem","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Feedback arc set; Feedback vertex set; Directed acyclic graph; Local search (optimization); Vertex (graph theory); Simulated annealing; Set (abstract data type); Bidirectional search; Heuristic; Mathematical optimization; Representation (politics); Computer science; Graph; Greedy algorithm; Mathematics; Algorithm; Search algorithm; Theoretical computer science; Beam search; Best-first search; Line graph","score_opus":0.028701437529020143,"score_gpt":0.3008019868948117,"score_spread":0.27210054936579153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074524916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005885343,0.00014114783,0.98836106,0.0043391655,0.00026279697,0.0004362591,0.0000018885797,0.000017518883,0.0005547899],"genre_scores_gemma":[0.90378046,0.000037639165,0.09480002,0.0007337051,0.00018842141,0.000028093482,2.850902e-7,0.00001787185,0.00041349765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979837,0.00018703968,0.00039337736,0.00016175481,0.0008468653,0.00042725974],"domain_scores_gemma":[0.99799085,0.00044171588,0.00012735746,0.00046720236,0.00068984315,0.00028302826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011656696,0.00011591624,0.00018861343,0.00017318594,0.00018997553,0.00026501832,0.0018673914,0.00004064569,0.00003906632],"category_scores_gemma":[0.0002085931,0.000072529554,0.00008295212,0.0005974281,0.000104908526,0.00043063652,0.00046804134,0.0006100217,0.00043833524],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009629762,0.00022425201,0.0010888497,0.000102497346,0.0001347028,0.00029861348,0.0029873475,0.053445797,0.002618209,0.11275065,0.15818392,0.6680689],"study_design_scores_gemma":[0.0020715191,0.0025014372,0.0066204234,0.00039027617,0.00003994024,0.002128915,0.0022953618,0.40489352,0.0044555105,0.3445552,0.22906564,0.000982262],"about_ca_topic_score_codex":0.000010102439,"about_ca_topic_score_gemma":0.0000018073436,"teacher_disagreement_score":0.8978951,"about_ca_system_score_codex":0.00007987401,"about_ca_system_score_gemma":0.00014845966,"threshold_uncertainty_score":0.5634059},"labels":[],"label_agreement":null},{"id":"W2074859673","doi":"10.1006/jctb.2002.2130","title":"Branch-Width and Rota's Conjecture","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Conjecture; Finite field; Integer (computer science); Combinatorics; Mathematics; Field (mathematics); Finite set; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.011884428037992422,"score_gpt":0.24380569174866168,"score_spread":0.23192126371066926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074859673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5280987,0.02049893,0.37242305,0.012759652,0.03181093,0.0011208702,0.000013443088,0.00042157603,0.032852825],"genre_scores_gemma":[0.99513865,0.00029312776,0.0033559178,0.00013224636,0.00045168557,0.000002010913,1.0972339e-7,0.000015365606,0.00061089086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826264,0.00040842872,0.00037558546,0.00018163738,0.0004729013,0.00029880978],"domain_scores_gemma":[0.99842346,0.0004678391,0.00028697753,0.00037187073,0.00024353163,0.00020631016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012269632,0.00016683608,0.0003337053,0.0001905132,0.00017526932,0.00018637207,0.00090687425,0.00008936897,0.00015115947],"category_scores_gemma":[0.00039629222,0.00013274036,0.00010971737,0.00038110843,0.00027532314,0.0014287349,0.00021739789,0.00046562677,0.000010509723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017651681,0.000059804875,0.000076601566,0.000010534311,0.000042431457,0.000075059535,0.00062446523,0.000014647885,0.000716248,0.97593635,0.00060649746,0.021660848],"study_design_scores_gemma":[0.0012165741,0.00079390727,0.000104955485,0.000028152175,0.000007833305,0.00057647884,0.000044384433,0.00006611648,0.0031879987,0.97289866,0.020927122,0.00014782134],"about_ca_topic_score_codex":3.2560047e-7,"about_ca_topic_score_gemma":1.9096338e-7,"teacher_disagreement_score":0.46703994,"about_ca_system_score_codex":0.000034838347,"about_ca_system_score_gemma":0.00003669752,"threshold_uncertainty_score":0.54129946},"labels":[],"label_agreement":null},{"id":"W2074892433","doi":"10.1016/j.ipl.2007.08.005","title":"Approximation and inapproximability results for maximum clique of disc graphs in high dimensions","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Clique; Mathematics; Approximation algorithm; Set (abstract data type); Euclidean geometry; Euclidean space; Time complexity; Space (punctuation); Independent set; Euclidean distance; Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.014009683904518814,"score_gpt":0.278734077731017,"score_spread":0.2647243938264982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074892433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33173043,0.000010719155,0.66641986,0.001298894,0.00003418554,0.00035216994,0.000006072377,0.00004313643,0.00010453507],"genre_scores_gemma":[0.87428504,0.0000022708716,0.12524006,0.00040829237,0.000004887673,0.00003354115,0.000020854915,0.000003515261,0.0000015117388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986266,0.000045657373,0.0006266254,0.00018142202,0.00025315295,0.00026656888],"domain_scores_gemma":[0.9989404,0.0002811305,0.00028977336,0.00025845508,0.00017648478,0.000053732834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024668202,0.00010281671,0.00014156188,0.00047079584,0.000116905874,0.000088211076,0.00027140946,0.000056552853,1.8113617e-7],"category_scores_gemma":[0.00041785324,0.00009446874,0.000028440736,0.0007222319,0.00015358126,0.003441641,0.00009593443,0.00013578878,7.714761e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010483745,0.0002025775,0.005016157,0.0016792592,0.000017200213,0.0000026708824,0.02018859,0.0026069279,0.015174183,0.2687197,0.00020499839,0.68513936],"study_design_scores_gemma":[0.006837336,0.00032177535,0.0647092,0.00045526092,0.000011092544,0.00002570337,0.0011763069,0.17460242,0.04914262,0.70100796,0.0008844571,0.0008258522],"about_ca_topic_score_codex":0.000012307683,"about_ca_topic_score_gemma":0.0000060372918,"teacher_disagreement_score":0.6843135,"about_ca_system_score_codex":0.000051650066,"about_ca_system_score_gemma":0.00004143906,"threshold_uncertainty_score":0.38523236},"labels":[],"label_agreement":null},{"id":"W2075240586","doi":"10.1002/net.21505","title":"Optimal edge‐coloring with edge rate constraints","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Time complexity; Mathematics; Discrete mathematics; Indifference graph; Pooling; Sequence (biology); Matching (statistics); Chordal graph; Pathwidth; Computer science; Graph; Line graph","score_opus":0.01747177441735967,"score_gpt":0.25795359369669935,"score_spread":0.24048181927933968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075240586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049639832,0.00012431921,0.9410361,0.0002475885,0.00026672913,0.00033486544,3.416346e-7,0.00019551512,0.008154732],"genre_scores_gemma":[0.9458643,0.00001642217,0.052993357,0.00021317774,0.00018832108,0.00008699101,0.0000012521156,0.000016932476,0.000619202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985254,0.000110321766,0.00014492971,0.00039940263,0.00019596964,0.00062399014],"domain_scores_gemma":[0.9988388,0.00022270627,0.000054719178,0.0005506049,0.00013764275,0.0001955525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035685868,0.00015157305,0.00015421606,0.00007484403,0.00016806173,0.00022335252,0.0008571767,0.00007027969,0.0001425847],"category_scores_gemma":[0.000022879685,0.00012167996,0.000037470014,0.000497209,0.00031516465,0.0006919837,0.00029954768,0.00036986236,0.00022423759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008035345,0.00012652647,0.003858483,0.000022039321,0.00011403012,0.00018592986,0.00056140573,0.2914138,0.0008369469,0.22476988,0.006316654,0.47171396],"study_design_scores_gemma":[0.0012782932,0.00042545176,0.007874878,0.00009819348,0.000007477408,0.000093316645,0.00009980063,0.9736472,0.0010614911,0.011320993,0.0034383093,0.0006545903],"about_ca_topic_score_codex":0.0000052525365,"about_ca_topic_score_gemma":0.0000024861363,"teacher_disagreement_score":0.8962245,"about_ca_system_score_codex":0.00003137388,"about_ca_system_score_gemma":0.000052639807,"threshold_uncertainty_score":0.49619648},"labels":[],"label_agreement":null},{"id":"W2075457919","doi":"10.1016/j.jcss.2004.03.007","title":"A refined search tree technique for Dominating Set on planar graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Parameterized complexity; Vertex (graph theory); Independent set; Feedback vertex set; Planar graph; Discrete mathematics; Maximal independent set; Vertex cover; Time complexity; Chordal graph; Undirected graph; Graph; 1-planar graph","score_opus":0.04379541596315799,"score_gpt":0.331260597960581,"score_spread":0.287465181997423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075457919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038145754,0.00012505054,0.95991194,0.0007387158,0.00027307172,0.00028575366,0.0000021298265,0.00002785126,0.0004897452],"genre_scores_gemma":[0.7251117,0.0000064732862,0.2746974,0.000066073844,0.000096421114,0.000008645407,9.899759e-8,0.000004109925,0.000009084233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808675,0.00016160011,0.00042956494,0.00028688024,0.0007006604,0.00033452545],"domain_scores_gemma":[0.9986838,0.00048503684,0.00023560385,0.0001994509,0.00024507128,0.00015103957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00402237,0.00012802739,0.0002929351,0.00062772934,0.00040786582,0.00029699085,0.0012014009,0.000045203225,2.7705514e-7],"category_scores_gemma":[0.000031576103,0.000086481086,0.000113470516,0.0007019822,0.00020016954,0.00058834854,0.00010670298,0.0001894555,0.0000011136594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009803737,0.00006767442,0.0002286163,0.00017199827,0.00003192181,0.000108030006,0.0013366159,0.0037306852,0.004504334,0.95112497,0.00019252542,0.038404595],"study_design_scores_gemma":[0.013066116,0.0345981,0.005185315,0.0069077713,0.000046873774,0.013193561,0.0038656143,0.16934124,0.079591446,0.67061985,0.0016699312,0.0019141857],"about_ca_topic_score_codex":0.000003851062,"about_ca_topic_score_gemma":0.000001991597,"teacher_disagreement_score":0.68696594,"about_ca_system_score_codex":0.00006313835,"about_ca_system_score_gemma":0.00016672771,"threshold_uncertainty_score":0.35265964},"labels":[],"label_agreement":null},{"id":"W2075729213","doi":"10.1016/j.comgeo.2015.01.002","title":"Reprint of: Theta-3 is connected","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Austrian Science Fund","keywords":"Reprint; Graph; Computer science; Combinatorics; Connectivity; Mathematics; Physics","score_opus":0.0636802617194288,"score_gpt":0.3320432321922343,"score_spread":0.2683629704728055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075729213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14045861,0.00016719408,0.85498345,0.0006665093,0.00015390293,0.00010369868,0.0000062535846,0.00009613302,0.0033642284],"genre_scores_gemma":[0.8978684,0.0000014409842,0.10162482,0.00021960541,0.00002266004,0.0000050857902,0.000005642479,0.0000063127272,0.00024606413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985862,0.0000860534,0.0002385269,0.00031058068,0.00059128215,0.0001874019],"domain_scores_gemma":[0.99832386,0.00038729992,0.0000990397,0.00044630768,0.0005972407,0.00014625047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005749986,0.00008939046,0.0001492201,0.00032023355,0.000044344808,0.000036450077,0.0007642368,0.000036771835,0.00004576204],"category_scores_gemma":[0.00035918324,0.000084155916,0.00006241013,0.0012905515,0.000107680054,0.00024950376,0.00039458435,0.00011981911,0.00016105312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029384124,0.0001362511,0.0030125284,0.000017291637,0.000057242098,0.000031759937,0.0008755587,0.05992469,0.00021345369,0.9155505,0.0020053422,0.018146059],"study_design_scores_gemma":[0.00048766268,0.000088270186,0.008841949,0.000009615074,0.0000020416508,0.000052326577,0.0000567211,0.117582284,0.0016521915,0.86988,0.0012096443,0.00013727024],"about_ca_topic_score_codex":0.0000037733428,"about_ca_topic_score_gemma":1.6322231e-7,"teacher_disagreement_score":0.75740975,"about_ca_system_score_codex":0.00003520298,"about_ca_system_score_gemma":0.00015544692,"threshold_uncertainty_score":0.34317786},"labels":[],"label_agreement":null},{"id":"W2076192504","doi":"10.1016/s0020-0190(02)00364-2","title":"Parametric analysis of overall min-cuts and applications in undirected networks","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Minimum cut; Parametric statistics; Combinatorics; Maximum cut; Algorithm; Cut; Function (biology); Arc (geometry); Discrete mathematics; Ranging; Undirected graph; Computer science; Graph; Artificial intelligence; Geometry; Telecommunications; Statistics","score_opus":0.013917309012479045,"score_gpt":0.25349634715455605,"score_spread":0.239579038142077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076192504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103912435,0.00016178901,0.89493734,0.00035252012,0.00001055245,0.00013762448,0.000001348221,0.00005356642,0.00043280938],"genre_scores_gemma":[0.99089104,0.000022171485,0.008450998,0.000580027,0.00000446294,0.000028387347,0.000010274718,0.0000023041935,0.000010360133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917865,0.00003093323,0.00030217145,0.0001142444,0.000205596,0.00016842363],"domain_scores_gemma":[0.9993771,0.00012471482,0.00017495715,0.00020528049,0.00007683574,0.00004112327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019607505,0.000072662966,0.00013970371,0.0014020836,0.0000717578,0.0001294497,0.0002836451,0.00003380806,0.00000516398],"category_scores_gemma":[0.000045334204,0.00007031469,0.00003020483,0.0051401253,0.00006513116,0.0019320226,0.000058511163,0.000105995845,0.0000028104116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012590116,0.0000989762,0.040834993,0.00016246949,0.00015941354,0.0000017909446,0.0057543814,0.3390766,0.0003255669,0.014139104,0.00035664107,0.59907746],"study_design_scores_gemma":[0.00016858801,0.000007205516,0.02788239,0.000012509799,0.000017174882,0.0000010427239,0.000026260732,0.9707367,0.00006186766,0.00042729944,0.0005660886,0.000092892915],"about_ca_topic_score_codex":0.000008418915,"about_ca_topic_score_gemma":0.0000024235821,"teacher_disagreement_score":0.88697857,"about_ca_system_score_codex":0.000033479366,"about_ca_system_score_gemma":0.000007570689,"threshold_uncertainty_score":0.286735},"labels":[],"label_agreement":null},{"id":"W2076369652","doi":"10.1007/s004930100002","title":"Optimal Edge-Colourings for a Class of Planar Multigraphs","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Multigraph; Polytope; Discrete mathematics; Planar graph; Graph","score_opus":0.02340767389095119,"score_gpt":0.28925956485033,"score_spread":0.2658518909593788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076369652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24022941,0.0005791363,0.7516659,0.0009901214,0.0006686489,0.0009085305,0.000008849431,0.00030042522,0.0046489625],"genre_scores_gemma":[0.9457309,0.00004457699,0.05334697,0.00005871657,0.000020805612,0.00009918232,0.000001784138,0.000016542037,0.0006804697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986249,0.00005216266,0.00022889765,0.00036648885,0.00028637797,0.00044112362],"domain_scores_gemma":[0.99853,0.0003780149,0.00010356795,0.00063541136,0.00021196084,0.00014105233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032654003,0.00013572602,0.0002305489,0.00023174807,0.00013306255,0.00003378877,0.0012811688,0.0000710712,0.0000062625822],"category_scores_gemma":[0.00014532478,0.00013221089,0.0001297046,0.0008448622,0.000113038055,0.0002723723,0.00017814687,0.00014811067,0.000013346834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011766379,0.00035798768,0.0017483584,0.000045957324,0.000038015754,0.00004246586,0.00052520673,0.00011147073,0.0019958075,0.9828569,0.0029313972,0.009228733],"study_design_scores_gemma":[0.0049875122,0.0018752185,0.0034985195,0.000065282526,0.000018546663,0.000089663314,0.00010381232,0.036327515,0.01843462,0.7312207,0.20262328,0.00075529824],"about_ca_topic_score_codex":0.0000056650442,"about_ca_topic_score_gemma":5.389858e-7,"teacher_disagreement_score":0.70550156,"about_ca_system_score_codex":0.000046659858,"about_ca_system_score_gemma":0.000053988537,"threshold_uncertainty_score":0.53914034},"labels":[],"label_agreement":null},{"id":"W2076853283","doi":"10.5555/365411.365510","title":"Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)","year":2001,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Chordal graph; Treewidth; Mathematics; 1-planar graph; Graph coloring; Indifference graph; Discrete mathematics; Clique-sum; Brooks' theorem; Pathwidth; Independent set; Edge coloring; Maximal independent set; Split graph; Bounded function; Graph; Line graph; Graph power","score_opus":0.04164874076968241,"score_gpt":0.3105006895413826,"score_spread":0.2688519487717002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076853283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03309051,0.000034606506,0.9521062,0.0013988501,0.00018320838,0.001143462,0.0000076280935,0.00052274147,0.0115128355],"genre_scores_gemma":[0.80273265,0.000027147556,0.19333628,0.0005593964,0.000108761014,0.00040053032,0.000013549617,0.00003718908,0.0027844887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801934,0.000045686487,0.00025882493,0.0006102826,0.00040162104,0.0006642427],"domain_scores_gemma":[0.9986382,0.00030997166,0.00009588895,0.00059725187,0.00016615973,0.00019251902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044070382,0.00020597863,0.00019357674,0.00022498165,0.00030895884,0.00019935699,0.0007058536,0.000070159775,0.00005374156],"category_scores_gemma":[0.000048455804,0.00015732348,0.0000984316,0.0005912911,0.00012354804,0.0006533433,0.00008819672,0.00022513696,0.00004376858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015637401,0.0013895386,0.0045541576,0.00010740453,0.00023955289,0.00018075034,0.0009719869,0.0064339265,0.0061123488,0.5628403,0.011838661,0.40376765],"study_design_scores_gemma":[0.015004814,0.011790009,0.049184773,0.00050503685,0.00004590846,0.000395683,0.00036257945,0.12442671,0.06111624,0.65190226,0.081752606,0.0035133641],"about_ca_topic_score_codex":0.000022014814,"about_ca_topic_score_gemma":0.000055805856,"teacher_disagreement_score":0.7696422,"about_ca_system_score_codex":0.000048063583,"about_ca_system_score_gemma":0.0000830687,"threshold_uncertainty_score":0.64154655},"labels":[],"label_agreement":null},{"id":"W2076955343","doi":"10.1016/j.disc.2013.07.018","title":"List-homomorphism problems on graphs and arc consistency","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Homomorphism; Mathematics; Semilattice; Combinatorics; Bipartite graph; Discrete mathematics; Graph homomorphism; Consistency (knowledge bases); Idempotence; Arc (geometry); Graph; Line graph; Voltage graph","score_opus":0.02610413603892978,"score_gpt":0.267608695764183,"score_spread":0.24150455972525323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076955343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49445602,0.00081752235,0.40309945,0.005965848,0.00040229378,0.0037426273,0.000023886076,0.00115578,0.09033656],"genre_scores_gemma":[0.8958303,0.00006500169,0.102187544,0.0002822185,0.000014078589,0.00016380314,0.0000031482791,0.000032383774,0.0014215715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984974,0.000050192713,0.0002943621,0.00036727954,0.00040105375,0.00038967296],"domain_scores_gemma":[0.9984761,0.00028498523,0.000110794084,0.00083632296,0.00010879823,0.00018300366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031949807,0.00019728109,0.00023890403,0.00015784898,0.00017538153,0.0002717105,0.0006806558,0.000057195433,0.00006679288],"category_scores_gemma":[0.00011872,0.00015163983,0.00006825109,0.0003388539,0.00027718072,0.00040188624,0.00030643356,0.00020512441,0.00022395694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012012677,0.00006111623,0.000113490045,0.0001053157,0.000015922147,0.0000068221293,0.0012602523,0.0000058541664,0.0011078047,0.9942517,0.00038818075,0.002682296],"study_design_scores_gemma":[0.00023240187,0.000148728,0.00029209495,0.00009846255,0.00000450645,0.000032395375,0.00015054582,0.015855359,0.0005955256,0.9820526,0.00031712474,0.00022021832],"about_ca_topic_score_codex":0.000010292498,"about_ca_topic_score_gemma":0.0000026094021,"teacher_disagreement_score":0.40137422,"about_ca_system_score_codex":0.000015858346,"about_ca_system_score_gemma":0.00002066612,"threshold_uncertainty_score":0.6183693},"labels":[],"label_agreement":null},{"id":"W2077159664","doi":"10.1016/j.disc.2010.03.034","title":"The complexity of locally injective homomorphisms","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Injective function; Digraph; Homomorphism; Mathematics; Combinatorics; Tournament; Vertex (graph theory); Discrete mathematics; Antichain; Graph; Partially ordered set","score_opus":0.037456553879670465,"score_gpt":0.30552801845569166,"score_spread":0.2680714645760212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077159664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033872727,0.00003013674,0.9504555,0.0006474502,0.00020064051,0.0003157069,0.000009926349,0.00008493489,0.01438298],"genre_scores_gemma":[0.7864295,0.000005738142,0.21332271,0.000023477638,0.000019663496,0.000017142625,9.108753e-7,0.000011614462,0.00016923413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876416,0.00006088784,0.0002831987,0.00018900684,0.0004210081,0.0002817545],"domain_scores_gemma":[0.9979219,0.0005422151,0.0001623193,0.0010979107,0.00019733798,0.000078358695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075083785,0.00011804966,0.00017864374,0.00005392405,0.000231519,0.00009385561,0.0016932262,0.000045745208,0.000013500463],"category_scores_gemma":[0.0003620818,0.00007399918,0.0000842683,0.00037477346,0.0014544872,0.00018683932,0.00048699547,0.0003330531,0.000034077893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004194233,0.00003738273,0.000021518486,0.000018889556,0.000014134275,0.0000020038133,0.00079678104,0.000006985432,0.003094035,0.99307495,0.000036129084,0.0028930057],"study_design_scores_gemma":[0.00012331539,0.000057697576,0.00023676947,0.000012991303,0.0000030363153,0.000015178915,0.00020387009,0.02857706,0.009925287,0.960442,0.0003058098,0.000096968164],"about_ca_topic_score_codex":0.0000040948235,"about_ca_topic_score_gemma":0.000026967175,"teacher_disagreement_score":0.7525568,"about_ca_system_score_codex":0.000010439091,"about_ca_system_score_gemma":0.000052849748,"threshold_uncertainty_score":0.53591186},"labels":[],"label_agreement":null},{"id":"W2077203993","doi":"10.5555/338219.338231","title":"Weakly chordal graph algorithms via handles","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Chordal graph; Algorithm; Graph; Theoretical computer science","score_opus":0.01185173105347955,"score_gpt":0.27164410304080705,"score_spread":0.2597923719873275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077203993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0153615065,0.0011506528,0.9040505,0.0064302213,0.0017101513,0.0015636755,0.000121290024,0.0018443076,0.06776766],"genre_scores_gemma":[0.59008205,0.0035613277,0.3445601,0.004031515,0.0028119409,0.0010470686,0.00020989239,0.0005716953,0.053124428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497914,0.00032450253,0.00055985065,0.0014676694,0.0012938012,0.0013750101],"domain_scores_gemma":[0.99700093,0.00022943599,0.00012099515,0.0019327032,0.00014703585,0.00056889857],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00067890453,0.0005991103,0.00050386414,0.00047155665,0.00058452674,0.0004368707,0.0027009947,0.0002058485,0.00046939912],"category_scores_gemma":[0.00002223519,0.0005257035,0.00036137726,0.001537717,0.0004209768,0.001235818,0.00034311073,0.0006646394,0.001380009],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028224176,0.000601031,0.00017089183,0.000050766288,0.0002630247,0.00042711242,0.001284429,0.0033198714,0.015659744,0.060427018,0.0020917545,0.91542214],"study_design_scores_gemma":[0.0067933653,0.005536453,0.0033988701,0.00038900212,0.00010145643,0.00066595693,0.00021194835,0.400705,0.09491116,0.3552905,0.12632133,0.005674962],"about_ca_topic_score_codex":0.000069569716,"about_ca_topic_score_gemma":0.000007917479,"teacher_disagreement_score":0.9097472,"about_ca_system_score_codex":0.000109042354,"about_ca_system_score_gemma":0.00009073924,"threshold_uncertainty_score":0.99971944},"labels":[],"label_agreement":null},{"id":"W2077761942","doi":"10.1016/j.jcss.2005.02.003","title":"Kernels in planar digraphs","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Digraph; Combinatorics; Kernel (algebra); Vertex (graph theory); Mathematics; Planar; Set (abstract data type); Discrete mathematics; Computer science; Graph","score_opus":0.02316245338529533,"score_gpt":0.29162058749459785,"score_spread":0.2684581341093025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077761942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2615792,0.0014112348,0.7338789,0.0009080859,0.00043086265,0.000083146,4.0491094e-7,0.000023380451,0.0016847757],"genre_scores_gemma":[0.92574793,0.00003058634,0.07396845,0.00007190362,0.00016197351,6.2783164e-7,1.48489905e-8,0.0000018892407,0.000016619546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845797,0.0001539282,0.00041852036,0.00019132443,0.00052849454,0.00024976127],"domain_scores_gemma":[0.99926245,0.0001992567,0.00019049393,0.00014202463,0.000083354804,0.0001224366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020979012,0.00008757993,0.00022949593,0.0005322335,0.00011880394,0.00024570647,0.0010867374,0.000027070542,0.0000010391165],"category_scores_gemma":[0.0000091415495,0.000060083185,0.000057700898,0.00068776886,0.00015539888,0.001191697,0.000103952625,0.00014587032,0.000004127549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003899661,0.00014753797,0.044768576,0.00010065186,0.00003618443,0.0003438863,0.0041867215,0.01325051,0.0004485306,0.64266646,0.0009669395,0.29304498],"study_design_scores_gemma":[0.0029141475,0.0023317747,0.0775703,0.0012391781,0.0000098126075,0.0065732277,0.0013704636,0.8564266,0.0010996726,0.04192662,0.0077491733,0.0007890314],"about_ca_topic_score_codex":0.0000033410854,"about_ca_topic_score_gemma":0.0000051960437,"teacher_disagreement_score":0.84317607,"about_ca_system_score_codex":0.000031463176,"about_ca_system_score_gemma":0.00007270735,"threshold_uncertainty_score":0.2450121},"labels":[],"label_agreement":null},{"id":"W2077948344","doi":"10.1017/s0013091514000455","title":"Computational Complexity of Topological Invariants","year":2014,"lang":"en","type":"article","venue":"Proceedings of the Edinburgh Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computational complexity theory; Topological complexity; Reduction (mathematics); Mathematics; Space (punctuation); Graph; Theoretical computer science; Combinatorics; Discrete mathematics; Computer science; Algorithm; Pure mathematics; Geometry","score_opus":0.04770772190545817,"score_gpt":0.29962590540659545,"score_spread":0.25191818350113726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077948344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2778164,0.000017366205,0.7012965,0.0047760415,0.00016370654,0.00046408066,0.000005028373,0.00012495741,0.015335913],"genre_scores_gemma":[0.784246,0.0000015832122,0.21546087,0.00013182398,0.000043789718,0.000009027452,2.0774303e-7,0.0000053530002,0.0001013094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998222,0.000018980274,0.00042385267,0.00027283386,0.000772752,0.00028958393],"domain_scores_gemma":[0.9984049,0.0005474332,0.00026826063,0.00022264155,0.00046300935,0.00009372637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014033889,0.00013602927,0.0003403208,0.000026356116,0.0001480317,0.000041887062,0.0017343691,0.000092673734,0.000098910066],"category_scores_gemma":[0.0009932886,0.00008671757,0.00029893033,0.0005347622,0.0012253316,0.00030535038,0.0010011492,0.00024957221,0.0000034765696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047225203,0.00014103288,0.0008129786,0.00009394947,0.000024319274,2.5381327e-8,0.00062268594,0.00003915587,0.0017897909,0.9945405,0.0016655386,0.00026528307],"study_design_scores_gemma":[0.00021442695,0.00006029063,0.0012301301,0.000051406958,0.0000065332247,0.0000063175066,0.00009677049,0.095322825,0.0049034767,0.89797115,0.000052014824,0.000084657986],"about_ca_topic_score_codex":0.000001135791,"about_ca_topic_score_gemma":2.937443e-8,"teacher_disagreement_score":0.5064296,"about_ca_system_score_codex":0.00002782968,"about_ca_system_score_gemma":0.000026526786,"threshold_uncertainty_score":0.45147854},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Strong perfect graph theorem; Bipartite graph; Operator (biology); Characterization (materials science); Conjecture; Discrete mathematics; Chordal graph; 1-planar graph; Graph","score_opus":0.01201657952695493,"score_gpt":0.27144248370935536,"score_spread":0.2594259041824004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079074189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9347181,0.0056225974,0.05568738,0.00073065667,0.00013376579,0.0016625361,0.000018484387,0.00008268929,0.0013438243],"genre_scores_gemma":[0.97233224,0.0008821475,0.026032533,0.00006694326,0.00003399195,0.000109574314,0.0000039904085,0.00008127269,0.0004573244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949525,0.00040397962,0.0010825789,0.0009137372,0.0008445708,0.0018026226],"domain_scores_gemma":[0.9960911,0.0015538947,0.00026996748,0.0015529726,0.00025254212,0.00027948487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001488196,0.00060937385,0.0009773333,0.00038583283,0.0002164652,0.00047607048,0.0015580546,0.00027327996,0.00043115809],"category_scores_gemma":[0.0008436951,0.00053804065,0.00022282386,0.0015560755,0.0010765811,0.0010600231,0.0008982749,0.001119758,0.00029313803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006896924,0.0007572745,0.0072403722,0.0017818745,0.00031558657,0.00002694566,0.009910725,0.00058074796,0.02282015,0.9452093,0.00017492601,0.011113076],"study_design_scores_gemma":[0.0018688267,0.0014369097,0.0015551423,0.0009196403,0.00006581064,0.00009200981,0.0005126173,0.31619832,0.019590195,0.6563354,0.00027066085,0.0011544835],"about_ca_topic_score_codex":0.00018534923,"about_ca_topic_score_gemma":0.0001736981,"teacher_disagreement_score":0.31561756,"about_ca_system_score_codex":0.00019550086,"about_ca_system_score_gemma":0.0005014905,"threshold_uncertainty_score":0.9997071},"labels":[],"label_agreement":null},{"id":"W2079295608","doi":"10.1016/j.disc.2005.12.035","title":"Matrix partitions of perfect graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matrix (chemical analysis); Discrete mathematics","score_opus":0.016787369410474616,"score_gpt":0.303388922085106,"score_spread":0.2866015526746314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079295608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085042074,0.0001580198,0.89746046,0.00019796823,0.00005895173,0.00023123527,0.000017024484,0.00015297817,0.016681265],"genre_scores_gemma":[0.8295329,0.000008029962,0.16980378,0.000008434562,0.000015307845,0.000021994923,0.000004709739,0.000012606894,0.00059219735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886364,0.000048481215,0.00030619302,0.00018607445,0.00033353854,0.0002620676],"domain_scores_gemma":[0.9988667,0.00020112465,0.000116352174,0.0006810752,0.00008427719,0.000050485538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031122917,0.00011169628,0.00018571637,0.00014858165,0.000090508845,0.000051733787,0.0006420438,0.00003564733,0.00003415083],"category_scores_gemma":[0.00005716052,0.000093398114,0.00012306326,0.0005641064,0.00013739272,0.00023862418,0.00016668376,0.00009424399,0.000055055254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012028825,0.00007350019,0.00021296668,0.000065983695,0.000007991365,0.0000037628395,0.000212199,0.00021649353,0.0022345916,0.9965227,0.000263663,0.000184949],"study_design_scores_gemma":[0.0001416927,0.000047968908,0.00028349957,0.00003326308,0.000006980282,0.000011224656,0.000066092536,0.014476091,0.008338638,0.9762294,0.00024313673,0.00012199164],"about_ca_topic_score_codex":0.000007668895,"about_ca_topic_score_gemma":0.000004399098,"teacher_disagreement_score":0.74449086,"about_ca_system_score_codex":0.0000122139145,"about_ca_system_score_gemma":0.000022953584,"threshold_uncertainty_score":0.38086644},"labels":[],"label_agreement":null},{"id":"W2079313211","doi":"10.1016/j.jalgor.2004.02.001","title":"The dominating set problem is fixed parameter tractable for graphs of bounded genus","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Victoria","funders":"","keywords":"Bounded function; Mathematics; Combinatorics; Genus; Planar graph; Maximal independent set; Dominating set; Discrete mathematics; Set (abstract data type); Planar; Pathwidth; Chordal graph; 1-planar graph; Graph; Computer science; Line graph","score_opus":0.029409478559451214,"score_gpt":0.31751576923085983,"score_spread":0.28810629067140864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079313211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07631182,0.00069741346,0.919313,0.0026878025,0.00038759288,0.00044563893,0.000012341547,0.000017065515,0.00012728923],"genre_scores_gemma":[0.19951797,0.00010886613,0.7999569,0.00011580478,0.00010166453,0.000018714874,4.4109262e-7,0.000018830893,0.00016081896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814856,0.0000825439,0.0006106907,0.00017299538,0.00058129424,0.000403913],"domain_scores_gemma":[0.99742895,0.00087586086,0.00063038117,0.00035117278,0.0006009986,0.000112653404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019403176,0.00012744026,0.00027308657,0.00018149165,0.00028112717,0.00017039022,0.0011787959,0.000056864374,0.0000032659698],"category_scores_gemma":[0.00026391455,0.00008284775,0.00027083693,0.0004965146,0.0001524829,0.0006810447,0.000103265855,0.0003138821,0.0000015907546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005727804,0.0006092343,0.00025335434,0.00019641624,0.0006852918,0.000125774,0.0097559,0.0033595054,0.016123552,0.16363037,0.0016571943,0.8030306],"study_design_scores_gemma":[0.0022813245,0.0010003104,0.00016057774,0.000097316915,0.000019987876,0.00025997806,0.00025875343,0.008377116,0.052572116,0.93160856,0.0031979259,0.00016604141],"about_ca_topic_score_codex":0.0000067906835,"about_ca_topic_score_gemma":0.000002253594,"teacher_disagreement_score":0.8028646,"about_ca_system_score_codex":0.000069412534,"about_ca_system_score_gemma":0.00020290577,"threshold_uncertainty_score":0.33784333},"labels":[],"label_agreement":null},{"id":"W2079531625","doi":"10.1007/s00373-013-1306-z","title":"On the Roots of Domination Polynomials","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Bipartite graph; Limiting; Closure (psychology); Order (exchange); Graph; Plane (geometry); Discrete mathematics; Vertex (graph theory); Geometry","score_opus":0.012877419538516972,"score_gpt":0.24061513584615798,"score_spread":0.227737716307641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079531625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98212975,0.00025647227,0.011940568,0.0014598946,0.00025863468,0.00034141875,0.0000010477128,0.000045726123,0.0035664584],"genre_scores_gemma":[0.9994339,0.000048387898,0.00023521522,0.0001014849,0.0000029225398,0.000029702227,2.5028586e-7,0.0000041224457,0.00014403829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992442,0.000082476094,0.00012452563,0.00015994905,0.00023203634,0.00015679892],"domain_scores_gemma":[0.99896127,0.00042459674,0.00006509856,0.00038040898,0.000117236115,0.00005137028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032819615,0.0000747049,0.000098020515,0.00011814044,0.000120838864,0.00006577277,0.00047480583,0.000033133034,0.000012835057],"category_scores_gemma":[0.000084251245,0.000048626534,0.000037728663,0.0005266918,0.00009405325,0.00021136944,0.00013153256,0.0001009777,0.000012732691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002211987,0.000035539404,0.00032319606,0.0000041145304,0.000004982339,3.9110685e-7,0.00006518621,0.0000018659848,0.0007530031,0.9903109,0.0005758521,0.007922725],"study_design_scores_gemma":[0.00018355578,0.00012238795,0.008955276,0.0000070247706,0.0000011552845,0.0000012734994,0.000026948095,0.0009533537,0.0032194005,0.98634946,0.000120943165,0.000059213864],"about_ca_topic_score_codex":0.000015297535,"about_ca_topic_score_gemma":4.2589335e-7,"teacher_disagreement_score":0.017304096,"about_ca_system_score_codex":0.00000868621,"about_ca_system_score_gemma":0.000012606073,"threshold_uncertainty_score":0.19829325},"labels":[],"label_agreement":null},{"id":"W2079563996","doi":"10.1016/s0166-218x(03)00395-0","title":"Stable sets in two subclasses of banner-free graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Banner; Mathematics; Combinatorics; Chordal graph; Cograph; Characterization (materials science); Indifference graph; Discrete mathematics; Class (philosophy); Graph; Split graph; Maximal independent set; Time complexity; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.022515680311258036,"score_gpt":0.3050782653327763,"score_spread":0.28256258502151826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079563996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18547592,0.00014569932,0.71644616,0.00007758721,0.00010418667,0.0008293482,0.000018189236,0.0001628876,0.096740015],"genre_scores_gemma":[0.680966,0.00001887391,0.31881842,0.00002506444,0.000002990723,0.000057347785,0.0000021568285,0.000022509941,0.0000866069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981265,0.000056457084,0.0004651551,0.00035518652,0.0004992122,0.00049746543],"domain_scores_gemma":[0.9978173,0.00039375233,0.00016918159,0.00145126,0.00006677754,0.00010175525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082559756,0.00020158886,0.00036524612,0.0002776547,0.000060627597,0.000056824392,0.0013610935,0.000046081543,0.000027867776],"category_scores_gemma":[0.0002002218,0.00017916263,0.000074062256,0.0011048968,0.00014973058,0.00025642506,0.00031868782,0.0002027367,0.000023302138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005242907,0.00010989974,0.000111545785,0.000116556104,0.00001204417,0.000003823075,0.00075790874,0.00017334921,0.007961789,0.99035376,0.000094575,0.00029951322],"study_design_scores_gemma":[0.0007039746,0.000026149359,0.000045008877,0.000035142424,0.0000043870527,0.0000044196527,0.0004002292,0.0033063074,0.05874416,0.93635875,0.00017340531,0.0001980872],"about_ca_topic_score_codex":0.000005870012,"about_ca_topic_score_gemma":0.000020786127,"teacher_disagreement_score":0.4954901,"about_ca_system_score_codex":0.000030847852,"about_ca_system_score_gemma":0.00007068823,"threshold_uncertainty_score":0.730604},"labels":[],"label_agreement":null},{"id":"W2079618965","doi":"10.1016/s0095-8956(02)00046-1","title":"On the excluded minors for the matroids of branch-width k","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Class (philosophy); Mathematics; Computer science; Artificial intelligence","score_opus":0.018968047861716613,"score_gpt":0.27656494701472645,"score_spread":0.2575968991530098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079618965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23103474,0.0021738748,0.7260415,0.006776196,0.021854602,0.0017756781,0.000015050242,0.00006901582,0.010259322],"genre_scores_gemma":[0.9969416,0.000053883843,0.0021454452,0.00017001279,0.00020846703,0.000015142106,1.1034703e-7,0.00001784365,0.00044747395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975923,0.00081738783,0.0005097806,0.00014589907,0.00062472146,0.00030993487],"domain_scores_gemma":[0.99258566,0.005627857,0.0005169097,0.00070444256,0.0004833715,0.00008174829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050617666,0.00016520896,0.00031411523,0.0001201945,0.00031428007,0.000097536315,0.0019311083,0.00006200362,0.000060535112],"category_scores_gemma":[0.002346793,0.00008524781,0.00029652705,0.0004599555,0.00040940507,0.0004831013,0.00010425886,0.00037285732,0.0000032637197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008891834,0.00008365755,0.000013864417,0.0000109284865,0.00008441251,0.0000031705035,0.00041415563,0.000091585156,0.0011923066,0.99425983,0.0009818277,0.0019750562],"study_design_scores_gemma":[0.0010039925,0.0010745617,0.000045890043,0.000028609162,0.000015830765,0.000047671052,0.00021988993,0.000024083698,0.034928016,0.9508985,0.011621098,0.00009182242],"about_ca_topic_score_codex":4.3092703e-7,"about_ca_topic_score_gemma":3.136364e-7,"teacher_disagreement_score":0.7659069,"about_ca_system_score_codex":0.000040547795,"about_ca_system_score_gemma":0.00016783508,"threshold_uncertainty_score":0.3588512},"labels":[],"label_agreement":null},{"id":"W2080300451","doi":"10.1016/j.dam.2011.10.013","title":"Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Clique-sum; Random graph; Partial k-tree; Chordal graph; 1-planar graph; Vertex (graph theory); Discrete mathematics; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.020404195276392634,"score_gpt":0.2513674268184035,"score_spread":0.23096323154201087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080300451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15437979,0.00042448097,0.82477236,0.000060368846,0.00025806582,0.0020304844,0.000036305766,0.00040060267,0.017637573],"genre_scores_gemma":[0.8502736,0.00032225047,0.14886795,0.000055330525,0.000017967775,0.00027634855,0.000012836237,0.000072797404,0.00010093358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996352,0.0001720025,0.0010676067,0.00082518044,0.00083375967,0.000749432],"domain_scores_gemma":[0.99616325,0.0008217583,0.0005601683,0.0019641728,0.00017753677,0.0003130985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017389157,0.00055264897,0.0011234429,0.000760114,0.00028242066,0.0001270175,0.0019049734,0.00019860228,0.000045395744],"category_scores_gemma":[0.00018758047,0.00045120984,0.00041971737,0.0013146128,0.00083826995,0.0005523868,0.0007939066,0.00044253113,0.000015762533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023801625,0.00033342585,0.00026062666,0.00044020175,0.00027718305,0.000011706918,0.009900179,0.000013515325,0.008789586,0.9699955,0.0002742955,0.007323595],"study_design_scores_gemma":[0.019129861,0.00018740774,0.00020668094,0.0001343097,0.000109845205,0.000038784878,0.0010452637,0.0036871112,0.017132433,0.95776665,0.00004376556,0.0005178716],"about_ca_topic_score_codex":0.00003064266,"about_ca_topic_score_gemma":0.00004573094,"teacher_disagreement_score":0.6958938,"about_ca_system_score_codex":0.00002885063,"about_ca_system_score_gemma":0.000045036824,"threshold_uncertainty_score":0.99979395},"labels":[],"label_agreement":null},{"id":"W2080513783","doi":"10.1016/j.ecj.2006.06.009","title":"K 5 -free bound for the class of planar graphs","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Vertex (graph theory); Outerplanar graph; Homomorphism; Discrete mathematics; Line graph; Pathwidth","score_opus":0.022848952033645193,"score_gpt":0.28644739144764986,"score_spread":0.2635984394140047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080513783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004182939,0.00021527667,0.9839596,0.001939521,0.0001014492,0.00027983877,0.000011095771,0.00006243957,0.009247809],"genre_scores_gemma":[0.8461973,0.000020464502,0.14487703,0.0004134065,0.00008329578,0.00009934864,0.000003301241,0.00001800511,0.008287854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992314,0.000025944735,0.00012902712,0.0001687784,0.00022237653,0.00022246882],"domain_scores_gemma":[0.9983618,0.00065555016,0.000038473783,0.00083876605,0.000081014034,0.00002434339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000340906,0.00006129826,0.000079599406,0.00007343264,0.00012408904,0.0000441972,0.0015977424,0.000023804572,0.0000093567305],"category_scores_gemma":[0.000047563943,0.0000373663,0.00007292426,0.0003399653,0.00016091982,0.00015805817,0.00014302155,0.00005884943,0.0000037261862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009398845,0.000017884351,0.00021960642,0.000005142649,0.000006833595,6.0905245e-7,0.00002070748,0.000055444638,0.0007837354,0.987346,0.009376104,0.0021585326],"study_design_scores_gemma":[0.00028545424,0.00006124798,0.0012898751,0.000002204295,0.0000018758923,0.0000019102647,0.00002106997,0.005880635,0.0054522813,0.97600925,0.010937832,0.000056378663],"about_ca_topic_score_codex":0.000074317715,"about_ca_topic_score_gemma":0.00014509588,"teacher_disagreement_score":0.8420144,"about_ca_system_score_codex":0.000007819393,"about_ca_system_score_gemma":0.000026143485,"threshold_uncertainty_score":0.29690295},"labels":[],"label_agreement":null},{"id":"W2080527130","doi":"10.1016/s0024-3795(00)00088-4","title":"P-matrix completions under weak symmetry assumptions","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Symmetric matrix; Combinatorics; Nonnegative matrix; Matrix (chemical analysis); Sign (mathematics); Hollow matrix; Involutory matrix; Integer matrix; Centrosymmetric matrix; Pascal matrix; Square matrix; Skew-symmetric matrix; Block matrix; Discrete mathematics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.02234872726635052,"score_gpt":0.315504700188579,"score_spread":0.2931559729222285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080527130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016819837,0.0012408235,0.96086216,0.0051902435,0.000036849713,0.0007181459,0.000056176414,0.00043374172,0.014642048],"genre_scores_gemma":[0.9014346,0.0012886488,0.07711384,0.0008485354,0.00029888967,0.00075667654,0.000079938654,0.00004402602,0.018134842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988173,0.00005619079,0.00020933656,0.00041446023,0.00020660166,0.00029608113],"domain_scores_gemma":[0.9988642,0.00020109153,0.000036157166,0.0006211034,0.00009229582,0.00018515684],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001480096,0.00012939463,0.00013050718,0.00014270737,0.0005759766,0.000100944475,0.0005833705,0.00006387027,0.0004104508],"category_scores_gemma":[0.0000131730385,0.0001264307,0.00005608264,0.0008893091,0.00010128967,0.00035442956,0.00012823833,0.00021347745,0.0013452742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014926324,0.00007615405,0.000031395313,0.000006270948,0.000012524569,2.9647111e-7,0.00003740241,0.00015288776,0.00060058915,0.9818218,0.00031877647,0.01694042],"study_design_scores_gemma":[0.00053553114,0.000068122,0.004588408,0.000016287027,0.00002338881,0.00005833258,0.00007812366,0.06428534,0.0006387163,0.4711967,0.4580319,0.0004791377],"about_ca_topic_score_codex":0.0000045349475,"about_ca_topic_score_gemma":0.000004321022,"teacher_disagreement_score":0.88461477,"about_ca_system_score_codex":0.000019022391,"about_ca_system_score_gemma":0.000035998866,"threshold_uncertainty_score":0.99943227},"labels":[],"label_agreement":null},{"id":"W2080754473","doi":"10.1016/j.dam.2011.03.017","title":"Acyclic chromatic indices of planar graphs with large girth","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Edge coloring; Mathematics; Girth (graph theory); Planar graph; Directed acyclic graph; Graph; Chromatic scale; Discrete mathematics; Graph power; Line graph","score_opus":0.023512222786875547,"score_gpt":0.25689347813527696,"score_spread":0.23338125534840143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080754473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13274902,0.000053152544,0.8356657,0.000018402896,0.000024658362,0.00057526364,0.000015467587,0.00018426325,0.03071409],"genre_scores_gemma":[0.65156907,0.000010255076,0.34827,0.000028825192,0.000005312148,0.00005666043,0.00000388439,0.000023148998,0.00003286512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982074,0.000026159461,0.00039760856,0.00033823572,0.0005540469,0.00047657895],"domain_scores_gemma":[0.99825317,0.00016614323,0.00032561654,0.0010733466,0.000050711722,0.00013101521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043401594,0.000231269,0.00038388494,0.00024370254,0.00011107715,0.000038673672,0.0013807613,0.000065517335,0.000043792057],"category_scores_gemma":[0.000021825497,0.00016641903,0.00006812817,0.0007325074,0.00021529724,0.000279128,0.00022735425,0.00017973228,0.000054137334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018972136,0.0001801017,0.00019167019,0.00028526885,0.00006539164,0.000009953752,0.007549367,0.0000022075003,0.0017063186,0.9894678,0.000020598754,0.00050236617],"study_design_scores_gemma":[0.000820613,0.00022982297,0.00093133823,0.00012515718,0.000031579933,0.000021499745,0.0015170656,0.0021150848,0.021969052,0.9718056,0.000058521036,0.0003747175],"about_ca_topic_score_codex":0.000003418116,"about_ca_topic_score_gemma":0.000007428056,"teacher_disagreement_score":0.51882005,"about_ca_system_score_codex":0.000012699407,"about_ca_system_score_gemma":0.000040839932,"threshold_uncertainty_score":0.67863715},"labels":[],"label_agreement":null},{"id":"W2081110589","doi":"10.1016/j.disc.2015.01.034","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-Degree free spanning forests in graphs","year":2015,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Honjo International Scholarship Foundation","keywords":"Combinatorics; Mathematics; Degree (music); Spanning tree; Minimum degree spanning tree; Connected dominating set; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.034849909263913265,"score_gpt":0.27708938093796787,"score_spread":0.2422394716740546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081110589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9045091,0.0032068712,0.026862767,0.0012122104,0.003759875,0.00047181427,0.0014868063,0.0010199624,0.05747054],"genre_scores_gemma":[0.958346,0.0011579306,0.031613197,0.0013061604,0.0021424755,0.0019535592,0.0011551626,0.0015773679,0.0007481469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97725224,0.0011643283,0.0045675333,0.0043077734,0.0068240482,0.0058840797],"domain_scores_gemma":[0.9822287,0.004033731,0.004135962,0.0059636384,0.00078448636,0.0028534802],"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.006771366,0.0025769805,0.0014439982,0.0016871475,0.0027618436,0.0037017823,0.008415476,0.0035500014,0.004434233],"category_scores_gemma":[0.0059116394,0.003834382,0.0033042068,0.0039881347,0.00382963,0.004127075,0.0078644855,0.0045024254,0.0034623265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001511111,0.000995591,0.00007405176,0.0026922326,0.0017981888,0.0022851366,0.008535788,0.0039513167,0.0017156888,0.9386195,0.034189407,0.0036320162],"study_design_scores_gemma":[0.0051772464,0.0032263175,0.00017399093,0.0045207837,0.0016819398,0.0024878078,0.0055896556,0.7563269,0.17230287,0.039976794,0.004193119,0.004342553],"about_ca_topic_score_codex":0.0012994212,"about_ca_topic_score_gemma":0.001989621,"teacher_disagreement_score":0.89864266,"about_ca_system_score_codex":0.00013250712,"about_ca_system_score_gemma":0.0024240608,"threshold_uncertainty_score":0.9988814},"labels":[],"label_agreement":null},{"id":"W2081191210","doi":"10.1016/j.ejc.2013.06.023","title":"Obstructions to locally injective oriented improper colourings","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Injective function; Mathematics; Substructure; Combinatorics; Time complexity; Decision problem; Discrete mathematics; Algorithm","score_opus":0.010618255854592492,"score_gpt":0.23893658910515012,"score_spread":0.22831833325055761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081191210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33385375,0.00007844599,0.65605044,0.0009981177,0.001343661,0.0002480757,6.514163e-7,0.000062828534,0.007364023],"genre_scores_gemma":[0.9799467,0.000011278414,0.01903525,0.0002137954,0.00007808238,0.0000029415608,1.1979037e-7,0.000027086115,0.0006847836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979509,0.00047743384,0.00045669472,0.00021453372,0.00055201224,0.00034841773],"domain_scores_gemma":[0.99722075,0.000112540234,0.00025385924,0.00043427778,0.0015644241,0.0004141187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009455921,0.0001471561,0.00020904621,0.00037484246,0.00017232535,0.00018376087,0.0014849154,0.00001964293,0.000029492216],"category_scores_gemma":[0.00041891748,0.000121959165,0.00009801323,0.0012377593,0.000079782294,0.00093066506,0.0005045375,0.0005095041,0.00038502063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103969156,0.00055267767,0.0024377615,0.000024582894,0.00016426745,0.00074272987,0.003807627,0.0012090806,0.011781701,0.9025948,0.01297004,0.063610755],"study_design_scores_gemma":[0.009687044,0.016937261,0.17676258,0.00047524713,0.00006755397,0.0031707794,0.0019454194,0.00428901,0.021610722,0.590703,0.17193079,0.0024205833],"about_ca_topic_score_codex":0.0000021433311,"about_ca_topic_score_gemma":1.5090095e-7,"teacher_disagreement_score":0.6460929,"about_ca_system_score_codex":0.00013560499,"about_ca_system_score_gemma":0.00009783632,"threshold_uncertainty_score":0.49733505},"labels":[],"label_agreement":null},{"id":"W2081625090","doi":"10.1016/j.disc.2014.03.006","title":"Edge-critical cops and robber in planar graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.01873342575711553,"score_gpt":0.30105570400728,"score_spread":0.2823222782501645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081625090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039764285,0.00011747088,0.9481064,0.00097431755,0.000089107656,0.00019352279,0.0000036223455,0.00010581367,0.010645452],"genre_scores_gemma":[0.7838978,0.000018132385,0.21568942,0.00016539144,0.000020929345,0.000022223814,0.0000017286314,0.000018716088,0.00016565266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987692,0.00009612463,0.00023174072,0.00028194714,0.00026837832,0.00035259032],"domain_scores_gemma":[0.9985304,0.00074234494,0.000033396456,0.00052720815,0.000037510148,0.00012915253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063972134,0.00013028496,0.00020787395,0.00015529098,0.000073392446,0.00011380836,0.00052633265,0.000053399624,0.000010873662],"category_scores_gemma":[0.00049045176,0.000109160304,0.000036502548,0.0003308441,0.00020471656,0.0002749162,0.00020002112,0.0001869725,0.000039732837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022198683,0.000032205164,0.00040716128,0.00007330324,0.0000033689398,0.000008280392,0.00073144975,0.000005863801,0.00015912698,0.9967693,0.000083610386,0.001724096],"study_design_scores_gemma":[0.00022124691,0.000054810673,0.00044190386,0.000061491075,0.0000026145167,0.000023605167,0.00011480614,0.0564696,0.00025004704,0.9417648,0.00043642588,0.0001586483],"about_ca_topic_score_codex":0.0000019660627,"about_ca_topic_score_gemma":0.000006616778,"teacher_disagreement_score":0.74413353,"about_ca_system_score_codex":0.000011971614,"about_ca_system_score_gemma":0.000011477218,"threshold_uncertainty_score":0.4451428},"labels":[],"label_agreement":null},{"id":"W2081923266","doi":"10.1016/j.disopt.2005.11.001","title":"Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Edmond de Rothschild Foundation; University of Haifa","keywords":"Digraph; Combinatorics; Mathematics; Disjoint sets; Transitive relation; Vertex (graph theory); Discrete mathematics; Time complexity; Graph","score_opus":0.010924037940400132,"score_gpt":0.2639048718195904,"score_spread":0.25298083387919024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081923266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057341423,0.00019637374,0.93987924,0.00026993753,0.000051784264,0.0002731009,0.000010229439,0.000117273405,0.0018606499],"genre_scores_gemma":[0.9238585,0.000077792356,0.07584306,0.0000399538,0.000015314628,0.00002508715,0.00006502044,0.000017136515,0.000058094563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985307,0.0001463612,0.0002480313,0.0004708122,0.00024649917,0.000357607],"domain_scores_gemma":[0.9993797,0.00013773215,0.00007079874,0.00028053718,0.000064115346,0.000067142566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023788451,0.00016813727,0.00018152481,0.0003509352,0.00015816277,0.00014276139,0.00030819795,0.000070224414,0.0000122235715],"category_scores_gemma":[0.000026395539,0.00016567667,0.00004182166,0.00089521974,0.000114733986,0.0008711408,0.00009719954,0.00015441429,0.0000033007425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019776604,0.00038675973,0.015268351,0.000086416534,0.000046267105,0.00011153561,0.002767106,0.2750591,0.013919096,0.6678979,0.00007437456,0.02418538],"study_design_scores_gemma":[0.00072912103,0.00007212375,0.014015041,0.000059938076,0.000004274228,0.000010427331,0.000080966754,0.9417709,0.0014910125,0.04147549,0.000027821292,0.00026288067],"about_ca_topic_score_codex":0.00006630516,"about_ca_topic_score_gemma":0.00005940466,"teacher_disagreement_score":0.8665171,"about_ca_system_score_codex":0.00004638874,"about_ca_system_score_gemma":0.000022519405,"threshold_uncertainty_score":0.6756099},"labels":[],"label_agreement":null},{"id":"W2082259377","doi":"10.1002/net.21590","title":"Formulations and exact solution approaches for the degree preserving spanning tree problem","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Spanning tree; Degree (music); Minimum spanning tree; Mathematical optimization; Tree (set theory); Mathematics; Computer science; Minimum degree spanning tree; Distributed minimum spanning tree; Combinatorics","score_opus":0.22542077035339705,"score_gpt":0.3143817814222265,"score_spread":0.08896101106882945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082259377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008415818,0.0012433776,0.9941432,0.0008115461,0.00007794804,0.0005433283,4.964782e-7,0.000081655366,0.0022568733],"genre_scores_gemma":[0.86360824,0.000014427148,0.13571773,0.00003625269,0.0001677409,0.00016260272,0.0000030765088,0.000011400876,0.00027851746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990687,0.000063495914,0.00012029811,0.00023998531,0.0001729143,0.00033461166],"domain_scores_gemma":[0.9988685,0.0005061012,0.00005418465,0.00039869457,0.00008056139,0.00009192064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009528588,0.00008787967,0.00008330131,0.000047253514,0.00034718463,0.00015908858,0.00055603974,0.000053581563,6.7068277e-7],"category_scores_gemma":[0.000088678105,0.0000620687,0.000033695593,0.00027946054,0.00006450329,0.000592183,0.0003684598,0.00015603872,9.2596156e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034557026,0.00002127836,0.0021300465,0.000013945132,0.000026805266,6.7541777e-7,0.0009529788,0.21658109,0.0000107942,0.20420566,0.001983505,0.5740387],"study_design_scores_gemma":[0.00025072353,0.00005020091,0.0019984406,0.000012502902,0.000004848038,0.0000044049957,0.000049378235,0.91699517,0.00000728915,0.078909725,0.001643979,0.00007331583],"about_ca_topic_score_codex":0.000008191551,"about_ca_topic_score_gemma":0.000055045923,"teacher_disagreement_score":0.8627667,"about_ca_system_score_codex":0.000028734616,"about_ca_system_score_gemma":0.000031958814,"threshold_uncertainty_score":0.26702985},"labels":[],"label_agreement":null},{"id":"W2082273344","doi":"10.1016/s0304-3975(02)00577-7","title":"On the k-path partition of graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Indifference graph; Longest path problem; Discrete mathematics; Bipartite graph; Cograph; Pathwidth; Hamiltonian path problem; Complete bipartite graph; Partition (number theory); Frequency partition of a graph; Hamiltonian path; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.017306891891451286,"score_gpt":0.28038951099357523,"score_spread":0.26308261910212394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082273344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075122885,0.000014182952,0.91324955,0.0006221931,0.00023720946,0.00017211649,7.7761854e-7,0.00006914843,0.010511965],"genre_scores_gemma":[0.95819676,0.0000033520648,0.04132639,0.00044160357,0.000010426659,0.00000976929,9.517568e-8,0.000004922326,0.0000066697075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974553,0.00037691215,0.00021848912,0.0005015952,0.0009416962,0.0005059841],"domain_scores_gemma":[0.9973496,0.0010373998,0.000066100256,0.0011812191,0.00020369346,0.00016195516],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003219266,0.0001308041,0.00014230865,0.00018651673,0.00039434005,0.00013968186,0.0024747974,0.000029443867,0.00007471521],"category_scores_gemma":[0.00048682865,0.00007990205,0.00007451651,0.0020333498,0.0045209057,0.000369831,0.00036778668,0.00022163632,0.000063169304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005778811,0.000055682573,0.000021975506,0.0000024249662,0.000001991301,0.0000029176476,0.00013772672,0.00014235338,0.00089237315,0.9955205,0.00003494986,0.0031813406],"study_design_scores_gemma":[0.00009776585,0.00025698272,0.0001631166,0.000018357012,0.0000010524367,0.000010749565,0.000005516613,0.0457783,0.030895768,0.9226259,0.000049618684,0.00009690084],"about_ca_topic_score_codex":4.2256116e-7,"about_ca_topic_score_gemma":8.346612e-8,"teacher_disagreement_score":0.88307387,"about_ca_system_score_codex":0.000025403891,"about_ca_system_score_gemma":0.00009409711,"threshold_uncertainty_score":0.9981882},"labels":[],"label_agreement":null},{"id":"W2082613046","doi":"10.1002/net.10098","title":"On the power of BFS to determine a graph's diameter","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Lexicographical order; Upper and lower bounds; Graph; Mathematics; Constant (computer programming); Induced subgraph; Discrete mathematics; Algorithm; Computer science","score_opus":0.020818701944480714,"score_gpt":0.27063153885149,"score_spread":0.24981283690700928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082613046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051503483,0.000119256765,0.9392393,0.00038877584,0.00024879462,0.0002524213,5.965861e-7,0.00003899047,0.008208379],"genre_scores_gemma":[0.98919123,0.000005307319,0.0093497215,0.0011910046,0.00001594573,0.000026377696,1.2070208e-7,0.00000932459,0.00021096268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886715,0.00018715109,0.00013487702,0.00024417846,0.0002462261,0.0003204402],"domain_scores_gemma":[0.99826455,0.00070177484,0.00003958109,0.00084656704,0.000058703656,0.00008884704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005474329,0.00009696354,0.000114867,0.000096696676,0.000070377,0.000035237637,0.0007775383,0.000040872623,0.0000669377],"category_scores_gemma":[0.0001915337,0.000062531035,0.00007231245,0.0007830695,0.000071979826,0.00008550735,0.00012474523,0.00018764753,0.000029196342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029781088,0.000069236215,0.00036474763,0.0000022683025,0.000022625896,0.000013070273,0.0003614773,0.010180415,0.00026354645,0.9632272,0.004087073,0.021378558],"study_design_scores_gemma":[0.0010096508,0.0019934226,0.003723986,0.00016063577,0.0000123448135,0.000035556783,0.000072256335,0.046339065,0.011495884,0.91081595,0.023514148,0.0008270672],"about_ca_topic_score_codex":0.0000011294788,"about_ca_topic_score_gemma":0.000003083429,"teacher_disagreement_score":0.93768775,"about_ca_system_score_codex":0.0000105888175,"about_ca_system_score_gemma":0.000012936587,"threshold_uncertainty_score":0.25499418},"labels":[],"label_agreement":null},{"id":"W2083057776","doi":"10.1016/j.dam.2004.03.001","title":"A polynomial time algorithm for strong edge coloring of partial k-trees","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Time complexity; Combinatorics; Enhanced Data Rates for GSM Evolution; Algorithm; Edge coloring; Polynomial; Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.021726425792253926,"score_gpt":0.28840991294514706,"score_spread":0.26668348715289314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083057776","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009031251,0.000020172636,0.9881418,0.00006132313,0.00006020797,0.00069817,0.000030477633,0.00010960066,0.0018470424],"genre_scores_gemma":[0.15952605,0.0000025629795,0.8400511,0.000013599912,0.00009003978,0.00018411268,0.000009347683,0.000029031784,0.000094133335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985113,0.000010098154,0.00038324416,0.0003157565,0.00033330644,0.00044626434],"domain_scores_gemma":[0.99882865,0.00023505127,0.00018092028,0.00058296975,0.00006440022,0.00010801823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003720706,0.00018139712,0.00033324544,0.00010851708,0.00011797958,0.000061914216,0.0008459535,0.000066495275,0.0000068759828],"category_scores_gemma":[0.00004005782,0.00016396993,0.00011585912,0.00027161595,0.00014545993,0.00019382984,0.0003090372,0.00011446675,0.00004541905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000369555,0.0002284888,0.0000020735429,0.0001414017,0.00008092541,0.000003875153,0.0021451805,0.001456008,0.041055772,0.9230317,0.00013063179,0.031687],"study_design_scores_gemma":[0.0041208393,0.00047994385,0.000023090934,0.00013571489,0.000057223035,0.000014576256,0.00064882485,0.27858278,0.34221375,0.37193027,0.0010065992,0.0007863742],"about_ca_topic_score_codex":0.0000017371608,"about_ca_topic_score_gemma":9.6151e-7,"teacher_disagreement_score":0.5511014,"about_ca_system_score_codex":0.000053310778,"about_ca_system_score_gemma":0.00008751987,"threshold_uncertainty_score":0.66865},"labels":[],"label_agreement":null},{"id":"W2083082533","doi":"10.1145/1798596.1798599","title":"An approximation algorithm for the maximum leaf spanning arborescence problem","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Subroutine; Spanning tree; Combinatorics; Mathematics; Approximation algorithm; Class (philosophy); Discrete mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.024266179078183056,"score_gpt":0.3062330322091877,"score_spread":0.2819668531310046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083082533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028304599,0.00002709639,0.9958711,0.0017103849,0.0006601535,0.0009843943,0.000026827998,0.0003529081,0.00008408359],"genre_scores_gemma":[0.042200472,0.000023378121,0.95666593,0.0001789696,0.00013799347,0.00059681956,0.0000055789405,0.000034806584,0.00015604416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979324,0.00008585121,0.00027175224,0.0006537569,0.0004997123,0.0005565318],"domain_scores_gemma":[0.9968979,0.00063153653,0.00008977633,0.0019749412,0.00023208841,0.00017378521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008929633,0.0002321978,0.00016466028,0.00022495068,0.0009484427,0.00030520887,0.0025933564,0.00012366076,0.000028161527],"category_scores_gemma":[0.000054029653,0.00017887162,0.00013189197,0.00076917664,0.00021562258,0.0011502884,0.00002680971,0.0007956313,0.000035061923],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011157167,0.00015866237,0.0000023281686,0.0000075842327,0.00002170044,0.0000020814634,0.0003669115,0.0015727979,0.0031870464,0.0063260365,0.000011444241,0.9883323],"study_design_scores_gemma":[0.00055189064,0.00031849023,0.00016628958,0.00001578601,0.00001512948,0.000032425112,0.00014251008,0.8670442,0.018361151,0.111151814,0.0019120652,0.00028821104],"about_ca_topic_score_codex":0.000026057109,"about_ca_topic_score_gemma":0.00002110233,"teacher_disagreement_score":0.988044,"about_ca_system_score_codex":0.00003713096,"about_ca_system_score_gemma":0.00008584627,"threshold_uncertainty_score":0.729475},"labels":[],"label_agreement":null},{"id":"W2083261017","doi":"10.1016/j.disc.2008.06.011","title":"Hamiltonicity in vertex envelopes of plane cubic graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal; Texas A and M University","keywords":"Bipartite graph; Combinatorics; Mathematics; Hamiltonian path problem; Cubic graph; Vertex (graph theory); Discrete mathematics; Pancyclic graph; Hamiltonian path; Foster graph; 1-planar graph; Line graph; Graph; Graph power; Voltage graph","score_opus":0.030867328028344927,"score_gpt":0.2816540099414354,"score_spread":0.2507866819130905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083261017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77567095,0.00023895576,0.21499404,0.00011689189,0.000081915176,0.00032682,0.000011088364,0.000101190904,0.008458169],"genre_scores_gemma":[0.9071171,0.00011754845,0.09249038,0.000026879776,0.0000038142755,0.000013985701,0.0000028141235,0.000012766119,0.00021466285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985486,0.000065886125,0.00038578414,0.00024909212,0.0004218114,0.00032881755],"domain_scores_gemma":[0.99874765,0.00030356945,0.00011670443,0.0007012303,0.000055723118,0.0000751242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037520012,0.00014316065,0.00030135884,0.00024640662,0.00007067541,0.000016627442,0.001004874,0.000054044525,0.00002124807],"category_scores_gemma":[0.00016014243,0.000121654135,0.00007660831,0.0007254299,0.00022228603,0.00027315438,0.00028278216,0.00017694279,0.000033672655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013613085,0.0002218949,0.0031087007,0.00021203942,0.000026515514,0.00009730751,0.0067931493,0.00016464698,0.0033665027,0.98473126,0.00018833956,0.0010760329],"study_design_scores_gemma":[0.0008362832,0.00015852923,0.006287708,0.0002214757,0.0000055398286,0.00011915731,0.00028856768,0.036921654,0.03202592,0.9224803,0.00022128732,0.00043361494],"about_ca_topic_score_codex":0.000013416446,"about_ca_topic_score_gemma":0.000011861673,"teacher_disagreement_score":0.13144621,"about_ca_system_score_codex":0.000024390101,"about_ca_system_score_gemma":0.00005909342,"threshold_uncertainty_score":0.4960912},"labels":[],"label_agreement":null},{"id":"W2083735231","doi":"10.1016/j.jctb.2009.11.003","title":"Crossing-critical graphs with large maximum degree","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Bounded function; Degree (music); Mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.01717054544245858,"score_gpt":0.29570413759398356,"score_spread":0.27853359215152496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083735231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11107399,0.0014251119,0.86373657,0.005361647,0.007945212,0.00034536328,0.00000777709,0.00023466517,0.009869664],"genre_scores_gemma":[0.97914773,0.00002227244,0.020110836,0.00024873804,0.00031462157,0.0000016449684,3.2264487e-7,0.000017321961,0.00013651638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972034,0.00047591998,0.00051444327,0.00025998062,0.00091191,0.0006343571],"domain_scores_gemma":[0.9974525,0.0005722164,0.000277209,0.00059111376,0.0007799866,0.00032696564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023970439,0.00024080844,0.00043833218,0.00030640844,0.000505934,0.0005945812,0.0015902127,0.00010676838,0.000043766016],"category_scores_gemma":[0.0006989684,0.00017793555,0.00018773151,0.0007953747,0.00059044047,0.0024812194,0.00015109094,0.0006820685,0.000008557967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015643879,0.00026552138,0.000084300744,0.000007783582,0.000034596105,0.00037034994,0.00041209738,0.00000731464,0.0005666815,0.98860186,0.00018219082,0.007902893],"study_design_scores_gemma":[0.0017473167,0.003126809,0.00048337472,0.000066961635,0.000014248312,0.00071712804,0.00012669525,0.000017468574,0.0032323669,0.9832772,0.0069668065,0.00022359533],"about_ca_topic_score_codex":2.7658183e-7,"about_ca_topic_score_gemma":4.5466624e-7,"teacher_disagreement_score":0.8680737,"about_ca_system_score_codex":0.00006210839,"about_ca_system_score_gemma":0.00031003467,"threshold_uncertainty_score":0.7256001},"labels":[],"label_agreement":null},{"id":"W2083970526","doi":"10.1016/s0304-3975(02)00048-8","title":"Structuring the elementary components of graphs having a perfect internal matching","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Structuring; Computer science; Mathematics; Matching (statistics); Combinatorics; Theoretical computer science","score_opus":0.01473154606041251,"score_gpt":0.28159802193216416,"score_spread":0.26686647587175166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083970526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4010546,0.000035514564,0.5973966,0.000105372994,0.0002971795,0.0001404592,8.370433e-7,0.00005157391,0.00091785466],"genre_scores_gemma":[0.8622688,0.0000046810715,0.13752083,0.00016723295,0.0000218063,0.000004966398,2.5983417e-7,0.000008736574,0.0000026599032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660945,0.00045596116,0.00038333968,0.00066813413,0.0011385293,0.0007445851],"domain_scores_gemma":[0.99782723,0.00060450146,0.00011888179,0.0010876827,0.00015637079,0.00020534273],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0033742927,0.00020668343,0.00024487206,0.00028935226,0.0006670573,0.00029926223,0.004268822,0.000029247643,0.000049281552],"category_scores_gemma":[0.000107973596,0.0001394336,0.00011575349,0.0013191538,0.0035265232,0.0007596892,0.0015625183,0.00041577578,0.000010960615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009362927,0.00003195003,0.00050052383,0.000009725582,0.000008859989,0.000009106717,0.0006719968,0.00032451446,0.010246114,0.97396517,0.0000022258575,0.014220474],"study_design_scores_gemma":[0.00026790693,0.00014899764,0.0020956174,0.000064002954,0.0000041062667,0.000108987246,0.00004337726,0.069959156,0.033200536,0.893888,0.0000265237,0.00019278018],"about_ca_topic_score_codex":0.000012279668,"about_ca_topic_score_gemma":8.9939624e-7,"teacher_disagreement_score":0.46121424,"about_ca_system_score_codex":0.000056402223,"about_ca_system_score_gemma":0.00007337795,"threshold_uncertainty_score":0.9991853},"labels":[],"label_agreement":null},{"id":"W2083976285","doi":"10.1007/s00373-007-0706-3","title":"An O(n3)-Time Recognition Algorithm for hhds-free Graphs","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Split graph; Indifference graph; Pathwidth; Mathematics; Time complexity; Discrete mathematics; Maximal independent set; Interval graph; Graph; 1-planar graph; Line graph","score_opus":0.018915110586098665,"score_gpt":0.2779508647299208,"score_spread":0.25903575414382213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083976285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072318695,0.0005151814,0.92417926,0.00014416272,0.000590369,0.00062262226,0.000042695916,0.00055201893,0.0010350227],"genre_scores_gemma":[0.6642601,0.0005139482,0.33360723,0.0006245571,0.00010031272,0.00019666254,0.00010510043,0.00010652341,0.00048555035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980308,0.00007051252,0.00027679946,0.0005855532,0.00039888782,0.00063747773],"domain_scores_gemma":[0.9980622,0.00030906656,0.00009468226,0.0008666424,0.00033303973,0.00033437173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013645705,0.00021734224,0.00022579223,0.00047330884,0.00039932167,0.00017863358,0.0010749648,0.00013226646,0.000004742697],"category_scores_gemma":[0.00006775375,0.0002166558,0.00011528509,0.0013179829,0.0001409055,0.00075851067,0.00020831643,0.00020988315,0.000011079742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019927926,0.00017853807,0.00017656646,0.000013500668,0.000018085422,0.000013674228,0.00012721171,6.7999173e-7,0.00037777916,0.5990192,0.0005041628,0.39955062],"study_design_scores_gemma":[0.0012259567,0.00069647905,0.0007648417,0.00001178113,0.000009287775,0.000016826418,0.00004916339,0.011339457,0.002115618,0.9823195,0.0011374971,0.00031363076],"about_ca_topic_score_codex":0.0000087739845,"about_ca_topic_score_gemma":0.0000033459808,"teacher_disagreement_score":0.5919414,"about_ca_system_score_codex":0.000027964272,"about_ca_system_score_gemma":0.000030159834,"threshold_uncertainty_score":0.8834967},"labels":[],"label_agreement":null},{"id":"W2084817433","doi":"10.5555/982792.982896","title":"The pure literal rule threshold and cores in random hypergraphs","year":2004,"lang":"en","type":"article","venue":"TSpace (University of Toronto)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Literal (mathematical logic); Hypergraph; Core (optical fiber); Mathematics; Combinatorics; Discrete mathematics; Computer science; Algorithm","score_opus":0.011087410286458257,"score_gpt":0.24442863949271748,"score_spread":0.23334122920625922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084817433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9581171,0.0039697057,0.018499222,0.0038661074,0.00008898635,0.0002699028,0.000002769424,0.0000639889,0.015122162],"genre_scores_gemma":[0.9939928,0.0006944564,0.0047051366,0.00001872072,0.0000064649057,3.007757e-7,4.2565463e-7,0.000003521129,0.00057815516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992406,0.000052841566,0.00005405522,0.00021648922,0.00019878814,0.00023723207],"domain_scores_gemma":[0.9993681,0.00010209112,0.000044697827,0.00036319077,0.000047218608,0.00007472514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027042726,0.00008169704,0.00013425126,0.000044265293,0.00023785006,0.000038624206,0.00074959354,0.00004280619,0.000064649386],"category_scores_gemma":[0.00001650237,0.00007351898,0.000052719228,0.00014248272,0.00028382122,0.00076414185,0.0003296311,0.00011230165,0.0000032224088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007721089,0.00013372854,0.010131189,0.00003433509,0.000062207,0.00014560125,0.030804403,0.00049535045,0.0025903967,0.85019827,0.0001358338,0.10449657],"study_design_scores_gemma":[0.015752224,0.0005887624,0.7573813,0.00017237457,0.0000209511,0.000044985234,0.013722251,0.0054897936,0.00060452474,0.20262638,0.0028937943,0.00070264837],"about_ca_topic_score_codex":0.007571519,"about_ca_topic_score_gemma":0.02380996,"teacher_disagreement_score":0.74725014,"about_ca_system_score_codex":0.00007989868,"about_ca_system_score_gemma":0.000047336394,"threshold_uncertainty_score":0.99903715},"labels":[],"label_agreement":null},{"id":"W2084877920","doi":"10.1016/j.dam.2003.04.004","title":"Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Saskatchewan","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Embedding; Complement (music); Discrete mathematics; Domination analysis; Graph; Pathwidth; Trapezoid graph; Dominating set; Chordal graph; 1-planar graph; Line graph; Computer science","score_opus":0.02394368564801446,"score_gpt":0.29349967969196944,"score_spread":0.26955599404395497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084877920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37627882,0.00049694785,0.60084635,0.00030486734,0.00011461545,0.002898001,0.00004754937,0.00008082621,0.018932024],"genre_scores_gemma":[0.89646184,0.00004978726,0.10327468,0.00007250009,0.0000028825336,0.00009941656,0.0000026581813,0.0000173077,0.000018944249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762017,0.00017180448,0.0007677817,0.00031215732,0.0007195714,0.00040853667],"domain_scores_gemma":[0.9971418,0.0011044045,0.0005540851,0.0010213804,0.00011497069,0.00006335307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020248396,0.00023312138,0.00050223776,0.00011283722,0.00035229986,0.00008018325,0.0013144335,0.000035962625,0.000017615655],"category_scores_gemma":[0.00009769395,0.000136126,0.0001315771,0.0007215348,0.001066679,0.00013361564,0.0003277353,0.00020378403,0.0000020725404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002703545,0.00006890589,0.00007414124,0.00015340529,0.00007264599,4.4505182e-7,0.0047020023,0.000023521217,0.0039649354,0.98965913,0.000020724488,0.0012330794],"study_design_scores_gemma":[0.0022522523,0.000043827953,0.00017262336,0.000062418054,0.00002897272,0.000006518,0.0024178075,0.00581624,0.011691792,0.97724336,0.00010487588,0.00015931312],"about_ca_topic_score_codex":0.0000060908997,"about_ca_topic_score_gemma":0.0000066031034,"teacher_disagreement_score":0.52018297,"about_ca_system_score_codex":0.000011250863,"about_ca_system_score_gemma":0.00003160365,"threshold_uncertainty_score":0.5551057},"labels":[],"label_agreement":null},{"id":"W2084955549","doi":"10.1016/s0304-3975(03)00286-x","title":"On universally easy classes for NP-complete problems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Time complexity; Mathematics; NP-complete; Intersection (aeronautics); P versus NP problem; Polynomial; Combinatorics; Discrete mathematics; Computer science","score_opus":0.026521373393528832,"score_gpt":0.287435863305529,"score_spread":0.26091448991200017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084955549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044831503,0.000017455732,0.9820232,0.00067576143,0.0004695901,0.0005606735,0.0000042522497,0.0002532954,0.011512659],"genre_scores_gemma":[0.7499499,0.000002312292,0.24926673,0.00063299167,0.000037538466,0.000025037947,6.0529396e-7,0.000014566719,0.00007036307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621665,0.00026281364,0.00027084386,0.0012116726,0.0009559337,0.0010820585],"domain_scores_gemma":[0.9963541,0.0013937537,0.00007521902,0.0013684027,0.0003906623,0.0004178565],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027036187,0.0002578565,0.0002582419,0.0003741145,0.00071148714,0.00046493905,0.0035680032,0.000059743987,0.000038041995],"category_scores_gemma":[0.0005409435,0.0002141481,0.000117814736,0.0017658483,0.003262366,0.0008134191,0.0005509628,0.00027350604,0.00011312607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019437473,0.000078652345,0.000017038354,0.000010689562,0.000004837778,0.0000068246945,0.00011140129,0.001321031,0.001044124,0.9920618,0.000074035495,0.0052501624],"study_design_scores_gemma":[0.000443982,0.00070492894,0.00006710212,0.000024187819,0.0000022539307,0.00002734652,0.000003783814,0.1574341,0.0029673618,0.8350559,0.0029997402,0.0002693159],"about_ca_topic_score_codex":5.796825e-7,"about_ca_topic_score_gemma":7.4740456e-7,"teacher_disagreement_score":0.7454667,"about_ca_system_score_codex":0.000111254085,"about_ca_system_score_gemma":0.00025635966,"threshold_uncertainty_score":0.9994502},"labels":[],"label_agreement":null},{"id":"W2085493165","doi":"10.1016/j.dam.2015.01.022","title":"Polynomial-time algorithms for minimum weighted colorings of (<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mover accent=\"false\"><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mo accent=\"true\">¯</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs and similar graph classes","year":2015,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.023608886727163506,"score_gpt":0.25954621043510984,"score_spread":0.23593732370794634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085493165","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24948211,0.0035601635,0.0065392624,0.0015712916,0.005679355,0.0002537287,0.0023796633,0.00091043103,0.729624],"genre_scores_gemma":[0.9551294,0.0042830915,0.019144084,0.003168785,0.003967896,0.005743261,0.004238877,0.003394618,0.000929979],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.96865004,0.0014719625,0.006356198,0.006139939,0.008941637,0.008440229],"domain_scores_gemma":[0.971925,0.0068569323,0.0075864596,0.007996673,0.00090633077,0.004728573],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0069834664,0.0032509118,0.0013592871,0.0026904226,0.00456977,0.0055365255,0.010408864,0.0072016693,0.704804],"category_scores_gemma":[0.0058563002,0.006691932,0.006052366,0.00543811,0.0073746466,0.005439936,0.0100232735,0.005202801,0.0031547374],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054570385,0.001072909,0.000023246359,0.003814163,0.0050587594,0.0022013632,0.0040952493,0.0021037809,0.0068271128,0.394876,0.57130915,0.0031612185],"study_design_scores_gemma":[0.007747171,0.0048027346,0.00010080198,0.0031696262,0.0048109055,0.0029912083,0.0056449366,0.036423184,0.91846836,0.0023481105,0.007592961,0.0059000254],"about_ca_topic_score_codex":0.00255548,"about_ca_topic_score_gemma":0.002780441,"teacher_disagreement_score":0.91164124,"about_ca_system_score_codex":0.00007177973,"about_ca_system_score_gemma":0.0051111863,"threshold_uncertainty_score":0.9980218},"labels":[],"label_agreement":null},{"id":"W2085702149","doi":"10.1007/s00373-013-1356-2","title":"Graphs with a Minimal Number of Convex Sets","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Convex hull; Induced path; Graph; Graph power; Line graph; Regular polygon","score_opus":0.011617081512219712,"score_gpt":0.2556868968321987,"score_spread":0.24406981531997898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085702149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990095,0.00029689266,0.0055650813,0.00017638874,0.00011701524,0.00027605618,0.0000026006944,0.000090614885,0.0033803012],"genre_scores_gemma":[0.99485147,0.00008752477,0.0048076203,0.0000642125,0.000001677387,0.000041729072,0.0000010153508,0.000011766075,0.0001329978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986875,0.0000611108,0.0001894962,0.00033660885,0.00037756885,0.00034773123],"domain_scores_gemma":[0.99884397,0.00012803577,0.00009232623,0.00049561757,0.00026370757,0.00017636351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017334163,0.00016020413,0.00023434141,0.00015671365,0.00011056914,0.000082879174,0.00055305945,0.00006233219,0.000029142773],"category_scores_gemma":[0.000015267678,0.00012565743,0.00005659732,0.0011029454,0.00027222926,0.00046946315,0.00020715341,0.00017087012,0.00001913543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010086446,0.00008823779,0.046900183,0.00002740398,0.000024912872,0.000008684116,0.00023249889,5.1478395e-7,0.0001286089,0.94888026,0.00029600254,0.0034026178],"study_design_scores_gemma":[0.00070774695,0.00028109847,0.02017462,0.000019369452,0.000005502242,0.00004549465,0.000084208245,0.0006586025,0.0007336008,0.9767655,0.0003276978,0.00019653075],"about_ca_topic_score_codex":0.000044224482,"about_ca_topic_score_gemma":0.0000013079648,"teacher_disagreement_score":0.027885279,"about_ca_system_score_codex":0.00000765895,"about_ca_system_score_gemma":0.00003581992,"threshold_uncertainty_score":0.5124162},"labels":[],"label_agreement":null},{"id":"W2086294103","doi":"10.1002/jgt.1021","title":"Counting 5‐connected planar triangulations","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Enhanced Data Rates for GSM Evolution; Graph; Planar straight-line graph; Discrete mathematics; 1-planar graph; Line graph; Computer science","score_opus":0.023694302774234295,"score_gpt":0.29307900615916244,"score_spread":0.26938470338492815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086294103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14377606,0.00085537165,0.85013485,0.00079175545,0.00044740955,0.000102105136,0.0000016266931,0.000066819826,0.003823975],"genre_scores_gemma":[0.9754857,0.00012829166,0.023555234,0.0002483807,0.00020624204,0.0000021925448,6.4942367e-7,0.000016112286,0.00035720455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811745,0.0004139905,0.00048396116,0.00016371546,0.0004942097,0.000326703],"domain_scores_gemma":[0.9976278,0.0010172325,0.00040283301,0.00040421908,0.00039068348,0.00015722717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027444153,0.0001240486,0.00024045931,0.00074408663,0.00021684419,0.00010702007,0.0011195091,0.000058195186,0.00007285439],"category_scores_gemma":[0.0006083881,0.000101726095,0.00021220895,0.001279153,0.00012198029,0.00092961936,0.000066181885,0.00037623025,0.000019570747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001806306,0.00007451209,0.0015939347,0.0000045136067,0.000082667284,0.00021826172,0.00041252808,0.00022481797,0.003222502,0.97545433,0.00038247317,0.018148834],"study_design_scores_gemma":[0.0008380564,0.00016829568,0.004151224,0.000041503423,0.000013872921,0.00071619096,0.00018052063,0.0005211108,0.00053295726,0.9887157,0.0039768773,0.00014367026],"about_ca_topic_score_codex":0.000001151331,"about_ca_topic_score_gemma":0.0000021126205,"teacher_disagreement_score":0.8317096,"about_ca_system_score_codex":0.000036241556,"about_ca_system_score_gemma":0.00009149989,"threshold_uncertainty_score":0.414827},"labels":[],"label_agreement":null},{"id":"W2086999408","doi":"10.1145/369836.571190","title":"Review of: Modern Graph Theory by Béla Bollobás","year":2000,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Computer science; Discrete mathematics; Graph; Graph theory; Mathematics; Graph property; Theoretical computer science; Combinatorics; Voltage graph; Line graph","score_opus":0.021400278794100717,"score_gpt":0.30653905061984493,"score_spread":0.2851387718257442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086999408","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022902228,0.47956112,0.4098484,0.008072531,0.0004213517,0.002105128,0.00006656643,0.0008399827,0.07618268],"genre_scores_gemma":[0.4075307,0.42813963,0.09862222,0.039898444,0.0002934581,0.0003398265,0.000066191475,0.00023027102,0.02487928],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787724,0.00039130126,0.00036536145,0.0004799117,0.00043726637,0.00044891928],"domain_scores_gemma":[0.9968516,0.000537076,0.00010396438,0.002256341,0.00008346234,0.00016753332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000895925,0.00019607262,0.00034153348,0.00010163783,0.0000951317,0.00003996959,0.0029814383,0.0000640206,0.000589693],"category_scores_gemma":[0.00037939003,0.00016601113,0.00018946768,0.00085393514,0.0001579519,0.0005765349,0.0003299183,0.00024926045,0.00021606554],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030136956,0.00010349619,0.000074914125,0.0003723582,0.000031964406,0.000009354055,0.00019395689,0.000013770127,0.0039578457,0.036160376,0.02353183,0.93552],"study_design_scores_gemma":[0.00035354032,0.00013672169,0.00006155363,0.0009705072,0.000012450251,0.000017586672,0.000008088444,0.00023395054,0.006533263,0.88156796,0.10977844,0.00032595923],"about_ca_topic_score_codex":0.000013236728,"about_ca_topic_score_gemma":0.0000018194456,"teacher_disagreement_score":0.935194,"about_ca_system_score_codex":0.000020863872,"about_ca_system_score_gemma":0.00006562729,"threshold_uncertainty_score":0.6769737},"labels":[],"label_agreement":null},{"id":"W2087046441","doi":"10.7151/dmgt.1638","title":"Minimal trees and monophonic convexity","year":2012,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Tree (set theory)","score_opus":0.02274028201100312,"score_gpt":0.2843460459271388,"score_spread":0.26160576391613566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087046441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39829051,0.002568776,0.5898145,0.0009196018,0.00038414038,0.000602209,0.000011712892,0.0004975072,0.0069110743],"genre_scores_gemma":[0.9713997,0.000065847154,0.02751128,0.00010484848,0.00005302864,0.00008044325,0.000002177983,0.000028117045,0.00075455103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976518,0.00043269634,0.0003410888,0.0004193137,0.0004196383,0.00073545304],"domain_scores_gemma":[0.99767417,0.0007600971,0.00012281549,0.0009938077,0.000049034003,0.00040007764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019227709,0.00027905405,0.00034511863,0.00028119172,0.0003171368,0.00010649906,0.0008871444,0.00009152595,0.00013219102],"category_scores_gemma":[0.0002566985,0.00017251745,0.0001438119,0.00057135057,0.0005184981,0.0011070312,0.00063512434,0.00023169706,0.00021436972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003091486,0.00020460077,0.0010562687,0.000057082125,0.000032273496,0.0000035797054,0.0031529719,6.433593e-7,0.0014910244,0.9833071,0.000093943934,0.010569591],"study_design_scores_gemma":[0.00031956614,0.000055393502,0.007044889,0.000058850193,0.00001481889,0.000053507207,0.0008883994,0.00051208975,0.0019621095,0.9884624,0.00032302615,0.00030496976],"about_ca_topic_score_codex":6.735567e-7,"about_ca_topic_score_gemma":6.287077e-7,"teacher_disagreement_score":0.5731092,"about_ca_system_score_codex":0.000016674765,"about_ca_system_score_gemma":0.000023561091,"threshold_uncertainty_score":0.70350575},"labels":[],"label_agreement":null},{"id":"W2087113704","doi":"10.2478/s11533-013-0234-8","title":"New bounds for the broadcast domination number of a graph","year":2013,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Domination analysis; Graph; Upper and lower bounds; Connectivity; Cardinality (data modeling); Dominating set; Discrete mathematics; Computer science","score_opus":0.040585166385431685,"score_gpt":0.35892841162195,"score_spread":0.3183432452365183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087113704","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018509695,0.000029455156,0.98798764,0.0008243134,0.0000642978,0.0012027096,0.0000018416093,0.000016499504,0.008022271],"genre_scores_gemma":[0.040328532,0.000013124532,0.9518461,0.000066053726,0.000024956458,0.00021815865,0.0000010036154,0.000014632926,0.0074873883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991605,0.000029058432,0.00023048019,0.00015263722,0.00023910917,0.00018819718],"domain_scores_gemma":[0.99816436,0.00074831955,0.00014092348,0.0007031871,0.00018698185,0.00005625418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006103436,0.00008371477,0.00014963743,0.00003945223,0.00013141823,0.0003932812,0.0021402782,0.000029404795,0.00019769168],"category_scores_gemma":[0.0001595841,0.00005397756,0.00006318808,0.00036284653,0.00006376018,0.00070925464,0.0005164877,0.00006403592,0.00012810665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036111542,0.000052837124,0.000022482962,0.0000413083,0.00002116283,1.754463e-7,0.0013570681,0.000013419884,0.00050413376,0.913284,0.0054745134,0.079225294],"study_design_scores_gemma":[0.0003507909,0.00003259455,0.00007413341,0.000027451195,0.0000059095937,0.0000093897925,0.00019541186,0.024640013,0.0018374164,0.9701899,0.0025571832,0.00007978416],"about_ca_topic_score_codex":0.000046202436,"about_ca_topic_score_gemma":0.00000426004,"teacher_disagreement_score":0.07914551,"about_ca_system_score_codex":0.000012908175,"about_ca_system_score_gemma":0.000060819926,"threshold_uncertainty_score":0.3977205},"labels":[],"label_agreement":null},{"id":"W2087219950","doi":"10.1007/s004930200002","title":"Homomorphisms of Products of Graphs into Graphs Without Four Cycles","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Indifference graph; Chordal graph; Graph product; Discrete mathematics; 1-planar graph; Graph","score_opus":0.034409806586687866,"score_gpt":0.2682679763669812,"score_spread":0.23385816978029333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087219950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94623023,0.005673352,0.034059744,0.0016077758,0.0013133341,0.0012081136,0.000008303764,0.00046218926,0.009436932],"genre_scores_gemma":[0.98661286,0.00016896192,0.012917102,0.000019595183,0.00000750713,0.000024248617,6.836634e-7,0.00001934795,0.00022971726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978938,0.00016755056,0.0004018131,0.0004960444,0.0006524115,0.00038839222],"domain_scores_gemma":[0.9976338,0.00016203412,0.00024904605,0.0013521857,0.00046612564,0.00013681957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004004908,0.00019463849,0.00040127247,0.000476279,0.00011571436,0.000024826,0.0017205632,0.000071264134,0.000020061281],"category_scores_gemma":[0.00024261432,0.00018125791,0.00012509803,0.0024979587,0.0004045969,0.00040720138,0.00042478734,0.00022002608,0.00002282696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012449081,0.00041002373,0.005439025,0.0001092521,0.000037459507,0.00001522727,0.000657594,0.000009060167,0.0077460622,0.9737722,0.0006382992,0.011153295],"study_design_scores_gemma":[0.0006519862,0.00039223384,0.0026887415,0.000046757013,0.000008714789,0.00001556106,0.000024372914,0.0010465818,0.0576794,0.93654656,0.0006677814,0.00023132912],"about_ca_topic_score_codex":0.000015364438,"about_ca_topic_score_gemma":7.626021e-7,"teacher_disagreement_score":0.049933337,"about_ca_system_score_codex":0.000032042142,"about_ca_system_score_gemma":0.000034912173,"threshold_uncertainty_score":0.7391483},"labels":[],"label_agreement":null},{"id":"W2087455919","doi":"10.1007/s10878-008-9150-4","title":"Packing trees in communication networks","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Mathematics; Solver; Linear programming relaxation; Approximation algorithm; Multicast; Integer programming; Theory of computation; Steiner tree problem; Combinatorics; Spanning tree; Relaxation (psychology); Tree (set theory); Independent set; Block (permutation group theory); Time complexity; k-minimum spanning tree; Linear programming; Discrete mathematics; Graph; Computer science; Mathematical optimization; Algorithm; Tree structure; Binary tree; K-ary tree","score_opus":0.018935291267582425,"score_gpt":0.27444761545684493,"score_spread":0.2555123241892625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087455919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096682515,0.00039844651,0.9882054,0.00029670843,0.000893852,0.00008432178,7.538917e-8,0.000018977611,0.00043401212],"genre_scores_gemma":[0.88938546,0.00068047247,0.10979008,0.000023721479,0.00009969281,0.0000016190958,9.649016e-7,0.0000073884503,0.000010573335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866205,0.0003012613,0.00043085,0.00009229078,0.00035302926,0.00016049827],"domain_scores_gemma":[0.9986755,0.0002329308,0.00035927867,0.00030227576,0.0003659027,0.000064085725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008363646,0.0000772336,0.00018135141,0.00030318327,0.00012259692,0.000052756714,0.0007739884,0.0000658666,0.0000055858263],"category_scores_gemma":[0.00022385184,0.00007316235,0.000057761223,0.0007930225,0.00005732155,0.0012448741,0.00011264737,0.00031485417,9.104818e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004689994,0.00008469422,0.0015658252,9.76576e-7,0.0000062618324,0.000020972448,0.00031244673,0.9299923,0.00002513458,0.06682894,0.00008968511,0.0010258274],"study_design_scores_gemma":[0.0021742163,0.00023784295,0.0022646713,0.00007024759,0.0000033741069,0.00012097135,0.00003209698,0.9406192,0.00023285761,0.053899627,0.00020638193,0.00013852742],"about_ca_topic_score_codex":0.000002964275,"about_ca_topic_score_gemma":6.5647686e-7,"teacher_disagreement_score":0.87971723,"about_ca_system_score_codex":0.000097986514,"about_ca_system_score_gemma":0.00008734258,"threshold_uncertainty_score":0.2983474},"labels":[],"label_agreement":null},{"id":"W2088030665","doi":"10.1016/s0166-218x(99)00167-5","title":"Naturally submodular digraphs and forbidden digraph configurations","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Digraph; Submodular set function; Mathematics; Combinatorics; Characterization (materials science); Class (philosophy); Directed graph; Discrete mathematics; Property (philosophy); Graph; Computer science","score_opus":0.010686594292096537,"score_gpt":0.25419747432809087,"score_spread":0.24351088003599433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088030665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1766587,0.0005213794,0.6902324,0.0008015665,0.00007217102,0.0014232184,0.00002970809,0.0006978816,0.12956299],"genre_scores_gemma":[0.8494765,0.0001567313,0.1494817,0.00015929,0.000025104158,0.0001120118,0.000013518541,0.000029142084,0.000545994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841046,0.000021354042,0.00031200942,0.00042421828,0.000403963,0.00042800594],"domain_scores_gemma":[0.9986724,0.00019372387,0.00007606129,0.00083755807,0.000050726754,0.00016950906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025057295,0.00022614586,0.00025392673,0.00015052508,0.0002586173,0.00026367302,0.000807467,0.000081859434,0.000097761345],"category_scores_gemma":[0.000024008234,0.00019070586,0.000080314865,0.0005590107,0.00023525643,0.0003951804,0.00013560356,0.00022551259,0.00008523723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067020933,0.000038150705,0.0000103190805,0.00004247669,0.000029006113,0.000005690098,0.0011577276,0.000024310333,0.0047765784,0.97408086,0.00009941094,0.019728778],"study_design_scores_gemma":[0.0004900868,0.000049476097,0.00045870827,0.00002989416,0.000016811418,0.00003391979,0.00024708256,0.011851064,0.0037767033,0.98033214,0.0022953197,0.0004187756],"about_ca_topic_score_codex":0.000002183048,"about_ca_topic_score_gemma":0.000004142028,"teacher_disagreement_score":0.6728178,"about_ca_system_score_codex":0.000011821272,"about_ca_system_score_gemma":0.000023175195,"threshold_uncertainty_score":0.7776759},"labels":[],"label_agreement":null},{"id":"W2088390361","doi":"10.1016/s0012-365x(00)00190-4","title":"On nice graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; North Atlantic Treaty Organization","keywords":"Mathematics; Combinatorics; Nice; Discrete mathematics; Computer science","score_opus":0.02756542105570989,"score_gpt":0.3109214902902431,"score_spread":0.28335606923453316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088390361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04225252,0.00004802522,0.89249766,0.00055597344,0.0001098615,0.00020730351,0.0000022742356,0.00027040156,0.064055994],"genre_scores_gemma":[0.81595474,0.000066218934,0.17989711,0.00052191917,0.000035669527,0.000045042478,0.000003131318,0.00004001652,0.003436163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998673,0.000047464706,0.0002017957,0.0002784236,0.00044111305,0.00035818986],"domain_scores_gemma":[0.99842155,0.00035033518,0.00006944453,0.0009900002,0.000052916144,0.000115745366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003509444,0.00014276613,0.00015585902,0.00014941768,0.00012355203,0.000113536575,0.0010970606,0.0000411968,0.0000533232],"category_scores_gemma":[0.00017117687,0.00011369626,0.00008825027,0.0006320559,0.00007462353,0.00026944416,0.00021646521,0.00016939144,0.0004474412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004259157,0.000058272257,0.000033211185,0.000014929178,0.00000896836,0.000026980953,0.0004548148,0.000053951364,0.00016061525,0.99637747,0.00030238755,0.002504133],"study_design_scores_gemma":[0.00017099113,0.00008689113,0.00005553151,0.000033964727,0.000002490246,0.000030749907,0.00007099976,0.02119623,0.00059934345,0.97637904,0.0012147008,0.0001590637],"about_ca_topic_score_codex":0.0000010165735,"about_ca_topic_score_gemma":0.0000012802702,"teacher_disagreement_score":0.7737022,"about_ca_system_score_codex":0.000020606898,"about_ca_system_score_gemma":0.000016265212,"threshold_uncertainty_score":0.5751101},"labels":[],"label_agreement":null},{"id":"W2088429527","doi":"10.1016/j.disc.2007.07.033","title":"A generalised upper bound for the k-tuple domination number","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Tuple; Upper and lower bounds; Domination analysis; Degree (music); Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.029152086963418405,"score_gpt":0.34070622518997407,"score_spread":0.31155413822655564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088429527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015011345,0.000050477913,0.9790643,0.0007667853,0.00014531375,0.00056295376,0.000005625149,0.00008142516,0.0043118102],"genre_scores_gemma":[0.37679234,0.000014523811,0.61881965,0.00034701047,0.00017223507,0.0001454726,0.000008584734,0.000040168572,0.0036600125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987423,0.000027268123,0.0002646088,0.00021903781,0.00035826935,0.00038852755],"domain_scores_gemma":[0.99790466,0.0010850859,0.00010287391,0.00069891027,0.0001385919,0.000069900496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015398427,0.00012551299,0.00013319313,0.00005734252,0.00029650173,0.00020072726,0.00087573915,0.000047123805,0.000031790572],"category_scores_gemma":[0.00025477377,0.00008035619,0.00011529153,0.00032840064,0.00010493353,0.0002927022,0.00016796339,0.00010157185,0.00006292943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105305935,0.00003305005,0.000047491885,0.000035310484,0.000020718793,0.0000018834229,0.0015210037,0.000027268805,0.0010288889,0.9922586,0.0005508601,0.004464356],"study_design_scores_gemma":[0.00063593365,0.000040857005,0.00024623124,0.000023624933,0.000017016044,0.000023474357,0.00072366965,0.18553683,0.0096976515,0.7933127,0.009494248,0.0002477479],"about_ca_topic_score_codex":0.0000035226694,"about_ca_topic_score_gemma":0.000009183401,"teacher_disagreement_score":0.361781,"about_ca_system_score_codex":0.00005638431,"about_ca_system_score_gemma":0.000025993038,"threshold_uncertainty_score":0.32768303},"labels":[],"label_agreement":null},{"id":"W2088470271","doi":"10.1016/j.disopt.2012.07.004","title":"Total domination and the Caccetta–Häggkvist conjecture","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal; Giro (Canada)","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.00744222266980682,"score_gpt":0.2617487429915411,"score_spread":0.2543065203217343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088470271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034225236,0.00033260946,0.9922551,0.0015016445,0.00014310736,0.00027168533,0.0000020377895,0.00005826254,0.002013043],"genre_scores_gemma":[0.95992124,0.00003705149,0.039548185,0.00012177908,0.000073895484,0.000030359739,0.000014433995,0.000008791705,0.00024423638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991564,0.00015036017,0.00011139818,0.00015843996,0.00019785861,0.0002255305],"domain_scores_gemma":[0.9993926,0.00014533676,0.00006068784,0.00027881138,0.000054870714,0.000067670524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051028497,0.000088042514,0.00008885794,0.00006150728,0.00022003605,0.00015011788,0.00024222325,0.00003954644,0.000019562422],"category_scores_gemma":[0.00012041106,0.000056857887,0.000030310006,0.00029070393,0.00016231684,0.0010157188,0.00015614729,0.00009979907,0.000006437936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048473004,0.000013491625,0.00033928177,0.000007680066,0.00001255162,5.586224e-7,0.0015567717,0.056565404,0.000044430475,0.93307865,0.00008992276,0.008242778],"study_design_scores_gemma":[0.0014451331,0.000030134663,0.0014440854,0.00000824061,0.000009772786,0.000036376186,0.00010600967,0.98108673,0.0004405421,0.014884413,0.0003358666,0.00017272173],"about_ca_topic_score_codex":0.000005787086,"about_ca_topic_score_gemma":8.032125e-7,"teacher_disagreement_score":0.95649874,"about_ca_system_score_codex":0.000020824773,"about_ca_system_score_gemma":0.000011397737,"threshold_uncertainty_score":0.23185974},"labels":[],"label_agreement":null},{"id":"W2089778934","doi":"10.1016/j.disc.2015.01.024","title":"On the spectrum and number of convex sets in graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Cograph; Split graph; Block graph; Convex set; Vertex (graph theory); Line graph; Graph; Regular polygon; Pathwidth; Convex optimization","score_opus":0.038613218446952,"score_gpt":0.32228538706123816,"score_spread":0.2836721686142862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089778934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9073059,0.000054700708,0.06954367,0.0017412843,0.00006481046,0.0003548049,0.000005360581,0.00004256459,0.020886926],"genre_scores_gemma":[0.9854563,0.0000072703638,0.014357717,0.00006692279,0.0000029708779,0.0000095731575,3.8114305e-7,0.000007891548,0.000090960784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991033,0.00007628006,0.00018154694,0.0001478842,0.00030709474,0.00018391051],"domain_scores_gemma":[0.99887353,0.0004491394,0.000070519985,0.0005091693,0.00003113509,0.0000665055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007126437,0.00008831753,0.00015337433,0.000066812936,0.000026960723,0.00003767013,0.0004989179,0.000026999516,0.000012481201],"category_scores_gemma":[0.00022409073,0.000054782686,0.000028433818,0.00035059924,0.00015859303,0.00011690503,0.00020607136,0.00012879164,0.000029901841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042824104,0.000028621831,0.0006400407,0.000020743319,0.000005013819,0.000004669909,0.002301572,0.000010501045,0.000023640863,0.9967085,0.00009268706,0.00015969711],"study_design_scores_gemma":[0.00019030266,0.000041020954,0.00021774945,0.000040055464,0.0000012733253,0.000011536009,0.00039479093,0.016560901,0.00086859125,0.9815822,0.000024272736,0.00006729144],"about_ca_topic_score_codex":0.0000040791037,"about_ca_topic_score_gemma":0.000004311613,"teacher_disagreement_score":0.07815043,"about_ca_system_score_codex":0.0000119104125,"about_ca_system_score_gemma":0.000022393106,"threshold_uncertainty_score":0.22339731},"labels":[],"label_agreement":null},{"id":"W2090123683","doi":"10.1016/j.disc.2011.03.009","title":"The order of hypotraceable oriented graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of South Africa","keywords":"Mathematics; Digraph; Combinatorics; Order (exchange); Graph; Discrete mathematics","score_opus":0.03619054761954036,"score_gpt":0.28107950846148855,"score_spread":0.2448889608419482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090123683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022898857,0.00017026908,0.94336635,0.00010357296,0.00013978971,0.00030132473,0.0000037596249,0.00010767092,0.032908395],"genre_scores_gemma":[0.40276736,0.00008190448,0.5952071,0.000032613458,0.00001080558,0.000045049856,0.0000012415229,0.000029500756,0.001824447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987744,0.000058639424,0.00030129048,0.00018072745,0.00036672343,0.0003182082],"domain_scores_gemma":[0.99824727,0.00030397114,0.0001498268,0.0010218236,0.00020789182,0.000069200236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060585333,0.000114282935,0.00015418848,0.00007319799,0.00018189079,0.000037759215,0.001228543,0.000034607685,0.000026001075],"category_scores_gemma":[0.0002602581,0.000069515416,0.00007448986,0.0007856718,0.0002535787,0.00023493022,0.00031153284,0.00012499592,0.000036962727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005670282,0.000053689808,0.000086261796,0.000026382744,0.000021374173,0.0000025427723,0.002396605,0.0000037595973,0.00029608898,0.99547154,0.00007379364,0.0015623177],"study_design_scores_gemma":[0.00016514791,0.0000805278,0.00013695809,0.000025923993,0.000006510955,0.000008556938,0.0006026886,0.01158068,0.0108319335,0.97559106,0.00084473565,0.00012528317],"about_ca_topic_score_codex":0.0000048552297,"about_ca_topic_score_gemma":0.0000038992985,"teacher_disagreement_score":0.3798685,"about_ca_system_score_codex":0.000008165823,"about_ca_system_score_gemma":0.000034149834,"threshold_uncertainty_score":0.28347564},"labels":[],"label_agreement":null},{"id":"W2090354123","doi":"10.1016/j.dam.2008.08.020","title":"Finding a maximum-weight induced <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-partite subgraph of an <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>i</mml:mi></mml:math>-triangulated graph","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Clique graph; Block graph; Complete bipartite graph; Discrete mathematics; Graph; Line graph; Induced subgraph isomorphism problem; Induced subgraph; Cograph; Split graph; Algorithm; Pathwidth; Graph power; Voltage graph; Vertex (graph theory)","score_opus":0.02428673182251163,"score_gpt":0.2640691380083284,"score_spread":0.23978240618581675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090354123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97334725,0.00052668323,0.019653603,0.00025940523,0.0011893627,0.00056171336,0.0005081231,0.0009154497,0.0030384143],"genre_scores_gemma":[0.95440567,0.0007348263,0.040190738,0.0006572672,0.0008204988,0.0013190272,0.00091722026,0.0008157726,0.00013896321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9855136,0.00037874837,0.0035016886,0.003028392,0.0040812446,0.0034962695],"domain_scores_gemma":[0.98768705,0.0019259091,0.0031893393,0.0053435205,0.0003877395,0.0014664606],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0031270324,0.0019912848,0.0014919672,0.0011217437,0.0023469704,0.0012182617,0.0047182715,0.0021068447,0.000118104464],"category_scores_gemma":[0.0010203985,0.0023285223,0.0020679825,0.0031445224,0.0019301878,0.002524408,0.0031141199,0.0025895156,0.0015695938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011014355,0.0010559378,0.000021169553,0.0014698628,0.0012017116,0.0010432312,0.004969268,0.0020233013,0.01869962,0.9666998,0.00040554555,0.0013091208],"study_design_scores_gemma":[0.0032808424,0.0012174633,0.000098545504,0.0011549502,0.00070186047,0.0009871499,0.0013258646,0.920936,0.050495762,0.016922392,0.0008316389,0.0020475294],"about_ca_topic_score_codex":0.0002684254,"about_ca_topic_score_gemma":0.00020212322,"teacher_disagreement_score":0.9497774,"about_ca_system_score_codex":0.00009110833,"about_ca_system_score_gemma":0.0011587484,"threshold_uncertainty_score":0.99981856},"labels":[],"label_agreement":null},{"id":"W2090424186","doi":"10.1016/j.disopt.2007.08.005","title":"The travelling preacher, projection, and a lower bound for the stability number of a graph","year":2007,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Emmanuel Bible College; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Graph; Interpretation (philosophy); Independent set; Enhanced Data Rates for GSM Evolution; Projection (relational algebra); Stability (learning theory); Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.024395901651674753,"score_gpt":0.315726119814678,"score_spread":0.29133021816300325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090424186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008361168,0.00016836298,0.9900421,0.0002404199,0.000096241,0.00067147,0.0000027939536,0.000026787271,0.00039064337],"genre_scores_gemma":[0.8136248,0.00021498052,0.18578462,0.000029876599,0.000042120053,0.000099722514,0.0000046953355,0.00001712823,0.00018207148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991273,0.00006579408,0.00019622597,0.00021337389,0.00019032825,0.00020697643],"domain_scores_gemma":[0.9985304,0.00076379423,0.00009120645,0.00036618262,0.0002155086,0.000032899487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017087964,0.00007588561,0.000070963106,0.00003112857,0.0004249659,0.00011261505,0.0003087338,0.00003502524,0.000004494607],"category_scores_gemma":[0.00018827649,0.00004387145,0.000048033857,0.00042924844,0.00023922302,0.00029024735,0.00006330529,0.00008092382,2.3332069e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001473191,0.0002335667,0.009292975,0.00018275202,0.0002422455,0.0000016605566,0.014386183,0.14826193,0.0015852145,0.6685717,0.00012415505,0.15564442],"study_design_scores_gemma":[0.00050038076,0.00011853892,0.0013135744,0.000016026584,0.000015600514,0.000007028231,0.0007234169,0.9233694,0.0032646589,0.0700316,0.0004910532,0.00014870489],"about_ca_topic_score_codex":0.000013344925,"about_ca_topic_score_gemma":0.000025107576,"teacher_disagreement_score":0.8052636,"about_ca_system_score_codex":0.000016565169,"about_ca_system_score_gemma":0.000029486897,"threshold_uncertainty_score":0.32685372},"labels":[],"label_agreement":null},{"id":"W2091047457","doi":"10.1002/rsa.20016","title":"A (1 + ϵ)‐approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma*","year":2004,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Hypergraph; Lemma (botany); Combinatorics; Mathematics; Time complexity; Speedup; Discrete mathematics; Range (aeronautics); Constant (computer programming); Algorithm; Computer science; Parallel computing","score_opus":0.015757152850869025,"score_gpt":0.27120383096649214,"score_spread":0.2554466781156231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091047457","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01567725,0.0005682786,0.982418,0.00024695968,0.0003142728,0.0006846611,0.000026874974,0.000046692894,0.00001703719],"genre_scores_gemma":[0.28695226,0.000052640145,0.71266985,0.00007454363,0.00016868477,0.000021894339,0.000008083255,0.000021342934,0.00003069572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838334,0.00008569717,0.00031978817,0.00041980713,0.00041366546,0.00037771647],"domain_scores_gemma":[0.99900186,0.0001575825,0.00017785771,0.0003956109,0.00013624552,0.00013084304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034535374,0.00020615583,0.00030695897,0.00014635292,0.00043515174,0.00010512981,0.00053070346,0.00009560096,0.000004992967],"category_scores_gemma":[0.00005399753,0.00014624548,0.00018327274,0.0005458918,0.000258671,0.00044379823,0.00021548854,0.0001835013,5.514693e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014815216,0.000042720978,0.00003870275,0.00006890511,0.00008651359,0.0000050016893,0.00083501346,0.020612234,0.0049039912,0.061844148,0.00004148605,0.91137314],"study_design_scores_gemma":[0.008921308,0.0001408679,0.00026235034,0.000090063135,0.000030823543,0.000096156415,0.0001307488,0.528718,0.023045208,0.43804812,0.00028252398,0.00023381018],"about_ca_topic_score_codex":0.00013641246,"about_ca_topic_score_gemma":0.0000060443654,"teacher_disagreement_score":0.9111393,"about_ca_system_score_codex":0.00006181245,"about_ca_system_score_gemma":0.00016163588,"threshold_uncertainty_score":0.59637177},"labels":[],"label_agreement":null},{"id":"W2091452762","doi":"10.1016/j.laa.2009.05.027","title":"Eigenvalues and colorings of digraphs","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.01563529270880379,"score_gpt":0.2878938864303953,"score_spread":0.27225859372159156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091452762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60417515,0.0044151447,0.38208947,0.0026463554,0.000016689995,0.00090151443,0.0000144157175,0.00020058983,0.005540664],"genre_scores_gemma":[0.98540705,0.0004645267,0.013829579,0.00011410908,0.000014973563,0.000034690234,0.0000015039266,0.0000032397,0.00013031496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943936,0.000014594767,0.000114122864,0.00020849354,0.000100345795,0.0001230768],"domain_scores_gemma":[0.9995113,0.000076636716,0.00003771404,0.00023674297,0.000060258237,0.000077365876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102938655,0.00006162508,0.000089610185,0.00008059211,0.00010907677,0.00002373188,0.00023746741,0.00002752616,0.0000025487504],"category_scores_gemma":[0.00001589143,0.0000559351,0.00001806783,0.00036266004,0.00006656185,0.00018791064,0.00007629134,0.000064963635,0.000005453152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021691508,0.000026947357,0.00013567836,0.0000067829924,0.0000036624947,1.8021098e-7,0.00010765518,0.0000021745093,0.006854734,0.9689726,0.000009986931,0.023877433],"study_design_scores_gemma":[0.00040229407,0.00030181263,0.01993427,0.000017078173,0.000010956372,0.000015585845,0.000057587775,0.008694501,0.049263556,0.9038986,0.017153172,0.0002505811],"about_ca_topic_score_codex":0.0000011453726,"about_ca_topic_score_gemma":4.135636e-7,"teacher_disagreement_score":0.3812319,"about_ca_system_score_codex":0.0000024370402,"about_ca_system_score_gemma":0.00001158755,"threshold_uncertainty_score":0.22809671},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0146321788659135,"score_gpt":0.3085244832909755,"score_spread":0.293892304425062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091504656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33568788,0.0008827506,0.6279186,0.0024659603,0.00016723052,0.0008000831,0.000007717681,0.00041866026,0.031651117],"genre_scores_gemma":[0.9473239,0.000092893344,0.05156974,0.00018011,0.000030235125,0.000053054213,0.0000020318312,0.000041146315,0.00070687186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969338,0.00015582892,0.0004481136,0.0005790756,0.00062252703,0.0012606106],"domain_scores_gemma":[0.9966391,0.001879528,0.00005084251,0.001239239,0.000044781595,0.00014656414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081220886,0.00029308305,0.00034179198,0.00027966825,0.00014137213,0.00013892172,0.0015028089,0.00010819327,0.0003808184],"category_scores_gemma":[0.00075681205,0.0002568357,0.00014319204,0.0010247419,0.00025838087,0.0002784024,0.00016490942,0.00069172494,0.0004486212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019343724,0.00017305455,0.000011250795,0.000036485293,0.000011850024,0.000045823945,0.00038671735,0.00025035432,0.00030132502,0.97580737,0.000029126608,0.02292727],"study_design_scores_gemma":[0.00034427064,0.00028444096,0.000028794744,0.000092106515,0.0000045832503,0.000085926265,0.000012563134,0.036119066,0.0025621993,0.9596899,0.00047697805,0.00029917152],"about_ca_topic_score_codex":0.000003690362,"about_ca_topic_score_gemma":0.000017740116,"teacher_disagreement_score":0.61163604,"about_ca_system_score_codex":0.00017533427,"about_ca_system_score_gemma":0.00011398704,"threshold_uncertainty_score":0.9999884},"labels":[],"label_agreement":null},{"id":"W2091551894","doi":"10.1007/s00373-010-0965-2","title":"Cleaning with Brooms","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Brush; Combinatorics; Broom; Graph; Mathematics; Computer science; Geography; Engineering","score_opus":0.0073598170529717115,"score_gpt":0.22958342487961023,"score_spread":0.22222360782663853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091551894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91291636,0.00018086622,0.079499006,0.00032793818,0.00046976292,0.0001498825,7.9513836e-7,0.00027937442,0.006176007],"genre_scores_gemma":[0.99302536,0.000026708749,0.0066938526,0.000068874826,0.000006334918,0.000008569368,3.9635452e-7,0.000009160919,0.00016075556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991174,0.00002135516,0.00008075412,0.00027651916,0.00023646289,0.00026753312],"domain_scores_gemma":[0.9992339,0.00007391494,0.000033314886,0.00043808317,0.00008093415,0.0001398733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021164001,0.00010183864,0.00009883572,0.0001222159,0.00020465517,0.0001317168,0.000491242,0.00004637104,0.0000037163375],"category_scores_gemma":[0.000018511924,0.00008016805,0.000023544098,0.00069980434,0.000124615,0.00031799744,0.0001766251,0.00034792273,0.000005413141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004481078,0.000026724336,0.0065317834,0.0000045862794,0.00000531734,0.000013870525,0.00010154586,9.743516e-7,0.0005162843,0.98087496,0.000042414194,0.0118770525],"study_design_scores_gemma":[0.00041600093,0.00019365097,0.0064103026,0.00000595436,0.0000022644936,0.000049461087,0.00003269794,0.0010795041,0.00089356856,0.9875756,0.0031715196,0.00016948058],"about_ca_topic_score_codex":0.0000059452855,"about_ca_topic_score_gemma":0.000008785514,"teacher_disagreement_score":0.08010898,"about_ca_system_score_codex":0.000003898555,"about_ca_system_score_gemma":0.000021558208,"threshold_uncertainty_score":0.32691583},"labels":[],"label_agreement":null},{"id":"W2091612923","doi":"10.1016/s0166-218x(00)00281-x","title":"Diameter determination on restricted graph families","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chordal graph; Interval graph; Mathematics; Combinatorics; Split graph; Pathwidth; Indifference graph; Cograph; Induced subgraph; Block graph; Distance-hereditary graph; Discrete mathematics; Vertex (graph theory); Maximal independent set; Graph; Line graph; 1-planar graph; Graph power","score_opus":0.024168770563783654,"score_gpt":0.28948888538458695,"score_spread":0.2653201148208033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091612923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044157594,0.0000143092,0.9121478,0.00014719022,0.000066400586,0.00042985778,0.0000034146674,0.0003084668,0.042724945],"genre_scores_gemma":[0.6190067,0.00010450478,0.37999418,0.00023252814,0.00004612732,0.00017734118,0.000010482867,0.000042286254,0.00038584418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982558,0.00003288014,0.0003187881,0.00041088456,0.00055737863,0.00042430032],"domain_scores_gemma":[0.99822783,0.00044852577,0.00013223621,0.0010134149,0.00006438152,0.00011363586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441877,0.00022147517,0.00022826814,0.00036910587,0.00016262142,0.00014638022,0.00094986067,0.00007966034,0.000017021912],"category_scores_gemma":[0.00010787652,0.00018452026,0.00008407115,0.0010179463,0.00011277483,0.00025497627,0.0002220148,0.00020924996,0.00018232672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002076271,0.00012552367,0.00002702141,0.000040570045,0.000015324364,0.000023198545,0.0010242538,0.00008042981,0.0065188133,0.9477693,0.00012468958,0.04423013],"study_design_scores_gemma":[0.0006158661,0.00016403336,0.0005224218,0.0000511532,0.000012079257,0.000022203487,0.00037131735,0.025474267,0.011448841,0.9596233,0.0012184242,0.00047613724],"about_ca_topic_score_codex":0.0000012494828,"about_ca_topic_score_gemma":0.0000020258674,"teacher_disagreement_score":0.5748491,"about_ca_system_score_codex":0.000038082326,"about_ca_system_score_gemma":0.000019261728,"threshold_uncertainty_score":0.7524518},"labels":[],"label_agreement":null},{"id":"W2091897018","doi":"10.1016/j.tcs.2009.05.013","title":"A 3.4713-approximation algorithm for the capacitated multicast tree routing problem","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Multicast; Computer science; Routing (electronic design automation); Tree (set theory); Destination-Sequenced Distance Vector routing; Mathematics; Approximation algorithm; Algorithm; Link-state routing protocol; Combinatorics; Routing protocol; Distributed computing; Computer network","score_opus":0.020962504307776086,"score_gpt":0.29635319215966927,"score_spread":0.2753906878518932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091897018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010226798,0.000025811529,0.9931785,0.0032104831,0.0002219776,0.0009199965,0.0000029641187,0.00029684926,0.0011207346],"genre_scores_gemma":[0.48135602,0.0000015943117,0.51816064,0.00035401693,0.00007995045,0.000029504616,7.1638766e-7,0.000006080949,0.000011453397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667215,0.00016162566,0.00036583483,0.00086699537,0.00091909093,0.0010142982],"domain_scores_gemma":[0.9968921,0.0012126019,0.00010373712,0.0010472566,0.0004909549,0.00025337993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036261259,0.0002354401,0.00022041693,0.00021635933,0.0011945512,0.0007545466,0.003719599,0.00005638614,0.000005792391],"category_scores_gemma":[0.00026751836,0.00015457954,0.00010873758,0.002055052,0.002598508,0.0010580219,0.0005262358,0.0003102125,0.000026903668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058823666,0.000037942187,0.0000010343582,0.0000018248595,0.0000025886893,0.0000017041015,0.00042397567,0.00019334638,0.0008643814,0.5779321,0.000009762367,0.42052543],"study_design_scores_gemma":[0.00026945322,0.00025359436,0.00014173574,0.000015851127,0.0000033197498,0.00002282589,0.000014572016,0.6192824,0.00310148,0.3767184,0.000035467932,0.0001408564],"about_ca_topic_score_codex":0.0000014435554,"about_ca_topic_score_gemma":4.0895574e-7,"teacher_disagreement_score":0.6190891,"about_ca_system_score_codex":0.00009255357,"about_ca_system_score_gemma":0.00012414779,"threshold_uncertainty_score":0.95743114},"labels":[],"label_agreement":null},{"id":"W2091988189","doi":"10.1016/j.disc.2008.04.063","title":"Edge-disjoint spanners in tori","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Torus; Spanner; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Geometry; Computer science","score_opus":0.03796996279367364,"score_gpt":0.2981838599308869,"score_spread":0.26021389713721327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091988189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10096381,0.00014524734,0.874518,0.00069757074,0.00021328745,0.0003561295,0.0000032768548,0.00022466772,0.022878047],"genre_scores_gemma":[0.7457818,0.00005768075,0.25220445,0.00010448783,0.000053253487,0.000041717576,0.000002506957,0.000028435317,0.0017256809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855196,0.00005334883,0.00029932338,0.00028989153,0.00039418903,0.00041125467],"domain_scores_gemma":[0.99882054,0.00016279497,0.0000709859,0.0007838953,0.000048503978,0.000113294926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036890747,0.00014720389,0.00021945931,0.00017974131,0.00009905104,0.00004430048,0.0009239742,0.00004868325,0.00002509717],"category_scores_gemma":[0.00017987835,0.00012533103,0.00007402635,0.00062051514,0.00013318416,0.00037010407,0.00032766594,0.0001976729,0.00016822427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006142926,0.00014694293,0.0008271617,0.00007720155,0.000013046736,0.00020590369,0.008279333,0.00029832814,0.0006639198,0.9869362,0.0006759735,0.0018698137],"study_design_scores_gemma":[0.0009637244,0.00016444793,0.0019095058,0.00015662948,0.0000046933815,0.00022767163,0.00097442506,0.12023889,0.006002111,0.86571217,0.0028858017,0.0007599593],"about_ca_topic_score_codex":0.000005386507,"about_ca_topic_score_gemma":0.0000059134163,"teacher_disagreement_score":0.644818,"about_ca_system_score_codex":0.00006023956,"about_ca_system_score_gemma":0.00005206732,"threshold_uncertainty_score":0.5110851},"labels":[],"label_agreement":null},{"id":"W2092080501","doi":"10.1016/j.dam.2014.04.016","title":"Finding clubs in graph classes","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Norges Forskningsråd","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Interval graph; Discrete mathematics; Block graph; Treewidth; Distance-hereditary graph; Pathwidth; Cograph; Bipartite graph; Perfect graph; Clique graph; Graph; Line graph; Graph power; 1-planar graph","score_opus":0.02453978569575146,"score_gpt":0.2973679752228418,"score_spread":0.27282818952709037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092080501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024201324,0.000018666124,0.92911,0.00014454636,0.00005395818,0.00027938996,0.0000011116751,0.00016376124,0.046027243],"genre_scores_gemma":[0.70581645,0.000010161638,0.29385918,0.00009812734,0.000024524674,0.00007234475,0.0000022295656,0.000021699781,0.00009526772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983847,0.0000378296,0.00033619715,0.00037031242,0.0003942905,0.00047668553],"domain_scores_gemma":[0.9984117,0.0005086538,0.000108111424,0.00084308506,0.000028178089,0.00010027923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007900309,0.00018141928,0.00026698486,0.0002839256,0.00009896531,0.00012870065,0.001136511,0.00007083134,0.000013003515],"category_scores_gemma":[0.00012457828,0.00015866794,0.00006253123,0.000789306,0.00009586187,0.00023150981,0.00036598885,0.00024560848,0.00012490552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029301837,0.00004076486,0.00006486123,0.00006003695,0.0000056078215,0.0000025855027,0.00078063644,0.00015016188,0.0028308786,0.99150103,0.000055597604,0.0045048967],"study_design_scores_gemma":[0.00033679348,0.000027952594,0.00017910195,0.000039968912,0.0000027523536,0.0000045847423,0.00021518137,0.030225428,0.0046333796,0.96350914,0.00058919244,0.00023651468],"about_ca_topic_score_codex":0.0000013726,"about_ca_topic_score_gemma":0.0000071213603,"teacher_disagreement_score":0.6816151,"about_ca_system_score_codex":0.00003159913,"about_ca_system_score_gemma":0.000020976922,"threshold_uncertainty_score":0.6470291},"labels":[],"label_agreement":null},{"id":"W2092176968","doi":"10.1287/moor.27.4.693.299","title":"Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids","year":2002,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Matroid; Vertex (graph theory); Polyhedron; Path (computing); Corollary; Ideal (ethics); Graph; Cardinality (data modeling); Discrete mathematics","score_opus":0.06675678196061044,"score_gpt":0.3852024378835007,"score_spread":0.3184456559228903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092176968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7514142,0.0005455809,0.22415885,0.0075441445,0.00009612895,0.0015536371,0.000021700114,0.0001709724,0.014494786],"genre_scores_gemma":[0.82066023,0.000059435413,0.17270824,0.000025930067,0.00001335917,0.00009113029,0.0000016593104,0.000023212839,0.0064168056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972693,0.00028851873,0.000465305,0.00040870172,0.001006282,0.0005618962],"domain_scores_gemma":[0.9975439,0.0004992851,0.000026811385,0.0010696722,0.00060138485,0.00025896984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019525744,0.00014840582,0.00025566813,0.0007725695,0.00043077275,0.0002797381,0.001267283,0.000084102925,0.00024250703],"category_scores_gemma":[0.0010881596,0.00013090349,0.00005645953,0.0018129182,0.00029844927,0.0005984829,0.00086060865,0.000495355,0.00039761263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000641667,0.00040256203,0.00005846655,0.000087305256,0.000035825808,0.0000137189845,0.009370035,0.0015199678,0.016922861,0.96194005,0.001031544,0.0086112255],"study_design_scores_gemma":[0.0005972114,0.000610161,0.00020371568,0.00017345657,0.0000049756068,0.00009068654,0.0011996777,0.75389576,0.01169757,0.23058641,0.0005997239,0.0003406725],"about_ca_topic_score_codex":0.000031706266,"about_ca_topic_score_gemma":0.00003641442,"teacher_disagreement_score":0.7523758,"about_ca_system_score_codex":0.00006954653,"about_ca_system_score_gemma":0.000059849528,"threshold_uncertainty_score":0.53380895},"labels":[],"label_agreement":null},{"id":"W2092192150","doi":"10.4153/cmb-2013-020-5","title":"Size, Order, and Connected Domination","year":2013,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Independence number; Upper and lower bounds; Graffiti; Order (exchange); Graph; Discrete mathematics; Robertson–Seymour theorem; Chordal graph; 1-planar graph; Mathematical analysis","score_opus":0.008564300701761592,"score_gpt":0.22774869630158182,"score_spread":0.21918439559982023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092192150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23347835,0.00027505532,0.5647839,0.09836612,0.00015964636,0.002093973,0.000010280566,0.00041140526,0.10042131],"genre_scores_gemma":[0.9023252,0.0000072305347,0.091488354,0.0014752307,0.000025865018,0.00011022642,0.0000015208744,0.000018001634,0.0045483643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896276,0.00007334205,0.00015439495,0.00025228318,0.00016354329,0.00039370044],"domain_scores_gemma":[0.99817187,0.0007203885,0.00002600729,0.00034701452,0.00016447777,0.0005702278],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025868812,0.000102645834,0.00013404901,0.00011653358,0.00012473002,0.00018778388,0.00040378654,0.000060769227,0.007356657],"category_scores_gemma":[0.0015528755,0.00009213018,0.00001916686,0.00030222817,0.00012681608,0.000121141384,0.00008282472,0.00012973926,0.00827785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001000942,0.000014819616,0.000023062652,0.00002924533,0.0000067130923,0.00001644002,0.00018700544,0.000001180311,0.00027641322,0.97836876,0.008328453,0.012746927],"study_design_scores_gemma":[0.00038548151,0.000052175626,0.0009965838,0.000034268778,0.0000027973194,0.00005268519,0.000078914716,0.010428319,0.00027639442,0.96223754,0.025200967,0.00025389052],"about_ca_topic_score_codex":0.0005327033,"about_ca_topic_score_gemma":0.0002531155,"teacher_disagreement_score":0.66884685,"about_ca_system_score_codex":0.00005509523,"about_ca_system_score_gemma":0.00009169776,"threshold_uncertainty_score":0.9935508},"labels":[],"label_agreement":null},{"id":"W2092204243","doi":"10.1016/j.disc.2009.12.012","title":"Broadcasts and domination in trees","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01369033957713226,"score_gpt":0.2972594238184539,"score_spread":0.2835690842413216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092204243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6669501,0.000030961604,0.32775226,0.0004017486,0.00008084933,0.00019062991,0.0000014330059,0.00006156597,0.0045304596],"genre_scores_gemma":[0.84500676,0.000006734866,0.15476406,0.000015780122,0.000011791281,0.000012259152,6.474325e-7,0.000006480459,0.00017550155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993189,0.000023458962,0.00014527878,0.0001681609,0.00017453951,0.00016964221],"domain_scores_gemma":[0.9993458,0.00017685587,0.00004240039,0.0003544025,0.000027554246,0.000052996016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003979992,0.00007566375,0.00010246714,0.0001311594,0.00004109658,0.00008954077,0.00035672414,0.000038563667,0.000009060094],"category_scores_gemma":[0.00017772474,0.000062923136,0.00001820327,0.00024442954,0.00007835823,0.0003270052,0.00017569057,0.00017094483,0.000015693784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020153761,0.0000365832,0.0005243512,0.000028775868,0.0000023760872,0.000008020205,0.002379443,0.0000058552305,0.010425405,0.96186805,0.00001269569,0.024706407],"study_design_scores_gemma":[0.00041363997,0.00003739799,0.005166532,0.00003166796,0.0000017595486,0.00003258575,0.00019526601,0.12815544,0.004696957,0.86079687,0.00029620522,0.00017570217],"about_ca_topic_score_codex":0.0000022038703,"about_ca_topic_score_gemma":0.0000566657,"teacher_disagreement_score":0.17805666,"about_ca_system_score_codex":0.0000067265396,"about_ca_system_score_gemma":0.000011053469,"threshold_uncertainty_score":0.25659308},"labels":[],"label_agreement":null},{"id":"W2092649812","doi":"10.1002/jgt.20507","title":"The genus of Petersen powers","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Petersen graph; Mathematics; Conjecture; Counterexample; Genus; Cubic graph; Graph; Projective plane; Discrete mathematics; Line graph; Voltage graph; Botany; Biology; Geometry","score_opus":0.010033350701152684,"score_gpt":0.2752240021314691,"score_spread":0.2651906514303164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092649812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7510282,0.0017541396,0.23498707,0.0015133556,0.0032360177,0.000198667,0.0000031103752,0.00003752692,0.0072419546],"genre_scores_gemma":[0.99014163,0.000126378,0.009370553,0.00007208419,0.00008534394,0.0000011015841,4.7510433e-8,0.0000101240785,0.00019272126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983511,0.00030777586,0.00041473747,0.000117601994,0.0005300999,0.0002786675],"domain_scores_gemma":[0.99725574,0.0011447213,0.00045873135,0.00063979795,0.00036465115,0.00013638307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004067099,0.00010174189,0.00018568047,0.00029217597,0.00017814328,0.00006583161,0.0020985736,0.000050609608,0.000020087717],"category_scores_gemma":[0.0004803504,0.000061035855,0.0002692192,0.00048437263,0.0005449077,0.00041165442,0.00017553773,0.0006640444,0.000006768513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013509594,0.000039319013,0.000271723,0.0000046074447,0.00006726543,0.00003700395,0.00046731313,0.00001552718,0.026776483,0.91411895,0.00021807944,0.05784864],"study_design_scores_gemma":[0.0003826276,0.000266505,0.0018028273,0.000016854261,0.000009805491,0.00032497806,0.0002669084,0.000064001484,0.009761687,0.9777431,0.009259971,0.000100747464],"about_ca_topic_score_codex":7.43065e-7,"about_ca_topic_score_gemma":0.0000029665873,"teacher_disagreement_score":0.23911348,"about_ca_system_score_codex":0.000009496679,"about_ca_system_score_gemma":0.000101921076,"threshold_uncertainty_score":0.3899707},"labels":[],"label_agreement":null},{"id":"W2092811992","doi":"10.1016/j.dam.2011.11.026","title":"Some bounds on global alliances in trees","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Graph; Upper and lower bounds; Offensive; Cardinality (data modeling); Simple graph; Alliance; Closed set; Simple (philosophy); Discrete mathematics; Computer science; Operations research; Data mining","score_opus":0.044389517821247136,"score_gpt":0.302027125385454,"score_spread":0.2576376075642069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092811992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11876683,0.00032111938,0.5856313,0.00030747027,0.0002906886,0.0011631083,0.000021394892,0.0005919783,0.29290608],"genre_scores_gemma":[0.7713836,0.000039885304,0.22811107,0.00017357814,0.000040807023,0.000103081526,0.0000020492173,0.00001807178,0.00012787693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984227,0.000021768645,0.00030006366,0.0003852981,0.00041019006,0.00046001407],"domain_scores_gemma":[0.99886954,0.00010445524,0.000097311044,0.0008040375,0.000020193997,0.00010445195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034446717,0.00019711466,0.00024760337,0.00009426427,0.00007516221,0.0000819383,0.0012863507,0.00006553769,0.0000200144],"category_scores_gemma":[0.000031796244,0.00016309644,0.000058650454,0.00051515753,0.00014535563,0.0003077323,0.00027063797,0.00016256525,0.00022162212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016122049,0.00013206247,0.00008354291,0.000027947013,0.0000094554225,0.000013622519,0.0013484835,0.000026216318,0.0002161573,0.9947867,0.000044691715,0.0032950311],"study_design_scores_gemma":[0.00030069673,0.00007279705,0.00085538713,0.000036292724,0.000002489915,0.0000031748073,0.00026352785,0.0031910464,0.002469409,0.99246126,0.00013525964,0.0002086476],"about_ca_topic_score_codex":0.000005350589,"about_ca_topic_score_gemma":0.000021776474,"teacher_disagreement_score":0.65261674,"about_ca_system_score_codex":0.00006578412,"about_ca_system_score_gemma":0.00003448487,"threshold_uncertainty_score":0.665088},"labels":[],"label_agreement":null},{"id":"W2092888300","doi":"10.48550/arxiv.math/0509004","title":"Counting unlabelled toroidal graphs with no K33-subdivisions","year":2005,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Enumeration; Toroid; Combinatorics; Mathematical proof; Subdivision; Planar; Projective plane; Discrete mathematics; Geometry; Computer science; Computer graphics (images)","score_opus":0.02506889068463987,"score_gpt":0.2795704581418943,"score_spread":0.25450156745725444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092888300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93959355,0.00020336379,0.05248265,0.00083842996,0.0001304181,0.00023979499,0.0000029027071,0.00033656304,0.0061723166],"genre_scores_gemma":[0.9719525,0.00003309896,0.02567012,0.0004594693,0.0001250257,0.000026434975,0.0000028084562,0.00002684052,0.0017036985],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99783564,0.00009965671,0.0002471573,0.0006003794,0.00053862936,0.0006785407],"domain_scores_gemma":[0.99822354,0.0002526042,0.00009357313,0.000956117,0.00026931596,0.0002048715],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004943269,0.00021706846,0.00021014722,0.00017616557,0.0004265038,0.00011070396,0.0012605586,0.00006533312,0.00011348797],"category_scores_gemma":[0.0001217496,0.0001766585,0.00007691728,0.0009396422,0.00018015993,0.0010474834,0.00042211247,0.00035294265,0.0015466451],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016663803,0.0005586049,0.7519216,0.00004571432,0.00016924701,0.00016008559,0.001623071,0.0011089654,0.040083822,0.1628676,0.00292576,0.03836887],"study_design_scores_gemma":[0.010053721,0.0025231694,0.5350634,0.00046282,0.000079834186,0.00027896828,0.00047278975,0.07298347,0.050488017,0.030689083,0.29259202,0.0043126955],"about_ca_topic_score_codex":0.00001710477,"about_ca_topic_score_gemma":0.000043556953,"teacher_disagreement_score":0.28966627,"about_ca_system_score_codex":0.000058749454,"about_ca_system_score_gemma":0.00009112679,"threshold_uncertainty_score":0.99923074},"labels":[],"label_agreement":null},{"id":"W2093180783","doi":"10.1016/j.ejc.2014.06.009","title":"The Chen–Chvátal conjecture for metric spaces induced by distance-hereditary graphs","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Conjecture; Metric space; De Bruijn sequence; Discrete mathematics; De Bruijn graph; Generalization; Mathematical analysis","score_opus":0.014858984196394653,"score_gpt":0.2557884431531749,"score_spread":0.24092945895678025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093180783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06391734,0.003404184,0.92446166,0.0020372227,0.0029614177,0.0002591087,0.00000625964,0.000061483974,0.0028913093],"genre_scores_gemma":[0.9973941,0.00012711284,0.0019559357,0.000096339594,0.00016103928,0.0000021443502,9.813134e-7,0.000034185017,0.00022819455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725914,0.00089310325,0.00048263368,0.00023151946,0.000697112,0.00043650324],"domain_scores_gemma":[0.99688435,0.0013250598,0.0005214739,0.0005444479,0.0004876823,0.00023699549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038275172,0.00019850623,0.00026928322,0.00023371782,0.00044157144,0.00031638335,0.0024548396,0.000033620032,0.0000016796457],"category_scores_gemma":[0.0009787367,0.00013137798,0.00020671537,0.0011705597,0.0001313423,0.0004720308,0.0002214255,0.0005958315,0.000007520499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009412602,0.00012725647,0.00023510508,0.000023190092,0.00009805819,0.000059989794,0.00029244536,0.000043315173,0.00092433486,0.9433083,0.018196212,0.03659767],"study_design_scores_gemma":[0.0032953059,0.0031792715,0.0015967208,0.000058481128,0.000031202835,0.00016493563,0.00015303119,0.0013245166,0.0024291752,0.65143377,0.33586013,0.00047345003],"about_ca_topic_score_codex":3.3538683e-7,"about_ca_topic_score_gemma":3.2612547e-7,"teacher_disagreement_score":0.93347675,"about_ca_system_score_codex":0.00005571686,"about_ca_system_score_gemma":0.00006495477,"threshold_uncertainty_score":0.53574383},"labels":[],"label_agreement":null},{"id":"W2093495451","doi":"10.1016/s0012-365x(99)00300-3","title":"On P4-transversals of perfect graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Transversal (combinatorics); Conjecture; Graph; Discrete mathematics; Induced subgraph; Chordal graph; Split graph; 1-planar graph","score_opus":0.017158800873379818,"score_gpt":0.28878315858051556,"score_spread":0.2716243577071357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093495451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55009186,0.00010723505,0.37003985,0.00029054546,0.00007719574,0.000484731,0.00002129137,0.00023470762,0.078652576],"genre_scores_gemma":[0.94766897,0.000044181867,0.051391546,0.000061444895,0.000008069178,0.00001402535,0.000001794113,0.00001950756,0.0007904417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986577,0.00007043089,0.000273678,0.00024639565,0.00046215742,0.0002896298],"domain_scores_gemma":[0.99857754,0.00037027037,0.0000655794,0.0008553926,0.000045230176,0.00008600153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038394512,0.00014599433,0.00023666471,0.0001348225,0.000072251096,0.000041430838,0.00092098606,0.00004560907,0.0003481385],"category_scores_gemma":[0.00006147222,0.00011649805,0.00014386278,0.0004885848,0.00013098656,0.00020621943,0.000054056884,0.00013962862,0.0001727146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014284457,0.000103302205,0.000020988915,0.00008318525,0.00002357361,0.000007655405,0.0017617327,0.00030970536,0.0012631135,0.9881183,0.00009070837,0.008203459],"study_design_scores_gemma":[0.000348199,0.0002791849,0.000091861955,0.00010570053,0.00000853743,0.000009876586,0.00006629938,0.019210922,0.014049569,0.96536344,0.00025924653,0.00020715052],"about_ca_topic_score_codex":0.0000025277734,"about_ca_topic_score_gemma":8.166782e-7,"teacher_disagreement_score":0.39757714,"about_ca_system_score_codex":0.000012665575,"about_ca_system_score_gemma":0.000019677922,"threshold_uncertainty_score":0.47506526},"labels":[],"label_agreement":null},{"id":"W2093500811","doi":"10.1016/j.disc.2009.10.006","title":"Rooted directed path graphs are leaf powers","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Wilfrid Laurier University","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph; Pathwidth; Interval graph; Line graph","score_opus":0.018272626899669405,"score_gpt":0.28614597697249655,"score_spread":0.26787335007282714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093500811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06467502,0.00032749242,0.91257805,0.0018413652,0.00021548443,0.0006631521,0.000019721856,0.001704537,0.017975193],"genre_scores_gemma":[0.8123381,0.00002740744,0.1864388,0.00030735953,0.000025709964,0.000016667125,0.000008582814,0.000029755052,0.0008076366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801314,0.00008959357,0.0003413925,0.0004232266,0.0005854373,0.00054722064],"domain_scores_gemma":[0.9981384,0.00017086322,0.00018844346,0.0011764886,0.00013614929,0.00018962586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038330522,0.00024465797,0.00031436753,0.0002173526,0.00017732465,0.00018354112,0.0012968155,0.00008106484,0.000025314434],"category_scores_gemma":[0.00028054861,0.00020353438,0.00014941746,0.0010984504,0.000095679854,0.00042263226,0.00017650868,0.00025620518,0.00009698173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105065865,0.00022623836,0.0002049638,0.000059431673,0.000038116832,0.00007610179,0.0023433294,0.00007211583,0.0021839235,0.9854513,0.0012892354,0.008044783],"study_design_scores_gemma":[0.0004404685,0.0001697626,0.0026976739,0.00014130154,0.00001073926,0.000022490638,0.0003450095,0.047518495,0.0017718695,0.9458499,0.00057281286,0.00045951043],"about_ca_topic_score_codex":0.0000011870211,"about_ca_topic_score_gemma":0.0000018148946,"teacher_disagreement_score":0.7476631,"about_ca_system_score_codex":0.00003699008,"about_ca_system_score_gemma":0.000030380297,"threshold_uncertainty_score":0.8299891},"labels":[],"label_agreement":null},{"id":"W2093939144","doi":"10.1007/s00236-007-0056-x","title":"Solving #SAT using vertex covers","year":2007,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Bounded function; Mathematics; Combinatorics; Discrete mathematics; Cluster analysis; Vertex (graph theory); Time complexity; Graph; Pathwidth; Line graph","score_opus":0.0258547673811828,"score_gpt":0.30543294107014124,"score_spread":0.27957817368895843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093939144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10442662,0.000016546406,0.8634289,0.00012319541,0.00022712279,0.00015030906,9.277121e-7,0.0001552744,0.031471096],"genre_scores_gemma":[0.91210264,0.0000045823745,0.08733039,0.00047839517,0.000016722017,0.0000012935151,0.0000012431392,0.0000066652938,0.00005805234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859256,0.000018683313,0.0002975571,0.00012428997,0.0004195947,0.0005473287],"domain_scores_gemma":[0.99869317,0.00042036478,0.0000853987,0.00056827907,0.00007596191,0.0001567985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008646733,0.00011071254,0.00012063212,0.00020890485,0.00020285543,0.00016067475,0.00093566783,0.000050888084,0.00003366382],"category_scores_gemma":[0.00029801682,0.00010165168,0.0000522069,0.0005267265,0.00008132228,0.002640533,0.00041920692,0.00019412632,0.00020446944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014999436,0.00012641464,0.0018266217,0.00019212694,0.00012994805,0.00011284617,0.01577614,0.0012930229,0.023902534,0.73487014,0.002733651,0.21888655],"study_design_scores_gemma":[0.0014948808,0.00032978322,0.002791373,0.00016969757,0.000014918581,0.00024902137,0.0014581607,0.857229,0.019978108,0.068296745,0.04692291,0.0010653964],"about_ca_topic_score_codex":0.000005305632,"about_ca_topic_score_gemma":0.000001948988,"teacher_disagreement_score":0.855936,"about_ca_system_score_codex":0.000094632196,"about_ca_system_score_gemma":0.00007007971,"threshold_uncertainty_score":0.4145235},"labels":[],"label_agreement":null},{"id":"W2093941744","doi":"10.1016/s0020-0190(03)00228-x","title":"From a simple elimination ordering to a strong elimination ordering in linear time","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Simple (philosophy); Chordal graph; Mathematics; Time complexity; Graph; Computer science; Combinatorics; Algorithm","score_opus":0.013666661840455533,"score_gpt":0.2796372488493467,"score_spread":0.2659705870088912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093941744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22341509,0.000008673927,0.77407223,0.0016282086,0.00007187523,0.00022526272,0.0000018812857,0.00014114722,0.00043566024],"genre_scores_gemma":[0.89257276,9.513375e-7,0.106040835,0.0012531605,0.00002592834,0.000053949298,0.000026143365,0.0000107681835,0.00001548935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846315,0.00007246779,0.00042398425,0.00022684889,0.00044527807,0.00036827193],"domain_scores_gemma":[0.99924654,0.000086945736,0.0001565807,0.00026207158,0.00016648366,0.00008135429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057219825,0.00014964327,0.00013298579,0.000633991,0.00017063213,0.00036817655,0.00042680954,0.000051360425,0.000017453378],"category_scores_gemma":[0.00041083238,0.00016603386,0.000025992511,0.0012106657,0.000024877054,0.0058691553,0.00010267579,0.00018990834,0.00015229062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056530207,0.00007213395,0.00080392795,0.00017595498,0.000015715703,0.000010533705,0.030958341,0.19152501,0.028755497,0.0072629876,0.000360803,0.7400026],"study_design_scores_gemma":[0.0011127193,0.00007291626,0.0054421895,0.00021713517,0.000004394831,0.000009371488,0.0008554195,0.9697693,0.010730477,0.004607504,0.0065782447,0.00060034584],"about_ca_topic_score_codex":0.0000242762,"about_ca_topic_score_gemma":0.000005558835,"teacher_disagreement_score":0.77824426,"about_ca_system_score_codex":0.00018365624,"about_ca_system_score_gemma":0.00007353894,"threshold_uncertainty_score":0.67706645},"labels":[],"label_agreement":null},{"id":"W2094094736","doi":"10.1007/s004930200025","title":"The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.038923521854735244,"score_gpt":0.27472123876878557,"score_spread":0.23579771691405033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094094736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50714123,0.008279808,0.41588348,0.009741448,0.0039371075,0.0019978832,0.000029524424,0.0011596774,0.051829875],"genre_scores_gemma":[0.99751496,0.00018566455,0.0013485589,0.000087966495,0.000016699285,0.000035250374,5.0507447e-7,0.000018444787,0.00079197396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802846,0.00023669495,0.00026441255,0.0004024679,0.0005662579,0.0005017155],"domain_scores_gemma":[0.9975382,0.0005192243,0.00011816788,0.0013728396,0.00030463285,0.00014690259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003915717,0.00017123752,0.00023405257,0.000097171,0.00037763972,0.00009819802,0.0020556436,0.00007590276,0.00006101791],"category_scores_gemma":[0.00017317575,0.00013147944,0.00016297294,0.0016454234,0.00023803295,0.0002540476,0.00041482455,0.0002756016,0.00015027773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011702953,0.0002613115,0.0044489494,0.00003286239,0.000086943655,0.00005089158,0.001111147,0.000009719768,0.00044172554,0.96000314,0.006299535,0.027242076],"study_design_scores_gemma":[0.0011997449,0.00014188401,0.0025060712,0.000032984317,0.000011285033,0.00006404409,0.000094716655,0.030768596,0.004551407,0.94164747,0.018591022,0.00039078383],"about_ca_topic_score_codex":0.00000896694,"about_ca_topic_score_gemma":9.72806e-7,"teacher_disagreement_score":0.49037373,"about_ca_system_score_codex":0.000046934423,"about_ca_system_score_gemma":0.000027184304,"threshold_uncertainty_score":0.53615755},"labels":[],"label_agreement":null},{"id":"W2094202793","doi":"10.1016/j.jctb.2004.08.003","title":"The perfect matching polytope and solid bricks","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Matching (statistics); Perfect graph theorem; Birkhoff polytope; Convex hull; Convex polytope; Degree (music); Regular polygon; Discrete mathematics; Graph; Convex set; Line graph; Convex optimization; Geometry; Physics","score_opus":0.008220812949512369,"score_gpt":0.2701819619439301,"score_spread":0.26196114899441775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094202793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69021446,0.0049155853,0.27983344,0.006384028,0.013448854,0.00039636152,0.0000019431675,0.00012141093,0.0046839267],"genre_scores_gemma":[0.9965603,0.000345308,0.0024332139,0.00008090173,0.00038790703,0.0000020218324,6.334675e-8,0.000014150357,0.00017618715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823046,0.0003867634,0.00038702012,0.00015432539,0.0004969357,0.00034448435],"domain_scores_gemma":[0.99818295,0.00072570425,0.00029246978,0.00038348505,0.00025369044,0.00016172606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030056,0.00014865922,0.00025232576,0.00011424918,0.0006073418,0.00041122208,0.0012183042,0.000056376794,0.000005103502],"category_scores_gemma":[0.00042441822,0.000096329604,0.00011487385,0.00031286737,0.00034192187,0.0013469843,0.00035892148,0.0005031619,0.0000044256694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036181396,0.000032293803,0.000019376736,0.0000047332724,0.00004038067,0.000054493994,0.0009776383,0.000088854445,0.0015507671,0.98930675,0.000024194856,0.007538692],"study_design_scores_gemma":[0.0009794415,0.0006469293,0.0001349165,0.00003592668,0.000006708223,0.0005707818,0.00035844586,0.0000063911507,0.0062198127,0.9873368,0.0035900315,0.00011378131],"about_ca_topic_score_codex":0.0000023483,"about_ca_topic_score_gemma":9.3323905e-7,"teacher_disagreement_score":0.3063458,"about_ca_system_score_codex":0.00007201483,"about_ca_system_score_gemma":0.00018684378,"threshold_uncertainty_score":0.46712437},"labels":[],"label_agreement":null},{"id":"W2094278957","doi":"10.1016/j.disc.2010.11.007","title":"Well-covered circulant graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Lexicographical order; Mathematics; Combinatorics; Circulant graph; Discrete mathematics; Characterization (materials science); Graph; Line graph; Voltage graph","score_opus":0.016664478147683726,"score_gpt":0.28505904869301746,"score_spread":0.2683945705453337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094278957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15879852,0.00003410912,0.80041766,0.0004620918,0.0004921152,0.0003906792,0.000009798809,0.0003891844,0.03900584],"genre_scores_gemma":[0.7914971,0.000010107654,0.20763826,0.00011198105,0.000040844832,0.00002890578,0.0000044259627,0.000028033966,0.0006403355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984638,0.00003617716,0.0002673719,0.0003341602,0.0004748296,0.00042364464],"domain_scores_gemma":[0.99812627,0.00020439584,0.00010180257,0.0013265593,0.00007877024,0.00016221876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048671677,0.00017309278,0.00020435172,0.00014836769,0.00014624879,0.00018801476,0.001445973,0.00007647187,0.000101971214],"category_scores_gemma":[0.00016540347,0.0001408101,0.00012515555,0.00048110815,0.00014220345,0.00036538602,0.00035738284,0.00037669254,0.00041691895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016667564,0.000048945112,0.00010145826,0.000037696962,0.000015203139,0.000017225817,0.0005854105,0.00000997236,0.012767646,0.98517203,0.00019544437,0.0010472989],"study_design_scores_gemma":[0.00023128295,0.000032553235,0.00018846244,0.000019105428,0.0000054631396,0.000062645835,0.000084875064,0.03721462,0.00695046,0.9527211,0.002235869,0.00025355766],"about_ca_topic_score_codex":0.0000026000812,"about_ca_topic_score_gemma":0.00000573043,"teacher_disagreement_score":0.6326986,"about_ca_system_score_codex":0.000010618118,"about_ca_system_score_gemma":0.000037735106,"threshold_uncertainty_score":0.5742069},"labels":[],"label_agreement":null},{"id":"W2094337274","doi":"10.1016/j.dam.2002.12.005","title":"Embeddings of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si88.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-connected graphs of pathwidth <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si89.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Mathematics; Scroll; Algorithm; Discrete mathematics; Theology","score_opus":0.018003696424160012,"score_gpt":0.25559724461823347,"score_spread":0.23759354819407347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094337274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579249,0.00068060594,0.028491216,0.00028338056,0.0010294012,0.0005162338,0.00044205875,0.0008858916,0.009746316],"genre_scores_gemma":[0.9369617,0.00067328254,0.05852396,0.00075615733,0.00049685186,0.0012270975,0.00042814424,0.00077492336,0.00015784455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858695,0.00029374877,0.003552534,0.0027979368,0.004205041,0.0032811842],"domain_scores_gemma":[0.9873076,0.0021539442,0.003600824,0.005244939,0.00048397877,0.0012086799],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0034080658,0.0018417414,0.0015123638,0.00095157104,0.0015671365,0.0010796953,0.0049612056,0.001929681,0.0002218476],"category_scores_gemma":[0.0013916416,0.002245161,0.0021178583,0.002687253,0.002087603,0.002041516,0.0036734326,0.002275473,0.0018684377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008126187,0.00093589886,0.000007775713,0.0024733834,0.0011536932,0.00048615952,0.006560579,0.0031117871,0.018323813,0.96415424,0.0007512021,0.0012288302],"study_design_scores_gemma":[0.003989669,0.0015320345,0.000038073136,0.0018010477,0.0007794347,0.0006775923,0.002965736,0.78673345,0.1288872,0.06932107,0.0011238303,0.0021508532],"about_ca_topic_score_codex":0.00034941887,"about_ca_topic_score_gemma":0.00015542482,"teacher_disagreement_score":0.8948332,"about_ca_system_score_codex":0.00010631887,"about_ca_system_score_gemma":0.0015168254,"threshold_uncertainty_score":0.99995726},"labels":[],"label_agreement":null},{"id":"W2094803507","doi":"10.1016/s0012-365x(03)00241-3","title":"Analysis of greedy algorithms on graphs with bounded degrees","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Heuristics; Combinatorics; Bounded function; Sequence (biology); Greedy algorithm; Algorithm; Random graph; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.028575948934962812,"score_gpt":0.2982504229598212,"score_spread":0.2696744740248584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094803507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06456934,0.000047006077,0.92417556,0.000044241355,0.000029693516,0.00021448544,0.000010758615,0.00007842609,0.010830461],"genre_scores_gemma":[0.6140214,0.000010464767,0.38560784,0.000029379084,0.0000033288572,0.000020332267,0.0000036072963,0.0000189923,0.00028464402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820954,0.000102089936,0.00031064186,0.00033366223,0.0006763846,0.00036768743],"domain_scores_gemma":[0.9981298,0.00031825269,0.00018846501,0.0011174813,0.00013879211,0.00010722085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059599284,0.00018694211,0.0004100417,0.0005974147,0.0001126914,0.00008055705,0.0007754929,0.000045065848,0.000029231644],"category_scores_gemma":[0.00012706523,0.0001311493,0.00017740519,0.0028259393,0.00020538193,0.00020634147,0.00008928506,0.00013657268,0.000012691972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073922197,0.00012017468,0.00070478464,0.00003476086,0.0004764244,0.000011095127,0.00097183225,0.0010876354,0.000093036644,0.9956768,0.0000075662083,0.00080847414],"study_design_scores_gemma":[0.0008049295,0.0007446826,0.0013623644,0.00011608146,0.00045835486,0.000021079426,0.0009018849,0.2566201,0.007585137,0.7305775,0.00018556353,0.0006222871],"about_ca_topic_score_codex":0.0000039068127,"about_ca_topic_score_gemma":0.000011986616,"teacher_disagreement_score":0.54945207,"about_ca_system_score_codex":0.000022182814,"about_ca_system_score_gemma":0.000040508636,"threshold_uncertainty_score":0.5348113},"labels":[],"label_agreement":null},{"id":"W2095382269","doi":"10.1016/j.dam.2014.12.017","title":"Practical algorithms for branch-decompositions of planar graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematics; Planar graph; Algorithm; Time complexity; Graph; Planar; Decomposition; Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.078365028692375,"score_gpt":0.3703406906755415,"score_spread":0.2919756619831665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095382269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091578026,0.000021124988,0.9912934,0.00046128352,0.000064673266,0.000610395,0.000034167646,0.000105818355,0.0064933603],"genre_scores_gemma":[0.06302962,0.0000043038553,0.93665016,0.000046513105,0.000024322675,0.00015879182,0.000016040978,0.000021458678,0.000048773432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857527,0.000021784967,0.0003590829,0.00027804615,0.00043688188,0.00032893394],"domain_scores_gemma":[0.9981884,0.0005912238,0.00017121829,0.000687915,0.00016415496,0.00019711188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060293754,0.00015172733,0.00028489562,0.00013905353,0.00008579425,0.000056566478,0.00063067785,0.00006573096,0.0000036710176],"category_scores_gemma":[0.00013456296,0.00013183604,0.00009758521,0.00038995518,0.00015079643,0.00023999297,0.00014311432,0.00013370399,0.000026630194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001897266,0.00013213522,0.0000019676963,0.000076557175,0.000030412994,0.0000018491584,0.00082450523,0.000038219532,0.002569643,0.9942595,0.0011181056,0.0009281251],"study_design_scores_gemma":[0.00061239116,0.00011445551,0.000004726901,0.000018463485,0.000015976457,0.000019896792,0.00034575918,0.023041513,0.008798538,0.9663062,0.00055539905,0.0001666772],"about_ca_topic_score_codex":0.0000010193065,"about_ca_topic_score_gemma":8.912668e-7,"teacher_disagreement_score":0.062113833,"about_ca_system_score_codex":0.000023639328,"about_ca_system_score_gemma":0.0000913216,"threshold_uncertainty_score":0.5376118},"labels":[],"label_agreement":null},{"id":"W2096004680","doi":"10.1002/jgt.21786","title":"Arc‐Disjoint In‐ and Out‐Branchings With the Same Root in Locally Semicomplete Digraphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Arc (geometry); Root (linguistics); Discrete mathematics; Geometry; Linguistics","score_opus":0.010463549243009442,"score_gpt":0.24629843738448523,"score_spread":0.2358348881414758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096004680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69634914,0.0006791085,0.30022866,0.0018528998,0.00009742819,0.00015455562,7.4888635e-7,0.000016409105,0.0006210124],"genre_scores_gemma":[0.9961338,0.00006825787,0.0031883758,0.00051049085,0.000042642027,0.000005081378,1.2520032e-7,0.000016521542,0.000034724693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973838,0.0008831498,0.0004836202,0.00028084236,0.00052463694,0.0004439689],"domain_scores_gemma":[0.9977749,0.0011239084,0.00032542367,0.00049719395,0.000126113,0.00015243626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005227925,0.00020331985,0.00038576633,0.0008328731,0.00011236316,0.00012977516,0.0012969059,0.00005572835,0.0000046260416],"category_scores_gemma":[0.00019130226,0.00011836172,0.00011866635,0.00086196535,0.0004978687,0.0006562336,0.00021548377,0.0009120437,0.0000024601782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010197462,0.00018542119,0.039651755,0.00004982116,0.000084386804,0.00017070852,0.010667735,0.0012302479,0.0043131146,0.8911892,0.00009738942,0.051340487],"study_design_scores_gemma":[0.0015126214,0.00054338283,0.046621934,0.0002260136,0.0000058725677,0.00025079632,0.00045057747,0.0008719748,0.0003530618,0.94840485,0.0005527503,0.00020614453],"about_ca_topic_score_codex":0.000008515544,"about_ca_topic_score_gemma":0.00026361464,"teacher_disagreement_score":0.2997846,"about_ca_system_score_codex":0.000033011947,"about_ca_system_score_gemma":0.00005838618,"threshold_uncertainty_score":0.4826651},"labels":[],"label_agreement":null},{"id":"W2096146759","doi":"10.1016/j.dam.2005.03.002","title":"Orientable convexity, geodetic and hull numbers in graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Geodetic datum; Combinatorics; Convexity; Hull; Geodesy; Geography; Geology","score_opus":0.014271766572100894,"score_gpt":0.27461718913780303,"score_spread":0.26034542256570214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096146759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2749685,0.00021466102,0.6568324,0.00066077063,0.00007636581,0.0009817871,0.0000070859105,0.00028107286,0.065977365],"genre_scores_gemma":[0.74229175,0.000045572662,0.25720903,0.00014919195,0.0000147175515,0.00006879249,0.0000024990516,0.000021003769,0.00019741798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843735,0.00002159548,0.00031987362,0.0003934607,0.00035348072,0.00047426412],"domain_scores_gemma":[0.99890995,0.0001974333,0.000084967774,0.00064099673,0.000027631195,0.00013900925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004864291,0.00018471539,0.00025946106,0.00017751064,0.00009558621,0.00012214672,0.00065745966,0.00006532063,0.000028078002],"category_scores_gemma":[0.00003092369,0.00016899202,0.00003764602,0.0005652703,0.00018652643,0.00032135306,0.0004492726,0.00022200336,0.0000912102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005532781,0.00006805256,0.00017281504,0.0000630958,0.000008018105,0.000004571964,0.0019136508,0.000095495576,0.0010177402,0.99299777,0.00006169839,0.0035915663],"study_design_scores_gemma":[0.00071644364,0.000027356198,0.00016544685,0.00003410583,0.0000057756292,0.000018167642,0.00055379345,0.032919377,0.003701557,0.96061796,0.0009356633,0.00030437548],"about_ca_topic_score_codex":0.0000063409834,"about_ca_topic_score_gemma":0.000028505496,"teacher_disagreement_score":0.46732327,"about_ca_system_score_codex":0.000039878047,"about_ca_system_score_gemma":0.00002580919,"threshold_uncertainty_score":0.6891294},"labels":[],"label_agreement":null},{"id":"W2097049847","doi":"10.1007/3-540-44985-x_12","title":"On Graph Powers for Leaf-Labeled Trees","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tree (set theory); Graph; Gomory–Hu tree; Combinatorics; Computer science; K-ary tree; Path (computing); Basis (linear algebra); Spanning tree; Time complexity; Node (physics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Mathematics; Artificial intelligence; Binary tree; Physics","score_opus":0.020033376454771587,"score_gpt":0.2843146293703784,"score_spread":0.2642812529156068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097049847","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009327419,0.0003842208,0.9907405,0.00074564747,0.0011003291,0.0009359524,0.000016838394,0.00024446184,0.0057387687],"genre_scores_gemma":[0.1364612,0.0003361146,0.85127515,0.0065376344,0.0009102434,0.00016474468,0.000041091218,0.00024125243,0.00403254],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945447,0.000056064695,0.0005237908,0.0022835361,0.0013735837,0.0012183568],"domain_scores_gemma":[0.99523854,0.0018230666,0.00021494993,0.002180303,0.00025716616,0.00028598125],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010915917,0.00070494704,0.0006623931,0.001877582,0.00045171616,0.00050333946,0.005589997,0.00036424884,0.000057480862],"category_scores_gemma":[0.00017907372,0.00063305313,0.00029753952,0.0010987578,0.0012590908,0.0006154671,0.00071514776,0.001022579,0.00008965441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007585116,0.00005285589,0.000004158994,0.000023339633,0.000018939567,0.000060181083,0.00030689177,0.04759992,0.00021087597,0.30902895,0.000058029083,0.64256],"study_design_scores_gemma":[0.0005679879,0.00071258016,0.000013030121,0.00024626852,0.0000049005102,0.000025533513,9.317737e-8,0.08352718,0.0013156907,0.9091807,0.0037033118,0.0007027356],"about_ca_topic_score_codex":0.000005706325,"about_ca_topic_score_gemma":0.000050718638,"teacher_disagreement_score":0.64185727,"about_ca_system_score_codex":0.00027206223,"about_ca_system_score_gemma":0.0004546997,"threshold_uncertainty_score":0.99979025},"labels":[],"label_agreement":null},{"id":"W2098354393","doi":"10.1093/logcom/exl014","title":"First-order Definable Retraction Problems for Posets and Reflexive Graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reflexivity; Order (exchange); Mathematics; Star product; Combinatorics; Computer science; Discrete mathematics; Sociology; Business","score_opus":0.033400100698425625,"score_gpt":0.3163988984890406,"score_spread":0.282998797790615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098354393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060485944,0.00070984947,0.9373898,0.0008902794,0.00010785334,0.00014827427,6.3055234e-7,0.000013967024,0.00025339963],"genre_scores_gemma":[0.8473278,0.000091308786,0.15240379,0.00005860145,0.00005132197,0.0000038743797,0.0000013678872,0.0000040470063,0.000057848025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992974,0.000043067936,0.00022883421,0.00013070558,0.00016788852,0.00013211415],"domain_scores_gemma":[0.99912786,0.00019024224,0.00024199017,0.000053203,0.000344448,0.000042237236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048663476,0.000068897236,0.00011941324,0.00015828144,0.00016791264,0.00009463737,0.00009988745,0.000048232137,6.7128485e-7],"category_scores_gemma":[0.000038684277,0.00005513792,0.00003232869,0.00023170336,0.000046593035,0.00055775576,0.00003178625,0.000120753924,4.237479e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027005875,0.00023571045,0.0028476315,0.00020115431,0.000050495997,0.000033428478,0.0006095854,0.06976408,0.0014986324,0.8243426,0.0017886406,0.09835796],"study_design_scores_gemma":[0.0005487792,0.000580088,0.0072222287,0.000027177028,0.000006468793,0.00016789293,0.000033700686,0.05765843,0.00008150092,0.9330261,0.00057811313,0.000069566784],"about_ca_topic_score_codex":0.000006750705,"about_ca_topic_score_gemma":0.0000047506533,"teacher_disagreement_score":0.78684187,"about_ca_system_score_codex":0.000021304886,"about_ca_system_score_gemma":0.000023388866,"threshold_uncertainty_score":0.22484592},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2098531449","doi":"10.1016/j.dam.2014.08.006","title":"Excluding cycles with a fixed number of chords","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Chromatic scale; Chord (peer-to-peer); Graph; Discrete mathematics; Chordal graph; Computer science","score_opus":0.01986480492450143,"score_gpt":0.2981553816262689,"score_spread":0.2782905767017675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098531449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06990272,0.0000057598113,0.87149584,0.000058145306,0.000016672528,0.00015495485,0.0000017279929,0.000110781184,0.058253404],"genre_scores_gemma":[0.5920664,0.0000030312276,0.40772966,0.000023468487,0.000015464515,0.000035007677,0.0000012336524,0.000018578978,0.000107148706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986463,0.000024450634,0.00028976315,0.00024138167,0.0004771107,0.00032094654],"domain_scores_gemma":[0.9984598,0.00033194554,0.00018968986,0.000857253,0.00006603053,0.000095264215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043028552,0.00016734572,0.0003118913,0.0000737036,0.000084084684,0.000057153993,0.00085816305,0.000047959304,0.000020933992],"category_scores_gemma":[0.000062663756,0.0001227656,0.00005176458,0.00042227138,0.00015858446,0.00017133352,0.00028635925,0.00013822253,0.00005695534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010869366,0.00004698294,0.00012923936,0.00013000569,0.000022848892,8.409935e-7,0.0011108716,0.000069430345,0.005233946,0.9869644,0.000025947233,0.006254617],"study_design_scores_gemma":[0.00085192884,0.00009517721,0.0003100621,0.00013971554,0.000020232845,0.000025235357,0.00072237576,0.027705505,0.031420022,0.93778074,0.0004872804,0.0004417075],"about_ca_topic_score_codex":0.0000016928132,"about_ca_topic_score_gemma":0.0000015249477,"teacher_disagreement_score":0.5221637,"about_ca_system_score_codex":0.000015307613,"about_ca_system_score_gemma":0.000024773797,"threshold_uncertainty_score":0.50062364},"labels":[],"label_agreement":null},{"id":"W2099141182","doi":"10.1002/jgt.20062","title":"Factorizations and characterizations of induced‐hereditary and compositive properties","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Factorization; Graph; Discrete mathematics; Algorithm","score_opus":0.023847712417627,"score_gpt":0.26269614179325573,"score_spread":0.23884842937562872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099141182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8482458,0.0016122229,0.1491565,0.0005734742,0.00010976921,0.00010309178,0.0000069606563,0.000013639854,0.00017851064],"genre_scores_gemma":[0.99448556,0.00022920524,0.0051299864,0.00006580021,0.000053460495,0.0000015613552,5.035328e-7,0.000006940883,0.000026976737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990339,0.00020663605,0.00030469158,0.0001113096,0.00021522958,0.0001282245],"domain_scores_gemma":[0.99902153,0.00020622696,0.00023929149,0.00015470565,0.00029421118,0.00008405365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005292256,0.00009003234,0.00018697478,0.00036929583,0.000115536786,0.00003810344,0.0003003839,0.000039122646,0.00000572495],"category_scores_gemma":[0.00009854796,0.00006895655,0.000046750072,0.00032889133,0.000239318,0.0010141633,0.000120978046,0.00019510585,5.0822706e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001282918,0.00019037597,0.0021606958,0.000039138522,0.00014875749,0.000015150377,0.005439288,0.000052606734,0.29197702,0.63893926,0.000018160597,0.060891245],"study_design_scores_gemma":[0.002241352,0.0016437048,0.16224822,0.0005479006,0.000091217014,0.0011405431,0.0016596726,0.0017937397,0.1646059,0.6627333,0.0006654038,0.0006290477],"about_ca_topic_score_codex":7.367366e-7,"about_ca_topic_score_gemma":6.810562e-7,"teacher_disagreement_score":0.16008753,"about_ca_system_score_codex":0.000011678308,"about_ca_system_score_gemma":0.00005152284,"threshold_uncertainty_score":0.28119665},"labels":[],"label_agreement":null},{"id":"W2099449032","doi":"10.1007/s00037-011-0032-2","title":"Special Issue In Memory of Misha Alekhnovich. Foreword","year":2011,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Lomonosov Moscow State University","keywords":"Computer science; Mathematics; Discrete mathematics; Theoretical computer science","score_opus":0.10974431150704561,"score_gpt":0.3271698014169991,"score_spread":0.21742548990995347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099449032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16314025,0.00008381562,0.7032804,0.00040381143,0.00085980585,0.00057168235,0.000029038525,0.00016394928,0.13146727],"genre_scores_gemma":[0.7235157,0.0000013337801,0.27564755,0.00015427732,0.00048748803,0.00001167967,0.000013593934,0.000011416126,0.00015695789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831146,0.00014825804,0.00038268714,0.00038192698,0.00047231498,0.00030333703],"domain_scores_gemma":[0.9989079,0.00023930815,0.00012280612,0.00040034397,0.00023259642,0.00009699706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045204582,0.00013839567,0.00024148686,0.00030261636,0.000078605764,0.000021883396,0.0011537829,0.000047823414,0.0005651791],"category_scores_gemma":[0.000081082995,0.00014752231,0.00007888533,0.00076720066,0.00037153007,0.00041046384,0.0004168737,0.00020560797,0.0000992054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010321403,0.00034468525,0.0065545514,0.000041372732,0.000020904205,0.000048267648,0.0021792126,0.0036330866,0.000038022725,0.9645401,0.0024241,0.02007243],"study_design_scores_gemma":[0.00048067246,0.000086183885,0.1209349,0.000017082142,0.000001211237,0.000013959758,0.000035814308,0.034482107,0.00031915304,0.842517,0.00095979095,0.00015211481],"about_ca_topic_score_codex":0.00005872902,"about_ca_topic_score_gemma":0.00007889873,"teacher_disagreement_score":0.56037545,"about_ca_system_score_codex":0.00005308319,"about_ca_system_score_gemma":0.00011288907,"threshold_uncertainty_score":0.61883146},"labels":[],"label_agreement":null},{"id":"W2099914933","doi":"10.1145/1240233.1240237","title":"Improved algorithms for weakly chordal graphs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Treewidth; Clique problem; Split graph; Discrete mathematics; Computational complexity theory; Clique; Time complexity; Algorithm; Graph; Pathwidth; Line graph; 1-planar graph","score_opus":0.03253514641846965,"score_gpt":0.32550833371528026,"score_spread":0.2929731872968106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099914933","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007032085,0.00007264172,0.99538195,0.000995967,0.0011149517,0.000853183,0.000053052805,0.0005044266,0.00032058917],"genre_scores_gemma":[0.074973255,0.000059172347,0.9228054,0.00042459683,0.00014089947,0.0002620081,0.00000769652,0.0000629968,0.0012639586],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970211,0.00006703119,0.00044996114,0.0008842708,0.0005303677,0.0010473079],"domain_scores_gemma":[0.9967189,0.0008247365,0.000096078016,0.0017104518,0.00027994585,0.00036987476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012687291,0.00033816657,0.00029471604,0.000657415,0.0006193945,0.00015249681,0.0021794129,0.00018002339,0.00004113089],"category_scores_gemma":[0.00009688683,0.00032942547,0.0003450929,0.0014085644,0.00018688389,0.0007472446,0.00003803599,0.0005482471,0.00005552073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100858975,0.00028929624,0.000004034212,0.0000142072595,0.00007694551,0.0000145667655,0.00023028227,0.0001678723,0.0047759316,0.01114635,0.000055948753,0.9831237],"study_design_scores_gemma":[0.006594119,0.003751558,0.0013222995,0.00007829151,0.00008598708,0.0002141811,0.0004960368,0.22113922,0.28092632,0.4547879,0.02827965,0.0023244463],"about_ca_topic_score_codex":0.000032010415,"about_ca_topic_score_gemma":0.000030054862,"teacher_disagreement_score":0.98079926,"about_ca_system_score_codex":0.00011969857,"about_ca_system_score_gemma":0.0000920824,"threshold_uncertainty_score":0.9999158},"labels":[],"label_agreement":null},{"id":"W2100478405","doi":"10.1016/j.ejc.2011.09.031","title":"Reduced clique graphs of chordal graphs","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Treewidth; Indifference graph; Interval graph; Split graph; Clique-sum; Pathwidth; Discrete mathematics; Clique; Graph; 1-planar graph; Line graph","score_opus":0.039253829072214,"score_gpt":0.2658061011198843,"score_spread":0.22655227204767028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100478405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7097369,0.00095818186,0.23516701,0.00018272105,0.0023578077,0.00020148764,0.0000022551426,0.00008737258,0.05130629],"genre_scores_gemma":[0.9854243,0.0001892393,0.014204372,0.000040853447,0.000025097626,4.5840696e-7,1.75768e-7,0.000028554907,0.0000869398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970001,0.0010257887,0.0007792035,0.00021135375,0.0006422975,0.00034124727],"domain_scores_gemma":[0.9974023,0.00013466852,0.00074348866,0.000664246,0.00078215165,0.0002731439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028953406,0.0001759551,0.00033443762,0.00060675933,0.00008730174,0.00003817187,0.0024739963,0.000030228919,0.000017501576],"category_scores_gemma":[0.0002557164,0.00015312937,0.00026538142,0.0012855117,0.00018819289,0.0006283112,0.00032722845,0.0005766966,0.000017192326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008283417,0.00029558118,0.0014058867,0.000018104625,0.000057955574,0.00045363614,0.0011718365,0.00000654257,0.0037693388,0.9866414,0.00042447884,0.0056723733],"study_design_scores_gemma":[0.0015624932,0.0022680182,0.0180163,0.000101300284,0.000018586063,0.00034478155,0.00008714399,0.000060862156,0.030240193,0.945427,0.0015765947,0.0002967442],"about_ca_topic_score_codex":0.000001022482,"about_ca_topic_score_gemma":1.0001266e-7,"teacher_disagreement_score":0.27568743,"about_ca_system_score_codex":0.00002831838,"about_ca_system_score_gemma":0.00010464733,"threshold_uncertainty_score":0.6244434},"labels":[],"label_agreement":null},{"id":"W2101359548","doi":"10.1093/acprof:oso/9780198571278.003.0002","title":"EULERIAN AND BIPARTITE ORIENTABLE MATROIDS","year":2007,"lang":"en","type":"book-chapter","venue":"Oxford University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Bipartite graph; Eulerian path; Matroid; Combinatorics; Mathematics; Computer science; Pure mathematics; Graph","score_opus":0.03567561002324756,"score_gpt":0.2448858804905198,"score_spread":0.20921027046727222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101359548","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005638057,0.00013224233,0.06449856,0.000015658312,0.00014672554,0.00027844077,0.000029505689,0.000190351,0.93465215],"genre_scores_gemma":[0.00023175885,0.00023474821,0.009087596,0.000047481804,0.000052136325,5.0294994e-7,0.0000063198036,0.00003189513,0.99030757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982874,0.00003336239,0.00015360612,0.0006622221,0.00038439597,0.00047901517],"domain_scores_gemma":[0.99852407,0.00008647963,0.00013265373,0.00085506734,0.00011918733,0.0002825492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024052593,0.00030611013,0.0003013362,0.00037149125,0.00028400263,0.000120500226,0.0011747591,0.00026055067,0.0000223363],"category_scores_gemma":[0.0000052563482,0.00035286334,0.00010593048,0.000026832835,0.00033693342,0.0003545506,0.0014712975,0.00047294804,0.000003457882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054749038,0.0000050070557,0.0000061380115,0.000030711675,0.000046398163,0.00021105098,0.000112182344,0.0000031449467,0.000030571482,0.9839441,0.00029079837,0.015265104],"study_design_scores_gemma":[0.00036561725,0.000083309176,0.0000066323405,0.00005763616,0.000021721771,0.00002135984,0.000011904133,0.0002061299,0.0002183195,0.020881556,0.97777706,0.00034876636],"about_ca_topic_score_codex":0.000016979957,"about_ca_topic_score_gemma":0.000015804122,"teacher_disagreement_score":0.97748625,"about_ca_system_score_codex":0.00011099778,"about_ca_system_score_gemma":0.00006905242,"threshold_uncertainty_score":0.99989235},"labels":[],"label_agreement":null},{"id":"W2101632844","doi":"10.1007/s00454-012-9413-9","title":"Linkless and Flat Embeddings in 3-Space","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Japan Society for the Promotion of Science; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Combinatorics; Mathematics; Embedding; Discrete mathematics; Computer science","score_opus":0.016664740178682233,"score_gpt":0.308982869549456,"score_spread":0.2923181293707737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101632844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46904612,0.0007614229,0.5279433,0.0005715298,0.00014477334,0.00012997817,0.0000047133053,0.00007226948,0.0013258817],"genre_scores_gemma":[0.93752,0.0000120797595,0.06206089,0.00016696523,0.00006357287,0.0000117169575,0.000010746774,0.000011515977,0.00014248374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984538,0.0000910631,0.00019902084,0.00032893853,0.0004430393,0.00048412182],"domain_scores_gemma":[0.9989572,0.00047520603,0.000059255595,0.00023070062,0.00007495254,0.00020266103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000600486,0.00014391339,0.00016507096,0.00050153746,0.00010710625,0.000108097636,0.0004432395,0.00005892633,0.000020196156],"category_scores_gemma":[0.00010051137,0.00014060146,0.000041779822,0.0012379516,0.00011384371,0.0010534383,0.00044773307,0.00023999825,0.000057180445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016418602,0.000046303692,0.09312791,0.000028981041,0.00001691521,0.000010648472,0.001351645,0.008326472,0.00018301087,0.88466626,0.00010580933,0.012119602],"study_design_scores_gemma":[0.001036629,0.00008575298,0.44101897,0.00006555864,0.000004671282,0.000077410936,0.00027715167,0.21194051,0.00044271676,0.34248132,0.001970542,0.00059874577],"about_ca_topic_score_codex":0.000008283357,"about_ca_topic_score_gemma":0.0000011829925,"teacher_disagreement_score":0.54218495,"about_ca_system_score_codex":0.00004746183,"about_ca_system_score_gemma":0.000032893142,"threshold_uncertainty_score":0.5733561},"labels":[],"label_agreement":null},{"id":"W2101752896","doi":"10.1016/s0166-218x(02)00251-2","title":"Finding paths in graphs avoiding forbidden transitions","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Graph isomorphism; Line graph","score_opus":0.04135075435661177,"score_gpt":0.2841048643191326,"score_spread":0.24275410996252084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101752896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033258572,0.00008340773,0.92756855,0.00031843167,0.000051463336,0.0005029645,0.000007359583,0.0002205984,0.03798867],"genre_scores_gemma":[0.84839886,0.000031321095,0.15125461,0.00005994062,0.000013206997,0.000110749825,0.0000027943136,0.00002405403,0.00010444234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983257,0.00003771856,0.0003678436,0.0003665286,0.00037964474,0.0005225614],"domain_scores_gemma":[0.99880075,0.0003129653,0.00008524851,0.00066714414,0.000024138439,0.000109735134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353668,0.00019140136,0.0002509914,0.0003456493,0.00023287626,0.00012698326,0.000847257,0.00007323929,0.000065284345],"category_scores_gemma":[0.000053667718,0.00018140495,0.00009159929,0.0010065266,0.00008130609,0.00033968425,0.000160527,0.00036567246,0.00014381536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014882548,0.00007998509,0.000014292495,0.000060602266,0.000009259914,0.000016098342,0.0071704485,0.00012695616,0.005127475,0.98380125,0.000067081324,0.0035250674],"study_design_scores_gemma":[0.00046569435,0.000026025073,0.00004394865,0.00007352354,0.0000063365087,0.000012495652,0.0013263811,0.093158305,0.0024901354,0.9019639,0.000115470735,0.00031782233],"about_ca_topic_score_codex":0.0000010471653,"about_ca_topic_score_gemma":0.000005658987,"teacher_disagreement_score":0.8151403,"about_ca_system_score_codex":0.00004539502,"about_ca_system_score_gemma":0.000009522886,"threshold_uncertainty_score":0.7397479},"labels":[],"label_agreement":null},{"id":"W2101880654","doi":"10.1002/jgt.21637","title":"Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Monotone polygon; Combinatorics; Graph; Forcing (mathematics); Path (computing); Minor (academic); Tree (set theory); Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.01925852887274516,"score_gpt":0.28743283386172175,"score_spread":0.2681743049889766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101880654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7789274,0.001745874,0.21794036,0.00024608115,0.00036320265,0.00019959267,0.0000040073605,0.000028868088,0.0005446142],"genre_scores_gemma":[0.96485746,0.00015012977,0.03474698,0.00015068379,0.000018244951,0.000004159952,3.4205215e-7,0.00001380083,0.00005821317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717534,0.0006491643,0.00073916215,0.00024085942,0.00060915755,0.00058631744],"domain_scores_gemma":[0.99730474,0.00080719416,0.0005518761,0.0005340837,0.00027363186,0.00052847865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004935176,0.00021742587,0.00047468953,0.0007954995,0.00012624024,0.000052377603,0.001042318,0.000108919434,0.000014958304],"category_scores_gemma":[0.00039459538,0.00015874993,0.00032260758,0.0012774799,0.00030194825,0.0010718526,0.00027524016,0.0005002187,0.0000049698724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013318651,0.0005090404,0.02783326,0.00008306419,0.00045664248,0.000051132574,0.0051698084,0.00018323046,0.02101053,0.71774906,0.00041939763,0.22520298],"study_design_scores_gemma":[0.0006409065,0.00057723455,0.015535463,0.00009184111,0.000031618274,0.0002618918,0.00014550587,0.00003811,0.0072005745,0.9750273,0.00025204054,0.00019747745],"about_ca_topic_score_codex":0.0000033409485,"about_ca_topic_score_gemma":0.000001722247,"teacher_disagreement_score":0.2572783,"about_ca_system_score_codex":0.00003520467,"about_ca_system_score_gemma":0.000040992978,"threshold_uncertainty_score":0.6473634},"labels":[],"label_agreement":null},{"id":"W2102110641","doi":"10.1016/j.jctb.2006.02.008","title":"Mutually embeddable graphs and the tree alternative conjecture","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Wilfrid Laurier University","funders":"Division of Mathematical Sciences","keywords":"Mathematics; Combinatorics; Conjecture; Tree (set theory); Vertex (graph theory); Discrete mathematics; Embedding; Graph; Computer science","score_opus":0.006309784519698531,"score_gpt":0.2422969169776194,"score_spread":0.23598713245792088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102110641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6062277,0.010976088,0.2912575,0.01099696,0.024226902,0.0016314944,0.00001610526,0.00029859782,0.054368623],"genre_scores_gemma":[0.9961032,0.00012792545,0.0024887105,0.000111660556,0.00042211928,0.000005696888,3.6959247e-7,0.000016018275,0.0007242972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975339,0.0008866807,0.00047188232,0.00019343145,0.0006019997,0.0003121099],"domain_scores_gemma":[0.9973462,0.0013006963,0.00046392702,0.00040165786,0.00038782883,0.000099658726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002918388,0.00019364532,0.0004028266,0.00019121077,0.00028224653,0.00027226284,0.0013366444,0.00007300122,0.000019447454],"category_scores_gemma":[0.00034495117,0.00011551443,0.00017706628,0.00044980878,0.00088118174,0.0011951203,0.00028062452,0.0005096202,0.0000025265526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013570902,0.000048220638,0.00004298129,0.0000054879383,0.00006835309,0.000063625404,0.0006352195,0.00010037411,0.0002456334,0.99510604,0.0003804934,0.0019465075],"study_design_scores_gemma":[0.0038365053,0.00047579277,0.00010657424,0.000021787064,0.00001638821,0.00033241077,0.00018779977,0.00009938957,0.0035295263,0.9870025,0.0042587956,0.0001325089],"about_ca_topic_score_codex":0.00000858644,"about_ca_topic_score_gemma":0.0000036433473,"teacher_disagreement_score":0.3898755,"about_ca_system_score_codex":0.000037078255,"about_ca_system_score_gemma":0.00010959054,"threshold_uncertainty_score":0.47105417},"labels":[],"label_agreement":null},{"id":"W2102459557","doi":"10.2168/lmcs-8(1:7)2012","title":"Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Fundacja na rzecz Nauki Polskiej; Grantová Agentura České Republiky","keywords":"Unanimity; Mathematics; Conjecture; Constraint satisfaction problem; Variety (cybernetics); Characterization (materials science); Constraint (computer-aided design); Pure mathematics; Universal algebra; Combinatorics; Discrete mathematics; Algebra over a field","score_opus":0.05866841925032519,"score_gpt":0.3937555524694554,"score_spread":0.33508713321913025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102459557","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031442482,0.00024252741,0.96586514,0.00077502336,0.00045911968,0.00037425154,2.6914012e-7,0.00010117999,0.00073999004],"genre_scores_gemma":[0.44802943,0.0000173803,0.5515796,0.00029846004,0.000048175854,0.000021452644,4.0572438e-8,0.0000027989154,0.0000026948533],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963645,0.0012809193,0.00034697462,0.00064539834,0.00052382075,0.000838403],"domain_scores_gemma":[0.99657226,0.0023689282,0.00010670647,0.0006431303,0.000061032715,0.00024794394],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.012218337,0.00017730567,0.00026721798,0.00024004103,0.00041091515,0.0003754753,0.0014967878,0.00006489796,0.000007680923],"category_scores_gemma":[0.0004407375,0.000106917214,0.00005128875,0.0016357749,0.002864116,0.0013969474,0.0014672644,0.0004663989,0.0000087717135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061281094,0.000017484559,0.0060924217,0.00000437159,0.0000015677925,0.0000023396,0.00045304856,0.00007758597,0.0013462495,0.4777658,0.000001549928,0.51423144],"study_design_scores_gemma":[0.0007206462,0.000081002356,0.14196827,0.0000322415,0.0000023863809,0.00019141647,0.000022635937,0.13948996,0.002143741,0.71496,0.00011588426,0.0002718612],"about_ca_topic_score_codex":0.000018691844,"about_ca_topic_score_gemma":0.0000025635866,"teacher_disagreement_score":0.5139596,"about_ca_system_score_codex":0.00007915953,"about_ca_system_score_gemma":0.000048286245,"threshold_uncertainty_score":0.9998495},"labels":[],"label_agreement":null},{"id":"W2102761613","doi":"10.1016/j.disc.2009.04.032","title":"Homomorphisms of triangle-free graphs without a <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-minor","year":2009,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Univerzita Karlova v Praze","keywords":"Mathematics; Homomorphism; Combinatorics; Conjecture; Graph; Minor (academic); Graph homomorphism; Discrete mathematics; Planar graph; Graph minor; Line graph; Graph power","score_opus":0.023136840028414683,"score_gpt":0.26391603190692375,"score_spread":0.24077919187850907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102761613","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5385955,0.00195437,0.018641185,0.001140711,0.002198169,0.00014913395,0.0007643849,0.00039779997,0.43615875],"genre_scores_gemma":[0.9689669,0.0009600992,0.025064271,0.0010141153,0.0010621785,0.0008019998,0.00063175533,0.0007320599,0.00076664385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9873371,0.0006335453,0.0027248396,0.0021837847,0.0039996435,0.00312109],"domain_scores_gemma":[0.9878641,0.0023929735,0.0029328447,0.0050653974,0.00032876543,0.001415953],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033378003,0.0011978562,0.00068489625,0.0009130564,0.001513047,0.0016861232,0.0052377214,0.0019445601,0.14068745],"category_scores_gemma":[0.003133239,0.0020334388,0.0025033723,0.002391465,0.0026263427,0.002043347,0.0032006432,0.002013104,0.0015418758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013346152,0.0006446428,0.000013825397,0.0018375714,0.0012906656,0.001403631,0.0045709107,0.0009436155,0.002737057,0.88764274,0.09482324,0.0027574524],"study_design_scores_gemma":[0.0032009394,0.0028222085,0.00007410195,0.0022225229,0.001245785,0.0014332354,0.0020913372,0.20220245,0.7758349,0.005712881,0.0011838629,0.001975742],"about_ca_topic_score_codex":0.00036993294,"about_ca_topic_score_gemma":0.0005301376,"teacher_disagreement_score":0.8819299,"about_ca_system_score_codex":0.00002379158,"about_ca_system_score_gemma":0.001511722,"threshold_uncertainty_score":0.99978685},"labels":[],"label_agreement":null},{"id":"W2102862468","doi":"10.1016/j.tcs.2005.10.002","title":"Simplifying the weft hierarchy","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Hierarchy; Normalization (sociology); Monotone polygon; Simple (philosophy); Mathematics; Discrete mathematics; Combinatorics; Calculus (dental); Algebra over a field; Pure mathematics; Philosophy; Epistemology; Geometry","score_opus":0.017219545451255067,"score_gpt":0.3028416063272443,"score_spread":0.2856220608759892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102862468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010935218,0.00006530339,0.97057444,0.009986742,0.00029602856,0.00021946664,6.5505554e-7,0.00029532574,0.007626811],"genre_scores_gemma":[0.8039821,0.000005870308,0.19384404,0.0018652988,0.00024966706,0.000011130912,1.513283e-7,0.000008785542,0.00003299599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963658,0.00023614094,0.0002797693,0.0008325318,0.0012299082,0.0010558632],"domain_scores_gemma":[0.9968246,0.0008236925,0.00005590583,0.0017213374,0.00021764162,0.0003568],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003320112,0.00020323598,0.00017353897,0.00023747275,0.0012253403,0.00073829084,0.0071497736,0.00004197984,0.000071269365],"category_scores_gemma":[0.00018938915,0.00012779263,0.000088831795,0.002241954,0.00619835,0.0013546156,0.0027534512,0.0004764982,0.00040699996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043601462,0.000025100844,0.000017900036,0.0000016226544,0.000002170902,0.0000048492534,0.00036726202,0.0005253551,0.0004955854,0.82793665,0.00005927784,0.17055987],"study_design_scores_gemma":[0.00014173245,0.00008829699,0.00030462808,0.000009548163,0.0000014386162,0.000060901315,0.0000064552128,0.47897407,0.004370503,0.5125843,0.0032721793,0.00018593797],"about_ca_topic_score_codex":9.826608e-7,"about_ca_topic_score_gemma":6.7137177e-7,"teacher_disagreement_score":0.79304683,"about_ca_system_score_codex":0.00009216671,"about_ca_system_score_gemma":0.00015335015,"threshold_uncertainty_score":0.998222},"labels":[],"label_agreement":null},{"id":"W2103183688","doi":"10.1002/jgt.21819","title":"A Proof of a Conjecture of Ohba","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics","score_opus":0.010952511875215414,"score_gpt":0.2700981083827483,"score_spread":0.2591455965075329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103183688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14997609,0.00085735833,0.84678495,0.0002449264,0.00021634997,0.000119002274,0.0000023753812,0.000011399528,0.0017875567],"genre_scores_gemma":[0.9841846,0.0000214101,0.015606341,0.00006337136,0.000048571786,0.000001236025,9.5695874e-8,0.0000097224765,0.000064658096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979236,0.00058580376,0.0005796268,0.00013810273,0.00055331714,0.00021954236],"domain_scores_gemma":[0.99736667,0.00074131304,0.00079377886,0.0005115435,0.0004734618,0.00011325669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034685882,0.000117998,0.00041451305,0.00057508796,0.00003957204,0.000015109436,0.0013518607,0.00006570338,0.00002287662],"category_scores_gemma":[0.00049901765,0.00008516224,0.00029169055,0.0007024012,0.00035042255,0.00033847996,0.00014694258,0.00033134135,0.0000010494856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022693697,0.0001338721,0.00042675107,0.000070970564,0.00009175289,0.000011065776,0.0007262278,0.0002692076,0.015211368,0.9459678,0.00011310573,0.03675092],"study_design_scores_gemma":[0.00063627696,0.00088160764,0.0005541168,0.000111882306,0.000013534214,0.00012531543,0.000060964263,0.00023729612,0.07322563,0.9235719,0.000497433,0.00008407213],"about_ca_topic_score_codex":7.367477e-7,"about_ca_topic_score_gemma":6.5890237e-7,"teacher_disagreement_score":0.8342085,"about_ca_system_score_codex":0.0000117564805,"about_ca_system_score_gemma":0.00009754498,"threshold_uncertainty_score":0.34728155},"labels":[],"label_agreement":null},{"id":"W2104070086","doi":"10.1007/s10878-012-9462-2","title":"Finding paths with minimum shared edges","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Disjoint sets; Heuristics; Theory of computation; Combinatorics; Mathematics; Approximation algorithm; Generalization; Graph; Maximum flow problem; Constant (computer programming); Discrete mathematics; Computer science; Algorithm; Mathematical optimization","score_opus":0.021607571279802694,"score_gpt":0.2802607690312165,"score_spread":0.2586531977514138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104070086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008126068,0.00021443814,0.9876491,0.00024076102,0.0029974726,0.00010819532,6.3490353e-7,0.000028250466,0.00063510146],"genre_scores_gemma":[0.75640285,0.000031189993,0.24293028,0.000028120447,0.00054724,0.0000025595298,0.0000012393336,0.000014486504,0.000042018808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985791,0.0001419364,0.00031427748,0.00010322129,0.00056573254,0.00029577038],"domain_scores_gemma":[0.99852395,0.00017757379,0.00039923625,0.00022069526,0.0004917855,0.00018673309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008313355,0.00010990527,0.00019507106,0.00025640478,0.00011584362,0.00013575121,0.00057905965,0.00005994598,0.000023332892],"category_scores_gemma":[0.00022305235,0.000085211366,0.000060435836,0.00058986095,0.00003820795,0.0025246353,0.00009366424,0.00021781979,0.0000048880524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009164387,0.0011672629,0.012201127,0.000059091755,0.00021915104,0.00008312896,0.0045392206,0.31619316,0.0017412791,0.6474009,0.0025366573,0.0129425535],"study_design_scores_gemma":[0.043833088,0.013890547,0.011004148,0.0016136722,0.0003554005,0.0025201822,0.0013749542,0.5204754,0.06979055,0.30748165,0.023460025,0.0042004264],"about_ca_topic_score_codex":3.4522733e-7,"about_ca_topic_score_gemma":2.3187814e-8,"teacher_disagreement_score":0.74827677,"about_ca_system_score_codex":0.00008180528,"about_ca_system_score_gemma":0.000105556624,"threshold_uncertainty_score":0.34748185},"labels":[],"label_agreement":null},{"id":"W2104859703","doi":"10.1016/j.disc.2006.04.031","title":"Construction of trees and graphs with equal domination parameters","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Constructive; Domination analysis; Characterization (materials science); Combinatorics; Simple (philosophy); Discrete mathematics; Constructive proof; Tree (set theory); Graph; Process (computing); Computer science; Vertex (graph theory)","score_opus":0.012808463335140137,"score_gpt":0.2573611950184089,"score_spread":0.24455273168326874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104859703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3701002,0.000023207436,0.6288129,0.000042970078,0.000012948157,0.00010644579,0.0000024952797,0.000028833614,0.0008700044],"genre_scores_gemma":[0.6304126,0.000003643697,0.36954302,0.0000025712866,0.0000025737613,0.0000061643577,0.0000015897699,0.000004660153,0.00002318959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999247,0.000034042372,0.00018515567,0.0001536661,0.0002460623,0.00013407758],"domain_scores_gemma":[0.99933904,0.00017940157,0.00012927392,0.00025966656,0.00006333708,0.00002928602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019973391,0.000086247936,0.00013902968,0.00012936007,0.000051083483,0.00004805741,0.00018888513,0.00002637215,0.0000016200248],"category_scores_gemma":[0.0000285033,0.000063936524,0.000026404809,0.00029195592,0.00028057522,0.00027079208,0.000058227648,0.00005390222,0.0000010849808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008082456,0.000024191757,0.00063236756,0.0000478537,0.000009440161,0.0000017390082,0.00035292437,0.00010193184,0.0011242087,0.9941491,0.0000048609245,0.0035433276],"study_design_scores_gemma":[0.0003671917,0.0001334557,0.0008802904,0.000048183225,0.000009606597,0.0000351816,0.000326555,0.024659006,0.012233632,0.9611829,0.0000079042175,0.00011611441],"about_ca_topic_score_codex":0.0000070170727,"about_ca_topic_score_gemma":0.000012694591,"teacher_disagreement_score":0.26031238,"about_ca_system_score_codex":0.000008299212,"about_ca_system_score_gemma":0.000011535983,"threshold_uncertainty_score":0.26072556},"labels":[],"label_agreement":null},{"id":"W2105667010","doi":"10.1007/s00453-010-9455-4","title":"Dynamic vs. Oblivious Routing in Network Design","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Static routing; Multipath routing; Theory of computation; Routing (electronic design automation); Polytope; Mathematical optimization; Routing protocol; Computer network; Mathematics; Algorithm; Combinatorics","score_opus":0.013234180198838406,"score_gpt":0.27650703787089886,"score_spread":0.26327285767206043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105667010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00995823,0.00004400468,0.98802614,0.000487395,0.0005327811,0.00024856717,6.8902995e-7,0.00019156882,0.0005106222],"genre_scores_gemma":[0.53194463,0.0000060836064,0.46769458,0.0001213159,0.00006233825,0.000022783544,8.854156e-7,0.000014414213,0.00013294611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981309,0.00016629421,0.00022766065,0.00047010972,0.0002832831,0.0007217099],"domain_scores_gemma":[0.9985434,0.00047540205,0.000059827078,0.00073994085,0.00005718705,0.00012424024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011426157,0.00014827352,0.00017572219,0.00016376344,0.00014224752,0.00011570669,0.0013591773,0.00009554131,0.000018711647],"category_scores_gemma":[0.00014941898,0.0001469101,0.000048625938,0.0010553712,0.00009807041,0.00039819357,0.00039884407,0.0006870502,0.00011560601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043260476,0.00016400793,0.0015008621,0.000010060573,0.000026648844,0.00033248728,0.00075798825,0.008983775,0.006116716,0.2872892,0.0005836388,0.69419134],"study_design_scores_gemma":[0.00032302208,0.00007457942,0.0023713831,0.000015865933,0.0000013631263,0.000042999272,0.000008185025,0.8305729,0.0006107992,0.16522872,0.00051795953,0.00023220574],"about_ca_topic_score_codex":0.000020462157,"about_ca_topic_score_gemma":0.00005555945,"teacher_disagreement_score":0.8215891,"about_ca_system_score_codex":0.00004293385,"about_ca_system_score_gemma":0.00008417709,"threshold_uncertainty_score":0.599082},"labels":[],"label_agreement":null},{"id":"W2106280765","doi":"10.1016/j.disc.2005.04.004","title":"Edge-disjoint spanners in Cartesian products of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Cartesian product; Mathematics; Disjoint sets; Hypercube; Discrete mathematics; Graph; Cograph; Chordal graph; 1-planar graph","score_opus":0.021931015845525842,"score_gpt":0.2876060824299282,"score_spread":0.2656750665844023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106280765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39338937,0.00075795397,0.5711974,0.0061433944,0.00026689772,0.0016197129,0.00001727753,0.00034944544,0.026258534],"genre_scores_gemma":[0.7728792,0.000014507432,0.22675288,0.000030143208,0.000022432332,0.000020027153,0.0000016926144,0.000016206624,0.00026291612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984233,0.00006305038,0.00042136482,0.00031717448,0.00039492108,0.00038019085],"domain_scores_gemma":[0.99864036,0.00011167289,0.00013599005,0.0009279786,0.0001000917,0.00008391731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060605526,0.00015378394,0.00027463614,0.0002939492,0.00003925716,0.000039367293,0.00089476065,0.00004440922,0.000011865345],"category_scores_gemma":[0.00022903718,0.00013107932,0.000072399176,0.0009785484,0.00014809621,0.0003876902,0.000238568,0.00016837152,0.000036212252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005723022,0.00018450826,0.00031580275,0.00022603394,0.000015366451,0.000010689952,0.005932923,0.00051215116,0.0039055098,0.9807625,0.00016650042,0.0079623],"study_design_scores_gemma":[0.0009371275,0.00020368664,0.0011630193,0.00032891645,0.000012706832,0.000038373382,0.00131736,0.09778701,0.0855746,0.81063503,0.0013388741,0.0006633205],"about_ca_topic_score_codex":0.0000045196584,"about_ca_topic_score_gemma":0.00001857128,"teacher_disagreement_score":0.3794898,"about_ca_system_score_codex":0.000038234557,"about_ca_system_score_gemma":0.000056184574,"threshold_uncertainty_score":0.53452593},"labels":[],"label_agreement":null},{"id":"W2107127602","doi":"10.1016/j.disc.2014.12.014","title":"Vertex elimination orderings for hereditary graph classes","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Université de Lyon; EGIDE; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; Providence Health Care; Agence Nationale de la Recherche; Ministère de l'Europe et des Affaires Étrangères","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Property (philosophy); Graph","score_opus":0.049916631788807925,"score_gpt":0.3235960227806383,"score_spread":0.27367939099183036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107127602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069947094,0.000099400386,0.9884893,0.0007681399,0.00023690204,0.00038619284,0.000008256618,0.00018722551,0.0028299075],"genre_scores_gemma":[0.31918234,0.000013221901,0.6797257,0.00012857706,0.0000733345,0.00015706877,0.000018774563,0.000039742466,0.0006612564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987345,0.000032967815,0.00023707381,0.00026368207,0.00041183585,0.00031999208],"domain_scores_gemma":[0.9986139,0.00032469915,0.000091587564,0.0005566752,0.00026220112,0.00015092129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005816374,0.00014268873,0.000176656,0.00013891453,0.00009491878,0.0001205368,0.00079228356,0.000054006177,0.0000042087995],"category_scores_gemma":[0.00054657564,0.00012284084,0.00008116212,0.00039194588,0.00007587208,0.0005850917,0.00021373706,0.000094197225,0.00003659614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012201671,0.000072827475,0.000017712233,0.0001364894,0.000022276836,0.0000071627983,0.0021726857,0.00012870417,0.00024410801,0.98835397,0.003103354,0.00572849],"study_design_scores_gemma":[0.00041802457,0.0001685634,0.00003107,0.000036011323,0.000007510169,0.000017412254,0.0006726367,0.108022034,0.0015033277,0.8869281,0.002006983,0.00018832534],"about_ca_topic_score_codex":0.000001797652,"about_ca_topic_score_gemma":0.0000030665765,"teacher_disagreement_score":0.3121876,"about_ca_system_score_codex":0.000039840143,"about_ca_system_score_gemma":0.00006187649,"threshold_uncertainty_score":0.50093037},"labels":[],"label_agreement":null},{"id":"W2108904442","doi":"10.1007/3-540-47867-1_7","title":"Finding the Exact Integrality Gap for Small Traveling Salesman Problems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Conjecture; Hamiltonian path; Hamiltonian (control theory); Combinatorics; Graph; Relaxation (psychology); Computer science; Exponential function; Combinatorial optimization; Metric (unit); Exact solutions in general relativity; Upper and lower bounds; Mathematics; Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.08844292964791423,"score_gpt":0.30615174587006055,"score_spread":0.21770881622214633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108904442","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009851739,0.00044762116,0.99301165,0.0012728145,0.0010323714,0.001363624,0.00000971124,0.00018053842,0.0025831615],"genre_scores_gemma":[0.2054453,0.00014848486,0.78937477,0.0016235816,0.00092399714,0.0001522268,0.0000109080365,0.0001261978,0.0021945448],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950543,0.00010329543,0.00065993966,0.0019320583,0.00102087,0.0012295198],"domain_scores_gemma":[0.99473214,0.0022786492,0.00034943843,0.002076795,0.00035914363,0.0002038454],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0031595957,0.000646467,0.0005850794,0.00064571435,0.00078683085,0.0008492443,0.0070516476,0.00032266488,0.00001931454],"category_scores_gemma":[0.00033154956,0.00046424582,0.00028943658,0.0008988336,0.0013200045,0.0005389837,0.0014839303,0.0015597605,0.000027426995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112886155,0.00003596188,0.000049191276,0.00011643247,0.000023346978,0.000028944767,0.0019839953,0.035225615,0.00020000254,0.22215748,0.000019759978,0.740148],"study_design_scores_gemma":[0.0002289066,0.0001617755,0.000035261906,0.00037093653,0.0000062071763,0.000047555834,3.8809623e-7,0.39609373,0.00065601943,0.6000949,0.0017908844,0.00051343633],"about_ca_topic_score_codex":0.000014253227,"about_ca_topic_score_gemma":0.000103175465,"teacher_disagreement_score":0.7396346,"about_ca_system_score_codex":0.00036973823,"about_ca_system_score_gemma":0.00030263522,"threshold_uncertainty_score":0.99978095},"labels":[],"label_agreement":null},{"id":"W2109176424","doi":"10.1002/9780470400531.eorms0364","title":"Graph Search Techniques","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Computer science; Combinatorics; Theoretical computer science; Mixed graph; Mathematics; Line graph; Voltage graph","score_opus":0.03820311529316924,"score_gpt":0.3466017202286572,"score_spread":0.308398604935488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109176424","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030992487,0.0010019881,0.08539342,0.00015643027,0.00013029418,0.001567804,0.000015647123,0.00023596532,0.91146743],"genre_scores_gemma":[0.00073187,0.079100534,0.26592264,0.00003619548,0.00009718313,0.00048019827,0.000008728857,0.00013470913,0.6534879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951736,0.0002087602,0.00032117387,0.001180246,0.0021142233,0.0010020398],"domain_scores_gemma":[0.99734515,0.00007532643,0.00004502185,0.0017165014,0.0004556167,0.0003624063],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034223073,0.00025959505,0.00028926387,0.00467272,0.00062049663,0.0003211533,0.0040323553,0.00011712123,0.00032064423],"category_scores_gemma":[0.0001191646,0.00022998119,0.000048895843,0.0044988,0.0036798615,0.00088655617,0.0031815192,0.00051568664,0.000106642736],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007163666,0.00019255278,0.00006159401,0.00022955569,0.000033919983,0.00003431755,0.00030764946,0.0000051027428,0.00021938309,0.8411308,0.07576531,0.08201263],"study_design_scores_gemma":[0.00049896335,0.0010480632,0.00039400166,0.0011201022,0.000014831193,0.00001836837,0.00037112605,0.0014708609,0.0033498306,0.046958473,0.94373554,0.0010198277],"about_ca_topic_score_codex":0.00043809455,"about_ca_topic_score_gemma":0.00018523709,"teacher_disagreement_score":0.8679702,"about_ca_system_score_codex":0.00005840804,"about_ca_system_score_gemma":0.00029687554,"threshold_uncertainty_score":0.99903154},"labels":[],"label_agreement":null},{"id":"W2109693504","doi":"10.1145/1667053.1667060","title":"A constructive proof of the general lovász local lemma","year":2010,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":468,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Stavros Niarchos Foundation; Hungarian Scientific Research Fund","keywords":"Lemma (botany); Constructive; Constructive proof; Computer science; Mathematics; Discrete mathematics; Calculus (dental); Programming language; Process (computing)","score_opus":0.016981778734048606,"score_gpt":0.29607084622685104,"score_spread":0.27908906749280243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109693504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.914277,0.00006850725,0.07502752,0.007964049,0.001921086,0.00016973246,0.0000022810377,0.0000055714436,0.00056421285],"genre_scores_gemma":[0.96753436,0.0000015880106,0.031942632,0.00013323741,0.00016812205,8.784744e-7,9.789734e-9,0.000005308511,0.00021387232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987387,0.00017933095,0.00026806927,0.00009749457,0.0005348636,0.00018154134],"domain_scores_gemma":[0.99751115,0.00017747315,0.00039822623,0.0015256981,0.0003240962,0.00006334382],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00073796965,0.0000756113,0.00014966547,0.00006312849,0.000106429135,0.000033061195,0.0063847313,0.000043086737,0.000014360495],"category_scores_gemma":[0.0010245044,0.000035425794,0.00019679639,0.0003771666,0.0005789885,0.0002847195,0.0017961172,0.0007293674,0.0000019286442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000293342,0.0003192146,0.020634407,0.00004137553,0.000298094,0.00005324373,0.002593189,0.003528089,0.29918495,0.5160586,0.0070691593,0.14992629],"study_design_scores_gemma":[0.00058590976,0.00013887485,0.010404656,0.000044293152,0.000012312882,0.0010295977,0.00007138727,0.0025626998,0.2600961,0.7228092,0.0021528255,0.000092162874],"about_ca_topic_score_codex":0.0000032506002,"about_ca_topic_score_gemma":0.00000944618,"teacher_disagreement_score":0.20675054,"about_ca_system_score_codex":0.000025760899,"about_ca_system_score_gemma":0.00022483541,"threshold_uncertainty_score":0.9989912},"labels":[],"label_agreement":null},{"id":"W2109716789","doi":"10.1016/s0166-218x(00)00221-3","title":"On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":208,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Treewidth; Combinatorics; Monadic predicate calculus; Enumeration; Discrete mathematics; Clique-width; Time complexity; Graph; Second-order logic; Computational complexity theory; Upper and lower bounds; Clique; Pathwidth; Algorithm; Line graph; Computer science; Theoretical computer science","score_opus":0.061928593949755986,"score_gpt":0.28571349968552445,"score_spread":0.22378490573576848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109716789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2155292,0.000042012744,0.7654068,0.0004729044,0.000029764544,0.0011128013,0.0000063982498,0.00006936217,0.017330771],"genre_scores_gemma":[0.8919675,0.00001620413,0.10743138,0.00021513087,0.000006177801,0.00021149682,0.000006975518,0.000017603503,0.00012753304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983678,0.00007167897,0.00042953904,0.00032751617,0.0004080559,0.00039541876],"domain_scores_gemma":[0.9980745,0.00072605355,0.0001920722,0.00088123104,0.00007068807,0.000055478522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536593,0.00019185312,0.00028555375,0.00017941478,0.00013328192,0.00007517198,0.0008642633,0.00006897307,0.00010923515],"category_scores_gemma":[0.00012354799,0.00013066358,0.000066018874,0.0010152613,0.0002791944,0.00016104201,0.0001903571,0.00027243796,0.00004573382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012807617,0.00013054506,0.000035141416,0.00007365401,0.000011821004,0.0000027000888,0.00101263,0.0011375541,0.0022279273,0.9948533,0.00005413908,0.0004477336],"study_design_scores_gemma":[0.00028899114,0.000064994114,0.00017417556,0.000033843746,0.000003225878,0.000005019549,0.00016147042,0.033493735,0.0026285173,0.9629403,0.000057510653,0.00014823524],"about_ca_topic_score_codex":0.000008848126,"about_ca_topic_score_gemma":0.00005254976,"teacher_disagreement_score":0.6764383,"about_ca_system_score_codex":0.000036548812,"about_ca_system_score_gemma":0.000032020984,"threshold_uncertainty_score":0.5328306},"labels":[],"label_agreement":null},{"id":"W2109981504","doi":"10.1007/s11083-010-9167-z","title":"A Note on Schnyder’s Theorem","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partially ordered set; Graph; Dimension (graph theory); Ordered set; Antichain; Algebra over a field; Graph theory","score_opus":0.014968786426241274,"score_gpt":0.3140181872646999,"score_spread":0.2990494008384586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109981504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067983836,0.000020425612,0.82142514,0.004907071,0.0009066602,0.0002444103,0.0000017253338,0.00041737282,0.10409334],"genre_scores_gemma":[0.91685903,0.0000028876284,0.0798895,0.00083123567,0.00008561561,0.00001614509,5.482576e-7,0.000014068499,0.0023009977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907124,0.000039576662,0.000072650364,0.00028191908,0.00025482234,0.0002797977],"domain_scores_gemma":[0.99885,0.00014631903,0.000021453856,0.0008107238,0.0000863773,0.00008515208],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029938068,0.000085502346,0.00007055947,0.000098384626,0.000110963505,0.00008027704,0.00088431744,0.00005361749,0.000201761],"category_scores_gemma":[0.00019467439,0.00006807367,0.00003136151,0.00045828812,0.00009951592,0.00022736726,0.00019493864,0.00040451097,0.0011804557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071499385,0.000032581316,0.000062634266,0.0000013610386,0.0000023172104,0.000008829541,0.000107638836,0.000016633718,0.008236223,0.9264245,0.00032924872,0.0647709],"study_design_scores_gemma":[0.0005471607,0.00015490246,0.0011227615,0.000010744561,0.0000014910131,0.000024729487,0.000010540552,0.012027964,0.022973256,0.83314055,0.12966697,0.00031894314],"about_ca_topic_score_codex":0.0000021260273,"about_ca_topic_score_gemma":0.000011304964,"teacher_disagreement_score":0.84887516,"about_ca_system_score_codex":0.000007274733,"about_ca_system_score_gemma":0.000046731988,"threshold_uncertainty_score":0.99959725},"labels":[],"label_agreement":null},{"id":"W2110393165","doi":"10.37236/3153","title":"Nonrepetitive Colourings of Planar Graphs with $O(\\log n)$ Colours","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Australian Research Council; Australian Government","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Chromatic scale; Graph; Bounded function; Outerplanar graph; Upper and lower bounds; Path (computing); Discrete mathematics; Pathwidth; Line graph; Computer science","score_opus":0.006035786116298683,"score_gpt":0.22902869584575372,"score_spread":0.22299290972945504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110393165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76693,0.0015839611,0.22703795,0.0024148545,0.00022259519,0.00044115647,8.6778215e-7,0.00003165739,0.0013369869],"genre_scores_gemma":[0.99880767,0.00031108342,0.00056374155,0.00006900048,0.000016059797,0.000008782958,1.6500947e-7,0.0000147211695,0.00020878887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775803,0.00025778764,0.0003888784,0.00015804888,0.00075191236,0.0006853459],"domain_scores_gemma":[0.99733996,0.0005884452,0.00059922226,0.00046873876,0.0008819348,0.00012172032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013862426,0.00016186445,0.00033121824,0.0002407427,0.00014080566,0.00005657435,0.0019655437,0.000054168802,0.000012359171],"category_scores_gemma":[0.000102284175,0.000098875906,0.000118080905,0.0010523344,0.00027536624,0.00054544694,0.00011302298,0.0008643873,0.000009076234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008345984,0.00012019766,0.0007602755,0.000007962475,0.000117200725,0.000015008281,0.00036194926,0.000057856465,0.0006486512,0.9972009,0.00022192845,0.0004046079],"study_design_scores_gemma":[0.00091329525,0.0027691566,0.001787916,0.000037910388,0.000020189838,0.00032336643,0.00020137434,0.00015100221,0.0059784628,0.9873274,0.00036433514,0.00012559337],"about_ca_topic_score_codex":0.000014904246,"about_ca_topic_score_gemma":0.000005051697,"teacher_disagreement_score":0.23187768,"about_ca_system_score_codex":0.00018518032,"about_ca_system_score_gemma":0.0005832276,"threshold_uncertainty_score":0.40320423},"labels":[],"label_agreement":null},{"id":"W2111678564","doi":"10.1002/jgt.20613","title":"Kempe Equivalence of Edge‐Colorings in Subcubic and Subquartic Graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Equivalence (formal languages); Edge coloring; Graph; Enhanced Data Rates for GSM Evolution; Cubic graph; Discrete mathematics; Line graph; Voltage graph; Graph power; Computer science","score_opus":0.03657459361179385,"score_gpt":0.2746048405043239,"score_spread":0.23803024689253002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111678564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9683851,0.002007007,0.027970122,0.000059182617,0.0002056966,0.00011544497,7.922949e-7,0.000015903235,0.0012407446],"genre_scores_gemma":[0.9922523,0.00042080483,0.007223186,0.000041180563,0.000012854751,0.000003331362,4.0312543e-8,0.000011261769,0.000035039215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978802,0.00043076684,0.0006403564,0.00023060116,0.00043186714,0.00038616415],"domain_scores_gemma":[0.99818486,0.0005236182,0.0004423574,0.00042921148,0.00023992993,0.00018003478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034405557,0.00015613582,0.00036934428,0.0011654086,0.00005856767,0.000026107733,0.0012065781,0.000067112946,0.000027807766],"category_scores_gemma":[0.0002544832,0.0001294434,0.00016546043,0.0012160161,0.0005306245,0.0009397883,0.00022332095,0.00042403056,0.0000028936033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040320563,0.00017271824,0.027120912,0.00005193075,0.000042780583,0.00013346615,0.0029080093,0.000007733747,0.009477856,0.95042616,0.000010691813,0.009244537],"study_design_scores_gemma":[0.00061389455,0.0007233779,0.05100743,0.00012347045,0.000010977343,0.00014510886,0.0002835866,0.000041506286,0.013613228,0.93328995,0.000015717136,0.00013177514],"about_ca_topic_score_codex":0.0000063394978,"about_ca_topic_score_gemma":0.000004186994,"teacher_disagreement_score":0.023886519,"about_ca_system_score_codex":0.00002228095,"about_ca_system_score_gemma":0.00007912252,"threshold_uncertainty_score":0.52785486},"labels":[],"label_agreement":null},{"id":"W2112167630","doi":"10.1016/j.tcs.2009.06.003","title":"The complexity of weighted Boolean #CSP with mixed signs","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Parameterized complexity; Discrete mathematics; Sign (mathematics); Partition (number theory); Weight function; Combinatorics; Function (biology); Boolean function; Polynomial; Affine transformation; Pure mathematics","score_opus":0.025818018430684833,"score_gpt":0.28477121299437513,"score_spread":0.2589531945636903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112167630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026179047,0.00003833257,0.96590805,0.0035874215,0.00015577149,0.0002579794,0.0000014348316,0.00016025636,0.003711712],"genre_scores_gemma":[0.8346222,0.000004576826,0.1650705,0.00024444616,0.00003718129,0.0000032760554,3.2144644e-7,0.000005608037,0.000011896417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646324,0.00027789277,0.00033594138,0.0007069194,0.0013398438,0.0008761726],"domain_scores_gemma":[0.9968957,0.0006130867,0.00011980789,0.0015986614,0.0004495853,0.00032317135],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023431026,0.0002160815,0.00026374147,0.00017964863,0.0009332238,0.00035237393,0.005304048,0.00003887524,0.000012386609],"category_scores_gemma":[0.00008948912,0.00012349455,0.00007367387,0.0023612229,0.017645964,0.00062397594,0.0007893346,0.00032081618,0.000023130331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050445306,0.00006787699,0.000018470324,0.0000023247571,0.0000043948476,0.000009024992,0.00016858322,0.00005751847,0.0018715314,0.9493023,0.00002241961,0.048425093],"study_design_scores_gemma":[0.0002617815,0.0010704731,0.0016223273,0.000022873974,0.0000025608529,0.000031147963,0.0000101722835,0.1623802,0.020121312,0.8142076,0.00008618397,0.00018337034],"about_ca_topic_score_codex":0.0000015112686,"about_ca_topic_score_gemma":0.0000017168506,"teacher_disagreement_score":0.8084431,"about_ca_system_score_codex":0.00004768133,"about_ca_system_score_gemma":0.0001791481,"threshold_uncertainty_score":0.98563284},"labels":[],"label_agreement":null},{"id":"W2113016580","doi":"10.1112/s1461157014000400","title":"Computing symmetry groups of polyhedra","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Ministry of Education, India; Hausdorff Research Institute for Mathematics; Mathematisches Forschungsinstitut Oberwolfach; University of Cambridge; Alexander von Humboldt-Stiftung","keywords":"Polyhedron; Mathematics; Integer points in convex polyhedra; Symmetry group; Computation; Symmetry (geometry); Automorphism group; Homogeneous space; Linear programming; Polyhedral combinatorics; Group (periodic table); Integer programming; Combinatorics; Tetrahedral symmetry; Discrete mathematics; Automorphism; Algorithm; Regular polygon; Rotational symmetry; Geometry; Branch and price; Convex set","score_opus":0.018218650123161532,"score_gpt":0.30468759706289866,"score_spread":0.2864689469397371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113016580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15266912,0.00009412313,0.8464343,0.00012925494,0.00010353401,0.000040579587,1.9126756e-7,0.000012652612,0.00051623647],"genre_scores_gemma":[0.62715554,0.000008669594,0.37276015,0.000036586298,0.000027089405,7.7183316e-8,1.0658129e-7,0.000004158466,0.000007638826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988499,0.0000918517,0.00050565414,0.000080666454,0.00034790763,0.00012399351],"domain_scores_gemma":[0.99828196,0.00065895705,0.00056388194,0.00012940196,0.00027841298,0.00008738412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010592127,0.00007952036,0.00025296473,0.00022990379,0.00005667187,0.00005610191,0.00033239002,0.000029632065,0.000001910806],"category_scores_gemma":[0.00019606871,0.00006469521,0.0000610869,0.00027156423,0.000069777416,0.00026517172,0.000112361544,0.0001395228,0.0000018011317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007604665,0.00011850162,0.00018915124,0.00019150638,0.000033881952,0.000004611278,0.0022936077,0.0027775704,0.0014231909,0.9002895,0.00006518604,0.092605695],"study_design_scores_gemma":[0.0004996715,0.00023574327,0.00047378734,0.00013826787,0.000008579921,0.00025435138,0.00018684956,0.43195316,0.0013307498,0.5647659,0.00006884064,0.00008412177],"about_ca_topic_score_codex":3.0750584e-7,"about_ca_topic_score_gemma":1.0514973e-7,"teacher_disagreement_score":0.4744864,"about_ca_system_score_codex":0.000009028795,"about_ca_system_score_gemma":0.000023458899,"threshold_uncertainty_score":0.2638194},"labels":[],"label_agreement":null},{"id":"W2113147502","doi":"10.37236/874","title":"A Traceability Conjecture for Oriented Graphs","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Conjecture; Mathematics; Graph; Discrete mathematics","score_opus":0.014957630602982191,"score_gpt":0.27097078705346084,"score_spread":0.2560131564504786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113147502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27076235,0.0028460564,0.72386533,0.0016381743,0.0004215946,0.00031781287,9.552388e-7,0.000048961352,0.000098759985],"genre_scores_gemma":[0.9987768,0.00035106376,0.0005925617,0.00006994351,0.000040041235,0.000008867562,2.661861e-7,0.000012312373,0.00014815868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979716,0.00023956582,0.0003795736,0.00017417285,0.0005447109,0.00069040497],"domain_scores_gemma":[0.9977444,0.0007256037,0.00031051063,0.000547691,0.0005645938,0.00010720107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020290234,0.00014447507,0.0002696776,0.00015112718,0.00036579257,0.000026559183,0.0016478143,0.000060541206,0.0000029372973],"category_scores_gemma":[0.0003474764,0.00009295737,0.0002445032,0.0009990346,0.00019156082,0.00035391457,0.00009023773,0.0008296053,0.0000018368636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009537568,0.00013081727,0.0002270691,0.00000615865,0.00005277101,0.000009678177,0.00042935295,0.00006608302,0.0001481859,0.99788195,0.00030783346,0.00064474705],"study_design_scores_gemma":[0.0011929795,0.0012261976,0.00028020702,0.0000058563223,0.000011711575,0.0006953352,0.000032706877,0.0007682278,0.0017536102,0.9885284,0.0054011513,0.00010363149],"about_ca_topic_score_codex":0.0000010228057,"about_ca_topic_score_gemma":0.0000013166566,"teacher_disagreement_score":0.7280144,"about_ca_system_score_codex":0.00022903699,"about_ca_system_score_gemma":0.0007132834,"threshold_uncertainty_score":0.37906915},"labels":[],"label_agreement":null},{"id":"W2113930605","doi":"10.1002/jgt.20568","title":"Domination number of cubic graphs with large girth","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Univerza v Ljubljani","keywords":"Combinatorics; Mathematics; Cubic graph; Girth (graph theory); Domination analysis; Vertex (graph theory); Graph; Upper and lower bounds; Discrete mathematics; Line graph; Voltage graph","score_opus":0.017572267326257954,"score_gpt":0.2775833201858796,"score_spread":0.26001105285962167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113930605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41181058,0.00029515277,0.5800746,0.000042593445,0.00020876141,0.00011893677,0.0000030732574,0.000024956922,0.0074213734],"genre_scores_gemma":[0.9616948,0.00007804147,0.038014412,0.0000516332,0.000022151964,0.0000026224104,2.4426694e-7,0.000015004964,0.000121125384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800175,0.0004206612,0.00046462993,0.00017899921,0.0006138389,0.00032014085],"domain_scores_gemma":[0.99788225,0.00026469032,0.0006306301,0.00047749688,0.0005996089,0.00014532088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027850477,0.00014902255,0.00030642105,0.0006039058,0.00009232646,0.000024125937,0.0011579407,0.000059693306,0.00013819616],"category_scores_gemma":[0.000097365,0.000104048755,0.00021728479,0.0010703311,0.0002730481,0.000997764,0.000116038056,0.0003437822,0.000010759259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049433607,0.00024416292,0.007866494,0.00001926887,0.000106043306,0.00006518286,0.0015792344,0.0000047926633,0.0009229919,0.98288333,0.000051833,0.0057623],"study_design_scores_gemma":[0.0011333058,0.00048314178,0.008693331,0.00007842305,0.000022402197,0.00034707744,0.0002721996,0.000036940568,0.011502657,0.9771549,0.00013599097,0.00013962299],"about_ca_topic_score_codex":0.0000017152777,"about_ca_topic_score_gemma":0.0000025538707,"teacher_disagreement_score":0.5498842,"about_ca_system_score_codex":0.000018354283,"about_ca_system_score_gemma":0.000085103005,"threshold_uncertainty_score":0.42429852},"labels":[],"label_agreement":null},{"id":"W2114421280","doi":"10.46298/dmtcs.3513","title":"The Diameter of the Minimum Spanning Tree of a Complete Graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Graph; Independent and identically distributed random variables; Minimum degree spanning tree; Tree (set theory); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Statistics; Random variable","score_opus":0.018335196805992635,"score_gpt":0.27569590814268524,"score_spread":0.2573607113366926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114421280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024670076,0.000072951516,0.96939397,0.0007691047,0.00025892546,0.00038675524,0.000007121547,0.000050132883,0.0043909396],"genre_scores_gemma":[0.75640947,0.000002956594,0.2434654,0.0000449456,0.000031580334,0.000011392177,3.062776e-7,0.000012385335,0.000021561616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960195,0.00025976013,0.00078083755,0.0005563636,0.0016230561,0.0007604894],"domain_scores_gemma":[0.9948206,0.0020573584,0.0003996604,0.0022075283,0.00038914534,0.00012573364],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0028843868,0.00025755074,0.00039414637,0.00019567618,0.0007123595,0.00028112053,0.0066290777,0.00005049714,0.0000075670355],"category_scores_gemma":[0.0003187997,0.00013499134,0.00029311253,0.002339467,0.010863554,0.0003637483,0.0019097555,0.00028363577,0.0000066707034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067113892,0.00006566161,0.00009584251,0.000032944023,0.000009600111,0.0000015040249,0.00055252167,0.00016407864,0.008682807,0.9882458,0.00002784109,0.0021147288],"study_design_scores_gemma":[0.0001590881,0.000097114214,0.00070312823,0.00008814477,0.000008313948,0.000013355509,0.000045015873,0.25072956,0.014472507,0.7335119,0.00002908925,0.00014277663],"about_ca_topic_score_codex":0.0000049430205,"about_ca_topic_score_gemma":0.0000033678139,"teacher_disagreement_score":0.7317394,"about_ca_system_score_codex":0.00002611521,"about_ca_system_score_gemma":0.00010910014,"threshold_uncertainty_score":0.99874556},"labels":[],"label_agreement":null},{"id":"W2114909581","doi":"10.7155/jgaa.00256","title":"Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar straight-line graph; Planar graph; Combinatorics; Vertex (graph theory); Planar; Graph; Outerplanar graph; Computer science; Mathematics; 1-planar graph; Pathwidth; Line graph; Computer graphics (images)","score_opus":0.028244954182113268,"score_gpt":0.3234862292229718,"score_spread":0.29524127504085856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114909581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05727512,0.0012740846,0.9400798,0.00071191345,0.000054471344,0.00021653862,0.000024564995,0.0000090921985,0.00035443],"genre_scores_gemma":[0.77172565,0.00030675164,0.22775422,0.000058234127,0.000088177556,0.00004035694,0.0000012425805,0.0000094591705,0.000015882117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988262,0.0000705243,0.00046875264,0.00010819609,0.00030725176,0.00021905838],"domain_scores_gemma":[0.9985543,0.00037796504,0.00039022358,0.00029524538,0.0002542479,0.00012800348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071826455,0.000097722164,0.00022260555,0.00018990623,0.00023737064,0.000030012083,0.0004887167,0.000039830506,0.00000385806],"category_scores_gemma":[0.000019547537,0.00006924185,0.00013109225,0.00093115226,0.00026671108,0.00044805882,0.000039275295,0.00022283901,0.0000011544074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039758233,0.00082198635,0.004757102,0.00007194843,0.00027666552,0.0000028924826,0.0039714016,0.00008629855,0.015256482,0.90897465,0.00028046637,0.06546035],"study_design_scores_gemma":[0.0036267147,0.0005875665,0.022123497,0.00037997073,0.00032800698,0.00208389,0.0070523475,0.012458407,0.008656466,0.93498474,0.006966367,0.0007520357],"about_ca_topic_score_codex":0.0000074806085,"about_ca_topic_score_gemma":0.0000016138663,"teacher_disagreement_score":0.71445054,"about_ca_system_score_codex":0.0000078234725,"about_ca_system_score_gemma":0.000047981233,"threshold_uncertainty_score":0.28236005},"labels":[],"label_agreement":null},{"id":"W2114935764","doi":"10.1002/jgt.10126","title":"Packing paths in digraphs","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Bishop's University","funders":"","keywords":"Combinatorics; Digraph; Bipartite graph; Mathematics; Packing problems; Disjoint sets; Vertex (graph theory); Matching (statistics); Undirected graph; Graph","score_opus":0.01678610636798969,"score_gpt":0.2814075109099237,"score_spread":0.26462140454193406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114935764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31352666,0.003904283,0.6703027,0.00022713532,0.0008413129,0.00017268398,9.940792e-7,0.00004586773,0.010978381],"genre_scores_gemma":[0.98555404,0.00020374631,0.013977014,0.00015125997,0.0000276437,0.0000023499513,6.190448e-8,0.000013108426,0.00007078002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997462,0.0009085628,0.0005135834,0.00019987299,0.0004990622,0.0004169422],"domain_scores_gemma":[0.9982604,0.0006415282,0.0003020615,0.00045198275,0.00018243743,0.00016163883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004835769,0.00014572885,0.00027954765,0.0011160388,0.000086924716,0.00008285233,0.0010848163,0.00006344289,0.000030029589],"category_scores_gemma":[0.00060363853,0.000117766045,0.00023910259,0.0015204892,0.00015028259,0.00087503495,0.00007741189,0.000562487,0.000008246852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044683744,0.00009318255,0.005846027,0.000006930796,0.000024403804,0.00023639252,0.00059660495,0.00010136319,0.0014874113,0.9765272,0.000048321315,0.014987439],"study_design_scores_gemma":[0.0005997939,0.0001597982,0.002726099,0.000065314816,0.0000036302824,0.0002541435,0.00024326409,0.0000315813,0.0029119793,0.9916563,0.0012101141,0.00013795408],"about_ca_topic_score_codex":6.596813e-7,"about_ca_topic_score_gemma":0.0000024497192,"teacher_disagreement_score":0.67202735,"about_ca_system_score_codex":0.00004048011,"about_ca_system_score_gemma":0.00010420319,"threshold_uncertainty_score":0.480236},"labels":[],"label_agreement":null},{"id":"W2114968511","doi":"10.1016/j.tcs.2005.09.030","title":"List matrix partitions of chordal graphs","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Split graph; Indifference graph; Interval graph; Discrete mathematics; Clique-sum; Pathwidth; Partition (number theory); Cograph; Graph; Line graph; 1-planar graph","score_opus":0.013647279260516391,"score_gpt":0.3137581876164931,"score_spread":0.3001109083559767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114968511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05674997,0.000054526852,0.93665606,0.0015887462,0.00020953313,0.00016049016,0.000003695859,0.00017880324,0.004398189],"genre_scores_gemma":[0.7254463,0.000006369729,0.27429697,0.00015453555,0.00006514755,0.000007212111,3.9122062e-7,0.0000057907682,0.000017276994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971622,0.00014132138,0.00035745863,0.0006562141,0.0009702038,0.00071257463],"domain_scores_gemma":[0.9977375,0.00034130987,0.00008064586,0.0011749972,0.00031436712,0.00035113227],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017169063,0.00016640243,0.0002223842,0.00039902402,0.00038538317,0.00020589921,0.0035001673,0.000044145552,0.0001202133],"category_scores_gemma":[0.0001248284,0.00014144441,0.00010922334,0.00251455,0.0056736683,0.0011193919,0.0012271518,0.00024586116,0.0001105445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000739753,0.00009195396,0.00007409442,0.000005009796,0.0000031021925,0.0000038184426,0.00019854578,0.00044197522,0.002824906,0.97299093,0.00005250191,0.023305753],"study_design_scores_gemma":[0.00021684702,0.00019587952,0.00054398226,0.000019707899,0.0000027352798,0.000033291923,0.000004506053,0.1983499,0.02121983,0.7787565,0.0004610544,0.00019579697],"about_ca_topic_score_codex":0.0000019637084,"about_ca_topic_score_gemma":0.000001267963,"teacher_disagreement_score":0.66869634,"about_ca_system_score_codex":0.000047991834,"about_ca_system_score_gemma":0.0001314683,"threshold_uncertainty_score":0.99703234},"labels":[],"label_agreement":null},{"id":"W2115589427","doi":"10.1016/j.jctb.2011.07.004","title":"The disjoint paths problem in quadratic time","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Minor (academic); Combinatorics; Time complexity; Mathematics; Mathematical proof; Discrete mathematics; Computer science; Algorithm","score_opus":0.014700443154393136,"score_gpt":0.24615038814903964,"score_spread":0.2314499449946465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115589427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.506521,0.0067302315,0.3023675,0.006385008,0.04040901,0.0039208205,0.000009920644,0.0005407917,0.13311574],"genre_scores_gemma":[0.98523915,0.00014154462,0.0132495565,0.00005524397,0.00027126746,0.000016331707,1.8414572e-7,0.000027250313,0.0009994494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997382,0.0009029455,0.0006502079,0.0001602164,0.00051520497,0.0003894156],"domain_scores_gemma":[0.9979442,0.000704257,0.00040889592,0.00052180764,0.00028724055,0.00013361401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004588527,0.00015656404,0.00029576567,0.00017123841,0.00021294624,0.00014300225,0.0018438146,0.00006248014,0.000046898764],"category_scores_gemma":[0.00050651137,0.000098406636,0.0001345395,0.00053905096,0.0003014266,0.001350912,0.00030356608,0.00049946556,0.000030439325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062460016,0.00011879528,0.000085690415,0.0000060171305,0.000025785674,0.00008620477,0.0020067433,0.0000062647973,0.0004680037,0.99011064,0.00010076415,0.0063605146],"study_design_scores_gemma":[0.00067631877,0.00080733135,0.0002641143,0.000044557783,0.00000420122,0.00010191728,0.00023970589,0.00006841685,0.0023751112,0.9928981,0.0023995566,0.000120679244],"about_ca_topic_score_codex":0.0000018396008,"about_ca_topic_score_gemma":0.0000015057758,"teacher_disagreement_score":0.4787182,"about_ca_system_score_codex":0.000078678706,"about_ca_system_score_gemma":0.000192281,"threshold_uncertainty_score":0.40129063},"labels":[],"label_agreement":null},{"id":"W2115695686","doi":"10.1007/s00373-010-0917-x","title":"Star-Uniform Graphs","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Star (game theory); Chordal graph; Discrete mathematics; Graph","score_opus":0.011841989009128423,"score_gpt":0.25266698218514294,"score_spread":0.24082499317601452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115695686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97273135,0.0003981877,0.016216956,0.00052274123,0.0015675792,0.0002771854,0.0000051649554,0.00042944012,0.007851409],"genre_scores_gemma":[0.9936216,0.00017872664,0.005767607,0.00012305092,0.000008297074,0.000019370958,0.000001692897,0.000013610411,0.00026608483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985604,0.00003521018,0.0001725447,0.00040737138,0.0003730918,0.0004513499],"domain_scores_gemma":[0.9986559,0.0001157782,0.000057208304,0.0007676575,0.00014299556,0.00026041924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042447064,0.0001722054,0.00016612964,0.00029842943,0.00031991146,0.0001830416,0.0009381825,0.00010119355,0.000013223212],"category_scores_gemma":[0.000045460078,0.00015449343,0.00007834014,0.0012162528,0.000199254,0.0005193594,0.000365601,0.0005342022,0.000015560014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004060539,0.000059649145,0.0030627989,0.000008721191,0.000009001848,0.000013754547,0.00011535888,2.849959e-7,0.0009113174,0.9861043,0.0001841721,0.00952659],"study_design_scores_gemma":[0.00037908248,0.00010431538,0.0038779997,0.000003583745,0.000002835532,0.000025040908,0.00002728374,0.0008147022,0.0008417526,0.9867999,0.006914678,0.0002088281],"about_ca_topic_score_codex":0.000012835915,"about_ca_topic_score_gemma":0.000012097933,"teacher_disagreement_score":0.020890223,"about_ca_system_score_codex":0.000008101492,"about_ca_system_score_gemma":0.000039036073,"threshold_uncertainty_score":0.6300059},"labels":[],"label_agreement":null},{"id":"W2116039510","doi":"10.1016/j.jctb.2018.12.007","title":"Treewidth of graphs with balanced separations","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Grantová Agentura České Republiky","keywords":"Treewidth; Combinatorics; Partial k-tree; Mathematics; Graph; Clique-sum; Discrete mathematics; Chordal graph; 1-planar graph; Pathwidth; Line graph","score_opus":0.015484421120492703,"score_gpt":0.29012519452983754,"score_spread":0.27464077340934484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116039510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3208135,0.0018024523,0.6321325,0.0010610372,0.027081912,0.0013825675,0.00007701389,0.0002178666,0.01543118],"genre_scores_gemma":[0.96916294,0.00019425573,0.029593976,0.00003246267,0.0006165343,0.000015867072,0.0000040573045,0.000041930827,0.00033799556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635077,0.000813026,0.000970765,0.00037678768,0.0010988351,0.00038983906],"domain_scores_gemma":[0.9942007,0.0005503863,0.0017971295,0.0012516412,0.001981766,0.00021839226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024336695,0.00037302938,0.0009479325,0.0005907963,0.00016264396,0.00017349115,0.0029431726,0.00025399344,0.000051191462],"category_scores_gemma":[0.0003668208,0.00028528846,0.0003602126,0.00074974983,0.0008314426,0.0010446465,0.0009636192,0.0010798567,0.0000040919413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019371178,0.00019145456,0.00017696612,0.00007415768,0.00032518042,0.000047039648,0.00077027397,0.00037019438,0.00052165246,0.9943604,0.0004546684,0.0007709269],"study_design_scores_gemma":[0.0012808471,0.0022663602,0.00018299119,0.0002999345,0.00005111813,0.00011928195,0.000091118156,0.000059132348,0.009797849,0.9839258,0.0016395553,0.0002859895],"about_ca_topic_score_codex":0.0000018472273,"about_ca_topic_score_gemma":0.0000018262431,"teacher_disagreement_score":0.6483494,"about_ca_system_score_codex":0.000089366586,"about_ca_system_score_gemma":0.000872337,"threshold_uncertainty_score":0.99995995},"labels":[],"label_agreement":null},{"id":"W2116052752","doi":"10.37236/728","title":"The Minor Crossing Number of Graphs with an Excluded Minor","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minor (academic); Combinatorics; Mathematics; Crossing number (knot theory); Graph; Robertson–Seymour theorem; Graph minor; Coxeter graph; Discrete mathematics; 1-planar graph; Line graph; Graph power; Voltage graph","score_opus":0.016644143679760092,"score_gpt":0.2882565633769669,"score_spread":0.27161241969720684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116052752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9284553,0.0022083605,0.06807878,0.00042520682,0.00019743979,0.00013662077,2.9638693e-7,0.000019343908,0.00047868543],"genre_scores_gemma":[0.99874085,0.00034423752,0.00049119414,0.000038839218,0.00003395811,0.0000027880865,8.921234e-8,0.000017188606,0.00033084393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735117,0.00036813045,0.00043968935,0.00016092641,0.0009220397,0.00075805915],"domain_scores_gemma":[0.99737173,0.0005699483,0.0005539308,0.0007634292,0.00062079186,0.000120174496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018732034,0.0001661,0.00026806755,0.00010214224,0.000932769,0.00013131459,0.0025589543,0.000045972272,0.0000033097708],"category_scores_gemma":[0.00009100868,0.0000852954,0.00013055251,0.0011078803,0.0007524176,0.0006134391,0.00013568117,0.00082725176,0.0000029715568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002454982,0.00016446889,0.0019557714,0.0000055118153,0.00008805962,0.000033343244,0.0010229851,0.00006140281,0.0005990625,0.9941183,0.000075933225,0.0016297166],"study_design_scores_gemma":[0.0011298228,0.0013680785,0.0011634835,0.000022577777,0.000019029903,0.0022498285,0.00012759877,0.00045533528,0.007279606,0.9846528,0.0013799707,0.00015186067],"about_ca_topic_score_codex":0.000007305012,"about_ca_topic_score_gemma":0.000005937176,"teacher_disagreement_score":0.070285596,"about_ca_system_score_codex":0.00013871815,"about_ca_system_score_gemma":0.0010002066,"threshold_uncertainty_score":0.71741986},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Bounded function; Order (exchange); Discrete mathematics","score_opus":0.007075373172213777,"score_gpt":0.2545845592946737,"score_spread":0.24750918612245995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116103579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.696555,0.0005129533,0.30071136,0.0007187057,0.00001638716,0.0007348468,0.0000032138942,0.0000663514,0.00068113784],"genre_scores_gemma":[0.89556485,0.00004515254,0.104237996,0.000038973198,0.0000049479895,0.000058720576,0.000001887029,0.000017443828,0.000030014968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981704,0.000096074364,0.00035301974,0.0003914307,0.00036366563,0.0006254105],"domain_scores_gemma":[0.9981438,0.0006644498,0.000147751,0.0008393699,0.000118629905,0.00008599771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005340256,0.00021427157,0.00035738066,0.00016127397,0.00007177505,0.00009497662,0.0007085871,0.00007642625,0.000037805818],"category_scores_gemma":[0.0002853315,0.00015620449,0.00004280224,0.0008816878,0.0004293817,0.00042680197,0.00024193677,0.00038951455,0.0000059894114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012582577,0.00011016951,0.0019540156,0.0001745738,0.00003603921,0.0000021141902,0.0012657807,0.00004818993,0.001228698,0.9910666,0.0000076651095,0.0040935897],"study_design_scores_gemma":[0.00049990154,0.00034211457,0.0006732734,0.000042903164,0.000005948626,0.000026162716,0.00008567607,0.010013546,0.005939335,0.9821553,0.000020338875,0.00019546702],"about_ca_topic_score_codex":0.000034214903,"about_ca_topic_score_gemma":0.00011811638,"teacher_disagreement_score":0.19900984,"about_ca_system_score_codex":0.000066390705,"about_ca_system_score_gemma":0.0001540934,"threshold_uncertainty_score":0.63698345},"labels":[],"label_agreement":null},{"id":"W2116753102","doi":"10.1016/j.dam.2013.07.013","title":"Automated generation of conjectures on forbidden subgraph characterization","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; École de Technologie Supérieure","funders":"","keywords":"Mathematics; Combinatorics; Characterization (materials science); Induced subgraph isomorphism problem; Induced subgraph; Split graph; Cograph; Discrete mathematics; Graph; Heuristic; Distance-hereditary graph; Line graph; Pathwidth; Graph power; Voltage graph; Mathematical optimization","score_opus":0.02682042991999696,"score_gpt":0.27926116335299517,"score_spread":0.2524407334329982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116753102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27817726,0.0000062304875,0.7158144,0.00011796597,0.000060084938,0.00077908527,0.000008416401,0.00039820606,0.004638329],"genre_scores_gemma":[0.91933,0.00000741602,0.08026198,0.0000968571,0.000030036981,0.00013942253,0.000054374286,0.000017383343,0.000062540304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987769,0.000025553993,0.0003360008,0.0002539914,0.00037057744,0.00023696177],"domain_scores_gemma":[0.9988778,0.000107863445,0.00021198462,0.0006228736,0.00011273756,0.000066700224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018901608,0.00015734971,0.00021617334,0.00017905142,0.00008187548,0.00010553138,0.000536047,0.000069753536,0.000041113857],"category_scores_gemma":[0.000039148938,0.00012687373,0.000053369335,0.00040485265,0.0000735121,0.00026457728,0.00011088529,0.00009596226,0.00010214208],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000234732,0.00004149052,0.0000058641604,0.00004334389,0.000013445036,3.2275236e-7,0.00054421654,0.00009284023,0.41522926,0.5814958,0.000110932124,0.0024201188],"study_design_scores_gemma":[0.0004192482,0.00011903353,0.0009773483,0.000039177856,0.000009297181,0.0000036909832,0.00010062657,0.4789088,0.3498721,0.16916405,0.00008359415,0.00030302344],"about_ca_topic_score_codex":0.000002317365,"about_ca_topic_score_gemma":6.4362064e-7,"teacher_disagreement_score":0.64115274,"about_ca_system_score_codex":0.00001731348,"about_ca_system_score_gemma":0.00002100462,"threshold_uncertainty_score":0.51737607},"labels":[],"label_agreement":null},{"id":"W2117485843","doi":"10.1016/j.jda.2009.06.001","title":"Ordered interval routing schemes","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Disjoint sets; Mathematics; Interval graph; Routing (electronic design automation); Equal-cost multi-path routing; Discrete mathematics; Static routing; Computer science; Graph; Line graph; Routing protocol; Computer network; Pathwidth","score_opus":0.020526101915145673,"score_gpt":0.3183674353720518,"score_spread":0.2978413334569061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117485843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014358421,0.00059012487,0.9804521,0.0026078883,0.00032369472,0.0000684922,0.000001088143,0.000042937303,0.0015552111],"genre_scores_gemma":[0.7410606,0.00005090641,0.25822073,0.00023047678,0.0002504937,5.2525445e-7,3.6335618e-7,0.000008397957,0.0001774808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982474,0.00011136877,0.0004850473,0.00018880457,0.00059535506,0.00037203173],"domain_scores_gemma":[0.99872756,0.00010067349,0.0003360109,0.0003479191,0.00029797634,0.00018987387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008642548,0.00013918018,0.0002714069,0.00023358023,0.000106023756,0.00017810617,0.0013728841,0.00004777466,0.00001464722],"category_scores_gemma":[0.00022769847,0.000107062544,0.00019908279,0.0005179824,0.000056789602,0.0012374986,0.00016313125,0.0004475385,0.000012910208],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007524699,0.00013088727,0.00028410184,0.000007983802,0.00009500834,0.00035998737,0.00084669737,0.00019262415,0.006620065,0.07619404,0.00069188065,0.9145015],"study_design_scores_gemma":[0.0064500915,0.0066693253,0.012958551,0.00074951845,0.000066033,0.003024526,0.0011040504,0.2355175,0.05264586,0.65745795,0.021784954,0.001571643],"about_ca_topic_score_codex":0.0000010709329,"about_ca_topic_score_gemma":3.9236224e-7,"teacher_disagreement_score":0.91292983,"about_ca_system_score_codex":0.000052167743,"about_ca_system_score_gemma":0.00008818198,"threshold_uncertainty_score":0.43658838},"labels":[],"label_agreement":null},{"id":"W2118223706","doi":"10.1016/j.tcs.2005.09.011","title":"The complexity of partition functions","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Constraint satisfaction problem; Adjacency matrix; Homomorphism; Partition (number theory); Counting problem; Discrete mathematics; Time complexity; Equivalence (formal languages); Graph","score_opus":0.040453615366782006,"score_gpt":0.3106491400712147,"score_spread":0.2701955247044327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118223706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010208137,0.000038563077,0.9798897,0.0050974423,0.00025747038,0.00013439445,0.0000015551519,0.00011221846,0.0042605493],"genre_scores_gemma":[0.89613426,0.0000057521393,0.10359223,0.00014512232,0.00008640872,0.000007773617,2.8845457e-7,0.0000035819621,0.00002459692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978547,0.00016180829,0.00026593806,0.00041340553,0.0007797646,0.00052437134],"domain_scores_gemma":[0.99794185,0.00045968106,0.0000697653,0.001035446,0.00031046657,0.0001828021],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021750596,0.00010583751,0.00012253574,0.00011691979,0.00097416143,0.00021731723,0.0027386528,0.000024448727,0.00003168154],"category_scores_gemma":[0.00013747263,0.000069383634,0.00006509703,0.0014088085,0.015019299,0.0007307766,0.0009703197,0.0001909413,0.00011457975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007764982,0.0000375174,0.000017528919,0.0000014543201,0.0000020985483,5.062492e-7,0.000096892145,0.0004013423,0.00063148193,0.9236303,0.000053058284,0.07512006],"study_design_scores_gemma":[0.00009608372,0.000105386476,0.0007206265,0.0000061319265,0.0000012158695,0.000011493765,0.0000053784142,0.3416099,0.0069777076,0.649463,0.00092373224,0.00007934462],"about_ca_topic_score_codex":0.0000010978215,"about_ca_topic_score_gemma":0.0000026256316,"teacher_disagreement_score":0.8859261,"about_ca_system_score_codex":0.000049921848,"about_ca_system_score_gemma":0.000097575656,"threshold_uncertainty_score":0.98766124},"labels":[],"label_agreement":null},{"id":"W2118486152","doi":"10.1016/s0012-365x(03)00297-8","title":"Well-located graphs: a collection of well-covered ones","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Dominating set; Graph; Maximal independent set; Discrete mathematics; Independent set; Characterization (materials science); Chordal graph; 1-planar graph","score_opus":0.02135974380539746,"score_gpt":0.2823232364815937,"score_spread":0.26096349267619623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118486152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06403628,0.00014842639,0.88539326,0.00014017333,0.00020121712,0.00056211144,0.000005308551,0.00019096791,0.049322248],"genre_scores_gemma":[0.8708024,0.000047601985,0.12733126,0.000034734952,0.0000073510814,0.00003503721,0.0000032968705,0.000028233057,0.0017100804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836874,0.00014353405,0.0004050287,0.00029303588,0.0004579989,0.0003316407],"domain_scores_gemma":[0.99854344,0.0002066295,0.00020366095,0.0007912517,0.00016301408,0.0000919762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056202925,0.00017537591,0.00028737442,0.00026223084,0.00013261318,0.00006052347,0.00063097157,0.00007174588,0.00007472847],"category_scores_gemma":[0.00024193308,0.00015228611,0.00012360205,0.0014674861,0.00014065382,0.00028652177,0.000112140166,0.00014218199,0.000086158405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011121993,0.00014784996,0.00016931078,0.00014692987,0.000047726353,0.000005465881,0.0013924107,0.00019556633,0.0031834801,0.99415785,0.0003952267,0.00014708936],"study_design_scores_gemma":[0.00059197744,0.00017059411,0.000084096064,0.000092933995,0.000016900718,0.000036081434,0.0005751321,0.038138818,0.062688164,0.89634943,0.0009679696,0.00028790793],"about_ca_topic_score_codex":0.0000054603365,"about_ca_topic_score_gemma":0.000004546603,"teacher_disagreement_score":0.8067661,"about_ca_system_score_codex":0.00003273563,"about_ca_system_score_gemma":0.00006684864,"threshold_uncertainty_score":0.6210047},"labels":[],"label_agreement":null},{"id":"W2118970668","doi":"10.37236/1538","title":"Colouring Planar Mixed Hypergraphs","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Mathematics; Bipartite graph; Chromatic polynomial; Vertex (graph theory); Planar graph; Graph; Planar; Chromatic scale; Computer science","score_opus":0.008014680410700175,"score_gpt":0.2406045820898491,"score_spread":0.23258990167914895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118970668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82798725,0.008496966,0.15358303,0.0036784275,0.0007433054,0.00023371368,6.03211e-7,0.0000916607,0.0051850453],"genre_scores_gemma":[0.9976075,0.0013065233,0.00017479378,0.000091832255,0.000054806256,0.00000214246,1.19205936e-7,0.0000130640965,0.000749193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997869,0.00027486446,0.00034312895,0.00014175914,0.0006264531,0.0007447832],"domain_scores_gemma":[0.9986951,0.0003277231,0.00018800073,0.00049852027,0.00017669862,0.00011396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017196918,0.00013642975,0.00022361215,0.00016756145,0.0002456501,0.00008133773,0.0023554557,0.000048339072,0.000027158443],"category_scores_gemma":[0.00005737491,0.00009321357,0.00014553445,0.00097282435,0.000090788686,0.00042052736,0.000063059786,0.00093801675,0.000031409443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054885306,0.000075333264,0.000079495934,0.0000027559047,0.00005576959,0.000028537384,0.00015622182,0.00020924494,0.00029489346,0.98932755,0.0003700105,0.00934532],"study_design_scores_gemma":[0.0006574003,0.0005988073,0.0002686422,0.000013094895,0.000011157908,0.0004928537,0.000030488467,0.00050524477,0.001982563,0.9807109,0.014612236,0.00011660705],"about_ca_topic_score_codex":0.0000020144814,"about_ca_topic_score_gemma":0.0000018988401,"teacher_disagreement_score":0.16962029,"about_ca_system_score_codex":0.0001934547,"about_ca_system_score_gemma":0.00033562424,"threshold_uncertainty_score":0.4377062},"labels":[],"label_agreement":null},{"id":"W2119116325","doi":"10.1017/s0963548309990290","title":"Conflict-Free Colourings of Graphs and Hypergraphs","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Neighbourhood (mathematics); Vertex (graph theory); Lemma (botany); Upper and lower bounds; Graph; Chromatic scale; Discrete mathematics","score_opus":0.022307528566733053,"score_gpt":0.2705696345529421,"score_spread":0.24826210598620904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119116325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9432079,0.000697325,0.052424576,0.0007159051,0.00022952497,0.0005339244,0.0000018013989,0.00034206416,0.0018469574],"genre_scores_gemma":[0.97405964,0.000026997333,0.02577903,0.00009528721,0.0000070477054,0.000003100573,6.843646e-7,0.000009068669,0.00001912587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975758,0.00020163953,0.00050659163,0.0006855439,0.00050272344,0.0005276997],"domain_scores_gemma":[0.99715924,0.0005250247,0.00021919397,0.0014740878,0.00041642805,0.00020601133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015113987,0.00023159766,0.000408683,0.00026891695,0.00026190627,0.00009207043,0.0019082449,0.000104500534,0.0000013715397],"category_scores_gemma":[0.00068818807,0.00023727582,0.000112761845,0.0014646556,0.00032783797,0.00036608777,0.0010559144,0.0003660635,0.0000015501967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001162725,0.00020951785,0.009404681,0.000060401588,0.000011230828,0.00000511148,0.0005109728,0.00005738907,0.000876599,0.97785443,0.00004467958,0.010953367],"study_design_scores_gemma":[0.0007578725,0.0004109896,0.021559978,0.00003734579,0.000004575665,0.000017440187,0.000016502161,0.008213989,0.0025395427,0.9660839,0.00013166672,0.0002262344],"about_ca_topic_score_codex":0.000007560571,"about_ca_topic_score_gemma":6.3726105e-7,"teacher_disagreement_score":0.030851739,"about_ca_system_score_codex":0.000059226917,"about_ca_system_score_gemma":0.00006987763,"threshold_uncertainty_score":0.9675827},"labels":[],"label_agreement":null},{"id":"W2119305988","doi":"10.1017/s0963548301004758","title":"A Note on Vertex List Colouring","year":2001,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Conjecture; Mathematics; Graph; Discrete mathematics","score_opus":0.032389842811345056,"score_gpt":0.3031178416169424,"score_spread":0.27072799880559734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119305988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54870003,0.00008632569,0.43769267,0.0010115354,0.0012995681,0.00063115463,7.804934e-7,0.0008039616,0.009773996],"genre_scores_gemma":[0.9872321,0.000007316563,0.012326528,0.00020776443,0.00005293774,0.000011393021,0.0000012797044,0.000022796068,0.00013788928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996748,0.0003296956,0.00043611668,0.00094971847,0.00069754064,0.00083897886],"domain_scores_gemma":[0.9966853,0.0011082,0.00014721541,0.0014865714,0.0003128645,0.00025983588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017377634,0.0002813741,0.00032531752,0.00021436907,0.00060259097,0.00024657368,0.002000626,0.00011391274,0.00000882559],"category_scores_gemma":[0.0009702017,0.00029058446,0.00013510074,0.0017582808,0.00015425716,0.0003973533,0.001222087,0.00066598615,0.00009538655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028857803,0.00043976234,0.008465779,0.000044017754,0.00001061259,0.00006642018,0.00045341437,0.0016797036,0.00018617438,0.95689803,0.00009104685,0.031636152],"study_design_scores_gemma":[0.0006749953,0.00030749702,0.0033112816,0.00006761069,0.0000026863065,0.000033255637,0.000009905015,0.1506204,0.00085264764,0.8414813,0.0022770215,0.0003613796],"about_ca_topic_score_codex":0.0000126625955,"about_ca_topic_score_gemma":0.000003543398,"teacher_disagreement_score":0.43853208,"about_ca_system_score_codex":0.00048879226,"about_ca_system_score_gemma":0.000125036,"threshold_uncertainty_score":0.99995464},"labels":[],"label_agreement":null},{"id":"W2120708918","doi":"10.1016/j.dam.2013.10.016","title":"Matrix partitions of split graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Bipartite graph; Chordal graph; Cograph; Discrete mathematics; Complete bipartite graph; Graph; 1-planar graph","score_opus":0.018241546581663645,"score_gpt":0.29076085388082396,"score_spread":0.2725193072991603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120708918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06582932,0.00005161683,0.8986166,0.00024881787,0.00004451001,0.00076730375,0.000009680178,0.00019946399,0.034232654],"genre_scores_gemma":[0.5264047,0.0000116588235,0.47311231,0.000030255744,0.000009032862,0.00019133557,0.0000037656675,0.000016409344,0.00022054878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862814,0.000016604921,0.000379596,0.00025118014,0.0003785277,0.00034594894],"domain_scores_gemma":[0.9984486,0.00020850076,0.00015323516,0.00097044784,0.00009838867,0.00012080909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023443825,0.00014869432,0.00024366059,0.00014908906,0.00009038282,0.00008235446,0.00093291554,0.00005240411,0.00015163339],"category_scores_gemma":[0.000035840272,0.00012459146,0.000093161005,0.0005841701,0.00016955842,0.0002866545,0.0003055567,0.00013173815,0.00045445428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014168655,0.000061659804,0.000014509447,0.00008451194,0.000016256676,5.4416813e-7,0.00048508932,0.00003280162,0.008071004,0.9896683,0.00030596764,0.0012579241],"study_design_scores_gemma":[0.0001698568,0.00002966278,0.00012279194,0.000019291167,0.0000062258255,0.0000037371924,0.00023979277,0.0071343738,0.008103047,0.9838866,0.00013826125,0.00014637967],"about_ca_topic_score_codex":0.0000040054965,"about_ca_topic_score_gemma":7.196325e-7,"teacher_disagreement_score":0.46057534,"about_ca_system_score_codex":0.0000126610785,"about_ca_system_score_gemma":0.00002410762,"threshold_uncertainty_score":0.58412415},"labels":[],"label_agreement":null},{"id":"W2120958076","doi":"10.1016/j.jctb.2007.10.008","title":"Tangles, tree-decompositions and grids in matroids","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tangle; Matroid; Graphic matroid; Combinatorics; Matroid partitioning; Mathematics; Tree decomposition; Grid; Graph; Tree (set theory); Order (exchange); Finite field; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.007818567983791677,"score_gpt":0.2651665826904393,"score_spread":0.25734801470664764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120958076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7364257,0.005043049,0.21874033,0.01047969,0.009389095,0.0006744423,0.000008766331,0.00021390521,0.019025],"genre_scores_gemma":[0.9883742,0.00011344385,0.011037813,0.0001101241,0.00024297858,0.0000015955062,3.5174818e-7,0.000008196215,0.00011131492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838305,0.00038317335,0.00043917855,0.00015917212,0.0003561072,0.00027929922],"domain_scores_gemma":[0.99888915,0.00029421973,0.000198186,0.00028674005,0.00017591479,0.00015576693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471703,0.00013938779,0.00030528658,0.00036449436,0.000116957155,0.00014262929,0.00075731275,0.00006789971,0.000012410887],"category_scores_gemma":[0.00016470252,0.000121518286,0.000088918256,0.0005369087,0.00014700806,0.0015013784,0.00011153101,0.00040034117,0.000002530062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039490077,0.00012478209,0.00013171512,0.000003599242,0.000012125553,0.00011764167,0.00031396683,0.000018525134,0.003967017,0.98339075,0.000113058944,0.011411896],"study_design_scores_gemma":[0.0012065249,0.0012384237,0.0017531893,0.000042401618,0.000004891884,0.00035891045,0.000102407896,0.00003507536,0.0030525352,0.9901549,0.001924643,0.00012608475],"about_ca_topic_score_codex":6.071e-7,"about_ca_topic_score_gemma":8.46421e-7,"teacher_disagreement_score":0.25194845,"about_ca_system_score_codex":0.00007012659,"about_ca_system_score_gemma":0.00008762771,"threshold_uncertainty_score":0.4955372},"labels":[],"label_agreement":null},{"id":"W2121104987","doi":"10.46298/dmtcs.1264","title":"On the Meyniel condition for hamiltonicity in bipartite digraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Bipartite graph; Combinatorics; Mathematics; Hamiltonian (control theory); Discrete mathematics; Hamiltonian path; Strongly connected component; Graph","score_opus":0.019441468272439758,"score_gpt":0.3031915034484831,"score_spread":0.28375003517604336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121104987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048405703,0.0000066446064,0.9448325,0.0018308633,0.0001866882,0.00066350447,0.0000050528997,0.00011150389,0.0039575095],"genre_scores_gemma":[0.86276835,0.0000020147206,0.13643001,0.00063861767,0.000036325426,0.0001019957,0.0000013692921,0.000013893248,0.000007443721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967426,0.0002457042,0.0004343473,0.00078154705,0.0009496149,0.000846156],"domain_scores_gemma":[0.99398273,0.0040141856,0.00012575639,0.0014752772,0.00019416118,0.00020788342],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0052692033,0.0002568899,0.00030293764,0.00032114936,0.0005850093,0.00054316764,0.0034428013,0.00006147017,0.00002792219],"category_scores_gemma":[0.001142083,0.00016283328,0.00014189219,0.0015480429,0.0030181352,0.0005270015,0.00074569316,0.0003212247,0.000050445193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010404895,0.00008473432,0.000009683119,0.000020750758,0.0000037916539,0.0000012476607,0.00079028826,0.0002518317,0.0006053041,0.9965698,0.00003847881,0.0016136855],"study_design_scores_gemma":[0.0001565891,0.00015892542,0.000040702165,0.000047020338,0.0000017617425,0.0000032241592,0.000017469501,0.47610986,0.0031094512,0.5202013,0.00003140816,0.00012223993],"about_ca_topic_score_codex":8.8209555e-7,"about_ca_topic_score_gemma":0.0000015092038,"teacher_disagreement_score":0.81436265,"about_ca_system_score_codex":0.000051672057,"about_ca_system_score_gemma":0.00006260768,"threshold_uncertainty_score":0.99969506},"labels":[],"label_agreement":null},{"id":"W2121556262","doi":"10.1016/j.tcs.2014.03.034","title":"The cyclical scheduling problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scheduling (production processes); Vertex (graph theory); Combinatorics; Job shop scheduling; Mathematics; Computer science; Matching (statistics); Algorithm; Mathematical optimization; Graph; Schedule","score_opus":0.0113602510684824,"score_gpt":0.2838421154584433,"score_spread":0.2724818643899609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121556262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007087385,0.000027568909,0.9784088,0.004150645,0.00036927316,0.00019016079,1.7301556e-7,0.00029080192,0.009475201],"genre_scores_gemma":[0.6818891,0.000004282417,0.31756207,0.00038377108,0.00012520989,0.000012055734,8.875996e-8,0.0000072108733,0.000016165463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962356,0.0003496655,0.00029756592,0.00084402756,0.001187955,0.0010851955],"domain_scores_gemma":[0.996101,0.001587451,0.0000621783,0.001570973,0.00026214996,0.00041620192],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0059583876,0.0001859169,0.00017157038,0.00014160127,0.0017675145,0.0011080473,0.0064709275,0.000047504273,0.000008822162],"category_scores_gemma":[0.0004964668,0.000114371825,0.000078861856,0.001771104,0.006914414,0.00072287035,0.0024464326,0.000431805,0.0002093941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055417527,0.000018050756,0.000022242222,0.000002032658,0.0000017455151,0.0000017967027,0.00007886307,0.0003367824,0.0004268417,0.8592654,0.000011619877,0.1398291],"study_design_scores_gemma":[0.00009017174,0.00010050526,0.00012239645,0.000008411817,6.949508e-7,0.000018335848,0.0000019745457,0.45225513,0.0014212576,0.5449644,0.00090777123,0.00010901606],"about_ca_topic_score_codex":7.261277e-7,"about_ca_topic_score_gemma":4.319104e-7,"teacher_disagreement_score":0.67480177,"about_ca_system_score_codex":0.000051781542,"about_ca_system_score_gemma":0.00010825875,"threshold_uncertainty_score":0.9999289},"labels":[],"label_agreement":null},{"id":"W2121804749","doi":"10.2168/lmcs-6(4:4)2010","title":"The complexity of global cardinality constraints","year":2010,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cardinality (data modeling); Constraint satisfaction problem; Constraint satisfaction dual problem; Constraint (computer-aided design); Set (abstract data type); Constraint satisfaction; Mathematics; Time complexity; Complexity of constraint satisfaction; Constraint logic programming; Computational complexity theory; Local consistency; Computer science; Mathematical optimization; Constraint programming; Discrete mathematics; Algorithm","score_opus":0.16318232241616554,"score_gpt":0.46939488013791036,"score_spread":0.3062125577217448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121804749","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028937789,0.000026932905,0.9671247,0.0007425809,0.0011707393,0.00019526579,0.000002617685,0.000062131185,0.0017372298],"genre_scores_gemma":[0.4470786,0.0000013205818,0.5528181,0.00007088612,0.000023929137,0.0000047999947,3.6739607e-8,0.0000011521424,0.0000011413051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964453,0.0009347856,0.00042819817,0.00073920586,0.0007681262,0.00068439805],"domain_scores_gemma":[0.9963362,0.0016754317,0.00013235479,0.0013466954,0.0002924481,0.00021683109],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01198497,0.00015139974,0.0002862338,0.000068839596,0.00040929703,0.00022859509,0.005312382,0.00007143544,0.000008654303],"category_scores_gemma":[0.0012807013,0.00009626892,0.000097717675,0.0027386977,0.01591628,0.0004296328,0.0022435514,0.00057417655,0.000005117524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040156974,0.000029712839,0.0025590556,0.0000020021973,0.0000013767637,0.000004896521,0.00002746908,0.000049595103,0.002669058,0.6078993,0.0000016842824,0.38675183],"study_design_scores_gemma":[0.00014042793,0.00009353759,0.09682214,0.0000058546366,6.308954e-7,0.000044809185,0.0000048145002,0.08293665,0.0029000905,0.8168164,0.00011798306,0.00011664142],"about_ca_topic_score_codex":0.000018388004,"about_ca_topic_score_gemma":0.00002290475,"teacher_disagreement_score":0.4181408,"about_ca_system_score_codex":0.00006456799,"about_ca_system_score_gemma":0.00023207373,"threshold_uncertainty_score":0.9871816},"labels":[],"label_agreement":null},{"id":"W2121942061","doi":"10.1002/jgt.21823","title":"Embedding a Graph‐Like Continuum in Some Surface","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Embedding; Graph; Pairwise comparison; Surface (topology); Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.013010212310684959,"score_gpt":0.28833193695926046,"score_spread":0.2753217246485755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121942061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5491364,0.0013352048,0.44718713,0.0004108745,0.0008590745,0.00013073208,0.000001016606,0.00005044786,0.00088911236],"genre_scores_gemma":[0.9802872,0.00013966695,0.018808391,0.0003858042,0.00011837742,0.0000020431303,1.9875507e-7,0.000023152314,0.000235185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666446,0.0011202887,0.0006864411,0.00030170302,0.0006472713,0.00057981926],"domain_scores_gemma":[0.9972246,0.0012037088,0.00047218858,0.0006110619,0.00025082953,0.00023761073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007157549,0.00021466461,0.0004728525,0.0009929348,0.00012328435,0.00013094595,0.0018499091,0.00009589701,0.000019354695],"category_scores_gemma":[0.00041916105,0.00017909889,0.00031780897,0.0011664693,0.0002510112,0.001458821,0.00024435675,0.0007538368,0.000016959339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023965848,0.00015897596,0.002898137,0.00002529072,0.000069523994,0.0001398768,0.0009851132,0.0018419432,0.010651215,0.9713806,0.00051544886,0.011094205],"study_design_scores_gemma":[0.0010853562,0.00029395093,0.0018676618,0.000116588424,0.0000074245404,0.00014596584,0.00014431892,0.0015505375,0.0022016827,0.99119055,0.0011770349,0.00021895443],"about_ca_topic_score_codex":0.0000022715767,"about_ca_topic_score_gemma":0.0000059364793,"teacher_disagreement_score":0.4311508,"about_ca_system_score_codex":0.000047942856,"about_ca_system_score_gemma":0.00007264696,"threshold_uncertainty_score":0.73034406},"labels":[],"label_agreement":null},{"id":"W2122000012","doi":"10.1017/s0963548306007644","title":"Randomized Algorithms for Determining the Majority on Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Randomized algorithm; Node (physics); Undirected graph; Combinatorics; Graph; Algorithm; Computer science; Task (project management); Upper and lower bounds; Simple (philosophy); Mathematics; Discrete mathematics; Theoretical computer science","score_opus":0.040548659523731996,"score_gpt":0.30824757233417144,"score_spread":0.26769891281043945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122000012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18460412,0.00010628482,0.80885196,0.00070673414,0.0010817148,0.0026860798,0.0000032836076,0.00042729604,0.0015325104],"genre_scores_gemma":[0.9580962,0.0000019461618,0.041472856,0.0001219952,0.00008949088,0.00012793815,0.000005473414,0.000023592287,0.000060512284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627507,0.0008154317,0.0006629691,0.00086079014,0.0006200691,0.0007656626],"domain_scores_gemma":[0.9912729,0.0065023876,0.00027839013,0.0012772941,0.0005691567,0.00009987186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063492367,0.00031083994,0.00057351455,0.00016323102,0.0010159592,0.0003064905,0.0020307493,0.00010500931,0.0000010771662],"category_scores_gemma":[0.0016211538,0.00022696992,0.00039268137,0.0010629114,0.0004250215,0.00027324338,0.00066510035,0.0004735909,0.000007357844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005292399,0.0002563278,0.001380967,0.00004075202,0.000015546137,0.0000014793037,0.00012086565,0.000789302,0.000007374426,0.98559093,0.00008005038,0.011187187],"study_design_scores_gemma":[0.026627883,0.000109922614,0.0009335502,0.000019678504,0.000008130735,0.000002297054,0.000005231722,0.1638029,0.0003129804,0.8077597,0.00019516682,0.00022256718],"about_ca_topic_score_codex":0.000017312395,"about_ca_topic_score_gemma":0.0000021168248,"teacher_disagreement_score":0.7734921,"about_ca_system_score_codex":0.00018071457,"about_ca_system_score_gemma":0.00008572265,"threshold_uncertainty_score":0.9255565},"labels":[],"label_agreement":null},{"id":"W2122238195","doi":"10.1016/j.ejc.2009.11.008","title":"An improved linear bound on the number of perfect matchings in cubic graphs","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Cubic graph; Perfect graph theorem; Polytope; Matching (statistics); Perfect graph; Trivially perfect graph; Dimension (graph theory); Graph; Upper and lower bounds; Discrete mathematics; Line graph; Pathwidth; Mathematical analysis","score_opus":0.016313602346027672,"score_gpt":0.29190614115601826,"score_spread":0.2755925388099906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122238195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97855896,0.000092954666,0.016423468,0.0007169074,0.00029450157,0.00009875571,5.0502615e-7,0.00001923273,0.0037946976],"genre_scores_gemma":[0.99790347,0.000048545,0.0017150939,0.00022854419,0.000034595218,2.3978902e-7,1.4420748e-7,0.000016421649,0.000052929834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738556,0.0011374449,0.00050379365,0.00017563523,0.0005208451,0.00027673724],"domain_scores_gemma":[0.998356,0.000268,0.00038313394,0.00059152284,0.0002687277,0.0001326127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035746135,0.00014572336,0.00023666672,0.00024214775,0.00010254598,0.000092189606,0.0019391007,0.000020828958,0.000008361932],"category_scores_gemma":[0.00020157294,0.00009988838,0.00012980677,0.0009045955,0.0000847284,0.0005072509,0.00008920772,0.0007302583,0.000016418293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015374974,0.00076699315,0.0027464626,0.000011951381,0.000023216475,0.0003673576,0.0016447693,0.0002699515,0.00991276,0.9713303,0.0001728749,0.012599637],"study_design_scores_gemma":[0.0024535025,0.004541385,0.038478885,0.00020007988,0.000011332143,0.0003013412,0.00017247937,0.0063777124,0.0080651045,0.9380362,0.00097296183,0.00038903786],"about_ca_topic_score_codex":0.0000010062613,"about_ca_topic_score_gemma":1.5234528e-7,"teacher_disagreement_score":0.035732426,"about_ca_system_score_codex":0.000043832817,"about_ca_system_score_gemma":0.00006213852,"threshold_uncertainty_score":0.40733296},"labels":[],"label_agreement":null},{"id":"W2122404357","doi":"10.1007/s00493-014-2806-z","title":"A minimum degree condition forcing complete graph immersion","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets; Simple graph; Immersion (mathematics); Complement graph; Graph power; Line graph; Geometry","score_opus":0.03635824512445577,"score_gpt":0.2841506765625666,"score_spread":0.24779243143811083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122404357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040556062,0.00015721878,0.9466892,0.00066641497,0.0007168015,0.00025807146,0.0000021850378,0.0002856072,0.010668427],"genre_scores_gemma":[0.99404955,0.000012579771,0.0054787397,0.00020072448,0.000028431361,0.000025078825,0.000006959541,0.000015374952,0.00018258965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982375,0.00020662085,0.00020909063,0.00045529802,0.00041986624,0.00047165158],"domain_scores_gemma":[0.99839985,0.00036861288,0.000098542194,0.0008087997,0.00014108526,0.00018313316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049677736,0.00016141638,0.00020451375,0.00025743595,0.00034296286,0.00009507691,0.0011223733,0.000064304026,0.00002039161],"category_scores_gemma":[0.00009842054,0.00015753716,0.000102228216,0.0008628321,0.00010385254,0.0004851743,0.0003951031,0.00022305014,0.00021483189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011665544,0.000069775226,0.0004239978,0.000016390473,0.000012633603,0.000008085027,0.00012227097,0.0000138495625,0.005375244,0.9737375,0.0018974907,0.018311119],"study_design_scores_gemma":[0.0012687695,0.0004164445,0.0027592196,0.000033943135,0.0000068403306,0.000020322424,0.000037038353,0.024472443,0.0040315976,0.9537268,0.0128645925,0.00036198832],"about_ca_topic_score_codex":0.000006287492,"about_ca_topic_score_gemma":5.4206146e-7,"teacher_disagreement_score":0.9534935,"about_ca_system_score_codex":0.00007179369,"about_ca_system_score_gemma":0.000024534575,"threshold_uncertainty_score":0.6424179},"labels":[],"label_agreement":null},{"id":"W2122599841","doi":"10.1016/j.disc.2013.08.032","title":"A Dirac-type characterization of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-chordal graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Characterization (materials science); Graph; Discrete mathematics; Physics","score_opus":0.018689806947235477,"score_gpt":0.2611651905464756,"score_spread":0.2424753835992401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122599841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9288545,0.00006499264,0.06909236,0.00020964611,0.00040677265,0.00017873681,0.000050986095,0.0001795966,0.0009623881],"genre_scores_gemma":[0.96634287,0.00014552867,0.032519497,0.00019809425,0.00014786757,0.00019938443,0.00014594995,0.000117646436,0.00018314837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966478,0.000110964094,0.0008193826,0.00062819506,0.0010447144,0.0007489629],"domain_scores_gemma":[0.99687123,0.00044394057,0.0006768328,0.0015361772,0.00020293864,0.000268853],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00071947946,0.0003835109,0.00033888,0.00021969584,0.00035102057,0.00043227055,0.0014139824,0.00029810745,0.000059541428],"category_scores_gemma":[0.00048024612,0.0003965906,0.00036321866,0.00080465927,0.00037167984,0.0012483947,0.0008883318,0.0004464925,0.0008470369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046980484,0.00015439316,0.000026363665,0.00038694183,0.00012050364,0.000033928645,0.0018509569,0.00008836796,0.018397283,0.9775764,0.00006316262,0.0012547262],"study_design_scores_gemma":[0.00041032507,0.0003309231,0.00026088185,0.00029387997,0.00006252176,0.00007697095,0.00021808111,0.9517632,0.012366797,0.033474658,0.00033762664,0.0004041458],"about_ca_topic_score_codex":0.000038672388,"about_ca_topic_score_gemma":0.000009830803,"teacher_disagreement_score":0.9516748,"about_ca_system_score_codex":0.000015837883,"about_ca_system_score_gemma":0.00016241625,"threshold_uncertainty_score":0.9999309},"labels":[],"label_agreement":null},{"id":"W2123784540","doi":"10.1007/3-540-44683-4_11","title":"Refined Search Tree Technique for Dominating Set on Planar Graphs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Planar graph; Dominating set; Combinatorics; Reduction (mathematics); Search tree; Computer science; Graph; Mathematics; Tree (set theory); Set (abstract data type); Discrete mathematics; Algorithm; Search algorithm; Vertex (graph theory)","score_opus":0.03720729722806748,"score_gpt":0.31655558615372115,"score_spread":0.27934828892565366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123784540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003214303,0.00012066643,0.98814815,0.0009616935,0.00053208886,0.0016095795,0.000024548128,0.00023004896,0.008341102],"genre_scores_gemma":[0.030254444,0.00006185222,0.96632624,0.0014361533,0.0003979139,0.00021758873,0.000022228223,0.00011029115,0.0011732953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99404234,0.00010264218,0.00060209626,0.002306785,0.0015973687,0.0013487666],"domain_scores_gemma":[0.99449414,0.0023801923,0.00024705636,0.002152292,0.00044833077,0.00027801195],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029959432,0.00069431844,0.0006846897,0.002438071,0.00056647457,0.0004529551,0.0057020625,0.00045608892,0.000014537085],"category_scores_gemma":[0.0003040557,0.0006285592,0.0002503544,0.0015177854,0.0010403267,0.0005465619,0.0010592808,0.0015225699,0.000026843585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070751434,0.00003948148,0.000015107096,0.00007386987,0.000014871714,0.00016505536,0.00035080957,0.0067920256,0.0019476269,0.33481565,0.0000588684,0.65565586],"study_design_scores_gemma":[0.0005794136,0.00095040584,0.000021419106,0.0005956457,0.0000047258686,0.00012396218,3.8349896e-7,0.095970675,0.015981779,0.8824457,0.0024664192,0.0008594767],"about_ca_topic_score_codex":0.000010728281,"about_ca_topic_score_gemma":0.000060434955,"teacher_disagreement_score":0.6547964,"about_ca_system_score_codex":0.00043012472,"about_ca_system_score_gemma":0.00049205724,"threshold_uncertainty_score":0.99967754},"labels":[],"label_agreement":null},{"id":"W2123868336","doi":"10.1016/j.tcs.2007.02.033","title":"Efficient algorithms for center problems in cactus networks","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cactus; Center (category theory); Algorithm; Computer science; Mathematics","score_opus":0.018651931694772642,"score_gpt":0.30651717067432355,"score_spread":0.2878652389795509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123868336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013769511,0.00004277767,0.9832495,0.0003490745,0.00079816673,0.0006953899,0.0000015930988,0.00015445947,0.0009395286],"genre_scores_gemma":[0.7748813,0.0000020803757,0.22468792,0.00027488463,0.0001122183,0.000021764834,7.2800606e-7,0.000011390154,0.000007722536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595124,0.00009271742,0.0004408485,0.0010430469,0.0008340002,0.0016381632],"domain_scores_gemma":[0.9974876,0.0008399796,0.00007051255,0.00091151835,0.00026746237,0.00042293503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006703305,0.0002290737,0.00025177107,0.00052060647,0.00034706105,0.00028635416,0.0031208007,0.0000794946,0.0000103815555],"category_scores_gemma":[0.0001311927,0.00019022575,0.000090815694,0.0024573712,0.002508108,0.00029671058,0.0011781303,0.00035687888,0.00002099082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020407277,0.00014400925,0.00016641972,0.00000772568,0.0000019712954,0.000014759986,0.00030272943,0.04208084,0.00013250817,0.8899897,0.000008771275,0.0671302],"study_design_scores_gemma":[0.00056103716,0.00021579103,0.001012444,0.000033628257,8.315163e-7,0.000026994358,0.0000053841727,0.86156654,0.00073526066,0.1355,0.00011869538,0.00022341551],"about_ca_topic_score_codex":0.0000025154677,"about_ca_topic_score_gemma":0.0000033479776,"teacher_disagreement_score":0.81948566,"about_ca_system_score_codex":0.00016688819,"about_ca_system_score_gemma":0.00009167743,"threshold_uncertainty_score":0.92412287},"labels":[],"label_agreement":null},{"id":"W2123921374","doi":"10.1007/s10107-005-0647-7","title":"Recognizing Balanceable Matrices","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block matrix; Mathematics; Matrix (chemical analysis); Modulo; Combinatorics; Square matrix; Block (permutation group theory); Column (typography); Discrete mathematics; Symmetric matrix; Eigenvalues and eigenvectors; Geometry","score_opus":0.03153990687852182,"score_gpt":0.30946931220908636,"score_spread":0.27792940533056454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123921374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034583015,0.00039376764,0.9845756,0.00080077787,0.000045231194,0.000293442,2.8173878e-7,0.00056045863,0.009872129],"genre_scores_gemma":[0.15691872,0.000009417463,0.8420364,0.00010467483,0.00009450056,0.000062217376,5.471379e-7,0.00001635572,0.0007571452],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829054,0.000059001035,0.0002858565,0.0003599558,0.00040174206,0.00060287694],"domain_scores_gemma":[0.9988599,0.0003213945,0.00006631694,0.00052254397,0.00006660898,0.00016325478],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005566203,0.00014116104,0.00019441143,0.00012019674,0.00016679786,0.000310406,0.0009160397,0.00005350161,0.00008107927],"category_scores_gemma":[0.00025257788,0.00011914989,0.00007797352,0.0006206529,0.000075935895,0.0008018855,0.00032656937,0.00021577053,0.0010009157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026365128,0.00010406096,0.000055418805,0.000061256294,0.000009235727,0.000008190554,0.00022019503,0.00002448951,0.00026693367,0.28688103,0.00014706062,0.7122195],"study_design_scores_gemma":[0.0005051462,0.0001321619,0.000026113787,0.00017289835,0.000010634749,0.000114987255,0.00016700855,0.11739376,0.004743577,0.77597713,0.1001916,0.00056496315],"about_ca_topic_score_codex":7.2912883e-7,"about_ca_topic_score_gemma":9.193413e-7,"teacher_disagreement_score":0.71165454,"about_ca_system_score_codex":0.00004630702,"about_ca_system_score_gemma":0.000020661779,"threshold_uncertainty_score":0.9997769},"labels":[],"label_agreement":null},{"id":"W2123984395","doi":"10.1016/j.tcs.2004.06.013","title":"Characterization of networks supporting multi-dimensional linear interval routing schemes","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Node (physics); Interval (graph theory); Routing (electronic design automation); Class (philosophy); Generalization; Integer (computer science); Discrete mathematics; Computer science; Mathematics; Combinatorics; Scheme (mathematics); Set (abstract data type); Topology (electrical circuits); Computer network; Artificial intelligence","score_opus":0.01905426557928505,"score_gpt":0.30749170544809024,"score_spread":0.2884374398688052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123984395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31738043,0.000005037633,0.6818846,0.00021335886,0.000242181,0.00012608977,9.597796e-7,0.000106704116,0.000040622745],"genre_scores_gemma":[0.69519573,0.0000010284767,0.304571,0.00014673066,0.00006942947,0.0000030362146,0.0000021097803,0.000008081921,0.0000028332176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712485,0.00011237769,0.000508045,0.0007099822,0.000797863,0.0007468611],"domain_scores_gemma":[0.9982772,0.00017922232,0.00020173698,0.0006807817,0.00041039923,0.00025065083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023366946,0.00018912874,0.00026098703,0.00024480192,0.00035829935,0.00014670403,0.0021749374,0.00006174339,0.00001724617],"category_scores_gemma":[0.00023870956,0.00016320767,0.000090772264,0.0015424361,0.0025459446,0.0010476593,0.0017910483,0.00032026516,0.000018055334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012612845,0.00008821694,0.00014144706,0.0000066386738,0.0000043350287,0.000010659746,0.00028018377,0.0073839845,0.04666786,0.9329138,1.4572001e-7,0.012490133],"study_design_scores_gemma":[0.0003775871,0.00015775593,0.0009810159,0.000079757025,0.000002056485,0.000029339071,0.000004210355,0.87600833,0.08278373,0.039394084,0.000003723376,0.00017839315],"about_ca_topic_score_codex":0.0000018221275,"about_ca_topic_score_gemma":2.5317325e-7,"teacher_disagreement_score":0.8935197,"about_ca_system_score_codex":0.00007058266,"about_ca_system_score_gemma":0.00018339686,"threshold_uncertainty_score":0.93806386},"labels":[],"label_agreement":null},{"id":"W2125078199","doi":"10.1002/rsa.20695","title":"Acyclic edge colourings of graphs with large girth","year":2016,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Girth (graph theory); Directed acyclic graph; Graph; Enhanced Data Rates for GSM Evolution; Triangle-free graph; Edge coloring; Random graph","score_opus":0.007833057280669756,"score_gpt":0.2503309449894059,"score_spread":0.24249788770873615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125078199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39386213,0.0007752696,0.603944,0.00040848274,0.00014205984,0.00038468398,0.000037530397,0.00009508045,0.0003507398],"genre_scores_gemma":[0.9769827,0.00018652217,0.022506244,0.00004909392,0.000035320485,0.00001319642,7.433155e-7,0.000012176622,0.00021397849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998702,0.00007853536,0.00017748805,0.00036189758,0.00030532613,0.00037473795],"domain_scores_gemma":[0.9990116,0.00027646087,0.000098182405,0.00039761828,0.00008617345,0.0001299803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027764533,0.00015841646,0.00028902048,0.00014172461,0.00013466242,0.000043720855,0.0004926564,0.00004991229,0.000021897527],"category_scores_gemma":[0.000041391668,0.000081848695,0.000060871447,0.0003065751,0.00023846189,0.00030504624,0.00020100713,0.00009945384,0.0000014169532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009270619,0.000067424255,0.0053436495,0.00007955287,0.00016237571,0.000059321716,0.0007457973,0.00001738116,0.011354194,0.6524229,0.00019757808,0.32862276],"study_design_scores_gemma":[0.037724037,0.00104702,0.035743427,0.00018297935,0.000031608462,0.00022968928,0.00009451151,0.0022542195,0.048620164,0.86454767,0.008705987,0.0008186893],"about_ca_topic_score_codex":0.000006917277,"about_ca_topic_score_gemma":0.0000048011093,"teacher_disagreement_score":0.5831206,"about_ca_system_score_codex":0.000008241688,"about_ca_system_score_gemma":0.000027915023,"threshold_uncertainty_score":0.3337693},"labels":[],"label_agreement":null},{"id":"W2125095198","doi":"10.1007/s10998-006-0035-y","title":"Problems on polytopes, their groups, and realizations","year":2006,"lang":"en","type":"article","venue":"Periodica Mathematica Hungarica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Polytope; Mathematics; Regular polygon; Combinatorics; Geometry","score_opus":0.01703905265785278,"score_gpt":0.2491012303506705,"score_spread":0.23206217769281773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125095198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018478476,0.00066772813,0.8997487,0.005738717,0.00009474577,0.0010081741,0.000021650521,0.0008102481,0.07343158],"genre_scores_gemma":[0.94218475,0.00007409117,0.05528544,0.00028633658,0.00007944962,0.00016886945,0.000011256621,0.000040995295,0.0018687996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816346,0.00012122851,0.00033185247,0.00051595026,0.00040495908,0.0004625252],"domain_scores_gemma":[0.99841875,0.0003530586,0.000104076746,0.00090331415,0.00007132313,0.0001494923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041406017,0.00022492038,0.00026803504,0.00021733915,0.00049466843,0.00036462772,0.0008090884,0.00007642132,0.00005538786],"category_scores_gemma":[0.00012800717,0.00017507952,0.00006554836,0.00061617437,0.00028440962,0.00030835439,0.0003267317,0.00022587224,0.00009722079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041544267,0.00019833248,0.00011649124,0.00005464201,0.000011462034,0.000006395973,0.0010164118,0.000036797814,0.0008985493,0.9921428,0.0011345765,0.0043793856],"study_design_scores_gemma":[0.00042800023,0.00023693233,0.0018575803,0.000107266074,0.00000940732,0.00008088575,0.00009569012,0.027180616,0.0010151593,0.94042075,0.028117018,0.00045069325],"about_ca_topic_score_codex":0.000017541848,"about_ca_topic_score_gemma":0.000010250287,"teacher_disagreement_score":0.9237063,"about_ca_system_score_codex":0.000038958828,"about_ca_system_score_gemma":0.000048548827,"threshold_uncertainty_score":0.7139536},"labels":[],"label_agreement":null},{"id":"W2125583143","doi":"10.1016/j.tcs.2013.06.009","title":"On minimum cost edge searching","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Ideal (ethics); Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Best-first search; Mathematical optimization; Beam search; Search algorithm; Computer science; Combinatorics; Artificial intelligence","score_opus":0.018929723704174912,"score_gpt":0.30389556963707576,"score_spread":0.28496584593290086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125583143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058128368,0.000009726707,0.92493325,0.0018935006,0.0004490537,0.0005121534,8.402552e-7,0.00028620905,0.013786869],"genre_scores_gemma":[0.8930429,0.0000019424128,0.10556876,0.0011861945,0.000093700866,0.000042049876,3.6796274e-7,0.000012514201,0.000051535535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957983,0.00026234103,0.00026793705,0.0010552384,0.0013789512,0.0012372674],"domain_scores_gemma":[0.99625415,0.0011750223,0.000050512135,0.0015318968,0.0003189219,0.00066950225],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020376872,0.00023645474,0.00021899608,0.00044210674,0.000717843,0.0010401534,0.0052068075,0.000051978674,0.00022059983],"category_scores_gemma":[0.00032896217,0.00018490206,0.00008074145,0.0019432809,0.004350697,0.0014793782,0.002176108,0.00051117985,0.0021235663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058398437,0.00005847162,0.000015558797,0.000003505688,0.0000021380824,0.00001077129,0.0001994158,0.0001759541,0.0013794582,0.89835894,0.00019207888,0.09959785],"study_design_scores_gemma":[0.00016288518,0.00023381658,0.00043642355,0.000020763015,5.6068507e-7,0.000018430414,0.000004347595,0.38158745,0.0037516518,0.6135195,0.00007837802,0.0001858332],"about_ca_topic_score_codex":0.000003480337,"about_ca_topic_score_gemma":1.6722554e-7,"teacher_disagreement_score":0.83491457,"about_ca_system_score_codex":0.00010039095,"about_ca_system_score_gemma":0.00014555859,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W2126829018","doi":"10.1016/j.disc.2005.03.020","title":"Rebuilding convex sets in graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Combinatorics; Mathematics; Convex hull; Neighbourhood (mathematics); Convex set; Vertex (graph theory); Wheel graph; Discrete mathematics; Independent set; Chordal graph; Distance; Graph; Graph power; Regular polygon; Line graph; Geometry; Convex optimization","score_opus":0.026380368166790867,"score_gpt":0.32054564366337096,"score_spread":0.2941652754965801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126829018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20114599,0.0002752962,0.7789472,0.0017200668,0.00011244375,0.00046816235,0.000004776032,0.00031328466,0.017012777],"genre_scores_gemma":[0.669961,0.000022485157,0.32962176,0.00012312755,0.000015585238,0.000020664447,0.0000012576055,0.00001621895,0.00021791879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985467,0.000059948674,0.0003222102,0.00029245354,0.00035961717,0.00041902962],"domain_scores_gemma":[0.998827,0.00022741532,0.00008208255,0.0007239772,0.00004081638,0.00009873028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064213277,0.00014463771,0.00021234486,0.0002514048,0.000071824965,0.00010515599,0.0009834957,0.000052274892,0.000028693134],"category_scores_gemma":[0.00013929355,0.00012750307,0.00006869683,0.000680031,0.00008156351,0.00053679966,0.00030754338,0.00021478141,0.00012669674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022665872,0.000056138142,0.00027648843,0.00004267762,0.0000072611647,0.000016456477,0.0023439752,0.0002549627,0.00067203783,0.9874189,0.00012403233,0.008784835],"study_design_scores_gemma":[0.0003930147,0.000034698605,0.00023617629,0.00009488331,0.000002537776,0.000026218435,0.00024010536,0.20026344,0.0035863544,0.7935828,0.0012647957,0.00027498175],"about_ca_topic_score_codex":0.0000017828137,"about_ca_topic_score_gemma":0.0000092456485,"teacher_disagreement_score":0.468815,"about_ca_system_score_codex":0.000047100086,"about_ca_system_score_gemma":0.000025113568,"threshold_uncertainty_score":0.5199424},"labels":[],"label_agreement":null},{"id":"W2127188248","doi":"10.1016/j.dam.2007.09.023","title":"Minimum cost homomorphisms to semicomplete multipartite digraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Multipartite; Combinatorics; Mathematics; Bipartite graph; Discrete mathematics; Graph; Directed graph; Graph homomorphism; Line graph; Voltage graph","score_opus":0.0414669072239449,"score_gpt":0.28795422467880716,"score_spread":0.24648731745486224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127188248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06559129,0.000035803885,0.91920257,0.00026462457,0.000098509554,0.0012120457,0.000025840043,0.00041089178,0.013158447],"genre_scores_gemma":[0.5859754,0.000023569359,0.41274512,0.00040880972,0.000044665725,0.00034324866,0.000010955228,0.000049302398,0.0003989043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735075,0.000030217263,0.0004950155,0.00062905933,0.00070150197,0.00079345045],"domain_scores_gemma":[0.99745536,0.00033847408,0.00014472459,0.0015409224,0.000098760676,0.00042178627],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035088474,0.00033370656,0.00042998663,0.0002841436,0.0003653947,0.0001077934,0.0017459681,0.000082344886,0.000030411047],"category_scores_gemma":[0.00008256431,0.0002986148,0.00013462652,0.0010592013,0.00024419924,0.00025937855,0.00070637517,0.00026103776,0.0008471151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028336563,0.00019067529,0.000053890126,0.00007509635,0.000047672722,0.00007060928,0.005427134,0.00036237738,0.05406011,0.9347873,0.0018247998,0.003072009],"study_design_scores_gemma":[0.0035128787,0.0004077732,0.0008296107,0.00021527083,0.00004808174,0.00045314291,0.0012075858,0.087709874,0.11775708,0.7564551,0.028318087,0.0030855082],"about_ca_topic_score_codex":0.0000023662692,"about_ca_topic_score_gemma":0.0000025385107,"teacher_disagreement_score":0.52038413,"about_ca_system_score_codex":0.000049952647,"about_ca_system_score_gemma":0.00004726319,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W2127629780","doi":"10.1002/jgt.21755","title":"On the Polarity and Monopolarity of Graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Pathwidth; Indifference graph; Cograph; Strong perfect graph theorem; Maximal independent set; 1-planar graph; Modular decomposition; Discrete mathematics; Split graph; Metric dimension; Bipartite graph; Time complexity; Line graph; Graph","score_opus":0.015333792843876674,"score_gpt":0.25951331588194154,"score_spread":0.24417952303806487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127629780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92869776,0.00095631316,0.067342766,0.0015669286,0.00017122662,0.00018652662,0.0000021818312,0.000014456046,0.0010618202],"genre_scores_gemma":[0.9959878,0.00010429451,0.0035523775,0.00029325884,0.000017208245,0.0000025435381,5.1750813e-8,0.0000072620214,0.000035222834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980726,0.000688856,0.0003785066,0.000149376,0.00047162204,0.00023901113],"domain_scores_gemma":[0.9970017,0.0016161405,0.00036648128,0.0005287187,0.00034660712,0.000140334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031323452,0.00012577012,0.000243692,0.00039519134,0.00016185631,0.00008488329,0.0012157642,0.00005922075,0.000050668554],"category_scores_gemma":[0.00049035705,0.000073361574,0.00018589835,0.0005704529,0.0005050318,0.00066793844,0.00019885713,0.0005868696,0.000006056721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050992836,0.000077021694,0.00164244,0.000008189026,0.000052380947,0.0000050608196,0.00027596502,0.000004607614,0.0041626683,0.98574716,0.00017664186,0.0077968715],"study_design_scores_gemma":[0.00023454528,0.0003207083,0.019839989,0.000031129886,0.000006765626,0.00005457601,0.00012377252,0.000088101,0.0036007168,0.9755849,0.00004036538,0.000074430194],"about_ca_topic_score_codex":0.000013544591,"about_ca_topic_score_gemma":0.0000011215096,"teacher_disagreement_score":0.06729,"about_ca_system_score_codex":0.00001220742,"about_ca_system_score_gemma":0.000043480013,"threshold_uncertainty_score":0.29915982},"labels":[],"label_agreement":null},{"id":"W2127787106","doi":"10.1016/j.dam.2011.03.023","title":"Vertex splitting and the recognition of trapezoid graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph; Discrete mathematics","score_opus":0.040049433078991906,"score_gpt":0.25853679108964805,"score_spread":0.21848735801065616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127787106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111130804,0.0001360091,0.82078385,0.00008453818,0.000053988737,0.0007835555,0.0000059254985,0.00012180459,0.066899545],"genre_scores_gemma":[0.76343066,0.000044810153,0.23639642,0.000041578485,0.0000048376505,0.00005196451,0.0000013669558,0.000012072534,0.000016292477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901116,0.000036698722,0.00029604722,0.00020687527,0.0002391687,0.00021005957],"domain_scores_gemma":[0.9988186,0.00040327132,0.00016339612,0.00051409,0.000048742328,0.000051919258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008230429,0.000117515,0.00021516536,0.000081267826,0.00010450205,0.0000323431,0.00056040025,0.00003930512,0.000014057834],"category_scores_gemma":[0.00006750667,0.00007602584,0.00006190689,0.00031559088,0.00038582136,0.00014396402,0.00021339729,0.00013152235,0.000013865011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002773462,0.00002934497,0.000005631453,0.00007695613,0.00002113952,7.540395e-7,0.006155806,3.4179905e-7,0.0015480213,0.9721734,0.0000054212283,0.019955453],"study_design_scores_gemma":[0.00060694414,0.000024330742,0.00006281582,0.000029198778,0.000014477908,0.000007689475,0.00079753617,0.0038894406,0.012855083,0.98160356,0.000008341799,0.0001005754],"about_ca_topic_score_codex":0.0000028727302,"about_ca_topic_score_gemma":8.307444e-7,"teacher_disagreement_score":0.6522999,"about_ca_system_score_codex":0.000004619513,"about_ca_system_score_gemma":0.0000116184865,"threshold_uncertainty_score":0.31002438},"labels":[],"label_agreement":null},{"id":"W2128660769","doi":"10.1017/s0963548308009140","title":"Graph Colouring with No Large Monochromatic Components","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Bounded function; Degree (music); Discrete mathematics; Planar graph; Monochromatic color; Physics","score_opus":0.033064358270159085,"score_gpt":0.2590236197809189,"score_spread":0.22595926151075985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128660769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6476296,0.00008005257,0.34975007,0.00007748826,0.0003034172,0.00055729767,0.0000011699436,0.0004972126,0.001103683],"genre_scores_gemma":[0.9464346,0.0000070522924,0.0533467,0.000063300526,0.00003080398,0.000019929583,0.0000038161734,0.000029531364,0.0000642346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962265,0.0003832036,0.00052782096,0.0009443215,0.00088222674,0.0010359082],"domain_scores_gemma":[0.99683434,0.0005672509,0.00023723199,0.0014610449,0.0005988065,0.0003013116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013584695,0.00035282658,0.00047503307,0.00024191514,0.0011384264,0.00011368531,0.0019275636,0.00009871941,0.000006217297],"category_scores_gemma":[0.00029720974,0.00032610976,0.0001230812,0.0017567109,0.00029916887,0.0006249393,0.0013111713,0.00058902317,0.00009383551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000785582,0.002130959,0.17613636,0.00046601903,0.000118202275,0.00033232305,0.0026093093,0.0026932093,0.0007859118,0.8132501,0.00017818583,0.0012208407],"study_design_scores_gemma":[0.003471899,0.0008427723,0.0668993,0.00022995702,0.0000123953005,0.00033345382,0.00003866493,0.25587657,0.0013822948,0.66937286,0.00042164623,0.0011182161],"about_ca_topic_score_codex":0.00001227114,"about_ca_topic_score_gemma":0.000001690285,"teacher_disagreement_score":0.29880503,"about_ca_system_score_codex":0.00026950106,"about_ca_system_score_gemma":0.00015481762,"threshold_uncertainty_score":0.9999191},"labels":[],"label_agreement":null},{"id":"W2128803128","doi":"10.1002/jgt.20602","title":"Automorphism group and diameter of a graph","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph automorphism; Automorphism; Automorphism group; Graph; Edge-transitive graph; Vertex-transitive graph; Symmetric graph; Upper and lower bounds; Discrete mathematics; Order (exchange); Voltage graph; Line graph","score_opus":0.028883853005037145,"score_gpt":0.2597567527243919,"score_spread":0.23087289971935476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128803128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3872146,0.0024555647,0.6081509,0.00007266611,0.00034495618,0.00014422709,0.000004432007,0.000036368237,0.0015763117],"genre_scores_gemma":[0.9405576,0.0002863707,0.058964625,0.00011378879,0.000031869295,0.0000026884868,1.5477325e-7,0.000010143179,0.000032743024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981274,0.00043866644,0.00050992693,0.00019996369,0.0004319041,0.0002921253],"domain_scores_gemma":[0.9982049,0.00049827737,0.00048530824,0.00039816622,0.00021139756,0.00020196379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025774506,0.00015498648,0.00035063457,0.0006667105,0.00007611454,0.000029461744,0.0010616195,0.00007008327,0.000047295427],"category_scores_gemma":[0.0001213485,0.000106658306,0.00025165753,0.00067995803,0.00045095952,0.0007419963,0.0002256799,0.00036169114,0.0000021632975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032070602,0.0002216141,0.0027256291,0.000030634103,0.00016914471,0.00013311718,0.002107422,0.0000016849297,0.014259853,0.9331186,0.00008594506,0.046825677],"study_design_scores_gemma":[0.0005560377,0.0007187392,0.013254377,0.00006575694,0.000021520218,0.0003017857,0.000102150894,0.000035450114,0.005774499,0.9788803,0.00015195845,0.00013742059],"about_ca_topic_score_codex":0.0000031347365,"about_ca_topic_score_gemma":0.0000017212711,"teacher_disagreement_score":0.553343,"about_ca_system_score_codex":0.000011493071,"about_ca_system_score_gemma":0.000031622163,"threshold_uncertainty_score":0.43493995},"labels":[],"label_agreement":null},{"id":"W2128954556","doi":"10.1016/j.jctb.2005.09.007","title":"Augmenting chains in graphs without a skew star","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Skew; Star (game theory); Computer science; Mathematics; Combinatorics; Telecommunications","score_opus":0.012703002840513162,"score_gpt":0.2792198242773306,"score_spread":0.26651682143681743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128954556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91516554,0.0012463923,0.07088275,0.0021441584,0.005653434,0.00040314338,0.0000023647215,0.00011343699,0.004388757],"genre_scores_gemma":[0.98089486,0.00010138219,0.018116865,0.000102620645,0.00040884735,0.0000048102934,2.3282804e-7,0.00001995882,0.00035044074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972825,0.0006104248,0.00069272675,0.0002243513,0.00069752545,0.0004924755],"domain_scores_gemma":[0.99828637,0.00033571242,0.00045321207,0.00044184286,0.00029675555,0.00018610487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038808037,0.0001983006,0.00041920398,0.00055376906,0.00014829106,0.0001546857,0.0014464153,0.00008276473,0.000047936377],"category_scores_gemma":[0.0004275333,0.00017175691,0.0001705046,0.00084066385,0.00018442993,0.0023036262,0.00028853372,0.00062087656,0.000009436454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004982689,0.00015628278,0.0006702636,0.0000101394035,0.000036135854,0.000063174535,0.0011837424,0.00008751462,0.0012742726,0.9879134,0.000052286854,0.00805448],"study_design_scores_gemma":[0.001901702,0.00051024323,0.00034054252,0.00008248175,0.0000061530536,0.00012152362,0.00020659232,0.00023738321,0.0050727837,0.9822872,0.009038307,0.0001950412],"about_ca_topic_score_codex":0.0000015761173,"about_ca_topic_score_gemma":0.0000046252667,"teacher_disagreement_score":0.06572928,"about_ca_system_score_codex":0.00014326234,"about_ca_system_score_gemma":0.00018707958,"threshold_uncertainty_score":0.70040435},"labels":[],"label_agreement":null},{"id":"W2129430342","doi":"10.1016/j.dam.2013.04.026","title":"Finding a smallest odd hole in a claw-free graph using global structure","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Claw; Mathematics; Lemma (botany); Line graph; Graph; Discrete mathematics","score_opus":0.02756508440387017,"score_gpt":0.29294261870309146,"score_spread":0.2653775342992213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129430342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37219235,0.000045211673,0.622179,0.000116616306,0.000058390764,0.00072340854,0.000019607502,0.00011964626,0.0045458125],"genre_scores_gemma":[0.6086127,0.0000029975886,0.39121923,0.00006345324,0.000020637875,0.000044090757,0.0000033216888,0.000018113837,0.000015433567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782336,0.000032733828,0.00043068087,0.00049621623,0.00051859266,0.00069842214],"domain_scores_gemma":[0.998107,0.0001415512,0.00016701511,0.001362078,0.00005860215,0.0001637322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027026737,0.0002879419,0.00035396917,0.00019293616,0.00015207475,0.00029683026,0.0019586745,0.00013197052,0.000058310212],"category_scores_gemma":[0.000082245046,0.00025277838,0.000083658335,0.0012200765,0.00015183026,0.00035388864,0.0010014584,0.00031512187,0.000048305174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005226595,0.00004864739,0.00030030153,0.00010335955,0.000020566229,0.0000131923125,0.0010576466,0.0012145088,0.012368647,0.98312336,0.00008654717,0.0016579792],"study_design_scores_gemma":[0.00055209844,0.000018725825,0.0004066464,0.000059660568,0.0000056905005,0.000018558614,0.00046183003,0.067350924,0.0009674492,0.9298389,0.000014782199,0.00030473823],"about_ca_topic_score_codex":0.000029182585,"about_ca_topic_score_gemma":0.00004694645,"teacher_disagreement_score":0.23642035,"about_ca_system_score_codex":0.00012292851,"about_ca_system_score_gemma":0.000059387126,"threshold_uncertainty_score":0.99999243},"labels":[],"label_agreement":null},{"id":"W2129541994","doi":"10.4171/aihpd/31","title":"The phase transition in random regular exact cover","year":2016,"lang":"en","type":"preprint","venue":"Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Combinatorics; Satisfiability; Mathematics; Cover (algebra); Star (game theory); Discrete mathematics; Random variable; Statistics; Mathematical analysis","score_opus":0.021619521067009765,"score_gpt":0.301906142497162,"score_spread":0.28028662143015226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129541994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05845794,0.0024174247,0.92773145,0.0032092368,0.0017871724,0.0009167494,0.00012795025,0.00017195882,0.0051801302],"genre_scores_gemma":[0.9965513,0.0022582558,0.00019272378,0.00015954158,0.00019490212,0.00024888694,0.000034331886,0.000036874353,0.00032320202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972532,0.0004389948,0.00050527346,0.0007757716,0.00033990823,0.00068686984],"domain_scores_gemma":[0.99677825,0.0011256486,0.0002716646,0.0013092685,0.0003058874,0.00020927399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082613865,0.0004805591,0.0004951775,0.0002407808,0.0007560873,0.0005927589,0.0013520711,0.00017742104,0.000005018602],"category_scores_gemma":[0.000092262664,0.0003392484,0.00033051777,0.00049474736,0.00038291345,0.0009513243,0.0008765186,0.0013724071,0.000022652099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021493302,0.00060843857,0.00004703173,0.000072709874,0.00019664103,0.000050542163,0.002104071,0.0008276638,0.0007806875,0.96311265,0.0005928778,0.03139174],"study_design_scores_gemma":[0.0024471574,0.000101363046,0.00003962927,0.00033049134,0.000015892068,0.000045008863,0.000108923654,0.029754562,0.0017956898,0.9342574,0.030697733,0.00040618857],"about_ca_topic_score_codex":0.000032667154,"about_ca_topic_score_gemma":0.000023845114,"teacher_disagreement_score":0.93809336,"about_ca_system_score_codex":0.0003088646,"about_ca_system_score_gemma":0.0004341122,"threshold_uncertainty_score":0.99990594},"labels":[],"label_agreement":null},{"id":"W2130144906","doi":"","title":"Layered Separators in Minor-Closed Families with Applications","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Planar graph; Bounded function; Mathematics; Upper and lower bounds; Discrete mathematics; Minor (academic); Treewidth; 1-planar graph; Book embedding; Graph; Pathwidth; Line graph","score_opus":0.054034818373566405,"score_gpt":0.21215919077157283,"score_spread":0.15812437239800642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130144906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42642155,0.00005453271,0.56869256,0.000047978716,0.00005409752,0.0008567243,0.000010574029,0.00019312114,0.0036688726],"genre_scores_gemma":[0.99214584,0.00011227842,0.0059526884,0.00004010372,0.00002228378,0.00002851668,0.000011266256,0.000020586773,0.001666421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978301,0.00017910973,0.00017990649,0.0012008607,0.00013671817,0.0004733154],"domain_scores_gemma":[0.99756277,0.00015904872,0.0001599232,0.001738849,0.00019274474,0.00018666251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018967853,0.00031069564,0.00032438317,0.0006423201,0.00012529646,0.00011238022,0.0024756915,0.00021168013,0.000023913213],"category_scores_gemma":[0.000012967486,0.00032114214,0.00009747575,0.0015589583,0.00025705126,0.0004880615,0.0015847962,0.00067605375,0.000222225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005489732,0.00017883634,0.01517468,0.000090934955,0.00007827842,0.00020316606,0.00038112677,0.18627681,0.00013304244,0.7955453,0.00011856788,0.0017643962],"study_design_scores_gemma":[0.0021432978,0.0001933435,0.012829163,0.00020087817,0.000042667667,0.000011187099,0.0007723144,0.34066612,0.0010483206,0.63654524,0.0037968548,0.0017505954],"about_ca_topic_score_codex":0.00020650779,"about_ca_topic_score_gemma":0.00016192789,"teacher_disagreement_score":0.5657243,"about_ca_system_score_codex":0.0002056933,"about_ca_system_score_gemma":0.0002445861,"threshold_uncertainty_score":0.99992406},"labels":[],"label_agreement":null},{"id":"W213041943","doi":"10.1016/s0012-365x(00)00009-1","title":"The complexity of H-colouring of bounded degree graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degree (music); Bounded function; Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.0813376872937042,"score_gpt":0.3177632359906591,"score_spread":0.23642554869695487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W213041943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6421498,0.0003587897,0.31471404,0.0006673668,0.00009576022,0.00068338367,0.000020386358,0.00013579032,0.041174702],"genre_scores_gemma":[0.87421197,0.00005364028,0.12532498,0.0000106547195,0.0000058879173,0.000010925221,7.8504456e-7,0.000011440932,0.0003697516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986339,0.00008151475,0.00040603528,0.0001598396,0.00044245523,0.0002762058],"domain_scores_gemma":[0.9983264,0.00040261704,0.00017210787,0.00094701146,0.00009591293,0.000055925906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006528539,0.00011078424,0.00022968103,0.00006253176,0.00018075207,0.00004946714,0.0014044787,0.00003196726,0.000042913824],"category_scores_gemma":[0.00009705484,0.000073516625,0.00012090754,0.00045989046,0.000935276,0.00016126019,0.00020136799,0.00012068937,0.00001378809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009817887,0.00004661098,0.00005239936,0.000073240146,0.00002402034,0.0000013417924,0.0010462827,0.000029886245,0.0005293278,0.9899749,0.000019416993,0.008192718],"study_design_scores_gemma":[0.0001650848,0.000058490645,0.00046334515,0.000046200956,0.0000050603494,0.000006078488,0.00014126231,0.016149119,0.0080720065,0.9746463,0.00016231812,0.000084786334],"about_ca_topic_score_codex":0.0000064622213,"about_ca_topic_score_gemma":0.00001088692,"teacher_disagreement_score":0.23206216,"about_ca_system_score_codex":0.000012205895,"about_ca_system_score_gemma":0.00003119231,"threshold_uncertainty_score":0.34460634},"labels":[],"label_agreement":null},{"id":"W2130764977","doi":"10.1016/j.jctb.2007.11.003","title":"A weaker version of Lovász' path removal conjecture","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Graph; Existential quantification; Path (computing); Discrete mathematics; Computer science","score_opus":0.011137663498495029,"score_gpt":0.24954757915373396,"score_spread":0.23840991565523895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130764977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8948021,0.001533226,0.08409245,0.00081260386,0.011168583,0.00030760287,0.00000925953,0.00008023826,0.0071939463],"genre_scores_gemma":[0.9908142,0.00020976807,0.008121981,0.000045517812,0.00034611553,8.7563905e-7,5.11599e-7,0.000016525404,0.00044450106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975933,0.0005306449,0.00055681146,0.00018142043,0.00084206904,0.0002957943],"domain_scores_gemma":[0.99769473,0.0004585805,0.0005723608,0.0005019457,0.00060363614,0.00016876309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577848,0.00017518802,0.0004532258,0.0002530187,0.00017701005,0.00003130937,0.0012554943,0.00011703114,0.000076431876],"category_scores_gemma":[0.00050468696,0.00013967522,0.0002444639,0.00057980756,0.0004213871,0.0011707691,0.00027193746,0.00048356227,0.000010129998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001674444,0.00014129392,0.00013210908,0.000018176508,0.00006670602,0.00061700994,0.0009894164,0.000054588018,0.0052385214,0.9886545,0.0010155356,0.0013977126],"study_design_scores_gemma":[0.0021612975,0.0016523827,0.00021898185,0.00007100454,0.000012212665,0.002623703,0.00016119974,0.000029735707,0.024915375,0.9429146,0.025063995,0.00017550771],"about_ca_topic_score_codex":9.1394196e-7,"about_ca_topic_score_gemma":9.211054e-8,"teacher_disagreement_score":0.096012115,"about_ca_system_score_codex":0.00006577939,"about_ca_system_score_gemma":0.00029930362,"threshold_uncertainty_score":0.569579},"labels":[],"label_agreement":null},{"id":"W2130919080","doi":"10.5555/545381.545431","title":"Polynomial time recognition of P4-structure","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Hypergraph; Combinatorics; Graph; Time complexity; Mathematics; Path (computing); Discrete mathematics; Computer science","score_opus":0.024670916748689205,"score_gpt":0.2517029734564466,"score_spread":0.2270320567077574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130919080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52525955,0.00027926837,0.30176967,0.0021777987,0.00047891785,0.00057817716,0.000049192473,0.00060010585,0.16880733],"genre_scores_gemma":[0.93097454,0.000007232641,0.06496751,0.00012512156,0.00004990479,0.0000021804053,0.0000022046443,0.0000063130733,0.0038650003],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993484,0.000044437646,0.00010690192,0.00016939435,0.00017294826,0.0001579188],"domain_scores_gemma":[0.99949443,0.00006312494,0.000033589098,0.00029901814,0.000060458362,0.000049395778],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007830345,0.0000567286,0.000080691985,0.000097958284,0.000035016084,0.000019848327,0.0004268337,0.000036690955,0.0019192956],"category_scores_gemma":[0.0000356609,0.000048100283,0.000034454893,0.00030882322,0.00005435188,0.00030264127,0.00010694961,0.00008125643,0.00040232818],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027217357,0.00011006695,0.00020133296,0.000020044312,0.000029394567,0.0000139612175,0.0005704002,0.0000433445,0.22467788,0.010524468,0.030569589,0.7332123],"study_design_scores_gemma":[0.0016636626,0.00056661933,0.001459766,0.00003705444,0.000008350506,0.00010895587,0.000023754075,0.13828275,0.6969846,0.1488845,0.011290577,0.0006894459],"about_ca_topic_score_codex":0.0000036898305,"about_ca_topic_score_gemma":0.0000012372112,"teacher_disagreement_score":0.73252285,"about_ca_system_score_codex":0.000010410669,"about_ca_system_score_gemma":0.000005913429,"threshold_uncertainty_score":0.9989931},"labels":[],"label_agreement":null},{"id":"W2131358503","doi":"10.1016/j.ic.2006.09.005","title":"Towards a dichotomy theorem for the counting constraint satisfaction problem","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Discrete mathematics; Counting problem; Homomorphism; Complexity of constraint satisfaction; Combinatorics; Time complexity; Class (philosophy); Constraint (computer-aided design); Constraint graph; Set (abstract data type); Constraint satisfaction dual problem; Constraint satisfaction; Local consistency; Computer science","score_opus":0.013618246427346062,"score_gpt":0.27892914844829203,"score_spread":0.265310902020946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131358503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009397312,0.0000314538,0.98665285,0.0007936696,0.00008367066,0.00055817916,0.000004042428,0.00011027859,0.0023685559],"genre_scores_gemma":[0.95110136,0.000006374371,0.048539996,0.0002145487,0.000028657838,0.00008003114,0.000016435382,0.0000026290663,0.00000994445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930423,0.000030005795,0.00023579338,0.00008745963,0.00020353677,0.00013897177],"domain_scores_gemma":[0.99932086,0.00022615363,0.0001334817,0.00009380203,0.00020344359,0.000022231847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052591553,0.00007193493,0.000060264967,0.000093189876,0.0003151383,0.00037168057,0.00012856255,0.000029062403,0.0000021977635],"category_scores_gemma":[0.000028139099,0.000052511736,0.000026975875,0.00020878586,0.00007244126,0.0015873589,0.00004263943,0.000069842965,0.0000075605776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068677464,0.000002782664,0.00014083798,0.000014855412,0.0000036705992,5.5375644e-8,0.00034337438,0.0053155995,0.000027310649,0.5300096,0.00010543714,0.46402955],"study_design_scores_gemma":[0.0004622655,0.000037248108,0.01192595,0.000010280005,0.0000031316688,0.000014928755,0.00020031446,0.67609096,0.0001657375,0.30693763,0.0040661693,0.00008537693],"about_ca_topic_score_codex":0.00005651456,"about_ca_topic_score_gemma":0.000010243981,"teacher_disagreement_score":0.9417041,"about_ca_system_score_codex":0.000029498826,"about_ca_system_score_gemma":0.000045370838,"threshold_uncertainty_score":0.3584124},"labels":[],"label_agreement":null},{"id":"W2131488553","doi":"10.1016/j.tcs.2010.12.044","title":"Local 7-coloring for planar subgraphs of unit disk graphs","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Planar graph; Unit disk graph; Mathematics; Vertex (graph theory); Complete coloring; Graph factorization; Edge coloring; Graph coloring; Fractional coloring; Graph; Discrete mathematics; Graph power; Computer science; Line graph","score_opus":0.017918212958136517,"score_gpt":0.2962133064616216,"score_spread":0.2782950935034851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131488553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13820617,0.000010927148,0.8595087,0.00026370294,0.0006545681,0.00032530702,0.0000061160035,0.00013941697,0.0008851242],"genre_scores_gemma":[0.76260906,0.000002237828,0.23722653,0.00008696778,0.000037467562,0.000021600512,7.8585725e-7,0.000010366824,0.000004966393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968626,0.00009043457,0.00037443775,0.00086618145,0.00088754355,0.0009188171],"domain_scores_gemma":[0.99662846,0.0010543568,0.000102803846,0.0013360943,0.00045916278,0.00041910165],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027896801,0.00022257006,0.00030283228,0.0005451096,0.0004733379,0.0001844752,0.0047169914,0.00008581743,0.000019181763],"category_scores_gemma":[0.00023117708,0.00018499531,0.00015156266,0.002437173,0.00896564,0.0007866013,0.0008349016,0.00045282985,0.00001347096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034847286,0.000066203356,0.00026925164,0.000016240965,0.0000057163093,0.0000045179113,0.0001842035,0.000085283566,0.012131167,0.9563552,0.000008123579,0.030839238],"study_design_scores_gemma":[0.00031240427,0.00034571395,0.000988804,0.000015699014,0.0000036100625,0.000021153894,0.000010451372,0.18114734,0.044335883,0.7724968,0.00011428646,0.00020781912],"about_ca_topic_score_codex":0.0000037631357,"about_ca_topic_score_gemma":0.0000045844226,"teacher_disagreement_score":0.6244029,"about_ca_system_score_codex":0.000017242466,"about_ca_system_score_gemma":0.00016851824,"threshold_uncertainty_score":0.9937314},"labels":[],"label_agreement":null},{"id":"W2131690757","doi":"10.1016/j.disc.2006.04.037","title":"Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Steiner tree problem; Connectivity; Discrete mathematics; Path graph; Graph; Graph power; Line graph","score_opus":0.012587430546820573,"score_gpt":0.2672030840537653,"score_spread":0.2546156535069447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131690757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4323628,0.00076091825,0.55480236,0.0005653745,0.00017164806,0.0005220596,0.000021229887,0.00019058373,0.010603012],"genre_scores_gemma":[0.9327614,0.000023882616,0.06602236,0.000058375623,0.000036210524,0.00004522584,0.0000079332185,0.000032468968,0.0010121887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981272,0.000091455586,0.00046263277,0.00042297077,0.00041871506,0.00047697403],"domain_scores_gemma":[0.9987597,0.00025620556,0.00011150428,0.0007208296,0.000054528617,0.00009726678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004807961,0.00023296315,0.00031665416,0.0002121011,0.000074009,0.00014903721,0.0007113942,0.00006753045,0.00002072744],"category_scores_gemma":[0.00006523628,0.00019257626,0.000079398764,0.0005984443,0.00021531177,0.00051549444,0.00036776272,0.00022314923,0.000025666255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011893437,0.00013868249,0.0024276187,0.00023025653,0.000019477991,0.0001205173,0.0014230601,0.00022633429,0.00070815784,0.9921694,0.00055555935,0.0019690762],"study_design_scores_gemma":[0.00063698407,0.000072270006,0.0017729503,0.00020138889,0.000008403673,0.00004117847,0.00042620936,0.03811708,0.0006260509,0.9571813,0.0005305776,0.00038562695],"about_ca_topic_score_codex":0.000047529367,"about_ca_topic_score_gemma":0.00015122598,"teacher_disagreement_score":0.5003986,"about_ca_system_score_codex":0.000040396528,"about_ca_system_score_gemma":0.00001988071,"threshold_uncertainty_score":0.7853032},"labels":[],"label_agreement":null},{"id":"W2131850161","doi":"10.1007/978-3-319-15579-1_53","title":"Bounding Clique-Width via Perfect Graphs","year":2015,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Combinatorics; Mathematics; Treewidth; Split graph; Block graph; Cograph; Discrete mathematics; Clique-sum; Chordal graph; Bounding overwatch; Induced subgraph; Graph isomorphism; Induced subgraph isomorphism problem; Perfect graph; Pathwidth; Graph; Line graph; 1-planar graph; Computer science; Vertex (graph theory); Voltage graph","score_opus":0.031815726654958944,"score_gpt":0.3255480907228837,"score_spread":0.29373236406792474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131850161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02212161,0.0010652872,0.96906626,0.0014266281,0.005136171,0.00065895653,0.000004128516,0.0004049555,0.000115988194],"genre_scores_gemma":[0.5483904,0.000025095247,0.45081154,0.00048120148,0.00022437458,0.00003821377,0.0000030378174,0.000023146522,0.0000029952735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927012,0.00052212604,0.00061616173,0.00270059,0.0018288895,0.001631074],"domain_scores_gemma":[0.9945816,0.0009217585,0.00028772757,0.0030375754,0.00064742734,0.0005239026],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.005211608,0.00066716823,0.0006954538,0.0017530152,0.00046112586,0.0014335503,0.0091138035,0.00040911022,0.000009670886],"category_scores_gemma":[0.00068483816,0.0006242596,0.00022819146,0.0045344955,0.0016743125,0.0012217587,0.010237468,0.002456915,0.00005340529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015367224,0.00010692792,0.0028565004,0.000108719214,0.000015712461,0.00017473543,0.0021498834,0.28728274,0.0009802466,0.01432638,0.00002624705,0.6919565],"study_design_scores_gemma":[0.000158186,0.00010994885,0.00038504755,0.00015351242,0.0000024554531,0.000064719155,2.4418603e-7,0.4655015,0.0028958367,0.5302262,0.00007191301,0.00043049047],"about_ca_topic_score_codex":0.000099473866,"about_ca_topic_score_gemma":0.00009153499,"teacher_disagreement_score":0.69152606,"about_ca_system_score_codex":0.00084267627,"about_ca_system_score_gemma":0.0016202015,"threshold_uncertainty_score":0.99984443},"labels":[],"label_agreement":null},{"id":"W2132277994","doi":"10.2178/jsl/1245158092","title":"A geometric zero-one law","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Zero (linguistics); Substructure; Combinatorics; Disjoint sets; Bounded function; Ball (mathematics); Graph; Order (exchange); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.03829468688421236,"score_gpt":0.30721491616127056,"score_spread":0.2689202292770582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132277994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046089076,0.0021031955,0.9273917,0.004629967,0.00034725873,0.00014105128,7.2304863e-7,0.000074435404,0.019222578],"genre_scores_gemma":[0.95949155,0.00013838106,0.038525496,0.0015422901,0.00014875391,6.498105e-7,9.55087e-8,0.000004991782,0.00014779148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825543,0.00012177816,0.0004086095,0.00016976745,0.00066249457,0.00038194127],"domain_scores_gemma":[0.99863625,0.0001819856,0.0002778325,0.00039495758,0.00029195283,0.00021704855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010832112,0.00011703686,0.00030414274,0.0006653997,0.00010198875,0.000116253745,0.0014408118,0.00006092328,0.00002545479],"category_scores_gemma":[0.00020665018,0.0000892941,0.00015434125,0.0017411974,0.00007576349,0.0007504704,0.000108991444,0.00040791,0.00006237085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022175562,0.0002062418,0.00011587792,0.0000047095323,0.000023237235,0.00016391031,0.00013559307,0.00016727496,0.004816855,0.9493928,0.00039951215,0.044551823],"study_design_scores_gemma":[0.0005751185,0.00092035905,0.0050801025,0.000027167467,0.000007059938,0.00055535045,0.0000119511415,0.00018136026,0.002728864,0.98760605,0.0021676458,0.00013895951],"about_ca_topic_score_codex":0.000001867626,"about_ca_topic_score_gemma":2.6546985e-7,"teacher_disagreement_score":0.9134025,"about_ca_system_score_codex":0.000065038235,"about_ca_system_score_gemma":0.000064657914,"threshold_uncertainty_score":0.36413077},"labels":[],"label_agreement":null},{"id":"W2132290920","doi":"10.1016/s0012-365x(99)00291-5","title":"Exponents of vertex-transitive digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Transitive relation; Conjecture; Exponent; Discrete mathematics; Abelian group; Integer (computer science); Order (exchange); Graph","score_opus":0.016401083506896945,"score_gpt":0.2788626426154422,"score_spread":0.26246155910854524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132290920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5053029,0.0001436002,0.4355282,0.00019139424,0.00007674471,0.00041998122,0.000019967301,0.00018044829,0.058136765],"genre_scores_gemma":[0.9456242,0.00004667918,0.053554744,0.00003277841,0.000006803014,0.000015334943,0.0000023879354,0.000015839694,0.00070125214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872667,0.00005595426,0.0002850799,0.00022880953,0.00041939388,0.0002840818],"domain_scores_gemma":[0.99891543,0.00017885109,0.000066441266,0.00068875414,0.0000626627,0.00008787122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024193618,0.00013317652,0.00022362774,0.00010508502,0.00005552536,0.000033583983,0.0008318311,0.000041492778,0.00012064358],"category_scores_gemma":[0.000037122965,0.000112283684,0.00010468776,0.00047019907,0.00014475218,0.00025456463,0.00007873957,0.00010952413,0.000058087113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004112155,0.00039886835,0.0002465786,0.00024743855,0.00011539495,0.000039176448,0.015050222,0.00014658007,0.008156853,0.9252883,0.00008170939,0.050187744],"study_design_scores_gemma":[0.00070869614,0.00020155172,0.00067154557,0.00020578061,0.000017325998,0.000026053474,0.00046586138,0.07231513,0.029824203,0.8948237,0.00033451256,0.0004056537],"about_ca_topic_score_codex":0.0000036477472,"about_ca_topic_score_gemma":0.0000010175759,"teacher_disagreement_score":0.44032127,"about_ca_system_score_codex":0.000011177367,"about_ca_system_score_gemma":0.000019644214,"threshold_uncertainty_score":0.45787957},"labels":[],"label_agreement":null},{"id":"W2132677029","doi":"10.1016/j.jctb.2008.03.006","title":"On the odd-minor variant of Hadwiger's conjecture","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Conjecture; Graph; Discrete mathematics","score_opus":0.016178644568518676,"score_gpt":0.25031874771390306,"score_spread":0.2341401031453844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132677029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80698293,0.0012152361,0.14975233,0.0065475255,0.018809028,0.0007838398,0.000014353548,0.00011123571,0.015783513],"genre_scores_gemma":[0.9977749,0.00007677324,0.0012840229,0.00016849555,0.00031300884,0.0000030439908,1.7895147e-7,0.000015246326,0.00036430548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973252,0.0008120286,0.0005510852,0.00017251461,0.0008368654,0.0003023494],"domain_scores_gemma":[0.9961569,0.0019523161,0.00059287646,0.00069415127,0.00047359732,0.00013020594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002325977,0.00018737826,0.0004109716,0.00019906664,0.0002838429,0.00005176582,0.0019546915,0.00009319355,0.00010995726],"category_scores_gemma":[0.0010904036,0.000112928356,0.00023565463,0.00054065784,0.00056472473,0.0006474958,0.00022246776,0.00061806757,0.000009411304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000857996,0.00013223098,0.000023711904,0.000006785278,0.00008060862,0.00024299516,0.0010470756,0.0000947105,0.0009774888,0.99505955,0.000938852,0.00053799315],"study_design_scores_gemma":[0.00087330333,0.0014959137,0.00011440208,0.000042335436,0.000008592713,0.00080461014,0.00011787582,0.000021951526,0.019144548,0.9729998,0.00425532,0.000121327175],"about_ca_topic_score_codex":0.0000011529457,"about_ca_topic_score_gemma":1.7546328e-7,"teacher_disagreement_score":0.190792,"about_ca_system_score_codex":0.000048413585,"about_ca_system_score_gemma":0.00027949584,"threshold_uncertainty_score":0.46050847},"labels":[],"label_agreement":null},{"id":"W2134206798","doi":"10.1016/j.ejc.2011.01.016","title":"On the asymptotic proportion of connected matroids","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Marsden Fund; Foundation for Research, Science and Technology","keywords":"Matroid; Mathematics; Combinatorics; Conjecture; Asymptotically optimal algorithm; Automorphism group; Discrete mathematics; Automorphism","score_opus":0.038056690377805034,"score_gpt":0.23923317974985886,"score_spread":0.20117648937205382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134206798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6783245,0.00013600169,0.29739517,0.0003206991,0.00077699975,0.00015973984,5.7263895e-7,0.000036885456,0.022849396],"genre_scores_gemma":[0.9980056,0.00001818942,0.001796661,0.000051099236,0.000019946681,3.436908e-7,8.293105e-8,0.0000143628995,0.00009368491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978644,0.00082160515,0.00045335412,0.000108042696,0.0005745862,0.00017797612],"domain_scores_gemma":[0.99809664,0.00022969797,0.0005560323,0.00045484575,0.00057220587,0.00009056536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024125266,0.000097261676,0.00015965097,0.000181174,0.00007807097,0.000028669585,0.0014188512,0.00001300464,0.000027152315],"category_scores_gemma":[0.0005024172,0.000061109204,0.00009913256,0.0005697821,0.00010884395,0.00024844543,0.00015031108,0.0003490627,0.00003376282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045517325,0.00016204389,0.0003577879,0.0000072107387,0.000023541656,0.00012607299,0.0004497641,0.000016726886,0.00062961894,0.9964927,0.00027810503,0.0014109416],"study_design_scores_gemma":[0.0013493389,0.0044377972,0.024620455,0.00015247813,0.00001970222,0.0002480057,0.00011852394,0.0006381242,0.020255035,0.9471554,0.0007798705,0.00022527459],"about_ca_topic_score_codex":2.0041092e-7,"about_ca_topic_score_gemma":2.436763e-8,"teacher_disagreement_score":0.31968108,"about_ca_system_score_codex":0.000029681505,"about_ca_system_score_gemma":0.000056705354,"threshold_uncertainty_score":0.26366022},"labels":[],"label_agreement":null},{"id":"W2134453562","doi":"10.1016/j.jctb.2019.07.001","title":"On Frank's conjecture on k-connected orientations","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Conjecture; Combinatorics; Vertex (graph theory); Orientation (vector space); Graph; Mathematics; Strongly connected component; Discrete mathematics; Geometry","score_opus":0.013716950753505304,"score_gpt":0.2898674251964509,"score_spread":0.2761504744429456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134453562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3828678,0.0012944961,0.40421882,0.0049874904,0.17500193,0.0028679548,0.00015216389,0.00052435056,0.028084984],"genre_scores_gemma":[0.9952809,0.00011139281,0.0023876932,0.00034290177,0.0011129469,0.00001712031,0.000009368938,0.0000606505,0.0006769924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546015,0.0013142182,0.00084869476,0.00055647834,0.0013441881,0.00047626792],"domain_scores_gemma":[0.99348456,0.0026107465,0.0012072648,0.0015192737,0.00092867855,0.00024950542],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020815595,0.0005009761,0.00090467645,0.00074010243,0.0002359805,0.00038177878,0.0030407424,0.0004637114,0.0001590047],"category_scores_gemma":[0.0016133408,0.0004125189,0.0005047614,0.0005703465,0.000251336,0.0006603678,0.0008655617,0.0029373665,0.00007960026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019679193,0.00023417063,0.000012585767,0.00004754995,0.00023043042,0.00011970382,0.0006873764,0.0067624506,0.000130081,0.9872009,0.0014448164,0.0011619896],"study_design_scores_gemma":[0.0018650661,0.002795102,0.00006860453,0.00033996368,0.00003096587,0.0000703499,0.00010493189,0.00008162916,0.0038007468,0.9856192,0.0048350105,0.00038845142],"about_ca_topic_score_codex":0.0000012070835,"about_ca_topic_score_gemma":3.0437582e-7,"teacher_disagreement_score":0.6124131,"about_ca_system_score_codex":0.00025447144,"about_ca_system_score_gemma":0.00071321195,"threshold_uncertainty_score":0.9998327},"labels":[],"label_agreement":null},{"id":"W2135081210","doi":"10.1016/s0095-8956(02)00023-0","title":"Bounds for mean colour numbers of graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Counterexample; Graph; Discrete mathematics; Split graph; Vertex (graph theory); Chordal graph; 1-planar graph","score_opus":0.014415090368387347,"score_gpt":0.2835429309123682,"score_spread":0.26912784054398087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135081210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43102017,0.0015496808,0.51510316,0.0007525548,0.029400641,0.001210031,0.000021589129,0.000119957636,0.020822208],"genre_scores_gemma":[0.98081535,0.000050591163,0.018580435,0.000042071308,0.00011383306,0.0000075417424,3.3071163e-7,0.000020851008,0.00036897595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976576,0.0005885678,0.0006445893,0.00017883298,0.000569361,0.0003610714],"domain_scores_gemma":[0.9968976,0.00093702995,0.00064114516,0.000447943,0.00089872745,0.00017760001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003899517,0.00017012688,0.0004610322,0.00027683465,0.00017316778,0.00008591965,0.0012046967,0.000093961586,0.00003178263],"category_scores_gemma":[0.0011016015,0.00014717286,0.00032449892,0.000629175,0.00034098097,0.001093544,0.000088572335,0.0002788419,0.0000017039869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084940426,0.00013110346,0.00010564846,0.000025336909,0.00009699184,0.000012150495,0.0006395627,0.000024862715,0.0018931483,0.9951521,0.00038268825,0.0006870068],"study_design_scores_gemma":[0.0017728724,0.0014406666,0.000021534039,0.000029221084,0.000016331982,0.00010686596,0.00036874608,0.000008237659,0.03119546,0.94633985,0.018560871,0.00013934582],"about_ca_topic_score_codex":7.158661e-7,"about_ca_topic_score_gemma":7.8445487e-7,"teacher_disagreement_score":0.5497952,"about_ca_system_score_codex":0.000060680664,"about_ca_system_score_gemma":0.00031211923,"threshold_uncertainty_score":0.6001535},"labels":[],"label_agreement":null},{"id":"W2135166946","doi":"10.1016/j.dam.2012.03.036","title":"Collective additive tree spanners for circle graphs and polygonal graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Tree (set theory); Spanning tree; Discrete mathematics","score_opus":0.021324002429040537,"score_gpt":0.28290842068083727,"score_spread":0.26158441825179674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135166946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032768715,0.00023838814,0.94114685,0.00017435996,0.00014128529,0.0016610867,0.00012327057,0.00025868654,0.023487369],"genre_scores_gemma":[0.72872764,0.000021673195,0.2701722,0.00012046208,0.00003714673,0.0005586672,0.000017642325,0.000043140346,0.00030140212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818015,0.000027943799,0.00027876635,0.00040189349,0.0003724808,0.0007387372],"domain_scores_gemma":[0.998163,0.00080445124,0.00014870337,0.0005141568,0.00008999285,0.0002796932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327573,0.00024557204,0.00032621273,0.00024708934,0.00031068275,0.00010341129,0.0005701624,0.00008828118,0.0000102841905],"category_scores_gemma":[0.00009812676,0.0002313366,0.00011890883,0.000673386,0.00028613897,0.00042302354,0.00028124914,0.00017504518,0.000017776194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032533488,0.00009861256,0.000032176576,0.000060386734,0.00007033893,7.670291e-7,0.005048553,0.0000027138267,0.0020661615,0.98226994,0.00033782533,0.00997996],"study_design_scores_gemma":[0.0007549375,0.00009690393,0.0007060329,0.000021978687,0.000026481031,0.000014373734,0.0014046674,0.0025382643,0.007880376,0.9858899,0.00030941266,0.00035668988],"about_ca_topic_score_codex":0.000001168166,"about_ca_topic_score_gemma":0.0000028260777,"teacher_disagreement_score":0.6959589,"about_ca_system_score_codex":0.0000646092,"about_ca_system_score_gemma":0.000081666454,"threshold_uncertainty_score":0.9433633},"labels":[],"label_agreement":null},{"id":"W2136175864","doi":"10.1007/s00493-015-3070-6","title":"Nonrepetitive colouring via entropy compression","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Mathematical proof; Discrete mathematics; Geometry","score_opus":0.031856152558521776,"score_gpt":0.29475177600056146,"score_spread":0.2628956234420397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136175864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028969502,0.00045908045,0.9533306,0.00076712976,0.001260886,0.00032396818,0.0000011192465,0.00045881202,0.014428936],"genre_scores_gemma":[0.988547,0.000010257858,0.010679209,0.00008496622,0.000033851473,0.000025902475,0.0000013474848,0.00001246711,0.000604954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838674,0.00018990763,0.00015599836,0.00037593354,0.00050020893,0.0003911997],"domain_scores_gemma":[0.9985034,0.00018114767,0.00006902974,0.00065862807,0.0002580204,0.00032976884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039183692,0.0001303259,0.00016820284,0.00012453954,0.00014539127,0.0000834391,0.0011304461,0.0000521914,0.000011984669],"category_scores_gemma":[0.00015692723,0.000120262695,0.000051304072,0.00059259194,0.00007772763,0.00044816264,0.0007642724,0.00023152422,0.00025391323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036012138,0.00021648643,0.0014048252,0.000007907192,0.000014201681,0.0001056098,0.0005869604,0.00006646179,0.0026065689,0.98496246,0.002440158,0.007552343],"study_design_scores_gemma":[0.0015850099,0.0004298131,0.0011871211,0.000033571305,0.0000036114748,0.000035510824,0.00006300936,0.018249568,0.023758426,0.92603993,0.0282704,0.00034403751],"about_ca_topic_score_codex":0.000007085982,"about_ca_topic_score_gemma":2.7022458e-7,"teacher_disagreement_score":0.95957756,"about_ca_system_score_codex":0.00016797087,"about_ca_system_score_gemma":0.00007804202,"threshold_uncertainty_score":0.49041703},"labels":[],"label_agreement":null},{"id":"W2136721967","doi":"10.1002/rsa.20648","title":"Justifying the small‐world phenomenon via random recursive trees","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Monash University","keywords":"Logarithm; Random graph; Combinatorics; Upper and lower bounds; Mathematical proof; Mathematics; Simple (philosophy); Computer science; Graph; Discrete mathematics","score_opus":0.025615070192616458,"score_gpt":0.28638147534731206,"score_spread":0.2607664051546956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136721967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020775325,0.008086613,0.98181695,0.0023227918,0.0019348698,0.0015787493,0.00007370942,0.00020361254,0.0019051452],"genre_scores_gemma":[0.8231622,0.0058884765,0.15799855,0.0010324868,0.0052921553,0.00097369414,0.00008222864,0.0002803042,0.0052899113],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960525,0.00065340014,0.0005487387,0.0012804177,0.0006318184,0.0008331098],"domain_scores_gemma":[0.9959011,0.0017415442,0.0003972443,0.0015080861,0.00019715654,0.00025488314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001170391,0.0006512144,0.00092416,0.0003626525,0.00072420354,0.00065001386,0.0024708717,0.00023463844,0.00005420596],"category_scores_gemma":[0.00014122394,0.0003586472,0.00033435647,0.0003366655,0.00053611875,0.00023419654,0.0025130322,0.001189737,0.000008756305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011203553,0.000025875328,0.000051822324,0.00016963528,0.00040856493,0.00007032244,0.001852347,0.00072984933,0.0004562121,0.09514233,0.00031561012,0.8996571],"study_design_scores_gemma":[0.009758369,0.00006703596,0.0003808431,0.00019425902,0.00006986571,0.00005879276,0.000067018475,0.011067229,0.00085072743,0.9714617,0.00535402,0.0006701343],"about_ca_topic_score_codex":0.00004452518,"about_ca_topic_score_gemma":0.00005442524,"teacher_disagreement_score":0.89898694,"about_ca_system_score_codex":0.00007814799,"about_ca_system_score_gemma":0.00011693095,"threshold_uncertainty_score":0.9998866},"labels":[],"label_agreement":null},{"id":"W2136941318","doi":"10.1016/j.disc.2015.09.021","title":"On Hilbert bases of cuts","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Subdivision; Semigroup; Discrete mathematics; Graph","score_opus":0.05055297230452935,"score_gpt":0.32561556219233206,"score_spread":0.27506258988780274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136941318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03561806,0.000059464128,0.9057603,0.00041676813,0.00012080545,0.00022075004,0.000007776441,0.00011384967,0.05768222],"genre_scores_gemma":[0.7777396,0.000005317513,0.22037064,0.0001342544,0.000023898769,0.000016486892,0.0000026635837,0.000021931384,0.0016852362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988678,0.000049041617,0.00021436327,0.0001760867,0.00048717065,0.0002055477],"domain_scores_gemma":[0.9985407,0.0003516562,0.00009555469,0.00076900754,0.00011347434,0.00012958601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041703056,0.00010387094,0.00017837784,0.00010500236,0.00002912633,0.00003339842,0.0007765367,0.000029608704,0.000013022619],"category_scores_gemma":[0.00051771395,0.00007954177,0.000059636805,0.00031034107,0.00008496751,0.00019343056,0.00022908306,0.00008744087,0.00010413144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065976146,0.00007758659,0.000028260665,0.00003817027,0.000009128568,0.000006113092,0.0011923207,0.00013808944,0.00016940833,0.9962081,0.0010741947,0.0010520725],"study_design_scores_gemma":[0.00027153047,0.00020823753,0.000015523363,0.000072714625,0.0000035494502,0.000008693079,0.00018109883,0.032861184,0.008671569,0.95684355,0.0007289686,0.00013337021],"about_ca_topic_score_codex":0.0000021489661,"about_ca_topic_score_gemma":8.38459e-7,"teacher_disagreement_score":0.7421215,"about_ca_system_score_codex":0.00002130209,"about_ca_system_score_gemma":0.00004729467,"threshold_uncertainty_score":0.32436195},"labels":[],"label_agreement":null},{"id":"W2137217287","doi":"10.37236/1588","title":"Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Plane (geometry); Graph; Spectrum (functional analysis); Colored; Face (sociological concept); Complete coloring; Fractional coloring; Discrete mathematics; Graph power; Physics; Geometry; Line graph","score_opus":0.01033061752458155,"score_gpt":0.26003673892479384,"score_spread":0.24970612140021228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137217287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88730294,0.004378978,0.10119846,0.004957932,0.00026123982,0.00031970048,6.693401e-7,0.000019354884,0.001560759],"genre_scores_gemma":[0.9987655,0.0010258607,0.000055401873,0.00006568222,0.00002259066,0.000002766551,2.210683e-7,0.000008625834,0.00005334745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973777,0.00049824856,0.00052813155,0.0001250147,0.000781241,0.00068965484],"domain_scores_gemma":[0.99807227,0.00075644825,0.0004233345,0.000591109,0.000101804115,0.000055032604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003397999,0.0001460798,0.00029825122,0.00030468675,0.000107929845,0.00004949352,0.0029211063,0.000046032623,0.000008840669],"category_scores_gemma":[0.00013668109,0.00008290875,0.00013608618,0.0018250139,0.00019015445,0.0002931575,0.00009914082,0.0010188334,0.0000041942785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042050793,0.00014808646,0.00042479113,0.000008760343,0.000037850925,0.000050153045,0.0008778473,0.00016008486,0.00044556212,0.997137,0.000042424555,0.00062537874],"study_design_scores_gemma":[0.0008567662,0.00082612736,0.0010906394,0.0000324812,0.000010817869,0.0011366477,0.0003044423,0.0005714256,0.0013069317,0.9934509,0.0003239613,0.00008890254],"about_ca_topic_score_codex":0.0000059215763,"about_ca_topic_score_gemma":0.000012326723,"teacher_disagreement_score":0.11146259,"about_ca_system_score_codex":0.0001464902,"about_ca_system_score_gemma":0.00038640975,"threshold_uncertainty_score":0.5428191},"labels":[],"label_agreement":null},{"id":"W2137430154","doi":"10.1016/j.disc.2008.03.021","title":"Edge-switching homomorphisms of edge-coloured graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Homomorphism; Vertex (graph theory); Isomorphism (crystallography); Discrete mathematics; Homomorphic encryption; Graph; Graph homomorphism; Corollary; Graph isomorphism; Line graph; Voltage graph; Computer science","score_opus":0.03286005786231506,"score_gpt":0.2848804775606165,"score_spread":0.25202041969830147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137430154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18044156,0.00018312695,0.8128857,0.00015111922,0.00015915134,0.000326179,0.000006893869,0.00017760484,0.0056686765],"genre_scores_gemma":[0.77222145,0.00004635467,0.22722901,0.00004048399,0.000021552032,0.00002323474,0.0000024686021,0.000027024373,0.00038843637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979874,0.00008604928,0.00049601146,0.00034633838,0.00063181634,0.00045238223],"domain_scores_gemma":[0.9979306,0.0003436345,0.0002530926,0.0011554817,0.00016511737,0.00015209267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000532437,0.0002180632,0.00040105285,0.00026308274,0.00023982629,0.000043744352,0.0015077649,0.00007974722,0.000027874576],"category_scores_gemma":[0.00023846742,0.00018496644,0.00018831075,0.00084144075,0.0002552195,0.00041203917,0.00044794718,0.0002581745,0.0000592102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008813496,0.00016481361,0.0002686089,0.0001386916,0.000047043246,0.00006232803,0.005632938,0.000066783876,0.0066589965,0.9849104,0.00029338663,0.0017471726],"study_design_scores_gemma":[0.0005516215,0.00016053717,0.0004743178,0.000110375375,0.000013663187,0.00017537961,0.00029427093,0.029454622,0.019634131,0.9485142,0.00023588432,0.00038099336],"about_ca_topic_score_codex":0.0000033292306,"about_ca_topic_score_gemma":0.0000012373666,"teacher_disagreement_score":0.5917799,"about_ca_system_score_codex":0.000025812846,"about_ca_system_score_gemma":0.000076239725,"threshold_uncertainty_score":0.75427127},"labels":[],"label_agreement":null},{"id":"W2137804648","doi":"10.1287/ijoc.2013.0589","title":"Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro","keywords":"Dominating set; Connected dominating set; Cardinality (data modeling); Algorithm; Mathematics; Branch and cut; Set (abstract data type); Branch and bound; Benders' decomposition; Strongly connected component; Graph; Mathematical optimization; Combinatorics; Computer science; Integer programming; Minimum spanning tree; Vertex (graph theory)","score_opus":0.02272631946703941,"score_gpt":0.3144781079620658,"score_spread":0.2917517884950264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137804648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13671775,0.00009346209,0.86099845,0.0013395885,0.00022805684,0.0003144755,0.0000022337967,0.00006224112,0.00024373211],"genre_scores_gemma":[0.9170832,0.000020954089,0.081887275,0.00074665813,0.00022136436,0.0000065268578,0.000001794007,0.000014954411,0.000017280732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983235,0.00009548725,0.00046437106,0.00026367602,0.0003542933,0.000498646],"domain_scores_gemma":[0.9960949,0.002883906,0.00032862634,0.00024191389,0.0002677812,0.00018289743],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002413242,0.00019058175,0.0002244395,0.0001978414,0.0013059286,0.00069101446,0.0006375012,0.00003990277,0.0000016782736],"category_scores_gemma":[0.00033430054,0.00012609115,0.0000781806,0.00023400654,0.00013694543,0.0006650307,0.000296965,0.00048376512,0.0000026188834],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072324576,0.00002290767,0.00039402954,0.000054551325,0.00008511452,0.000008692115,0.0019831934,0.006948365,0.00034824028,0.056024197,0.0002722084,0.93378615],"study_design_scores_gemma":[0.0016855743,0.00047677197,0.0009454217,0.00016179842,0.000009257009,0.0011111184,0.00018540614,0.91205955,0.0011145053,0.08037053,0.0016308244,0.00024926447],"about_ca_topic_score_codex":0.0000022353095,"about_ca_topic_score_gemma":0.0000012811631,"teacher_disagreement_score":0.9335369,"about_ca_system_score_codex":0.000044134365,"about_ca_system_score_gemma":0.000044469107,"threshold_uncertainty_score":0.9999942},"labels":[],"label_agreement":null},{"id":"W2137906639","doi":"10.1016/s0012-365x(99)00251-4","title":"Extremal graphs for inequalities involving domination parameters","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Domination analysis; Characterization (materials science); Upper and lower bounds; Discrete mathematics; Graph; Extremal combinatorics; Inequality; Chordal graph","score_opus":0.04637501544429559,"score_gpt":0.31262080457621927,"score_spread":0.26624578913192365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137906639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1239051,0.000111645124,0.87135136,0.00021871121,0.0000695668,0.0005140348,0.000013228682,0.00016977507,0.0036465935],"genre_scores_gemma":[0.40673506,0.000033490378,0.5909881,0.00008559252,0.000022292044,0.00017318544,0.000011794757,0.000028382192,0.001922104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986021,0.00006866722,0.0003311023,0.00028459678,0.00033931015,0.00037420334],"domain_scores_gemma":[0.99846816,0.00069432246,0.00009077985,0.00057836104,0.00008548693,0.00008291002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746509,0.00015877206,0.00020798591,0.00015003313,0.00017673588,0.00019941384,0.0007249423,0.00005199431,0.000056145418],"category_scores_gemma":[0.00022285082,0.00013795446,0.00012804913,0.00034900894,0.0001070046,0.00061315135,0.000086610045,0.00009521929,0.000033890607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011760609,0.000040680432,0.000017504164,0.0001333486,0.00001756753,0.0000033390847,0.0038838906,0.00016475048,0.000321768,0.9787561,0.00008943778,0.016559811],"study_design_scores_gemma":[0.00031215034,0.000075477,0.000019150295,0.000055470136,0.000006529025,0.000011109721,0.00049431983,0.12557495,0.0021198997,0.8708577,0.000274188,0.0001990489],"about_ca_topic_score_codex":0.000002796277,"about_ca_topic_score_gemma":0.000001868558,"teacher_disagreement_score":0.28282997,"about_ca_system_score_codex":0.000029585692,"about_ca_system_score_gemma":0.000022567601,"threshold_uncertainty_score":0.562562},"labels":[],"label_agreement":null},{"id":"W2137962531","doi":"10.1016/j.disc.2013.05.012","title":"A lower bound for the chromatic capacity in terms of the chromatic number of a graph","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Mathematics; Monochromatic color; Chromatic scale; Conjecture; Graph; Wheel graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Upper and lower bounds; Graph power; Physics; Line graph; Computer science; Optics; Mathematical analysis","score_opus":0.03284534236989184,"score_gpt":0.29258533012331056,"score_spread":0.2597399877534187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137962531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7528689,0.000029643876,0.24327715,0.00044170837,0.00011281039,0.0017750474,0.000012244996,0.000025706631,0.001456775],"genre_scores_gemma":[0.9533216,0.000004861121,0.04621463,0.000039217914,0.0000100343195,0.000255798,4.24246e-7,0.000018008543,0.00013545348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982852,0.000100601756,0.0005908129,0.00020077676,0.00048095055,0.00034168837],"domain_scores_gemma":[0.99695593,0.0011760518,0.0003510108,0.001375286,0.00009575241,0.00004598546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000709871,0.00017182689,0.00035445424,0.00007692641,0.000109741326,0.00007468047,0.0017718838,0.000054610988,0.000048351154],"category_scores_gemma":[0.0004116068,0.00008867602,0.0002207078,0.0007136647,0.00051346165,0.0003071802,0.00034639295,0.00015666174,0.000017969132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001254546,0.0005694477,0.0032280276,0.0028930139,0.00018130819,0.0000016774171,0.017892698,0.00021626388,0.010871533,0.9621573,0.00040290254,0.0015732587],"study_design_scores_gemma":[0.00035010377,0.000048872127,0.0031855279,0.00031651015,0.00001646553,0.000012985151,0.00027292082,0.08598913,0.0038053838,0.90586126,0.000013002033,0.00012781989],"about_ca_topic_score_codex":0.00003241558,"about_ca_topic_score_gemma":0.000022015749,"teacher_disagreement_score":0.20045266,"about_ca_system_score_codex":0.000029189921,"about_ca_system_score_gemma":0.000033188902,"threshold_uncertainty_score":0.3616103},"labels":[],"label_agreement":null},{"id":"W2138177131","doi":"10.1016/j.dam.2009.03.014","title":"On well-covered triangulations: Part II","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02209633187996251,"score_gpt":0.2915288947650704,"score_spread":0.26943256288510786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138177131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011244353,0.00003423248,0.8285424,0.0009170103,0.00009303482,0.0007230898,0.000006838986,0.00037926037,0.15805978],"genre_scores_gemma":[0.7171654,0.000018626866,0.27968377,0.0009438674,0.000098352444,0.00009004322,0.000017484523,0.000031737563,0.0019507207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983337,0.000022416365,0.00034832733,0.0003804839,0.0005163009,0.00039880117],"domain_scores_gemma":[0.99828047,0.0002881444,0.00013478754,0.0011323986,0.000040926607,0.00012326115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038899618,0.00020291943,0.00025061044,0.00014931089,0.00028998643,0.00011589912,0.0009035782,0.000070480324,0.00007533661],"category_scores_gemma":[0.00009906763,0.00017170674,0.000091050264,0.0005371033,0.000055876164,0.00020577421,0.00016622899,0.0001908269,0.00036887167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015638934,0.00013287038,2.5283762e-7,0.000010845884,0.000010089863,0.0000034466502,0.00054487295,0.0003076503,0.001038426,0.9911136,0.0011355075,0.005686779],"study_design_scores_gemma":[0.00052279676,0.00015056889,0.000023033956,0.000029521856,0.000005898141,0.0000036369925,0.000066392604,0.011228948,0.0039473884,0.98146826,0.0023313023,0.00022224459],"about_ca_topic_score_codex":1.9863451e-7,"about_ca_topic_score_gemma":2.6589714e-7,"teacher_disagreement_score":0.70592105,"about_ca_system_score_codex":0.0000391637,"about_ca_system_score_gemma":0.000031051542,"threshold_uncertainty_score":0.7001997},"labels":[],"label_agreement":null},{"id":"W2138481685","doi":"10.1016/s0095-8956(02)00010-2","title":"Disjoint cocircuits in matroids with large rank","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Disjoint sets; Rank (graph theory); Mathematics; Integer (computer science); Discrete mathematics; Graphic matroid; Class (philosophy); Minor (academic); Computer science; Artificial intelligence","score_opus":0.008969961233094159,"score_gpt":0.2537563941132656,"score_spread":0.24478643288017146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138481685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4374509,0.0016236296,0.5286141,0.001016527,0.008998504,0.00068593613,0.0000062921354,0.00012136715,0.021482764],"genre_scores_gemma":[0.99588025,0.000049826493,0.0036431274,0.000059087644,0.000111311,0.000005109987,2.2583916e-7,0.000020064866,0.00023102366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971741,0.00092997175,0.0005211237,0.00021022165,0.0006701542,0.0004944507],"domain_scores_gemma":[0.9982752,0.00040733497,0.00033039035,0.00046276124,0.0003403889,0.0001838798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039039145,0.00019273447,0.00042835073,0.0003205854,0.00012674951,0.00013118345,0.0009853779,0.00007650541,0.0000590235],"category_scores_gemma":[0.00055101956,0.00014545608,0.00011502262,0.00083683163,0.00017177321,0.0015525928,0.00010693955,0.00057278236,0.000008350983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006233888,0.00018957928,0.0008276839,0.000011677958,0.000033881322,0.00023422873,0.0006038503,0.000048758153,0.00046233268,0.9963676,0.000053054573,0.00054398796],"study_design_scores_gemma":[0.003506397,0.0010449066,0.0003778252,0.00006689178,0.0000064506175,0.00041638457,0.00036805007,0.000010907333,0.0053108227,0.9799746,0.008726246,0.00019049],"about_ca_topic_score_codex":5.593223e-7,"about_ca_topic_score_gemma":0.0000021465387,"teacher_disagreement_score":0.55842936,"about_ca_system_score_codex":0.00011332446,"about_ca_system_score_gemma":0.00027803727,"threshold_uncertainty_score":0.5931527},"labels":[],"label_agreement":null},{"id":"W2139210144","doi":"10.1090/tran/7408","title":"Yes, the “missing axiom” of matroid theory is lost forever","year":2018,"lang":"lv","type":"preprint","venue":"Transactions of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Axiom; Conjecture; Sentence; Mathematics; Combinatorics; Order (exchange); Field (mathematics); Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence; Geometry; Economics","score_opus":0.02685597101923055,"score_gpt":0.3135298488909901,"score_spread":0.2866738778717596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139210144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016140217,0.00027808512,0.9745865,0.005756194,0.00024973782,0.0011279596,0.00021370746,0.000055373803,0.0015922391],"genre_scores_gemma":[0.7668096,0.00072290713,0.22637562,0.0013883865,0.0001848359,0.00011531441,0.0000031237255,0.0001555478,0.0042446605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99435115,0.0010990241,0.0012956564,0.0008674982,0.0015408378,0.0008458081],"domain_scores_gemma":[0.9906465,0.0028123865,0.0015727588,0.0041617425,0.0005954258,0.00021122604],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003131521,0.0006209017,0.001325361,0.000083649036,0.0007737071,0.0001371518,0.0056582624,0.00022272357,0.0012859318],"category_scores_gemma":[0.00022659883,0.00036995203,0.0027230203,0.0018128767,0.011725839,0.0002740836,0.00085269194,0.0016266009,0.00013614641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010908146,0.0060664355,0.00028725667,0.011458988,0.010551388,0.000005491037,0.12662342,0.0046719513,0.01969224,0.57132185,0.010277946,0.2379522],"study_design_scores_gemma":[0.0003369033,0.0002836058,0.0002965956,0.00091488136,0.00051104784,0.000039263734,0.003271929,0.040654816,0.012750177,0.93985826,0.00055439735,0.0005281038],"about_ca_topic_score_codex":0.000071255476,"about_ca_topic_score_gemma":0.0000024567912,"teacher_disagreement_score":0.75066936,"about_ca_system_score_codex":0.00018218682,"about_ca_system_score_gemma":0.00043312967,"threshold_uncertainty_score":0.99987525},"labels":[],"label_agreement":null},{"id":"W2139277171","doi":"10.1016/j.disc.2008.02.023","title":"On the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si66.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-orientability of random graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scroll; Combinatorics; Discrete mathematics; Algorithm; Theology; Philosophy","score_opus":0.022976516589453093,"score_gpt":0.2663674007408643,"score_spread":0.2433908841514112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139277171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9480267,0.000113733244,0.0480129,0.00028641312,0.00030830572,0.0001979643,0.00006521116,0.00014182283,0.0028469102],"genre_scores_gemma":[0.9837628,0.00011791621,0.01539665,0.00023695851,0.000084627194,0.00019213534,0.000029110444,0.00008077884,0.00009900446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961084,0.00021534611,0.0008580898,0.0006785601,0.0013888918,0.0007507118],"domain_scores_gemma":[0.99462986,0.0021618798,0.00058320764,0.002261525,0.00013120896,0.00023229582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016574486,0.00039094596,0.0003815083,0.00014632911,0.00066887384,0.00017421716,0.0018064403,0.0002473329,0.00004326637],"category_scores_gemma":[0.0012005416,0.0003295736,0.00060610817,0.00073199073,0.00095219666,0.0005205735,0.0008941155,0.00059307204,0.00032071825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020150989,0.0002531899,0.000023034325,0.00026089075,0.00012805918,0.00006137133,0.0031738188,0.00039456805,0.0005177239,0.99452823,0.00019875832,0.00025887124],"study_design_scores_gemma":[0.0011022864,0.00039876235,0.000068139634,0.00024905923,0.00006319986,0.00013022535,0.0005900092,0.86060494,0.010366058,0.12581794,0.00024518947,0.00036419218],"about_ca_topic_score_codex":0.000033134485,"about_ca_topic_score_gemma":0.000017913651,"teacher_disagreement_score":0.8687103,"about_ca_system_score_codex":0.000019801171,"about_ca_system_score_gemma":0.00019707656,"threshold_uncertainty_score":0.99991566},"labels":[],"label_agreement":null},{"id":"W2139924054","doi":"10.1016/j.dam.2004.12.001","title":"Balanced vertex-orderings of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Discrete mathematics; Degree (music); Graph","score_opus":0.013829799812163146,"score_gpt":0.27034252288300126,"score_spread":0.2565127230708381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139924054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042758815,0.00007398504,0.91769105,0.00023420299,0.000045899775,0.00037440957,0.000004964234,0.0002158183,0.038600836],"genre_scores_gemma":[0.597219,0.000019676094,0.40253878,0.00006290992,0.00000983768,0.000034868186,0.0000017133624,0.000016980322,0.00009628455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985161,0.000011854304,0.00037135772,0.00029565842,0.00043790182,0.00036713388],"domain_scores_gemma":[0.9985859,0.00017984779,0.0001599083,0.00091133144,0.00006224839,0.000100774865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031024416,0.00017336152,0.000292839,0.00014451996,0.00007146653,0.00004316721,0.001139643,0.000056991496,0.000030757947],"category_scores_gemma":[0.000042789754,0.00015182876,0.0000892578,0.0005443002,0.0001379756,0.00023542046,0.00033402376,0.00014824478,0.000089000074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005875297,0.000065175445,0.000009999674,0.000078510886,0.000018088893,9.618955e-7,0.000974288,0.00013874052,0.023799215,0.96300864,0.0000903447,0.011810182],"study_design_scores_gemma":[0.0005996098,0.000050637038,0.00008281751,0.000044410077,0.0000091731845,0.000008011716,0.00021218718,0.032796875,0.07178927,0.89285624,0.0012344304,0.00031632616],"about_ca_topic_score_codex":8.827736e-7,"about_ca_topic_score_gemma":0.0000015325037,"teacher_disagreement_score":0.55446017,"about_ca_system_score_codex":0.000021333786,"about_ca_system_score_gemma":0.000027294627,"threshold_uncertainty_score":0.61913973},"labels":[],"label_agreement":null},{"id":"W2139927980","doi":"10.1007/978-3-7643-7400-6_17","title":"A Characterization of the 1-well-covered Graphs with no 4-cycles","year":2006,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Independent set; Vertex (graph theory); Graph; Maximal independent set; Discrete mathematics; Split graph; Chordal graph; 1-planar graph","score_opus":0.014069193197861127,"score_gpt":0.21920160478688713,"score_spread":0.205132411589026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139927980","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056045474,0.00007347458,0.05131106,0.00011209312,0.00047879876,0.001800868,0.00021201943,0.00034432978,0.9400628],"genre_scores_gemma":[0.059216257,0.000032445445,0.003988658,0.0004474148,0.00017740428,0.00008955137,0.000072251445,0.00022018414,0.93575585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973556,0.00009214952,0.0004731216,0.0007256095,0.00093322154,0.0004202951],"domain_scores_gemma":[0.996936,0.00012489996,0.00054685416,0.0018982015,0.0003933268,0.00010068683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002737086,0.00048385267,0.00046155968,0.00035299786,0.00019202601,0.000101189755,0.0018785233,0.0002589865,0.00005687994],"category_scores_gemma":[0.000014139759,0.00032995906,0.00026785024,0.000110707086,0.00046626767,0.000213028,0.00051788194,0.00047912129,0.00009328665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013218628,0.00004273794,0.00016877387,0.00015292875,0.00012823592,0.000031963555,0.00013784079,0.000026181322,0.018907614,0.9758819,0.0005298672,0.003859825],"study_design_scores_gemma":[0.0032741607,0.0009376731,0.0050314614,0.0026935756,0.00023626578,0.000118987125,0.000009116707,0.0023365247,0.0927998,0.5281098,0.36112657,0.0033260712],"about_ca_topic_score_codex":0.000023890429,"about_ca_topic_score_gemma":0.000035798,"teacher_disagreement_score":0.44777206,"about_ca_system_score_codex":0.00005600583,"about_ca_system_score_gemma":0.0002502733,"threshold_uncertainty_score":0.99991524},"labels":[],"label_agreement":null},{"id":"W2140541505","doi":"10.1287/opre.2013.1247","title":"Integral Simplex Using Decomposition for the Set Partitioning Problem","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Simplex; Sequence (biology); Simplex algorithm; Mathematics; Polytope; Constructive; Mathematical optimization; Degeneracy (biology); Integer (computer science); Set (abstract data type); Revised simplex method; Decomposition; Combinatorics; Variable (mathematics); Integer programming; Algorithm; Linear programming; Computer science","score_opus":0.1774074885190413,"score_gpt":0.48514672057562436,"score_spread":0.30773923205658305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140541505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015952855,0.000039474802,0.9793046,0.003083239,0.000058431793,0.0008326585,0.000007543814,0.000056357876,0.000664822],"genre_scores_gemma":[0.7985736,0.00000803339,0.20034,0.00008663607,0.00012928943,0.00043765618,0.000018730969,0.00001335324,0.00039266775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978183,0.00059291173,0.0001948637,0.000341654,0.00051858946,0.0005336669],"domain_scores_gemma":[0.99729764,0.0012056929,0.000013964691,0.00062868267,0.0007608254,0.000093164505],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035855272,0.00008720291,0.00009005941,0.00023099477,0.0024289116,0.00082854036,0.00096226373,0.000042885473,0.00003449214],"category_scores_gemma":[0.00046498628,0.00006283876,0.000055033357,0.00092341675,0.0002128589,0.00073621864,0.00031497903,0.00035293083,0.0000475685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140920065,0.000035379544,0.000048854254,0.000011678301,0.000013835726,5.867406e-7,0.00057583814,0.081443466,0.010325071,0.88159317,0.0006605775,0.025277443],"study_design_scores_gemma":[0.00019817943,0.00011369599,0.000062827574,0.000017562143,0.0000018456941,0.000008237743,0.00013395766,0.934813,0.0039538355,0.052474022,0.008140924,0.00008186143],"about_ca_topic_score_codex":0.0001131461,"about_ca_topic_score_gemma":0.00022996741,"teacher_disagreement_score":0.8533696,"about_ca_system_score_codex":0.00010327307,"about_ca_system_score_gemma":0.00015375896,"threshold_uncertainty_score":0.9988698},"labels":[],"label_agreement":null},{"id":"W2141942969","doi":"10.1016/s0166-218x(03)00371-8","title":"Partitioning chordal graphs into independent sets and cliques","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Split graph; Discrete mathematics; Indifference graph; Maximal independent set; Interval graph; Cograph; Pathwidth; Disjoint sets; Clique-sum; 1-planar graph; Graph; Line graph","score_opus":0.017726078083042853,"score_gpt":0.2947188118428381,"score_spread":0.2769927337597953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141942969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08998232,0.00012861317,0.8888231,0.00010037615,0.000050750958,0.0003833599,0.0000018978088,0.00020290609,0.020326694],"genre_scores_gemma":[0.6434745,0.000033010518,0.35629505,0.00007102224,0.0000058828255,0.00007328133,0.0000021592934,0.000016105492,0.00002897429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855995,0.000046483798,0.0002813094,0.00037234274,0.0003807998,0.00035913373],"domain_scores_gemma":[0.9989567,0.00017587084,0.00010202703,0.00056487205,0.00004588712,0.00015463732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006524246,0.00018049193,0.00021144575,0.00012679768,0.00022674141,0.00020124465,0.00042860463,0.00006758494,0.000016945109],"category_scores_gemma":[0.000080902966,0.00015982741,0.000045685618,0.00033233102,0.00014481682,0.00027363133,0.00022867952,0.00021089049,0.00003312084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025626296,0.00003388749,0.00006900671,0.00006020055,0.00001502214,0.0000047857125,0.0019138095,0.000015447686,0.0023204414,0.993592,0.000028495606,0.0019442915],"study_design_scores_gemma":[0.00025182526,0.000032494427,0.00007756884,0.0000229449,0.0000058294595,0.00001828266,0.00041793127,0.0020140375,0.011968886,0.98464775,0.0003365768,0.00020584992],"about_ca_topic_score_codex":0.0000018206654,"about_ca_topic_score_gemma":0.000004963044,"teacher_disagreement_score":0.5534922,"about_ca_system_score_codex":0.000024960747,"about_ca_system_score_gemma":0.000030887484,"threshold_uncertainty_score":0.65175724},"labels":[],"label_agreement":null},{"id":"W2142143427","doi":"10.1016/j.disc.2015.09.027","title":"Uniqueness and minimal obstructions for tree-depth","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Discrete mathematics; Graph; Uniqueness","score_opus":0.06581150215029835,"score_gpt":0.3367363074743629,"score_spread":0.27092480532406454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142143427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02368083,0.000073317686,0.9717608,0.00037073437,0.00009022371,0.00030038838,0.000010385962,0.00012071507,0.0035925736],"genre_scores_gemma":[0.21868378,0.0000052949763,0.7804741,0.00003237735,0.000040342442,0.00008508143,0.0000030449628,0.000020746038,0.0006551944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991319,0.000032084143,0.00017464769,0.00021845588,0.00020327844,0.00023961288],"domain_scores_gemma":[0.99898607,0.00022984718,0.00006188546,0.00043179473,0.0001251774,0.00016522835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037013675,0.0001087365,0.00015259838,0.00008377352,0.000097120406,0.000113262635,0.00044118543,0.00004012868,0.0000012857508],"category_scores_gemma":[0.00023724535,0.0000905697,0.000042637606,0.00022071223,0.00011689797,0.00031742308,0.00020021254,0.00006946278,0.000007731608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069955922,0.000024339077,0.000077161254,0.00005602109,0.000011878394,0.0000023442083,0.0017536712,0.000018909228,0.00022982225,0.9911505,0.00020129523,0.006467056],"study_design_scores_gemma":[0.00042710887,0.00011759636,0.000098256365,0.000021036145,0.000007995414,0.000039857387,0.0008438457,0.06641092,0.0017736867,0.9287872,0.0013053142,0.00016720274],"about_ca_topic_score_codex":0.0000013498233,"about_ca_topic_score_gemma":0.0000066235184,"teacher_disagreement_score":0.19500294,"about_ca_system_score_codex":0.000022809849,"about_ca_system_score_gemma":0.000049018745,"threshold_uncertainty_score":0.36933252},"labels":[],"label_agreement":null},{"id":"W2143613789","doi":"10.7155/jgaa.00123","title":"A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Upper and lower bounds; Computer science; Combinatorics; Mathematics","score_opus":0.030894195947069204,"score_gpt":0.2672424313698322,"score_spread":0.236348235422763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143613789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7562633,0.009481633,0.23286806,0.0004903417,0.00008389805,0.00062284805,0.000051977342,0.000014062886,0.00012383818],"genre_scores_gemma":[0.9888309,0.00042953057,0.010597827,0.000022261465,0.000041001156,0.000022777043,5.989098e-7,0.000009234853,0.000045848017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99871266,0.00011404681,0.00050139416,0.0001662736,0.00033288405,0.00017271617],"domain_scores_gemma":[0.9984825,0.00013443403,0.00043981924,0.0003444348,0.0005292341,0.0000695814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007103269,0.00011070146,0.00025629657,0.00024241627,0.00020527834,0.000054315406,0.00058355037,0.000046071134,0.0000013801098],"category_scores_gemma":[0.000030278414,0.00007106948,0.000103456296,0.0010070946,0.000560808,0.0002535687,0.0001584029,0.00017711907,2.1528895e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001299981,0.0016453342,0.0887819,0.00044686932,0.0004199502,0.00000554017,0.0012923446,0.00039374543,0.0930765,0.5739665,0.00064911385,0.2391922],"study_design_scores_gemma":[0.0013744365,0.00041764296,0.54775214,0.00024250595,0.00006324208,0.00022911765,0.00025091183,0.0053613074,0.027685635,0.41446322,0.0017713624,0.0003884339],"about_ca_topic_score_codex":0.00021924409,"about_ca_topic_score_gemma":0.000043255237,"teacher_disagreement_score":0.45897028,"about_ca_system_score_codex":0.000008014396,"about_ca_system_score_gemma":0.000082196246,"threshold_uncertainty_score":0.28981295},"labels":[],"label_agreement":null},{"id":"W2143618826","doi":"10.5555/2634074.2634097","title":"Arboricity and spanning-tree packing in random graphs with an application to load balancing","year":2014,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Random graph; Graph; Disjoint sets; Spanning tree; Degree (music); Minimum spanning tree; Discrete mathematics; Planar graph; Physics","score_opus":0.007603731631552604,"score_gpt":0.2650003601434302,"score_spread":0.2573966285118776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143618826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13112155,0.000037159327,0.8653305,0.00084565784,0.000066710476,0.00058144354,0.0000024606643,0.0001504357,0.00186407],"genre_scores_gemma":[0.9536109,0.000015385922,0.04586405,0.00025610326,0.00006257593,0.00012965972,0.000004000245,0.000026315425,0.000031040745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975296,0.00023099815,0.00024271835,0.0008669228,0.00059192174,0.00053782924],"domain_scores_gemma":[0.9984386,0.00021952568,0.00008824507,0.0008606564,0.000106365864,0.0002866227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001143617,0.00024564387,0.0002908183,0.00031457987,0.0001684475,0.00018408439,0.0006941229,0.00006543302,9.1507815e-7],"category_scores_gemma":[0.000056290566,0.00020164001,0.00003580284,0.0009928058,0.000095040225,0.00061228895,0.0002045782,0.000270024,0.000011674713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018073141,0.0004114451,0.04787087,0.00013502578,0.00008183288,0.0000819582,0.0074325125,0.025313307,0.056026205,0.4530275,0.00003928982,0.40777275],"study_design_scores_gemma":[0.007119462,0.0033829364,0.045168724,0.0003377132,0.000019413375,0.00004500444,0.00024035157,0.8299905,0.016343074,0.09478946,0.0010842612,0.0014790915],"about_ca_topic_score_codex":0.00014541477,"about_ca_topic_score_gemma":0.00021423613,"teacher_disagreement_score":0.8224893,"about_ca_system_score_codex":0.000095706564,"about_ca_system_score_gemma":0.000052962925,"threshold_uncertainty_score":0.8222641},"labels":[],"label_agreement":null},{"id":"W2143633463","doi":"10.1007/s10878-014-9712-6","title":"Zero-visibility cops and robber and the pathwidth of a graph","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Memorial University of Newfoundland","funders":"Narodowe Centrum Nauki","keywords":"Bounded function; Monotonic function; Visibility; Theory of computation; Pathwidth; Mathematics; Zero (linguistics); Discrete mathematics; Visibility graph; Graph; Combinatorics; Line graph; Algorithm; Mathematical analysis; Physics","score_opus":0.006789592392098764,"score_gpt":0.24293138834825068,"score_spread":0.23614179595615192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143633463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04002545,0.00021768968,0.9583136,0.0004518728,0.0006651871,0.00013698856,4.1870288e-7,0.0000075653843,0.00018125781],"genre_scores_gemma":[0.9503626,0.00015019561,0.04937921,0.000034652956,0.00006191546,0.0000012241371,2.025981e-7,0.0000051200163,0.000004862659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985935,0.00044972726,0.0003706472,0.00012051918,0.00035477558,0.00011082523],"domain_scores_gemma":[0.99825513,0.000574274,0.00039169798,0.00024046461,0.00046619694,0.000072254836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002392001,0.0000792419,0.00024706806,0.00011852145,0.000090027126,0.00007613021,0.00033877813,0.000046065154,0.0000019462643],"category_scores_gemma":[0.000576012,0.000050933915,0.000055733723,0.0003250985,0.00025981377,0.0005113614,0.00013473751,0.00016843819,1.2773987e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004326013,0.00007993017,0.0012820925,0.00002252655,0.000030877512,0.0000014586954,0.0005455123,0.030503549,0.00013776378,0.9615262,0.000051193325,0.0053862776],"study_design_scores_gemma":[0.005193233,0.00043457703,0.00075179443,0.000032397424,0.000016135455,0.000035266883,0.000020050089,0.12968598,0.00050331606,0.86312824,0.00011829647,0.00008069648],"about_ca_topic_score_codex":0.0000026012603,"about_ca_topic_score_gemma":1.04456156e-7,"teacher_disagreement_score":0.91033715,"about_ca_system_score_codex":0.000012398884,"about_ca_system_score_gemma":0.000039359496,"threshold_uncertainty_score":0.20770247},"labels":[],"label_agreement":null},{"id":"W2143684958","doi":"10.1142/s0218196706003116","title":"TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Hungarian Scientific Research Fund","keywords":"Mathematics; Constraint satisfaction problem; Polynomial; Algebra over a field; Complexity of constraint satisfaction; Pure mathematics; Discrete mathematics; Local consistency; Mathematical analysis","score_opus":0.025828535238264255,"score_gpt":0.3013269032063554,"score_spread":0.27549836796809113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143684958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35811454,0.00010832382,0.6395515,0.0017862408,0.00024345593,0.00007794075,0.0000060970015,0.0000076263636,0.00010423854],"genre_scores_gemma":[0.988479,0.000023014387,0.011259061,0.00009015464,0.00013220018,0.0000017498643,0.0000041216404,0.0000040504815,0.000006621727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987114,0.00014773446,0.000452467,0.000121659716,0.00047103345,0.000095672374],"domain_scores_gemma":[0.99831957,0.00072264066,0.00045627108,0.0000769326,0.0003829214,0.000041677184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005051017,0.00008696827,0.00015948783,0.00022962772,0.000093414725,0.00014785379,0.0002580167,0.000031086856,0.000010056079],"category_scores_gemma":[0.000114770264,0.00006445596,0.000067437904,0.00013056769,0.0006641918,0.00056262093,0.000109572386,0.00014920117,8.976081e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024368722,0.000053094263,0.004279794,0.0000070385295,0.0001082486,0.000010746159,0.0006378638,0.0033767808,0.0014616515,0.91000307,0.00006072467,0.079757325],"study_design_scores_gemma":[0.0025430764,0.00010221955,0.16286075,0.000029781837,0.000014442537,0.0001565054,0.00008174794,0.12060767,0.0005866674,0.7128932,0.000036573027,0.000087388544],"about_ca_topic_score_codex":0.000088546956,"about_ca_topic_score_gemma":0.00002681841,"teacher_disagreement_score":0.6303645,"about_ca_system_score_codex":0.00003346166,"about_ca_system_score_gemma":0.000046138328,"threshold_uncertainty_score":0.2628438},"labels":[],"label_agreement":null},{"id":"W2143708942","doi":"10.1007/978-3-642-32512-0_2","title":"Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Pathwidth; Combinatorics; Partial k-tree; Computer science; Chordal graph; Conjecture; Graph; Discrete mathematics; Mathematics; Line graph","score_opus":0.048832930724603034,"score_gpt":0.2910973016065226,"score_spread":0.24226437088191954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143708942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017255216,0.0023744872,0.9901228,0.00031784273,0.0005146444,0.0007772839,0.000007327541,0.00013650446,0.0040236074],"genre_scores_gemma":[0.72383934,0.00015053073,0.2753488,0.00013455273,0.0001229144,0.000016913415,0.0000048917855,0.00004788857,0.0003341439],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953195,0.00010975748,0.00076264434,0.0016515413,0.0012445817,0.0009119746],"domain_scores_gemma":[0.99619275,0.0007398402,0.00043610795,0.0019440007,0.0003946067,0.00029267572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026767354,0.0005227949,0.0007588305,0.0010715115,0.00021401109,0.00020585375,0.003114092,0.00041600305,0.000032624946],"category_scores_gemma":[0.00024276925,0.00047970898,0.00013234389,0.0010795181,0.0025201733,0.0010245597,0.0023555546,0.0012520453,0.000012756185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023072966,0.000160815,0.0011065096,0.0003060116,0.000035720284,0.000022974378,0.003290935,0.006521346,0.0013949503,0.15517953,0.0000021804726,0.83195597],"study_design_scores_gemma":[0.0004980781,0.0003786484,0.00089743466,0.00051910296,0.000013562731,0.000090117486,4.0363693e-7,0.11508023,0.0024088786,0.8790596,0.00030425185,0.00074967014],"about_ca_topic_score_codex":0.000017703605,"about_ca_topic_score_gemma":0.00003265133,"teacher_disagreement_score":0.83120626,"about_ca_system_score_codex":0.00019668606,"about_ca_system_score_gemma":0.0003700777,"threshold_uncertainty_score":0.99976546},"labels":[],"label_agreement":null},{"id":"W2143815444","doi":"10.1016/j.jctb.2006.10.001","title":"Paths with two blocks in n-chromatic digraphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Computer science; Mathematics; Combinatorics","score_opus":0.006015535670932735,"score_gpt":0.24470165430450055,"score_spread":0.2386861186335678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143815444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91852224,0.00069534587,0.06855142,0.0004628905,0.0029056265,0.00033430505,0.0000019027995,0.000084451516,0.008441789],"genre_scores_gemma":[0.99328387,0.000017014909,0.006188033,0.000028904473,0.00025687148,0.000005698519,3.5315816e-7,0.000017628432,0.0002016015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975853,0.00047627892,0.00061024225,0.00020521879,0.00071168575,0.0004112895],"domain_scores_gemma":[0.99817705,0.0005090334,0.00042225086,0.0004700267,0.00030393165,0.00011770984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019550703,0.00020379471,0.0004214891,0.00046675748,0.00011322372,0.00016067944,0.0012166462,0.000060246744,0.000026136891],"category_scores_gemma":[0.00014328417,0.00015173537,0.00011999096,0.0010455026,0.00026635497,0.001489239,0.00015074974,0.0004749549,0.0000040261816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062827085,0.0002023309,0.0013354499,0.000011323388,0.000026549436,0.00038267407,0.0002815766,0.00037168746,0.0009070816,0.9942648,0.0000795827,0.0015087082],"study_design_scores_gemma":[0.0025004474,0.0009809522,0.0010241132,0.00010003722,0.000008090739,0.00036289677,0.00012475942,0.0000636666,0.004207215,0.9894341,0.001003739,0.00018998688],"about_ca_topic_score_codex":0.000008872472,"about_ca_topic_score_gemma":0.000010845152,"teacher_disagreement_score":0.07476163,"about_ca_system_score_codex":0.00008273367,"about_ca_system_score_gemma":0.00018219315,"threshold_uncertainty_score":0.61875886},"labels":[],"label_agreement":null},{"id":"W2144127039","doi":"10.1109/sfcs.1991.185452","title":"Computing planar intertwines","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Simon Fraser University","funders":"","keywords":"Intersection (aeronautics); Minor (academic); Conjecture; Combinatorics; Planar graph; Mathematics; Discrete mathematics; Planar; Graph; Intersection graph; Computer science; Engineering; Philosophy; Humanities; Line graph; Computer graphics (images)","score_opus":0.04210041474169429,"score_gpt":0.2934132126686162,"score_spread":0.2513127979269219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144127039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005890338,0.00008653033,0.94387054,0.0011842044,0.000116475494,0.000049742983,1.6037744e-7,0.00028540436,0.048516598],"genre_scores_gemma":[0.8997194,0.000005831736,0.096217856,0.00047909108,0.00004371266,0.0000012295719,1.7361515e-7,0.0000049664386,0.0035277354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927986,0.000035963778,0.00009404013,0.0002045581,0.00015364199,0.00023194362],"domain_scores_gemma":[0.9994203,0.00011587218,0.000017087492,0.00034995447,0.00003227028,0.00006451544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012754154,0.000062190695,0.0000674517,0.00009068527,0.000078294004,0.00006120013,0.0007741453,0.000017105613,0.0001533622],"category_scores_gemma":[0.000032270644,0.000049905753,0.000029232977,0.00030978452,0.000051442796,0.00027604267,0.00018329918,0.00008747626,0.00047613203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016796902,0.000049299957,0.00084085204,0.000006366007,0.000010214142,0.000039918923,0.0008913126,0.000067589426,0.00090200966,0.81596595,0.009321597,0.17190321],"study_design_scores_gemma":[0.00040358378,0.00012559522,0.0007237554,0.000021899454,0.0000010323018,0.00008601203,0.000113946524,0.8893086,0.0038995421,0.083083175,0.021904543,0.00032831825],"about_ca_topic_score_codex":0.0000031456352,"about_ca_topic_score_gemma":0.0000017426871,"teacher_disagreement_score":0.89382905,"about_ca_system_score_codex":0.000010399255,"about_ca_system_score_gemma":0.000002366722,"threshold_uncertainty_score":0.6119873},"labels":[],"label_agreement":null},{"id":"W2144502170","doi":"10.1109/ismvl.2012.44","title":"Greedy Algorithms, Ordering of Variables, and d-degenerate Instances","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degenerate energy levels; Greedy algorithm; Generalization; Class (philosophy); Mathematics; Bounded function; Heuristic; Discrete mathematics; Combinatorics; Algorithm; Computer science; Mathematical optimization; Mathematical analysis; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.03010241248630393,"score_gpt":0.28491601536143774,"score_spread":0.2548136028751338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144502170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040425863,0.0016713944,0.9493401,0.00007504414,0.00015112659,0.000080487465,0.0000012675331,0.00006952767,0.008185158],"genre_scores_gemma":[0.6916404,0.00010138134,0.30770957,0.00004111063,0.000037403333,0.000005184411,3.1075666e-7,0.0000052108276,0.0004594702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992095,0.000046804947,0.00012306802,0.00015799898,0.00017426525,0.0002883314],"domain_scores_gemma":[0.9994547,0.00007729576,0.00003664722,0.00027347248,0.00005708725,0.0001008284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047022974,0.00007262256,0.000107394684,0.000084366395,0.00006270839,0.000030010911,0.00034687307,0.000024897896,0.000020166204],"category_scores_gemma":[0.000026367696,0.000059370817,0.000013604683,0.0003753927,0.00007773697,0.0008249815,0.00028487106,0.00006622276,0.000005366617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003485077,0.000033312128,0.0042242645,0.000018444034,0.000011577057,0.000001146911,0.0002671815,0.0000439059,0.0065192264,0.9291495,0.000056788027,0.05967119],"study_design_scores_gemma":[0.002551838,0.0005242493,0.018233396,0.00012992878,0.00001984737,0.00015965138,0.00064310315,0.16492069,0.41912302,0.34772345,0.04437004,0.001600767],"about_ca_topic_score_codex":0.000024394394,"about_ca_topic_score_gemma":0.000005872608,"teacher_disagreement_score":0.6512145,"about_ca_system_score_codex":0.000008334158,"about_ca_system_score_gemma":0.000020284346,"threshold_uncertainty_score":0.24210717},"labels":[],"label_agreement":null},{"id":"W2144674749","doi":"10.1142/s0218195906002038","title":"BOUNDARY-OPTIMAL TRIANGULATION FLOODING","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Triangulation; Mathematics; Boundary (topology); Combinatorics; Point set triangulation; Flooding (psychology); Pitteway triangulation; Geometry; Discrete mathematics; Delaunay triangulation; Mathematical analysis","score_opus":0.013541345117598781,"score_gpt":0.3188351588273645,"score_spread":0.3052938137097657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144674749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018692937,0.00043803803,0.9776131,0.0013718928,0.0003616551,0.0002458621,0.00001925351,0.000062257815,0.0011950224],"genre_scores_gemma":[0.7378695,0.000013171476,0.26064563,0.00013337235,0.0009909455,0.00004392802,0.000050348157,0.000014576284,0.0002385319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971496,0.00008296378,0.00081507995,0.00027279806,0.001445926,0.00023366646],"domain_scores_gemma":[0.9964464,0.0005501846,0.0006227167,0.00023716813,0.002030959,0.000112601876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007063005,0.0001578919,0.00020491256,0.00115782,0.00020557946,0.00038692367,0.0017080299,0.00006239712,0.00006235009],"category_scores_gemma":[0.00006451784,0.00016093008,0.0002087381,0.0011206532,0.00011854322,0.0011669412,0.00018942576,0.00028461163,0.000075631644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005291956,0.00029568543,0.0008426111,0.0000065530994,0.00013192558,0.000024108042,0.000049742295,0.39369503,0.0008717626,0.5351774,0.0006931526,0.06815907],"study_design_scores_gemma":[0.0016730181,0.000111580994,0.01479092,0.000032604934,0.000018506304,0.00062293914,0.000039918996,0.04469584,0.001063252,0.8351613,0.10146665,0.00032343803],"about_ca_topic_score_codex":0.000005050526,"about_ca_topic_score_gemma":9.0058e-7,"teacher_disagreement_score":0.71917653,"about_ca_system_score_codex":0.0002123832,"about_ca_system_score_gemma":0.00027478294,"threshold_uncertainty_score":0.6562538},"labels":[],"label_agreement":null},{"id":"W2144688537","doi":"10.1016/s0012-365x(03)00236-x","title":"Channel assignment on graphs of bounded treewidth","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Treewidth; Mathematics; Partial k-tree; Bipartite graph; Discrete mathematics; Vertex (graph theory); Bounded function; Chordal graph; Clique-sum; 1-planar graph; Pathwidth; Graph; Line graph","score_opus":0.032515523825681424,"score_gpt":0.29640658569259887,"score_spread":0.26389106186691746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144688537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013061768,0.000060951694,0.9562262,0.00013239823,0.00011856988,0.00033198428,0.0000063201674,0.00008614798,0.029975642],"genre_scores_gemma":[0.91098356,0.000016245414,0.0882533,0.00006639713,0.0000066773837,0.00003341754,0.0000014924622,0.00002157948,0.0006173603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837255,0.00010967024,0.00031594568,0.00027590772,0.0005807406,0.00034518284],"domain_scores_gemma":[0.9984918,0.0002536477,0.00015606455,0.0009269477,0.000063052255,0.00010848823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006032194,0.00016731884,0.00025310155,0.00017645523,0.000091945745,0.000057147867,0.00072607386,0.000047638274,0.00002539547],"category_scores_gemma":[0.00019265419,0.00013279609,0.00011796596,0.00049688335,0.00012311178,0.00016708966,0.000105450395,0.00013316945,0.000040297342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000389648,0.00014745079,0.000012705823,0.00005204553,0.000022090308,0.000004907325,0.00091812405,0.00012527884,0.0004885268,0.99771816,0.00006887428,0.00043794035],"study_design_scores_gemma":[0.00031291114,0.000211823,0.00002519456,0.00006155538,0.0000053550157,0.000006674076,0.00021649624,0.0075109964,0.026270254,0.9649377,0.00027568065,0.00016538678],"about_ca_topic_score_codex":7.6496354e-7,"about_ca_topic_score_gemma":7.721252e-7,"teacher_disagreement_score":0.89792174,"about_ca_system_score_codex":0.000032646898,"about_ca_system_score_gemma":0.000037266364,"threshold_uncertainty_score":0.54152673},"labels":[],"label_agreement":null},{"id":"W2145071923","doi":"10.1016/j.dam.2004.06.015","title":"2-Tree probe interval graphs have a large obstruction set","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Interval graph; Partition (number theory); Interval (graph theory); Chordal graph; Discrete mathematics; Generalization; Indifference graph; Tree (set theory); Graph; 1-planar graph","score_opus":0.02324670617443626,"score_gpt":0.29506065678066845,"score_spread":0.2718139506062322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145071923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012560429,0.000041635547,0.9673064,0.00031861095,0.00007530764,0.00058847846,0.0000145969,0.00034913284,0.018745456],"genre_scores_gemma":[0.46185935,0.000011058629,0.53738344,0.00013119527,0.00006731895,0.0001408987,0.000013497217,0.000035748606,0.0003575102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791884,0.0000305502,0.00042326475,0.00047840198,0.0005428793,0.00060607464],"domain_scores_gemma":[0.9984501,0.00012154241,0.0001756156,0.0010235368,0.00007285182,0.00015635793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052588584,0.00025932706,0.00029332098,0.00020180647,0.00018975462,0.00017709803,0.0011576638,0.0000944281,0.00005185465],"category_scores_gemma":[0.00004601654,0.00022484912,0.0001286306,0.000436788,0.00011334837,0.0004667159,0.0005747484,0.0003097677,0.00023566606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010006668,0.00009158987,0.000022438002,0.00007528655,0.00002828664,0.000003801642,0.0031716104,0.000030758973,0.0029865063,0.97568125,0.0002817854,0.017616685],"study_design_scores_gemma":[0.0007233167,0.00005644023,0.000065038854,0.000043884786,0.000014578073,0.000037815287,0.0013245433,0.06590872,0.011952337,0.91630244,0.0031562203,0.0004146915],"about_ca_topic_score_codex":8.376762e-7,"about_ca_topic_score_gemma":0.000019206787,"teacher_disagreement_score":0.44929892,"about_ca_system_score_codex":0.000052195282,"about_ca_system_score_gemma":0.000028992186,"threshold_uncertainty_score":0.9169081},"labels":[],"label_agreement":null},{"id":"W2145113707","doi":"","title":"Embeddings of Small Graphs on the Torus","year":2003,"lang":"en","type":"article","venue":"CUBO, A Mathematical Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Automorphism; Graph; Discrete mathematics","score_opus":0.047169008951088054,"score_gpt":0.30526053907590583,"score_spread":0.2580915301248178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145113707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12163542,0.000120076664,0.84651124,0.001119616,0.00017729285,0.00020900814,8.2054953e-7,0.000044340886,0.030182207],"genre_scores_gemma":[0.8790223,0.0000340232,0.1199584,0.00041420994,0.000043668897,0.000014227341,5.288112e-8,0.000023001488,0.0004901074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981793,0.00029576133,0.00037912754,0.00018347772,0.0005680008,0.00039433563],"domain_scores_gemma":[0.9977963,0.001111069,0.00015858094,0.0005833653,0.00015559139,0.00019512005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018971647,0.00013802266,0.00022491737,0.00014598812,0.00021221378,0.00014625523,0.0012581034,0.00004915318,0.0002548828],"category_scores_gemma":[0.001300603,0.00007899939,0.0001839006,0.00047695733,0.00020797139,0.00018114281,0.00011102384,0.0005180578,0.00010602307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009189254,0.00011147617,0.000019965408,0.00001530107,0.000020908496,0.00002231437,0.00043492723,0.000019869136,0.00072228676,0.996611,0.00025549388,0.0017572973],"study_design_scores_gemma":[0.00019918161,0.00018564984,0.000037615628,0.000088120854,0.0000048376087,0.0004221219,0.00012008655,0.0019226237,0.004807105,0.9915663,0.000550967,0.000095379306],"about_ca_topic_score_codex":1.4091022e-7,"about_ca_topic_score_gemma":1.3089186e-7,"teacher_disagreement_score":0.75738686,"about_ca_system_score_codex":0.000028097575,"about_ca_system_score_gemma":0.000066817556,"threshold_uncertainty_score":0.32215017},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.016085028562191128,"score_gpt":0.3185427643036872,"score_spread":0.3024577357414961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145668739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21257329,0.00039633186,0.7740168,0.0005030458,0.000051294424,0.0008725244,0.0000059694617,0.00033781535,0.011242943],"genre_scores_gemma":[0.93973225,0.00007932563,0.05924383,0.00006997525,0.000039592658,0.00007594722,0.0000043295613,0.000032469623,0.0007222492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977307,0.000104042476,0.00034415268,0.00043618967,0.0003992592,0.0009856791],"domain_scores_gemma":[0.9984144,0.00065001583,0.00007228541,0.00075726653,0.000032951568,0.00007308131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000669705,0.00021633528,0.00027061094,0.00018914233,0.00010715405,0.000109248074,0.0010922165,0.000072128096,0.00025491838],"category_scores_gemma":[0.00020765454,0.00018912366,0.000070506154,0.00079891115,0.00009061698,0.00044580278,0.00017150964,0.00048418067,0.00016407103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046551027,0.00024507672,0.00020285067,0.000105682935,0.000060635015,0.000051438663,0.006356997,0.0038447385,0.0010755806,0.9103052,0.00006373626,0.07764151],"study_design_scores_gemma":[0.00044674551,0.00018984215,0.000066513836,0.00007067333,0.0000044736234,0.00005531737,0.00008099389,0.16872558,0.0047922577,0.82435215,0.00087229273,0.00034313108],"about_ca_topic_score_codex":0.000009573864,"about_ca_topic_score_gemma":0.000034784956,"teacher_disagreement_score":0.72715896,"about_ca_system_score_codex":0.00021147748,"about_ca_system_score_gemma":0.00013297856,"threshold_uncertainty_score":0.7712239},"labels":[],"label_agreement":null},{"id":"W2146690815","doi":"10.1016/s0166-218x(99)00185-7","title":"The complexity of irredundant sets parameterized by size","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Combinatorics; Mathematics; Vertex (graph theory); Computational complexity theory; Graph; Discrete mathematics; Feedback vertex set; Clique; Parametric statistics; Algorithm","score_opus":0.03386305702276592,"score_gpt":0.2975807947117375,"score_spread":0.26371773768897155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146690815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19815105,0.00030115314,0.7232813,0.0018303953,0.00012164092,0.0019379848,0.00011254336,0.00045097066,0.073812954],"genre_scores_gemma":[0.6546673,0.00009503195,0.3442913,0.00009685498,0.000010622599,0.00010096197,0.000006662866,0.00003026156,0.0007010117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982238,0.000053751894,0.0004572611,0.000298022,0.00052728696,0.00043989072],"domain_scores_gemma":[0.9974673,0.0009957843,0.00016658707,0.0012181457,0.00004467475,0.000107545726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059430196,0.00019132573,0.00031387323,0.0000248114,0.00026658922,0.00013459736,0.0016190368,0.000049893475,0.000101226105],"category_scores_gemma":[0.00008113512,0.0001267263,0.00009794343,0.00037482628,0.0009044714,0.00012490163,0.00024133448,0.000179924,0.00008890732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040669962,0.00010169825,0.0000012286764,0.000057929432,0.000039051894,0.0000015701178,0.00090449257,0.000020495096,0.018042682,0.9558441,0.0005663259,0.02437976],"study_design_scores_gemma":[0.00044370495,0.00004850661,0.000031263186,0.00001828175,0.000007922113,0.0000071173768,0.00016807337,0.01423945,0.015716473,0.96638477,0.0027301884,0.00020427011],"about_ca_topic_score_codex":0.000002867772,"about_ca_topic_score_gemma":0.0000013066299,"teacher_disagreement_score":0.45651627,"about_ca_system_score_codex":0.000020473428,"about_ca_system_score_gemma":0.000030423478,"threshold_uncertainty_score":0.51677483},"labels":[],"label_agreement":null},{"id":"W2146959334","doi":"10.1016/j.ejc.2007.11.012","title":"A dichotomy for minimum cost graph homomorphisms","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Combinatorics; Graph; Graph homomorphism; Discrete mathematics; Vertex (graph theory); Algebra homomorphism; Line graph; Graph power","score_opus":0.0400559946199954,"score_gpt":0.2741690628301987,"score_spread":0.2341130682102033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146959334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051573273,0.0006313951,0.9411591,0.0004057447,0.0012607842,0.00029501284,0.0000034263503,0.000055847773,0.004615411],"genre_scores_gemma":[0.9825633,0.000221002,0.016380731,0.00015572445,0.00012445917,0.000004245762,7.153016e-7,0.00003815806,0.00051162485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777734,0.0004512768,0.000544432,0.00021696692,0.00060655153,0.00040343203],"domain_scores_gemma":[0.9976324,0.00036872274,0.00043058995,0.0005036708,0.0007488464,0.00031580622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017927681,0.0001709223,0.00029009223,0.0003933939,0.0002877434,0.00007622349,0.0019879304,0.000023061139,0.00000534822],"category_scores_gemma":[0.00031348725,0.00015062361,0.00024769083,0.000844497,0.00017607273,0.00059461215,0.00021031169,0.00039015777,0.000031128115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002617585,0.0008058971,0.0017214837,0.00004791731,0.00015254131,0.0049603,0.0013796643,0.0001989001,0.0016680742,0.9480988,0.024910731,0.015793974],"study_design_scores_gemma":[0.012947369,0.0056165615,0.008935044,0.00018489943,0.00004627077,0.005951307,0.00011431644,0.0019292473,0.005686984,0.6558422,0.30164206,0.0011037687],"about_ca_topic_score_codex":1.0794097e-7,"about_ca_topic_score_gemma":3.1146573e-8,"teacher_disagreement_score":0.93099004,"about_ca_system_score_codex":0.000054635926,"about_ca_system_score_gemma":0.00012412055,"threshold_uncertainty_score":0.61422527},"labels":[],"label_agreement":null},{"id":"W2147365795","doi":"10.1007/s00373-011-1047-9","title":"Finding a Sun in Building-Free Graphs","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Experimental Program to Stimulate Competitive Research; National Security Agency; National Science Foundation","keywords":"Combinatorics; Indifference graph; Mathematics; Chordal graph; Pathwidth; Cograph; Discrete mathematics; Clique-sum; Split graph; Vertex (graph theory); Graph product; Maximal independent set; 1-planar graph; Graph; Line graph","score_opus":0.03634612366228012,"score_gpt":0.26875202869400155,"score_spread":0.23240590503172143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147365795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9655979,0.0012219273,0.025579426,0.00012317709,0.000538346,0.00028450356,0.0000028024724,0.00023869572,0.0064132125],"genre_scores_gemma":[0.9917524,0.00022799986,0.007842125,0.000060744856,0.0000029318007,0.000027897955,4.1129124e-7,0.0000135393675,0.00007193681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839133,0.00008618096,0.00022583261,0.0004684457,0.00030781297,0.0005204078],"domain_scores_gemma":[0.99878055,0.00011454292,0.000064863096,0.00080271874,0.000068725756,0.00016859807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627275,0.00017767835,0.00020534857,0.0006472078,0.00016790634,0.00008229475,0.0013557585,0.000087221655,0.00000729787],"category_scores_gemma":[0.000083593986,0.00017286884,0.000071247356,0.0020533905,0.00013181279,0.0004961222,0.0006700232,0.0003138418,0.0000040374816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009121949,0.000092487775,0.035804674,0.000012671692,0.000007463188,0.00005285062,0.0006346377,5.8897916e-7,0.00009918202,0.95983756,0.00006247008,0.0033863022],"study_design_scores_gemma":[0.0006789148,0.00014703776,0.026099557,0.000021091893,0.0000023027153,0.000015689875,0.000052309395,0.00045519345,0.00069215614,0.97141683,0.00020811644,0.00021082195],"about_ca_topic_score_codex":0.000057891586,"about_ca_topic_score_gemma":0.00001225026,"teacher_disagreement_score":0.026154503,"about_ca_system_score_codex":0.000025350902,"about_ca_system_score_gemma":0.00002841798,"threshold_uncertainty_score":0.70493865},"labels":[],"label_agreement":null},{"id":"W2147388035","doi":"10.1007/s10479-005-2452-3","title":"Packing r-Cliques in Weighted Chordal Graphs","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Theory of computation; Discrete mathematics; Disjoint sets; Interval graph; Clique; Vertex (graph theory); Treewidth; Exponential time hypothesis; Graph; Pathwidth; Algorithm; Line graph","score_opus":0.19093514737532585,"score_gpt":0.48248149731860274,"score_spread":0.2915463499432769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147388035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9048279,0.0013951026,0.052437622,0.02738131,0.000072805065,0.000859265,0.000011273462,0.00012340237,0.012891342],"genre_scores_gemma":[0.9683897,0.00056530524,0.03014059,0.00014897803,0.00004436585,0.00007497468,0.0000041622134,0.00001107578,0.0006208317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699885,0.0007013572,0.0003633742,0.00039325294,0.0008894503,0.000653707],"domain_scores_gemma":[0.9976888,0.00031443883,0.000017967724,0.00074950844,0.0010933395,0.00013597799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003528683,0.00010252219,0.00017237343,0.001355587,0.00027285714,0.00019188615,0.0012992785,0.000067151836,0.00008809167],"category_scores_gemma":[0.00045317263,0.00009531931,0.00006463091,0.0027638737,0.0002747372,0.0013922867,0.00041837315,0.0005371667,0.000088712506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027822682,0.0003026346,0.0013219087,0.00001371982,0.000016221156,0.000015871767,0.0014203048,0.0020089757,0.009235642,0.91619134,0.0013708594,0.068074696],"study_design_scores_gemma":[0.0011486652,0.0008506656,0.013233086,0.0002159711,0.0000013854824,0.000020289503,0.00043880777,0.36474288,0.31452745,0.28291592,0.021268148,0.00063675735],"about_ca_topic_score_codex":0.00015097609,"about_ca_topic_score_gemma":0.00063017354,"teacher_disagreement_score":0.63327545,"about_ca_system_score_codex":0.000030861946,"about_ca_system_score_gemma":0.0002134237,"threshold_uncertainty_score":0.38870084},"labels":[],"label_agreement":null},{"id":"W2148094079","doi":"","title":"Those Ubiquitous Cut Polyhedra","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Polyhedron; Conjecture; Mathematics","score_opus":0.02053844516593476,"score_gpt":0.31984719245158366,"score_spread":0.2993087472856489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148094079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08606675,0.000040261868,0.79432213,0.0019494954,0.00093067985,0.0001846864,9.452048e-7,0.00065089564,0.115854174],"genre_scores_gemma":[0.86984575,0.000005451554,0.12199999,0.00048582407,0.00010691384,0.00001242149,3.6479872e-7,0.000009831516,0.007533472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989479,0.00003497771,0.00010033385,0.00030063678,0.00026557094,0.00035053655],"domain_scores_gemma":[0.99873513,0.00012043088,0.000021170346,0.00090719835,0.00006547539,0.0001505806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030491906,0.000086673856,0.00008025306,0.00010921418,0.00010833972,0.00011482459,0.0013609481,0.000050297487,0.0002126837],"category_scores_gemma":[0.000079274825,0.00006915465,0.000045329547,0.00038176242,0.00009341764,0.0004945042,0.0004286311,0.00032005753,0.00054307864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027596486,0.000026963753,0.00018702052,0.0000015675146,0.000002892927,0.000016178237,0.000100473095,0.0000020027094,0.03784747,0.9038503,0.00073820644,0.057224143],"study_design_scores_gemma":[0.00049652875,0.00016165254,0.0017806694,0.000006418006,0.0000019902395,0.00012912175,0.00004538713,0.01241588,0.19996296,0.7084711,0.07603759,0.000490691],"about_ca_topic_score_codex":0.000013265429,"about_ca_topic_score_gemma":0.00005267867,"teacher_disagreement_score":0.78377897,"about_ca_system_score_codex":0.0000067577985,"about_ca_system_score_gemma":0.000049291324,"threshold_uncertainty_score":0.69803584},"labels":[],"label_agreement":null},{"id":"W2148324291","doi":"10.1016/j.dam.2013.01.016","title":"The parametric complexity of graph diameter augmentation","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Parameterized complexity; Graph; Discrete mathematics; Dominating set; Vertex (graph theory)","score_opus":0.042842473168147995,"score_gpt":0.2981992174033175,"score_spread":0.2553567442351695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148324291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035077248,0.000047845533,0.95700914,0.00025232602,0.000049814906,0.0007387649,0.0000030149545,0.000075081756,0.006746744],"genre_scores_gemma":[0.66026634,0.000022604017,0.33941197,0.000039594917,0.000008563192,0.00017194747,0.00000272729,0.000012386085,0.00006388058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985934,0.00003825441,0.0003738133,0.00021624107,0.0004692994,0.00030901763],"domain_scores_gemma":[0.99794334,0.0007873001,0.00021747603,0.0008771038,0.00009930941,0.000075450276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004544623,0.00013425722,0.000192176,0.00013691053,0.00018933894,0.00015412825,0.0010785651,0.000036256282,0.000025390858],"category_scores_gemma":[0.000089341804,0.00008592559,0.00008082259,0.0009026261,0.00044453473,0.0002326027,0.00028722777,0.00012964009,0.0001148332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026258585,0.00004201323,0.00001790174,0.000040718573,0.0000218822,1.8723335e-7,0.00046261208,0.000029593157,0.0033432697,0.9863386,0.00015066666,0.009549912],"study_design_scores_gemma":[0.00018500185,0.000030272618,0.00051506504,0.00000805872,0.000005287078,0.0000014107109,0.0003611597,0.014610792,0.010024433,0.97410136,0.000046523106,0.00011062084],"about_ca_topic_score_codex":0.000007381121,"about_ca_topic_score_gemma":0.0000018890605,"teacher_disagreement_score":0.62518907,"about_ca_system_score_codex":0.000019170331,"about_ca_system_score_gemma":0.000015951857,"threshold_uncertainty_score":0.3503944},"labels":[],"label_agreement":null},{"id":"W2149458512","doi":"10.1007/978-3-642-21458-5_35","title":"Approximation Algorithms for Orienting Mixed Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Computer science; Undirected graph; Approximation algorithm; Graph; Vertex (graph theory); Directed graph; Block graph; Combinatorics; Algorithm; Discrete mathematics; Line graph; Mathematics; Theoretical computer science; Pathwidth","score_opus":0.04011783219635234,"score_gpt":0.28845202270077064,"score_spread":0.2483341905044183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149458512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035490313,0.0002627158,0.99400586,0.00014617103,0.0020117087,0.0009767156,0.000008665627,0.00022575537,0.0023269374],"genre_scores_gemma":[0.018167365,0.000026255322,0.98065263,0.00027765185,0.00027344842,0.00007146753,0.000011876658,0.000055643428,0.00046367076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954529,0.000048278103,0.0005694216,0.001889351,0.001037283,0.0010027942],"domain_scores_gemma":[0.99650264,0.0007472216,0.00036395184,0.0016169831,0.0005619854,0.00020719571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001957578,0.0005297667,0.00051394926,0.0014226069,0.00046125925,0.0004460701,0.004261224,0.00031495898,0.00001263337],"category_scores_gemma":[0.0002331764,0.00049721834,0.00021895584,0.0010099747,0.0008881452,0.001061134,0.0014224064,0.00072695734,0.000027500615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007779948,0.000019531984,0.000010846697,0.00004445543,0.000008798606,0.000011968692,0.000457065,0.0012988338,0.000103831764,0.3554336,0.000007617452,0.64259565],"study_design_scores_gemma":[0.00024038476,0.00014844077,0.000018207831,0.00014318487,0.0000043958844,0.000022303257,1.4853721e-7,0.24518998,0.003043896,0.75000864,0.00072932505,0.0004510997],"about_ca_topic_score_codex":0.000006389283,"about_ca_topic_score_gemma":0.000016900587,"teacher_disagreement_score":0.64214456,"about_ca_system_score_codex":0.00019766278,"about_ca_system_score_gemma":0.00035503967,"threshold_uncertainty_score":0.99974793},"labels":[],"label_agreement":null},{"id":"W2150314982","doi":"10.1109/foci.2007.372179","title":"Search Difficulty of Two-Connected Ring-based Topological Network Designs","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Brock University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Euclidean geometry; Euclidean distance; Ring (chemistry); Unit (ring theory); Bounded function; Computer science; Mathematics; Topology (electrical circuits); Mathematical optimization; Combinatorics; Theoretical computer science; Artificial intelligence; Geometry","score_opus":0.06464240155718863,"score_gpt":0.35013342839844325,"score_spread":0.2854910268412546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150314982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2089996,0.000032950313,0.7862117,0.0001572313,0.00006977576,0.00017559658,5.724156e-7,0.00018338821,0.0041691535],"genre_scores_gemma":[0.8398695,0.0000012229455,0.15974078,0.00014506887,0.00005290026,0.000004260239,0.0000013297397,0.000006769856,0.00017815444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99782395,0.00022177538,0.00029017346,0.0004083001,0.0004925424,0.00076322566],"domain_scores_gemma":[0.9976008,0.00129508,0.000050303166,0.00064182625,0.00021128407,0.00020069478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00178194,0.0001353093,0.00020738061,0.00014535396,0.00014209864,0.00003740386,0.001150363,0.00007444072,0.0001449632],"category_scores_gemma":[0.00014470257,0.0001023162,0.00009065322,0.001264511,0.00026128808,0.0001542857,0.00032018812,0.00026512254,0.000033337637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010644911,0.00017593287,0.008657465,0.000011951252,0.000016065844,0.00005962408,0.00008578555,0.021754375,0.0141507005,0.94634336,0.000101704005,0.008536563],"study_design_scores_gemma":[0.003752412,0.0014300481,0.06859888,0.00006435689,0.000009200168,0.000033358134,0.0001410663,0.34025022,0.39964706,0.1848328,0.00036967214,0.00087092404],"about_ca_topic_score_codex":0.000026027195,"about_ca_topic_score_gemma":0.000040917494,"teacher_disagreement_score":0.7615106,"about_ca_system_score_codex":0.000042986398,"about_ca_system_score_gemma":0.00006638705,"threshold_uncertainty_score":0.41723335},"labels":[],"label_agreement":null},{"id":"W2150704108","doi":"10.1016/s0166-218x(03)00394-9","title":"P5-free augmenting graphs and the maximum stable set problem","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Characterization (materials science); Combinatorics; Maximal independent set; Class (philosophy); Independent set; Set (abstract data type); Chordal graph; Discrete mathematics; Time complexity; Split graph; Indifference graph; Graph; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.018016945328339123,"score_gpt":0.2586677644041901,"score_spread":0.24065081907585098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150704108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080735115,0.000255383,0.8899955,0.0004138714,0.000052020816,0.0012355956,0.000008288658,0.00023701666,0.09972882],"genre_scores_gemma":[0.21214816,0.00007304105,0.78654927,0.0002031907,0.0000120753175,0.0003230271,0.0000030723436,0.000050196562,0.00063798367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981471,0.00007765794,0.00034991332,0.00039264763,0.00048733506,0.0005453766],"domain_scores_gemma":[0.997846,0.0004933006,0.00016654145,0.0013352226,0.000049809783,0.0001091058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017404669,0.00022084218,0.00028877973,0.00009511568,0.00037840125,0.00031027637,0.0012314897,0.00005376699,0.000017924307],"category_scores_gemma":[0.00014078812,0.00014412195,0.00006832157,0.00055536407,0.00034707293,0.00024318787,0.00065539713,0.00024931144,0.000026195174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008281094,0.000022756272,0.000011625938,0.000101924976,0.000028140654,0.000002250499,0.0019549928,0.00003017357,0.0004487005,0.9962366,0.00019076052,0.00096375693],"study_design_scores_gemma":[0.0011601445,0.000014482111,0.0000042293964,0.000022500615,0.000013351081,0.000017817254,0.0008739359,0.004015961,0.0019674248,0.99091995,0.0008003783,0.00018983157],"about_ca_topic_score_codex":0.0000024042342,"about_ca_topic_score_gemma":0.0000026944838,"teacher_disagreement_score":0.20407465,"about_ca_system_score_codex":0.00001815977,"about_ca_system_score_gemma":0.000033793884,"threshold_uncertainty_score":0.5877123},"labels":[],"label_agreement":null},{"id":"W2152026596","doi":"10.1109/sfcs.1997.646109","title":"The analysis of a list-coloring algorithm on a random graph","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Markov chain; Discrete mathematics; Random graph; Upper and lower bounds; Algorithm; Degree (music); Graph; Path (computing); Computer science; Physics; Statistics","score_opus":0.027579936358947225,"score_gpt":0.2840963481317202,"score_spread":0.25651641177277296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152026596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008396272,0.00024474904,0.9774359,0.0005708196,0.000082809034,0.00016862857,0.0000017723626,0.00008862395,0.013010413],"genre_scores_gemma":[0.95404154,0.000246944,0.041327797,0.00016276825,0.00002337545,0.000049794508,4.983845e-7,0.000008672152,0.0041386234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879766,0.00012739735,0.0001812747,0.00024161757,0.00039330378,0.00025876585],"domain_scores_gemma":[0.9981105,0.0009558936,0.00005627241,0.00073185674,0.00008401467,0.0000614693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061121373,0.00008002289,0.00018193068,0.00040955155,0.00019069528,0.00007203459,0.0009774592,0.000022242948,0.00007069483],"category_scores_gemma":[0.000096638774,0.000048038597,0.00020826142,0.0032013722,0.00011406506,0.00015173218,0.00015253793,0.00011333868,0.000018675652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041851206,0.0001215485,0.00027751623,0.000002798502,0.0007030898,0.00001296445,0.0005924343,0.002086722,0.000294018,0.36212397,0.00034383117,0.63339925],"study_design_scores_gemma":[0.00084198767,0.0001278101,0.00087212684,0.0000054823768,0.000054816417,0.0000015687413,0.00005620951,0.9627982,0.0027392306,0.030417843,0.0019518891,0.00013283553],"about_ca_topic_score_codex":0.0000184542,"about_ca_topic_score_gemma":0.00002391719,"teacher_disagreement_score":0.9607115,"about_ca_system_score_codex":0.000014535815,"about_ca_system_score_gemma":0.000005172812,"threshold_uncertainty_score":0.19589572},"labels":[],"label_agreement":null},{"id":"W2152052626","doi":"10.1016/j.dam.2015.01.039","title":"Edge intersection graphs of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si61.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi></mml:math>-shaped paths in grids","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Intersection (aeronautics); Enhanced Data Rates for GSM Evolution; Degenerate energy levels; Computer science; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Physics","score_opus":0.024358024773587825,"score_gpt":0.26992813274272287,"score_spread":0.24557010796913503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152052626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88582104,0.000086088796,0.10887459,0.00007468142,0.0003627513,0.00018278783,0.000035101777,0.0001694733,0.0043934896],"genre_scores_gemma":[0.96070796,0.000056187713,0.038501948,0.00012349858,0.00011452459,0.0002943067,0.000056555527,0.00010089923,0.000044118962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652016,0.00007498302,0.00090425025,0.0006968092,0.0010500918,0.0007537022],"domain_scores_gemma":[0.99715036,0.00045210143,0.000591613,0.0013947857,0.00011248535,0.00029863836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013361918,0.0003963624,0.00038548498,0.0003189131,0.00019738448,0.0002117938,0.0013454546,0.0003403954,0.000013664389],"category_scores_gemma":[0.00032085174,0.00042511072,0.00031469227,0.0008880946,0.00039897286,0.0005955431,0.0010310961,0.00059124216,0.00030339096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001514559,0.00021809149,0.000010547002,0.0003888824,0.0000888361,0.000051087292,0.00384604,0.00044589554,0.0046548154,0.9888614,0.000111909205,0.0011710542],"study_design_scores_gemma":[0.0009817263,0.00032188994,0.00002858617,0.0002611713,0.000052157815,0.00006866379,0.0018394319,0.8886298,0.0101961605,0.09703914,0.00017648037,0.00040479735],"about_ca_topic_score_codex":0.000044919678,"about_ca_topic_score_gemma":0.000062169776,"teacher_disagreement_score":0.8918222,"about_ca_system_score_codex":0.00004089694,"about_ca_system_score_gemma":0.00023719812,"threshold_uncertainty_score":0.99982005},"labels":[],"label_agreement":null},{"id":"W2152329689","doi":"10.1016/j.disc.2005.06.043","title":"On a new reformulation of Hadwiger's conjecture","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Conjecture; Discrete mathematics; Graph; Class (philosophy); Minor (academic); Computer science","score_opus":0.016026557696064973,"score_gpt":0.2854202328056561,"score_spread":0.2693936751095911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152329689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037696306,0.000034204346,0.948758,0.00028824163,0.000044581902,0.00018584245,0.0000034914847,0.00008379227,0.012905561],"genre_scores_gemma":[0.8341741,0.0000015614856,0.16442195,0.00003417752,0.000035841873,0.000004395023,0.000005352378,0.000013504214,0.0013091099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899304,0.000025476687,0.00025516603,0.00017284902,0.00036300448,0.00019043601],"domain_scores_gemma":[0.99898446,0.00018130221,0.00013771452,0.00060023955,0.00004624102,0.00005003511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001880712,0.00010879196,0.00016442199,0.000114507944,0.000047110618,0.000041509687,0.00049523445,0.000047740545,0.000019857986],"category_scores_gemma":[0.00007417569,0.0000812605,0.000068639274,0.00032639527,0.000044322354,0.00018381768,0.000097622855,0.000099693425,0.000032883036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045810707,0.000033613447,0.000021159665,0.00003136992,0.000005423968,0.0000023895982,0.0003656083,0.0012456536,0.00096689863,0.9957677,0.00031535074,0.0012402553],"study_design_scores_gemma":[0.00022248072,0.00008411308,0.0001348781,0.000047315774,0.000002755344,0.0000047848907,0.00001936171,0.032157045,0.0101748435,0.95685744,0.00019811217,0.000096849406],"about_ca_topic_score_codex":0.00001433621,"about_ca_topic_score_gemma":0.0000046877713,"teacher_disagreement_score":0.7964778,"about_ca_system_score_codex":0.000025409376,"about_ca_system_score_gemma":0.000036202746,"threshold_uncertainty_score":0.3313707},"labels":[],"label_agreement":null},{"id":"W2152727633","doi":"10.1145/944618.944629","title":"Solving a \"Hard\" problem to approximate an \"Easy\" one","year":2002,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Heuristic; Matching (statistics); Mathematical optimization; Travelling salesman problem; Duality (order theory); Combinatorics; Algorithm","score_opus":0.05586580032839563,"score_gpt":0.3173452730164984,"score_spread":0.2614794726881028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152727633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21814232,0.0037169885,0.7733507,0.0016148534,0.00070841017,0.0006261294,0.000007259069,0.00015323539,0.0016801062],"genre_scores_gemma":[0.2161852,0.00006558687,0.7830274,0.00032842788,0.00022166074,0.000012049079,5.1457107e-7,0.000026569509,0.0001325606],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976645,0.00012994822,0.00052028237,0.0003441802,0.00080241455,0.0005386491],"domain_scores_gemma":[0.9980916,0.000084311825,0.00024522986,0.00082406483,0.0002453711,0.00050945417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006362151,0.00020777324,0.00031161672,0.00032487584,0.00018956067,0.00024280105,0.002716275,0.000058465048,0.00007419412],"category_scores_gemma":[0.000099265824,0.00019485073,0.00012765847,0.0005729133,0.00007648044,0.001716838,0.00083498185,0.00036544583,0.00005024655],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017680714,0.0035562543,0.00027425474,0.000030978834,0.00023389721,0.0006245044,0.013977603,0.0009753841,0.73064965,0.051187877,0.0015637567,0.19674903],"study_design_scores_gemma":[0.004718468,0.008973921,0.000293426,0.00039434212,0.00003098478,0.0032105267,0.0025151302,0.1918752,0.675935,0.10519209,0.0050673555,0.0017936159],"about_ca_topic_score_codex":0.000004014449,"about_ca_topic_score_gemma":3.8754015e-7,"teacher_disagreement_score":0.19495542,"about_ca_system_score_codex":0.00017676713,"about_ca_system_score_gemma":0.000034610755,"threshold_uncertainty_score":0.7945782},"labels":[],"label_agreement":null},{"id":"W2152845747","doi":"10.7155/jgaa.00435","title":"Egalitarian Graph Orientations","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Lexicographical order; Orientation (vector space); Graph; Directed graph; Vertex (graph theory); Computer science; Undirected graph; Combinatorics; Mathematics; Geometry","score_opus":0.02522473167498975,"score_gpt":0.33448234752013234,"score_spread":0.3092576158451426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152845747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002845408,0.00047206428,0.99299127,0.0022031516,0.0001306615,0.00017398827,0.000009114713,0.00001958716,0.001154752],"genre_scores_gemma":[0.5644418,0.0014103125,0.4329495,0.00019576839,0.0004823866,0.00011333198,0.0000027709048,0.00002273355,0.00038139895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989839,0.000034904115,0.00030689148,0.0001905607,0.00028826203,0.00019549036],"domain_scores_gemma":[0.99822074,0.00009056003,0.00041110854,0.0007204066,0.00034338472,0.0002138069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048713607,0.00009730882,0.00015968483,0.000282199,0.0010995595,0.00038251333,0.0012257333,0.000039301725,0.0000057079656],"category_scores_gemma":[0.000050525978,0.00008195489,0.00011581317,0.0003125527,0.0002835002,0.001024996,0.00016336699,0.00022786402,0.000004992747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046742784,0.00009050565,0.0012667689,0.000006256256,0.000046000543,0.000009401562,0.00018308328,0.000021159856,0.0003960288,0.8598692,0.00030774722,0.1377992],"study_design_scores_gemma":[0.0006126417,0.00013255383,0.01937512,0.000019072653,0.00002074473,0.00017819149,0.00015291719,0.000680419,0.00038130407,0.9499973,0.02827923,0.0001705013],"about_ca_topic_score_codex":0.000013117323,"about_ca_topic_score_gemma":0.0000060465127,"teacher_disagreement_score":0.5615964,"about_ca_system_score_codex":0.000011755903,"about_ca_system_score_gemma":0.00006017908,"threshold_uncertainty_score":0.84570336},"labels":[],"label_agreement":null},{"id":"W2153068117","doi":"10.5555/982792.982848","title":"The list partition problem for graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Mathematics; Clique problem; Time complexity; Skew; Discrete mathematics; Clique; Chordal graph; Graph; Computer science; 1-planar graph","score_opus":0.015776286400295332,"score_gpt":0.2901337696210354,"score_spread":0.27435748322074005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153068117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013307013,0.00021566502,0.9690411,0.021439897,0.0006116871,0.0014611529,0.000034586414,0.00036338647,0.005501797],"genre_scores_gemma":[0.7363243,0.0007491141,0.25420004,0.0014521551,0.00058141863,0.0029074636,0.00006851648,0.00014424171,0.003572754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979717,0.00008568925,0.0002624267,0.0005487416,0.00047302837,0.0006584134],"domain_scores_gemma":[0.9984477,0.00027910518,0.000095448675,0.00087497843,0.00014428957,0.00015844418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066661346,0.00020284171,0.00014670985,0.00010600607,0.0008154583,0.0003561933,0.0012404952,0.0000645394,0.0000023599416],"category_scores_gemma":[0.00004131074,0.00013728162,0.00017237966,0.00054058834,0.00023047785,0.00048889336,0.0001783762,0.00020346197,0.00004942552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043987046,0.000050841365,0.000009340132,0.00001239486,0.000022901213,0.000005325031,0.00021465769,0.0013339702,0.0022529883,0.983965,0.00029207242,0.011796545],"study_design_scores_gemma":[0.0009397931,0.0006960255,0.0000526656,0.000040449224,0.0000061782957,0.000010862535,0.00004305682,0.0063895383,0.01743832,0.96023005,0.0138853695,0.00026766383],"about_ca_topic_score_codex":0.000015171542,"about_ca_topic_score_gemma":0.000018245955,"teacher_disagreement_score":0.7349936,"about_ca_system_score_codex":0.00009031494,"about_ca_system_score_gemma":0.00007807605,"threshold_uncertainty_score":0.62719285},"labels":[],"label_agreement":null},{"id":"W2153548489","doi":"10.1016/j.disc.2005.12.032","title":"How to build a brick","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Graph factorization; Factor-critical graph; Conjecture; Matching (statistics); Graph; Connected component; Discrete mathematics; Graph power; Line graph","score_opus":0.01802467165638636,"score_gpt":0.283069835033532,"score_spread":0.2650451633771456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153548489","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011221844,0.000043341868,0.97585905,0.0027758912,0.000060483864,0.00025405694,0.000004176245,0.00019358682,0.0095876],"genre_scores_gemma":[0.347391,0.0000017061543,0.6446702,0.0001588044,0.00008132516,0.000041438485,0.0000022476681,0.000024539153,0.007628711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986663,0.000032112763,0.00017534062,0.00029612402,0.00043052965,0.00039963354],"domain_scores_gemma":[0.9987394,0.00013850321,0.000060189253,0.0008662803,0.000077838,0.000117768686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026548168,0.00014250584,0.00017182546,0.00013904127,0.000098347446,0.00039577237,0.0010896829,0.000036208243,0.000007632707],"category_scores_gemma":[0.00013113928,0.00011879123,0.00007453822,0.00065360946,0.000047500802,0.0003422168,0.00039949565,0.0001067924,0.00015182601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014574749,0.00004352602,0.00004922334,0.00003186504,0.0000054785523,0.000014902362,0.00034263756,0.00009289842,0.0018709874,0.9938681,0.0018086025,0.0018702886],"study_design_scores_gemma":[0.00020140794,0.00007982811,0.0001923679,0.000042838405,0.0000043343134,0.00002804692,0.0001371057,0.020942379,0.0073446357,0.95589644,0.01480105,0.00032959474],"about_ca_topic_score_codex":0.00000576048,"about_ca_topic_score_gemma":0.0000065837353,"teacher_disagreement_score":0.33616918,"about_ca_system_score_codex":0.000030583367,"about_ca_system_score_gemma":0.000019192104,"threshold_uncertainty_score":0.48441657},"labels":[],"label_agreement":null},{"id":"W2154102540","doi":"10.1002/jgt.21644","title":"Star Chromatic Index","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Combinatorics; Mathematical proof; Chromatic scale; Upper and lower bounds; Star (game theory); Edge coloring; Graph; Discrete mathematics; Graph power; Line graph; Geometry","score_opus":0.018121822264892704,"score_gpt":0.28821578885559107,"score_spread":0.27009396659069834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154102540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29601184,0.0030493557,0.69782865,0.00022929543,0.0007933139,0.000096222,8.1555316e-7,0.000043232812,0.0019472656],"genre_scores_gemma":[0.9821605,0.0000668524,0.017238053,0.00019060791,0.00019765686,0.0000018217266,9.222437e-8,0.000013195407,0.00013123393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791026,0.0004919344,0.00041296275,0.00010658074,0.00060544274,0.0004728127],"domain_scores_gemma":[0.9981806,0.000503568,0.0003463479,0.00047286716,0.0001882395,0.00030834205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040241545,0.00013097853,0.0002459344,0.00057810656,0.00011192367,0.000060502985,0.0013192173,0.00005504514,0.00007613389],"category_scores_gemma":[0.0002445222,0.00009850667,0.00021076565,0.000709442,0.0001656865,0.0016836673,0.00018030292,0.0004169354,0.00004306855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008619467,0.00018719457,0.004579586,0.000022449785,0.00010160607,0.000037333466,0.0012697042,0.00003363028,0.0025281135,0.9717501,0.00044833837,0.018955762],"study_design_scores_gemma":[0.00047680308,0.00020267196,0.012191824,0.000049943872,0.00001158908,0.0003945649,0.00019943363,0.00015674159,0.0020115913,0.98250747,0.0016387978,0.00015854272],"about_ca_topic_score_codex":4.237373e-7,"about_ca_topic_score_gemma":1.9391182e-7,"teacher_disagreement_score":0.68614864,"about_ca_system_score_codex":0.00004414939,"about_ca_system_score_gemma":0.00006896524,"threshold_uncertainty_score":0.40169856},"labels":[],"label_agreement":null},{"id":"W2154125058","doi":"10.37236/4283","title":"Partial List Colouring of Certain Graphs","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Chromatic scale; Chordal graph; Graph; Discrete mathematics","score_opus":0.023696122225726795,"score_gpt":0.28696886160853197,"score_spread":0.26327273938280515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154125058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5968964,0.0050169905,0.39413083,0.0018615461,0.00084281364,0.0001866987,4.907703e-7,0.00003382281,0.0010303933],"genre_scores_gemma":[0.9994472,0.0001758915,0.0001518403,0.000029211207,0.000041970303,0.0000017486879,9.271484e-8,0.000010302922,0.00014168733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977349,0.0003483371,0.00042788743,0.000114471295,0.0007905925,0.00058382854],"domain_scores_gemma":[0.99803823,0.00031121334,0.00044991795,0.0004571332,0.00058456906,0.00015891752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033127822,0.000115538605,0.00026028874,0.00018953868,0.0000946968,0.00004504056,0.0019928985,0.000044538872,0.0000023751595],"category_scores_gemma":[0.00030930366,0.00007992462,0.00013322182,0.0009821694,0.0001377645,0.0003691048,0.00021530567,0.0007109269,0.0000029569999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007460968,0.00009362292,0.0003228158,0.000004630856,0.000045588687,0.000011929411,0.0004293911,0.00033495747,0.0004138221,0.9972379,0.00015795216,0.00087278517],"study_design_scores_gemma":[0.0008549841,0.0010374015,0.000051269864,0.000014451021,0.000012265088,0.00014512807,0.000106877575,0.0010195652,0.009801299,0.9844875,0.002384501,0.00008475373],"about_ca_topic_score_codex":0.000006617096,"about_ca_topic_score_gemma":0.000002783564,"teacher_disagreement_score":0.40255085,"about_ca_system_score_codex":0.00022952895,"about_ca_system_score_gemma":0.00082381256,"threshold_uncertainty_score":0.37033343},"labels":[],"label_agreement":null},{"id":"W2154562890","doi":"10.1007/s00373-009-0853-9","title":"Minimum Cost Homomorphism Dichotomy for Oriented Cycles","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Combinatorics; Digraph; Mathematics; Conjecture; Vertex (graph theory); Graph; Algebra homomorphism; Discrete mathematics; Graph homomorphism; Line graph; Graph power","score_opus":0.017969535926905988,"score_gpt":0.2812984227620912,"score_spread":0.26332888683518524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154562890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26600733,0.0025374682,0.72102314,0.002621514,0.0012578211,0.0020748437,0.000032644362,0.0006802153,0.0037650112],"genre_scores_gemma":[0.9944737,0.00020052044,0.004644912,0.00030842164,0.00001294256,0.00007685198,0.0000063666207,0.000011010546,0.0002653016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861586,0.000042346972,0.00018853297,0.00042655919,0.00027634806,0.0004503424],"domain_scores_gemma":[0.99888045,0.00017851927,0.00006661787,0.0004898216,0.00017662611,0.00020798546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002898693,0.00017058261,0.00020146983,0.0002216227,0.00031707523,0.0001225501,0.00059519534,0.000074314696,0.0000019078168],"category_scores_gemma":[0.000056301968,0.00015872985,0.00008652658,0.00089760456,0.00010419758,0.0003384531,0.0001091525,0.00015374187,0.0000036024671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018581655,0.00011473295,0.0006525428,0.000008294314,0.000008809053,0.000010136179,0.00011665099,0.0000012241994,0.0001897164,0.96985924,0.00078167475,0.028238405],"study_design_scores_gemma":[0.0011500893,0.00039909213,0.0028994603,0.000012520665,0.000005824257,0.000010773423,0.00003011565,0.0023601404,0.00064857496,0.97386295,0.018399606,0.00022083225],"about_ca_topic_score_codex":0.0000020807138,"about_ca_topic_score_gemma":5.910804e-7,"teacher_disagreement_score":0.72846633,"about_ca_system_score_codex":0.000021999107,"about_ca_system_score_gemma":0.000030751817,"threshold_uncertainty_score":0.6472815},"labels":[],"label_agreement":null},{"id":"W2154587131","doi":"","title":"Parallel morphing of trees and cycles.","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Morphing; Computer science; Knot (papermaking); Combinatorics; Parallel algorithm; Mathematics; Parallel computing; Artificial intelligence","score_opus":0.026972647115311197,"score_gpt":0.2922693954198176,"score_spread":0.2652967483045064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154587131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06437899,0.00022398468,0.91112906,0.00016264692,0.000022399841,0.000060028506,1.9625783e-7,0.00004349833,0.023979174],"genre_scores_gemma":[0.8287649,0.000019649025,0.17075686,0.000033850683,0.0000019558474,0.0000019378292,3.9438138e-8,0.0000022352456,0.00041857074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994803,0.00004610664,0.0000792182,0.00014293691,0.00012046108,0.00013099448],"domain_scores_gemma":[0.99957544,0.00009035055,0.00001929284,0.00024330751,0.000024189843,0.00004743448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022063476,0.000043314794,0.00007030611,0.000061745886,0.000034144974,0.000020540076,0.00023571668,0.000014733939,0.000017184142],"category_scores_gemma":[0.000051929233,0.00003496565,0.00001642924,0.0001730114,0.000068152825,0.00023362553,0.00008029477,0.000045226578,0.000004731011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014062285,0.00001098502,0.0022950657,0.000002911845,0.0000030899853,0.0000024021429,0.000092415125,0.00009757773,0.0015203194,0.989718,0.000031662606,0.0062241526],"study_design_scores_gemma":[0.0005929182,0.000096357275,0.01088671,0.0000124607695,0.0000016566877,0.000030724437,0.00012324008,0.0113108745,0.023690697,0.951371,0.0016938016,0.0001895371],"about_ca_topic_score_codex":0.000004484572,"about_ca_topic_score_gemma":0.000007897181,"teacher_disagreement_score":0.7643859,"about_ca_system_score_codex":0.0000035243672,"about_ca_system_score_gemma":0.00001228052,"threshold_uncertainty_score":0.1425858},"labels":[],"label_agreement":null},{"id":"W2155131920","doi":"10.1007/s10114-010-9006-6","title":"The existence of even regular factors of regular graphs on the number of cut edges","year":2010,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Wilfrid Laurier University","funders":"","keywords":"Multigraph; Combinatorics; Integer (computer science); Mathematics; Factor (programming language); Characterization (materials science); Discrete mathematics; Two-graph; Graph; Computer science; Physics; Line graph","score_opus":0.02358314849516185,"score_gpt":0.2832969816802185,"score_spread":0.25971383318505664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155131920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874553,0.000048255795,0.00072162884,0.0011346855,0.00033970864,0.00047019462,0.000017616156,0.00007775909,0.009734827],"genre_scores_gemma":[0.9888114,0.000070392045,0.010607606,0.000013690138,0.000024239454,0.000029069204,9.43712e-7,0.00002300483,0.00041967875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974577,0.00027828044,0.0007262572,0.00034044395,0.00083012437,0.00036719188],"domain_scores_gemma":[0.9911398,0.0046804743,0.00059088133,0.0028444564,0.00066342606,0.00008092994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001728229,0.00023356831,0.0004811153,0.0000803563,0.00022544207,0.000068946145,0.003209292,0.00011395278,0.00004634023],"category_scores_gemma":[0.005212895,0.00012771972,0.00024076758,0.0006902238,0.0020756575,0.000599705,0.00056630454,0.00041624956,0.0000036712588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038611204,0.00012553262,0.00025053165,0.0001099237,0.000066461966,8.1097477e-7,0.004720549,9.838426e-7,0.012080924,0.9818897,0.00027279527,0.00044317747],"study_design_scores_gemma":[0.0001455931,0.00016968124,0.00093774986,0.00015709248,0.00001688736,0.0000071545805,0.0024584564,0.00005790892,0.29277304,0.70096195,0.0021484564,0.00016601247],"about_ca_topic_score_codex":0.0000034952552,"about_ca_topic_score_gemma":0.000007444133,"teacher_disagreement_score":0.28092775,"about_ca_system_score_codex":0.000007942429,"about_ca_system_score_gemma":0.00008356511,"threshold_uncertainty_score":0.76478463},"labels":[],"label_agreement":null},{"id":"W2155466993","doi":"10.1007/s101070100256","title":"Matching, matroids, and extensions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Intersection (aeronautics); Matching (statistics); Jump; Path (computing); Mathematical optimization; Matroid partitioning; Combinatorial optimization; Combinatorics; Computer science; Graphic matroid","score_opus":0.036746783843772134,"score_gpt":0.2923804867600973,"score_spread":0.2556337029163252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155466993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022702303,0.00038775726,0.9718021,0.00095232535,0.000034465014,0.00027303133,3.0288965e-7,0.0003807093,0.0034669877],"genre_scores_gemma":[0.46638653,0.000013039571,0.5328885,0.00008520607,0.00002065588,0.00003629862,1.9253032e-7,0.0000139319145,0.00055569806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869394,0.00005607458,0.00020075083,0.00032219832,0.00029819887,0.00042884162],"domain_scores_gemma":[0.9989765,0.0002696671,0.000037456735,0.00048629555,0.000037690377,0.00019238729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003650503,0.0001264199,0.00016852302,0.00008926821,0.00020537614,0.0002352398,0.00045034187,0.000044074965,0.00010101212],"category_scores_gemma":[0.00012285117,0.00010295183,0.000049408063,0.00029586387,0.00014373226,0.00033489414,0.00040708762,0.00020140885,0.00031568343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.140889e-7,0.00008502819,0.000011884278,0.000046785015,0.000006351653,0.000026975064,0.0008254477,0.0000018435132,0.0004298041,0.8136287,0.00006297431,0.18487354],"study_design_scores_gemma":[0.00016919759,0.00006488729,0.000023795632,0.000050470455,0.0000044000108,0.00016615934,0.00012700637,0.028642753,0.00021857537,0.96788234,0.0024692323,0.00018120334],"about_ca_topic_score_codex":0.0000011067322,"about_ca_topic_score_gemma":4.2117114e-7,"teacher_disagreement_score":0.44368422,"about_ca_system_score_codex":0.000012847633,"about_ca_system_score_gemma":0.0000033828298,"threshold_uncertainty_score":0.41982538},"labels":[],"label_agreement":null},{"id":"W2155865206","doi":"10.1017/s0963548307008905","title":"Induced Forests in Regular Graphs with Large Girth","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Upper and lower bounds; Random regular graph; Random graph; Graph; Discrete mathematics; Line graph; Pathwidth","score_opus":0.033503244209739276,"score_gpt":0.271821734146239,"score_spread":0.23831848993649973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155865206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84225315,0.0000928011,0.15585245,0.00015318084,0.0001921426,0.00063278974,7.1156893e-7,0.00030706174,0.0005157246],"genre_scores_gemma":[0.9846421,0.0000048568436,0.015214978,0.00005087719,0.000014482839,0.00002107814,0.000002340905,0.000025368072,0.000023935034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962868,0.0004132626,0.00049823406,0.0010037158,0.0007743304,0.0010236655],"domain_scores_gemma":[0.99733466,0.00041091876,0.00017091751,0.0014976384,0.00036060263,0.00022527091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018682014,0.00030747795,0.0004192483,0.00040075433,0.00050285977,0.00007724794,0.0017204284,0.00013019143,0.0000020772907],"category_scores_gemma":[0.00034687977,0.00028558722,0.00009314506,0.003407986,0.00020646435,0.0006333402,0.0010201393,0.00073894975,0.000011331878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021248388,0.00044703466,0.31483752,0.00004898432,0.00001003129,0.00012835773,0.00092975254,0.00046062848,0.0000720165,0.68160295,0.000012775729,0.0014286812],"study_design_scores_gemma":[0.0016877177,0.00035590335,0.1376394,0.00006804663,0.0000018591944,0.00008050857,0.000027619273,0.03184645,0.0009132,0.8268795,0.00007898298,0.00042078973],"about_ca_topic_score_codex":0.00002026223,"about_ca_topic_score_gemma":0.000053555013,"teacher_disagreement_score":0.17719811,"about_ca_system_score_codex":0.00026738903,"about_ca_system_score_gemma":0.00025957814,"threshold_uncertainty_score":0.99995965},"labels":[],"label_agreement":null},{"id":"W2156623776","doi":"10.1006/jagm.2001.1195","title":"On Graph Powers for Leaf-Labeled Trees","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Gomory–Hu tree; Mathematics; Tree (set theory); Graph; K-ary tree; Spanning tree; Path (computing); Basis (linear algebra); Trémaux tree; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Computer science; Binary tree; Line graph; Artificial intelligence; Pathwidth","score_opus":0.03359346603976615,"score_gpt":0.3027998815668668,"score_spread":0.2692064155271007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156623776","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097192405,0.00069466326,0.98557234,0.002310569,0.000749701,0.00017353956,0.0000037247878,0.000036190875,0.0007400155],"genre_scores_gemma":[0.40852866,0.0006586592,0.5845398,0.0012465067,0.0008120199,0.000022098558,0.0000013396473,0.00006987902,0.0041210833],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850637,0.00007176486,0.00034095114,0.00018774685,0.0005465663,0.000346585],"domain_scores_gemma":[0.9984966,0.00045711308,0.00024202022,0.0003318491,0.00029420113,0.00017822681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063958456,0.00012737926,0.00023546127,0.00042444354,0.000121740195,0.000090933114,0.0010450741,0.000051076942,0.000044336466],"category_scores_gemma":[0.00021798935,0.00009901651,0.0002315064,0.00050153997,0.000071289294,0.0005336372,0.000058144436,0.00029021373,0.000025938827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037223147,0.0012903877,0.00011639311,0.00003790876,0.00040323188,0.00046872694,0.0021690724,0.004201855,0.007837825,0.1827552,0.03441151,0.76593566],"study_design_scores_gemma":[0.009287728,0.010961228,0.0005601627,0.00022326867,0.000043539087,0.0007936193,0.00027578312,0.18355268,0.015902309,0.73309547,0.044389997,0.00091422733],"about_ca_topic_score_codex":5.431888e-7,"about_ca_topic_score_gemma":6.3118864e-7,"teacher_disagreement_score":0.76502144,"about_ca_system_score_codex":0.000049036018,"about_ca_system_score_gemma":0.000024077523,"threshold_uncertainty_score":0.40377763},"labels":[],"label_agreement":null},{"id":"W2157516444","doi":"10.1016/j.disc.2008.09.016","title":"Regular graphs are not universal fixers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics; Domination analysis","score_opus":0.03252796891485716,"score_gpt":0.2708205054394022,"score_spread":0.23829253652454507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157516444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13569912,0.00007941735,0.8546847,0.0008263878,0.00014665323,0.00032012918,0.000013171878,0.00040861618,0.007821818],"genre_scores_gemma":[0.7820902,0.0000675478,0.21497388,0.00016989782,0.000028240154,0.000014786781,0.0000040194377,0.000035412086,0.0026160446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839914,0.00006489514,0.00022951554,0.00033849644,0.00055741804,0.00041052775],"domain_scores_gemma":[0.99838966,0.00017469814,0.0001356723,0.001044009,0.000098916076,0.00015705194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026393402,0.00017902216,0.00023617453,0.00018606974,0.00027211563,0.000055611094,0.0012492274,0.0000628501,0.000023633027],"category_scores_gemma":[0.00011427533,0.00015740123,0.00013556422,0.00064161944,0.0002809002,0.0004559468,0.00035526635,0.00019381988,0.00012729291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000826068,0.00007577642,0.00022527424,0.00005643359,0.000031502164,0.00021832463,0.0027353363,0.000106701285,0.0008649729,0.994366,0.00086412206,0.00044730518],"study_design_scores_gemma":[0.0012088943,0.0001841863,0.0012601126,0.00016539235,0.000020886164,0.0003145857,0.0019877318,0.06611869,0.016708625,0.90736455,0.0037140977,0.0009522263],"about_ca_topic_score_codex":0.000002227121,"about_ca_topic_score_gemma":0.0000014035945,"teacher_disagreement_score":0.64639103,"about_ca_system_score_codex":0.00003904968,"about_ca_system_score_gemma":0.000044283828,"threshold_uncertainty_score":0.6418636},"labels":[],"label_agreement":null},{"id":"W2158650522","doi":"10.2478/s12175-012-0033-x","title":"Foolproof eternal domination in the all-guards move model","year":2012,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Guard (computer science); Vertex (graph theory); Combinatorics; Mathematics; Graph; Computer science","score_opus":0.0501408267125466,"score_gpt":0.3358446225101964,"score_spread":0.2857037957976498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158650522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08653341,0.00014237751,0.89860415,0.0011140809,0.00006356649,0.00039662505,0.0000012423258,0.000064293665,0.013080248],"genre_scores_gemma":[0.9098764,0.0000060745333,0.08928898,0.0003500368,0.000044427103,0.000103075385,8.1193934e-7,0.000011947122,0.0003182184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823624,0.00016093953,0.00026465172,0.00021243133,0.00063203316,0.0004936998],"domain_scores_gemma":[0.9986808,0.00035737647,0.0000771322,0.0007562216,0.000048398215,0.000080102676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017021095,0.00013788366,0.00015883293,0.00016365272,0.000072369796,0.0001021043,0.001455655,0.00005662615,0.000019300269],"category_scores_gemma":[0.00016861744,0.00009244635,0.00007080174,0.00043212157,0.000059713166,0.00080308324,0.00026941908,0.0002554944,0.00014127877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007906656,0.00020517019,0.00007211887,0.00003845777,0.0000107957185,0.0000044414,0.009231843,0.00044574714,0.00079854473,0.97926414,0.00030429946,0.009616548],"study_design_scores_gemma":[0.00025819338,0.000021432332,0.00038916455,0.000022462833,0.0000040063587,0.00002978616,0.00014701423,0.38769495,0.0012687533,0.6097551,0.00027851423,0.00013058084],"about_ca_topic_score_codex":0.0000014508305,"about_ca_topic_score_gemma":0.0000010439493,"teacher_disagreement_score":0.82334304,"about_ca_system_score_codex":0.000055844313,"about_ca_system_score_gemma":0.00002382665,"threshold_uncertainty_score":0.37698528},"labels":[],"label_agreement":null},{"id":"W2160146903","doi":"10.1287/moor.1070.0254","title":"The Demand-Matching Problem","year":2007,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Mathematics; Knapsack problem; Cardinality (data modeling); Matching (statistics); Combinatorics; Tree (set theory); Clos network; Discrete mathematics; Approximation algorithm; Time complexity; Node (physics); 3-dimensional matching; Mathematical optimization; Graph; Computer science","score_opus":0.07242089226921299,"score_gpt":0.4165825610196921,"score_spread":0.3441616687504791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160146903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03455,0.00018947113,0.9509739,0.0010861579,0.000034410485,0.00054976525,0.0000011104233,0.00004646869,0.012568662],"genre_scores_gemma":[0.6031462,0.000050570667,0.39469233,0.000010124559,0.000027998612,0.0000525564,7.653765e-7,0.000013155383,0.0020062742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735224,0.00021134592,0.00043739052,0.00021873027,0.0011923335,0.000587941],"domain_scores_gemma":[0.99581534,0.0021803104,0.0000306072,0.0010010408,0.00086763303,0.00010507737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013189653,0.00008538624,0.00012508879,0.00030509644,0.001219528,0.00035862994,0.001892312,0.00004305293,0.000011251888],"category_scores_gemma":[0.00074395514,0.000056171044,0.000050174556,0.0012435118,0.0003512672,0.00042233217,0.0006535216,0.0004135467,0.00007787811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035206706,0.00009046055,0.000011363189,0.000034895664,0.000012219486,0.0000036576168,0.0025536239,0.0014760054,0.00833115,0.9815906,0.0001083848,0.0057840752],"study_design_scores_gemma":[0.00024072344,0.00014650694,0.000108428794,0.00007734314,0.0000018588122,0.00002279547,0.0019697607,0.08510424,0.03580449,0.874994,0.0013773266,0.0001525328],"about_ca_topic_score_codex":0.000018894361,"about_ca_topic_score_gemma":0.00014282636,"teacher_disagreement_score":0.56859624,"about_ca_system_score_codex":0.000048969097,"about_ca_system_score_gemma":0.00014156509,"threshold_uncertainty_score":0.9379747},"labels":[],"label_agreement":null},{"id":"W2161005000","doi":"10.1016/j.jctb.2007.02.005","title":"Excluding a planar graph from<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">GF</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-representable matroids","year":2007,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Scroll; Graphic matroid; Combinatorics; Antichain; Matroid partitioning; Mathematics; Oriented matroid; Binary number; Graph; Planar graph; Discrete mathematics; Partially ordered set; Arithmetic","score_opus":0.01835145302768177,"score_gpt":0.259835901032013,"score_spread":0.24148444800433122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161005000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97004676,0.0026844759,0.008200562,0.0005931474,0.01122038,0.00017557768,0.00032958077,0.0003090888,0.0064404416],"genre_scores_gemma":[0.9873767,0.0015319075,0.0051799268,0.00058894977,0.0042595635,0.00017309556,0.000141158,0.0005830294,0.00016567565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98516005,0.001415095,0.0033666564,0.0020350015,0.0045154896,0.003507691],"domain_scores_gemma":[0.9873999,0.0037287637,0.003739329,0.002631157,0.00068419037,0.0018166793],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.008564274,0.0013995748,0.0010691637,0.0011658977,0.0026595027,0.0027313994,0.0051987837,0.0020955137,0.0019350812],"category_scores_gemma":[0.0023536442,0.0020133671,0.0023127098,0.0022695211,0.002330605,0.0048697274,0.0030458965,0.0037096383,0.00086266466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008477434,0.0007298431,0.00007220373,0.00053480896,0.0022829357,0.0033786078,0.0033868353,0.0016663405,0.00452084,0.96505606,0.007214174,0.0026799275],"study_design_scores_gemma":[0.005196676,0.0043920074,0.00007264996,0.0017430726,0.0010200995,0.0030175224,0.005147141,0.020192627,0.25631103,0.69617206,0.004655645,0.0020794529],"about_ca_topic_score_codex":0.00076212845,"about_ca_topic_score_gemma":0.00018329817,"teacher_disagreement_score":0.26888397,"about_ca_system_score_codex":0.00011281945,"about_ca_system_score_gemma":0.0017179458,"threshold_uncertainty_score":0.9999153},"labels":[],"label_agreement":null},{"id":"W2161217328","doi":"10.1016/j.comgeo.2012.10.012","title":"Making triangulations 4-connected using flips","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Triangulation; Upper and lower bounds; Mathematics; Matching (statistics); Enhanced Data Rates for GSM Evolution; Graph; Connectivity; Discrete mathematics; Computer science; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.12301935982546466,"score_gpt":0.3872212644220547,"score_spread":0.26420190459659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161217328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14219287,0.000316179,0.8560379,0.00011766333,0.00034582533,0.000118522235,0.000004186662,0.00015648238,0.00071035407],"genre_scores_gemma":[0.71490806,3.9883025e-7,0.2847418,0.00012921852,0.00014585098,0.0000046981263,0.000008906557,0.000009571528,0.000051504772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850655,0.00012637943,0.0002273863,0.00024478856,0.0004523533,0.00044255343],"domain_scores_gemma":[0.99864256,0.0006396051,0.000092135146,0.00030133172,0.00018961784,0.00013472587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051774806,0.00011929796,0.00013122882,0.00058263756,0.00029564384,0.00010194859,0.00051707076,0.000050374652,0.00008619341],"category_scores_gemma":[0.00027276255,0.00012548688,0.00007233339,0.0020335757,0.0000626308,0.0010220691,0.00026788918,0.00016046817,0.00012518515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010992853,0.00012342191,0.01094814,0.000013779352,0.00004382638,0.000005066891,0.0004114487,0.18093392,0.0005306661,0.78920174,0.00014380002,0.017633192],"study_design_scores_gemma":[0.00055496243,0.000025213807,0.07613393,0.000024864286,0.0000079774,0.00009656153,0.00005443267,0.72874266,0.00019867088,0.192611,0.001214743,0.00033501597],"about_ca_topic_score_codex":0.0000014869483,"about_ca_topic_score_gemma":1.9114705e-7,"teacher_disagreement_score":0.59659076,"about_ca_system_score_codex":0.00008795911,"about_ca_system_score_gemma":0.00007445452,"threshold_uncertainty_score":0.51172066},"labels":[],"label_agreement":null},{"id":"W2162051090","doi":"10.1016/j.jctb.2005.09.005","title":"On Rota's conjecture and excluded minors containing large projective geometries","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Matroid; Conjecture; Projective test; Projective plane; Combinatorics; Projective geometry; Mathematics; Class (philosophy); Finite geometry; Projective space; Pure mathematics; Algebraic geometry; Geometry; Computer science; Art; Artificial intelligence; Humanities","score_opus":0.010669057554638726,"score_gpt":0.2770127638668002,"score_spread":0.2663437063121615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162051090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93643993,0.0014702023,0.05171362,0.0017247634,0.00394492,0.00055315875,0.000012392687,0.000108866945,0.004032136],"genre_scores_gemma":[0.996579,0.000056507317,0.0024462664,0.0001797389,0.00046819498,0.000005925781,4.8267145e-7,0.000018432873,0.00024546572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773425,0.00047637324,0.0004609697,0.00026107024,0.00062645995,0.0004408634],"domain_scores_gemma":[0.9973001,0.0013034608,0.00043592922,0.0003450906,0.00042002875,0.00019542189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026356135,0.00023507369,0.00045831478,0.00050903525,0.00029780096,0.00022264947,0.00082146627,0.00011841866,0.00004305511],"category_scores_gemma":[0.0013763632,0.00018575379,0.00012550938,0.00064787,0.00026236716,0.0016196541,0.0002747083,0.0006594556,0.000005376435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019744723,0.000121163124,0.00012803753,0.000009701464,0.0000844673,0.000057185753,0.0020144598,0.000029668761,0.00030885282,0.98718625,0.00015279868,0.007932959],"study_design_scores_gemma":[0.0028514976,0.0031728875,0.00027363916,0.00006156518,0.000012677438,0.00024406426,0.0007264028,0.00003714812,0.011303521,0.9690886,0.012003084,0.0002249147],"about_ca_topic_score_codex":8.3468154e-7,"about_ca_topic_score_gemma":0.0000017537187,"teacher_disagreement_score":0.060139045,"about_ca_system_score_codex":0.00011678779,"about_ca_system_score_gemma":0.0001760485,"threshold_uncertainty_score":0.757482},"labels":[],"label_agreement":null},{"id":"W2162059435","doi":"10.1186/s13173-015-0036-x","title":"Complexity of greedy edge-colouring","year":2015,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Combinatorics; Graph; Time complexity; Enhanced Data Rates for GSM Evolution; Mathematics; Greedy algorithm; Computer science; Index (typography); Discrete mathematics; Algorithm; Artificial intelligence","score_opus":0.06586970787758335,"score_gpt":0.3041930945483636,"score_spread":0.23832338667078024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162059435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12596817,0.0002618649,0.8667779,0.004308477,0.0020777727,0.0001734712,0.0000026026232,0.000037715763,0.0003919916],"genre_scores_gemma":[0.6270435,0.000012588186,0.3716255,0.0006395949,0.00049527094,9.2127937e-7,1.4517032e-7,0.000015303867,0.00016719308],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772906,0.00028639266,0.00056140084,0.0001969978,0.0008976111,0.000328539],"domain_scores_gemma":[0.9974017,0.00016701157,0.00063450035,0.00076451065,0.00078698096,0.00024526435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018427075,0.00015556489,0.00035944403,0.0000703507,0.00015221769,0.000098901146,0.003427236,0.00007173292,0.00000425613],"category_scores_gemma":[0.000077603734,0.00010574429,0.00062705955,0.0006876463,0.0004938906,0.00073274085,0.001324732,0.00055619085,0.000006415505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041345364,0.0021952426,0.04485457,0.00048678124,0.0019834044,0.00016870988,0.04860376,0.044455376,0.0073166504,0.29701817,0.38467315,0.16783074],"study_design_scores_gemma":[0.0062270314,0.0016496757,0.06697452,0.00053279434,0.000068906375,0.0014255648,0.00059351994,0.31117946,0.016136866,0.57836545,0.015959386,0.000886851],"about_ca_topic_score_codex":0.000004321894,"about_ca_topic_score_gemma":0.0000020013726,"teacher_disagreement_score":0.5010753,"about_ca_system_score_codex":0.00013919063,"about_ca_system_score_gemma":0.00030143163,"threshold_uncertainty_score":0.63687146},"labels":[],"label_agreement":null},{"id":"W2162312358","doi":"10.1016/j.tcs.2008.11.008","title":"Local edge colouring of Yao-like subgraphs of Unit Disk Graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; University of Ottawa; Université du Québec en Outaouais","funders":"","keywords":"Combinatorics; Mathematics; Unit disk graph; Unit disk; Graph; Discrete mathematics; Partition (number theory); Constant (computer programming); Locality; Computer science","score_opus":0.021918745402650586,"score_gpt":0.27866484541387604,"score_spread":0.25674610001122544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162312358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3112271,0.00005667349,0.6870018,0.000076865654,0.00023406545,0.0001595711,0.0000028373654,0.00008475335,0.0011562606],"genre_scores_gemma":[0.9189502,0.000026657843,0.08090069,0.000076223834,0.000017393075,0.000005956015,4.9557383e-7,0.00001158697,0.000010822031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606484,0.00025301712,0.0005605866,0.0008172225,0.0014496474,0.00085468567],"domain_scores_gemma":[0.9966839,0.00068386074,0.00017710766,0.0014690009,0.00058456603,0.0004015534],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018823012,0.00024762892,0.00045133327,0.00071437785,0.00042973945,0.00005073342,0.0046905666,0.000075563454,0.000029765934],"category_scores_gemma":[0.000114683105,0.00021052318,0.00017799197,0.004402285,0.018992469,0.000766309,0.0019403092,0.00034025122,0.000017010483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035365494,0.00014273346,0.0013212896,0.00002366546,0.000009079926,0.000029349509,0.0006008275,0.00058985583,0.0024945189,0.9861984,0.0000121721205,0.008542734],"study_design_scores_gemma":[0.00060851057,0.00082689454,0.008147337,0.000082042534,0.0000069771677,0.0001467223,0.00003102982,0.20287141,0.078866795,0.707971,0.000044231478,0.00039708643],"about_ca_topic_score_codex":0.000008534601,"about_ca_topic_score_gemma":0.0000010725948,"teacher_disagreement_score":0.60772306,"about_ca_system_score_codex":0.000033642114,"about_ca_system_score_gemma":0.00026950432,"threshold_uncertainty_score":0.98367727},"labels":[],"label_agreement":null},{"id":"W2162598482","doi":"10.1006/jctb.2000.1963","title":"The Excluded Minors for GF(4)-Representable Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; GF(2); Mathematics; Computer science; Finite field","score_opus":0.012505341486421347,"score_gpt":0.28252195724150875,"score_spread":0.2700166157550874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162598482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48278478,0.009039613,0.37563023,0.015556116,0.05127778,0.0036664098,0.00003574699,0.00052159384,0.06148776],"genre_scores_gemma":[0.94688904,0.00089163054,0.01979956,0.00026106197,0.002658059,0.00007538418,0.0000017086942,0.000083172265,0.029340405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757606,0.00049491687,0.00058473943,0.00020748902,0.0006166329,0.00052015134],"domain_scores_gemma":[0.9967272,0.0016409431,0.00030113597,0.00070052914,0.00044807137,0.00018210667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003382055,0.00018225715,0.00032379403,0.000110105204,0.0006381573,0.00036979455,0.002374902,0.00007608746,0.00012859178],"category_scores_gemma":[0.0004969822,0.00012192123,0.00028288824,0.0004407145,0.0003327017,0.0014592528,0.00016900031,0.00034182775,0.000018074976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020800952,0.000071734976,0.00002416524,0.000007673475,0.00007374103,0.000015560548,0.00026202854,0.0000810728,0.00058790774,0.96559346,0.00291904,0.02828351],"study_design_scores_gemma":[0.0011891251,0.000667971,0.000032346055,0.000014402309,0.000010150129,0.00011393442,0.0001441625,0.000072749375,0.0070502455,0.82348603,0.16709799,0.00012091584],"about_ca_topic_score_codex":0.0000013120224,"about_ca_topic_score_gemma":6.704346e-7,"teacher_disagreement_score":0.46410426,"about_ca_system_score_codex":0.000068779205,"about_ca_system_score_gemma":0.00016442104,"threshold_uncertainty_score":0.4971803},"labels":[],"label_agreement":null},{"id":"W2162824303","doi":"10.1007/978-3-540-77294-1_4","title":"Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Combinatorics; Greedy algorithm; Degree (music); Graph; Random graph; Mathematics; Discrete mathematics; Algorithm; Physics","score_opus":0.042706764647804936,"score_gpt":0.29052877326854437,"score_spread":0.24782200862073944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162824303","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020283619,0.0009242279,0.995233,0.00010069224,0.0007257387,0.0007348275,0.000005089957,0.000277075,0.0017965009],"genre_scores_gemma":[0.0148952035,0.00003924857,0.98391044,0.00055491703,0.0003117662,0.000007988682,0.00000343823,0.00009218461,0.00018481837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99272376,0.00010123342,0.0007025173,0.0024492585,0.002416502,0.001606748],"domain_scores_gemma":[0.99535805,0.0010212435,0.00042313288,0.0022084385,0.00057469105,0.00041441582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00270018,0.00091415684,0.00093294727,0.0024864268,0.0006850941,0.0007854342,0.005119807,0.00041788435,0.000017564036],"category_scores_gemma":[0.00009442569,0.0007645771,0.0002375794,0.0023121575,0.0024350667,0.0012810756,0.0018690255,0.001652375,0.000021576912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005724112,0.000028621373,0.000060854734,0.000032121006,0.000036155896,0.00063997245,0.00046917476,0.029404934,0.00020930504,0.028778391,0.0000018505586,0.9402814],"study_design_scores_gemma":[0.0012702438,0.0003615406,0.00004801745,0.0007698499,0.000017669212,0.00054861634,8.1917835e-7,0.66730666,0.0020603396,0.3261427,0.00035106982,0.0011224762],"about_ca_topic_score_codex":0.00005079074,"about_ca_topic_score_gemma":0.00013046614,"teacher_disagreement_score":0.9391589,"about_ca_system_score_codex":0.00041787158,"about_ca_system_score_gemma":0.0007570944,"threshold_uncertainty_score":0.99948055},"labels":[],"label_agreement":null},{"id":"W2163677687","doi":"10.1109/ncm.2009.386","title":"Kernel-Perfection through the Push Operation","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Digraph; Combinatorics; Kernel (algebra); Vertex (graph theory); Mathematics; Directed graph; Graph; Discrete mathematics; Polynomial kernel; Computer science; Kernel method; Artificial intelligence","score_opus":0.024226503447801997,"score_gpt":0.3154273556168349,"score_spread":0.2912008521690329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163677687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005012804,0.000052582403,0.9491229,0.0068346555,0.00012279466,0.00015032558,9.4109254e-8,0.00016922862,0.038534638],"genre_scores_gemma":[0.9787252,0.000020044632,0.017291335,0.001607939,0.00006187942,0.0000079963,5.6223763e-7,0.0000026660693,0.0022823666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924767,0.0000862378,0.00008487595,0.0002013126,0.00020652381,0.00017337504],"domain_scores_gemma":[0.9994012,0.000056762186,0.000016345253,0.00045115716,0.000049996263,0.000024524521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025183117,0.00006035098,0.000046889378,0.000026438223,0.00023657738,0.00016434377,0.0005510543,0.000023960945,0.00004548457],"category_scores_gemma":[0.000029244302,0.00003600612,0.000030004043,0.00033557496,0.0000338217,0.0009276249,0.0000610195,0.000112396105,0.00016959643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000320364,0.00002058391,0.000022686156,4.1943645e-7,0.000001952925,0.00000120401,0.00036694334,0.000735592,0.0028354323,0.9455085,0.0010111461,0.049492374],"study_design_scores_gemma":[0.00031561367,0.0003232359,0.0035972793,0.000005023529,0.0000019437898,0.000039750783,0.00010848521,0.07460649,0.03410798,0.86540115,0.021293487,0.00019955514],"about_ca_topic_score_codex":0.00001282308,"about_ca_topic_score_gemma":0.000007148778,"teacher_disagreement_score":0.9737124,"about_ca_system_score_codex":0.000023309933,"about_ca_system_score_gemma":0.00001771911,"threshold_uncertainty_score":0.21798755},"labels":[],"label_agreement":null},{"id":"W2164463888","doi":"10.1016/j.ejc.2011.09.011","title":"Cyclic colorings of plane graphs with independent faces","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Fractional coloring; Complete coloring; Disjoint sets; Greedy coloring; List coloring; Vertex (graph theory); Plane (geometry); Graph; Discrete mathematics; Graph power; Geometry; Line graph","score_opus":0.030710658112959862,"score_gpt":0.23383085010427274,"score_spread":0.20312019199131287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164463888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89258134,0.0003451205,0.07520809,0.000058024765,0.00035866766,0.00010710426,0.0000011943588,0.000035847912,0.031304594],"genre_scores_gemma":[0.9941813,0.00008030277,0.005581468,0.000019476662,0.000009436032,3.940294e-7,1.2779567e-7,0.000018651454,0.000108847235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803495,0.00039536142,0.00045270412,0.00015953612,0.00070361554,0.00025384873],"domain_scores_gemma":[0.9983271,0.0000988454,0.0006012879,0.00038817807,0.00039593456,0.00018869535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433163,0.00013684249,0.00025794562,0.00035320845,0.0000665327,0.000036498106,0.0016996805,0.000018145449,0.000011443408],"category_scores_gemma":[0.00006121023,0.00010265443,0.00007912684,0.0006754163,0.00013803109,0.00051657844,0.00023861401,0.00040929363,0.000012826606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028351299,0.00044806374,0.01945968,0.000036454647,0.00012955217,0.0016330944,0.002354481,0.000051519324,0.0017738517,0.97055495,0.00013308485,0.0031417652],"study_design_scores_gemma":[0.0098537225,0.020756796,0.2557983,0.0005696221,0.000094107156,0.0027299467,0.0010344419,0.00010459529,0.09832388,0.5995052,0.01000687,0.0012225235],"about_ca_topic_score_codex":0.0000014030097,"about_ca_topic_score_gemma":3.6308953e-7,"teacher_disagreement_score":0.37104976,"about_ca_system_score_codex":0.000026065854,"about_ca_system_score_gemma":0.000064361855,"threshold_uncertainty_score":0.4186126},"labels":[],"label_agreement":null},{"id":"W2165037031","doi":"10.1016/j.tcs.2015.01.011","title":"On graphs that are not PCGs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Wheel graph; Vertex (graph theory); Graph; Path graph; Graph power; Pairwise comparison; Planar graph; Discrete mathematics; Line graph","score_opus":0.049060207401457154,"score_gpt":0.31182620543233247,"score_spread":0.2627659980308753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165037031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054796323,0.00002035069,0.934132,0.0021098864,0.0008386672,0.0002134204,0.0000020451982,0.0003869197,0.0075004348],"genre_scores_gemma":[0.92359906,0.000002286275,0.07435992,0.0019200719,0.00006204616,0.000011275334,3.2952448e-7,0.000012816733,0.000032192136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952436,0.00025877106,0.00022956346,0.0011387188,0.0021043143,0.001025022],"domain_scores_gemma":[0.99625665,0.0006067412,0.00009046734,0.001745828,0.00037587978,0.00092445605],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0031539688,0.0002662263,0.00027237067,0.000492296,0.00042945595,0.0005895951,0.0053346544,0.00006629281,0.000024288209],"category_scores_gemma":[0.0004016283,0.00020784825,0.000096892865,0.002289241,0.0046427874,0.0010906521,0.0019287457,0.00042477524,0.00047853173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036000383,0.00007760507,0.00009751619,0.0000028074382,0.0000027788285,0.00004597865,0.00026393047,0.0002897279,0.000115451985,0.9861693,0.00021716503,0.012681767],"study_design_scores_gemma":[0.00035609896,0.00040760246,0.0006618762,0.000028490165,0.0000014463682,0.000038696126,0.000013896861,0.12385967,0.0078741005,0.8663385,0.00014605989,0.00027356567],"about_ca_topic_score_codex":0.0000015014476,"about_ca_topic_score_gemma":3.9769674e-7,"teacher_disagreement_score":0.8688027,"about_ca_system_score_codex":0.00011278059,"about_ca_system_score_gemma":0.00018673456,"threshold_uncertainty_score":0.998066},"labels":[],"label_agreement":null},{"id":"W2165079333","doi":"10.7151/dmgt.1409","title":"A note on domination parameters in random graphs","year":2008,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Rogers Communications (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Random graph; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.0239342018942265,"score_gpt":0.2893510288309336,"score_spread":0.2654168269367071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165079333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31470653,0.0001135496,0.67662627,0.0008960071,0.00024420305,0.0009727838,0.00000470661,0.00032263546,0.0061132894],"genre_scores_gemma":[0.968357,0.000080946316,0.030662626,0.00019712711,0.000010821409,0.00023527899,0.0000039021784,0.00003417294,0.00041810688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663174,0.0008147856,0.00054565805,0.00066562934,0.0007460384,0.0005961623],"domain_scores_gemma":[0.99641275,0.0019371482,0.00017166481,0.0012266476,0.00006909901,0.00018268132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020380286,0.00032902864,0.00047053536,0.0011391875,0.0003251535,0.000060386195,0.0012609672,0.000113247166,0.000033589084],"category_scores_gemma":[0.0007117934,0.00021088538,0.00028626338,0.0017217029,0.00045349266,0.0006288494,0.00023178148,0.00037781266,0.00017787289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003026972,0.00037972952,0.000101210986,0.000037206995,0.000017650715,0.000085762214,0.0040964773,0.000184274,0.0005325053,0.9860844,0.00005966743,0.008118409],"study_design_scores_gemma":[0.0018705982,0.000112242014,0.0010591977,0.00017156021,0.000005563582,0.000052349646,0.00021625601,0.0020849882,0.0031022523,0.99096715,0.00003913748,0.00031869952],"about_ca_topic_score_codex":0.0000018113723,"about_ca_topic_score_gemma":0.000002537527,"teacher_disagreement_score":0.65365046,"about_ca_system_score_codex":0.000047262518,"about_ca_system_score_gemma":0.000055172957,"threshold_uncertainty_score":0.8599656},"labels":[],"label_agreement":null},{"id":"W2165352378","doi":"10.5555/1070432.1070490","title":"An O(VE) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Matching (statistics); Algorithm; Running time; Computer science; Mathematics; Blossom algorithm; Combinatorics; Discrete mathematics","score_opus":0.013238446397571412,"score_gpt":0.30807813828255165,"score_spread":0.2948396918849802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165352378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008726283,0.00010404996,0.9871163,0.0011365213,0.00028747998,0.000813236,0.00029298765,0.0002727922,0.0012503634],"genre_scores_gemma":[0.19175889,0.00006701821,0.806882,0.00036486727,0.00023609637,0.00020961725,0.00008342561,0.00006887796,0.00032916252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694765,0.00019432312,0.0005353418,0.0008769845,0.0006815972,0.00076412247],"domain_scores_gemma":[0.9974373,0.00032032726,0.00020218684,0.0014340333,0.00025948498,0.0003466652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006241282,0.00035259684,0.0004108291,0.00046932718,0.00036460586,0.0001713141,0.0018461596,0.00013107495,0.000023692859],"category_scores_gemma":[0.000015438485,0.00033312535,0.0003142911,0.00074059,0.00020114655,0.0013043182,0.00021065981,0.00027429647,0.000047201953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017935834,0.001270175,0.000052479892,0.00007353262,0.00024189378,0.000022066246,0.0028891368,0.013109708,0.10165693,0.4586363,0.000632007,0.4212364],"study_design_scores_gemma":[0.0026043893,0.0026588398,0.00033328717,0.000105455365,0.000039112772,0.000046606776,0.00022952446,0.6590117,0.12596688,0.20514983,0.0028498818,0.0010044962],"about_ca_topic_score_codex":0.000023826355,"about_ca_topic_score_gemma":0.0000064668006,"teacher_disagreement_score":0.645902,"about_ca_system_score_codex":0.00008910955,"about_ca_system_score_gemma":0.000089295245,"threshold_uncertainty_score":0.9999121},"labels":[],"label_agreement":null},{"id":"W2165426231","doi":"10.1016/s0012-365x(03)00086-4","title":"Homomorphisms and oriented colorings of equivalence classes of oriented graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Chromatic scale; Friendship graph; Windmill graph; Discrete mathematics; Digraph; Vertex (graph theory); Integer (computer science); Critical graph; Graph; Equivalence (formal languages); Graph homomorphism; Line graph; Graph power; Computer science","score_opus":0.023863299157697044,"score_gpt":0.289789815704448,"score_spread":0.265926516546751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165426231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47601297,0.00018326836,0.5181875,0.000033525946,0.000060938717,0.00029379124,0.000014386696,0.000053546086,0.0051600677],"genre_scores_gemma":[0.8393361,0.000060589773,0.16043372,0.00000892963,0.0000015589908,0.00001418245,0.0000011821461,0.0000128134125,0.00013093707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840844,0.000088573455,0.00045069016,0.00028172534,0.00047335052,0.00029720744],"domain_scores_gemma":[0.9982921,0.00039964519,0.00028892735,0.0006782363,0.00023612741,0.00010496039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005512172,0.00015881869,0.00034560196,0.00019586158,0.00006730725,0.000020564603,0.00050097634,0.00005193564,0.000015023649],"category_scores_gemma":[0.000523752,0.00013468873,0.00007386566,0.0009453314,0.00046402705,0.00029417814,0.00023629935,0.00011962605,0.0000027692154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007291346,0.00008767099,0.00078843016,0.00024442142,0.000022890077,0.000004303351,0.0008986673,0.000008624343,0.006915261,0.99086857,0.0000073052224,0.00014655892],"study_design_scores_gemma":[0.0007670969,0.0004426944,0.00046566245,0.00027856647,0.000026435957,0.00004141278,0.0011917081,0.0048165545,0.14326017,0.84795296,0.0004503074,0.00030645067],"about_ca_topic_score_codex":0.0000020527173,"about_ca_topic_score_gemma":7.735654e-7,"teacher_disagreement_score":0.3633231,"about_ca_system_score_codex":0.000013262961,"about_ca_system_score_gemma":0.000048019505,"threshold_uncertainty_score":0.5492447},"labels":[],"label_agreement":null},{"id":"W2165528704","doi":"10.2168/lmcs-3(4:6)2007","title":"A Characterisation of First-Order Constraint Satisfaction Problems","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of the Fraser Valley; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Constraint satisfaction problem; Decidability; Simple (philosophy); Algebraic number; Constraint satisfaction; Mathematics; Time complexity; Order (exchange); Constraint (computer-aided design); Backtracking; Discrete mathematics; Computer science; Combinatorics; Algorithm","score_opus":0.08219768287444364,"score_gpt":0.41224126299265734,"score_spread":0.3300435801182137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165528704","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05715748,0.000022114078,0.94144344,0.00021318074,0.000473254,0.0003016923,4.6363988e-7,0.00007941431,0.00030898227],"genre_scores_gemma":[0.3951235,0.0000053967665,0.6047651,0.000070896385,0.000023309172,0.0000069773846,1.3081817e-7,0.000002589307,0.0000020800655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972093,0.00032186747,0.00053698773,0.00071024225,0.0006369874,0.0005845814],"domain_scores_gemma":[0.99747163,0.0012644618,0.0001907478,0.000610988,0.0003034238,0.00015873485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010292725,0.00014753084,0.00025688973,0.00054231327,0.00015711827,0.00010529536,0.0013166766,0.00008133452,0.000015052912],"category_scores_gemma":[0.00058548,0.00012208952,0.000050308045,0.0034030012,0.001041097,0.0009030349,0.0006636084,0.00030115613,0.0000049038213],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104231485,0.00007323693,0.012729086,0.000018648569,0.000002133089,0.000009738396,0.0005825463,0.001232449,0.028605256,0.0878105,7.680421e-7,0.8689252],"study_design_scores_gemma":[0.0003911846,0.0003595966,0.36996332,0.00006852454,0.0000011915693,0.00005430674,0.00001825433,0.41668624,0.020350704,0.1917091,0.00012364717,0.00027393672],"about_ca_topic_score_codex":0.000021701802,"about_ca_topic_score_gemma":0.000019783998,"teacher_disagreement_score":0.8686513,"about_ca_system_score_codex":0.00011596626,"about_ca_system_score_gemma":0.000085964486,"threshold_uncertainty_score":0.4978666},"labels":[],"label_agreement":null},{"id":"W2166530698","doi":"10.1016/s0012-365x(02)00802-6","title":"An improved upper bound for queens domination numbers","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory); Mathematical analysis","score_opus":0.01858940680374713,"score_gpt":0.32251044383524996,"score_spread":0.3039210370315028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166530698","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019575756,0.000020564856,0.9755283,0.00013375243,0.000114509734,0.00054854766,0.000008313185,0.00011294526,0.0039573256],"genre_scores_gemma":[0.34324405,0.000004069309,0.6556771,0.00007625689,0.000024676721,0.00011439051,0.00000821665,0.000029817598,0.0008214619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987473,0.00007812295,0.00024646794,0.00031365716,0.000240511,0.00037395378],"domain_scores_gemma":[0.9985787,0.0002644603,0.00010374993,0.0007872788,0.000142077,0.00012371103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077704666,0.00014761063,0.0001720232,0.00009465311,0.00019062089,0.00022795734,0.00062723167,0.000060483824,0.000018324872],"category_scores_gemma":[0.0003390987,0.00012783859,0.000091899485,0.00025958812,0.00008177271,0.0006363673,0.00005042283,0.00009580313,0.000022848742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004849096,0.00007206583,0.000027043825,0.000058173257,0.000012754263,9.742193e-7,0.0016623583,0.000024251303,0.0041750288,0.99248546,0.00006577878,0.0014112414],"study_design_scores_gemma":[0.00050520577,0.00014064608,0.000021668182,0.000017382912,0.000008421243,0.00001093716,0.0005503465,0.15678066,0.01194081,0.8282642,0.0015185385,0.00024121367],"about_ca_topic_score_codex":0.0000019160482,"about_ca_topic_score_gemma":0.000005173476,"teacher_disagreement_score":0.3236683,"about_ca_system_score_codex":0.00004728514,"about_ca_system_score_gemma":0.000052655185,"threshold_uncertainty_score":0.5213106},"labels":[],"label_agreement":null},{"id":"W2167228424","doi":"10.1016/j.disc.2007.10.022","title":"On <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si20.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-transversals of chordal graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Transversal (combinatorics); Chordal graph; Mathematics; Combinatorics; Graph; Algorithm; Discrete mathematics; Mathematical analysis","score_opus":0.02070235063290941,"score_gpt":0.2688354726682089,"score_spread":0.2481331220352995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167228424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5535909,0.0010195263,0.025766743,0.00057492295,0.0021909864,0.000102423764,0.0005234867,0.00029571215,0.4159353],"genre_scores_gemma":[0.97826785,0.0009675734,0.016452093,0.0009352254,0.000979602,0.0005437144,0.0005868263,0.00078741345,0.00047972516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9872808,0.00052897853,0.0026229657,0.0021167523,0.0041657714,0.00328476],"domain_scores_gemma":[0.98839664,0.003536707,0.0024055615,0.003947732,0.0002969265,0.0014164412],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0041834563,0.0011383459,0.0005696901,0.0009241279,0.0014709809,0.0013747627,0.004183997,0.0020067822,0.16959295],"category_scores_gemma":[0.002336084,0.001972294,0.0023602105,0.0022770735,0.0026294657,0.0018646466,0.0024173064,0.0021610102,0.0019234887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014114713,0.0005872804,0.00001319717,0.0023137063,0.0014015614,0.0013512444,0.005232,0.0017594001,0.0037497135,0.9124677,0.06762944,0.0020832475],"study_design_scores_gemma":[0.0020454922,0.0021864222,0.00006764859,0.0019932108,0.0009000623,0.0007645342,0.0024082588,0.14086893,0.8425256,0.0032785125,0.0012273388,0.0017339754],"about_ca_topic_score_codex":0.00045372944,"about_ca_topic_score_gemma":0.00070479896,"teacher_disagreement_score":0.9091892,"about_ca_system_score_codex":0.000025148804,"about_ca_system_score_gemma":0.0012598691,"threshold_uncertainty_score":0.999829},"labels":[],"label_agreement":null},{"id":"W2168711306","doi":"10.1109/csie.2009.965","title":"Parameterized VERTEX COVER in Graphs of Small Degree","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Vertex cover; Kernelization; Parameterized complexity; Bounded function; Degree (music); Edge cover; Vertex (graph theory); Feedback vertex set; Computer science; Maximal independent set; Cover (algebra); Independent set; Combinatorics; Mathematics; Approximation algorithm; Theoretical computer science; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.05307331259919727,"score_gpt":0.2975733573013952,"score_spread":0.24450004470219794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168711306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38928849,0.000076291915,0.59222704,0.00034612912,0.00006794238,0.00021538137,6.779779e-7,0.00008649803,0.01769152],"genre_scores_gemma":[0.8929002,0.000014052069,0.10649289,0.0002624786,0.0000015972964,0.000003700284,3.7123405e-7,0.0000029890896,0.00032168778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900645,0.000083793784,0.00019436807,0.00024736862,0.00019699398,0.00027104362],"domain_scores_gemma":[0.9991506,0.00016905478,0.000037513553,0.00053275866,0.000047084515,0.00006303708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030785496,0.0000844445,0.00016555424,0.00024100352,0.00001817597,0.000023813069,0.0008275511,0.000038609054,0.000036764002],"category_scores_gemma":[0.00007850072,0.000071353155,0.00005972024,0.0008022746,0.00005768074,0.00024601936,0.000104598075,0.00011000004,0.000031043546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072893934,0.00016196954,0.0017943903,0.0000066147695,0.000007051528,0.00002903618,0.00017450837,0.00011270766,0.017704867,0.8240649,0.00010243689,0.15576859],"study_design_scores_gemma":[0.0012491224,0.00040732126,0.046459634,0.00002213468,0.0000013040503,0.000007607164,0.000010423461,0.026017424,0.019198986,0.90618706,0.00023585772,0.00020314862],"about_ca_topic_score_codex":0.000015460302,"about_ca_topic_score_gemma":0.000010028514,"teacher_disagreement_score":0.50361174,"about_ca_system_score_codex":0.000014448071,"about_ca_system_score_gemma":0.00002965109,"threshold_uncertainty_score":0.29096973},"labels":[],"label_agreement":null},{"id":"W2168774808","doi":"10.1007/978-3-319-21840-3_42","title":"Reconfiguration on Sparse Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Control reconfiguration; Theoretical computer science; Embedded system","score_opus":0.05107203587201308,"score_gpt":0.3020614445279913,"score_spread":0.2509894086559782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168774808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004898654,0.0003016509,0.9728269,0.0007525261,0.001627944,0.00046534333,0.0000051705124,0.00020753226,0.023763923],"genre_scores_gemma":[0.25215337,0.00019640678,0.7362111,0.004226822,0.0012266953,0.00006527118,0.000030466534,0.00018680497,0.0057030236],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951356,0.00007945104,0.0004710033,0.0018063652,0.0017153496,0.00079223496],"domain_scores_gemma":[0.9962507,0.0005612491,0.00025385973,0.0021157777,0.0004965779,0.000321839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017881686,0.0005365106,0.00048142506,0.0016459094,0.00024810963,0.00048766745,0.0041595325,0.0003206911,0.000040305134],"category_scores_gemma":[0.00023274765,0.00048437063,0.00013340042,0.0010359938,0.000887023,0.0008496591,0.00087997917,0.0011801936,0.00027129235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015171449,0.000022490793,0.0000067681217,0.000010680774,0.0000060460375,0.00008661842,0.0002475451,0.0198364,0.00009845409,0.38841313,0.0000865517,0.59117013],"study_design_scores_gemma":[0.00024035825,0.00037697054,0.000020731151,0.00020328663,0.000002378106,0.00004589225,9.3433655e-8,0.09817267,0.0012414559,0.89545244,0.0037092452,0.00053450343],"about_ca_topic_score_codex":0.0000066872685,"about_ca_topic_score_gemma":0.00003898198,"teacher_disagreement_score":0.59063566,"about_ca_system_score_codex":0.00040833492,"about_ca_system_score_gemma":0.0006730001,"threshold_uncertainty_score":0.9997608},"labels":[],"label_agreement":null},{"id":"W2169434358","doi":"10.1016/j.dam.2003.08.012","title":"A note on tolerance graph recognition","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.026813482032105828,"score_gpt":0.2904599598666646,"score_spread":0.2636464778345588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169434358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015991691,0.000014902492,0.9554524,0.00032795238,0.00007433441,0.0004245362,0.0000073691085,0.00028037702,0.027426466],"genre_scores_gemma":[0.44186726,0.000019901769,0.55746466,0.00038528253,0.000045128785,0.00013465993,0.000008304415,0.000029579167,0.000045238547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984306,0.000013914556,0.00027321704,0.00040720915,0.00047703576,0.00039798598],"domain_scores_gemma":[0.9987257,0.00015435048,0.00011423142,0.00083338394,0.000053916145,0.00011837838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002944778,0.00020115411,0.00021405514,0.00016085547,0.00015675263,0.00010950666,0.00078365323,0.00006944923,0.000011886786],"category_scores_gemma":[0.00004876577,0.00017539176,0.000084813044,0.0006003293,0.00009742412,0.0002188277,0.0001520309,0.00024304802,0.00061966456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001585358,0.00011707912,3.8427402e-7,0.000053625175,0.00000865282,0.000009681271,0.0012206547,0.0008683726,0.0055544395,0.97617847,0.000024505352,0.015948309],"study_design_scores_gemma":[0.00057849684,0.000073351424,0.000012520786,0.00007603941,0.0000042946435,0.000008960203,0.00006766287,0.0015024085,0.031641897,0.9656588,0.0001372318,0.00023836168],"about_ca_topic_score_codex":0.000001208867,"about_ca_topic_score_gemma":0.000001928836,"teacher_disagreement_score":0.42587554,"about_ca_system_score_codex":0.0000558146,"about_ca_system_score_gemma":0.000036771762,"threshold_uncertainty_score":0.7964741},"labels":[],"label_agreement":null},{"id":"W2169487918","doi":"10.1016/j.disc.2011.10.018","title":"Upper bounds for the bondage number of graphs on topological surfaces","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Upper and lower bounds; Genus; Mathematical proof; Domination analysis; Planar graph; Discrete mathematics; Surface (topology); Geometry; Botany; Biology","score_opus":0.06550048523045542,"score_gpt":0.3397857713035316,"score_spread":0.2742852860730762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169487918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20425278,0.00011554314,0.7648405,0.00044387154,0.00019972358,0.0007358497,0.00002601598,0.00011822089,0.029267535],"genre_scores_gemma":[0.82367265,0.000018506877,0.1754798,0.0000688419,0.000010636548,0.000049016744,8.454332e-7,0.000014215415,0.0006854633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988592,0.000051514788,0.00025961894,0.0002200717,0.0003094212,0.00030017018],"domain_scores_gemma":[0.9980416,0.00090181944,0.00011878187,0.00079860596,0.000083840554,0.000055295735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352629,0.00013563801,0.00020241742,0.000045140037,0.00015942828,0.000047642945,0.0011849685,0.00005564091,0.000100654404],"category_scores_gemma":[0.0001929261,0.00007528215,0.00015979672,0.00025261787,0.00033656112,0.0001482047,0.0002185557,0.0001271361,0.00003514704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016331966,0.00008191093,0.00037012936,0.000039052968,0.00002494072,0.000001431841,0.0023440123,0.0000054764237,0.00010948973,0.9963298,0.00011602537,0.0005614398],"study_design_scores_gemma":[0.00017494085,0.00015059134,0.00052289176,0.000023751252,0.000009575031,0.00000738632,0.0004912965,0.008148975,0.004756204,0.9850935,0.0004991593,0.0001217626],"about_ca_topic_score_codex":0.0000041068415,"about_ca_topic_score_gemma":0.0000015141255,"teacher_disagreement_score":0.6194199,"about_ca_system_score_codex":0.000008935966,"about_ca_system_score_gemma":0.000017839397,"threshold_uncertainty_score":0.3069917},"labels":[],"label_agreement":null},{"id":"W2169829403","doi":"10.1007/978-3-642-03367-4_34","title":"The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Cograph; Interval graph; Indifference graph; Bipartite graph; Pathwidth; Discrete mathematics; Vertex (graph theory); Comparability graph; Comparability; Graph; Line graph; 1-planar graph","score_opus":0.024769139751420123,"score_gpt":0.3134125907609353,"score_spread":0.28864345100951516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169829403","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003314385,0.00059590826,0.9952071,0.001362865,0.00032327112,0.0014802441,0.0000051205907,0.00011414602,0.00057995936],"genre_scores_gemma":[0.39582214,0.00023282236,0.6025402,0.000568585,0.00020180641,0.00008260522,0.000012566564,0.00003893474,0.0005003701],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645084,0.000087196764,0.00048867293,0.0014884444,0.00085010333,0.0006347644],"domain_scores_gemma":[0.99372125,0.004133105,0.000262204,0.0012262694,0.00051227614,0.00014490765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016356667,0.00037297464,0.00036717407,0.0004159896,0.0008739565,0.0008012385,0.0021744857,0.00017212494,0.0000013353738],"category_scores_gemma":[0.00044524943,0.0002833375,0.00011013401,0.00062201894,0.0014021384,0.00059486326,0.000533682,0.0005746093,0.000003397649],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003010862,0.000015447726,0.000029216322,0.00002396942,0.000006153614,0.000009529459,0.00045137387,0.040786445,0.0000964773,0.1089577,0.000005304652,0.8495883],"study_design_scores_gemma":[0.00017604679,0.00018500477,0.00007762398,0.000048751066,0.000003063438,0.000024387184,3.2263793e-7,0.3888137,0.00026541844,0.6096304,0.0005661101,0.00020918214],"about_ca_topic_score_codex":0.000007953944,"about_ca_topic_score_gemma":0.000079997175,"teacher_disagreement_score":0.84937906,"about_ca_system_score_codex":0.00017521653,"about_ca_system_score_gemma":0.00023873412,"threshold_uncertainty_score":0.99996185},"labels":[],"label_agreement":null},{"id":"W2169976284","doi":"10.1016/j.dam.2009.06.024","title":"On a disparity between relative cliquewidth and relative NLC-width","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Bounded function; Time complexity; Clique; Treewidth; Graph; Upper and lower bounds; Measure (data warehouse); Chordal graph; Discrete mathematics; Pathwidth; Computer science; Line graph","score_opus":0.02478072388979999,"score_gpt":0.3071723440611731,"score_spread":0.2823916201713731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169976284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020922614,0.00004250023,0.93009907,0.00070691167,0.000020689502,0.0006472589,0.000013203212,0.00022443118,0.047323298],"genre_scores_gemma":[0.7474549,0.00001666503,0.2520363,0.00020061922,0.000028096574,0.000032029166,0.000007095795,0.000019727746,0.00020459505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997908,0.00007010514,0.00039964612,0.00059813657,0.000523888,0.00050020905],"domain_scores_gemma":[0.99742043,0.0011963709,0.00021574019,0.00088296155,0.000058195175,0.00022631531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065013,0.00030915372,0.00043573783,0.00016408015,0.00026018362,0.00013614644,0.0007267659,0.00013555963,0.0000073427664],"category_scores_gemma":[0.0001783802,0.00025274418,0.000079304606,0.00053353736,0.00020896851,0.0005436557,0.00029064048,0.0005657119,0.00007738233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016330257,0.000065490196,0.00005140121,0.00002381774,0.00003264616,0.000005682501,0.0020168633,0.000014238819,0.00018982033,0.9885637,0.000050989278,0.0089690285],"study_design_scores_gemma":[0.0004245402,0.00024390071,0.0019873604,0.000060783,0.000018737144,0.0000033391784,0.00007193293,0.0033093942,0.00085022795,0.9926433,0.00008626159,0.00030024946],"about_ca_topic_score_codex":9.69882e-7,"about_ca_topic_score_gemma":8.6321165e-7,"teacher_disagreement_score":0.7265323,"about_ca_system_score_codex":0.00006430442,"about_ca_system_score_gemma":0.00003332141,"threshold_uncertainty_score":0.9999925},"labels":[],"label_agreement":null},{"id":"W2170069407","doi":"10.1145/1187436.1210588","title":"Partitioning planar graphs with costs and weights","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph partition; Book embedding; Planar graph; Combinatorics; Planar straight-line graph; Bounded function; Partition (number theory); Computer science; Graph; Outerplanar graph; Mathematics; Discrete mathematics; Pathwidth; Line graph","score_opus":0.016496438464639857,"score_gpt":0.29938283526948845,"score_spread":0.2828863968048486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170069407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68146884,0.002646539,0.31481194,0.0002039314,0.00022296258,0.00010183145,0.0000014870081,0.000026803637,0.00051564304],"genre_scores_gemma":[0.6954819,0.00007503462,0.30424684,0.00010188169,0.00006955996,0.0000011846308,5.518529e-7,0.000009640866,0.000013407076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987394,0.000041370284,0.00028660515,0.00017316766,0.00045256,0.00030688968],"domain_scores_gemma":[0.9989657,0.00018856337,0.00018882356,0.00028859335,0.00013433986,0.00023398579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000573101,0.00012663267,0.00016844965,0.00023816878,0.00016699985,0.00009280671,0.0006948364,0.000037847953,0.0000049236123],"category_scores_gemma":[0.000030134504,0.00009660966,0.000046717447,0.00031790993,0.00016117557,0.00080903986,0.00015592223,0.00024127537,0.000002429983],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010818369,0.0009666643,0.021083884,0.000019138492,0.000425875,0.0041713486,0.005973684,0.000044890145,0.13218258,0.7098251,0.0005383314,0.12368665],"study_design_scores_gemma":[0.0049618008,0.0048926407,0.010136817,0.00030117572,0.000024654712,0.0092000505,0.0036702703,0.0019146922,0.8055413,0.15651338,0.0019874272,0.0008558162],"about_ca_topic_score_codex":0.000005135993,"about_ca_topic_score_gemma":0.0000026220032,"teacher_disagreement_score":0.6733587,"about_ca_system_score_codex":0.000083411906,"about_ca_system_score_gemma":0.00003782572,"threshold_uncertainty_score":0.39396277},"labels":[],"label_agreement":null},{"id":"W2170132163","doi":"10.1145/1103963.1103969","title":"An <i>O</i> ( <i>VE</i> ) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matching (statistics); Algorithm; Partition (number theory); Combinatorics; Blossom algorithm; Factor-critical graph; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01833050890336663,"score_gpt":0.3081120926644815,"score_spread":0.28978158376111485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170132163","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022868267,0.000069244445,0.9952482,0.000826163,0.0002673193,0.00057063554,0.0003011201,0.00029575816,0.00013472598],"genre_scores_gemma":[0.10812153,0.000064428124,0.8909701,0.00039548866,0.000063178624,0.00019029145,0.000016671258,0.000039640516,0.00013864033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977359,0.00012874357,0.0004425635,0.0006478977,0.0004948162,0.0005500855],"domain_scores_gemma":[0.9972052,0.00047358542,0.00011871083,0.0016950318,0.00024946622,0.00025798925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042863013,0.00026792617,0.00030932497,0.00044495362,0.00048001512,0.00010343759,0.0019367374,0.00012066677,0.00004237272],"category_scores_gemma":[0.0000127479225,0.0002766655,0.0003015319,0.00092310115,0.00015731437,0.0012881343,0.000024125646,0.00033614633,0.000039739458],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000340953,0.0008474381,0.0000018940315,0.000012595441,0.000072341165,0.000002930264,0.0005380173,0.007986192,0.006472526,0.0096231345,0.000053918106,0.9743549],"study_design_scores_gemma":[0.0038242359,0.0022237943,0.00016390861,0.00008431721,0.00007710045,0.000114507355,0.00035009725,0.39945287,0.22935098,0.35824528,0.005039954,0.0010729323],"about_ca_topic_score_codex":0.000024057243,"about_ca_topic_score_gemma":0.000016104268,"teacher_disagreement_score":0.973282,"about_ca_system_score_codex":0.00006746763,"about_ca_system_score_gemma":0.00008455679,"threshold_uncertainty_score":0.9999685},"labels":[],"label_agreement":null},{"id":"W2170344325","doi":"10.1145/1273340.1273343","title":"Multicommodity demand flow in a tree and packing integer programs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Linear programming relaxation; Mathematics; Cardinality (data modeling); Multi-commodity flow problem; Integer programming; Knapsack problem; Mathematical optimization; Steiner tree problem; Tree (set theory); Combinatorics; Approximation algorithm; Integer (computer science); Flow network; Discrete mathematics; Computer science","score_opus":0.034100251992916296,"score_gpt":0.3108631411316437,"score_spread":0.27676288913872743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170344325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019872319,0.000079402955,0.97876096,0.0005390912,0.00015319351,0.0003041287,0.0000023920877,0.00014264307,0.00014587921],"genre_scores_gemma":[0.6837619,0.000028056003,0.3160321,0.00007264566,0.000014914656,0.00003194069,8.6911547e-7,0.000011643583,0.00004595334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844444,0.0000940029,0.00023761985,0.00044804136,0.00029647764,0.00047944835],"domain_scores_gemma":[0.9986227,0.00040341998,0.00003339317,0.00072234013,0.00005616775,0.00016195567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008299634,0.00016301761,0.00017000835,0.00037417957,0.00017414437,0.0001030519,0.0006771561,0.000087983426,0.0000087634935],"category_scores_gemma":[0.000051317944,0.00015111938,0.00006019714,0.000794397,0.00014359258,0.00049963105,0.000034865974,0.00049092434,0.00001483699],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026486323,0.00022168728,0.00048074976,0.0000069211783,0.000011867868,0.00004143224,0.00067260105,0.00037654626,0.00013427089,0.0006120903,0.000001339997,0.997414],"study_design_scores_gemma":[0.0052895998,0.0010766085,0.030326093,0.00027128292,0.000022608345,0.00022623,0.0014096847,0.82627404,0.017625475,0.114531256,0.0017130721,0.0012340682],"about_ca_topic_score_codex":0.00004639013,"about_ca_topic_score_gemma":0.00060771307,"teacher_disagreement_score":0.99617994,"about_ca_system_score_codex":0.000074057745,"about_ca_system_score_gemma":0.000022708058,"threshold_uncertainty_score":0.61624694},"labels":[],"label_agreement":null},{"id":"W2170800107","doi":"10.1016/s0012-365x(01)00046-2","title":"Star forests, dominating sets and Ramsey-type problems","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Star (game theory); Graph; Upper and lower bounds; Complete bipartite graph; Discrete mathematics; Minimum degree spanning tree; Edge-transitive graph; Graph power; Line graph","score_opus":0.038758774683058876,"score_gpt":0.29286162080845174,"score_spread":0.25410284612539286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170800107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2776404,0.0014427359,0.7066926,0.0010599829,0.00018234273,0.0010576668,0.00000928297,0.00045567425,0.011459354],"genre_scores_gemma":[0.6617229,0.00008619101,0.33713993,0.000052634878,0.000022153026,0.000024322075,0.000002067046,0.000030077332,0.0009197322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864465,0.000051976756,0.00025935457,0.0003016232,0.00035618857,0.00038621464],"domain_scores_gemma":[0.99883544,0.00026288792,0.000105551524,0.0005860012,0.00008455302,0.00012557724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044135324,0.000160522,0.0001983883,0.000099206205,0.0001683448,0.00019839323,0.00060473935,0.000049805825,0.000043566157],"category_scores_gemma":[0.00023364183,0.00013146049,0.00003918591,0.0004060458,0.00011883914,0.0004361444,0.00040142157,0.00017162898,0.00007924229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005752881,0.00017825789,0.00075798755,0.0007401032,0.00005712532,0.00005099893,0.016050262,0.00017507917,0.0015208644,0.9374907,0.0007620832,0.0422108],"study_design_scores_gemma":[0.0003314587,0.00012458948,0.00012444344,0.00010833984,0.0000060014263,0.00004555821,0.00019736467,0.5919352,0.00049721956,0.40573788,0.0006452287,0.00024672248],"about_ca_topic_score_codex":0.0000015624074,"about_ca_topic_score_gemma":0.0000050003496,"teacher_disagreement_score":0.5917601,"about_ca_system_score_codex":0.000020711264,"about_ca_system_score_gemma":0.000008144867,"threshold_uncertainty_score":0.53608036},"labels":[],"label_agreement":null},{"id":"W2171410117","doi":"10.5614/ejgta.2015.3.1.2","title":"On scores, losing scores and total scores in hypertournaments","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Killam Trusts; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Combinatorics; Mathematics; Hypergraph; Element (criminal law); Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Graph; Computer science; Artificial intelligence; Law","score_opus":0.014868215739346788,"score_gpt":0.28698020828732473,"score_spread":0.27211199254797797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171410117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74482673,0.008062612,0.24612749,0.0003795705,0.00003987415,0.00025164406,0.0000016804662,0.00001866025,0.00029171605],"genre_scores_gemma":[0.9980975,0.00069459534,0.0009814397,0.00009824447,0.000050272934,0.000020837844,5.457428e-7,0.000010208445,0.00004638248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845594,0.00027166278,0.00030520672,0.0002390049,0.00029609696,0.00043207264],"domain_scores_gemma":[0.9987997,0.00044322677,0.00017954002,0.00026650145,0.000108284854,0.00020273986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020728803,0.00013655782,0.00020150344,0.0004800729,0.00016082596,0.00010402007,0.00046971624,0.00004398986,0.0000022731292],"category_scores_gemma":[0.000121315476,0.00011235228,0.00005057785,0.0005794274,0.00023201245,0.00046950387,0.000111324785,0.00053497613,0.000002536238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017448046,0.00009791766,0.0011868732,0.000005325046,0.00002542586,0.000007260331,0.00020578729,0.00016577305,0.00085080735,0.9747347,0.000022900324,0.022522725],"study_design_scores_gemma":[0.00080756535,0.00045682982,0.0014201058,0.000063984226,0.000007855809,0.0003208346,0.000104531944,0.00016036342,0.00083515747,0.9954955,0.00020928287,0.000117986245],"about_ca_topic_score_codex":0.0000030035087,"about_ca_topic_score_gemma":0.000008393503,"teacher_disagreement_score":0.25327072,"about_ca_system_score_codex":0.000079797006,"about_ca_system_score_gemma":0.0001929713,"threshold_uncertainty_score":0.45815933},"labels":[],"label_agreement":null},{"id":"W2172233838","doi":"10.1017/s096354830621808x","title":"<i>Graphs on Surfaces and Their Applications</i>, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences <b>141</b>, Springer-Verlag, 2004, 455pp., £73.00/$109.00/94.95 Euros","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Euros; Encyclopedia; Philosophy; Humanities; Computer science; Library science","score_opus":0.01573402401454194,"score_gpt":0.2527290843312331,"score_spread":0.23699506031669115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172233838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.797592,0.0047996407,0.19282828,0.00029679228,0.00017734489,0.0013107623,0.00001620169,0.00029389397,0.0026851064],"genre_scores_gemma":[0.9894175,0.00009673087,0.010295389,0.000046055582,0.000025446589,0.000033314805,0.0000039162032,0.000024701914,0.000056965684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628085,0.00036252182,0.00074021216,0.0012000094,0.00069488556,0.00072150567],"domain_scores_gemma":[0.9965374,0.0017517477,0.0003350849,0.0009039884,0.0002682066,0.00020359256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025056435,0.00041327614,0.00056701264,0.00020571657,0.0006977113,0.00026013423,0.0012608598,0.00014092776,0.000005763254],"category_scores_gemma":[0.00023223142,0.00035436917,0.00010421401,0.0015676897,0.0009474867,0.0004313871,0.0009244205,0.00044087466,0.0000047659405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001906828,0.00085051707,0.05122361,0.00043213044,0.00002472139,0.0000029891858,0.00042574306,0.0007990999,0.0026439421,0.93801206,0.00047857803,0.0050875572],"study_design_scores_gemma":[0.000751285,0.00027171237,0.0039818548,0.00009571303,0.0000071643476,0.000018398963,0.00005337044,0.03354621,0.004094285,0.9559029,0.0008414422,0.00043569054],"about_ca_topic_score_codex":0.0000233076,"about_ca_topic_score_gemma":0.0000026590992,"teacher_disagreement_score":0.1918255,"about_ca_system_score_codex":0.0000758121,"about_ca_system_score_gemma":0.00009868509,"threshold_uncertainty_score":0.9998908},"labels":[],"label_agreement":null},{"id":"W2172276559","doi":"10.1109/lics.2011.25","title":"The Dichotomy for Conservative Constraint Satisfaction Problems Revisited","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Constraint satisfaction problem; Unary operation; Constraint satisfaction; Conjecture; Constraint (computer-aided design); Complexity of constraint satisfaction; Local consistency; Constraint satisfaction dual problem; Constraint logic programming; Mathematics; Computer science; Constraint graph; Discrete mathematics; Artificial intelligence","score_opus":0.06677475835128978,"score_gpt":0.3043379363671991,"score_spread":0.23756317801590932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172276559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024478866,0.00006086108,0.9806413,0.00060453033,0.00007298386,0.000979951,0.0000033512179,0.00014853496,0.015040568],"genre_scores_gemma":[0.8397797,0.00005274296,0.15764351,0.0004239245,0.00002366351,0.000429332,0.0000016217974,0.000012614876,0.0016329248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990608,0.000097903794,0.00016697685,0.00024596593,0.00015411465,0.0002742038],"domain_scores_gemma":[0.9986135,0.0005913216,0.000068092304,0.00042685447,0.00023423087,0.00006601366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006837927,0.000085000574,0.000086437554,0.000045500095,0.00031914355,0.000082123,0.0004944691,0.000029334838,0.000033379332],"category_scores_gemma":[0.00016253817,0.00005215336,0.000049205908,0.00028688778,0.00024896336,0.00035095934,0.00010082761,0.00010282943,0.00002549556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017832945,0.000008719961,0.0018096034,0.0000071225204,0.000017608316,7.964737e-7,0.0004252808,0.0000010179959,0.0005231965,0.9573848,0.000557565,0.03924643],"study_design_scores_gemma":[0.00062445155,0.0002659311,0.0150603205,0.00002688556,0.000004206209,0.000016251399,0.00024124274,0.011990019,0.0075999405,0.94798803,0.015969625,0.00021309125],"about_ca_topic_score_codex":0.000030863845,"about_ca_topic_score_gemma":0.000038128954,"teacher_disagreement_score":0.8373318,"about_ca_system_score_codex":0.000024182913,"about_ca_system_score_gemma":0.000049869202,"threshold_uncertainty_score":0.24546264},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023074299769967836,"score_gpt":0.2875907517908187,"score_spread":0.2645164520208509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172657760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6037862,0.0005000606,0.3928737,0.0005182568,0.00004799515,0.0004250384,0.0000012203951,0.00016891943,0.001678621],"genre_scores_gemma":[0.95976406,0.00022817276,0.039769195,0.000060189523,0.00001069837,0.000046743415,0.0000020379098,0.000025052383,0.00009382441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756277,0.000113561815,0.00044695573,0.00042448,0.00043412342,0.0010180832],"domain_scores_gemma":[0.9982378,0.0006920934,0.00010520041,0.0008465913,0.000041975276,0.00007636127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007434876,0.00021673595,0.00031446957,0.00053030386,0.00008860363,0.00004507244,0.0012440645,0.00008685427,0.000016207545],"category_scores_gemma":[0.0005193391,0.00019999234,0.000085811495,0.001904408,0.00017095,0.00043303845,0.0003054283,0.0006022013,0.000041281055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001266964,0.00019138471,0.0049812733,0.000048418056,0.00001312788,0.000083672385,0.003371429,0.00035244296,0.0011288706,0.98744893,0.000015909704,0.0023518468],"study_design_scores_gemma":[0.0005767841,0.00013100746,0.0017137929,0.00007998279,0.0000016500563,0.00008279048,0.000041776446,0.04267127,0.004400754,0.949913,0.00008804729,0.00029910088],"about_ca_topic_score_codex":0.000015231746,"about_ca_topic_score_gemma":0.00012853138,"teacher_disagreement_score":0.3559779,"about_ca_system_score_codex":0.00019606361,"about_ca_system_score_gemma":0.00014317557,"threshold_uncertainty_score":0.8155451},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012619503247578661,"score_gpt":0.2892128175860272,"score_spread":0.2765933143384485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173146142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08289341,0.0004073743,0.91413516,0.0011685252,0.000031946205,0.00039340512,0.0000021351757,0.00014327352,0.0008247722],"genre_scores_gemma":[0.858732,0.00008893878,0.14062738,0.00009846296,0.000052703967,0.000048995233,0.000008557621,0.000031438183,0.0003115373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801564,0.00010369091,0.00042596657,0.00034538834,0.00034270048,0.0007666196],"domain_scores_gemma":[0.99878395,0.00040576924,0.00009523499,0.00062154484,0.0000309712,0.00006253823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086979975,0.0001763732,0.00024139309,0.00041688472,0.0000506562,0.000052611853,0.0008729325,0.00007738972,0.000036286936],"category_scores_gemma":[0.00028786185,0.00016509621,0.00005442101,0.001269664,0.00006881198,0.00048312778,0.00013240747,0.00038240975,0.00020489804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022766908,0.00032105137,0.000774746,0.00006580696,0.000019917485,0.000017745879,0.0024549474,0.015628295,0.0044057495,0.96328104,0.00005632831,0.012951606],"study_design_scores_gemma":[0.00039347142,0.000081297505,0.000095283,0.000056791792,0.0000020014127,0.00000983354,0.000012937815,0.43290707,0.005038403,0.56089514,0.00029622042,0.00021155177],"about_ca_topic_score_codex":0.0000048094794,"about_ca_topic_score_gemma":0.00012074451,"teacher_disagreement_score":0.77583855,"about_ca_system_score_codex":0.00019886364,"about_ca_system_score_gemma":0.00009527342,"threshold_uncertainty_score":0.6732428},"labels":[],"label_agreement":null},{"id":"W2173731825","doi":"10.1007/978-3-642-35926-2_11","title":"Acyclic Coloring with Few Division Vertices","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Planar graph; Wheel graph; Subdivision; Mathematics; Graph; Directed acyclic graph; Path graph; Discrete mathematics; Graph power; Line graph","score_opus":0.025242310899883862,"score_gpt":0.2823510836079752,"score_spread":0.2571087727080913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173731825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008078029,0.0011856987,0.993786,0.00033410895,0.00078822894,0.00042884573,0.0000017379716,0.00020424282,0.0024633533],"genre_scores_gemma":[0.6331234,0.00010615046,0.36543974,0.00052289286,0.00035105835,0.000019915527,0.0000023798325,0.000060033104,0.00037442357],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952505,0.00005788117,0.00038339238,0.0015401569,0.0016021917,0.0011658713],"domain_scores_gemma":[0.99653137,0.0008497704,0.00023544236,0.0018070923,0.0002394433,0.00033690495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001185457,0.00055263325,0.0005102672,0.0009773972,0.0004148914,0.0005671466,0.0046244524,0.00023478126,0.000026673955],"category_scores_gemma":[0.0000887792,0.00043209348,0.000095030155,0.0010336105,0.0011170678,0.0017049022,0.0024339638,0.0010909722,0.00010374429],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020564645,0.0000382665,0.0004868538,0.000048554062,0.000015907171,0.00009683303,0.00082122174,0.014794609,0.0003635963,0.054042123,0.000002867191,0.9292686],"study_design_scores_gemma":[0.0012371874,0.0013548284,0.0025535808,0.0019882082,0.000028980863,0.00025389614,7.629201e-7,0.30983984,0.011977341,0.6595844,0.008264027,0.0029169105],"about_ca_topic_score_codex":0.000010122299,"about_ca_topic_score_gemma":0.000038380276,"teacher_disagreement_score":0.92635167,"about_ca_system_score_codex":0.00029895097,"about_ca_system_score_gemma":0.00030067345,"threshold_uncertainty_score":0.9998131},"labels":[],"label_agreement":null},{"id":"W2175518075","doi":"10.1016/j.disc.2003.05.001","title":"Induced matchings in intersection graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Split graph; Block graph; Discrete mathematics; Pathwidth; Induced subgraph; Intersection graph; Matching (statistics); Interval graph; 1-planar graph; Cograph; Line graph; Graph; Vertex (graph theory)","score_opus":0.026987633859876316,"score_gpt":0.3014352730218232,"score_spread":0.2744476391619469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175518075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4400026,0.000019079049,0.5449464,0.000097431934,0.00014578104,0.00021683895,6.008592e-7,0.00011374755,0.014457568],"genre_scores_gemma":[0.923646,0.000004104708,0.07612487,0.000050030023,0.000004317058,0.000024705267,5.928414e-7,0.000014048145,0.00013138338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878037,0.0001058384,0.0002696711,0.00026002002,0.00027265734,0.0003114203],"domain_scores_gemma":[0.9991422,0.00013585537,0.00007839309,0.00053614547,0.0000368277,0.00007056832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006691866,0.00013159946,0.00016570977,0.00028410353,0.00006377183,0.00009914657,0.0005464577,0.00005391336,0.00001891492],"category_scores_gemma":[0.00022642473,0.00011614936,0.000063680294,0.00078083255,0.000038618542,0.00044315128,0.00011754173,0.00024158497,0.000058205118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017277588,0.000048833375,0.00020897698,0.000030488012,0.000005520597,0.000009423743,0.0030146663,0.000017842236,0.0025734156,0.99313,0.000014505912,0.0009445663],"study_design_scores_gemma":[0.00024456266,0.000048340447,0.00017680781,0.00005341107,0.0000015456209,0.000026841173,0.0006965099,0.0073502185,0.0067226947,0.98440087,0.00011081063,0.0001674022],"about_ca_topic_score_codex":0.0000061520027,"about_ca_topic_score_gemma":0.000012666428,"teacher_disagreement_score":0.48364335,"about_ca_system_score_codex":0.000050940867,"about_ca_system_score_gemma":0.000026180898,"threshold_uncertainty_score":0.47364333},"labels":[],"label_agreement":null},{"id":"W2176631256","doi":"","title":"Gamma-Set Domination Graphs. I: Complete Biorientations of q- Extended Stars and Wounded Spider Graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Digraph","score_opus":0.025642448316697965,"score_gpt":0.2990597536592489,"score_spread":0.27341730534255093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176631256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87150717,0.00033849353,0.12219415,0.00025181848,0.0050160033,0.00044354072,0.0000061957994,0.000045767032,0.00019686676],"genre_scores_gemma":[0.9519046,0.00008407602,0.047812477,0.000018281971,0.00014909687,0.0000029888545,0.0000017159617,0.000025251264,0.0000015170416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965846,0.0001946111,0.0013809172,0.00034891456,0.0010567508,0.00043420115],"domain_scores_gemma":[0.99588037,0.0009030959,0.00143072,0.00042808644,0.0010722561,0.000285449],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002141013,0.0003253395,0.00082669046,0.00068447075,0.00038904833,0.00028129155,0.00081297127,0.00015143452,0.0000024938959],"category_scores_gemma":[0.00054378324,0.00030107299,0.00020880715,0.0010314592,0.00036583692,0.000758103,0.00043501638,0.00053748064,9.094542e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076648575,0.0004938032,0.000102829035,0.00013714968,0.000098280594,0.000021528813,0.0020946127,0.000059798418,0.004069774,0.9913596,0.000015440115,0.0014705402],"study_design_scores_gemma":[0.0063987123,0.0012296728,0.0005752444,0.0002621059,0.000052789583,0.000140053,0.0004713082,0.0017189395,0.0027465327,0.98606193,0.000060479702,0.00028222176],"about_ca_topic_score_codex":0.000013992931,"about_ca_topic_score_gemma":9.978137e-7,"teacher_disagreement_score":0.080397435,"about_ca_system_score_codex":0.00009391691,"about_ca_system_score_gemma":0.00020027178,"threshold_uncertainty_score":0.99994415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Discrete mathematics; Indifference graph; Graph","score_opus":0.01168407347966107,"score_gpt":0.2914724522231081,"score_spread":0.27978837874344703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176863076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2910576,0.0006688622,0.70152485,0.0028591256,0.00003982623,0.00035066993,0.0000012072429,0.00015387719,0.0033440138],"genre_scores_gemma":[0.93483484,0.000087294946,0.064600095,0.00015413303,0.000026792752,0.000021576783,5.5665464e-7,0.000016571168,0.00025814705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984956,0.00005410148,0.00022799682,0.00031936864,0.00029337383,0.00060955214],"domain_scores_gemma":[0.9985475,0.0007163451,0.000057096764,0.0005883499,0.000020278532,0.000070455106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057893473,0.00015442666,0.00018115941,0.0001659469,0.00007060989,0.000074665644,0.0006452432,0.000050397502,0.000020378231],"category_scores_gemma":[0.0004059504,0.00013163431,0.000036573958,0.00036911565,0.0000898487,0.00028563253,0.00022919168,0.00034912062,0.0000662319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005568817,0.00005656974,0.000037358135,0.000019412264,0.0000065083705,0.0000032017324,0.0006217865,0.0003689263,0.0004065567,0.980243,0.000020741494,0.018210322],"study_design_scores_gemma":[0.00026066418,0.00014257312,0.000055179673,0.000055392746,0.0000019044688,0.000017876951,0.000016250746,0.07171378,0.005625166,0.92158735,0.00034363478,0.00018023905],"about_ca_topic_score_codex":0.0000015090073,"about_ca_topic_score_gemma":0.000034949004,"teacher_disagreement_score":0.64377725,"about_ca_system_score_codex":0.0001236369,"about_ca_system_score_gemma":0.000051625266,"threshold_uncertainty_score":0.5367891},"labels":[],"label_agreement":null},{"id":"W2178834151","doi":"10.55016/ojs/cdm.v6i2.62073","title":"Signed star k-domatic number of a graph","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Mathematics; Graph; Combinatorics","score_opus":0.027351266769131025,"score_gpt":0.3223965417862386,"score_spread":0.2950452750171076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178834151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027759798,0.000038496502,0.96573085,0.00018060947,0.00006245528,0.0005626143,0.00009377507,0.00014439103,0.005427024],"genre_scores_gemma":[0.64446884,0.0000035449523,0.3552036,0.00003929795,0.000009998817,0.00008124674,0.0000037896764,0.000014028114,0.00017565564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822646,0.00010509652,0.0005200088,0.00028018557,0.00040341192,0.00046482266],"domain_scores_gemma":[0.99766445,0.0003143006,0.00017260105,0.0011461264,0.00046745036,0.0002350433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006672001,0.00018109196,0.00035593545,0.0001993692,0.00015020736,0.000046010955,0.0012142655,0.00006207006,0.0001629494],"category_scores_gemma":[0.00079240097,0.0001554583,0.00015192165,0.0011371948,0.00016631,0.00033738572,0.0004164238,0.00012733403,0.00032814904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009340799,0.00016100964,0.0000754513,0.000059325877,0.000044109165,0.0000065305167,0.0026235292,0.0000053188296,0.0016075011,0.9949111,0.00014490617,0.00035187867],"study_design_scores_gemma":[0.00042116607,0.00011950884,0.00025269977,0.00010031235,0.000023811075,0.000022095113,0.00024921267,0.004970149,0.013278857,0.9801914,0.0001248332,0.00024594914],"about_ca_topic_score_codex":0.000007616863,"about_ca_topic_score_gemma":0.0000030153114,"teacher_disagreement_score":0.61670905,"about_ca_system_score_codex":0.000050907685,"about_ca_system_score_gemma":0.00007605847,"threshold_uncertainty_score":0.6339405},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01186500088918949,"score_gpt":0.2746254796604122,"score_spread":0.26276047877122266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179188366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6188143,0.000829842,0.36652792,0.00048738837,0.00009105289,0.0010135914,0.000004879295,0.00026949853,0.011961533],"genre_scores_gemma":[0.97815245,0.00036688862,0.020425048,0.000031584223,0.000012506831,0.000048645485,0.0000044708718,0.000029392064,0.0009290202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976559,0.00014843784,0.0005602034,0.00040788873,0.0004761336,0.0007513844],"domain_scores_gemma":[0.9983462,0.000498331,0.00016004368,0.00085184723,0.00007422204,0.00006932059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069318915,0.00023295001,0.00038061242,0.0003628707,0.00010340696,0.00005377911,0.0010231426,0.000102258025,0.0003064112],"category_scores_gemma":[0.00014750063,0.00021530846,0.00012434862,0.0021434808,0.00016439556,0.0003519306,0.00012363252,0.0003682009,0.000099277946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020086406,0.00075403217,0.00060749095,0.00033894624,0.0001520976,0.000019531592,0.0033170525,0.0061039724,0.0074749663,0.96690434,0.00017883167,0.013947898],"study_design_scores_gemma":[0.0007532846,0.00034538732,0.00015654987,0.00012018937,0.000010999066,0.00002894792,0.000050829287,0.12159193,0.036022358,0.84027624,0.0003454205,0.00029785675],"about_ca_topic_score_codex":0.0000411484,"about_ca_topic_score_gemma":0.000086686436,"teacher_disagreement_score":0.35933813,"about_ca_system_score_codex":0.00015952092,"about_ca_system_score_gemma":0.00016822112,"threshold_uncertainty_score":0.8780024},"labels":[],"label_agreement":null},{"id":"W2179550966","doi":"10.1016/j.disc.2011.03.028","title":"The crossing number of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mspace width=\"0.16667em\"/><mml:mi>□</mml:mi><mml:mspace width=\"0.16667em\"/><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Research Nova Scotia; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Cartesian product; Combinatorics; Mathematics; Graph; Crossing number (knot theory); Vertex (graph theory); Discrete mathematics","score_opus":0.024330179051812898,"score_gpt":0.2668875939251289,"score_spread":0.242557414873316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179550966","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17747723,0.003931997,0.007458856,0.0020878583,0.0075604348,0.00017248603,0.0014221718,0.0008998499,0.7989891],"genre_scores_gemma":[0.9569376,0.004131663,0.01643651,0.003314194,0.005254867,0.00463964,0.003294882,0.0039870525,0.0020035983],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9638398,0.0025801263,0.006975416,0.0064440626,0.010288341,0.009872246],"domain_scores_gemma":[0.9668327,0.008085173,0.00862015,0.010609822,0.0009809296,0.00487123],"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.009143555,0.0034854852,0.0013140292,0.0023720784,0.007183819,0.007731403,0.012086286,0.00786989,0.8898268],"category_scores_gemma":[0.008506335,0.0071287374,0.007297501,0.0058327843,0.010394209,0.00657588,0.010633889,0.0069956593,0.0072848676],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004312037,0.0010868737,0.00006188031,0.0040599653,0.0052439314,0.0044113602,0.008314657,0.0031454703,0.003428464,0.34502465,0.61741257,0.0034981845],"study_design_scores_gemma":[0.0056467364,0.0040995977,0.0001808232,0.0050384817,0.004668049,0.0056073577,0.008111059,0.02439905,0.92480624,0.0016212673,0.009309218,0.006512108],"about_ca_topic_score_codex":0.004879994,"about_ca_topic_score_gemma":0.007822135,"teacher_disagreement_score":0.9213778,"about_ca_system_score_codex":0.00007891835,"about_ca_system_score_gemma":0.0072747013,"threshold_uncertainty_score":0.99984545},"labels":[],"label_agreement":null},{"id":"W2179924680","doi":"10.1016/j.ejc.2011.12.010","title":"Computability of width of submodular partition functions","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Grantová Agentura České Republiky","keywords":"Submodular set function; Mathematics; Partition (number theory); Combinatorics; Discrete mathematics; Graph; Exponential function","score_opus":0.026041076771552606,"score_gpt":0.2625905182321438,"score_spread":0.2365494414605912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179924680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39013332,0.000466846,0.60670364,0.000075922115,0.000754041,0.000053890137,0.0000017449563,0.000012863605,0.0017977474],"genre_scores_gemma":[0.9945682,0.00002515863,0.005298584,0.00000990176,0.00005657413,2.1225829e-7,4.2952072e-7,0.0000106761045,0.000030212816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9976817,0.0008629154,0.0006085202,0.00009506527,0.00052289537,0.0002289221],"domain_scores_gemma":[0.99791133,0.00019048172,0.0005955705,0.00043093157,0.00069412927,0.00017754159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033464162,0.0000913896,0.00024469086,0.00019691864,0.000057077537,0.000014628194,0.00072879094,0.000016238402,0.000011456067],"category_scores_gemma":[0.00025641185,0.00008097467,0.00014306685,0.0006670316,0.00013835604,0.00068343343,0.00018982794,0.00025557834,0.000011125129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012797724,0.0024106293,0.09282848,0.00016300842,0.00013980278,0.00004601426,0.0016936983,0.0018473176,0.008744967,0.8651771,0.001064845,0.025756186],"study_design_scores_gemma":[0.0047714915,0.004875806,0.52253443,0.00031263902,0.00010515975,0.0004201527,0.0003182507,0.0032308854,0.047035303,0.39720756,0.018470215,0.0007180874],"about_ca_topic_score_codex":3.7596942e-7,"about_ca_topic_score_gemma":3.8679154e-8,"teacher_disagreement_score":0.6044349,"about_ca_system_score_codex":0.000040613217,"about_ca_system_score_gemma":0.000048828173,"threshold_uncertainty_score":0.3302051},"labels":[],"label_agreement":null},{"id":"W2184256762","doi":"10.82308/54428","title":"Fractional edge and total colouring","year":2012,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Mathematics; Degree (music); Combinatorics; Graph; Discrete mathematics; Edge coloring; Integer (computer science); Graph power; Computer science; Line graph","score_opus":0.020394808829064786,"score_gpt":0.27734806691137387,"score_spread":0.25695325808230907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184256762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92191786,0.0010646222,0.00004543751,0.000028019766,0.0026431629,0.00069392443,0.00025696537,0.0004808514,0.072869144],"genre_scores_gemma":[0.981371,0.0001268022,0.0052277735,0.000092578965,0.00012398783,0.00015919936,0.00018575566,0.00012889871,0.012583995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557114,0.00036784762,0.0005852463,0.0012603077,0.0011388221,0.0010766203],"domain_scores_gemma":[0.9970671,0.0005482027,0.0003925911,0.0009841385,0.00039990124,0.0006080614],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011635127,0.0006496423,0.0005707348,0.00061325385,0.0015064512,0.00022197934,0.001278615,0.0006345901,0.00017968645],"category_scores_gemma":[0.00051535317,0.00071035407,0.00023413412,0.00074411335,0.00010011489,0.0028274406,0.00056918955,0.0021247286,0.00040865943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013221218,0.00017686807,0.00007622839,0.00019507167,0.00014248156,0.000066606226,0.00001692639,0.000024965499,0.026906326,0.7572103,0.000005842613,0.21504614],"study_design_scores_gemma":[0.0032499745,0.00065864844,0.04660694,0.0008929928,0.00023134798,0.00087146595,0.00043455686,0.0007492308,0.1350135,0.6726971,0.13338807,0.005206114],"about_ca_topic_score_codex":0.000044558645,"about_ca_topic_score_gemma":0.00012160492,"teacher_disagreement_score":0.20984003,"about_ca_system_score_codex":0.0004407235,"about_ca_system_score_gemma":0.000074943004,"threshold_uncertainty_score":0.99979347},"labels":[],"label_agreement":null},{"id":"W2184414793","doi":"","title":"Diameter of paired domination edge-critical graphs","year":2008,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Domination analysis; Graph; Induced subgraph; Discrete mathematics; Vertex (graph theory)","score_opus":0.04648292806852639,"score_gpt":0.31125548283966037,"score_spread":0.264772554771134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184414793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57776475,0.00012787804,0.4163841,0.0015634617,0.00056046864,0.00036980314,0.000008708346,0.00025226414,0.0029685558],"genre_scores_gemma":[0.9655909,0.0000216449,0.03380845,0.00006045542,0.00002081439,0.000017866189,0.0000023354162,0.000010423606,0.00046709136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983785,0.00016287882,0.00027589515,0.0003426444,0.00044977956,0.00039025853],"domain_scores_gemma":[0.9983885,0.00056409376,0.000056640274,0.00064817094,0.00019954,0.00014300726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003229542,0.00013449254,0.00020977354,0.00023749373,0.00012845965,0.00002515862,0.0008140093,0.00007679323,0.000053601212],"category_scores_gemma":[0.00030150192,0.0001274722,0.00012179925,0.000683923,0.0005194671,0.00057624077,0.00019247949,0.00020653696,0.00006152481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048956314,0.000449708,0.016327688,0.00006236154,0.0000430876,0.0001382173,0.0009340825,0.000046281533,0.0128566995,0.94296956,0.0038091121,0.022314219],"study_design_scores_gemma":[0.0023312727,0.0010648571,0.16721442,0.00010228289,0.000022767412,0.00027898536,0.00008632693,0.0062852693,0.14300136,0.6761329,0.0026027905,0.00087673205],"about_ca_topic_score_codex":0.000008535648,"about_ca_topic_score_gemma":0.0000018012253,"teacher_disagreement_score":0.38782617,"about_ca_system_score_codex":0.000023697627,"about_ca_system_score_gemma":0.00005133101,"threshold_uncertainty_score":0.5198165},"labels":[],"label_agreement":null},{"id":"W2184743223","doi":"","title":"Eternal domination on 3 × n grid graphs","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; St. Francis Xavier University","funders":"","keywords":"Dominating set; Vertex (graph theory); Domination analysis; Combinatorics; Mathematics; Grid; Graph; Computer science; Discrete mathematics","score_opus":0.06277409480743021,"score_gpt":0.32890396252145476,"score_spread":0.2661298677140246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184743223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8297625,0.000082578685,0.1359447,0.0038417575,0.0029174911,0.0006342936,0.000012244332,0.0006617466,0.02614264],"genre_scores_gemma":[0.99113524,0.0000061214664,0.007035083,0.00020477374,0.00008721003,0.000019404839,0.0000044801864,0.000011674795,0.0014960184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982988,0.00013788702,0.00017859784,0.00037044744,0.00062023336,0.00039402052],"domain_scores_gemma":[0.9987368,0.00013461041,0.000066854496,0.0006409417,0.00015327497,0.00026752916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005608665,0.00014613336,0.00013599292,0.0002400186,0.00008689635,0.0001298607,0.001067358,0.00006339391,0.000021791662],"category_scores_gemma":[0.00010800134,0.00013235676,0.000070500006,0.000533836,0.000097217344,0.00058803416,0.00019151361,0.00028906422,0.00045545175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080618265,0.00019009213,0.0040323418,0.000008856333,0.00002599397,0.00009680022,0.0004631076,0.0006205572,0.0009083596,0.9433077,0.015294286,0.034971304],"study_design_scores_gemma":[0.003223528,0.0016274598,0.02506436,0.00006776199,0.000009386073,0.00010416142,0.00009927668,0.0072889156,0.02535114,0.90796757,0.028455438,0.00074099726],"about_ca_topic_score_codex":0.000013940545,"about_ca_topic_score_gemma":0.0000045373145,"teacher_disagreement_score":0.16137269,"about_ca_system_score_codex":0.00006965848,"about_ca_system_score_gemma":0.000059624963,"threshold_uncertainty_score":0.5854063},"labels":[],"label_agreement":null},{"id":"W2185242172","doi":"10.1016/j.dam.2015.10.035","title":"A survey on flows in graphs and matroids","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Mathematics; Combinatorics; Bottleneck; Minimax; Flow (mathematics); Graph; Discrete mathematics; Mathematical economics; Computer science","score_opus":0.04795131266788904,"score_gpt":0.30756618463993707,"score_spread":0.259614871972048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185242172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56143546,0.00014343615,0.41243714,0.00020913073,0.0001062736,0.00093201257,0.000020916912,0.00028491375,0.024430728],"genre_scores_gemma":[0.870008,0.000013593075,0.12971121,0.000085430744,0.0000073936058,0.00006076848,0.0000070208657,0.000024197743,0.000082368875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985943,0.00005703568,0.00025521198,0.00034137993,0.00040718497,0.00034487608],"domain_scores_gemma":[0.9986976,0.0003437686,0.00006363253,0.00067015155,0.000042788197,0.000182057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013218427,0.00016841761,0.00024765823,0.0002189032,0.000044041168,0.000105009734,0.0006206115,0.000057311157,0.0000024930127],"category_scores_gemma":[0.00013986173,0.00014078374,0.000026358855,0.0006138673,0.00008077767,0.00014075592,0.0003192153,0.00019760446,0.00006367597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023159984,0.000072149414,0.00032187757,0.000030319203,0.0000072768235,0.000009078159,0.0016083088,0.00011448273,0.00033133238,0.9947523,0.00018411172,0.0025456054],"study_design_scores_gemma":[0.0007101513,0.00009084872,0.0021007047,0.000027597984,0.0000019659028,0.000004748882,0.00024438626,0.031463116,0.00049961143,0.96454906,0.000068636524,0.0002391746],"about_ca_topic_score_codex":0.000011936513,"about_ca_topic_score_gemma":0.000054490825,"teacher_disagreement_score":0.30857256,"about_ca_system_score_codex":0.000031859945,"about_ca_system_score_gemma":0.00003621306,"threshold_uncertainty_score":0.5740994},"labels":[],"label_agreement":null},{"id":"W2185442857","doi":"","title":"Improved upper bounds for the k-tuple domination number","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Tuple; Upper and lower bounds; Domination analysis; Mathematics; Combinatorics; Graph; Discrete mathematics; Mathematical analysis; Vertex (graph theory)","score_opus":0.026022842544114376,"score_gpt":0.3115432153313554,"score_spread":0.2855203727872411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185442857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077963765,0.00003135393,0.98435724,0.0017537139,0.00016327927,0.0003418548,0.0000010153784,0.0001000727,0.0054550967],"genre_scores_gemma":[0.86818457,0.00002370395,0.10819251,0.000500812,0.00007880589,0.0001726114,0.0000014551555,0.000011090094,0.02283445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992305,0.000028872548,0.00010113426,0.00021400744,0.00017390751,0.0002515739],"domain_scores_gemma":[0.9988509,0.00046567578,0.000026926711,0.0004775929,0.0001360129,0.000042896543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035047083,0.00006903007,0.00006478865,0.00003381942,0.00041882068,0.000065804685,0.00071283133,0.000028758388,0.00007556949],"category_scores_gemma":[0.00009961983,0.000042119937,0.00006722416,0.00026833394,0.00010734823,0.00042976704,0.00014329032,0.0000755716,0.000066588946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033676995,0.00005139414,0.00069325365,0.0000053612353,0.000019569432,0.0000019607894,0.00065897097,0.000030365944,0.0037046026,0.94265854,0.0058515607,0.046290714],"study_design_scores_gemma":[0.0017704754,0.00017141135,0.004975512,0.000004405158,0.000005880338,0.000112361966,0.00013731833,0.5945882,0.03280545,0.24914126,0.11589727,0.00039041776],"about_ca_topic_score_codex":0.000014253192,"about_ca_topic_score_gemma":0.0000081531025,"teacher_disagreement_score":0.87616473,"about_ca_system_score_codex":0.000024946014,"about_ca_system_score_gemma":0.00004554002,"threshold_uncertainty_score":0.32212722},"labels":[],"label_agreement":null},{"id":"W2186560431","doi":"","title":"Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Interval (graph theory); Maximal independent set; Set (abstract data type); Interval graph; Combinatorics; Space (punctuation); Independent set; Mathematics; Upper and lower bounds; Discrete mathematics; Product (mathematics); Algorithm; Computer science; Pathwidth; Graph; Line graph","score_opus":0.04062558458719696,"score_gpt":0.28570176632086003,"score_spread":0.24507618173366308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186560431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17525288,0.00004685883,0.82002425,0.0021003254,0.00016746145,0.0003606585,0.00005792032,0.000043033204,0.0019466092],"genre_scores_gemma":[0.98522705,0.0000033980646,0.014128423,0.00047199862,0.000014335473,0.00004193455,0.000024332752,0.000012093278,0.00007645527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998235,0.000102282764,0.00021980317,0.0005653234,0.00036613934,0.0005114592],"domain_scores_gemma":[0.99849683,0.00048045823,0.0000585391,0.0002875888,0.00022150151,0.00045507925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009868,0.0001804561,0.00020872758,0.0013557287,0.00014696535,0.00019690803,0.00063732686,0.00008102013,0.00001596623],"category_scores_gemma":[0.00012667185,0.00019016485,0.000051795156,0.00073257776,0.0001236307,0.0001978453,0.000109908135,0.00023126247,0.000014248297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014342591,0.000018995615,0.00037143537,0.000009371942,0.000006985211,0.0000060454895,0.00019914305,0.19373192,0.00000768184,0.78910357,0.000079573954,0.016450958],"study_design_scores_gemma":[0.00035866656,0.00009893551,0.003872951,0.000024556808,8.5763463e-7,0.0000056305967,0.00004466876,0.54673153,0.000011304738,0.44857737,0.00014673805,0.00012681389],"about_ca_topic_score_codex":0.0014854405,"about_ca_topic_score_gemma":0.011699358,"teacher_disagreement_score":0.80997413,"about_ca_system_score_codex":0.00016069325,"about_ca_system_score_gemma":0.0004269461,"threshold_uncertainty_score":0.7754698},"labels":[],"label_agreement":null},{"id":"W2187659169","doi":"","title":"Nearly-acyclically pushable tournaments","year":2001,"lang":"es","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Digraph; Combinatorics; Directed acyclic graph; Tournament; Mathematics; Vertex (graph theory); Feedback arc set; Multipartite; Directed graph; Discrete mathematics; Graph; Physics","score_opus":0.028606739771165016,"score_gpt":0.32417497653963234,"score_spread":0.29556823676846733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187659169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18867077,0.0007076578,0.57076687,0.0070570204,0.00075375364,0.0005840618,0.0000054561124,0.0003921972,0.2310622],"genre_scores_gemma":[0.8753154,0.0010929423,0.050009303,0.0015847846,0.00030432123,0.00003069183,0.000002578585,0.000051623218,0.07160834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966297,0.00021213271,0.00040421396,0.00077238044,0.0008689371,0.0011126153],"domain_scores_gemma":[0.9977052,0.00021202736,0.0001020929,0.0012751082,0.00020759628,0.0004979498],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00064912817,0.00028391546,0.00029831982,0.00023474512,0.00035327612,0.0011530395,0.0022325208,0.00012801867,0.0019879686],"category_scores_gemma":[0.00014698166,0.00025499327,0.00015421762,0.0013111391,0.00022522692,0.0013831041,0.0010799412,0.00045378978,0.0032426855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018168599,0.00077304745,0.044757653,0.000043343443,0.00014119058,0.00081428385,0.000392083,0.00035321846,0.0057992633,0.58150536,0.007660688,0.35757816],"study_design_scores_gemma":[0.0029692412,0.0013585627,0.045591373,0.00027477846,0.00002676078,0.0004994074,0.00016572048,0.07787404,0.004723129,0.2099673,0.6548579,0.0016918057],"about_ca_topic_score_codex":0.00007383511,"about_ca_topic_score_gemma":0.000008126853,"teacher_disagreement_score":0.6866446,"about_ca_system_score_codex":0.00009803655,"about_ca_system_score_gemma":0.00012795896,"threshold_uncertainty_score":0.9999902},"labels":[],"label_agreement":null},{"id":"W2188243551","doi":"","title":"A class of trees with equal broadcast and domination numbers","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Graph; Class (philosophy); Domination analysis; Dominating set; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.01560847507420745,"score_gpt":0.2673208201156543,"score_spread":0.25171234504144685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188243551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9352217,0.000033610715,0.061264362,0.000638965,0.00004552686,0.00031078636,0.000002117751,0.000062981446,0.0024199653],"genre_scores_gemma":[0.9867876,0.000007794928,0.012377435,0.000028338627,0.000010516701,0.000023546925,0.0000013644345,0.000007712421,0.0007557002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989712,0.0000709457,0.00015366443,0.00025740237,0.0002868545,0.0002598864],"domain_scores_gemma":[0.999162,0.00016986653,0.000077681354,0.00035589605,0.00012924551,0.000105315456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016450594,0.00010966475,0.00014876298,0.000114590875,0.000057790287,0.00007889617,0.000410824,0.00004451031,0.00004211541],"category_scores_gemma":[0.000025961344,0.00008771137,0.000024948362,0.00035741436,0.00024543822,0.0007429307,0.00013758356,0.00013227743,0.0000312097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010759766,0.00030993734,0.04540276,0.00009954098,0.00011391473,0.000031471427,0.0025956463,0.00039800952,0.023825556,0.6916757,0.0024693387,0.23297048],"study_design_scores_gemma":[0.009571645,0.0043700123,0.5324977,0.0003654585,0.000054961198,0.00034294414,0.0019147719,0.04997595,0.075443745,0.31809682,0.0055149025,0.0018510892],"about_ca_topic_score_codex":0.00008296111,"about_ca_topic_score_gemma":0.000040269853,"teacher_disagreement_score":0.48709494,"about_ca_system_score_codex":0.000017896615,"about_ca_system_score_gemma":0.00003016552,"threshold_uncertainty_score":0.3576766},"labels":[],"label_agreement":null},{"id":"W2188244362","doi":"10.82308/16876","title":"Claw-free graphs and two conjectures on omega, Delta, and chi","year":2009,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Neighbourhood (mathematics); Claw; Vertex (graph theory); Discrete mathematics; Upper and lower bounds; Chromatic scale; Graph","score_opus":0.016147168152786755,"score_gpt":0.2641341385737215,"score_spread":0.24798697042093473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188244362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97712374,0.0006987792,0.0000747827,0.00033353068,0.00021723709,0.00051971246,0.00013972241,0.0004887644,0.02040374],"genre_scores_gemma":[0.9871309,0.00021261066,0.01012277,0.0021647287,0.000018777102,0.000024229155,0.000005413231,0.00004106995,0.00027954383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612117,0.0004228167,0.0004275309,0.0012977876,0.00078657427,0.00094414933],"domain_scores_gemma":[0.997003,0.00048364798,0.00015273657,0.0015962904,0.00017407752,0.00059019995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011031971,0.00051244366,0.0004648132,0.0005599489,0.0012314778,0.0002757645,0.0016596101,0.00019744081,0.000016367832],"category_scores_gemma":[0.0006732055,0.00047585173,0.00013033957,0.00094608543,0.00030487208,0.001421405,0.0007623292,0.0010783211,0.000039621922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007757324,0.00008048991,0.00010220294,0.000012467331,0.000028200655,0.00007507333,0.0000070079,0.000033195807,0.008532408,0.81431407,0.0000073226793,0.17672998],"study_design_scores_gemma":[0.002015462,0.0007630268,0.005440426,0.000065133085,0.0000146410175,0.00015866579,0.000014948523,0.00035474333,0.023470292,0.9585608,0.008503243,0.0006385706],"about_ca_topic_score_codex":0.0000498922,"about_ca_topic_score_gemma":0.000119915465,"teacher_disagreement_score":0.1760914,"about_ca_system_score_codex":0.00011096524,"about_ca_system_score_gemma":0.000019982697,"threshold_uncertainty_score":0.99976933},"labels":[],"label_agreement":null},{"id":"W2188424643","doi":"10.1093/comjnl/bxv084","title":"Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two","year":2015,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Lexicographical order; Cartesian product; Product (mathematics); Library science; Mathematics; Cartesian coordinate system; Computer science; Combinatorics; Physics; Geometry","score_opus":0.027513199516112835,"score_gpt":0.2883925827735022,"score_spread":0.26087938325738935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188424643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25185212,0.0016425947,0.74245715,0.0029530167,0.0004447269,0.00029040716,0.0000027167175,0.00012182731,0.00023541236],"genre_scores_gemma":[0.9369682,0.00007380624,0.06214357,0.00037696664,0.00032366696,0.000010934173,0.0000019110994,0.000021019428,0.00007994186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772316,0.00040853838,0.00026292962,0.00042873385,0.00066550216,0.00051112764],"domain_scores_gemma":[0.99830574,0.00014624055,0.0001959131,0.0006576858,0.00033273533,0.00036169868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556108,0.00022031151,0.00021717465,0.00024351616,0.00069183356,0.00052406994,0.0011016459,0.000025403797,0.00000383729],"category_scores_gemma":[0.000020481382,0.00013491194,0.00006457336,0.00084463746,0.00041091707,0.0008334735,0.0004310981,0.0005582887,0.000012582221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009341374,0.0003994778,0.04471394,0.00009143268,0.0005931074,0.0011513545,0.013094545,0.011594913,0.0038956895,0.704155,0.008271776,0.21110462],"study_design_scores_gemma":[0.005687997,0.0013750144,0.008961033,0.00032296657,0.000054816024,0.013292513,0.00015662688,0.06103448,0.0014685383,0.9009703,0.005711074,0.0009646652],"about_ca_topic_score_codex":0.0000037116135,"about_ca_topic_score_gemma":0.000021110734,"teacher_disagreement_score":0.68511605,"about_ca_system_score_codex":0.00006576192,"about_ca_system_score_gemma":0.000087864624,"threshold_uncertainty_score":0.5501549},"labels":[],"label_agreement":null},{"id":"W2188440933","doi":"","title":"Optimal Bounds on Theta-Graphs: More is not Always Better.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics","score_opus":0.05157835567815482,"score_gpt":0.30788677617249155,"score_spread":0.2563084204943367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188440933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60512376,0.0002855218,0.30798918,0.036390815,0.002017955,0.0009831844,0.0006117362,0.0004444992,0.046153337],"genre_scores_gemma":[0.9716557,0.0000056863223,0.016142638,0.011376031,0.00013432237,0.000032434556,0.000048909096,0.000026527892,0.0005777131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968674,0.00012352037,0.00029320465,0.0006391663,0.0009477531,0.001128911],"domain_scores_gemma":[0.9972061,0.00044758216,0.000100666286,0.0007167707,0.00033631336,0.0011925743],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00050012453,0.00032778093,0.00026915089,0.0014199554,0.00047237868,0.00034176395,0.001409014,0.00013781543,0.00051122316],"category_scores_gemma":[0.00010162651,0.0003287392,0.00014192742,0.0014085065,0.00027000083,0.000659192,0.00013346551,0.0005269334,0.0009204489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024245857,0.00008785901,0.0021690426,0.0000104484425,0.000060873746,0.00003360207,0.0006721725,0.0074772346,0.00003273539,0.95492584,0.0049632974,0.029542636],"study_design_scores_gemma":[0.002586549,0.0013959557,0.14715071,0.00026017876,0.000037157144,0.0001919337,0.00061217014,0.34195697,0.0027064118,0.41675243,0.08299987,0.003349659],"about_ca_topic_score_codex":0.00074857817,"about_ca_topic_score_gemma":0.00026449628,"teacher_disagreement_score":0.53817344,"about_ca_system_score_codex":0.0002804134,"about_ca_system_score_gemma":0.0008041356,"threshold_uncertainty_score":0.9999165},"labels":[],"label_agreement":null},{"id":"W2188854178","doi":"","title":"The modular product and existential closure II","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Graph; Adjacency list; Adjacency matrix; Modular design; Closure (psychology); Discrete mathematics; Computer science","score_opus":0.025296255952936945,"score_gpt":0.28952756527783374,"score_spread":0.2642313093248968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188854178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799583,0.002075799,0.009354964,0.003995957,0.0010514794,0.00050215685,0.0000028088443,0.0002027356,0.0028558208],"genre_scores_gemma":[0.99274623,0.00007011536,0.0032898388,0.000041817922,0.00018859252,0.000021378442,0.0000010141663,0.000010714099,0.003630268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984451,0.00013531285,0.00015213151,0.00029739988,0.0003402465,0.0006298037],"domain_scores_gemma":[0.99876475,0.00011010021,0.00004880157,0.0008274076,0.00006814209,0.00018081041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007474927,0.00013431959,0.0001142415,0.00004893035,0.0006507089,0.00013418286,0.00084428035,0.000040773466,0.000011636982],"category_scores_gemma":[0.00007791495,0.00009309121,0.00005116342,0.00030089077,0.0002522074,0.0008305603,0.00061740074,0.0002655323,0.00004066814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028876962,0.00015788905,0.017603453,0.000021478261,0.00006372913,0.000010429872,0.00097076106,0.000052428226,0.004509016,0.93856275,0.0043375758,0.033681616],"study_design_scores_gemma":[0.002137254,0.0008208208,0.20281355,0.000057673144,0.000047778256,0.00043657777,0.00026814695,0.0037371772,0.0381599,0.20813954,0.5419957,0.0013858896],"about_ca_topic_score_codex":0.000007112335,"about_ca_topic_score_gemma":0.000002250015,"teacher_disagreement_score":0.7304232,"about_ca_system_score_codex":0.000016939546,"about_ca_system_score_gemma":0.00002390708,"threshold_uncertainty_score":0.5004793},"labels":[],"label_agreement":null},{"id":"W2200162493","doi":"10.1016/j.disc.2016.08.005","title":"The complexity of signed graph and edge-coloured graph homomorphisms","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Signed graph; Homomorphism; Mathematics; Combinatorics; Discrete mathematics; Graph homomorphism; Vertex (graph theory); Conjecture; Graph; Line graph; Voltage graph","score_opus":0.0429401250024845,"score_gpt":0.28911771706390726,"score_spread":0.24617759206142276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200162493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036958802,0.00027265638,0.95823944,0.0019789652,0.000097504104,0.000432495,0.000023990826,0.00010401934,0.0018921023],"genre_scores_gemma":[0.9079445,0.00011855726,0.091502845,0.000031753814,0.000016277543,0.00003599926,8.840324e-7,0.00002023464,0.00032892736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984018,0.00013670765,0.00036754837,0.0002793114,0.00043386055,0.0003807399],"domain_scores_gemma":[0.997546,0.0009850622,0.00021092962,0.0009927124,0.00014384156,0.00012144662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084102456,0.00017131655,0.0002688749,0.00011311184,0.00029563857,0.000087514796,0.0011873206,0.000051405797,0.000010137908],"category_scores_gemma":[0.000272055,0.00008695156,0.0001078954,0.00046541722,0.0018485177,0.0002481005,0.00046546472,0.00009785984,0.000012804159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011460559,0.000036101897,0.000047521327,0.000038810824,0.000030413335,0.0000030087108,0.0005230812,7.1626414e-7,0.0074496646,0.9869259,0.00010653194,0.004826817],"study_design_scores_gemma":[0.00037666835,0.00010923498,0.0004096749,0.000061977065,0.000007752993,0.000013119753,0.00013130017,0.0010562433,0.007588751,0.98995364,0.0001489767,0.00014265749],"about_ca_topic_score_codex":0.0000020571795,"about_ca_topic_score_gemma":0.0000065754853,"teacher_disagreement_score":0.87098575,"about_ca_system_score_codex":0.00001357462,"about_ca_system_score_gemma":0.000028392125,"threshold_uncertainty_score":0.68109405},"labels":[],"label_agreement":null},{"id":"W2204215863","doi":"10.1016/j.dam.2015.10.024","title":"Complexity of coloring graphs without paths and cycles","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Complement (music); Characterization (materials science); Induced subgraph; Discrete mathematics; Time complexity; Graph; Vertex (graph theory); Physics","score_opus":0.08204450352929933,"score_gpt":0.32120248056189943,"score_spread":0.2391579770326001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204215863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31471294,0.00008531097,0.6696805,0.000089923575,0.00004229958,0.00041871867,0.000007804208,0.00014130517,0.014821218],"genre_scores_gemma":[0.67700815,0.0000081676035,0.32291573,0.000013747405,0.000006096698,0.000021858283,0.0000012656287,0.000010907653,0.000014071402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987678,0.000023786219,0.0002831555,0.00025725857,0.00040379172,0.00026419683],"domain_scores_gemma":[0.99887574,0.00013421236,0.00014977815,0.0005850103,0.00008258632,0.0001726536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005694776,0.00014610993,0.0002983146,0.000107248125,0.00006976903,0.000056377216,0.0005959397,0.000043241205,0.0000020707585],"category_scores_gemma":[0.00006425064,0.00012314552,0.000037125712,0.00031279036,0.00044561637,0.00017494251,0.0004926788,0.00012123384,0.000009016016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010352897,0.000039695227,0.0002425128,0.000092402006,0.000014540719,0.0000016758017,0.002208712,0.000020819405,0.0029939667,0.99298555,0.000015552525,0.0013742283],"study_design_scores_gemma":[0.0004077089,0.00005181977,0.00023405756,0.00002740142,0.0000068845843,0.000008234112,0.0008513058,0.012143109,0.008173973,0.9778988,0.00004374151,0.00015296735],"about_ca_topic_score_codex":0.0000031692293,"about_ca_topic_score_gemma":0.000003182751,"teacher_disagreement_score":0.3622952,"about_ca_system_score_codex":0.00001556815,"about_ca_system_score_gemma":0.000033650587,"threshold_uncertainty_score":0.5021729},"labels":[],"label_agreement":null},{"id":"W2205459017","doi":"10.22108/toc.2016.11972","title":"Total $k$-distance domination critical graphs","year":2016,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"La Cité Collégiale","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Domination analysis; Dominating set; Graph; Discrete mathematics","score_opus":0.19250794685020417,"score_gpt":0.5660743648825846,"score_spread":0.3735664180323804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205459017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19264305,0.008674023,0.78723896,0.0022138518,0.0013362878,0.0006548927,0.000049671242,0.00016811628,0.007021185],"genre_scores_gemma":[0.99221754,0.0017854724,0.005031519,0.00015410478,0.00009408919,0.000054810924,0.0000011556508,0.00003458151,0.00062672317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608207,0.0005062109,0.0007405826,0.00073314924,0.0012562064,0.0006817873],"domain_scores_gemma":[0.99581665,0.0016201347,0.0003836943,0.0010456919,0.0007103776,0.0004234449],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020581419,0.00029923394,0.00054623856,0.0010101276,0.00035419894,0.0014726834,0.0063903206,0.00010395431,0.002526425],"category_scores_gemma":[0.001594222,0.0002226083,0.00021783954,0.00182205,0.00051081815,0.008533811,0.0020244503,0.000347948,0.000060295355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003317252,0.00045672798,0.060274247,0.00008639708,0.00011552149,0.00016714296,0.00019622107,0.000036917747,0.27954304,0.42683935,0.0136484625,0.21830426],"study_design_scores_gemma":[0.00083437766,0.000028337767,0.16556443,0.00046116151,0.000015944222,0.00005805794,0.000020902935,0.00037112177,0.06289155,0.7654988,0.0036846714,0.00057062827],"about_ca_topic_score_codex":0.000036324232,"about_ca_topic_score_gemma":0.000009773327,"teacher_disagreement_score":0.7995745,"about_ca_system_score_codex":0.0001329755,"about_ca_system_score_gemma":0.0001459037,"threshold_uncertainty_score":0.9995639},"labels":[],"label_agreement":null},{"id":"W2207885168","doi":"10.23638/dmtcs-19-1-20","title":"Equivalence of the filament and overlap graphs of subtrees of limited trees","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equivalence (formal languages); Combinatorics; Mathematics; Discrete mathematics","score_opus":0.024863027125050858,"score_gpt":0.3021602226932132,"score_spread":0.27729719556816235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207885168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46328712,0.000059582082,0.5345458,0.000358653,0.00013519308,0.00029706897,0.000014356942,0.000020584623,0.0012816831],"genre_scores_gemma":[0.8688897,0.00002156963,0.13104738,0.000016146118,0.0000071774916,0.000004476055,1.5103095e-7,0.000007256527,0.0000061334795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971556,0.0001144524,0.000570688,0.00048746236,0.0012487092,0.00042306675],"domain_scores_gemma":[0.99552566,0.0007034312,0.000632908,0.0026343467,0.00035752333,0.00014612143],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018484131,0.00020023313,0.0004376351,0.00018754604,0.00043371617,0.00018068719,0.005939024,0.000048768616,0.00000953899],"category_scores_gemma":[0.0006735106,0.00012606215,0.00015720418,0.00062145677,0.01165291,0.000586196,0.0039205574,0.0001649568,8.878874e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009348359,0.000087219,0.0015557525,0.00011989866,0.000012117816,0.0000011339497,0.0011061901,0.000033011598,0.012579263,0.9816831,0.0000022071208,0.0028107963],"study_design_scores_gemma":[0.00020277743,0.00021780498,0.009120409,0.00030511888,0.0000112884845,0.000008576102,0.000062530846,0.17200197,0.06384317,0.7540926,0.0000015029892,0.00013227016],"about_ca_topic_score_codex":0.0000045466995,"about_ca_topic_score_gemma":0.0000015173727,"teacher_disagreement_score":0.4056026,"about_ca_system_score_codex":0.000012702122,"about_ca_system_score_gemma":0.00008804992,"threshold_uncertainty_score":0.9994393},"labels":[],"label_agreement":null},{"id":"W2213333469","doi":"","title":"Some new results on domination polynomials of graphs","year":2015,"lang":"en","type":"article","venue":"Filomat","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.054988141678179676,"score_gpt":0.3215748375180887,"score_spread":0.266586695839909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213333469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7212285,0.0014943907,0.16802143,0.019458033,0.0045165233,0.002363029,0.0001645121,0.0013083203,0.08144526],"genre_scores_gemma":[0.97236514,0.000015896847,0.024985362,0.00017020048,0.00013115052,0.000008008966,0.0000076614415,0.000012050804,0.0023045435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987887,0.00010234371,0.0002242032,0.00025992308,0.00041979583,0.0002050351],"domain_scores_gemma":[0.9987922,0.00020115104,0.00011158387,0.0006282998,0.00009774346,0.00016905417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006223941,0.00008631819,0.00013947116,0.00024327461,0.000033749016,0.000034050325,0.00068026053,0.00004419983,0.000005386052],"category_scores_gemma":[0.00042825844,0.00007578776,0.000049331695,0.0004249051,0.00005195647,0.0004975977,0.00015747486,0.000080123995,0.00014670638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031809017,0.00008162365,0.00005073569,0.000009116895,0.000013271021,0.000011691461,0.0010213497,0.0002271732,0.004687609,0.928561,0.030753441,0.0342649],"study_design_scores_gemma":[0.0022010617,0.00057855074,0.0015565471,0.00003796358,0.000002431575,0.000007130775,0.00003495765,0.0015599353,0.092403084,0.8957057,0.005730797,0.00018187136],"about_ca_topic_score_codex":0.000023405657,"about_ca_topic_score_gemma":0.0000022334898,"teacher_disagreement_score":0.25113663,"about_ca_system_score_codex":0.000035516954,"about_ca_system_score_gemma":0.000099656696,"threshold_uncertainty_score":0.30905348},"labels":[],"label_agreement":null},{"id":"W2214784206","doi":"10.1016/j.disc.2015.10.007","title":"Mapping planar graphs into the Coxeter graph","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; China Scholarship Council; Université Paris-Sud; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Coxeter group; Combinatorics; Coxeter graph; Planar graph; Discrete mathematics; Artin group; Coxeter element; Outerplanar graph; Graph minor; Coxeter complex; Graph homomorphism; Line graph; Graph; Voltage graph","score_opus":0.04711086523227034,"score_gpt":0.30476144166333313,"score_spread":0.2576505764310628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214784206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022790428,0.00025557497,0.96543616,0.0017229543,0.00020369126,0.00034637164,0.0000027263177,0.00022081131,0.00902128],"genre_scores_gemma":[0.58086544,0.000038072325,0.41724268,0.00070874044,0.00007957887,0.00010916507,0.0000073935685,0.000053620966,0.0008953213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819934,0.00012489018,0.00030547395,0.00030433544,0.00064927,0.00041666348],"domain_scores_gemma":[0.99802506,0.00030028078,0.00011760625,0.0012259884,0.00012780605,0.00020324852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114204,0.00018998705,0.00020527065,0.00019446471,0.00022282322,0.00023107653,0.0018778149,0.000052973523,0.000006708332],"category_scores_gemma":[0.00021713626,0.000118323296,0.00011801731,0.0009080542,0.00023954727,0.00038823966,0.0003888631,0.00024623942,0.00015639121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041443423,0.00003302436,0.00013096021,0.00004078957,0.00003502217,0.0000197099,0.027947573,0.000040539104,0.00023116916,0.9680456,0.0013013877,0.0021701052],"study_design_scores_gemma":[0.0002228827,0.00004902451,0.00003967308,0.000036022913,0.000004042803,0.000024743564,0.0027199797,0.013044914,0.0003936736,0.98019344,0.003080893,0.00019072194],"about_ca_topic_score_codex":0.000008847614,"about_ca_topic_score_gemma":0.000006807177,"teacher_disagreement_score":0.558075,"about_ca_system_score_codex":0.000030690182,"about_ca_system_score_gemma":0.000049000962,"threshold_uncertainty_score":0.4825084},"labels":[],"label_agreement":null},{"id":"W2216988477","doi":"10.37236/4141","title":"Thin Edges in Braces","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Graph; Isomorphism (crystallography); Matching (statistics); Brace; Discrete mathematics; Physics; Crystallography","score_opus":0.025499532920950443,"score_gpt":0.2907831718446497,"score_spread":0.26528363892369927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216988477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49108157,0.02691381,0.4671889,0.009914276,0.0014384135,0.00025781634,2.8358e-7,0.00005968197,0.0031452456],"genre_scores_gemma":[0.99909824,0.00037368765,0.00013970803,0.000069672395,0.000046123525,0.0000013723361,3.738426e-8,0.000007791235,0.00026338233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980769,0.00034192886,0.00030229427,0.00010596375,0.00062986417,0.0005430113],"domain_scores_gemma":[0.9986892,0.0003146361,0.00021741072,0.00037286838,0.00029702473,0.00010888528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030887797,0.00009776919,0.00018681263,0.0002154325,0.000058895363,0.00007178329,0.002137177,0.000038952567,0.000001719464],"category_scores_gemma":[0.00033358327,0.0000634274,0.00006109055,0.0010245031,0.00006933528,0.00060290383,0.00019523018,0.0009261155,0.000011313638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028714003,0.000069002795,0.0004089428,0.0000018428855,0.00001325262,0.000019528874,0.000768345,0.00035251497,0.000053228672,0.9951822,0.000278658,0.0028237524],"study_design_scores_gemma":[0.0006906152,0.0004851349,0.00025275297,0.00001162265,0.0000022578024,0.00016674798,0.00012286958,0.0011149509,0.001422704,0.9926404,0.0030153587,0.00007459531],"about_ca_topic_score_codex":0.000003421959,"about_ca_topic_score_gemma":0.0000072543726,"teacher_disagreement_score":0.50801665,"about_ca_system_score_codex":0.00034189076,"about_ca_system_score_gemma":0.0008130921,"threshold_uncertainty_score":0.40235627},"labels":[],"label_agreement":null},{"id":"W2218492333","doi":"10.1007/978-3-319-07956-1_18","title":"Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Digraph; Combinatorics; Shortest path problem; Undirected graph; Floyd–Warshall algorithm; Mathematics; Arc (geometry); Algorithm; Discrete mathematics; Computer science; K shortest path routing; Graph","score_opus":0.011084221733546137,"score_gpt":0.24170862491285053,"score_spread":0.23062440317930438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218492333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007058239,0.00016079113,0.9927899,0.0005774933,0.0005944866,0.0006690798,0.000009157163,0.0002930463,0.004200187],"genre_scores_gemma":[0.7578675,0.000027767246,0.23862983,0.0019894063,0.00030967477,0.000029300081,0.000015236972,0.00012399135,0.0010072844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933336,0.00013079269,0.000539893,0.0026659437,0.00204177,0.0012880513],"domain_scores_gemma":[0.99485755,0.00150947,0.00034967702,0.002446021,0.00043587695,0.00040139694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009539568,0.0009054578,0.0007594568,0.0015006143,0.00050026976,0.00074935466,0.004819961,0.00034964125,0.000012870225],"category_scores_gemma":[0.00010209296,0.0007112888,0.00019118254,0.001205893,0.0019764174,0.0005618804,0.0012094568,0.0014703169,0.00007871276],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008260743,0.00011453084,0.00011679529,0.000027411705,0.000038287017,0.00036577278,0.00081394374,0.057165254,0.00033931053,0.15843931,0.000005469844,0.7824913],"study_design_scores_gemma":[0.00071857177,0.003603169,0.0004650163,0.0016265521,0.00002115992,0.00026239507,3.9056397e-7,0.5290819,0.0037224535,0.4566643,0.0018156853,0.0020184068],"about_ca_topic_score_codex":0.000008762898,"about_ca_topic_score_gemma":0.00021308787,"teacher_disagreement_score":0.78047293,"about_ca_system_score_codex":0.0004143594,"about_ca_system_score_gemma":0.00042385157,"threshold_uncertainty_score":0.99953383},"labels":[],"label_agreement":null},{"id":"W2219611942","doi":"10.1016/j.tcs.2015.12.012","title":"A probabilistic version of the game of Zombies and Survivors on graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Zombie; Vertex (graph theory); Mathematics; Discrete mathematics; Probabilistic logic; Graph; Computer science; Statistics; Computer security","score_opus":0.019414974779184177,"score_gpt":0.27299347884894193,"score_spread":0.25357850406975774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219611942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75707,0.000029352423,0.24050084,0.00044154955,0.0002941443,0.00023554376,0.0000020961509,0.000037167723,0.0013893364],"genre_scores_gemma":[0.9874851,0.0000024843525,0.012431998,0.000060390972,0.000008161787,0.0000025244078,7.0426005e-8,0.000003884973,0.000005349149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978021,0.00024198,0.00021611746,0.00042203531,0.0010026534,0.00031511983],"domain_scores_gemma":[0.9979534,0.0005266127,0.00008925202,0.0008973646,0.00034006737,0.00019331659],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002082299,0.00011508809,0.00018879134,0.00018675391,0.00011363436,0.000056082165,0.0022699372,0.00003083816,0.0000030045094],"category_scores_gemma":[0.0004904975,0.00007095849,0.00005124858,0.0015980158,0.008025337,0.0002865434,0.0015270163,0.00015272487,0.000004314805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002935754,0.00005196729,0.00032513434,0.000013409273,0.0000019540073,9.679871e-7,0.0006461437,0.0003636482,0.0005005088,0.9941398,0.0000066945945,0.0039204527],"study_design_scores_gemma":[0.00024471091,0.0005258246,0.002805357,0.000053894273,0.000002303692,0.000009046909,0.000019066472,0.095613904,0.010008991,0.8906148,0.00001271168,0.00008938083],"about_ca_topic_score_codex":0.0000060065954,"about_ca_topic_score_gemma":9.900964e-7,"teacher_disagreement_score":0.23041517,"about_ca_system_score_codex":0.000026259831,"about_ca_system_score_gemma":0.00013412574,"threshold_uncertainty_score":0.99467427},"labels":[],"label_agreement":null},{"id":"W2221458177","doi":"10.48550/arxiv.1508.07357","title":"Compressed Cliques Graphs, Clique Coverings and Positive Zero Forcing","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Clique problem; Mathematics; Combinatorics; Clique graph; Uniqueness; Clique; Vertex (graph theory); Discrete mathematics; Forcing (mathematics); Split graph; Clique-sum; Block graph; Popularity; Graph; Context (archaeology); Zero (linguistics); Chordal graph; Line graph; 1-planar graph; Graph power; Geography; Mathematical analysis","score_opus":0.07409651300647802,"score_gpt":0.2296481115847455,"score_spread":0.15555159857826747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221458177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31066778,0.00020982738,0.6858891,0.00007911322,0.00019991703,0.00043506728,0.00003981561,0.0003054767,0.0021738461],"genre_scores_gemma":[0.9947597,0.00043632695,0.004052901,0.00013317888,0.000025899026,0.0000020232853,0.000020023039,0.000030295692,0.0005396805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972491,0.0003634482,0.0002260243,0.0014281913,0.0001721031,0.00056113314],"domain_scores_gemma":[0.9973369,0.00031454078,0.000252766,0.0012321491,0.0004695346,0.00039410748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006160528,0.00041574778,0.00048640737,0.0004804588,0.00022635743,0.00023273897,0.0019265845,0.00032726343,0.000004542872],"category_scores_gemma":[0.00007716882,0.00048484065,0.0001727779,0.000624068,0.0003912386,0.0008590533,0.0046760263,0.00097618764,0.000016348431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016215416,0.000072261086,0.0025600404,0.00010196634,0.0001386102,0.0005199809,0.00065032725,0.040519193,0.00029029572,0.9539779,0.00033109574,0.00067621924],"study_design_scores_gemma":[0.00063184096,0.00014732254,0.0009350203,0.0001829215,0.00003151079,0.000014457923,0.00005233752,0.15724073,0.0011695472,0.838798,0.00021975486,0.0005765562],"about_ca_topic_score_codex":0.00023072369,"about_ca_topic_score_gemma":0.000024644776,"teacher_disagreement_score":0.68409187,"about_ca_system_score_codex":0.00022321803,"about_ca_system_score_gemma":0.00023309764,"threshold_uncertainty_score":0.9997603},"labels":[],"label_agreement":null},{"id":"W2227332211","doi":"10.3138/infor.52.4.185","title":"Valid Inequalities and Separation Algorithms for the Set Partitioning Problem","year":2014,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Set (abstract data type); Clique; Rank (graph theory); Mathematical optimization; Computer science; Inequality; Algorithm; Mathematics; Combinatorics; Programming language","score_opus":0.13056474742184537,"score_gpt":0.4183798404732468,"score_spread":0.2878150930514014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227332211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035328895,0.0001755866,0.9901575,0.0017783978,0.00012010076,0.0013147794,0.00003698364,0.000047410125,0.0028363683],"genre_scores_gemma":[0.9863105,0.00008649373,0.010833994,0.0003074547,0.00019000865,0.0013289648,0.00010227555,0.0000068227746,0.00083350635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981558,0.00020782556,0.00042002462,0.00014054921,0.00078440784,0.0002913923],"domain_scores_gemma":[0.9969119,0.001590831,0.00007668592,0.000229527,0.0011006794,0.000090371235],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0059760595,0.00009193431,0.00011089475,0.00023397632,0.0012274684,0.0019304561,0.00028890517,0.00005691081,0.000003469493],"category_scores_gemma":[0.0005331028,0.00006347687,0.00002126152,0.0003122865,0.00015608377,0.0039647245,0.00017828621,0.00017170215,0.000022914566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013500613,0.0000026942412,0.00013511856,0.00008691978,0.000010170479,4.1720057e-8,0.0025792497,0.003648605,0.000019357967,0.97882557,0.0010405666,0.013638218],"study_design_scores_gemma":[0.00044822835,0.00016192818,0.0004834011,0.00003683373,0.0000013658606,0.0000183083,0.0014238688,0.7816864,0.00012388319,0.014414442,0.20109096,0.000110355504],"about_ca_topic_score_codex":0.00008611346,"about_ca_topic_score_gemma":0.0000085476195,"teacher_disagreement_score":0.9827776,"about_ca_system_score_codex":0.00003680199,"about_ca_system_score_gemma":0.00012000918,"threshold_uncertainty_score":0.99910563},"labels":[],"label_agreement":null},{"id":"W2234017799","doi":"10.1142/s0129054118500053","title":"Arbitrary Overlap Constraints in Graph Packing Problems","year":2018,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Graph; Function (biology); Discrete mathematics; Vertex (graph theory)","score_opus":0.03772099834689924,"score_gpt":0.352113442025102,"score_spread":0.31439244367820274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234017799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08723027,0.0001026769,0.9059225,0.00091905275,0.004811277,0.0002113957,0.000011464584,0.000023535842,0.00076784065],"genre_scores_gemma":[0.7199014,0.00006725442,0.2796281,0.00009361222,0.00028843505,0.0000044943927,0.000002706865,0.000008224988,0.0000058007795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951488,0.0001524175,0.0012848893,0.0005780556,0.0024480785,0.00038775694],"domain_scores_gemma":[0.9932474,0.00035204136,0.0014946556,0.00075393345,0.003979479,0.00017251533],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0031639563,0.00024372104,0.00042217853,0.0031965955,0.00011693176,0.0007422168,0.009024988,0.00010485738,0.000025346224],"category_scores_gemma":[0.0003300962,0.00023477517,0.00024945673,0.0013499501,0.002307264,0.0024539707,0.0029947772,0.00085848244,0.000008441695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117062904,0.0013814657,0.020238748,0.00017173094,0.0005298219,0.00039450973,0.005316678,0.08054822,0.0058793165,0.5765149,0.00037387188,0.30853364],"study_design_scores_gemma":[0.0010510633,0.00035141603,0.01865901,0.0018805801,0.000010591897,0.0005299178,0.000035827077,0.104161456,0.0034812225,0.8690251,0.0003425613,0.0004712186],"about_ca_topic_score_codex":0.00001476307,"about_ca_topic_score_gemma":0.000008104966,"teacher_disagreement_score":0.6326711,"about_ca_system_score_codex":0.0003143722,"about_ca_system_score_gemma":0.0022690324,"threshold_uncertainty_score":0.99633664},"labels":[],"label_agreement":null},{"id":"W2234839101","doi":"10.1016/j.disc.2015.12.015","title":"Bicircular matroids are 3-colorable","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Matroid partitioning; Conjecture; Minor (academic); Discrete mathematics; Oriented matroid; Graph; Weighted matroid","score_opus":0.022580380518233262,"score_gpt":0.2829587157284189,"score_spread":0.26037833521018566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234839101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019215152,0.00009285132,0.9739293,0.001391933,0.00009250554,0.00021513946,0.000007948187,0.00026561,0.0047895596],"genre_scores_gemma":[0.7709589,0.00004139623,0.22462904,0.00016126441,0.000060493177,0.00007258891,0.0000010506907,0.00004861258,0.0040266383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998424,0.000061019116,0.00025913198,0.00033744422,0.0004507242,0.00046766343],"domain_scores_gemma":[0.9982197,0.00026177228,0.00013150043,0.0011509048,0.0000967663,0.00013932901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047042218,0.00016625524,0.00022756866,0.00012866074,0.0001256065,0.00011469878,0.0012531392,0.000057527013,0.00006957652],"category_scores_gemma":[0.00022884797,0.00010137542,0.00010352045,0.0004127029,0.00012623622,0.00052771415,0.00038767394,0.00009296843,0.0006875599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002792649,0.00005838576,0.00035410884,0.00007066574,0.000025009464,0.00003629841,0.00037750078,0.000011527286,0.011375279,0.9836055,0.000507092,0.0035758058],"study_design_scores_gemma":[0.00044692607,0.000070309005,0.00024662903,0.00018732977,0.0000073313804,0.0000375494,0.00017651991,0.0064434567,0.015245175,0.973732,0.0030986534,0.00030811175],"about_ca_topic_score_codex":8.582179e-7,"about_ca_topic_score_gemma":0.0000010682113,"teacher_disagreement_score":0.75174373,"about_ca_system_score_codex":0.000052639152,"about_ca_system_score_gemma":0.0000313598,"threshold_uncertainty_score":0.88374203},"labels":[],"label_agreement":null},{"id":"W223802390","doi":"10.1016/j.jctb.2015.12.006","title":"Three-edge-colouring doublecross cubic graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Cubic graph; Planar graph; Mathematics; Graph minor; Petersen graph; Vertex (graph theory); Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.016231280750028027,"score_gpt":0.27468993591215546,"score_spread":0.2584586551621274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W223802390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4008601,0.00094271457,0.57265186,0.002129553,0.01971948,0.0003572555,0.0000044540243,0.00019521578,0.003139392],"genre_scores_gemma":[0.99415827,0.00012466297,0.0046446538,0.000051548035,0.00059199263,0.0000070709384,1.08106214e-7,0.00003047481,0.00039122681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973113,0.00034358428,0.0006617672,0.00028911713,0.0008031806,0.0005910786],"domain_scores_gemma":[0.9968657,0.0009021425,0.0005415634,0.0007318776,0.00065981055,0.0002989038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031107296,0.00024701038,0.00045242772,0.0003855547,0.0002981878,0.0002244493,0.0023708865,0.000120959805,0.0000736813],"category_scores_gemma":[0.000596916,0.00015931603,0.00029608564,0.0007112115,0.0004718978,0.0028579768,0.00048588254,0.0004069382,0.00003494282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009690059,0.0000855897,0.00047716757,0.000009349487,0.00007528674,0.00010786306,0.00019585673,0.0000063640623,0.008273088,0.97483426,0.00024443716,0.0147217205],"study_design_scores_gemma":[0.0022159598,0.00081603596,0.00029048964,0.00009624801,0.000009453699,0.00025016774,0.00004597764,0.0000054439624,0.030103846,0.95986295,0.0060832696,0.00022018357],"about_ca_topic_score_codex":9.435565e-7,"about_ca_topic_score_gemma":0.0000013202794,"teacher_disagreement_score":0.59329814,"about_ca_system_score_codex":0.00012561545,"about_ca_system_score_gemma":0.00023093443,"threshold_uncertainty_score":0.64967185},"labels":[],"label_agreement":null},{"id":"W2238259313","doi":"10.1137/15m1007185","title":"Lehman's Theorem and the Directed Steiner Tree Problem","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Combinatorics; Discrete mathematics; Tree (set theory); Mathematical economics","score_opus":0.015248312301763711,"score_gpt":0.2699891274693736,"score_spread":0.2547408151676099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238259313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019738045,0.00047687764,0.9272359,0.017323444,0.0002129739,0.00071249687,0.0000060669236,0.00026679502,0.034027394],"genre_scores_gemma":[0.8509816,0.0005967609,0.1404695,0.0003881459,0.00021808573,0.000046665944,3.656172e-7,0.000069542,0.007229353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978983,0.00035359713,0.00041353045,0.00025162785,0.00065407594,0.00042891476],"domain_scores_gemma":[0.9973164,0.0014009977,0.00026978945,0.0006917842,0.00013519594,0.0001857898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019651977,0.00021614175,0.00030159732,0.00014564379,0.00032817118,0.00031911474,0.0011952624,0.00005077083,0.000033390817],"category_scores_gemma":[0.00041361776,0.00008457346,0.00013236851,0.00031011287,0.0004746686,0.0004670719,0.00032027368,0.0003383568,0.000051800547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067738314,0.000039429797,0.00001929799,0.00001928741,0.000046444715,0.000024228832,0.0009515594,0.0000050682033,0.0006090292,0.9662477,0.00029632665,0.03167389],"study_design_scores_gemma":[0.0019478647,0.00017841572,0.00008229809,0.0002727593,0.000012267707,0.00030723723,0.00011155504,0.00416357,0.00092529546,0.9904644,0.0013483594,0.00018596063],"about_ca_topic_score_codex":3.8174036e-7,"about_ca_topic_score_gemma":0.0000017947134,"teacher_disagreement_score":0.8312435,"about_ca_system_score_codex":0.00004227117,"about_ca_system_score_gemma":0.000041690673,"threshold_uncertainty_score":0.34488058},"labels":[],"label_agreement":null},{"id":"W22396107","doi":"10.1002/pca.2358","title":"Stability Number and f-factor in K 1, n -free Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Factor (programming language); Stability (learning theory); Computer science","score_opus":0.027836573303789525,"score_gpt":0.2782295072133435,"score_spread":0.25039293390955397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22396107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99621487,0.00023916073,0.0004716778,0.0004186904,0.00054557354,0.00017269843,0.0000030813467,0.00009895833,0.0018352987],"genre_scores_gemma":[0.9969077,0.000088678404,0.0028086486,0.00005409529,0.000001980178,0.000017464039,4.6186648e-7,0.000009271485,0.00011166731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853045,0.00016774097,0.00018264388,0.00041773933,0.000317874,0.0003835261],"domain_scores_gemma":[0.9985254,0.00024813885,0.000035535497,0.000974378,0.000073506206,0.00014308126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034817247,0.0001260497,0.00017266875,0.0000986527,0.00011352328,0.0000344816,0.00088037946,0.000065823086,0.00004661246],"category_scores_gemma":[0.00020697735,0.00012741178,0.000038674345,0.00073907623,0.00025877135,0.0006772458,0.0005521731,0.00026167603,0.00003247997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000818702,0.000093239774,0.16826417,0.0000079031315,0.0000038141586,0.000051557276,0.00050443853,3.5575871e-7,0.00013948424,0.8295517,0.00031214283,0.0010629982],"study_design_scores_gemma":[0.00077154225,0.000039941522,0.093639955,0.0000065033914,4.2439086e-7,0.000033066957,0.000011657123,0.00015599071,0.0012845012,0.9035595,0.00036270864,0.00013421824],"about_ca_topic_score_codex":0.00004168812,"about_ca_topic_score_gemma":0.000013333335,"teacher_disagreement_score":0.07462421,"about_ca_system_score_codex":0.000048559934,"about_ca_system_score_gemma":0.00005474736,"threshold_uncertainty_score":0.5195702},"labels":[],"label_agreement":null},{"id":"W2243190840","doi":"10.5555/2722129.2722244","title":"Four terminal planar Delta-Wye reducibility via rooted K2,4 minors","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Graph; Discrete mathematics; Terminal (telecommunication); Mathematical proof; Computer science; Geometry; Telecommunications","score_opus":0.03958629530490731,"score_gpt":0.30459664743458625,"score_spread":0.26501035212967894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243190840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13586791,0.00036758572,0.83462256,0.0074983677,0.0024779786,0.0016859474,0.00015251561,0.0012081738,0.016118953],"genre_scores_gemma":[0.8962444,0.000026700593,0.099186696,0.0005550157,0.0005464601,0.00015392296,0.00006706596,0.0000958337,0.0031239248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953057,0.0004616412,0.0005121356,0.001428387,0.0012460791,0.0010460591],"domain_scores_gemma":[0.99622947,0.00020721382,0.00017419115,0.0022990769,0.00029181904,0.00079823076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001488615,0.00044903965,0.00043270033,0.00033305612,0.0002528131,0.00022462964,0.002261284,0.00018039349,0.000020600444],"category_scores_gemma":[0.00017222292,0.00039046668,0.00020236956,0.0009497541,0.00031495473,0.00087788986,0.00048423448,0.00054964103,0.00033289404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003519899,0.0031449113,0.010490556,0.0004247807,0.0010074475,0.0072255516,0.014553992,0.0089941835,0.07047115,0.1317451,0.032118708,0.7163037],"study_design_scores_gemma":[0.008904023,0.007856113,0.009465993,0.000335357,0.00012705747,0.0016160768,0.00075315643,0.4766793,0.09753144,0.36614314,0.025467776,0.005120583],"about_ca_topic_score_codex":0.00014595837,"about_ca_topic_score_gemma":0.000023857134,"teacher_disagreement_score":0.76037645,"about_ca_system_score_codex":0.00026254012,"about_ca_system_score_gemma":0.00024347029,"threshold_uncertainty_score":0.99985474},"labels":[],"label_agreement":null},{"id":"W2245804724","doi":"10.4171/022-3/41","title":"Towards a structure theory for matrices and matroids","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Mathematics; Combinatorics; Computer science","score_opus":0.013644972787517364,"score_gpt":0.2877710016790721,"score_spread":0.27412602889155474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245804724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8131548,0.0008860253,0.16158472,0.0021915836,0.0017571409,0.0020108796,0.00043421646,0.00019957137,0.017781015],"genre_scores_gemma":[0.9319015,0.000032777374,0.065621406,0.00012981343,0.00015851563,0.000036183137,0.0000024044002,0.000042280964,0.002075129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976619,0.000013407889,0.0006499826,0.00038167727,0.00091624697,0.00037676768],"domain_scores_gemma":[0.9973635,0.0004892674,0.0007347856,0.0002730052,0.0010575341,0.000081917045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016337794,0.00024556814,0.0003712945,0.0003393903,0.00012038622,0.0001522218,0.0028016118,0.000108422704,0.00015123442],"category_scores_gemma":[0.0007627377,0.00017977065,0.00016978155,0.00033349803,0.0003651827,0.0006102467,0.0007452717,0.00020647253,0.0000033576105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012243552,0.000105687046,0.00091270957,0.0006177053,0.00015586727,0.0000012815609,0.00062253245,0.000015739415,0.0143110305,0.9744053,0.0039913743,0.0047383737],"study_design_scores_gemma":[0.00075780606,0.00011997879,0.0010221661,0.00040920943,0.00004444699,0.000053769345,0.0005512102,0.0028061774,0.14955518,0.8429449,0.0014688063,0.00026635654],"about_ca_topic_score_codex":0.000009450025,"about_ca_topic_score_gemma":0.000003867979,"teacher_disagreement_score":0.13524415,"about_ca_system_score_codex":0.0000608556,"about_ca_system_score_gemma":0.000055020508,"threshold_uncertainty_score":0.7330834},"labels":[],"label_agreement":null},{"id":"W2248358623","doi":"10.4230/lipics.csl.2011.381","title":"A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Complexity class; Bipartite graph; Mathematical proof; Lexicographical order; Mathematics; Class (philosophy); Discrete mathematics; Completeness (order theory); Matching (statistics); Computational complexity theory; Computer science; Combinatorics; Time complexity; Theoretical computer science; Graph; Algorithm; Artificial intelligence","score_opus":0.055634707499851235,"score_gpt":0.2694607798329779,"score_spread":0.21382607233312667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248358623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011367149,0.00005410275,0.97222793,0.0007825268,0.0002632881,0.0045595123,0.00054465025,0.0002986261,0.009902207],"genre_scores_gemma":[0.9263945,0.000018812498,0.06724868,0.002232999,0.000111490655,0.0019684674,0.00019749533,0.000103464015,0.0017240609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962934,0.00020146942,0.0008014743,0.000357952,0.0007654167,0.0015802896],"domain_scores_gemma":[0.9954907,0.0015097087,0.0005991617,0.0015480634,0.000652467,0.00019994719],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0042499504,0.00046714256,0.0004434843,0.0001680292,0.0017593986,0.0005375602,0.0037076485,0.00016820671,0.000044786848],"category_scores_gemma":[0.00024186794,0.00024872003,0.00029994972,0.0006818133,0.0009661695,0.0029529578,0.0009710993,0.00068578427,0.000037158847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078808,0.00030348147,0.0006081928,0.00018584185,0.00050084543,0.0000028300267,0.01648487,0.000116047355,0.00001566626,0.96966934,0.003037399,0.008287432],"study_design_scores_gemma":[0.01297305,0.0029036216,0.004386617,0.00034260482,0.00025192468,0.00012189865,0.011764155,0.28035846,0.0022465682,0.57646054,0.10622758,0.001962958],"about_ca_topic_score_codex":0.00001447689,"about_ca_topic_score_gemma":0.000104309926,"teacher_disagreement_score":0.9150274,"about_ca_system_score_codex":0.00015315489,"about_ca_system_score_gemma":0.0001671966,"threshold_uncertainty_score":0.9999965},"labels":[],"label_agreement":null},{"id":"W2248416884","doi":"10.1002/jgt.22133","title":"On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Corollary; Combinatorics; Klein bottle; Graph; Odd graph; Girth (graph theory); Torus; Discrete mathematics; Chordal graph; 1-planar graph","score_opus":0.025654141477502362,"score_gpt":0.31703868666031704,"score_spread":0.29138454518281465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248416884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9278846,0.00037078638,0.0654106,0.0021409013,0.0007559369,0.00016213498,0.00000952527,0.000012136842,0.0032534192],"genre_scores_gemma":[0.9973065,0.00006287679,0.002357189,0.00012531118,0.00004648834,0.000001421362,7.364333e-8,0.000010616692,0.00008949649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973747,0.0007011274,0.00058184605,0.00020657614,0.0008180385,0.00031766878],"domain_scores_gemma":[0.99330693,0.0033828164,0.0008871331,0.0014818012,0.0007866158,0.00015470297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00435123,0.00016410847,0.00044099664,0.00042233217,0.0003796616,0.00007324666,0.0033856272,0.00007979013,0.00003294341],"category_scores_gemma":[0.0035427392,0.000102277,0.0004772105,0.00028903477,0.0020287335,0.0005481229,0.0004062202,0.0005883419,0.0000048788156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003592607,0.00020896528,0.00067525735,0.000028710498,0.00008128035,0.000048185357,0.00059405534,0.000014226462,0.0040879203,0.990495,0.00032359938,0.0030835217],"study_design_scores_gemma":[0.00040601188,0.0006552364,0.008228742,0.00013375531,0.0000207088,0.000061804254,0.0002091455,0.00008914155,0.022486042,0.96758366,0.000026846092,0.00009890671],"about_ca_topic_score_codex":0.0000029812393,"about_ca_topic_score_gemma":0.000001798624,"teacher_disagreement_score":0.06942197,"about_ca_system_score_codex":0.000015141027,"about_ca_system_score_gemma":0.000107336185,"threshold_uncertainty_score":0.74749535},"labels":[],"label_agreement":null},{"id":"W2249548238","doi":"10.1002/jgt.22258","title":"On the structure of (banner, odd hole)‐free graphs","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Perfect graph; Chordal graph; Induced subgraph; Split graph; Perfect graph theorem; Vertex (graph theory); Discrete mathematics; Wheel graph; Graph; Graph power; 1-planar graph; Line graph; Pathwidth","score_opus":0.02039802155274871,"score_gpt":0.286452243771761,"score_spread":0.26605422221901226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249548238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7467739,0.0046950225,0.23539193,0.0023706444,0.0051927348,0.000984367,0.00022747635,0.00011073864,0.0042531723],"genre_scores_gemma":[0.99135286,0.00036969868,0.007363501,0.00044654368,0.00029614978,0.0000034304005,0.0000019207705,0.000049696788,0.00011619171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944593,0.0016843263,0.0010873175,0.00054355065,0.0016707067,0.0005548556],"domain_scores_gemma":[0.9910031,0.0021657886,0.0020765993,0.0033398585,0.0011814318,0.00023321676],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004377982,0.00050423143,0.00084382034,0.0014368935,0.00023777646,0.00017638884,0.00995927,0.00038648566,0.00015159149],"category_scores_gemma":[0.0013669694,0.00030359035,0.0010437204,0.0010521301,0.0013211765,0.000337972,0.0025094682,0.0028969762,0.000007238132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003874053,0.00010761059,0.000053024123,0.00007327412,0.00038625533,0.00004960358,0.000554456,0.0006339315,0.0024890383,0.98775554,0.0047234395,0.00278645],"study_design_scores_gemma":[0.00048069004,0.000613389,0.00041307218,0.00046934793,0.00004772494,0.00008487233,0.00010359799,0.00012301146,0.012030692,0.9851104,0.0002388179,0.0002843783],"about_ca_topic_score_codex":0.0000030577928,"about_ca_topic_score_gemma":0.0000036651402,"teacher_disagreement_score":0.24457894,"about_ca_system_score_codex":0.000059890197,"about_ca_system_score_gemma":0.00033937546,"threshold_uncertainty_score":0.99994165},"labels":[],"label_agreement":null},{"id":"W2253259020","doi":"10.46298/dmtcs.3465","title":"Cycles intersecting edge-cuts of prescribed sizes","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Cubic graph; Planar graph; Graph; Disjoint sets; Disjoint union (topology); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01957421339543206,"score_gpt":0.3028969954445915,"score_spread":0.2833227820491594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253259020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062249627,0.00004071356,0.92889154,0.00063110364,0.0002212869,0.00030075494,0.0000032670891,0.0002091275,0.007452575],"genre_scores_gemma":[0.5733049,0.0000032131065,0.42651346,0.000072465,0.000068746784,0.000008290708,3.601714e-7,0.000012645447,0.000015925949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611515,0.00015218665,0.0006942771,0.0008367289,0.0013078297,0.00089381257],"domain_scores_gemma":[0.99648046,0.0010187861,0.00023586351,0.001537691,0.000384051,0.0003431611],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002518711,0.0003065361,0.00044955412,0.00039289866,0.00037909893,0.00039168826,0.004630398,0.00006910508,0.00006142529],"category_scores_gemma":[0.0005833428,0.00024329404,0.00017437505,0.0015026844,0.004103161,0.0013037284,0.00256926,0.0003394618,0.00006475519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008582892,0.00011835699,0.000032372664,0.000051138835,0.000011868355,0.0000045869147,0.0033657087,0.000292377,0.0052769617,0.9739176,0.000022249606,0.01689817],"study_design_scores_gemma":[0.00019891135,0.00014269569,0.000074451644,0.0001219901,0.000006143017,0.000032515243,0.00011181688,0.5514235,0.032184582,0.41542396,0.000035354595,0.00024406602],"about_ca_topic_score_codex":0.0000012625433,"about_ca_topic_score_gemma":0.0000010263917,"teacher_disagreement_score":0.5584937,"about_ca_system_score_codex":0.00006490562,"about_ca_system_score_gemma":0.00011884502,"threshold_uncertainty_score":0.9986071},"labels":[],"label_agreement":null},{"id":"W2253740506","doi":"","title":"A Simple Algorithm for the Graph Minor Decomposition -- Logic meets Structural Graph Theory","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Graph minor; Tree decomposition; Discrete mathematics; Mathematical proof; Graph property; Clique-width; Minor (academic); Mathematics; Robertson–Seymour theorem; Graph theory; Treewidth; Tree-depth; Algorithm; Computer science; Line graph; Voltage graph; Combinatorics; Graph; Pathwidth","score_opus":0.020353797656034338,"score_gpt":0.3154488165771951,"score_spread":0.29509501892116075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253740506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068787094,0.000299788,0.9895671,0.0011790509,0.0002179436,0.0011532425,0.000009534885,0.0002115928,0.00048303255],"genre_scores_gemma":[0.5748487,0.000024649842,0.422452,0.0013342953,0.000106226405,0.00060247537,0.000014294006,0.00002501186,0.00059230824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816245,0.0002032789,0.0002325178,0.000476845,0.00033062356,0.00059428136],"domain_scores_gemma":[0.9974175,0.0013224893,0.00007705935,0.00080564007,0.00024125242,0.00013603547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005798074,0.00020599915,0.00016931671,0.00018682437,0.0005558438,0.00029315538,0.0015816364,0.00006542412,0.00022962372],"category_scores_gemma":[0.000048516693,0.00012085457,0.00020055141,0.000597741,0.00024013751,0.00082597474,0.00030653636,0.00016227955,0.000062875384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010445868,0.000019074347,0.00006720263,0.00000583275,0.00004359308,0.0000018205122,0.00012711577,0.00012936081,0.0012389385,0.6885569,0.0009882558,0.30881146],"study_design_scores_gemma":[0.00034077524,0.00012977041,0.0021763067,0.0000027675126,0.0000057533175,0.000020632495,0.00010356934,0.10714113,0.0023334145,0.8872941,0.00027200644,0.00017976332],"about_ca_topic_score_codex":0.000051110896,"about_ca_topic_score_gemma":0.000014869822,"teacher_disagreement_score":0.56797004,"about_ca_system_score_codex":0.00002457404,"about_ca_system_score_gemma":0.00002498594,"threshold_uncertainty_score":0.49283066},"labels":[],"label_agreement":null},{"id":"W2253883587","doi":"10.1016/j.ejc.2017.06.026","title":"On the minimum number of edges in triangle-free 5-critical graphs","year":2017,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Corollary; Disjoint sets; Graph; Vertex (graph theory); Discrete mathematics; Clique number; Cograph; Chordal graph; 1-planar graph","score_opus":0.05218795407067771,"score_gpt":0.32938781679283025,"score_spread":0.2771998627221525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253883587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55603737,0.004970534,0.19604662,0.02580885,0.021994824,0.0013837154,0.00005571855,0.00012945558,0.1935729],"genre_scores_gemma":[0.99738264,0.00024682647,0.0019495471,0.00007336257,0.00009932537,0.000002039826,3.8369512e-7,0.000041231568,0.00020464548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943685,0.0026418515,0.0010315189,0.00035885206,0.0011869544,0.00041235864],"domain_scores_gemma":[0.99277383,0.002502007,0.001132852,0.0026218228,0.00077094854,0.00019856278],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0070771445,0.00030368887,0.0006874885,0.00046838107,0.00015413298,0.00026992522,0.009526964,0.00008855623,0.000018413948],"category_scores_gemma":[0.0077521848,0.0002160849,0.00043781317,0.00038715434,0.00047093668,0.0002814865,0.0031320904,0.002472446,0.000030032814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100880796,0.00033571085,0.0005113235,0.00006806227,0.000049252434,0.0009369981,0.00037573595,0.000058345915,0.000023463193,0.9905697,0.0034644369,0.0035061014],"study_design_scores_gemma":[0.0012371127,0.00037152207,0.0019061975,0.0006755664,0.000014346531,0.000093192604,0.000031890657,0.00016421043,0.00033028488,0.9939702,0.0009906094,0.00021483906],"about_ca_topic_score_codex":0.0000010652869,"about_ca_topic_score_gemma":3.3740585e-7,"teacher_disagreement_score":0.44134524,"about_ca_system_score_codex":0.00008089937,"about_ca_system_score_gemma":0.0002632134,"threshold_uncertainty_score":0.9998289},"labels":[],"label_agreement":null},{"id":"W2254274951","doi":"10.1016/j.jctb.2016.05.010","title":"A new proof of Seymour's 6-flow theorem","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Conjecture; Mathematics; Flow (mathematics); Graph; Robertson–Seymour theorem; Combinatorics; Discrete mathematics; Perspective (graphical); Line graph; Pathwidth; Geometry","score_opus":0.015234688365248295,"score_gpt":0.28032227102838037,"score_spread":0.2650875826631321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254274951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033730373,0.0017991378,0.96787715,0.0014778691,0.01904223,0.00058754254,0.00002610388,0.00007664706,0.0057402644],"genre_scores_gemma":[0.8449177,0.0004938034,0.14355978,0.000108578795,0.0059676804,0.000027686541,0.0000038659673,0.0001902827,0.0047305874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459046,0.0013669578,0.0014413624,0.0004979122,0.001512535,0.0005907834],"domain_scores_gemma":[0.9929536,0.0010757454,0.0023877863,0.0016522955,0.0014869532,0.00044359494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004844645,0.00051862677,0.0013000034,0.0006388611,0.00011798189,0.00020356887,0.005144533,0.00044417198,0.00015341412],"category_scores_gemma":[0.0012421018,0.00037173126,0.00073590653,0.00049045356,0.0004824182,0.0012968103,0.0026973437,0.0014667514,0.0000070077936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018974307,0.00013632412,0.000019942629,0.00011588266,0.00030313848,0.00008859061,0.0008183278,0.00018853882,0.00076387974,0.9518642,0.00088883104,0.042914946],"study_design_scores_gemma":[0.0016409133,0.0010506217,0.000014607215,0.00065514515,0.000042098996,0.00016480846,0.000058277543,0.000038906608,0.036507435,0.95434564,0.005120792,0.0003607229],"about_ca_topic_score_codex":0.0000016604771,"about_ca_topic_score_gemma":3.5801366e-7,"teacher_disagreement_score":0.8415447,"about_ca_system_score_codex":0.00019243185,"about_ca_system_score_gemma":0.0020131192,"threshold_uncertainty_score":0.99987346},"labels":[],"label_agreement":null},{"id":"W2256982406","doi":"10.1016/j.ejc.2016.09.001","title":"Colourings, homomorphisms, and partitions of transitive digraphs","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive relation; Combinatorics; Mathematics; Homomorphism; Class (philosophy); Transitive reduction; Discrete mathematics; Graph; Computer science; Line graph; Voltage graph; Artificial intelligence","score_opus":0.013774946470163807,"score_gpt":0.2306429583358,"score_spread":0.2168680118656362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256982406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33153114,0.00073542446,0.6617736,0.0014055623,0.00034613733,0.00009271343,0.0000081121325,0.000027813241,0.0040794406],"genre_scores_gemma":[0.99742705,0.00034197659,0.0020871067,0.000026642841,0.00001868054,3.7117098e-7,7.0359675e-8,0.000011179799,0.00008691732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985578,0.00044667505,0.00036340256,0.00012280181,0.00032663258,0.00018270164],"domain_scores_gemma":[0.9986246,0.00028946853,0.00028811579,0.00023221296,0.0003999558,0.0001656353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011322191,0.000091670125,0.00019130736,0.00022597065,0.000076072516,0.000029267761,0.0005988217,0.000013253497,0.0000058938163],"category_scores_gemma":[0.00014036035,0.000063318745,0.000082281476,0.00039174256,0.00022377973,0.00047103426,0.00010973856,0.00015259595,0.00000550147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004641573,0.00017161491,0.001449161,0.000015096307,0.000052573967,0.0003820365,0.0005763902,0.000006106147,0.008305098,0.97461206,0.00036874408,0.014014714],"study_design_scores_gemma":[0.004649979,0.003142389,0.04509341,0.00045089945,0.000038427374,0.0006844368,0.00013613966,0.0000550854,0.027261518,0.9088186,0.009281913,0.00038721453],"about_ca_topic_score_codex":1.2642046e-7,"about_ca_topic_score_gemma":8.113594e-8,"teacher_disagreement_score":0.6658959,"about_ca_system_score_codex":0.00002008753,"about_ca_system_score_gemma":0.000043956257,"threshold_uncertainty_score":0.25820634},"labels":[],"label_agreement":null},{"id":"W2257188417","doi":"10.1145/2786015","title":"Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Packing problems; Mathematics; Set packing; Vertex (graph theory); Graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.1535964510606377,"score_gpt":0.36552434887023943,"score_spread":0.21192789780960172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257188417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008839373,0.0000843204,0.9884882,0.0004653172,0.00063483394,0.00089903414,0.000025232348,0.0003506345,0.0002130766],"genre_scores_gemma":[0.78154683,0.0000073691413,0.21805114,0.00015259294,0.000046187626,0.00010008156,0.0000099642975,0.000029755653,0.00005606589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976988,0.0003545051,0.0004612862,0.00048103358,0.0005160232,0.00048834283],"domain_scores_gemma":[0.99728334,0.0014682254,0.00012921711,0.00055478624,0.00032380308,0.0002406457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015286228,0.00024307377,0.00025312504,0.00081136107,0.0004938027,0.000253913,0.0009067212,0.00010976495,0.000009182965],"category_scores_gemma":[0.00023182543,0.0002516461,0.0002226471,0.001434673,0.000099688856,0.0015499224,0.000020733913,0.00030834775,0.000029857621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013339114,0.0001719032,0.0000068443505,0.000041099516,0.00008332029,0.00000213106,0.0036470632,0.7575537,0.00043365706,0.03556337,0.00003276054,0.20233074],"study_design_scores_gemma":[0.0016866961,0.00030090983,0.000027898663,0.00005223946,0.00003440508,0.00002892288,0.0005122857,0.47852266,0.0029400813,0.5150125,0.0005228475,0.00035855925],"about_ca_topic_score_codex":0.0000106049,"about_ca_topic_score_gemma":0.0000025758904,"teacher_disagreement_score":0.77270746,"about_ca_system_score_codex":0.00025637713,"about_ca_system_score_gemma":0.00023904975,"threshold_uncertainty_score":0.99999356},"labels":[],"label_agreement":null},{"id":"W2262149688","doi":"","title":"Crossing numbers of nearly complete graphs and nearly complete bipartite graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Robertson–Seymour theorem; Cograph; Indifference graph; Complete bipartite graph; 1-planar graph; Chordal graph; Discrete mathematics; Graph","score_opus":0.023439922217151583,"score_gpt":0.2743095829051087,"score_spread":0.25086966068795713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262149688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9855372,0.00028098153,0.010856427,0.0002927794,0.0009039211,0.0003170778,0.000014078302,0.00023806516,0.0015594796],"genre_scores_gemma":[0.990736,0.000018920975,0.008957195,0.00016282023,0.0000050316794,0.000015756961,0.0000048168763,0.000033347573,0.000066115834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969503,0.00038758165,0.00050486176,0.0007262325,0.0006789888,0.0007519866],"domain_scores_gemma":[0.997339,0.0005924088,0.00025492514,0.0011938742,0.00028868474,0.00033111137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010626457,0.00030897828,0.00051167613,0.00035353441,0.00061741594,0.00055944384,0.0013416604,0.00010589873,0.000011757649],"category_scores_gemma":[0.0001635206,0.00031457175,0.00015853789,0.0013851642,0.0012447349,0.0009507664,0.0006035081,0.00038450575,0.00004031736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027975497,0.0000647229,0.014288674,0.000039974708,0.000037454898,0.000007428985,0.0007439976,0.000019215806,0.0073269946,0.9732415,0.00018544981,0.0040166057],"study_design_scores_gemma":[0.001353302,0.0003436454,0.02419281,0.000059970982,0.000010290819,0.000018965204,0.000028412584,0.007871139,0.0011237034,0.9615952,0.003044622,0.00035795433],"about_ca_topic_score_codex":0.00016806174,"about_ca_topic_score_gemma":0.000016247084,"teacher_disagreement_score":0.011646321,"about_ca_system_score_codex":0.000029597355,"about_ca_system_score_gemma":0.00006764793,"threshold_uncertainty_score":0.9999306},"labels":[],"label_agreement":null},{"id":"W2263532892","doi":"10.1287/moor.2017.0852","title":"When Is the Matching Polytope Box-Totally Dual Integral?","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Matching (statistics); Polyhedron; Linear programming; Convex hull; Polyhedral combinatorics; Regular polygon; Discrete mathematics; Convex optimization; Convex set; Mathematical optimization; Geometry","score_opus":0.11460997054815757,"score_gpt":0.4207609136705217,"score_spread":0.3061509431223641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263532892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22353598,0.00019991321,0.69820523,0.03845396,0.00019439099,0.0016877078,0.000032760152,0.000106013555,0.037584014],"genre_scores_gemma":[0.7762287,0.00003500012,0.2162883,0.00007074861,0.00005893379,0.00010866997,0.000001618216,0.000023638315,0.0071843984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707437,0.0002681175,0.00039736438,0.00035115736,0.0013757577,0.00053321815],"domain_scores_gemma":[0.9950668,0.00067200593,0.00007450809,0.0032166056,0.00085263106,0.00011740551],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004109434,0.00014380415,0.00022320845,0.000283031,0.0024684772,0.0016764189,0.0045913323,0.0000661423,0.00015089942],"category_scores_gemma":[0.0015065719,0.00009466164,0.00009960123,0.00030181636,0.00080034434,0.0011600532,0.0022534255,0.00066607184,0.0002197357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040571344,0.00014269791,0.000021723925,0.000049581195,0.000034256907,0.000009324173,0.015591451,0.00016264805,0.007149883,0.9709153,0.0013427627,0.0045762914],"study_design_scores_gemma":[0.00028151248,0.000116592375,0.00021925865,0.000121293706,0.0000041586677,0.000034662848,0.0018436734,0.086471796,0.020756632,0.8891405,0.0008234036,0.00018651123],"about_ca_topic_score_codex":0.00021865338,"about_ca_topic_score_gemma":0.000114517876,"teacher_disagreement_score":0.5526927,"about_ca_system_score_codex":0.00004950517,"about_ca_system_score_gemma":0.00024706914,"threshold_uncertainty_score":0.99935997},"labels":[],"label_agreement":null},{"id":"W2266186","doi":"10.1136/jcp.43.12.992","title":"The Domination Graphs of Complete Paired Comparison Digraphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02565909821618035,"score_gpt":0.29988415800787005,"score_spread":0.2742250597916897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8641013,0.0016045609,0.12066703,0.0009190902,0.0033576305,0.0009265208,0.000005640886,0.0003641471,0.008054088],"genre_scores_gemma":[0.99721384,0.000036204205,0.0026141815,0.000030772742,0.0000033264996,0.000011577405,0.0000027054396,0.000011785031,0.00007559214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978234,0.00019754285,0.00048456935,0.0003184258,0.0006698501,0.00050621165],"domain_scores_gemma":[0.9970008,0.0013950071,0.00024378805,0.00093041814,0.00030796687,0.000122028076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002289272,0.00015448288,0.00023870371,0.00023251717,0.0004135029,0.000084336556,0.0016264183,0.000064383814,0.000002745424],"category_scores_gemma":[0.00019349686,0.00012034711,0.00013092998,0.0013953479,0.00037418443,0.0003387103,0.00029332688,0.00024483525,0.000016046592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041475032,0.00009554165,0.0055326805,0.000009024697,0.000023266713,0.000004096381,0.00034509663,0.0000073329948,0.002098672,0.9722371,0.000445212,0.01916052],"study_design_scores_gemma":[0.00072123454,0.00017332079,0.025235945,0.000017173188,0.0000042040297,0.0000033839838,0.00011820406,0.0023289535,0.009680525,0.95853084,0.0030363998,0.00014979938],"about_ca_topic_score_codex":0.00001534112,"about_ca_topic_score_gemma":0.000025098967,"teacher_disagreement_score":0.13311256,"about_ca_system_score_codex":0.000041991676,"about_ca_system_score_gemma":0.000035238012,"threshold_uncertainty_score":0.49076128},"labels":[],"label_agreement":null},{"id":"W2269982198","doi":"10.55016/ojs/cdm.v12i2.62777","title":"Shellability, vertex decomposability, and lexicographical products of graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University; Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Vertex (graph theory); Combinatorics; Mathematics; Graph; Computer science","score_opus":0.024110148435130374,"score_gpt":0.34976466714273247,"score_spread":0.3256545187076021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269982198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41555417,0.00017486079,0.571466,0.009734269,0.0001867316,0.0013057585,0.00016652908,0.00014395935,0.0012677299],"genre_scores_gemma":[0.9310724,0.000017344886,0.06877781,0.0000231902,0.000012601553,0.000043773474,0.0000030915664,0.000010179644,0.00003957914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809635,0.00010500701,0.00045231037,0.00051744515,0.000400467,0.0004284021],"domain_scores_gemma":[0.9957772,0.00046509408,0.00019913855,0.0026367882,0.0006582505,0.0002635269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012955819,0.00018990262,0.00039633253,0.0001911572,0.0006356952,0.00030607748,0.0017775232,0.00007965813,0.000007392689],"category_scores_gemma":[0.0052079996,0.00016366185,0.00010794078,0.00044291202,0.0008929003,0.00048229028,0.0015591484,0.00019303018,0.0000151450895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010713037,0.0001699567,0.00474934,0.00012596905,0.000030189474,0.0000023928656,0.00030338854,0.0000055214146,0.0027257367,0.9896106,0.00007884942,0.0021873147],"study_design_scores_gemma":[0.0004054291,0.0001594748,0.017569091,0.00007813001,0.000017728982,0.000016071775,0.000034029857,0.0049626473,0.008595069,0.96768457,0.00025593792,0.0002218342],"about_ca_topic_score_codex":0.00000875235,"about_ca_topic_score_gemma":0.000013276623,"teacher_disagreement_score":0.5155183,"about_ca_system_score_codex":0.000036926514,"about_ca_system_score_gemma":0.00008400063,"threshold_uncertainty_score":0.6673937},"labels":[],"label_agreement":null},{"id":"W2274606173","doi":"","title":"Semitotal domination in graphs","year":2014,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Domination analysis; Mathematics; Combinatorics; Vertex (graph theory); Graph; Connectivity; Discrete mathematics","score_opus":0.014436776905547077,"score_gpt":0.28307398270227024,"score_spread":0.2686372057967232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274606173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13366058,0.00007382105,0.81599146,0.0006786887,0.0001276409,0.00038263915,0.0000013657448,0.00022781712,0.048855964],"genre_scores_gemma":[0.93642145,0.0000024912108,0.06326738,0.000046736648,0.000010641961,0.000036387966,8.205987e-7,0.000008291382,0.00020582486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986852,0.00015564638,0.00023748398,0.00029416798,0.00031971198,0.00030778832],"domain_scores_gemma":[0.9986933,0.00045710112,0.00004590485,0.0006809235,0.00004761159,0.0000751814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140573,0.00010684125,0.00016382431,0.00025519013,0.000055902052,0.000052770014,0.0007042795,0.00004473087,0.000042194933],"category_scores_gemma":[0.0005473832,0.00009469312,0.0000551964,0.00058923144,0.00008442558,0.0003750184,0.00019499555,0.00013864835,0.0002055551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031502407,0.000067833476,0.00011237836,0.000034865832,0.0000028205077,0.000002634272,0.00062393316,0.00000650322,0.0003613743,0.9760622,0.00009756238,0.022624739],"study_design_scores_gemma":[0.00024748896,0.0000415414,0.0010567365,0.000035344605,0.0000010709888,0.000008777828,0.00004624781,0.081639394,0.0007550671,0.9156553,0.00040951735,0.00010351776],"about_ca_topic_score_codex":0.0000018913474,"about_ca_topic_score_gemma":0.0000033855622,"teacher_disagreement_score":0.80276084,"about_ca_system_score_codex":0.000029487326,"about_ca_system_score_gemma":0.000015300437,"threshold_uncertainty_score":0.38614732},"labels":[],"label_agreement":null},{"id":"W2274875244","doi":"10.46298/dmtcs.2097","title":"Bounding the monomial index and (1,l)-weight choosability of a graph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Monomial; Upper and lower bounds; Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.013370642156780903,"score_gpt":0.27961273395916114,"score_spread":0.26624209180238023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274875244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11956856,0.000021549125,0.87729645,0.0006922855,0.0001753621,0.00028444035,0.0000015310849,0.00007142496,0.0018884016],"genre_scores_gemma":[0.8231796,0.0000045113134,0.17664678,0.00009133564,0.000051836047,0.0000129814,2.0511249e-7,0.000009648369,0.0000031199058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968946,0.0002625563,0.0004909842,0.0007270683,0.0009776931,0.00064711564],"domain_scores_gemma":[0.99616015,0.0015674435,0.00017644314,0.0016160758,0.0002073918,0.00027250306],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0049866815,0.0002400689,0.00036417897,0.00022514892,0.0006226774,0.00047770498,0.0034362222,0.000058511163,0.000013372086],"category_scores_gemma":[0.00058341736,0.00014966106,0.00011054415,0.0013207666,0.008688982,0.0006342007,0.0021216664,0.00031891983,0.0000076206065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079020265,0.000045969813,0.00028317765,0.000038636055,0.000006799416,7.2155285e-7,0.0012571089,0.00006178023,0.00048449571,0.9905338,0.000004260617,0.0072753313],"study_design_scores_gemma":[0.00013530828,0.00008497322,0.0005275597,0.000026977707,0.000003754709,0.000013368765,0.000023539786,0.43054482,0.0012073572,0.56729925,0.000018157336,0.00011492022],"about_ca_topic_score_codex":0.0000022436514,"about_ca_topic_score_gemma":7.319349e-7,"teacher_disagreement_score":0.703611,"about_ca_system_score_codex":0.0000299594,"about_ca_system_score_gemma":0.00007509325,"threshold_uncertainty_score":0.9940088},"labels":[],"label_agreement":null},{"id":"W2275118037","doi":"10.1016/j.dam.2015.09.022","title":"Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Mathematics; Combinatorics; Pancyclic graph; Neighbourhood (mathematics); Hamiltonian path; Conjecture; Connectivity; Discrete mathematics; Graph; Induced subgraph; Vertex connectivity; Vertex (graph theory); Chordal graph; 1-planar graph; Mathematical analysis","score_opus":0.01562679022518824,"score_gpt":0.24948473352771053,"score_spread":0.2338579433025223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275118037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13841172,0.0002401346,0.85071236,0.00062628125,0.000051609113,0.00092025154,0.000015827714,0.0002947841,0.008727038],"genre_scores_gemma":[0.91463023,0.00008123328,0.084794305,0.0001514562,0.00001426728,0.00013839538,0.0000012937949,0.000035426852,0.00015339746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718434,0.0000603529,0.0005906678,0.00072227966,0.00060689705,0.00083544326],"domain_scores_gemma":[0.9982666,0.0002334235,0.00015154401,0.0009725956,0.00011223437,0.0002636231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006493808,0.0003743781,0.00047414083,0.00017611096,0.00015468129,0.00020673123,0.001199341,0.00015095946,0.000015751168],"category_scores_gemma":[0.00012638034,0.0002490875,0.000073583375,0.0008243204,0.0005583077,0.0004974466,0.00058824435,0.00018111894,0.000072283045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007195977,0.00017302297,0.0003064824,0.00018176893,0.000033850432,0.00003606977,0.00083958945,0.00024442456,0.008020451,0.95966315,0.00003639897,0.030392833],"study_design_scores_gemma":[0.0021585044,0.0001817617,0.000792704,0.00041292576,0.00001259806,0.00006190265,0.0004102748,0.027729804,0.0041125976,0.96320635,0.00022774233,0.0006928126],"about_ca_topic_score_codex":0.0000139619015,"about_ca_topic_score_gemma":0.00013172218,"teacher_disagreement_score":0.77621853,"about_ca_system_score_codex":0.00011234259,"about_ca_system_score_gemma":0.00013647077,"threshold_uncertainty_score":0.9999961},"labels":[],"label_agreement":null},{"id":"W2275781839","doi":"10.1016/j.jctb.2017.05.008","title":"The structure of matroids with a spanning clique or projective geometry","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Oriented matroid; Mathematics; Graphic matroid; Weighted matroid; Matroid partitioning; Projective geometry; Projective plane; Minor (academic); Discrete mathematics; Geometry; Algebraic geometry","score_opus":0.016436985967622077,"score_gpt":0.3087211658203098,"score_spread":0.29228417985268773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275781839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71018684,0.0044408226,0.23994575,0.0020874212,0.036935274,0.0029994382,0.000113988826,0.00017844001,0.0031120286],"genre_scores_gemma":[0.98723227,0.00029127905,0.011103351,0.000015562859,0.00084094965,0.0000075722583,0.0000010504791,0.0000479379,0.00046000053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959552,0.0010663873,0.00085606985,0.00039702485,0.0012318143,0.0004934815],"domain_scores_gemma":[0.9916402,0.0014190692,0.0031292944,0.0017779259,0.0018673933,0.00016613121],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0033420403,0.0004279905,0.00095393666,0.0004083846,0.00062213076,0.0006323446,0.005473545,0.00033048535,0.000013650875],"category_scores_gemma":[0.0019134535,0.00022786134,0.00030387222,0.00040575193,0.0010793378,0.0011085767,0.002190968,0.0025085453,5.9622954e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009474478,0.00007024168,0.00017490897,0.00015434485,0.00056606974,0.0001713921,0.001543107,0.0003620892,0.00071618444,0.98271936,0.00009032775,0.0039575165],"study_design_scores_gemma":[0.0010830318,0.0020943566,0.00020044885,0.0005509925,0.000048572732,0.0004333411,0.0005230712,0.000028265693,0.013217966,0.9799928,0.0015457955,0.0002813798],"about_ca_topic_score_codex":0.0000053034973,"about_ca_topic_score_gemma":0.000005286536,"teacher_disagreement_score":0.27704546,"about_ca_system_score_codex":0.000168566,"about_ca_system_score_gemma":0.0019087794,"threshold_uncertainty_score":0.9999073},"labels":[],"label_agreement":null},{"id":"W2276038413","doi":"10.1002/jgt.22153","title":"Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Planar graph; List coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.040183817741576616,"score_gpt":0.31325601871403363,"score_spread":0.273072200972457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276038413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7697242,0.009668988,0.18602444,0.0021302074,0.0076766266,0.0013979595,0.00013507396,0.00019363852,0.02304886],"genre_scores_gemma":[0.9814399,0.0017584172,0.01570907,0.00008865397,0.00019167403,0.000017990778,0.00000230558,0.0000701698,0.0007218323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937185,0.0013417263,0.0015873724,0.0007292604,0.0019410918,0.00068204274],"domain_scores_gemma":[0.98910487,0.0014280856,0.0043273675,0.0037786758,0.000994512,0.0003664866],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0088143945,0.0005953008,0.0015266617,0.0022530307,0.00033506606,0.00039654996,0.011649251,0.00044116864,0.000056052784],"category_scores_gemma":[0.0016377275,0.00049681234,0.001658166,0.00047036321,0.000908571,0.0008746787,0.003127226,0.0023760905,0.0000088721445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016444575,0.00038712384,0.0002847999,0.00023542701,0.00068758364,0.00038462633,0.00060051586,0.00092081464,0.004184939,0.9811894,0.0006919652,0.008788308],"study_design_scores_gemma":[0.0015431693,0.0008545879,0.0016585562,0.0009211375,0.00008453581,0.000087405526,0.000084519525,0.000073582174,0.010222693,0.9833481,0.0006877355,0.00043402982],"about_ca_topic_score_codex":0.00001421226,"about_ca_topic_score_gemma":0.0000058477576,"teacher_disagreement_score":0.21171568,"about_ca_system_score_codex":0.00009706532,"about_ca_system_score_gemma":0.000495119,"threshold_uncertainty_score":0.9999255},"labels":[],"label_agreement":null},{"id":"W2277107861","doi":"10.1007/978-3-642-40104-6_31","title":"Planar Packing of Binary Trees","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Planar graph; Binary tree; Embedding; Trémaux tree; Colored; Mathematics; Time complexity; Book embedding; Tree (set theory); Spanning tree; Computer science; Graph; Discrete mathematics; 1-planar graph; Line graph; Pathwidth; Artificial intelligence","score_opus":0.024790430396237764,"score_gpt":0.27572010548139037,"score_spread":0.2509296750851526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277107861","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032957108,0.0006760003,0.99273694,0.00036155133,0.0007074839,0.00038840136,0.0000054935367,0.000119372555,0.004675174],"genre_scores_gemma":[0.33825415,0.00010511181,0.6596914,0.0005393745,0.00031563162,0.000016546737,0.0000050129606,0.00006239233,0.0010103715],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594057,0.000057625977,0.0005499867,0.0013743123,0.0013019225,0.00077558926],"domain_scores_gemma":[0.9964178,0.0008492513,0.00033630742,0.0018780959,0.000324293,0.0001942275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090447237,0.00047509323,0.0006106571,0.0014329517,0.0001871637,0.00024400014,0.005105169,0.00027260033,0.000058331803],"category_scores_gemma":[0.000115457515,0.00041652823,0.0001559177,0.00091178407,0.0014145327,0.0008827449,0.0015121672,0.00086160214,0.00008483872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010900937,0.000041329447,0.00011659648,0.00007163254,0.000020191423,0.00013738878,0.0007516359,0.016179463,0.0034237462,0.2390075,0.00004763171,0.740192],"study_design_scores_gemma":[0.00024013645,0.00034738105,0.0003490938,0.0005314344,0.000004266398,0.00005442735,2.8450916e-7,0.1669732,0.0037376008,0.826399,0.00072559476,0.0006375804],"about_ca_topic_score_codex":0.000020586514,"about_ca_topic_score_gemma":0.000028681718,"teacher_disagreement_score":0.7395544,"about_ca_system_score_codex":0.00016722841,"about_ca_system_score_gemma":0.00040286622,"threshold_uncertainty_score":0.99982864},"labels":[],"label_agreement":null},{"id":"W2280880808","doi":"10.1007/978-3-319-42634-1_16","title":"Minimum Cost Homomorphisms with Constrained Costs","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Graph homomorphism; Combinatorics; Bipartite graph; Interval graph; Discrete mathematics; Chordal graph; Graph; Line graph; Voltage graph","score_opus":0.0196663850493519,"score_gpt":0.2894151307590696,"score_spread":0.2697487457097177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280880808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006610711,0.00020060175,0.987029,0.0026174441,0.0016520941,0.0012742446,0.000025894953,0.00033527726,0.0002547293],"genre_scores_gemma":[0.64988583,0.000014263984,0.34919798,0.0006018767,0.00018112166,0.00008659507,0.0000034323687,0.000025247184,0.0000036267595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931441,0.00027272286,0.0005460692,0.0027330325,0.0017196103,0.0015844787],"domain_scores_gemma":[0.9940762,0.0013728373,0.00033422807,0.0031480058,0.00061258214,0.00045612818],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017998075,0.0007058714,0.0007082747,0.0012229546,0.00035947084,0.0009956721,0.008188064,0.0003269711,0.00001657488],"category_scores_gemma":[0.0003173234,0.0005022976,0.00012729137,0.0027627074,0.0034640038,0.000849736,0.006087058,0.0014743773,0.00004786988],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006887311,0.00015007888,0.0012384088,0.00007324545,0.00003058504,0.00057145033,0.00071854185,0.03490188,0.0021745437,0.023644738,0.00001826937,0.9364094],"study_design_scores_gemma":[0.0016412153,0.00050390046,0.0009829564,0.0013543821,0.000008420377,0.0003694127,0.0000012021573,0.4793239,0.024562564,0.48954874,0.000121739766,0.0015815604],"about_ca_topic_score_codex":0.000019426388,"about_ca_topic_score_gemma":0.00005185185,"teacher_disagreement_score":0.9348278,"about_ca_system_score_codex":0.000686279,"about_ca_system_score_gemma":0.001890191,"threshold_uncertainty_score":0.99974287},"labels":[],"label_agreement":null},{"id":"W2281619726","doi":"","title":"The Connected Domination and Tree Domination of P(n,k) for k = 1, 2, [n/2]","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory); Domination analysis; Graph","score_opus":0.024368073227741285,"score_gpt":0.27167585384316717,"score_spread":0.24730778061542588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281619726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8804433,0.00046728237,0.11127356,0.0005796574,0.0014004167,0.0012762689,0.0000047734384,0.00012717675,0.0044275993],"genre_scores_gemma":[0.9931655,0.000035214256,0.0065914122,0.000010861683,0.0000024065955,0.000065686814,0.000001272733,0.000007052145,0.00012058873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916476,0.000097185286,0.00017926919,0.00019722256,0.00017699815,0.00018453671],"domain_scores_gemma":[0.99837357,0.00080600404,0.000115068135,0.00036191125,0.0002985064,0.00004495104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059998175,0.00007761882,0.00010739308,0.00008486306,0.00019397716,0.000035208188,0.00051237753,0.00004192255,0.0000018645234],"category_scores_gemma":[0.00039572886,0.000059205708,0.000035947145,0.0002945412,0.00015346013,0.00033042885,0.00012582047,0.00006322657,0.0000019752151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052982236,0.000036680805,0.0001708447,0.000008502024,0.000010441912,4.359709e-7,0.0005920182,2.5047638e-7,0.0015140754,0.9548035,0.00007494764,0.042735294],"study_design_scores_gemma":[0.0010792287,0.00021500513,0.005578633,0.000007476241,0.000004201856,0.000002100304,0.00006421811,0.0043661827,0.030896982,0.95742,0.00029298753,0.00007300644],"about_ca_topic_score_codex":0.0000057115226,"about_ca_topic_score_gemma":0.0000072841854,"teacher_disagreement_score":0.11272224,"about_ca_system_score_codex":0.000019987314,"about_ca_system_score_gemma":0.000027010703,"threshold_uncertainty_score":0.24143386},"labels":[],"label_agreement":null},{"id":"W2283442510","doi":"10.14288/1.0052053","title":"D-width, metric embedding, and their connections","year":2011,"lang":"en","type":"article","venue":"Open Collections","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Book embedding; Metric dimension; Embedding; Discrete mathematics; Pathwidth; Steiner tree problem; Chordal graph; Planar graph; Bounded function; Metric space; Graph; 1-planar graph; Line graph; Computer science","score_opus":0.05550652881869031,"score_gpt":0.3175484049950506,"score_spread":0.2620418761763603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283442510","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000204596,0.00008059479,0.5647632,0.00011024779,0.00022256302,0.0004013264,0.0000068776953,0.00011955261,0.43409106],"genre_scores_gemma":[0.35878056,0.00020821544,0.277069,0.00036873,0.00008353248,0.00077757763,0.000002856623,0.00005000524,0.3626595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990363,0.00011361695,0.00013485142,0.00036483275,0.000092574366,0.00025780703],"domain_scores_gemma":[0.9989687,0.00023212371,0.000044335437,0.00049693446,0.00012058,0.00013727801],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00033501603,0.000107640975,0.000135043,0.0002924479,0.002670497,0.0009896867,0.000990028,0.00004107723,0.00039504335],"category_scores_gemma":[0.00014797715,0.00009315529,0.00004086307,0.0039877463,0.000096591706,0.0008459536,0.00078032253,0.00016547373,0.000022884811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008876986,0.0009435357,0.000714911,0.00001790037,0.00033718027,0.00003007689,0.007366206,0.00021333284,0.00048475282,0.7210417,0.20539665,0.06336501],"study_design_scores_gemma":[0.0010402751,0.00045943496,0.00088462734,0.000019984534,0.000013978827,0.00028342084,0.0010217974,0.031155957,0.00496338,0.86484253,0.09478445,0.00053017307],"about_ca_topic_score_codex":0.0011138851,"about_ca_topic_score_gemma":0.0004610176,"teacher_disagreement_score":0.35857597,"about_ca_system_score_codex":0.000042941265,"about_ca_system_score_gemma":0.000088650646,"threshold_uncertainty_score":0.9986279},"labels":[],"label_agreement":null},{"id":"W2283908050","doi":"10.1007/978-3-319-24704-5","title":"Relational and Algebraic Methods in Computer Science","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; McMaster University","funders":"","keywords":"Computer science; Algebraic number; Relational database; Algebra over a field; Information retrieval; Mathematics; Pure mathematics","score_opus":0.04685480116868425,"score_gpt":0.35898781661255985,"score_spread":0.3121330154438756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283908050","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002603966,0.00091731304,0.9947656,0.0006289898,0.0015483244,0.00058697566,0.0000038954777,0.00014455787,0.0011439922],"genre_scores_gemma":[0.007670648,0.00002682694,0.9907793,0.00084194465,0.00036100432,0.000021071442,0.000004379022,0.00003454669,0.00026031712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99180806,0.00040347848,0.0007648628,0.002996226,0.0025445516,0.0014828132],"domain_scores_gemma":[0.99433315,0.0021561594,0.0003009903,0.0019509081,0.00072302966,0.000535775],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0104222335,0.00063952466,0.00075734896,0.0035875433,0.0004600303,0.0009049699,0.006114504,0.00036013193,0.00000943261],"category_scores_gemma":[0.00076525006,0.00059637876,0.00009040094,0.0060555367,0.005190686,0.0023748092,0.005458442,0.0018052267,0.00003065477],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011355857,0.000051812185,0.00033976327,0.0000412039,0.00000598474,0.00010341628,0.0013927611,0.04646746,0.00028315233,0.04940811,0.00006844976,0.9018265],"study_design_scores_gemma":[0.0003212949,0.0001375374,0.00072364527,0.00018150784,0.0000018540309,0.00010383247,1.5566711e-7,0.5155766,0.00037336105,0.4815948,0.0005190527,0.0004663531],"about_ca_topic_score_codex":0.000014666817,"about_ca_topic_score_gemma":0.00004047041,"teacher_disagreement_score":0.90136015,"about_ca_system_score_codex":0.0012959725,"about_ca_system_score_gemma":0.00504839,"threshold_uncertainty_score":0.99964875},"labels":[],"label_agreement":null},{"id":"W2285106886","doi":"10.48550/arxiv.1509.01307","title":"End-vertices of LBFS of (AT-free) bigraphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Interval graph; Chordal graph; Bipartite graph; Mathematics; Vertex (graph theory); Discrete mathematics; Pathwidth; Indifference graph; Computer science; Graph; 1-planar graph; Line graph","score_opus":0.10587492174830801,"score_gpt":0.22535515251138757,"score_spread":0.11948023076307956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285106886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76196146,0.0005255197,0.22641215,0.00006699646,0.00040920955,0.00039365815,0.00009002293,0.00015630788,0.00998468],"genre_scores_gemma":[0.9948495,0.00023060747,0.0032491072,0.000012417702,0.000017984534,6.949825e-7,0.0000065597965,0.000016073067,0.0016170521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997824,0.000267787,0.00031006004,0.0009216774,0.00028300704,0.00039343152],"domain_scores_gemma":[0.9954136,0.00026693323,0.0004885646,0.0030149857,0.00058493786,0.00023098847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006493705,0.00027583056,0.0005063042,0.0006963114,0.00006899402,0.00002150344,0.0052513406,0.0002366824,0.000049295882],"category_scores_gemma":[0.00017360867,0.00030405796,0.00028973047,0.0012441244,0.0005635465,0.00038815566,0.007960977,0.00044337474,0.000024736411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023823665,0.00026879073,0.008490115,0.0003966344,0.00026559224,0.00019907302,0.0007882483,0.06520367,0.0019123335,0.9205734,0.00050789205,0.0011559789],"study_design_scores_gemma":[0.0010896774,0.00022714563,0.0012043585,0.00017268589,0.00007029311,0.000004865467,0.00013321414,0.062414374,0.014698441,0.9190388,0.0004296447,0.0005165155],"about_ca_topic_score_codex":0.00015525302,"about_ca_topic_score_gemma":0.00006882255,"teacher_disagreement_score":0.23288806,"about_ca_system_score_codex":0.00014951825,"about_ca_system_score_gemma":0.00030891792,"threshold_uncertainty_score":0.9999412},"labels":[],"label_agreement":null},{"id":"W2285618017","doi":"10.1007/s00493-016-3594-4","title":"On the Number of Bases of Almost All Matroids","year":2018,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Cardinality (data modeling); Omega; Discrete mathematics; Embedding; Physics","score_opus":0.03759325496127142,"score_gpt":0.33073093295384776,"score_spread":0.29313767799257634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285618017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7532321,0.0008866835,0.12109662,0.0046264045,0.005337882,0.0023159275,0.00012418989,0.0004401027,0.11194005],"genre_scores_gemma":[0.9957036,0.00008347611,0.0035108358,0.000119023774,0.000028950408,0.000047817975,0.000003929222,0.000023788716,0.00047858633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977294,0.00032207815,0.00038004975,0.00051265716,0.00072943425,0.00032636672],"domain_scores_gemma":[0.99558485,0.0010189221,0.00036261772,0.0025267927,0.00042078824,0.00008603589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007106705,0.00023871266,0.00040991968,0.00012559844,0.00007078831,0.00003911027,0.0032924484,0.00015205836,0.0001458268],"category_scores_gemma":[0.00037697286,0.00017140307,0.00021030492,0.0004797349,0.00039066246,0.00007912567,0.0031987077,0.000564305,0.0001110903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022822067,0.00023187738,0.0008009637,0.00010642718,0.00006191532,0.0000056415674,0.00018142916,0.00002131354,0.00009379304,0.98968095,0.008055912,0.00073698495],"study_design_scores_gemma":[0.00017780619,0.00015305882,0.0007185741,0.0001530538,0.000009856662,0.0000038613935,0.000005946638,0.0009109469,0.009470821,0.98554343,0.002671955,0.00018071462],"about_ca_topic_score_codex":0.00003881551,"about_ca_topic_score_gemma":3.8059994e-7,"teacher_disagreement_score":0.24247144,"about_ca_system_score_codex":0.0000690385,"about_ca_system_score_gemma":0.00014987616,"threshold_uncertainty_score":0.69896144},"labels":[],"label_agreement":null},{"id":"W2285763632","doi":"10.1002/jgt.22177","title":"Quasi‐graphic matroids*","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Marsden Fund; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Graphic matroid; Combinatorics; Generalization; Mathematics; Frame (networking); Discrete mathematics; Computer science","score_opus":0.0230699067112449,"score_gpt":0.31376997600799306,"score_spread":0.29070006929674813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285763632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13732632,0.0019994967,0.84679294,0.0019705177,0.0016138225,0.00015955683,0.0000027723636,0.00007301842,0.0100615425],"genre_scores_gemma":[0.9829531,0.00026762686,0.01603716,0.00015275241,0.00017935234,0.0000023855068,9.964784e-8,0.000018168203,0.00038939205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782926,0.0003861367,0.0004673762,0.00023112433,0.00066575775,0.00042036807],"domain_scores_gemma":[0.99655277,0.00036748644,0.00088049466,0.0015730737,0.00036961053,0.00025659637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038859248,0.00017501318,0.0003364405,0.00068059855,0.0006794327,0.00043726136,0.0046802433,0.00007707245,0.000036000714],"category_scores_gemma":[0.00059755857,0.00013630885,0.00042248773,0.0002878136,0.0005287078,0.0018625291,0.0004186715,0.00058051234,0.000034028868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012306334,0.00014038055,0.0015378603,0.00001078865,0.000083706065,0.00018983285,0.00022219328,0.000010920535,0.0020342802,0.9669249,0.00035342935,0.028368663],"study_design_scores_gemma":[0.00061510404,0.00047411292,0.0056580184,0.000057020516,0.000012446281,0.00034342453,0.00008890693,0.00007981905,0.0019328187,0.9890027,0.0015710723,0.00016455518],"about_ca_topic_score_codex":0.000001509004,"about_ca_topic_score_gemma":0.0000017849901,"teacher_disagreement_score":0.8456268,"about_ca_system_score_codex":0.00002485137,"about_ca_system_score_gemma":0.00009929083,"threshold_uncertainty_score":0.8697134},"labels":[],"label_agreement":null},{"id":"W2290377455","doi":"10.3102/1076998615606114","title":"Graphs ′ <i>R</i> Us UnwinAntony. Graphical Data Analysis With R. Boca Raton, FL: Taylor &amp; Francis, 2015; 310 pages, $69.95, ISBN 9781498715232.","year":2015,"lang":"en","type":"article","venue":"Journal of Educational and Behavioral Statistics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Mathematics education; Mathematics","score_opus":0.08435273792904979,"score_gpt":0.3799160870258571,"score_spread":0.2955633490968073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290377455","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15178534,0.005185648,0.8352062,0.005575457,0.00084871874,0.0002792746,0.0010339456,0.000025923315,0.00005946765],"genre_scores_gemma":[0.4669513,0.0005846673,0.530808,0.00033100182,0.00029891857,0.000013157008,0.0005105421,0.000034381414,0.0004680536],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692035,0.00020397654,0.00068015675,0.00048869883,0.0012793099,0.00042749097],"domain_scores_gemma":[0.99606943,0.0004117827,0.00051524234,0.00085340755,0.0014177316,0.00073238433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010936587,0.00026953043,0.00049312506,0.00051981484,0.00022787406,0.0002897069,0.0014865624,0.0000893221,0.000083033985],"category_scores_gemma":[0.00023098473,0.00020114596,0.00009300755,0.0016077469,0.0004065737,0.0010944491,0.0003207565,0.0005531017,0.000012744502],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070883415,0.0036471607,0.55910146,0.00006447837,0.00096330914,0.00033645055,0.0012298714,0.0005451861,0.00041124478,0.18465252,0.22017598,0.02816353],"study_design_scores_gemma":[0.0053993245,0.003902796,0.39276317,0.00014098534,0.0032011743,0.0017583227,0.00061601546,0.007288387,0.0001480431,0.46255502,0.11995747,0.0022693065],"about_ca_topic_score_codex":0.000104174454,"about_ca_topic_score_gemma":0.0003873728,"teacher_disagreement_score":0.31516594,"about_ca_system_score_codex":0.00006466575,"about_ca_system_score_gemma":0.0006278447,"threshold_uncertainty_score":0.82024944},"labels":[],"label_agreement":null},{"id":"W2290756947","doi":"10.1017/cbo9781316414958","title":"Erdős–Ko–Rado Theorems: Algebraic Approaches","year":2015,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Waterloo","funders":"","keywords":"Mathematical proof; Association scheme; Algebraic number; Intersection (aeronautics); Mathematics; Scheme (mathematics); Generalization; Discrete mathematics; Algebraic properties; Focus (optics); Combinatorics; Computer science; Algebra over a field; Pure mathematics; Geography; Geometry","score_opus":0.059320916382777505,"score_gpt":0.23048053783863778,"score_spread":0.17115962145586028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290756947","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022477012,0.00048075692,0.075939104,0.000038300044,0.00032971872,0.0007141635,0.000114607334,0.0005530842,0.92180777],"genre_scores_gemma":[0.00038847802,0.000038986036,0.0029416017,0.00006899977,0.00020033613,0.0000040480627,0.00006494254,0.00007549807,0.99621713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99602926,0.0004312869,0.00027826914,0.0013739498,0.0010150446,0.00087222026],"domain_scores_gemma":[0.99599713,0.00028889865,0.00030779841,0.0024380838,0.00037393952,0.0005941307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007260084,0.00065077055,0.0006828691,0.0005761478,0.00033907132,0.00022025652,0.005188789,0.0005567171,0.0000023999569],"category_scores_gemma":[0.000059373215,0.0007193022,0.00034750582,0.00010169227,0.0008913861,0.00055956724,0.0031445625,0.0012348165,0.00008634831],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059544745,0.000023372864,7.329793e-7,0.00007920051,0.00012160004,0.00036338015,0.00016972118,0.000013283249,0.000008612105,0.8606188,0.13373832,0.004803417],"study_design_scores_gemma":[0.000852235,0.00012160327,0.0000034687928,0.0001228961,0.00006799449,0.000055531054,0.000069454065,0.0014003529,0.0002584126,0.007663958,0.9884852,0.0008988889],"about_ca_topic_score_codex":0.00002195015,"about_ca_topic_score_gemma":0.0000012461308,"teacher_disagreement_score":0.8547469,"about_ca_system_score_codex":0.00077515247,"about_ca_system_score_gemma":0.0011707529,"threshold_uncertainty_score":0.9995258},"labels":[],"label_agreement":null},{"id":"W2293521544","doi":"","title":"A Linear Time Algorithm for Computing Longest Paths in 2-Trees","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Time complexity; Algorithm; Running time; Computer science; Combinatorics","score_opus":0.013515686416620123,"score_gpt":0.2757339437695265,"score_spread":0.2622182573529064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293521544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.577076,0.00036415842,0.41460702,0.0014172666,0.001958844,0.0025138012,0.000010135641,0.00062723225,0.0014255281],"genre_scores_gemma":[0.80945975,0.000007529505,0.18965113,0.00015701455,0.000028722632,0.00013062342,0.000007690225,0.00003620425,0.00052131526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982292,0.0001185111,0.0002806116,0.00048173513,0.00028895185,0.000601],"domain_scores_gemma":[0.99836886,0.00060037215,0.00007862146,0.00060375175,0.00020690919,0.00014146233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005814218,0.00017597382,0.00024765078,0.00020856361,0.00013382194,0.00013016764,0.0011315815,0.00008296489,0.000020350257],"category_scores_gemma":[0.00013909877,0.00017459321,0.00007576939,0.0006794387,0.00007841881,0.0006057531,0.00043808494,0.00023433649,0.00039849646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070962537,0.00033332888,0.001862357,0.00002191296,0.000024843534,0.00003368787,0.0006889067,0.00016409515,0.0012039647,0.5966076,0.0014872599,0.39756492],"study_design_scores_gemma":[0.00082623924,0.00015075866,0.0020949042,0.000026825557,0.0000011492876,0.000004958475,0.000018356162,0.46892235,0.00075296377,0.5266497,0.00036258297,0.0001892057],"about_ca_topic_score_codex":0.000041180156,"about_ca_topic_score_gemma":0.0000032832309,"teacher_disagreement_score":0.46875826,"about_ca_system_score_codex":0.0000695271,"about_ca_system_score_gemma":0.000056151788,"threshold_uncertainty_score":0.71197045},"labels":[],"label_agreement":null},{"id":"W2294341534","doi":"10.1145/2151171.2151177","title":"Elimination graphs","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Discrete mathematics; Block graph; Indifference graph; Intersection graph; Pathwidth; Independent set; Line graph; Graph; 1-planar graph","score_opus":0.033869786607482716,"score_gpt":0.31175226098866454,"score_spread":0.27788247438118185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294341534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016275978,0.00009687427,0.99516886,0.0011695556,0.00060880836,0.00015211292,0.000004879099,0.0002677636,0.00090357126],"genre_scores_gemma":[0.7536101,0.000054493015,0.24551016,0.00020004723,0.000043550175,0.00006476838,0.0000015001739,0.000014677248,0.00050070754],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986521,0.000092905735,0.00014748205,0.00025880753,0.00039114367,0.00045757854],"domain_scores_gemma":[0.9985064,0.00022155172,0.000033981574,0.0009716928,0.00007844778,0.00018791576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003888001,0.00013000883,0.00010026184,0.00033541277,0.00027006722,0.000055950335,0.00094844424,0.000063608415,0.000082216575],"category_scores_gemma":[0.000037333524,0.00012411729,0.00009563848,0.0008747693,0.000066933084,0.0011728115,0.00001747289,0.00026694185,0.00033948003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074006216,0.00025589974,0.000030177878,0.0000042609827,0.000020508789,0.0000021762564,0.00044001077,0.00019154092,0.0004625226,0.07194809,0.000044088476,0.9265933],"study_design_scores_gemma":[0.0031069834,0.0012665658,0.027832227,0.00008292782,0.00007088793,0.00028467432,0.0006555256,0.05089224,0.17529762,0.70672154,0.03164072,0.0021480913],"about_ca_topic_score_codex":0.0000058731125,"about_ca_topic_score_gemma":0.0000014969053,"teacher_disagreement_score":0.9244452,"about_ca_system_score_codex":0.0000525696,"about_ca_system_score_gemma":0.000019584448,"threshold_uncertainty_score":0.50613564},"labels":[],"label_agreement":null},{"id":"W2294850962","doi":"10.1007/s13160-016-0209-9","title":"A fast algorithm to construct a representation for transversal matroids","year":2016,"lang":"en","type":"article","venue":"Japan Journal of Industrial and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Transversal (combinatorics); Matroid; Bipartite graph; Mathematics; Oriented matroid; Combinatorics; Weighted matroid; Algorithm; Discrete mathematics; Matrix (chemical analysis); Matroid partitioning; Graphic matroid; Graph","score_opus":0.05063648421488117,"score_gpt":0.301734935331679,"score_spread":0.25109845111679785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294850962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062812716,0.0000074898576,0.9354713,0.0009948593,0.00014035763,0.00036747826,0.000012453981,0.000015279169,0.0001780607],"genre_scores_gemma":[0.11897045,0.000010246949,0.8804416,0.000050787996,0.000394665,0.00002294805,2.9860536e-7,0.000015642532,0.00009335747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988327,0.00002228662,0.00046355382,0.00015540006,0.00030448998,0.00022154921],"domain_scores_gemma":[0.99872446,0.00050998747,0.00025291683,0.00018316116,0.00013532292,0.00019413968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066856056,0.00011361876,0.00028550904,0.00017557085,0.00007593266,0.000081421706,0.0004003549,0.000072636496,0.000007300915],"category_scores_gemma":[0.00015751393,0.00007083305,0.0000794551,0.00024382376,0.00008512667,0.00022516515,0.00006570855,0.00013135203,0.0000034904456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001334772,0.00005437326,0.000014961209,0.0000145022805,0.000048442194,0.0000031591771,0.0011621589,0.000011527096,0.02965059,0.16002591,0.00047174803,0.80840915],"study_design_scores_gemma":[0.014934094,0.0019624855,0.00003382513,0.0005507008,0.000089970286,0.0007697172,0.0038790922,0.002322245,0.120202936,0.8526502,0.0019630517,0.00064166094],"about_ca_topic_score_codex":2.3944756e-7,"about_ca_topic_score_gemma":1.5898178e-7,"teacher_disagreement_score":0.8077675,"about_ca_system_score_codex":0.00002827598,"about_ca_system_score_gemma":0.00007566993,"threshold_uncertainty_score":0.2888488},"labels":[],"label_agreement":null},{"id":"W2295288220","doi":"10.5555/2884435.2884580","title":"Weak duality for packing edge-disjoint odd (u, v)-trails","year":2016,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Graph; Duality (order theory); Time complexity; Discrete mathematics","score_opus":0.029410264380123948,"score_gpt":0.3144581138483648,"score_spread":0.28504784946824085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295288220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018722399,0.000103594604,0.977922,0.010507975,0.0008944815,0.000885802,0.000115642026,0.0004302815,0.00726794],"genre_scores_gemma":[0.79427254,0.00030191004,0.18664289,0.001265254,0.0015428442,0.0010942509,0.00003355078,0.00023126886,0.014615525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630994,0.00024845367,0.0004708396,0.0011462871,0.0007290272,0.0010954785],"domain_scores_gemma":[0.996817,0.0008431105,0.00017192092,0.001573451,0.00022864176,0.0003658575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012845913,0.00037799953,0.0003850752,0.00024073318,0.00035846175,0.00022433742,0.0016327099,0.00013452626,0.000039014554],"category_scores_gemma":[0.00021116348,0.00025412874,0.00030776396,0.00048830744,0.00027751084,0.0009770789,0.0004822156,0.00021082057,0.0002045362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001752087,0.00018765447,0.0002496524,0.00007616587,0.00011688509,0.000027616543,0.0005711285,0.000063999505,0.087131694,0.6981179,0.0025640393,0.21071807],"study_design_scores_gemma":[0.0062995665,0.0027288245,0.0026113002,0.00063369324,0.00004401172,0.000074953634,0.00022400059,0.019687274,0.27594024,0.59490496,0.09426556,0.00258561],"about_ca_topic_score_codex":0.000007909097,"about_ca_topic_score_gemma":0.0000055462897,"teacher_disagreement_score":0.7924003,"about_ca_system_score_codex":0.00017374658,"about_ca_system_score_gemma":0.00010853118,"threshold_uncertainty_score":0.9999911},"labels":[],"label_agreement":null},{"id":"W2295501631","doi":"","title":"Inapproximability of Treewidth and Related Problems (Extended Abstract)","year":2015,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Partial k-tree; Pathwidth; Tree-depth; Tree decomposition; Graphical model; Combinatorics; Mathematics; 1-planar graph; Discrete mathematics; Computer science; Chordal graph; Graph; Artificial intelligence; Line graph","score_opus":0.16535067389067262,"score_gpt":0.35472622906176576,"score_spread":0.18937555517109314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295501631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21883625,0.000099808625,0.7023021,0.008250425,0.0015838965,0.0009709318,0.000032555305,0.00032011815,0.06760392],"genre_scores_gemma":[0.99310637,0.000029353001,0.006566548,0.000046693254,0.000025012336,0.000025658208,0.0000048090483,0.000009039332,0.00018652702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757034,0.00010617359,0.0006978919,0.00058250787,0.00076384784,0.00027924255],"domain_scores_gemma":[0.99792737,0.0001779168,0.00025667468,0.0005239302,0.0009011194,0.00021299203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001124024,0.00018889137,0.00024487491,0.00029440477,0.00005463566,0.00015068126,0.0010366781,0.00008882886,0.00012697937],"category_scores_gemma":[0.0008228947,0.0001726524,0.000070155256,0.0003718101,0.00045577277,0.0005793126,0.00034434674,0.00033780953,0.00011548934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049753777,0.00022976918,0.00008987402,0.000009289079,0.000021296426,0.000009180439,0.0008797866,0.00043544458,0.0044847243,0.8289623,0.000013597639,0.16481493],"study_design_scores_gemma":[0.000074759635,0.0002740962,0.0012139172,0.000069840156,0.0000021225092,0.000018884974,0.00027118396,0.08130623,0.037701037,0.8788021,0.00009201463,0.00017382776],"about_ca_topic_score_codex":0.000059971127,"about_ca_topic_score_gemma":0.000028537308,"teacher_disagreement_score":0.7742701,"about_ca_system_score_codex":0.00009338659,"about_ca_system_score_gemma":0.00020279009,"threshold_uncertainty_score":0.7040561},"labels":[],"label_agreement":null},{"id":"W2298045254","doi":"10.1016/j.dam.2016.02.009","title":"Strict chordal and strict split digraphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Mathematics; Undirected graph; Combinatorics; Interval graph; Similarity (geometry); Discrete mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.015583501838773802,"score_gpt":0.2628296687805626,"score_spread":0.24724616694178878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298045254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046839673,0.00010463589,0.93937874,0.00029878982,0.000046328594,0.00043727027,0.000015934173,0.000242685,0.012635955],"genre_scores_gemma":[0.77833694,0.00014493048,0.22081992,0.00006448967,0.000044624925,0.00008764231,0.0000019191523,0.00003588683,0.00046365638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818677,0.00003919476,0.00032136013,0.00048638863,0.00044901183,0.0005172946],"domain_scores_gemma":[0.99779767,0.0008630416,0.00012739637,0.0009519129,0.000048839524,0.00021112208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065632653,0.00023819499,0.0002751443,0.0001997452,0.00014861402,0.00014970206,0.00094355835,0.000074166775,0.000026117848],"category_scores_gemma":[0.00013875331,0.0001508467,0.00006805689,0.00056970754,0.00019909811,0.0003350884,0.0005509493,0.00013743545,0.00009155964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013538211,0.00003905948,0.00007195922,0.00004440685,0.000022878454,0.000005662077,0.0003408143,0.0000013166182,0.007142778,0.9509981,0.00010836089,0.041211113],"study_design_scores_gemma":[0.00094676646,0.000096437965,0.0009135532,0.00006208639,0.000015267087,0.000022199396,0.00020736607,0.0017631329,0.008393377,0.9856152,0.001475041,0.0004895892],"about_ca_topic_score_codex":0.0000011912795,"about_ca_topic_score_gemma":0.0000010258976,"teacher_disagreement_score":0.7314972,"about_ca_system_score_codex":0.00002968051,"about_ca_system_score_gemma":0.00003057009,"threshold_uncertainty_score":0.615135},"labels":[],"label_agreement":null},{"id":"W2299102011","doi":"","title":"The Metric Cutpoint Partition Problem","year":2006,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Vertex (graph theory); Linear subspace; Realization (probability); Discrete mathematics; Graph; Metric space; Metric (unit); Statistics","score_opus":0.015691306358643273,"score_gpt":0.2570308227436838,"score_spread":0.2413395163850405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299102011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002898739,0.039604686,0.89929664,0.049471013,0.0006817976,0.0015705631,0.00004341642,0.0008514489,0.0055817114],"genre_scores_gemma":[0.5447897,0.004453764,0.36881903,0.002148428,0.0012459427,0.0023662583,0.00004014193,0.00022741524,0.075909354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933383,0.0010166658,0.0010143128,0.0010291972,0.0011937359,0.0024078207],"domain_scores_gemma":[0.9952284,0.0010042215,0.00046535657,0.002272624,0.0005378076,0.00049160986],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0035375755,0.00060515944,0.0004699514,0.0007788298,0.0015979203,0.001614441,0.0024600106,0.0004456656,0.000056170597],"category_scores_gemma":[0.00045218284,0.0005250726,0.00040388742,0.0043132207,0.0008109286,0.0016345328,0.0010249278,0.0012487731,0.0002720767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005893507,0.0003417791,0.0024597994,0.000050179093,0.00004264715,0.00013043168,0.00010085509,0.007002675,0.001275058,0.8531448,0.015465709,0.11992708],"study_design_scores_gemma":[0.00054126343,0.00034253555,0.010312902,0.00012776996,0.000039000526,0.00036141791,0.000055627956,0.2338999,0.010867009,0.5932447,0.14951573,0.0006921651],"about_ca_topic_score_codex":0.01651244,"about_ca_topic_score_gemma":0.008015076,"teacher_disagreement_score":0.5418909,"about_ca_system_score_codex":0.0011422873,"about_ca_system_score_gemma":0.00060453004,"threshold_uncertainty_score":0.9997201},"labels":[],"label_agreement":null},{"id":"W2301667118","doi":"10.1016/j.ejc.2016.10.009","title":"Minimum size of feedback vertex sets of planar graphs of girth at least five","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Feedback vertex set; Girth (graph theory); Planar graph; Upper and lower bounds; Discrete mathematics; Graph","score_opus":0.015419745436154084,"score_gpt":0.24508041134648448,"score_spread":0.2296606659103304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301667118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97178674,0.0006737382,0.021570338,0.0003642811,0.00078981626,0.00012814037,0.000025784328,0.000016200453,0.0046449513],"genre_scores_gemma":[0.99670553,0.0002151074,0.0024957182,0.000017698725,0.000013472318,1.8860281e-7,2.1230628e-7,0.00002443768,0.00052760664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694216,0.0007327794,0.0009230857,0.00020269366,0.0008965092,0.00030279093],"domain_scores_gemma":[0.99606985,0.00091732974,0.0012566583,0.0006305264,0.00091513095,0.00021052701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015959976,0.00017644501,0.00049936946,0.00031855013,0.00005256918,0.000011701051,0.0019112639,0.00003165039,0.000024620584],"category_scores_gemma":[0.00058641424,0.00012546474,0.00024915577,0.0007380806,0.00033698432,0.00039554574,0.0003824845,0.00021741232,0.000017094697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018412386,0.0017077448,0.027649695,0.00046807644,0.0006540196,0.0010863016,0.0041009127,0.00011791765,0.16464205,0.7473739,0.011611279,0.038746856],"study_design_scores_gemma":[0.020106437,0.013415495,0.15880156,0.002558745,0.00012639376,0.00082491175,0.00049467775,0.00030426832,0.18219577,0.6133743,0.006584188,0.0012132695],"about_ca_topic_score_codex":7.368214e-7,"about_ca_topic_score_gemma":2.9817966e-7,"teacher_disagreement_score":0.13399962,"about_ca_system_score_codex":0.000056189438,"about_ca_system_score_gemma":0.00010575048,"threshold_uncertainty_score":0.51163036},"labels":[],"label_agreement":null},{"id":"W2305610210","doi":"10.1016/j.jctb.2016.01.006","title":"Stabilizer theorems for even cycle matroids","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Seventh Framework Programme; European Research Council","keywords":"Matroid; Combinatorics; Mathematics; Matroid partitioning; Graphic matroid; Minor (academic); Discrete mathematics; Graph","score_opus":0.011781528074291387,"score_gpt":0.27753434757196466,"score_spread":0.26575281949767326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2305610210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095123515,0.0003817414,0.8904815,0.0026574808,0.008817768,0.00046268117,0.000015126538,0.000098712095,0.0019614957],"genre_scores_gemma":[0.9860543,0.000066158726,0.012109524,0.000061607614,0.0007498062,0.000017273325,2.2970995e-7,0.00003334107,0.0009077517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976694,0.0004909792,0.00057224877,0.00023673684,0.0005682215,0.00046242328],"domain_scores_gemma":[0.99623793,0.0017944622,0.00042442346,0.0006169853,0.00071665156,0.00020953533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036874516,0.00019583487,0.00039545266,0.00020806132,0.00017803336,0.00011497437,0.0017535916,0.00009373503,0.00008571684],"category_scores_gemma":[0.0012565245,0.00011921672,0.0002946067,0.00030739213,0.00033450892,0.001996927,0.00025525826,0.00019518436,0.000013960696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015541872,0.0000848089,0.00006283878,0.000010970721,0.000058825917,0.000012093578,0.0002516177,0.000007105325,0.011245181,0.97378826,0.0003299956,0.012594092],"study_design_scores_gemma":[0.0022562612,0.0012675176,0.000049420694,0.000050746607,0.000010005506,0.00008635039,0.00009281791,0.000011133986,0.02314605,0.9504191,0.022438506,0.00017204932],"about_ca_topic_score_codex":2.907656e-7,"about_ca_topic_score_gemma":2.3358332e-7,"teacher_disagreement_score":0.8909308,"about_ca_system_score_codex":0.00011368737,"about_ca_system_score_gemma":0.00020142358,"threshold_uncertainty_score":0.48615167},"labels":[],"label_agreement":null},{"id":"W2308641315","doi":"10.1051/ro/2015024","title":"Linear time algorithms to solve the linear ordering problem for oriented tree based graphs","year":2015,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Time complexity; Computer science; Tree (set theory); Mathematics; Combinatorics","score_opus":0.10945740197492171,"score_gpt":0.4049995213879207,"score_spread":0.295542119412999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308641315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043718754,0.000062430154,0.9797603,0.011529036,0.000117303534,0.0028726393,0.000035490295,0.00020358084,0.0010473354],"genre_scores_gemma":[0.023361905,0.00000769843,0.96649724,0.0004081258,0.0002879348,0.0024044334,0.000064803084,0.00007447229,0.006893386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580216,0.0004780539,0.00038081128,0.0007836787,0.0014812674,0.0010739978],"domain_scores_gemma":[0.99458003,0.0008711854,0.000022430408,0.0014435174,0.00254618,0.00053667615],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0053577903,0.00021885335,0.00023165235,0.00074132293,0.0013302896,0.0004262523,0.002184507,0.00009842341,0.00003378297],"category_scores_gemma":[0.0018300946,0.0001608767,0.00011531909,0.0037786586,0.000290928,0.00065473444,0.0007715036,0.0006201653,0.0005276243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005049071,0.0010767276,0.00011240153,0.00008751159,0.0001585212,0.000038237347,0.0078738015,0.3940598,0.025499262,0.46481368,0.024340186,0.08143496],"study_design_scores_gemma":[0.0010119384,0.00074049755,0.000021532256,0.000027530185,0.0000030399276,0.000004034307,0.0001950437,0.9463333,0.007949246,0.006662325,0.036822427,0.00022911545],"about_ca_topic_score_codex":0.00009129807,"about_ca_topic_score_gemma":0.00020332077,"teacher_disagreement_score":0.55227345,"about_ca_system_score_codex":0.00017874292,"about_ca_system_score_gemma":0.0009661351,"threshold_uncertainty_score":0.99996984},"labels":[],"label_agreement":null},{"id":"W2309458578","doi":"10.1007/978-3-540-93952-8_7","title":"Extremal k-Extendable Graphs and Generalizations","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Pathwidth; Indifference graph; Chordal graph; Discrete mathematics; Cograph; Graph; 1-planar graph; Line graph","score_opus":0.02987968178141627,"score_gpt":0.2733024246861215,"score_spread":0.24342274290470522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2309458578","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022778304,0.001161612,0.26071385,0.0003197607,0.0000679124,0.00016833107,0.000004893472,0.00023336028,0.737328],"genre_scores_gemma":[0.00016795022,0.00078422687,0.06320992,0.0003873956,0.000032152882,0.0000053348103,0.000010094036,0.00002569812,0.93537724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853843,0.00001907661,0.00020288539,0.00059416256,0.00033933343,0.00030608044],"domain_scores_gemma":[0.99880016,0.00006130475,0.000069410766,0.0007770788,0.00012435866,0.00016767373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000159301,0.00025253516,0.00023623834,0.0003793125,0.00018520353,0.00015861036,0.00071490207,0.0001621104,0.00030133026],"category_scores_gemma":[0.000011429031,0.00022728721,0.00008746297,0.00010714928,0.0001454703,0.0003516733,0.00032626465,0.00025420485,0.000082807994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014171834,0.0000057406496,0.000002968832,0.0000052895502,0.000012825578,0.000020716907,0.000016414775,0.000015282541,0.000028419705,0.9418071,0.0018639341,0.05621991],"study_design_scores_gemma":[0.00009268056,0.00005181759,0.000017129942,0.000020653664,0.0000050550448,0.000033551914,7.6266815e-7,0.0015049881,0.000035780304,0.85380065,0.14419341,0.00024349501],"about_ca_topic_score_codex":0.000003755756,"about_ca_topic_score_gemma":0.000014677599,"teacher_disagreement_score":0.19804923,"about_ca_system_score_codex":0.000021694023,"about_ca_system_score_gemma":0.000058202448,"threshold_uncertainty_score":0.9268503},"labels":[],"label_agreement":null},{"id":"W2315491415","doi":"10.1142/s1793830916500385","title":"Linear layouts of weakly triangulated graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Combinatorics; Quadrilateral; Mathematics; Graph; Discrete mathematics","score_opus":0.01998284194362755,"score_gpt":0.29938829212707935,"score_spread":0.2794054501834518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315491415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023095498,0.00015368595,0.99544305,0.0006039217,0.00001354644,0.00040361212,0.000040618565,0.00007937747,0.0009526382],"genre_scores_gemma":[0.31726483,0.00024210152,0.6808536,0.00004774439,0.000056296758,0.00038487348,0.000008198672,0.00003492687,0.0011074524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990148,0.000022334405,0.0002873002,0.0002633715,0.00021635789,0.0001958474],"domain_scores_gemma":[0.9986814,0.00032245775,0.00013067765,0.0006398936,0.0001223131,0.00010321471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021018465,0.00011275323,0.00018468127,0.00012118889,0.00010244763,0.000029427574,0.00045918205,0.00004499639,0.00001158813],"category_scores_gemma":[0.000049925075,0.00007264243,0.00006168394,0.00048376925,0.00017180893,0.00017620418,0.00018206851,0.00005512512,0.000019373507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015083389,0.00005804901,0.000016745566,0.000027983515,0.000019371691,4.909213e-7,0.00023903357,0.00000319716,0.0062061762,0.9435025,0.000021050844,0.04990392],"study_design_scores_gemma":[0.00051145966,0.000060388706,0.00014900774,0.00006069451,0.000012754651,0.000010751481,0.0001207469,0.025670024,0.009614786,0.9608962,0.0026836786,0.00020948908],"about_ca_topic_score_codex":0.0000022571262,"about_ca_topic_score_gemma":5.49972e-7,"teacher_disagreement_score":0.31495526,"about_ca_system_score_codex":0.0000075909074,"about_ca_system_score_gemma":0.000020975598,"threshold_uncertainty_score":0.29622725},"labels":[],"label_agreement":null},{"id":"W2319252906","doi":"10.4153/cmb-2015-040-0","title":"A Note on 3-choosability of Planar Graphs Related to Montanssier’s Conjecture","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; List coloring; Graph; Conjecture; Discrete mathematics; Graph power; Line graph","score_opus":0.022389549202905725,"score_gpt":0.2805767668338209,"score_spread":0.2581872176309152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319252906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45942333,0.00022094666,0.24618477,0.12533124,0.00061798474,0.0036819456,0.00020230268,0.0005589711,0.16377851],"genre_scores_gemma":[0.9627596,8.1010506e-7,0.035072614,0.0012277629,0.0000108948125,0.000036788388,0.000002959175,0.000023086535,0.00086548436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979962,0.00017710545,0.00036012585,0.0004330211,0.0004720249,0.00056154066],"domain_scores_gemma":[0.99671143,0.00044277657,0.000055440476,0.0009950437,0.00014848264,0.001646827],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00095989084,0.00018177656,0.00032075733,0.00032761454,0.00006997579,0.00004465076,0.0010194597,0.00013530407,0.0005941096],"category_scores_gemma":[0.0017486509,0.0001575789,0.00008943339,0.00069118344,0.00016675805,0.000047130485,0.0000740211,0.00032986805,0.003549365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026060887,0.000051871226,0.000064636646,0.000036493184,0.000013081519,0.00009186524,0.0011949372,0.00009673885,0.000052340547,0.98824877,0.008823076,0.0013001487],"study_design_scores_gemma":[0.00038125922,0.00032455364,0.00020894974,0.00009385965,0.0000041578082,0.000034467103,0.00007285244,0.00063458184,0.00051725603,0.98099774,0.016501553,0.0002287871],"about_ca_topic_score_codex":0.00049812865,"about_ca_topic_score_gemma":0.00072939537,"teacher_disagreement_score":0.50333625,"about_ca_system_score_codex":0.00024254623,"about_ca_system_score_gemma":0.00037337627,"threshold_uncertainty_score":0.9972265},"labels":[],"label_agreement":null},{"id":"W2321691063","doi":"10.5840/envirophil2008523","title":"Staying True to Trees","year":2008,"lang":"en","type":"article","venue":"Environmental Philosophy","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Applied philosophy; General interest; Contemporary philosophy; Philosophy; Epistemology","score_opus":0.028657597945621335,"score_gpt":0.24803445999084306,"score_spread":0.21937686204522172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321691063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8482043,0.00028248996,0.12782261,0.0031555116,0.00024241606,0.00050478295,0.00001892837,0.0002823,0.019486632],"genre_scores_gemma":[0.9847467,0.000026889042,0.013999762,0.00070044573,0.00010115699,0.000025725056,0.0000027095118,0.000016639866,0.00037997242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860966,0.00005561499,0.00014353957,0.00043406172,0.00042445012,0.00033268542],"domain_scores_gemma":[0.99905956,0.000049952443,0.000028327582,0.0006392736,0.0000023467376,0.00022052407],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009723647,0.00014477925,0.00012421832,0.00013755118,0.0002607791,0.000019178751,0.0008371478,0.00003205696,0.000083047846],"category_scores_gemma":[0.000011108185,0.00014393133,0.00006797204,0.00023074583,0.00015088206,0.00045957995,0.0005115966,0.00014349732,0.0011455185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022954788,0.0015869242,0.042639103,0.000025545496,0.00014468987,0.0014361726,0.010237797,0.0046078134,0.28383487,0.5775297,0.0023903325,0.07533746],"study_design_scores_gemma":[0.0021988384,0.0014298833,0.121160485,0.000043023134,0.000007879985,0.0003821423,0.00015284137,0.0022532227,0.07733576,0.7573814,0.03583881,0.0018157142],"about_ca_topic_score_codex":0.0000015538667,"about_ca_topic_score_gemma":2.761854e-7,"teacher_disagreement_score":0.20649913,"about_ca_system_score_codex":0.000088412846,"about_ca_system_score_gemma":0.000008114288,"threshold_uncertainty_score":0.9996322},"labels":[],"label_agreement":null},{"id":"W2330005770","doi":"10.4153/cmb-2016-020-1","title":"The Thickness of the Cartesian Product of Two Graphs","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Bipartite graph; Planar graph; Graph; Planar; Discrete mathematics; Outerplanar graph; Cartesian coordinate system; Pathwidth; Line graph; Geometry; Computer science","score_opus":0.013334887478022408,"score_gpt":0.2523061781698554,"score_spread":0.23897129069183298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330005770","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22452909,0.0014671412,0.27130833,0.41594216,0.0011750114,0.0042876457,0.00010908496,0.00021146904,0.080970086],"genre_scores_gemma":[0.99506795,0.000006951261,0.0029024452,0.00013576327,0.00001723767,0.000026409001,7.4119555e-8,0.00001168169,0.0018314947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984417,0.00022397957,0.00029542274,0.00023077033,0.00037662988,0.0004314744],"domain_scores_gemma":[0.99720496,0.00093732105,0.00010255037,0.0013461931,0.00018130538,0.00022764396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010626826,0.000107798965,0.00017681486,0.00008205204,0.00019666906,0.000028368699,0.0020025834,0.000031744745,0.00027244337],"category_scores_gemma":[0.0011472174,0.000046479057,0.00010886143,0.0004547158,0.0008019997,0.000043634554,0.0001775177,0.00012697966,0.0002603161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022415609,0.000011329108,0.00013001187,0.000025597361,0.000010460858,0.0000023427558,0.0001540821,0.0000010691416,0.0012143072,0.98963857,0.001280102,0.0075298822],"study_design_scores_gemma":[0.00020560401,0.000028108094,0.0004816532,0.00013745988,0.0000052182563,0.000022956909,0.000038385828,0.00006985102,0.010295453,0.9740016,0.014605002,0.00010874192],"about_ca_topic_score_codex":0.00024750075,"about_ca_topic_score_gemma":0.0009911658,"teacher_disagreement_score":0.77053887,"about_ca_system_score_codex":0.000044399974,"about_ca_system_score_gemma":0.0002963924,"threshold_uncertainty_score":0.37213314},"labels":[],"label_agreement":null},{"id":"W2337761774","doi":"10.1007/978-3-319-29516-9_11","title":"List Colouring and Partial List Colouring of Graphs On-line","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Chordal graph; Combinatorics; Pathwidth; Computer science; Planar graph; Outerplanar graph; Clique-sum; Conjecture; Cograph; Indifference graph; Split graph; Discrete mathematics; Mathematics; Line graph; 1-planar graph; Graph","score_opus":0.028487873025494964,"score_gpt":0.2919273367348818,"score_spread":0.26343946370938687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337761774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002835069,0.00035370098,0.9920773,0.0007025521,0.0008790592,0.00043566563,0.0000134356915,0.00011097852,0.0025922316],"genre_scores_gemma":[0.9026801,0.0001430892,0.09557531,0.0005248536,0.00037017663,0.000016689359,0.0000014712363,0.000054554388,0.0006337585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995749,0.00007303865,0.00058592897,0.0015898697,0.001166703,0.0008354447],"domain_scores_gemma":[0.99631786,0.0013590141,0.00035781495,0.0014085897,0.00028485907,0.00027185457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013147743,0.0005132424,0.0006496669,0.0011671698,0.0003266575,0.00028300207,0.0030190572,0.00026467617,0.000020346006],"category_scores_gemma":[0.00022658205,0.0004189479,0.00013372659,0.0006614942,0.0021654102,0.0005225049,0.002113623,0.0008082705,0.00001071787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007758417,0.000065434884,0.00027440922,0.000112147114,0.000028448647,0.00018700311,0.00054779573,0.0077234386,0.0020696202,0.5564927,0.000009106243,0.43241233],"study_design_scores_gemma":[0.0009611194,0.0012113067,0.00015320488,0.001631612,0.000010710144,0.00009981552,3.2029246e-7,0.1325102,0.028307961,0.83284914,0.0011998995,0.0010647203],"about_ca_topic_score_codex":0.000011071528,"about_ca_topic_score_gemma":0.000043811124,"teacher_disagreement_score":0.899845,"about_ca_system_score_codex":0.00016860767,"about_ca_system_score_gemma":0.0003063178,"threshold_uncertainty_score":0.99982625},"labels":[],"label_agreement":null},{"id":"W2345365639","doi":"","title":"Algorithmic complexity and extremality characterizations for edge searching and its variations","year":2008,"lang":"en","type":"dissertation","venue":"Memorial University Research Repository (Memorial University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Bipartite graph; Combinatorics; Pathwidth; Search problem; Monotone polygon; Mathematics; Graph; Combinatorial search; Theoretical computer science; Time complexity; Computer science; Search algorithm; Beam search; Algorithm; Line graph","score_opus":0.061273920154882845,"score_gpt":0.30463673292767923,"score_spread":0.2433628127727964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345365639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74051106,0.0007503585,0.16676168,0.0012442418,0.02288136,0.013660624,0.0015733181,0.0015582622,0.051059075],"genre_scores_gemma":[0.6695973,0.004915781,0.03406992,0.000035047033,0.012682028,0.00003264146,0.0027102125,0.00034474835,0.27561232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936973,0.0018923157,0.00036441165,0.001690167,0.0012707787,0.0010850247],"domain_scores_gemma":[0.99467653,0.0014283619,0.00031098304,0.000908388,0.0019457435,0.00073001656],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013996827,0.0004965501,0.0007102059,0.0022852405,0.005420425,0.00045924066,0.0022678825,0.0005976717,0.000011725405],"category_scores_gemma":[0.00056611135,0.0006462742,0.00023711464,0.0022487484,0.00070058653,0.002207445,0.0012774522,0.0015172606,0.000010213264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054086223,0.00065392774,0.00016740501,0.0010583455,0.00071283866,0.002020026,0.009754048,0.00004338918,0.051087406,0.9221289,0.001436958,0.0055280994],"study_design_scores_gemma":[0.056090757,0.0076021957,0.032060266,0.0024549956,0.0016923083,0.0011577627,0.030257098,0.17476137,0.054146204,0.07983025,0.5461545,0.013792292],"about_ca_topic_score_codex":0.00041341566,"about_ca_topic_score_gemma":0.00017972474,"teacher_disagreement_score":0.8422987,"about_ca_system_score_codex":0.0008002263,"about_ca_system_score_gemma":0.001609146,"threshold_uncertainty_score":0.99959886},"labels":[],"label_agreement":null},{"id":"W2346145792","doi":"10.55016/ojs/cdm.v14i1.62582","title":"Hamiltonian-connectedness of triangulations with few separating triangles","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universiteit Gent; Vlaamse regering; Vlaams Supercomputer Centrum","keywords":"Social connectedness; Combinatorics; Mathematics; Corollary; Hamiltonian (control theory)","score_opus":0.014064088123411764,"score_gpt":0.3166775454202772,"score_spread":0.30261345729686545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346145792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111574754,0.00006683992,0.8836561,0.00070911046,0.00007429051,0.0010911982,0.00012764626,0.00013791182,0.0025621762],"genre_scores_gemma":[0.86626893,0.0000019181373,0.13274124,0.000035081965,0.000021565245,0.00008358493,0.000015516642,0.000018177469,0.00081395876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823046,0.000112386544,0.0004840164,0.00033952887,0.00041765996,0.0004159712],"domain_scores_gemma":[0.99714303,0.00078270986,0.00022354709,0.0010925604,0.00059179397,0.0001663614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062752655,0.00018831661,0.00042791566,0.0002744674,0.00018460426,0.00011737682,0.00082818634,0.00006575001,0.000051816696],"category_scores_gemma":[0.0007827336,0.00014834346,0.00010532287,0.0015132127,0.00009229766,0.0004104654,0.00023756991,0.00015089811,0.00015197661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029536812,0.000097138676,0.00021590781,0.00006592441,0.000064812215,0.0000036708568,0.0014070197,0.0019999654,0.0052887336,0.98999745,0.00007175787,0.00075805996],"study_design_scores_gemma":[0.011665386,0.002336029,0.00516258,0.0017201543,0.00021451713,0.00016070403,0.0035155832,0.35581177,0.07065283,0.5412105,0.0051409877,0.0024089892],"about_ca_topic_score_codex":0.0000042232036,"about_ca_topic_score_gemma":0.000012253332,"teacher_disagreement_score":0.7546942,"about_ca_system_score_codex":0.000082477934,"about_ca_system_score_gemma":0.00017141202,"threshold_uncertainty_score":0.60492706},"labels":[],"label_agreement":null},{"id":"W2346193990","doi":"10.23638/dmtcs-21-4-9","title":"$(2/2/3)$-SAT problem and its applications in dominating set problems","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Set (abstract data type); Computer science; Dominating set; Mathematics; Programming language; Theoretical computer science; Graph","score_opus":0.01667766956551976,"score_gpt":0.29466171826498233,"score_spread":0.2779840486994626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346193990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08343504,0.00007210246,0.90962654,0.00031137315,0.00006281554,0.0014344326,0.0000038370345,0.00013981447,0.00491403],"genre_scores_gemma":[0.7200454,0.0000065758136,0.27975577,0.000051886,0.000015225012,0.00008385394,0.0000014976247,0.000014140461,0.000025643012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666476,0.00011488859,0.0004969054,0.0010045676,0.00089012284,0.0008287727],"domain_scores_gemma":[0.99748534,0.00089662755,0.00013832025,0.001000216,0.00019953915,0.00027997102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026165987,0.00027426024,0.00035559988,0.0004011763,0.00030394635,0.0005654591,0.0025886302,0.00006831253,0.000024859997],"category_scores_gemma":[0.00010264651,0.00021701677,0.000058027672,0.0020247637,0.0011968116,0.0010798059,0.0020741634,0.00035648653,0.00011593544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001815525,0.000054946777,0.00019309994,0.00016315654,0.0000030042065,0.0000024381604,0.0026134893,0.00024211378,0.0017651224,0.99281806,8.6494504e-7,0.0021419118],"study_design_scores_gemma":[0.00018391217,0.00007035827,0.00007387391,0.000115343864,0.0000016694635,0.000017101615,0.000079763704,0.48256612,0.00071993814,0.5159758,0.000016166801,0.0001799768],"about_ca_topic_score_codex":7.8857187e-7,"about_ca_topic_score_gemma":7.696913e-7,"teacher_disagreement_score":0.6366104,"about_ca_system_score_codex":0.000060147086,"about_ca_system_score_gemma":0.00008786718,"threshold_uncertainty_score":0.8849687},"labels":[],"label_agreement":null},{"id":"W2361202607","doi":"","title":"The Hats of Wheel Are Sequential Graph","year":2000,"lang":"en","type":"article","venue":"Journal of Huaibei Industry Teachers College","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Graph; Computer science; Combinatorics; Mathematics","score_opus":0.02726486279052103,"score_gpt":0.29510333924874066,"score_spread":0.2678384764582196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2361202607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813637,0.0015356377,0.003470409,0.0047095655,0.0008994769,0.00029617577,0.000018894947,0.000044489756,0.0076616406],"genre_scores_gemma":[0.99016356,0.00016514698,0.0027924343,0.00012270371,0.0002915789,0.00000485257,2.2766487e-7,0.000020276584,0.00643922],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971552,0.00048316474,0.00071698247,0.00021516948,0.00096096855,0.00046851713],"domain_scores_gemma":[0.9978254,0.0003190875,0.0006339798,0.0006442259,0.00033075185,0.0002465544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019664443,0.00018729112,0.00034634414,0.00025432164,0.0003477675,0.000101727725,0.002244786,0.00028851608,0.0001597573],"category_scores_gemma":[0.00014234598,0.0001305563,0.00028044434,0.0010502699,0.00038821928,0.00076949864,0.00014482223,0.001991305,0.000011752493],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027086867,0.0022399244,0.039136678,0.000107048574,0.0022407318,0.003496317,0.010187795,0.008191697,0.012190077,0.09603413,0.25587887,0.56758803],"study_design_scores_gemma":[0.015091791,0.0048007476,0.051281616,0.0015323606,0.00029314478,0.005714301,0.01900787,0.0044920635,0.048414562,0.25150225,0.5951852,0.0026840656],"about_ca_topic_score_codex":0.0000052759333,"about_ca_topic_score_gemma":0.0000063200378,"teacher_disagreement_score":0.564904,"about_ca_system_score_codex":0.00010278251,"about_ca_system_score_gemma":0.00034724883,"threshold_uncertainty_score":0.86513406},"labels":[],"label_agreement":null},{"id":"W2364884632","doi":"10.1112/blms.12141","title":"Almost all matroids are nonrepresentable","year":2018,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Graphic matroid; Existential quantification; Omega","score_opus":0.02368925168919626,"score_gpt":0.28878454218712835,"score_spread":0.26509529049793207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2364884632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06723834,0.00030375033,0.80447066,0.074307,0.0005646449,0.0015155509,0.000021029395,0.0004788029,0.051100224],"genre_scores_gemma":[0.40415165,0.000073466654,0.5605918,0.004915641,0.00038322195,0.000091584676,0.0000015110858,0.00007972362,0.029711362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978821,0.00016863226,0.00034579335,0.0003874469,0.00071296137,0.00050303375],"domain_scores_gemma":[0.9975465,0.00044949987,0.0001926235,0.001473963,0.00021306796,0.00012435047],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00096747524,0.00017544943,0.00029420241,0.000017818478,0.00022722047,0.000081685466,0.0021148694,0.00009901572,0.00088351016],"category_scores_gemma":[0.00035852962,0.00011550773,0.00042008166,0.00035750974,0.00073895475,0.00007241231,0.0016348528,0.0002684391,0.00080654264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004227656,0.000620614,0.0014052354,0.00038668842,0.00020264607,0.0000051566294,0.0019758837,0.000035561134,0.005070885,0.56744546,0.4214299,0.0013797119],"study_design_scores_gemma":[0.0008119932,0.00015300748,0.0012088717,0.0002043078,0.000029085993,0.000049972146,0.00018126573,0.0103871375,0.036655266,0.78586143,0.16405833,0.000399329],"about_ca_topic_score_codex":0.000018278286,"about_ca_topic_score_gemma":0.0000010180776,"teacher_disagreement_score":0.33691332,"about_ca_system_score_codex":0.000043389027,"about_ca_system_score_gemma":0.00002649846,"threshold_uncertainty_score":0.99997145},"labels":[],"label_agreement":null},{"id":"W2383797602","doi":"10.1016/j.dam.2016.04.021","title":"Trees with large <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>m</mml:mi></mml:math>-eternal domination number","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation; Pacific Institute for the Mathematical Sciences","keywords":"Guard (computer science); Vertex (graph theory); Combinatorics; Mathematics; Graph; Discrete mathematics; Computer science","score_opus":0.014173069210246202,"score_gpt":0.2604181717843639,"score_spread":0.2462451025741177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383797602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68436813,0.000026668824,0.3094191,0.00018635868,0.00013079637,0.00013065554,0.000056326204,0.00018246422,0.005499493],"genre_scores_gemma":[0.92393816,0.000060383158,0.074816994,0.00017922254,0.00020068734,0.00034540574,0.0000394895,0.00012609828,0.00029356574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644136,0.000054398715,0.0006280778,0.00074559456,0.0012232403,0.000907334],"domain_scores_gemma":[0.9969856,0.00067535735,0.0005421483,0.0014277991,0.000095156676,0.00027392447],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009033305,0.00042019103,0.0003075544,0.00013014053,0.00043753328,0.00036860033,0.0013336965,0.00027599355,0.00006211671],"category_scores_gemma":[0.00016795831,0.0003474931,0.00025548926,0.00042755436,0.00035465628,0.00078690675,0.00082113873,0.00037381405,0.0012711819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015915431,0.00017207938,0.000014980953,0.00020008543,0.00013492822,0.00007400547,0.001192271,0.000076198194,0.004689147,0.9908137,0.00013521888,0.0023382865],"study_design_scores_gemma":[0.0023509283,0.00033731834,0.00008877698,0.00054229714,0.00012679749,0.00024603415,0.0006037862,0.88508534,0.028896833,0.07954836,0.0013694235,0.0008040815],"about_ca_topic_score_codex":0.000010880327,"about_ca_topic_score_gemma":0.00004699517,"teacher_disagreement_score":0.91126525,"about_ca_system_score_codex":0.00003093573,"about_ca_system_score_gemma":0.00015678322,"threshold_uncertainty_score":0.9998977},"labels":[],"label_agreement":null},{"id":"W2394487339","doi":"","title":"Special minimum cuts in directed graphs NOTE.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024485116995650837,"score_gpt":0.2921298065002501,"score_spread":0.2676446895045993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394487339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91355157,0.00027318008,0.0020146351,0.0010978458,0.015036677,0.0007071033,0.0000044121402,0.0008162163,0.066498354],"genre_scores_gemma":[0.9946862,0.000012139821,0.004475167,0.00010204667,0.000079846526,0.000029698786,0.0000030050549,0.000021289108,0.0005906426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979037,0.00024111927,0.00025665018,0.00047741394,0.0005795765,0.00054154254],"domain_scores_gemma":[0.9985116,0.00020340548,0.00006353116,0.00075480243,0.00018523316,0.0002814046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862806,0.00017151021,0.00023198134,0.0003662402,0.00006699084,0.00009567803,0.0013210532,0.000093819275,0.0000138437645],"category_scores_gemma":[0.00035434944,0.00017508345,0.000061689156,0.0017881936,0.00011277468,0.00059360574,0.00044543468,0.00031871133,0.00020659533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003815834,0.00015478751,0.004204424,0.0000034860718,0.0000057992593,0.000109102315,0.0008293077,0.0000116979845,0.00017915084,0.97912717,0.010498883,0.004838058],"study_design_scores_gemma":[0.0014496073,0.00013305,0.0034585388,0.00001416569,0.0000012925021,0.0000075996263,0.000024347193,0.0014355744,0.0009072955,0.9838586,0.008490653,0.00021928157],"about_ca_topic_score_codex":0.000027433729,"about_ca_topic_score_gemma":0.000030674735,"teacher_disagreement_score":0.08113459,"about_ca_system_score_codex":0.00013300747,"about_ca_system_score_gemma":0.00017165153,"threshold_uncertainty_score":0.7139695},"labels":[],"label_agreement":null},{"id":"W2394517787","doi":"","title":"Pseudo-outerplanar graphs and chromatic conjectures.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Outerplanar graph; Discrete mathematics; Pathwidth; Graph; Line graph","score_opus":0.008828477229429532,"score_gpt":0.2513453727960519,"score_spread":0.24251689556662237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394517787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97054005,0.00030111658,0.022207677,0.0007432751,0.0012193805,0.00031672834,0.0000016695648,0.00043418782,0.004235922],"genre_scores_gemma":[0.9940786,0.000019866191,0.0054458207,0.0003197698,0.0000040046657,0.000017034234,0.0000013688588,0.000014209667,0.00009936611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851364,0.00018518847,0.00017892286,0.0004159869,0.0003194827,0.0003867742],"domain_scores_gemma":[0.9985717,0.0003597682,0.00006407331,0.00075622497,0.0000631306,0.00018512778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000520296,0.00016612493,0.00021537635,0.00016976101,0.00018154678,0.0001459197,0.0008538706,0.00006711892,0.000010381954],"category_scores_gemma":[0.00013910476,0.00014997963,0.00004768718,0.00042995196,0.00016442745,0.00035639343,0.00031063694,0.00020067209,0.000056356042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040661625,0.000025734316,0.0011228358,0.000018440822,0.000013471912,0.000008638052,0.00021681337,0.0000033981325,0.00057738746,0.9928502,0.0005991658,0.0045598675],"study_design_scores_gemma":[0.0006243554,0.00015905769,0.00314519,0.000018496652,0.0000035779435,0.000034142646,0.000008282864,0.0065499367,0.0010689859,0.98723865,0.0009645676,0.00018476883],"about_ca_topic_score_codex":0.000009742432,"about_ca_topic_score_gemma":0.0000022648996,"teacher_disagreement_score":0.023538517,"about_ca_system_score_codex":0.000020462236,"about_ca_system_score_gemma":0.000024723586,"threshold_uncertainty_score":0.61159915},"labels":[],"label_agreement":null},{"id":"W2394528912","doi":"","title":"End-completely-regular and End-inverse joins of graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Joins; Mathematics; Inverse; Combinatorics; Computer science; Geometry; Programming language","score_opus":0.015978604320760783,"score_gpt":0.2543213914225688,"score_spread":0.23834278710180803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394528912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9752396,0.00023137519,0.01750156,0.00044492772,0.0010962234,0.00041422542,0.000005922719,0.00020928356,0.0048569236],"genre_scores_gemma":[0.9921872,0.00002790954,0.007559056,0.00009686954,0.0000047989192,0.000016982114,0.0000018808029,0.000015947218,0.000089381756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822426,0.00022641831,0.00025434766,0.00044194047,0.0004488079,0.00040425584],"domain_scores_gemma":[0.9982981,0.0003326523,0.000112503716,0.000937699,0.00012853289,0.00019050596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073107245,0.0001730939,0.0002860675,0.00024407245,0.00013643404,0.00005344459,0.0009443399,0.00006747458,0.000028627028],"category_scores_gemma":[0.00013559841,0.00016963723,0.00008542124,0.000601316,0.00034983986,0.00040295316,0.000486932,0.00019112411,0.000026957707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007864068,0.000055747307,0.0020112458,0.00002124605,0.000018150879,0.0000056768304,0.00019808997,0.0000050536164,0.0044267382,0.9840013,0.00025908815,0.008989838],"study_design_scores_gemma":[0.0008160976,0.00022640596,0.003586983,0.000018902692,0.000005146559,0.0000115589155,0.00001816216,0.003836779,0.012245353,0.9745368,0.0045137745,0.00018408439],"about_ca_topic_score_codex":0.000025220195,"about_ca_topic_score_gemma":0.000006580708,"teacher_disagreement_score":0.016947616,"about_ca_system_score_codex":0.00002081642,"about_ca_system_score_gemma":0.000038134694,"threshold_uncertainty_score":0.6917606},"labels":[],"label_agreement":null},{"id":"W2394631425","doi":"","title":"Spanning trees whose stems have at most k leaves.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Horticulture; Combinatorics; Biology","score_opus":0.018599383170885917,"score_gpt":0.27352755899945186,"score_spread":0.2549281758285659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394631425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93482643,0.0004329347,0.04143078,0.00080606114,0.0028745392,0.00043771992,0.0000034194277,0.00058717804,0.018600939],"genre_scores_gemma":[0.9938672,0.000011893971,0.0023789273,0.00014494351,0.000021338385,0.000025781812,0.0000031204318,0.000028403938,0.0035183432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977478,0.00023754952,0.0002596622,0.0005829501,0.00055199803,0.000620071],"domain_scores_gemma":[0.9979664,0.00036426002,0.00010958953,0.0011846878,0.00013750712,0.00023755965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007671485,0.00021582683,0.0002670207,0.00017519413,0.00035561676,0.00017841744,0.0014919312,0.000089787856,0.000023619425],"category_scores_gemma":[0.00021266699,0.00021012343,0.000079736994,0.00053142564,0.00015963012,0.00060391857,0.00090471806,0.00028058214,0.00039190357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001798354,0.000096597425,0.0037875837,0.0000085978945,0.000017139317,0.000019512232,0.00058980164,0.00007195751,0.002400125,0.9659288,0.0016945549,0.02536737],"study_design_scores_gemma":[0.0023255749,0.0004877418,0.003358988,0.000044973272,0.0000053760264,0.000022388824,0.00007065536,0.03898575,0.013875663,0.9076148,0.03272996,0.0004780794],"about_ca_topic_score_codex":0.000019616411,"about_ca_topic_score_gemma":0.000010163661,"teacher_disagreement_score":0.05904082,"about_ca_system_score_codex":0.00011976904,"about_ca_system_score_gemma":0.00004042406,"threshold_uncertainty_score":0.8568585},"labels":[],"label_agreement":null},{"id":"W2394646298","doi":"","title":"Trees with the fourth largest number of maximal independent sets.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory)","score_opus":0.01201799064296281,"score_gpt":0.26269455306046785,"score_spread":0.250676562417505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394646298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907917,0.000044663757,0.003011366,0.0014407353,0.00026984478,0.0003491659,0.0000018015625,0.0000750694,0.0040156464],"genre_scores_gemma":[0.9958647,0.0000058900596,0.0035806901,0.00008511641,0.00000265627,0.000057986297,9.541337e-7,0.000014483024,0.0003875538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843305,0.00014673459,0.00015975545,0.00029416924,0.000589029,0.00037726917],"domain_scores_gemma":[0.9984899,0.00022369457,0.00010113081,0.00086440414,0.00021877894,0.00010205752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036769634,0.00014323716,0.0001711549,0.000056416833,0.00013433436,0.000101116726,0.001411728,0.000049721453,0.00010271422],"category_scores_gemma":[0.000031530053,0.00008846147,0.000053239408,0.00052424055,0.00019238291,0.00055491977,0.00040390054,0.000262329,0.00021961375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001209053,0.00010263151,0.020855216,0.0000060511784,0.000030790117,0.000010283571,0.00038454708,0.000020060279,0.00022414823,0.97488403,0.0008816393,0.0025885378],"study_design_scores_gemma":[0.00087528594,0.00018053193,0.049251467,0.000015991463,0.0000051491284,0.00003562776,0.00014693248,0.0012293906,0.0020542776,0.9454634,0.00055858906,0.00018333101],"about_ca_topic_score_codex":0.000071515096,"about_ca_topic_score_gemma":0.000018251656,"teacher_disagreement_score":0.029420577,"about_ca_system_score_codex":0.000027086831,"about_ca_system_score_gemma":0.000062624385,"threshold_uncertainty_score":0.36073542},"labels":[],"label_agreement":null},{"id":"W2394711279","doi":"","title":"The t-Pebbling Conjecture on Products of Complete r-Partite Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.0442046350333334,"score_gpt":0.2703736874322913,"score_spread":0.2261690523989579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394711279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800752,0.0007785935,0.002439544,0.001325036,0.0038543385,0.00091427047,0.0000068521304,0.00030977934,0.01029641],"genre_scores_gemma":[0.99768597,0.00002904396,0.0020701773,0.00007329616,0.000004947135,0.00002040637,8.547779e-7,0.000014093886,0.000101239806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983007,0.00019943094,0.0002538132,0.00038798992,0.00043689008,0.00042120065],"domain_scores_gemma":[0.99791914,0.0003583086,0.00014312241,0.0012503918,0.00024055035,0.000088508044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073326274,0.00015469348,0.00018504592,0.00012710778,0.0003024628,0.000052746782,0.0016198636,0.000047829115,0.0000066352313],"category_scores_gemma":[0.00023852564,0.00010829663,0.00007171663,0.0009420657,0.00029776795,0.00023697241,0.00029304656,0.0002917931,0.00004597519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035648678,0.00007103927,0.00063493353,0.000010328221,0.000023089546,0.0000075851867,0.0005722489,0.0000068753548,0.0014027823,0.99487275,0.00030873076,0.002054007],"study_design_scores_gemma":[0.0003802547,0.00031047463,0.002398088,0.00002292181,0.0000031027907,0.0000050052736,0.000024062792,0.0002984603,0.03376825,0.960691,0.001967447,0.00013092947],"about_ca_topic_score_codex":0.000010982308,"about_ca_topic_score_gemma":0.0000024914154,"teacher_disagreement_score":0.03418173,"about_ca_system_score_codex":0.000019800344,"about_ca_system_score_gemma":0.000057032248,"threshold_uncertainty_score":0.44162083},"labels":[],"label_agreement":null},{"id":"W2394748621","doi":"","title":"Domination by Union of Complete Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Vertex (graph theory); Graph; Induced subgraph; Discrete mathematics; Property (philosophy); Domination analysis; Set (abstract data type); Computer science","score_opus":0.011810092131149724,"score_gpt":0.2674976246667467,"score_spread":0.25568753253559695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394748621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9736459,0.00006235465,0.020591715,0.0005085567,0.001993086,0.0002465779,0.000008819491,0.00013075622,0.0028122058],"genre_scores_gemma":[0.99525994,0.000008161417,0.0045691645,0.000029218383,0.000002155891,0.000010769254,0.0000070616575,0.000009286421,0.0001042208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879557,0.00012739874,0.00019729503,0.00026824654,0.0003707884,0.00024070509],"domain_scores_gemma":[0.99871796,0.0002048676,0.00010776899,0.00067604304,0.00020143768,0.00009191677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006725549,0.000103454404,0.00014874873,0.00016444606,0.00009780639,0.00003782167,0.0010159527,0.00006773181,0.000017630031],"category_scores_gemma":[0.00010362868,0.00010297269,0.000055995642,0.0006876915,0.00016662366,0.00043520654,0.00021733587,0.0002763979,0.000024414885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041961216,0.00006692096,0.00065220264,0.0000058667906,0.000005661569,0.0000012081707,0.000075693744,9.2485044e-7,0.120790035,0.8720557,0.0007830975,0.0055584866],"study_design_scores_gemma":[0.00056740403,0.00009372494,0.0018277139,0.0000056215426,0.0000016758883,0.0000034762745,0.0000071218933,0.0012199427,0.042591836,0.9507962,0.0027730484,0.00011224277],"about_ca_topic_score_codex":0.000016183945,"about_ca_topic_score_gemma":0.000004007877,"teacher_disagreement_score":0.078740485,"about_ca_system_score_codex":0.000013681257,"about_ca_system_score_gemma":0.000028660697,"threshold_uncertainty_score":0.41991046},"labels":[],"label_agreement":null},{"id":"W2394825792","doi":"","title":"4-regular bipartite matching extendable graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Matching (statistics); Combinatorics; Graph; Statistics","score_opus":0.012611972059304899,"score_gpt":0.25981203563062877,"score_spread":0.24720006357132387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394825792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9601223,0.00053118827,0.028944155,0.0012821906,0.0019488654,0.0005969498,0.000001298745,0.0006716173,0.0059014265],"genre_scores_gemma":[0.9864785,0.00002160606,0.012194767,0.00020484893,0.000005612218,0.00009823369,0.0000016219374,0.00002436696,0.0009704114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796027,0.00014737718,0.00024241432,0.00050107535,0.0004824545,0.0006663875],"domain_scores_gemma":[0.99821657,0.00015678442,0.00007574696,0.0011320772,0.00017701359,0.00024182929],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045769065,0.00019033646,0.00020542477,0.00022377937,0.00027548708,0.00032721323,0.0015176531,0.00006927996,0.00012647126],"category_scores_gemma":[0.000054700206,0.0001783356,0.00009906106,0.0009614473,0.00011584331,0.0016182032,0.00053769746,0.00027320939,0.0011871167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019447132,0.000058958358,0.00065243844,0.000008503161,0.000014879894,0.000012185466,0.00017598926,0.00002978883,0.0042233565,0.987533,0.001632562,0.005656443],"study_design_scores_gemma":[0.0003575792,0.00006263942,0.0022015797,0.000017166358,0.0000020190994,0.000010651755,0.000028426579,0.0019244808,0.0047859247,0.98863554,0.0017546617,0.00021932968],"about_ca_topic_score_codex":0.00007964357,"about_ca_topic_score_gemma":0.0000016111711,"teacher_disagreement_score":0.026356224,"about_ca_system_score_codex":0.000043382006,"about_ca_system_score_gemma":0.000043196585,"threshold_uncertainty_score":0.9995906},"labels":[],"label_agreement":null},{"id":"W2394920966","doi":"","title":"Enumeration of Labelled Essential Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics","score_opus":0.009554101312663859,"score_gpt":0.2594430963491188,"score_spread":0.24988899503645493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394920966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822851,0.00010779517,0.013896912,0.0003338675,0.0009786467,0.00033674418,7.278268e-7,0.00010948491,0.0019507098],"genre_scores_gemma":[0.99565876,0.000012230482,0.004073315,0.000032526434,0.0000028924924,0.000033725548,0.0000018475873,0.000007819249,0.00017685979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988864,0.000112141955,0.00020180513,0.00023764126,0.0003259666,0.00023601249],"domain_scores_gemma":[0.99893326,0.00011616599,0.00008239624,0.0005472856,0.00024152688,0.00007937798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022704354,0.0000928411,0.00014149612,0.00014167301,0.000088712484,0.0000646015,0.00072096556,0.000047573365,0.00008075757],"category_scores_gemma":[0.000065519234,0.00008905082,0.00005764444,0.0006098852,0.00008664735,0.00067776465,0.00021128864,0.00011760726,0.00014859281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031706834,0.00006958031,0.00072737806,0.000007202585,0.000012193989,0.0000014825821,0.00015129062,0.000007811122,0.01948066,0.976097,0.0005606535,0.0028816022],"study_design_scores_gemma":[0.00047377447,0.000078769175,0.0016877429,0.0000066021207,0.0000018026151,0.0000016804421,0.000010244222,0.0025420168,0.046121564,0.94888645,0.000096918215,0.00009243899],"about_ca_topic_score_codex":0.00003495947,"about_ca_topic_score_gemma":9.924522e-7,"teacher_disagreement_score":0.027210528,"about_ca_system_score_codex":0.000014479038,"about_ca_system_score_gemma":0.000036151974,"threshold_uncertainty_score":0.36313874},"labels":[],"label_agreement":null},{"id":"W2394985079","doi":"","title":"On the total restrained domination edge critical graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Domination analysis; Dominating set; Mathematics; Combinatorics; Vertex (graph theory); Cardinality (data modeling); Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.016586343730049507,"score_gpt":0.2840400107065568,"score_spread":0.2674536669765073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394985079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96476614,0.0000504164,0.0075472514,0.013687665,0.0019919714,0.00064855925,0.0000016638908,0.00024835797,0.011057949],"genre_scores_gemma":[0.9982691,0.0000025437723,0.0010148596,0.00027758014,0.0000069666225,0.000115911746,0.000001012064,0.000011803609,0.0003002669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983239,0.00026285203,0.00017325908,0.00035027854,0.0004798995,0.00040979026],"domain_scores_gemma":[0.9970583,0.0017408159,0.000035674348,0.0008149034,0.00021780502,0.00013255289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054064026,0.00013818457,0.0001177722,0.00012537275,0.00029109107,0.00023610957,0.0010213299,0.00006359417,0.00011354017],"category_scores_gemma":[0.0010797629,0.00009849278,0.000074829055,0.00061351724,0.00025178245,0.0006026355,0.00023763656,0.0003204658,0.0005388474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056805243,0.000080037236,0.000022223338,0.000003198827,0.0000057958423,0.000006165525,0.00012285859,0.0000042723645,0.0010287727,0.99301064,0.0031696372,0.002540746],"study_design_scores_gemma":[0.00030109793,0.00017285849,0.0039629326,0.00001192588,0.0000014479822,0.0000075282455,0.000027520657,0.003646915,0.0016476811,0.99004006,0.00005688697,0.00012311553],"about_ca_topic_score_codex":0.00000982319,"about_ca_topic_score_gemma":3.1343305e-7,"teacher_disagreement_score":0.033502888,"about_ca_system_score_codex":0.000042157004,"about_ca_system_score_gemma":0.00003818559,"threshold_uncertainty_score":0.6925973},"labels":[],"label_agreement":null},{"id":"W2395152572","doi":"","title":"Total chromatic number of folded hypercubes.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Chromatic scale; Mathematics; Combinatorics","score_opus":0.01213662577506603,"score_gpt":0.269610672308851,"score_spread":0.257474046533785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395152572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907425,0.000051176077,0.0018307648,0.00018954977,0.00063814176,0.0002769209,6.7321577e-7,0.00011272468,0.006157535],"genre_scores_gemma":[0.99138796,0.0000041323924,0.00807722,0.000038900333,0.0000037639682,0.00004379995,8.214658e-7,0.000013243343,0.0004301593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986338,0.000098799144,0.00024645095,0.0002758295,0.00039719584,0.00034794235],"domain_scores_gemma":[0.99860257,0.00021013773,0.00007637422,0.000805951,0.00017794067,0.00012701462],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021752775,0.00012776231,0.00021806241,0.00007812525,0.000069466776,0.00006321829,0.0009275459,0.0000567654,0.00023461836],"category_scores_gemma":[0.00010171189,0.00011794243,0.0000790458,0.00055831415,0.00011396927,0.0007177763,0.00036579292,0.00014234052,0.0009176273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017684986,0.00010431114,0.0022379425,0.000021586817,0.000018713816,0.000004926669,0.00022489014,0.0000041163257,0.005261958,0.9880943,0.0007489657,0.0032765449],"study_design_scores_gemma":[0.00048603798,0.000066919056,0.008144438,0.000020179694,0.0000025623779,0.000028179298,0.000025909878,0.0030166022,0.0076235514,0.9803875,0.000052274267,0.00014581883],"about_ca_topic_score_codex":0.00004588101,"about_ca_topic_score_gemma":3.660415e-7,"teacher_disagreement_score":0.0077067483,"about_ca_system_score_codex":0.000036344045,"about_ca_system_score_gemma":0.000047462352,"threshold_uncertainty_score":0.9998603},"labels":[],"label_agreement":null},{"id":"W2395208292","doi":"","title":"Broadcast domination of products of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Domination analysis; Combinatorics; Vertex (graph theory); Hamming graph; Upper and lower bounds; Graph; Discrete mathematics; Hamming code; Algorithm","score_opus":0.014051285189737034,"score_gpt":0.27427578333410246,"score_spread":0.26022449814436543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395208292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911134,0.00035897153,0.003989661,0.0006375883,0.0006299195,0.00032496086,0.000001796155,0.00007446618,0.0028691862],"genre_scores_gemma":[0.9936835,0.000020348742,0.0061949478,0.000018904246,0.0000020820748,0.0000033587046,0.0000011595563,0.000004524285,0.000071145936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988145,0.00008930424,0.00024983793,0.0002550863,0.00039130088,0.00019993747],"domain_scores_gemma":[0.9986572,0.00008637216,0.00015483936,0.0006627041,0.00038968484,0.000049180726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046675964,0.000090464295,0.00018475957,0.00023006267,0.00003982376,0.000013539701,0.00077930884,0.000039778824,0.0000033010726],"category_scores_gemma":[0.00019428846,0.00008807775,0.000051339848,0.0012076728,0.000100920086,0.00040564412,0.00009708771,0.00010141884,0.0000052244427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015447406,0.00016145567,0.00027007842,0.000016871407,0.0000061928918,0.0000022540103,0.00024878592,0.000008155804,0.02787782,0.9424857,0.00013383281,0.028773444],"study_design_scores_gemma":[0.00042546293,0.0002807939,0.0056714546,0.000018215824,0.0000020355637,0.0000027386764,0.000009015515,0.00024048568,0.17037676,0.82278675,0.00011428777,0.00007198923],"about_ca_topic_score_codex":0.0000034416291,"about_ca_topic_score_gemma":1.5245496e-7,"teacher_disagreement_score":0.14249894,"about_ca_system_score_codex":0.000017617976,"about_ca_system_score_gemma":0.00005155893,"threshold_uncertainty_score":0.35917065},"labels":[],"label_agreement":null},{"id":"W2395366427","doi":"","title":"On fractional (g, f, n)-critical graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013403809083092168,"score_gpt":0.3065653111481694,"score_spread":0.2931615020650772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395366427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9238574,0.00004226396,0.025582856,0.0046502417,0.014493579,0.0002886359,0.0000050929107,0.0006374652,0.03044249],"genre_scores_gemma":[0.9941325,0.0000020337673,0.0053463983,0.00032604672,0.000010673153,0.000021623331,0.0000012173163,0.000011881375,0.00014763487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848014,0.00007463726,0.00013855816,0.00039552935,0.0005343816,0.00037676495],"domain_scores_gemma":[0.99787426,0.000988576,0.000027084094,0.000761517,0.00014642098,0.00020212035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038351023,0.00012521689,0.00011431373,0.00017220332,0.0002285717,0.00011236911,0.0009776213,0.0000902074,0.00013926187],"category_scores_gemma":[0.0006867248,0.000120214936,0.00007443684,0.00049067824,0.00020132323,0.0004902864,0.0001959016,0.00076056697,0.00047690372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103361135,0.00014323845,0.00036967412,0.0000022862805,0.000005532905,0.00002133228,0.000024409168,0.0000025386698,0.001969065,0.994245,0.0013625275,0.0018440381],"study_design_scores_gemma":[0.00029653206,0.00012075584,0.001954153,0.0000043826017,0.0000011077209,0.00001762529,0.0000027597016,0.0008607454,0.0022572286,0.9916891,0.0026570726,0.0001385728],"about_ca_topic_score_codex":0.0000029952503,"about_ca_topic_score_gemma":0.0000015347674,"teacher_disagreement_score":0.07027511,"about_ca_system_score_codex":0.000018740735,"about_ca_system_score_gemma":0.000058222482,"threshold_uncertainty_score":0.6129792},"labels":[],"label_agreement":null},{"id":"W2395431039","doi":"","title":"Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian path problem; Hamiltonian (control theory); Hamiltonian path; Indifference graph; Chordal graph; Combinatorics; Pancyclic graph; 1-planar graph; Graph; Mathematical optimization","score_opus":0.014352649610265684,"score_gpt":0.2559067875107385,"score_spread":0.24155413790047278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395431039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99284875,0.00028071692,0.00059833727,0.0016676404,0.0010049936,0.0006087008,0.0000034366863,0.0005124469,0.002474983],"genre_scores_gemma":[0.99610066,0.00007416104,0.002986691,0.0005098075,0.0000036931115,0.00010768684,0.0000032009746,0.0000343513,0.0001797329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973353,0.00022438157,0.00030484117,0.00082320505,0.0005441768,0.0007680766],"domain_scores_gemma":[0.9972399,0.0007944402,0.00010437549,0.001247266,0.00024290608,0.00037113612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038382824,0.00034751173,0.00033649834,0.00048562337,0.00038514042,0.00036705018,0.001266306,0.0001417832,0.00004854537],"category_scores_gemma":[0.00029787348,0.00031077585,0.000111452624,0.0013170479,0.00032099357,0.00090811664,0.000446331,0.00045236346,0.0003356987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010553731,0.0001102242,0.0038755415,0.000011870065,0.000031724114,0.00002019901,0.0002621724,0.0000043610517,0.0027546678,0.9816066,0.00062884437,0.010683221],"study_design_scores_gemma":[0.0009000529,0.0003517432,0.047676675,0.000034041313,0.0000042432634,0.0000146300135,0.000022156559,0.0011577512,0.004463826,0.9446072,0.00040509124,0.00036258393],"about_ca_topic_score_codex":0.00011536744,"about_ca_topic_score_gemma":0.000014848954,"teacher_disagreement_score":0.043801133,"about_ca_system_score_codex":0.000044131048,"about_ca_system_score_gemma":0.000050131795,"threshold_uncertainty_score":0.99993443},"labels":[],"label_agreement":null},{"id":"W2395515199","doi":"","title":"Equality of Domination and Inverse Domination Numbers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Domination analysis; Vertex (graph theory); Inverse; Combinatorics; Tamil; Graph; Cardinality (data modeling); Computer science; Database","score_opus":0.014905004661871913,"score_gpt":0.29407056282698424,"score_spread":0.27916555816511235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395515199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886452,0.000013523443,0.0070152427,0.00027814982,0.0010317694,0.00017393012,0.0000015038008,0.000054826836,0.0027858373],"genre_scores_gemma":[0.9912376,0.000007096253,0.0085870335,0.00002802048,0.0000045086763,0.00001012214,0.0000018443102,0.0000060750235,0.00011772556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989345,0.00012414553,0.0001939782,0.00026035772,0.00031052553,0.0001764864],"domain_scores_gemma":[0.9988378,0.00026410408,0.00011771425,0.00047873994,0.00021538541,0.00008622799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010412093,0.00008882464,0.00013468141,0.00013155935,0.000086318156,0.000043687047,0.00045320785,0.00007703231,0.000013195868],"category_scores_gemma":[0.00032756955,0.00009016133,0.000032783293,0.00041114827,0.00018413608,0.0006796198,0.0002388777,0.0002218868,0.000012565319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010760712,0.0000560127,0.0019228866,0.0000151879885,0.0000053705166,0.0000014601904,0.00048778305,9.1044285e-7,0.02076622,0.9676395,0.0000860078,0.009007871],"study_design_scores_gemma":[0.0008204772,0.00005748572,0.007128479,0.0000064040773,0.00000276915,0.000004799403,0.00003571082,0.003101261,0.028706672,0.959664,0.00036650783,0.00010544664],"about_ca_topic_score_codex":0.00003104301,"about_ca_topic_score_gemma":0.000027603834,"teacher_disagreement_score":0.008902425,"about_ca_system_score_codex":0.000020532561,"about_ca_system_score_gemma":0.000038789447,"threshold_uncertainty_score":0.36766726},"labels":[],"label_agreement":null},{"id":"W2395608997","doi":"","title":"Signed total k-domination in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010246913771740866,"score_gpt":0.25610357869985884,"score_spread":0.24585666492811797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395608997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98974925,0.00007141009,0.0047597503,0.00059746776,0.00077362196,0.00042901604,3.4848497e-7,0.00013290861,0.0034862482],"genre_scores_gemma":[0.99693596,0.0000041835074,0.0026214086,0.000060394977,0.0000022130973,0.00009769824,0.0000013727868,0.000009882202,0.00026686338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862665,0.00014185786,0.00019772159,0.00033517208,0.0003243177,0.00037430567],"domain_scores_gemma":[0.9990185,0.00019666967,0.000049546066,0.00050863525,0.00012508137,0.00010155817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003728258,0.000117074196,0.000139205,0.00030029166,0.00007394478,0.00011985478,0.00074053963,0.000060063583,0.000051678206],"category_scores_gemma":[0.00011719433,0.000116980904,0.00004780114,0.001034004,0.00006563379,0.0011367651,0.00024382136,0.00018464694,0.0003188291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034555283,0.00007854158,0.0015065484,0.000003839784,0.0000035390487,0.000008510649,0.00020007325,0.000012841967,0.002912658,0.9854705,0.0003093305,0.009490203],"study_design_scores_gemma":[0.0007016762,0.000083686995,0.020020392,0.000008673267,5.462499e-7,0.0000044784338,0.000025440664,0.0053340746,0.0027024827,0.9709411,0.00003812996,0.00013928869],"about_ca_topic_score_codex":0.000049301918,"about_ca_topic_score_gemma":0.0000033556034,"teacher_disagreement_score":0.018513843,"about_ca_system_score_codex":0.00006350338,"about_ca_system_score_gemma":0.00003391495,"threshold_uncertainty_score":0.4770343},"labels":[],"label_agreement":null},{"id":"W2395706617","doi":"","title":"Trees with the second and third largest number of maximal independent sets.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.010027530289241016,"score_gpt":0.26499360853963644,"score_spread":0.2549660782503954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395706617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927817,0.000119514945,0.00049849984,0.0010472274,0.000113996546,0.0001597581,0.0000027828855,0.00004566561,0.005230861],"genre_scores_gemma":[0.99798834,0.000008463235,0.0013727376,0.0001666503,0.0000019531747,0.0000061430046,6.007502e-7,0.000006453746,0.0004486592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988436,0.0001008541,0.00012840753,0.00027412805,0.00037994332,0.00027306174],"domain_scores_gemma":[0.99905264,0.00014833386,0.00007511662,0.0005496413,0.00009270149,0.0000815583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040646415,0.0001229484,0.00015895799,0.000048415946,0.00012519614,0.000072200186,0.0007316278,0.000047267127,0.000026140568],"category_scores_gemma":[0.000016618591,0.000079595906,0.000030397467,0.00035602244,0.0001523137,0.00035473885,0.00018137893,0.00023635551,0.000012659836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003026352,0.000078618075,0.008680406,0.00000571064,0.000016355052,0.00001969061,0.0005246345,0.0000025361996,0.00044043394,0.98734397,0.00036273105,0.0024946795],"study_design_scores_gemma":[0.00084163394,0.00029036356,0.08402599,0.000012834733,0.0000039142665,0.00006218593,0.00008263247,0.00021482981,0.0031675522,0.9103619,0.0007978436,0.00013831395],"about_ca_topic_score_codex":0.0000045387283,"about_ca_topic_score_gemma":0.000019921692,"teacher_disagreement_score":0.076982036,"about_ca_system_score_codex":0.000015761318,"about_ca_system_score_gemma":0.000041284584,"threshold_uncertainty_score":0.32458267},"labels":[],"label_agreement":null},{"id":"W2395847372","doi":"","title":"On questions on (total) domination vertex critical graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.010794027808564482,"score_gpt":0.3019416141110427,"score_spread":0.2911475863024782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395847372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9689793,0.000021243102,0.0066745323,0.0033487778,0.007837654,0.0003388637,0.0000048903858,0.00043513198,0.01235961],"genre_scores_gemma":[0.9973846,0.0000030346603,0.0021601596,0.00022366049,0.0000073450346,0.0000446181,0.0000023537232,0.000016004129,0.00015822552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982839,0.00014733741,0.00017238106,0.00046820834,0.0005375061,0.00039065216],"domain_scores_gemma":[0.9973749,0.0012525914,0.000035310146,0.00093617727,0.00019770997,0.0002033134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048120634,0.00016083392,0.00014176167,0.00029248913,0.00030510328,0.00013703894,0.0008100598,0.00011375434,0.00004085185],"category_scores_gemma":[0.0014157445,0.00015527934,0.00008006624,0.0006337572,0.00021093703,0.0004461258,0.0001535302,0.000691863,0.0004276781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018486367,0.0002721051,0.000054086297,0.0000038897433,0.0000051310617,0.000017580673,0.00007005258,0.0000090034655,0.0024442223,0.99136114,0.00062541064,0.0051189093],"study_design_scores_gemma":[0.00048207978,0.0003674278,0.0025962333,0.000020421818,0.0000024383685,0.000011538926,0.0000043003047,0.0025336184,0.003719497,0.98978156,0.00030907962,0.00017180336],"about_ca_topic_score_codex":0.0000055230553,"about_ca_topic_score_gemma":0.000003203553,"teacher_disagreement_score":0.028405301,"about_ca_system_score_codex":0.0000442642,"about_ca_system_score_gemma":0.00005132956,"threshold_uncertainty_score":0.6332108},"labels":[],"label_agreement":null},{"id":"W2395855926","doi":"","title":"Connected even factors in {K 1, l , K 1, l +e}-free graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.015237217422907135,"score_gpt":0.26248963372693973,"score_spread":0.2472524163040326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395855926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868706,0.00015199541,0.0055911914,0.00083132193,0.001989169,0.00025961405,0.000002539783,0.00031363397,0.003989919],"genre_scores_gemma":[0.997793,0.000011118,0.0018161066,0.000099053665,0.000003896076,0.000021051928,0.0000030944404,0.000018416984,0.0002342154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979227,0.00034320305,0.00025136233,0.00048410043,0.0004247486,0.0005738506],"domain_scores_gemma":[0.99764395,0.00059502135,0.0000696242,0.0014109357,0.00010810521,0.00017235205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007228953,0.00018674588,0.00024682793,0.0003674931,0.0000996749,0.00008491086,0.0022162201,0.00010138311,0.000020904487],"category_scores_gemma":[0.0007806523,0.00018276993,0.00007657126,0.001414976,0.00011898847,0.0006232591,0.00058257417,0.00033368595,0.00005352279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061085693,0.000076802644,0.01298279,0.0000067384435,0.0000073168485,0.000008981602,0.00024553147,0.0000125783245,0.00036109882,0.983867,0.0008321511,0.0015928879],"study_design_scores_gemma":[0.0011085237,0.00012082741,0.020726021,0.000018535173,0.0000013031748,0.000003129054,0.00001989662,0.0015372036,0.002300466,0.9720578,0.0018899428,0.00021632842],"about_ca_topic_score_codex":0.000057442572,"about_ca_topic_score_gemma":0.00003137553,"teacher_disagreement_score":0.011809191,"about_ca_system_score_codex":0.000062517,"about_ca_system_score_gemma":0.000044156877,"threshold_uncertainty_score":0.7453141},"labels":[],"label_agreement":null},{"id":"W2395940650","doi":"","title":"Hamilton Cycles in Cubic Polyhex Graphs on the Klein Bottle.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Klein bottle; Mathematics; Bottle; Combinatorics; Cubic graph; Geometry; Graph; Composite material; Materials science; Line graph","score_opus":0.017187316849342375,"score_gpt":0.2631006797914168,"score_spread":0.24591336294207444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395940650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905374,0.00017298038,0.0002735803,0.0025632996,0.00080593297,0.0005134438,8.243461e-7,0.00014449892,0.004988034],"genre_scores_gemma":[0.9986942,0.00006021271,0.0003919594,0.00046392213,0.000004656061,0.0001330879,8.580535e-7,0.000018538884,0.00023257233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979033,0.00032203348,0.0002441458,0.000464903,0.0004901598,0.0005754819],"domain_scores_gemma":[0.9978256,0.0006695259,0.00007016948,0.0012335846,0.000079617035,0.00012145293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000619609,0.00019325543,0.00018438826,0.00027391562,0.00018896666,0.00019106321,0.0018717266,0.0000759137,0.000051766307],"category_scores_gemma":[0.00014119217,0.0001395126,0.00008440935,0.0011786368,0.00017466542,0.0005465921,0.00029449238,0.00045067046,0.0006603394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052490523,0.000099544704,0.002312679,0.0000033613253,0.0000074664995,0.000011415982,0.00029290433,0.0000160758,0.0010704893,0.9918096,0.0014411116,0.0029300768],"study_design_scores_gemma":[0.00038430732,0.00011457806,0.0205097,0.0000270845,8.649747e-7,0.0000030175165,0.0000541481,0.0019913604,0.0037905138,0.9724896,0.00046349037,0.0001713597],"about_ca_topic_score_codex":0.00012946605,"about_ca_topic_score_gemma":0.000016250166,"teacher_disagreement_score":0.01932005,"about_ca_system_score_codex":0.00006581978,"about_ca_system_score_gemma":0.000040266164,"threshold_uncertainty_score":0.84875476},"labels":[],"label_agreement":null},{"id":"W2395992115","doi":"","title":"Hamiltonicity of transformation graph G","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Graph; Combinatorics; Chemistry; Gene; Biochemistry","score_opus":0.013523889369996234,"score_gpt":0.25909371013837557,"score_spread":0.24556982076837933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395992115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92791104,0.0000991199,0.06272,0.00044062294,0.0005390204,0.00039984335,0.0000011994657,0.00013638545,0.007752746],"genre_scores_gemma":[0.99665666,0.00001879032,0.0031989953,0.000040252122,0.0000010614649,0.000030181667,0.0000011325884,0.0000054936477,0.00004742407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998998,0.00008010996,0.00021147175,0.0001710895,0.00030340822,0.00023593259],"domain_scores_gemma":[0.99908453,0.00010012461,0.00006346215,0.00048826385,0.00018516266,0.000078446225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026995837,0.00008516553,0.00012968041,0.00014172492,0.00007049014,0.00004130126,0.00076803274,0.0000444359,0.000032524924],"category_scores_gemma":[0.000033778775,0.000079210105,0.00006532174,0.0006129999,0.00008619294,0.0010760009,0.00009087087,0.00012592757,0.000095469004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021838855,0.000049157745,0.00031591416,0.000013590432,0.0000073440547,4.965337e-7,0.0003695806,0.000014488244,0.002697241,0.9902589,0.00015803965,0.006113091],"study_design_scores_gemma":[0.0003516097,0.00008231784,0.004500927,0.00000994539,0.0000011932084,0.0000019119054,0.000023563296,0.0029163184,0.022203293,0.96971,0.000114082184,0.00008484151],"about_ca_topic_score_codex":0.000041311687,"about_ca_topic_score_gemma":0.0000011230808,"teacher_disagreement_score":0.06874561,"about_ca_system_score_codex":0.000020578542,"about_ca_system_score_gemma":0.000029766788,"threshold_uncertainty_score":0.32300943},"labels":[],"label_agreement":null},{"id":"W2396084200","doi":"","title":"Extremal polyphenyl chains concerning k-matchings and k-independent sets","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01543485829817315,"score_gpt":0.27582726063342067,"score_spread":0.2603924023352475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396084200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905625,0.00011829224,0.0045378474,0.000558105,0.0017870232,0.00019194279,0.0000019153001,0.00022668428,0.0020156829],"genre_scores_gemma":[0.9935906,0.000010141459,0.005891571,0.0001366065,0.00000998942,0.000016587219,0.0000012917128,0.000020207539,0.00032304093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818134,0.00009351048,0.00019890226,0.0005352921,0.00048045523,0.00051051273],"domain_scores_gemma":[0.9985885,0.00025612733,0.00008913629,0.00070299505,0.00009574968,0.00026747107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066195085,0.00019025075,0.00020064028,0.00013635421,0.0003051633,0.00022171736,0.0010045993,0.00010647699,0.000030303263],"category_scores_gemma":[0.00014201053,0.00018651609,0.00005097194,0.0003121463,0.0001766302,0.0006756237,0.0007197188,0.0006910678,0.000047946338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007725988,0.000038459613,0.003925279,0.0000074129334,0.000011486244,0.00004047269,0.0011206915,0.0000020212117,0.0130385,0.9726264,0.000063807754,0.009117727],"study_design_scores_gemma":[0.0009541037,0.00010184652,0.0074700895,0.000017015473,0.0000035761825,0.000085497,0.000095345735,0.007058652,0.0038625475,0.9789563,0.0010837759,0.00031124387],"about_ca_topic_score_codex":0.000028011984,"about_ca_topic_score_gemma":0.000017168906,"teacher_disagreement_score":0.009175953,"about_ca_system_score_codex":0.000028070514,"about_ca_system_score_gemma":0.00007130027,"threshold_uncertainty_score":0.7605905},"labels":[],"label_agreement":null},{"id":"W2396161277","doi":"","title":"Up-embeddable graphs via the degree-sum of nonadjacent vertices: non-simple graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Simple (philosophy); Discrete mathematics; Physics","score_opus":0.023782001337334224,"score_gpt":0.2798523484529674,"score_spread":0.2560703471156332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396161277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98052186,0.00021812783,0.009722108,0.00043709434,0.005059646,0.00067502394,0.0000067821343,0.00017264938,0.0031867025],"genre_scores_gemma":[0.99709874,0.00003428212,0.002472552,0.00014245928,0.000008009028,0.000061936866,0.0000036558747,0.000029451827,0.00014891331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720806,0.00017017203,0.0004325873,0.00058379356,0.0008275952,0.0007778032],"domain_scores_gemma":[0.99651754,0.0005269967,0.00020716323,0.0021261605,0.00037374292,0.00024839715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011243385,0.00028088386,0.0003369018,0.00024641512,0.00039128328,0.000121362216,0.0032093402,0.00013576986,0.000056616867],"category_scores_gemma":[0.00015542214,0.0002106553,0.00021289127,0.0016715444,0.00048299338,0.0006738722,0.0007599244,0.00073831977,0.00007916282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028645114,0.00016893451,0.004384425,0.000024552442,0.000047816284,0.000009171619,0.0005154685,0.000010895722,0.013322416,0.97336453,0.0011812486,0.0069419243],"study_design_scores_gemma":[0.0008601207,0.00017610224,0.0047657546,0.000014128275,0.000012238665,0.0000127752,0.00005640571,0.003880911,0.027070347,0.9603938,0.002496855,0.00026056846],"about_ca_topic_score_codex":0.00017001893,"about_ca_topic_score_gemma":0.00011350691,"teacher_disagreement_score":0.016576873,"about_ca_system_score_codex":0.000028892757,"about_ca_system_score_gemma":0.00013705582,"threshold_uncertainty_score":0.8590274},"labels":[],"label_agreement":null},{"id":"W2396209512","doi":"","title":"Edge-choosability of planar graphs without chordal 7-Cycles.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Planar graph; Outerplanar graph; Enhanced Data Rates for GSM Evolution; Combinatorics; Planar; Pathwidth; Computer science; Graph; Telecommunications; Line graph","score_opus":0.02951463565057108,"score_gpt":0.27835382407437037,"score_spread":0.2488391884237993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396209512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97963154,0.00015661327,0.0061110766,0.00007067997,0.0012920878,0.00036849373,0.0000056891595,0.0002242522,0.012139572],"genre_scores_gemma":[0.98791385,0.000013230129,0.011909944,0.000034147433,0.0000035186815,0.000022393486,0.0000014010852,0.00001626675,0.00008526072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998001,0.0002108193,0.00034193214,0.0005156969,0.0004698991,0.00046065252],"domain_scores_gemma":[0.9979266,0.00016467745,0.00013641952,0.0013717924,0.00019666042,0.0002038842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075713143,0.00018961454,0.00030464964,0.00019146233,0.00011329358,0.00002615612,0.0017596042,0.00009095291,0.000047901714],"category_scores_gemma":[0.00016327125,0.00017997251,0.00012576087,0.0007747611,0.000374151,0.0005397826,0.0003182102,0.00028973148,0.000052547894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042203686,0.00023139514,0.07055273,0.000019055675,0.00002426513,0.000008256774,0.00061851245,4.778293e-7,0.0005441064,0.92555517,0.00016725929,0.0022365793],"study_design_scores_gemma":[0.00059450686,0.00019364001,0.055511966,0.0000148725385,0.0000045120137,0.0000061415176,0.000031326395,0.0001242517,0.011488639,0.931695,0.0001538001,0.00018134699],"about_ca_topic_score_codex":0.00006981678,"about_ca_topic_score_gemma":0.000006731892,"teacher_disagreement_score":0.015040763,"about_ca_system_score_codex":0.000041762098,"about_ca_system_score_gemma":0.0000849242,"threshold_uncertainty_score":0.73390657},"labels":[],"label_agreement":null},{"id":"W2396221740","doi":"","title":"Hamilton-Connectivity of Claw-Free Graphs with Bounded Dilworth Numbers.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Bounded function; Combinatorics; Mathematical analysis; Biology; Ecology","score_opus":0.021254876623232465,"score_gpt":0.24769977161974074,"score_spread":0.22644489499650827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396221740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97065127,0.000078395395,0.0099843005,0.000054083015,0.00064949755,0.00033584927,0.000004437443,0.00022226409,0.018019885],"genre_scores_gemma":[0.9874279,0.000013886239,0.012342576,0.000045012363,0.0000025784118,0.00003093703,0.0000011883382,0.000024319676,0.00011159515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784523,0.00019877545,0.00026559635,0.00056415715,0.00059202843,0.00053422636],"domain_scores_gemma":[0.9970842,0.00023988319,0.00017869684,0.0020392663,0.00026829343,0.00018966403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713393,0.00023069176,0.00034384872,0.00021050335,0.00017202344,0.000047914426,0.0022282724,0.00008941794,0.000028119406],"category_scores_gemma":[0.00010753565,0.00020140204,0.000107802975,0.0012559396,0.00045067669,0.00081660267,0.00048166467,0.00032119153,0.000021679636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009056097,0.00027472546,0.024105664,0.00001839627,0.00005794929,0.000037040096,0.0012111694,0.0000015839612,0.00016903793,0.9731303,0.00015002555,0.00075357186],"study_design_scores_gemma":[0.0013458715,0.00047509774,0.02042344,0.00002725346,0.000008104942,0.000017271386,0.000044538454,0.00015125412,0.00925683,0.9678474,0.0001507588,0.00025220166],"about_ca_topic_score_codex":0.00016744454,"about_ca_topic_score_gemma":0.00009439521,"teacher_disagreement_score":0.01790829,"about_ca_system_score_codex":0.000047049365,"about_ca_system_score_gemma":0.00011331883,"threshold_uncertainty_score":0.82129365},"labels":[],"label_agreement":null},{"id":"W2396222681","doi":"","title":"Molds of regular tournaments.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.012643959749659733,"score_gpt":0.262233958986099,"score_spread":0.2495899992364393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396222681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98240453,0.00022570942,0.009011501,0.00068015826,0.00093897263,0.0003456727,6.31321e-7,0.0001238834,0.0062689665],"genre_scores_gemma":[0.98816603,0.000014905477,0.011240631,0.00004773238,0.000002629319,0.00002567698,3.8304202e-7,0.000009290939,0.00049271743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879205,0.00009624398,0.00020024735,0.00023965031,0.000381481,0.0002903306],"domain_scores_gemma":[0.9986916,0.000119837445,0.00008450184,0.00079693575,0.00019141071,0.00011572117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029134008,0.00009626791,0.0001562879,0.000119286415,0.000061405764,0.000049164566,0.0011555918,0.00004608552,0.000060102906],"category_scores_gemma":[0.000084191655,0.000089491004,0.00006012573,0.0004901893,0.00008885288,0.00061185996,0.00035827627,0.00012871643,0.00008436947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001726356,0.000060460057,0.00069381914,0.0000064089295,0.000012722437,0.000004034381,0.00008362031,0.0000029203486,0.0031577558,0.9864752,0.0014010591,0.0081002675],"study_design_scores_gemma":[0.00034044991,0.00010001047,0.002291649,0.000011909699,0.0000012425241,0.0000037829213,0.000018138937,0.0005641206,0.015206813,0.98088664,0.0004823484,0.000092921],"about_ca_topic_score_codex":0.00002022724,"about_ca_topic_score_gemma":2.2437142e-7,"teacher_disagreement_score":0.012049057,"about_ca_system_score_codex":0.000033783763,"about_ca_system_score_gemma":0.00002918984,"threshold_uncertainty_score":0.36493373},"labels":[],"label_agreement":null},{"id":"W2396482382","doi":"","title":"An operation based on complete graphs with an application to the line graphs of trees.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line (geometry); Pathwidth; Combinatorics; 1-planar graph; Indifference graph; Chordal graph; Line graph; Graph; Geometry","score_opus":0.020715606604939138,"score_gpt":0.2927934108021639,"score_spread":0.27207780419722477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396482382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70808494,0.000029274099,0.28944167,0.0007380146,0.0003140806,0.0009372866,0.000009683915,0.0001394043,0.00030566927],"genre_scores_gemma":[0.9911566,0.0000014205016,0.008329001,0.000344138,0.000008726628,0.00011523354,0.000022309123,0.00001654885,0.0000060638044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836576,0.00028381878,0.00018945635,0.0003381165,0.0004960836,0.00032677437],"domain_scores_gemma":[0.99793047,0.000134126,0.000085551204,0.001443078,0.0001856884,0.0002210957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083957583,0.00014808592,0.00015310448,0.00021149471,0.00021438308,0.00006408464,0.0011449459,0.00004177563,0.0000045893494],"category_scores_gemma":[0.000021844135,0.0001024444,0.000037170026,0.0010628782,0.00009629122,0.0007222146,0.00006483808,0.00015542799,0.000020302235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008745015,0.00040018908,0.0035374716,0.0000039939564,0.0000066429834,3.8807735e-7,0.00037566994,0.0041262135,0.004489167,0.9816648,0.00003116605,0.005276859],"study_design_scores_gemma":[0.0018635208,0.00507873,0.050956164,0.000032311196,0.000015552489,0.0000046054233,0.000111386405,0.29855525,0.020887313,0.62095845,0.0010403978,0.00049633574],"about_ca_topic_score_codex":0.000029929832,"about_ca_topic_score_gemma":0.000049004208,"teacher_disagreement_score":0.36070636,"about_ca_system_score_codex":0.000027708056,"about_ca_system_score_gemma":0.00003683177,"threshold_uncertainty_score":0.41775614},"labels":[],"label_agreement":null},{"id":"W2396520109","doi":"","title":"On The Tree Domination Number Of A Random Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory); Graph; Random graph; Discrete mathematics","score_opus":0.024008109633209703,"score_gpt":0.2956903190151385,"score_spread":0.2716822093819288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396520109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.953268,0.000062312516,0.017513357,0.0014603841,0.001273164,0.00044053537,0.0000014823003,0.00009958176,0.025881216],"genre_scores_gemma":[0.9987309,0.0000042589463,0.000920587,0.00008217585,0.0000033390895,0.000031405107,6.938964e-7,0.000007845088,0.00021877227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985741,0.0002965414,0.00017078195,0.00021244833,0.0005406297,0.0002054943],"domain_scores_gemma":[0.9980365,0.0008488596,0.00009044897,0.00070034753,0.00023450637,0.000089357105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001239074,0.00009827954,0.00014821785,0.00008834153,0.000075476586,0.000041409516,0.0009802864,0.00004047012,0.000013276705],"category_scores_gemma":[0.000539366,0.000066820394,0.00007253059,0.00072038075,0.00012744544,0.0002576695,0.00017160292,0.00015541595,0.000099637386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082746956,0.00008056106,0.00030952523,0.000002302344,0.00001163616,0.0000033502288,0.00040535288,0.0000176654,0.00011998183,0.9947571,0.0018485263,0.0023612585],"study_design_scores_gemma":[0.002212156,0.000105964056,0.00029051572,0.000011658816,0.0000023911223,0.0000041105286,0.000041623243,0.0014130995,0.003907461,0.991685,0.00024957748,0.00007648547],"about_ca_topic_score_codex":0.000008338421,"about_ca_topic_score_gemma":0.0000016157489,"teacher_disagreement_score":0.045462955,"about_ca_system_score_codex":0.000034637647,"about_ca_system_score_gemma":0.000056277397,"threshold_uncertainty_score":0.27248564},"labels":[],"label_agreement":null},{"id":"W2396687675","doi":"","title":"Properties of total restrained domination vertex critical graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.038530119723588774,"score_gpt":0.2966074414444802,"score_spread":0.25807732172089143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396687675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907308,0.0003111019,0.0038820552,0.00089969754,0.0015611966,0.00023014488,0.0000015425835,0.00014143888,0.0022420269],"genre_scores_gemma":[0.9971039,0.0000030268757,0.0027356807,0.000023374238,0.0000030997892,0.000019520085,8.465289e-7,0.000009710208,0.00010079802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984604,0.00017734355,0.00022787284,0.00027872418,0.0005612424,0.00029439267],"domain_scores_gemma":[0.9986266,0.00014893254,0.000047733167,0.00052665477,0.00047011065,0.00017996268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006397774,0.00011259786,0.0001757423,0.0001677707,0.00006777031,0.00005508141,0.00061021897,0.000061460225,0.0000035187395],"category_scores_gemma":[0.001148274,0.00010051212,0.000057222034,0.0005799843,0.00029082134,0.0006772514,0.00025549132,0.00015312439,0.0000244411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039401144,0.000115073955,0.00014204798,0.000018477996,0.000008045128,0.000010171642,0.0005223241,0.0000074281656,0.006706886,0.99053955,0.00027283552,0.0016177401],"study_design_scores_gemma":[0.0007778283,0.00028370434,0.00058269646,0.000032807377,0.000003128633,0.000014084347,0.00008916567,0.003187829,0.03069558,0.96416676,0.000039313414,0.00012710853],"about_ca_topic_score_codex":0.000011809315,"about_ca_topic_score_gemma":7.452755e-7,"teacher_disagreement_score":0.026372815,"about_ca_system_score_codex":0.000046643923,"about_ca_system_score_gemma":0.00013679828,"threshold_uncertainty_score":0.40987656},"labels":[],"label_agreement":null},{"id":"W2396751065","doi":"","title":"Maximum Packings of Complete Graphs with Octagons.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014019520243766188,"score_gpt":0.25703634742635195,"score_spread":0.24301682718258577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396751065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878032,0.00003377039,0.006543937,0.00033125142,0.0010257391,0.00025336107,0.0000052673777,0.00017203404,0.0038314369],"genre_scores_gemma":[0.983659,0.000004346076,0.01617443,0.00006396819,0.0000030434055,0.000015303092,0.000001947333,0.000018187571,0.000059770442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983891,0.00007166635,0.00021595982,0.00039659723,0.00050632417,0.0004203342],"domain_scores_gemma":[0.99808645,0.0002196304,0.00013112821,0.0011372013,0.0002667576,0.00015880221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043077912,0.00016818997,0.00024249764,0.00021394053,0.0001316208,0.00006250529,0.0014877903,0.000069328154,0.00002547701],"category_scores_gemma":[0.00006984376,0.0001418216,0.00007094664,0.00095964404,0.0003795804,0.00044255657,0.00033016346,0.0004518892,0.000034468318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022054935,0.00008050515,0.005663912,0.000012397984,0.000019725072,0.000017178525,0.00017689401,0.000002083013,0.0141025195,0.97741145,0.00013465964,0.002356637],"study_design_scores_gemma":[0.00076407334,0.00024079157,0.0045577227,0.000014966312,0.0000037578486,0.000024985502,0.000016622647,0.00031976536,0.011639651,0.9806905,0.0015417179,0.00018546688],"about_ca_topic_score_codex":0.00002057538,"about_ca_topic_score_gemma":0.000012561721,"teacher_disagreement_score":0.009630494,"about_ca_system_score_codex":0.000011619691,"about_ca_system_score_gemma":0.00007348048,"threshold_uncertainty_score":0.57833165},"labels":[],"label_agreement":null},{"id":"W2396789099","doi":"","title":"Uniquely colorable graphs on surfaces","year":2014,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.026336558821799402,"score_gpt":0.28627553334482503,"score_spread":0.2599389745230256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396789099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87325466,0.0039091352,0.0040031443,0.011917358,0.020715903,0.00095830805,0.000017506796,0.0005739191,0.08465006],"genre_scores_gemma":[0.9785408,0.00028134746,0.0028112668,0.00066067977,0.000012827633,0.000034430283,0.0000034489553,0.000053622243,0.017601607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541,0.0012632072,0.0003981102,0.0009187633,0.00083316636,0.0011767196],"domain_scores_gemma":[0.9960253,0.0014159656,0.00017720275,0.0015282423,0.00040595548,0.00044729313],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002131311,0.00040730493,0.00045464534,0.00028168797,0.00049413554,0.00039039186,0.0019587239,0.0002673843,0.00013870667],"category_scores_gemma":[0.0005085814,0.00043815485,0.0001735399,0.0017276496,0.0006437025,0.00095714047,0.00052466465,0.0008017899,0.0014218285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005275782,0.00037878985,0.0008838029,0.000055365963,0.000040568717,0.00003763463,0.00029473746,0.00048392316,0.0003118684,0.9804928,0.0064971587,0.010470596],"study_design_scores_gemma":[0.0009153659,0.0012952732,0.0012994638,0.00014489805,0.000010350795,0.00001174724,0.000024167084,0.012324051,0.0036389783,0.9097958,0.0701101,0.00042977824],"about_ca_topic_score_codex":0.00013607607,"about_ca_topic_score_gemma":0.000019498451,"teacher_disagreement_score":0.10528611,"about_ca_system_score_codex":0.00014875778,"about_ca_system_score_gemma":0.00018332532,"threshold_uncertainty_score":0.999807},"labels":[],"label_agreement":null},{"id":"W2396910810","doi":"","title":"Signed cycle domination numbers of digraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.007712485541944295,"score_gpt":0.25763933095743385,"score_spread":0.24992684541548957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396910810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86170924,0.00006443236,0.11682702,0.00037397057,0.0012694835,0.00029680473,0.0000014360606,0.00022129396,0.019236298],"genre_scores_gemma":[0.99516124,0.00000447164,0.004659592,0.00004064743,0.00000357375,0.0000132170735,0.0000014454045,0.000010227028,0.000105604995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986494,0.00018687443,0.00021010543,0.00028832201,0.00039636725,0.00026892696],"domain_scores_gemma":[0.9986059,0.00035224008,0.00011089195,0.00067494466,0.00016128292,0.00009472364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067337614,0.00010768425,0.00017427151,0.00016882745,0.00009012789,0.000039289374,0.00092226063,0.000054522083,0.000011712202],"category_scores_gemma":[0.00021113276,0.00010745836,0.00007617722,0.00073671894,0.00012058747,0.00046549673,0.00019690728,0.00011395208,0.000040097213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009500467,0.000068109504,0.0007935676,0.000010293846,0.0000090744825,0.0000011753602,0.00022176011,0.000027295384,0.0031607049,0.98535633,0.00014399421,0.010198166],"study_design_scores_gemma":[0.0006912577,0.0001369009,0.0018400976,0.000011896388,0.0000024489914,0.0000017205173,0.000014940795,0.005410337,0.017769648,0.9735889,0.0004110726,0.000120807745],"about_ca_topic_score_codex":0.000016082851,"about_ca_topic_score_gemma":0.000002216845,"teacher_disagreement_score":0.13345195,"about_ca_system_score_codex":0.000026636015,"about_ca_system_score_gemma":0.000025612393,"threshold_uncertainty_score":0.4382025},"labels":[],"label_agreement":null},{"id":"W2396958062","doi":"","title":"Unicyclic graphs with equal total and total outer-connected domination numbers.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Domination analysis; Vertex (graph theory); Induced subgraph; Graph; Cardinality (data modeling); Connectivity; Discrete mathematics; Computer science","score_opus":0.017967320349802873,"score_gpt":0.26817489131317584,"score_spread":0.250207570963373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396958062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98637056,0.00010174181,0.010322951,0.00027521758,0.0006622448,0.00027057718,0.0000023716796,0.0002095681,0.001784747],"genre_scores_gemma":[0.994977,0.000004004897,0.004672361,0.000042279364,0.0000070431106,0.000026391303,0.0000054129923,0.000019361052,0.00024617597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813414,0.00019586498,0.00019569902,0.0005039554,0.0005395791,0.0004307615],"domain_scores_gemma":[0.99852157,0.00021424847,0.00009050089,0.0005945851,0.0002605472,0.00031855478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000510944,0.00020065845,0.0002195124,0.00020564483,0.00013817335,0.00017771318,0.00050847017,0.0000831105,0.0000043885434],"category_scores_gemma":[0.00013271646,0.00017818826,0.00003841433,0.000872767,0.00019232238,0.0010093983,0.00037104418,0.00024740424,0.00003073011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005795844,0.00009124323,0.0016417095,0.0000059761123,0.000028714176,0.000063942236,0.00091695244,0.000014966831,0.0002658714,0.9875627,0.0001654977,0.009184464],"study_design_scores_gemma":[0.00354348,0.00073598366,0.0037574375,0.000023286702,0.000009118635,0.00023043262,0.00020526715,0.0055754273,0.0017540307,0.9836891,0.00010193318,0.0003744542],"about_ca_topic_score_codex":0.00003542123,"about_ca_topic_score_gemma":0.000009237689,"teacher_disagreement_score":0.00881001,"about_ca_system_score_codex":0.000076091084,"about_ca_system_score_gemma":0.00010080653,"threshold_uncertainty_score":0.7266306},"labels":[],"label_agreement":null},{"id":"W2397010370","doi":"","title":"Cographic and global cographic domination number of a graph.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Domination analysis; Combinatorics","score_opus":0.00815285498671749,"score_gpt":0.2841116367541711,"score_spread":0.27595878176745364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397010370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99322313,0.00009405541,0.003297227,0.00017362219,0.0010398069,0.00021919892,0.0000056415724,0.000107122556,0.0018402188],"genre_scores_gemma":[0.9944915,0.000043181295,0.0053816587,0.000032444696,0.0000034623495,0.000021887121,0.00000196383,0.0000092245255,0.000014651059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844587,0.00011575657,0.00025189389,0.0004109624,0.00044038612,0.00033514027],"domain_scores_gemma":[0.9985596,0.00019502762,0.00013002146,0.00067651086,0.00027068777,0.00016817814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064056274,0.00016273127,0.00021921027,0.00021375813,0.00013845172,0.00007600445,0.0007870118,0.00012010028,0.000014343759],"category_scores_gemma":[0.00012721062,0.00016118037,0.00009844867,0.0020489667,0.0004955684,0.00051250844,0.00028901536,0.00031100557,0.000010913646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014619684,0.00008870743,0.11083977,0.000014552695,0.000020666488,0.000005704432,0.00006944221,2.3057271e-7,0.0017154667,0.8824924,0.00004362204,0.0046948],"study_design_scores_gemma":[0.0008845933,0.00007832697,0.06574441,0.000012032495,0.0000070127903,0.00004220392,0.000014108729,0.00031904978,0.0012112985,0.9313778,0.00015242946,0.00015669529],"about_ca_topic_score_codex":0.000035391997,"about_ca_topic_score_gemma":0.00003071599,"teacher_disagreement_score":0.048885424,"about_ca_system_score_codex":0.000009253447,"about_ca_system_score_gemma":0.000042137235,"threshold_uncertainty_score":0.65727454},"labels":[],"label_agreement":null},{"id":"W2397312785","doi":"","title":"Walk Regular Digraphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.00967793685079788,"score_gpt":0.2614910553113739,"score_spread":0.251813118460576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397312785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97270155,0.00012412133,0.006933013,0.0012511307,0.005138417,0.0002954612,0.0000016089241,0.00058717345,0.012967501],"genre_scores_gemma":[0.9902991,0.000008484586,0.008935947,0.000114595845,0.000010140821,0.000023359964,0.0000013312842,0.000016497688,0.00059056585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841386,0.00007518947,0.00016903687,0.00044067448,0.0004373039,0.00046392463],"domain_scores_gemma":[0.99803793,0.0001574841,0.000054442397,0.0014091993,0.00013637962,0.00020456887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052611466,0.0001477284,0.00015258741,0.00017476488,0.00019718154,0.00013800431,0.0018067723,0.00009468053,0.000040481988],"category_scores_gemma":[0.00015442826,0.00014038107,0.00008932217,0.0008238113,0.00016744014,0.0006009898,0.00042970257,0.0005158307,0.00020733934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037553614,0.000057040867,0.0010779737,0.0000034055495,0.000008694629,0.000023274895,0.00009488997,8.595356e-7,0.010491481,0.9798795,0.0008607873,0.0074983537],"study_design_scores_gemma":[0.0003786114,0.000060443574,0.002175722,0.0000042459274,0.0000016071942,0.000016718765,0.000006534941,0.0005179947,0.013243013,0.97050124,0.012917226,0.00017662434],"about_ca_topic_score_codex":0.000007553434,"about_ca_topic_score_gemma":0.0000053636977,"teacher_disagreement_score":0.017597504,"about_ca_system_score_codex":0.000015192625,"about_ca_system_score_gemma":0.000053797314,"threshold_uncertainty_score":0.5724574},"labels":[],"label_agreement":null},{"id":"W2397391144","doi":"","title":"Extremal Multi-bridge Graphs With Respect To Merrifield-Simmons Index.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Bridge (graph theory); Combinatorics; Discrete mathematics; Computer science; Medicine; Surgery","score_opus":0.05144812537959317,"score_gpt":0.29315717067934705,"score_spread":0.24170904529975387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397391144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8447638,0.00012340624,0.14146651,0.00034989833,0.0013213205,0.00081089226,0.0000045078045,0.00056262093,0.010597029],"genre_scores_gemma":[0.9758349,0.0000052943406,0.023490945,0.00018734932,0.000004689051,0.000057566187,8.329218e-7,0.00003041248,0.0003879759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976371,0.00017266377,0.00024409342,0.0007196044,0.0005324958,0.00069405354],"domain_scores_gemma":[0.9977776,0.0001462626,0.00007696847,0.0014119287,0.00020226608,0.0003850178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047391857,0.00025718973,0.00026071607,0.00039182836,0.00022643562,0.000090782385,0.0018394358,0.000092292066,0.00003888707],"category_scores_gemma":[0.00010780838,0.0002229055,0.00008427727,0.0015025393,0.00014257313,0.00058167474,0.00053764,0.00039242048,0.00016322592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011966678,0.00022726136,0.014224417,0.0000056837243,0.00003540446,0.00015817196,0.0018568449,0.0000067702795,0.0004315027,0.9803557,0.00046007326,0.0021185062],"study_design_scores_gemma":[0.0018266251,0.0009677992,0.10673214,0.00004845774,0.000008777472,0.00004314224,0.00010662702,0.00074769795,0.0095425695,0.87864864,0.00071719807,0.0006103486],"about_ca_topic_score_codex":0.00013229322,"about_ca_topic_score_gemma":0.0000772079,"teacher_disagreement_score":0.13107112,"about_ca_system_score_codex":0.000048551137,"about_ca_system_score_gemma":0.00009972882,"threshold_uncertainty_score":0.9089822},"labels":[],"label_agreement":null},{"id":"W2397482252","doi":"","title":"Finding Hamiltonian Cycles in Four Subfamilies of Quasi-Claw-Free Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Hamiltonian (control theory); Biology; Mathematical optimization; Ecology","score_opus":0.022172388187462966,"score_gpt":0.284372922292056,"score_spread":0.26220053410459304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397482252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940169,0.000328088,0.001629584,0.0006781193,0.00052981416,0.00023537542,0.000002970831,0.0001324657,0.0024467171],"genre_scores_gemma":[0.994099,0.000062395084,0.0056663956,0.00007276473,0.000003271201,0.000009960012,9.765633e-7,0.000012156787,0.00007304029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978825,0.00019707803,0.0003852213,0.00045162172,0.00052527036,0.00055832806],"domain_scores_gemma":[0.9980573,0.00032433833,0.00012473286,0.0012691532,0.00010678254,0.000117687225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000762845,0.00019776281,0.00033875316,0.000551987,0.00011352396,0.000062548446,0.0022112757,0.00009636452,0.0000051457714],"category_scores_gemma":[0.0002928908,0.00020340679,0.00010917409,0.0014977818,0.00015453741,0.00062273385,0.0003527022,0.0003126721,0.000013284686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017833698,0.00016478832,0.017654868,0.000012245974,0.000008090674,0.000042545624,0.000491742,0.00002732225,0.0017755529,0.97213024,0.00013228992,0.007542503],"study_design_scores_gemma":[0.00091510353,0.00027141353,0.08930926,0.000052273874,0.0000017965904,0.000006380498,0.000055798864,0.0008445094,0.004054618,0.9042375,0.00006281875,0.0001885003],"about_ca_topic_score_codex":0.00003229293,"about_ca_topic_score_gemma":0.000035034314,"teacher_disagreement_score":0.07165439,"about_ca_system_score_codex":0.00006741285,"about_ca_system_score_gemma":0.00006794286,"threshold_uncertainty_score":0.8294688},"labels":[],"label_agreement":null},{"id":"W2397663275","doi":"","title":"Signed edge majority total domination numbers in graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Domination analysis; Graph; Artificial intelligence; Computer science; Vertex (graph theory)","score_opus":0.01369794393443952,"score_gpt":0.27787346148019226,"score_spread":0.26417551754575275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397663275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845133,0.00021926896,0.006006739,0.00022848825,0.002665754,0.00033100662,0.0000013893917,0.00015858676,0.0058755125],"genre_scores_gemma":[0.99718213,0.00000650443,0.0025462068,0.000043719177,0.00001012345,0.000040627932,0.0000027698359,0.0000130174185,0.00015488299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981413,0.00024781632,0.00022849909,0.00032041242,0.00041866017,0.0006433283],"domain_scores_gemma":[0.9988217,0.00024507305,0.00006878583,0.0005807156,0.0000868489,0.0001968952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010664567,0.00015545526,0.00018221303,0.0002763775,0.00011541587,0.00006696898,0.00072344416,0.000092750844,0.000027754359],"category_scores_gemma":[0.00015110563,0.00016359896,0.00007125377,0.0012321628,0.00012092811,0.0015278966,0.00030969427,0.00027759682,0.0001290499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013596784,0.00020534989,0.01723638,0.000007694829,0.0000064219807,0.0000072727134,0.0006369624,0.000003899468,0.000982204,0.9755271,0.00021419709,0.0051589296],"study_design_scores_gemma":[0.0010876062,0.00006563172,0.048381906,0.000011798285,0.0000021968592,0.000011432792,0.000052321648,0.0005546729,0.0031234343,0.9462982,0.00017481155,0.0002360269],"about_ca_topic_score_codex":0.000028221008,"about_ca_topic_score_gemma":0.000004992194,"teacher_disagreement_score":0.031145524,"about_ca_system_score_codex":0.0001388078,"about_ca_system_score_gemma":0.000040797804,"threshold_uncertainty_score":0.6671372},"labels":[],"label_agreement":null},{"id":"W2397686790","doi":"","title":"A Note On Global Domination In Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011847620038992803,"score_gpt":0.30042552309750364,"score_spread":0.28857790305851083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397686790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9645892,0.000103512226,0.010934702,0.003111314,0.0013540674,0.0004419765,0.0000021880248,0.00026996582,0.019193117],"genre_scores_gemma":[0.99727774,0.000008453737,0.0023158411,0.0003469759,0.0000025282625,0.0000089131345,0.0000011054344,0.0000036794083,0.000034766454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862653,0.000119981625,0.00016593694,0.0003574922,0.00038608344,0.0003440005],"domain_scores_gemma":[0.9991685,0.000105922016,0.00004561977,0.0005288318,0.000063806794,0.00008727776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041434338,0.00011965567,0.00013295117,0.00018541739,0.00006996931,0.000068411406,0.00081115076,0.000062888575,0.0000033350584],"category_scores_gemma":[0.00011952791,0.00012000061,0.000050118004,0.0013825109,0.00003820056,0.00041748837,0.00008373937,0.00018617908,0.00007471671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002508591,0.00014129537,0.00070275454,0.0000012993747,0.0000013921585,0.000031997974,0.00008970986,0.00003483489,0.00016721735,0.9566016,0.00012748827,0.042075325],"study_design_scores_gemma":[0.0008775199,0.00028007547,0.034394644,0.000016735385,5.876944e-7,0.000003909348,0.000003741116,0.0019309804,0.0008589559,0.96133417,0.00017697534,0.000121723315],"about_ca_topic_score_codex":0.000006951107,"about_ca_topic_score_gemma":0.0000055708956,"teacher_disagreement_score":0.0419536,"about_ca_system_score_codex":0.00016630927,"about_ca_system_score_gemma":0.000040582538,"threshold_uncertainty_score":0.48934826},"labels":[],"label_agreement":null},{"id":"W2397759350","doi":"","title":"Max-min total restrained domination number.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011447784852974364,"score_gpt":0.2720094634121934,"score_spread":0.260561678559219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397759350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9689152,0.00003473752,0.010190698,0.0014889558,0.0014946981,0.00052670744,0.0000013724673,0.00032438833,0.01702324],"genre_scores_gemma":[0.9893092,0.000004284504,0.008419371,0.00007468462,0.000010272354,0.00008806315,0.0000033581007,0.000015656866,0.0020750915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983418,0.00014613979,0.00021752504,0.00040356992,0.00044633672,0.0004446391],"domain_scores_gemma":[0.9985799,0.00022301037,0.00007275022,0.0007408786,0.00021396932,0.0001694853],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003756363,0.0001510947,0.00015536394,0.0001030087,0.00015835,0.0002095006,0.00093037455,0.000078467434,0.00020926668],"category_scores_gemma":[0.0001788596,0.00014888385,0.00006511991,0.00064366404,0.00009995501,0.0011730304,0.00032875975,0.00022229971,0.0016199428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046157484,0.0000669987,0.00046860368,0.00000558699,0.000008389649,0.000012218647,0.00017893505,0.000005414861,0.0026390657,0.9817533,0.0017386745,0.013118221],"study_design_scores_gemma":[0.00069451105,0.00007538368,0.010099557,0.000010061908,0.0000015436325,0.000025250383,0.000031650376,0.003812644,0.003112508,0.98158586,0.00036188043,0.00018916256],"about_ca_topic_score_codex":0.00003704175,"about_ca_topic_score_gemma":0.0000011174176,"teacher_disagreement_score":0.020394016,"about_ca_system_score_codex":0.00007636013,"about_ca_system_score_gemma":0.000054123477,"threshold_uncertainty_score":0.9991574},"labels":[],"label_agreement":null},{"id":"W2397767158","doi":"","title":"The Properties of Transformation Digraphs D xyz .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Pure mathematics; Biology; Genetics","score_opus":0.022753583724552415,"score_gpt":0.25966922473554327,"score_spread":0.23691564101099086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397767158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9824771,0.0026837604,0.0063844556,0.00065708655,0.0014497322,0.00036525677,7.4170924e-7,0.00011619919,0.0058656675],"genre_scores_gemma":[0.99951595,0.000101117745,0.00027129415,0.000021657155,0.0000032702217,0.000024831368,2.68002e-7,0.000005273057,0.000056314788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990089,0.00011043308,0.00017449292,0.0000888392,0.00030530957,0.00031200875],"domain_scores_gemma":[0.99924165,0.00010296244,0.000055737797,0.00043740915,0.0000947876,0.0000674581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006600138,0.00007396212,0.00008533414,0.000059329228,0.00020953409,0.00004477876,0.0007332853,0.0000287547,0.000001536806],"category_scores_gemma":[0.000056234498,0.000046636524,0.000053078573,0.0004173448,0.00013698034,0.0009715032,0.00008705634,0.00010929535,0.0000196038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009138413,0.00004217499,0.0007322766,0.000010578936,0.000008983937,9.885409e-8,0.0015650182,0.000001517345,0.0023165199,0.98349524,0.000046826557,0.011771643],"study_design_scores_gemma":[0.00040959826,0.00009169497,0.0030915823,0.00002432476,0.0000036819213,0.0000048352385,0.00021989232,0.0007822671,0.087930135,0.901434,0.0058680302,0.0001399332],"about_ca_topic_score_codex":0.000004423911,"about_ca_topic_score_gemma":7.546441e-7,"teacher_disagreement_score":0.085613616,"about_ca_system_score_codex":0.000016303798,"about_ca_system_score_gemma":0.00002340921,"threshold_uncertainty_score":0.19017822},"labels":[],"label_agreement":null},{"id":"W2397779203","doi":"","title":"Minus Edge Domination in Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.013547289838376175,"score_gpt":0.279399525172693,"score_spread":0.26585223533431684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397779203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9796335,0.00033375435,0.0060372474,0.001632502,0.0012645462,0.00037715613,7.172561e-7,0.00022346879,0.010497107],"genre_scores_gemma":[0.9968332,0.000015199907,0.0028005964,0.00016088558,0.000002969724,0.000012518544,0.0000013881961,0.000005733844,0.00016752795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998663,0.00012050102,0.00019254905,0.00034574352,0.00031478968,0.00036342107],"domain_scores_gemma":[0.9990937,0.00012553063,0.0000492908,0.00055797637,0.000082794824,0.000090692396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005183572,0.00011701941,0.00014404167,0.0003552529,0.000074869466,0.000072984476,0.0009155631,0.00006251184,0.000006427394],"category_scores_gemma":[0.000106382686,0.00012071952,0.0000502374,0.0012801486,0.000047280922,0.0006381731,0.000106048166,0.00020814041,0.000059309114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008980249,0.000112276044,0.00069561094,0.0000020635675,0.0000018474888,0.00003642395,0.00022532878,0.000007697628,0.0008364525,0.9632967,0.00030598725,0.034470614],"study_design_scores_gemma":[0.0007676821,0.0001375999,0.022193473,0.000012235723,7.2922165e-7,0.000006281436,0.000010233425,0.0012600144,0.0028934684,0.97217685,0.00040579593,0.00013564945],"about_ca_topic_score_codex":0.000005475347,"about_ca_topic_score_gemma":0.0000034907903,"teacher_disagreement_score":0.034334965,"about_ca_system_score_codex":0.00007387823,"about_ca_system_score_gemma":0.00003806478,"threshold_uncertainty_score":0.4922799},"labels":[],"label_agreement":null},{"id":"W2397975603","doi":"","title":"Signed edge k-subdomination numbers in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.011479427207071836,"score_gpt":0.2620392272579767,"score_spread":0.25055980005090484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397975603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822853,0.000096993026,0.006061039,0.00081886165,0.0011653198,0.0006303455,5.197006e-7,0.00020831301,0.008733267],"genre_scores_gemma":[0.9964242,0.000008847789,0.0030399892,0.00010474504,0.0000027361377,0.00011727191,0.000001862637,0.000013629958,0.00028674345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983608,0.00018761419,0.00023590913,0.00040067767,0.00036317224,0.00045182605],"domain_scores_gemma":[0.998782,0.0002451811,0.00006573508,0.0006260072,0.00015107072,0.00013005061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004695851,0.0001437729,0.00016877071,0.00032683907,0.000093124014,0.00013470394,0.0010482802,0.00007786814,0.000058937094],"category_scores_gemma":[0.0001387636,0.00014667257,0.00005685167,0.0013202811,0.00009206002,0.0012587673,0.00025228565,0.00022541292,0.0004596797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042521197,0.00008883012,0.0036242553,0.0000059023037,0.0000049969517,0.000009089119,0.0003312493,0.000007437001,0.0019056032,0.98339194,0.0008204464,0.009805981],"study_design_scores_gemma":[0.0008041509,0.00006539558,0.012077132,0.0000119775605,8.5410386e-7,0.0000030004355,0.000042338026,0.0030407142,0.002605429,0.981019,0.00015645142,0.00017351059],"about_ca_topic_score_codex":0.000093306386,"about_ca_topic_score_gemma":0.000010662149,"teacher_disagreement_score":0.014138832,"about_ca_system_score_codex":0.00009380791,"about_ca_system_score_gemma":0.00004607088,"threshold_uncertainty_score":0.59811336},"labels":[],"label_agreement":null},{"id":"W2397983808","doi":"10.1007/s11083-016-9394-z","title":"Rigid Binary Relations on a 4-Element Domain","year":2016,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Binary relation; Conjecture; Combinatorics; Element (criminal law); Pairwise comparison; Domain (mathematical analysis); Maximal element; Binary number; Projective test; Unary operation; Binary operation; Discrete mathematics; Set (abstract data type); Pure mathematics; Mathematical analysis","score_opus":0.017578876914792006,"score_gpt":0.2982002506832728,"score_spread":0.28062137376848084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397983808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030973524,0.000031908083,0.9323782,0.012067146,0.0001418618,0.00017468366,0.0000031797372,0.0001441925,0.024085328],"genre_scores_gemma":[0.85562,0.000019253039,0.12036815,0.0006407141,0.00006785932,0.000083044775,0.0000013177319,0.000019202806,0.023180421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991312,0.0000726393,0.000090301444,0.00024160222,0.00023213738,0.00023211403],"domain_scores_gemma":[0.9991643,0.00016547744,0.000024005538,0.0005268715,0.000054620406,0.00006474137],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022903689,0.00006676789,0.00005445415,0.000108146654,0.00011764572,0.000023727089,0.00042639,0.000024711006,0.00035327655],"category_scores_gemma":[0.00005224136,0.000042065796,0.000025952822,0.00039949466,0.00005341833,0.00024794246,0.00015829306,0.00006711522,0.0018689936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011074941,0.000060991857,0.00047224326,0.0000011181206,0.00000757689,0.000013524549,0.000112944326,0.000038332466,0.0030530994,0.9568015,0.003981819,0.035445828],"study_design_scores_gemma":[0.00093142176,0.00033341275,0.0035018278,0.000045518245,0.0000013995259,0.000006716261,0.000019552177,0.00063140196,0.0017180395,0.7230401,0.26953828,0.00023234358],"about_ca_topic_score_codex":0.0000010706657,"about_ca_topic_score_gemma":0.0000022112854,"teacher_disagreement_score":0.82464653,"about_ca_system_score_codex":0.000047817895,"about_ca_system_score_gemma":0.000038937756,"threshold_uncertainty_score":0.99890816},"labels":[],"label_agreement":null},{"id":"W2398039696","doi":"","title":"Nim On The Complete Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.0595456025904787,"score_gpt":0.29611495193245335,"score_spread":0.23656934934197466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398039696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83348864,0.0005424531,0.027018605,0.022264762,0.008936601,0.0014290194,0.000011354334,0.0011693523,0.10513923],"genre_scores_gemma":[0.99793005,0.0000046854475,0.0009935662,0.0007151805,0.000007998524,0.000030229847,0.000001042729,0.000012723154,0.00030453314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998268,0.00027246002,0.00014339086,0.00032923598,0.00060332974,0.00038356252],"domain_scores_gemma":[0.99795,0.00046690027,0.000053588272,0.0011694188,0.00016367962,0.00019636753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009305254,0.00013644062,0.00013229677,0.000108721826,0.00019902713,0.00012743259,0.0019208232,0.000039697563,0.000011477359],"category_scores_gemma":[0.00023931472,0.0000935525,0.00006576188,0.0008028489,0.0001582318,0.00026094372,0.00040723162,0.0002926637,0.0005777047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010784112,0.0000484223,0.00023812972,0.0000011484957,0.00000948847,0.000012518985,0.00022963774,0.000019884306,0.00009778554,0.98971546,0.008739739,0.0008770338],"study_design_scores_gemma":[0.00042845923,0.00020287573,0.00040743814,0.000007705451,0.0000011867086,0.0000057408615,0.000045610483,0.0011700169,0.00066072604,0.9859134,0.011033381,0.00012347159],"about_ca_topic_score_codex":0.00000900538,"about_ca_topic_score_gemma":0.0000013581017,"teacher_disagreement_score":0.16444142,"about_ca_system_score_codex":0.000050040402,"about_ca_system_score_gemma":0.000063801446,"threshold_uncertainty_score":0.74254173},"labels":[],"label_agreement":null},{"id":"W2398165600","doi":"","title":"The Properties of Middle Digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.054802689121501914,"score_gpt":0.24679471781752144,"score_spread":0.19199202869601953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398165600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813917,0.0018751269,0.0014971015,0.00018873755,0.001356549,0.00032430372,6.4594144e-7,0.00015554311,0.013210241],"genre_scores_gemma":[0.99860525,0.0000470585,0.0010082269,0.000018066085,0.0000014873341,0.00002324851,7.464342e-8,0.000007378874,0.00028918037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897265,0.00010586967,0.00017385189,0.00018923229,0.00027967052,0.00027870334],"domain_scores_gemma":[0.99883056,0.00008646597,0.00007043658,0.000803613,0.00014796064,0.000060968287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043986394,0.00008677463,0.00010568918,0.00006310346,0.00019788559,0.000036197176,0.0015421185,0.000030093719,0.0000041760723],"category_scores_gemma":[0.00009479009,0.000054410895,0.00006235072,0.0004660342,0.00029742683,0.00030236016,0.00033559612,0.00012266607,0.000026248827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015865915,0.000055460016,0.000855929,0.000007671665,0.0000140841,0.0000021954718,0.001099397,2.4479016e-7,0.0013787585,0.993811,0.0000755195,0.0026838442],"study_design_scores_gemma":[0.00018399702,0.000103863895,0.0012634037,0.00001839446,0.0000015667567,0.00000242458,0.00008328072,0.00015231133,0.07832761,0.9192261,0.0005585461,0.00007847566],"about_ca_topic_score_codex":0.000022112687,"about_ca_topic_score_gemma":0.0000035049698,"teacher_disagreement_score":0.07694885,"about_ca_system_score_codex":0.00001087808,"about_ca_system_score_gemma":0.00004081715,"threshold_uncertainty_score":0.28656656},"labels":[],"label_agreement":null},{"id":"W2398212301","doi":"","title":"Upper minus total domination of a 5-regular graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Domination analysis; Vertex (graph theory)","score_opus":0.00903967679747183,"score_gpt":0.2609612980069916,"score_spread":0.2519216212095198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398212301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788225,0.00027736768,0.016728982,0.00062286586,0.00070452376,0.00025611717,0.0000016487012,0.00012170652,0.0024642488],"genre_scores_gemma":[0.9925812,0.000007448452,0.0071042664,0.00005064912,0.0000043733103,0.000007600604,0.0000017594268,0.0000068211793,0.00023586366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985833,0.00010670849,0.00022741806,0.00031569597,0.0004582625,0.00030860296],"domain_scores_gemma":[0.9988234,0.00010868253,0.00009382135,0.0006850065,0.0001912133,0.00009789039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004091216,0.00012727806,0.00018939238,0.00025439242,0.00008295114,0.000042067706,0.00077408116,0.000066050125,0.000010864683],"category_scores_gemma":[0.000091263064,0.00012492563,0.000107315405,0.00087507133,0.00009058558,0.0005306005,0.0001227212,0.00013772809,0.000022497263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016085509,0.00013313955,0.00019309616,0.0000049473465,0.000009163416,0.000011490736,0.00023279327,0.000016038686,0.007575034,0.9711792,0.0002444543,0.020384567],"study_design_scores_gemma":[0.0007049414,0.0003001046,0.009928501,0.00001612605,0.0000032425291,0.000015490052,0.000016482862,0.0010252806,0.02752412,0.960191,0.0001380852,0.00013662274],"about_ca_topic_score_codex":0.000003803199,"about_ca_topic_score_gemma":2.796805e-7,"teacher_disagreement_score":0.020247944,"about_ca_system_score_codex":0.00003579284,"about_ca_system_score_gemma":0.000035199457,"threshold_uncertainty_score":0.5094319},"labels":[],"label_agreement":null},{"id":"W2398218064","doi":"","title":"Degree Conditions for Graphs to Be Fractional k-Covered Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics; Physics","score_opus":0.07189282429858324,"score_gpt":0.3360628955225094,"score_spread":0.26417007122392616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398218064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6375908,0.00027121344,0.31561846,0.01583325,0.012308355,0.0034293758,0.00032199084,0.0012009667,0.013425578],"genre_scores_gemma":[0.98399043,0.0000035523462,0.014304772,0.00093483686,0.000010562899,0.00032055125,0.00003211929,0.000023717706,0.00037943825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980959,0.00009659186,0.00022848333,0.00049831497,0.0005870552,0.00049362786],"domain_scores_gemma":[0.9976941,0.00045340104,0.00007362674,0.000748167,0.0005520169,0.00047872728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005750999,0.00017717916,0.00020152384,0.00036646295,0.00027960914,0.00013092085,0.0010875434,0.000081596416,0.000016592481],"category_scores_gemma":[0.00043036553,0.00018607007,0.00014042981,0.0011269457,0.000101199075,0.0007605877,0.0002716739,0.00019308225,0.000104207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037994418,0.00011262779,0.00048208438,0.000004210056,0.000030193707,0.000005908082,0.0001889465,0.000071904375,0.00038124123,0.97057605,0.02756719,0.0005416678],"study_design_scores_gemma":[0.0012185595,0.00032875058,0.0013068005,0.0000073946594,0.0000055147552,0.000011397924,0.000058945818,0.00073407026,0.0011714597,0.98151106,0.01341921,0.00022682574],"about_ca_topic_score_codex":0.000014752935,"about_ca_topic_score_gemma":0.000009326222,"teacher_disagreement_score":0.34639964,"about_ca_system_score_codex":0.000097863325,"about_ca_system_score_gemma":0.00018963887,"threshold_uncertainty_score":0.7587717},"labels":[],"label_agreement":null},{"id":"W2398413913","doi":"","title":"Graphs with unique minimum paired-dominating set.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Graph; Vertex (graph theory)","score_opus":0.03007709096057041,"score_gpt":0.28281345778187844,"score_spread":0.252736366821308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398413913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9546065,0.00021615188,0.03051383,0.0010041862,0.0012847268,0.0005461764,0.0000025365207,0.0006433674,0.01118253],"genre_scores_gemma":[0.98301053,0.000004220866,0.016422754,0.0001231198,0.000005257142,0.000045634304,0.0000024105486,0.000026086393,0.00035998665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977991,0.00028260436,0.00021710011,0.00051037123,0.0006414063,0.0005494415],"domain_scores_gemma":[0.997927,0.000287186,0.00010704817,0.00094960997,0.00036876136,0.00036035987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010880772,0.00021077474,0.00022947244,0.00021641894,0.0001635644,0.00013894794,0.0013546816,0.00007600884,0.000004306237],"category_scores_gemma":[0.00021959393,0.00018081079,0.000055508768,0.0012576345,0.00017903425,0.00076465006,0.00042637545,0.0003109288,0.000058596495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034544173,0.00006584745,0.0028735672,0.000008745778,0.000019363966,0.00009063103,0.00093921367,0.000027713357,0.00020367974,0.991938,0.0010910517,0.002707628],"study_design_scores_gemma":[0.0014611068,0.00047296542,0.0003713795,0.00003475901,0.0000039558913,0.00004058914,0.0002267489,0.0033532018,0.0036279478,0.98912454,0.0009976684,0.0002851235],"about_ca_topic_score_codex":0.00001881524,"about_ca_topic_score_gemma":0.0000059343847,"teacher_disagreement_score":0.028404037,"about_ca_system_score_codex":0.00009093384,"about_ca_system_score_gemma":0.00021493007,"threshold_uncertainty_score":0.737325},"labels":[],"label_agreement":null},{"id":"W2398470855","doi":"","title":"An algorithm for hamiltonian cycles under implicit degree conditions.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Algorithm; Hamiltonian (control theory); Applied mathematics; Mathematical optimization; Physics; Acoustics","score_opus":0.052558205751225356,"score_gpt":0.3425944378369629,"score_spread":0.2900362320857376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398470855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13375628,0.00018032434,0.86004055,0.0008313991,0.0020451623,0.00080306985,0.00004839342,0.0005571268,0.0017376842],"genre_scores_gemma":[0.9054481,0.0000044309113,0.09381459,0.0003166283,0.000022304024,0.00015392738,0.000027427404,0.000032861084,0.00017976233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823785,0.00013091999,0.00021124618,0.0005014799,0.00038790543,0.00053059706],"domain_scores_gemma":[0.9979078,0.00022312909,0.00007157592,0.0010034839,0.00037376795,0.00042025017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060952775,0.00017949936,0.00020132115,0.00017445533,0.0002505138,0.0001908217,0.001382993,0.00009113804,0.000006115967],"category_scores_gemma":[0.00006682359,0.00018013956,0.00007573294,0.0004836367,0.00014051008,0.0009794534,0.00020940951,0.00016631852,0.00007240812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062650925,0.00012108429,0.00017921551,0.000003047041,0.000017814347,0.000006938213,0.0001594902,0.00005216607,0.00042171744,0.9689197,0.0012887507,0.02882384],"study_design_scores_gemma":[0.0012754643,0.00035555288,0.00217284,0.0000068317227,0.0000046612986,0.000016655693,0.000113743925,0.026061416,0.0016931683,0.96683955,0.001226121,0.00023398442],"about_ca_topic_score_codex":0.000021229778,"about_ca_topic_score_gemma":0.00000829549,"teacher_disagreement_score":0.7716918,"about_ca_system_score_codex":0.00011932828,"about_ca_system_score_gemma":0.00017732737,"threshold_uncertainty_score":0.7345878},"labels":[],"label_agreement":null},{"id":"W2398472485","doi":"","title":"An improved Fan-Type degree condition for k-linked graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Type (biology); Combinatorics; Discrete mathematics; Physics; Geology; Acoustics","score_opus":0.05574007086007631,"score_gpt":0.3344517595222207,"score_spread":0.2787116886621444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398472485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8391622,0.0002581749,0.15001939,0.00051189086,0.0061892653,0.0015417569,0.000016914739,0.00081296935,0.001487439],"genre_scores_gemma":[0.9841713,0.000005077371,0.015430778,0.000118329626,0.000013316312,0.000077291836,0.000031293675,0.000024252922,0.00012841301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832135,0.00014713356,0.00022070474,0.0004987473,0.00033528698,0.00047675744],"domain_scores_gemma":[0.9977448,0.00018424686,0.000095748896,0.0009633149,0.000651262,0.0003606419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008353208,0.00017351031,0.00020101471,0.00018481283,0.00017097144,0.00014853539,0.001265805,0.00010661677,0.000004880898],"category_scores_gemma":[0.00027739047,0.00017176576,0.000073289,0.0007080546,0.000111544265,0.0010598544,0.00015527158,0.00018397653,0.00004402238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007399606,0.00012235082,0.000352526,0.000008213953,0.000016363409,0.0000050715853,0.0002410635,0.000012488065,0.005579598,0.98709,0.0010765311,0.0054217945],"study_design_scores_gemma":[0.0018080169,0.0010903585,0.0006634707,0.0000062714794,0.000005282658,0.000005754797,0.000048000788,0.015657948,0.0045746393,0.97468084,0.0012333696,0.00022603369],"about_ca_topic_score_codex":0.000012623542,"about_ca_topic_score_gemma":0.000005899941,"teacher_disagreement_score":0.14500904,"about_ca_system_score_codex":0.00007669068,"about_ca_system_score_gemma":0.00016645149,"threshold_uncertainty_score":0.70044047},"labels":[],"label_agreement":null},{"id":"W2398555939","doi":"","title":"Extreme Cliques in Interval Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Combinatorics","score_opus":0.024925440149273496,"score_gpt":0.2970897280047989,"score_spread":0.2721642878555254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398555939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906023,0.000061071434,0.0017716192,0.0005005149,0.0023314978,0.00017125529,6.7367006e-7,0.00020974567,0.0043512895],"genre_scores_gemma":[0.9934614,0.0000117706,0.0062381383,0.00010852327,0.000005124504,0.000026146718,8.698499e-7,0.000012942056,0.00013511692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985284,0.00012308764,0.00022633284,0.00040416015,0.00029506016,0.00042290936],"domain_scores_gemma":[0.9987157,0.0001806042,0.00005076508,0.00083273853,0.00009170607,0.00012846968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071777025,0.00013765179,0.00017047818,0.00029942393,0.00006898668,0.00010163729,0.0015115482,0.00008860682,0.00003221004],"category_scores_gemma":[0.00016899631,0.00013486399,0.00007101065,0.00080064265,0.00013351065,0.0006587803,0.00045916083,0.00064017734,0.00008059016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008243844,0.00009063754,0.011716667,0.000004006337,0.000003939168,0.000035429402,0.00021884897,6.6459546e-7,0.0045552375,0.9756434,0.00020221579,0.0075206934],"study_design_scores_gemma":[0.0004455814,0.000078892546,0.0104440395,0.000011692779,6.2574145e-7,0.000009259802,0.000011437485,0.0009100871,0.004783158,0.98181933,0.0013305723,0.00015529944],"about_ca_topic_score_codex":0.000027656213,"about_ca_topic_score_gemma":0.00007813434,"teacher_disagreement_score":0.007365394,"about_ca_system_score_codex":0.0000260208,"about_ca_system_score_gemma":0.000049449074,"threshold_uncertainty_score":0.54995936},"labels":[],"label_agreement":null},{"id":"W2398634893","doi":"","title":"On the construction of radially Moore digraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011137843190235235,"score_gpt":0.24002664486784128,"score_spread":0.22888880167760606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398634893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98645675,0.00005286288,0.0033077057,0.0018101919,0.0010399659,0.00040119572,0.0000011595077,0.000089308494,0.006840876],"genre_scores_gemma":[0.9977115,0.000011630844,0.0020429888,0.00011546545,0.0000030198178,0.000036934372,4.6915196e-7,0.0000071035925,0.00007090889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891645,0.00014072885,0.0001631579,0.00021680433,0.0003362425,0.00022659036],"domain_scores_gemma":[0.9984597,0.00050303416,0.00008504041,0.00072917336,0.00015596795,0.00006708364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027854944,0.00009733121,0.00011899053,0.00011053883,0.00012187699,0.000064414555,0.000972868,0.000042709496,0.00006452295],"category_scores_gemma":[0.00015461372,0.000067308414,0.0000658288,0.0005899096,0.000261527,0.0003306861,0.0001487105,0.00018337772,0.00011253581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004221145,0.00003362655,0.0005299572,0.0000030570286,0.000011674585,9.71358e-7,0.0001122543,0.000008113126,0.0007403334,0.9913242,0.0009588599,0.006272751],"study_design_scores_gemma":[0.00023341081,0.00011902389,0.0024484093,0.000011086764,0.0000012304658,0.0000037837258,0.000032336728,0.00085816334,0.0056493627,0.99042076,0.0001485948,0.000073815674],"about_ca_topic_score_codex":0.000021709438,"about_ca_topic_score_gemma":6.415738e-7,"teacher_disagreement_score":0.011254745,"about_ca_system_score_codex":0.000019338311,"about_ca_system_score_gemma":0.000038637343,"threshold_uncertainty_score":0.27447575},"labels":[],"label_agreement":null},{"id":"W2398635090","doi":"","title":"Orientable Embedding Distributions by Genus of Crossing-Digraph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Genus; Embedding; Combinatorics; Zoology; Biology; Computer science; Artificial intelligence","score_opus":0.015236024370001728,"score_gpt":0.3022408367006681,"score_spread":0.2870048123306664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398635090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8826545,0.0014637653,0.1118161,0.00009790324,0.0019008493,0.00020270742,0.00004383646,0.00016653913,0.0016538022],"genre_scores_gemma":[0.99554074,0.000010484168,0.0041794083,0.00001735722,0.0000068493214,0.00001876014,0.000012330798,0.000011349676,0.00020274533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983824,0.000098041746,0.00024055142,0.00025290775,0.00037636177,0.0006497352],"domain_scores_gemma":[0.9986577,0.00018093069,0.00011083968,0.0006840838,0.00014412595,0.00022232436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470703,0.00013491181,0.00018546479,0.0001036664,0.00039861226,0.00012490501,0.00084402825,0.00006273405,0.000021381065],"category_scores_gemma":[0.00012728861,0.00013599421,0.00008371452,0.0010394928,0.00026258203,0.0010653874,0.00034925615,0.00018625926,0.000034883193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050126732,0.00020431286,0.012370611,0.000009647501,0.000016578904,0.0000012300975,0.00036660014,0.00000523386,0.0044770213,0.978471,0.0027442388,0.0013285236],"study_design_scores_gemma":[0.0009418127,0.00014114876,0.0036083157,0.000035485566,0.000011752836,0.00001705004,0.00008991704,0.0013015107,0.10122047,0.8649899,0.027238313,0.0004043264],"about_ca_topic_score_codex":0.000021560947,"about_ca_topic_score_gemma":4.1090246e-7,"teacher_disagreement_score":0.1134811,"about_ca_system_score_codex":0.00007040947,"about_ca_system_score_gemma":0.00006225795,"threshold_uncertainty_score":0.5545683},"labels":[],"label_agreement":null},{"id":"W2398885845","doi":"","title":"A note on weakly connected domination number in graphs","year":2010,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph","score_opus":0.00833730587728895,"score_gpt":0.2361856281062793,"score_spread":0.22784832222899035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398885845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.834113,0.0000059303075,0.057589624,0.00024811696,0.0013716636,0.00029438466,0.000008021812,0.000241941,0.10612732],"genre_scores_gemma":[0.98880327,0.0000042565935,0.008423553,0.000046058558,0.00006125196,0.0000029833166,0.000008790238,0.000009173705,0.002640653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980835,0.00016197436,0.00021070463,0.0006148793,0.00056748244,0.00036146157],"domain_scores_gemma":[0.99861515,0.00028891096,0.00010609521,0.0005684769,0.0002448633,0.00017649785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002702732,0.00019721156,0.00017508017,0.00072097423,0.00068133307,0.000117188356,0.0009816685,0.00016533902,0.000027033668],"category_scores_gemma":[0.00017068103,0.00022552628,0.000104504594,0.0014946767,0.00052459043,0.0012193996,0.00023317654,0.0006908904,0.00011860109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001002957,0.00014892494,0.006161332,0.000008219064,0.000012587363,0.0012232191,0.00009282081,0.0006524154,0.030469129,0.95964646,0.000037945458,0.0014466624],"study_design_scores_gemma":[0.010515481,0.00062643463,0.615633,0.0006237621,0.00006191574,0.0023158072,0.0003254894,0.04473101,0.0843703,0.12227728,0.11520568,0.0033138357],"about_ca_topic_score_codex":0.000091401,"about_ca_topic_score_gemma":0.00016368237,"teacher_disagreement_score":0.83736914,"about_ca_system_score_codex":0.000319892,"about_ca_system_score_gemma":0.00037690403,"threshold_uncertainty_score":0.9196695},"labels":[],"label_agreement":null},{"id":"W2398932532","doi":"","title":"On kernels by monochromatic paths in D-join.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Monochromatic color; Mathematics; Combinatorics; Arithmetic; Optics; Physics","score_opus":0.023140048582915178,"score_gpt":0.2664887954333755,"score_spread":0.24334874685046032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398932532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795766,0.00014880419,0.004900024,0.00009930929,0.00079334376,0.00031956582,0.000002002178,0.00018691951,0.013973416],"genre_scores_gemma":[0.9971857,0.000011177905,0.0023823592,0.00012766306,0.0000014514482,0.00004290241,0.000001048671,0.000015996657,0.00023170208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984111,0.00017071809,0.00022949697,0.00041424955,0.00033486437,0.00043954395],"domain_scores_gemma":[0.99871004,0.00021810636,0.000063240535,0.0008364396,0.000042319614,0.0001298569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045472497,0.00015592629,0.0001885053,0.00018164096,0.000066437104,0.00004384607,0.0012136209,0.000067412235,0.000048105012],"category_scores_gemma":[0.00012387091,0.00015057882,0.000047799946,0.0006434204,0.00007110815,0.0004150529,0.0002563119,0.00025813343,0.00034934637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012194487,0.00024183988,0.0009625883,0.0000072975627,0.0000059528475,0.000047293182,0.0007677713,0.0000026064365,0.0005334026,0.99363476,0.001038076,0.0027461904],"study_design_scores_gemma":[0.0006317116,0.00024578423,0.0026691176,0.000030896124,8.845536e-7,0.0000034030818,0.000019796746,0.001562992,0.0072583263,0.98732555,0.000079244,0.00017230173],"about_ca_topic_score_codex":0.000031569445,"about_ca_topic_score_gemma":0.000002255275,"teacher_disagreement_score":0.017609082,"about_ca_system_score_codex":0.00007778951,"about_ca_system_score_gemma":0.000037458765,"threshold_uncertainty_score":0.61404264},"labels":[],"label_agreement":null},{"id":"W2399012647","doi":"","title":"Hyperbolicity and parameters of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.032532937333796266,"score_gpt":0.2614451418722669,"score_spread":0.22891220453847066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399012647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99459213,0.00011691542,0.0019165264,0.000028388478,0.0003688001,0.000104838015,8.027759e-7,0.000059847753,0.0028117541],"genre_scores_gemma":[0.98166746,0.00003068551,0.01823341,0.00003634937,4.530409e-7,0.0000070968736,1.6745862e-7,0.0000060580146,0.000018320989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914014,0.000079057005,0.00014167215,0.00023636413,0.00018496925,0.0002177999],"domain_scores_gemma":[0.9991653,0.00010739392,0.000058185844,0.00049761723,0.00007110326,0.0001004165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027805066,0.000087730645,0.00014841477,0.00012017242,0.000052906216,0.000014863666,0.00060929713,0.000039087878,0.0000053120984],"category_scores_gemma":[0.00005996055,0.00008223695,0.00004061082,0.0004168136,0.00020547901,0.00029268593,0.0002718775,0.00010995985,0.000006807465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009138933,0.000056958903,0.00882811,0.0000074290556,0.000011688193,0.000004773634,0.0005674778,2.5040185e-7,0.000622269,0.9848321,0.000028605415,0.0050311894],"study_design_scores_gemma":[0.00028372803,0.00013547884,0.016285872,0.0000067374526,0.0000023319421,0.000004190475,0.000018592493,0.00019623397,0.018211547,0.9647339,0.00003275737,0.000088614055],"about_ca_topic_score_codex":0.00004520238,"about_ca_topic_score_gemma":0.0000011824409,"teacher_disagreement_score":0.020098194,"about_ca_system_score_codex":0.000007433039,"about_ca_system_score_gemma":0.000017270342,"threshold_uncertainty_score":0.3353525},"labels":[],"label_agreement":null},{"id":"W2399041719","doi":"","title":"Dominating cycles in graphs with high connectivity.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010654861714400502,"score_gpt":0.2649386056327673,"score_spread":0.2542837439183668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399041719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941959,0.00007783044,0.0028713215,0.0006285917,0.00022850737,0.00021321607,4.972115e-7,0.00015520545,0.0016289226],"genre_scores_gemma":[0.99251765,0.000008746942,0.007295541,0.00011707218,0.0000025254728,0.000016140826,7.3092554e-7,0.00000965155,0.00003196912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983859,0.00016609048,0.00017593525,0.00044605436,0.00036583573,0.0004601968],"domain_scores_gemma":[0.99880356,0.00034517428,0.00007127263,0.0005928206,0.00008694323,0.00010025285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005460089,0.00015988635,0.00021795576,0.00029860265,0.00012623894,0.00009950774,0.0008382266,0.000054085944,0.0000042727706],"category_scores_gemma":[0.000110340974,0.00014239908,0.000036303085,0.00130548,0.000086224005,0.0007188597,0.00012429885,0.00029388437,0.000014416775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025416002,0.00013029134,0.0050481004,0.0000033056795,0.0000050833046,0.00008114674,0.00029896118,0.000060425493,0.0010778519,0.9790206,0.000019775254,0.014229026],"study_design_scores_gemma":[0.0012034443,0.00033227648,0.060682815,0.00004327603,0.0000012498778,0.000012990271,0.000041174702,0.0007475677,0.004170274,0.93256027,0.000015664407,0.00018897899],"about_ca_topic_score_codex":0.00003200762,"about_ca_topic_score_gemma":0.000017880222,"teacher_disagreement_score":0.055634715,"about_ca_system_score_codex":0.00006371256,"about_ca_system_score_gemma":0.000049254402,"threshold_uncertainty_score":0.58068657},"labels":[],"label_agreement":null},{"id":"W2399055054","doi":"","title":"An upper bound on the restrained domination number of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Upper and lower bounds; Graph; Mathematical analysis","score_opus":0.015612913422797987,"score_gpt":0.30682830933692234,"score_spread":0.2912153959141244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399055054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98937094,0.000015142399,0.0011243476,0.0018051646,0.00036667203,0.00022060469,0.0000012633619,0.00007886138,0.0070170253],"genre_scores_gemma":[0.99831384,0.0000063388156,0.001297374,0.00026556553,0.0000043096065,0.000009303674,0.0000017156314,0.0000071208397,0.00009445671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985593,0.00023992853,0.00018561482,0.00028785842,0.00046292393,0.00026436907],"domain_scores_gemma":[0.9984317,0.00028255547,0.00008562234,0.0009681473,0.00015319142,0.00007881356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073626457,0.00011697846,0.00012913802,0.00010325012,0.00017110087,0.000084786276,0.0011589011,0.000054190245,0.000026952603],"category_scores_gemma":[0.00012636158,0.00008604759,0.00006649972,0.0007032681,0.00013234824,0.00046195398,0.000052531,0.0001962333,0.000036973466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024045523,0.00016770892,0.00049433374,0.0000016256905,0.0000058282717,0.0000042578163,0.00028793135,0.0000068228305,0.0024886262,0.99137187,0.00025787967,0.004889045],"study_design_scores_gemma":[0.0003931729,0.00029670857,0.015292274,0.000012127831,0.00000179725,0.000004282144,0.000028049546,0.00079811906,0.0079785595,0.9749717,0.00012539457,0.000097806675],"about_ca_topic_score_codex":0.0000045304946,"about_ca_topic_score_gemma":6.274126e-7,"teacher_disagreement_score":0.016400188,"about_ca_system_score_codex":0.000029470979,"about_ca_system_score_gemma":0.000040291994,"threshold_uncertainty_score":0.35089192},"labels":[],"label_agreement":null},{"id":"W2399115616","doi":"","title":"On perfect matchings of complements of line graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Strong perfect graph theorem; Combinatorics; Line (geometry); Line graph; Graph; Pathwidth; Geometry","score_opus":0.01831039347412789,"score_gpt":0.30327599173074093,"score_spread":0.28496559825661305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399115616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927649,0.00006401769,0.004527853,0.00024857998,0.00034258113,0.0002030315,0.000004381078,0.000058625323,0.0017860119],"genre_scores_gemma":[0.9968504,0.000010555931,0.0029839678,0.00010187222,0.000001392357,0.0000029296411,0.000002088034,0.0000066227435,0.000040219722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985753,0.00010879182,0.0002929234,0.0002637492,0.0004958033,0.00026339944],"domain_scores_gemma":[0.9987287,0.00022321507,0.00015116474,0.00067181996,0.00014887247,0.00007624526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004730488,0.0001241833,0.00025266805,0.00022972362,0.000060801096,0.000015026205,0.0010226296,0.000036196154,0.000016819879],"category_scores_gemma":[0.0000792557,0.00011591277,0.000095106094,0.0006662538,0.00007992887,0.00020284834,0.00014577634,0.0001628974,0.000011381998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003256429,0.00026660098,0.0005683614,0.000012597932,0.000013262879,0.000003872534,0.00020079174,0.00003296611,0.0056415573,0.9863174,0.00018287868,0.0067271627],"study_design_scores_gemma":[0.0007574728,0.001124122,0.0037814542,0.00003921171,0.0000025318016,0.0000016377521,0.000008102428,0.00060179573,0.038989212,0.9545559,0.0000427963,0.000095746494],"about_ca_topic_score_codex":0.000009097511,"about_ca_topic_score_gemma":4.4131255e-7,"teacher_disagreement_score":0.033347655,"about_ca_system_score_codex":0.00002050037,"about_ca_system_score_gemma":0.00002795364,"threshold_uncertainty_score":0.47267857},"labels":[],"label_agreement":null},{"id":"W2399124203","doi":"","title":"Chromatic Equivalence Classes of Certain Generalized Polygon Trees, II.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Polygon (computer graphics); Equivalence (formal languages); Combinatorics; Discrete mathematics; Computer science","score_opus":0.024112489386356562,"score_gpt":0.2922007125848054,"score_spread":0.2680882231984488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399124203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9821664,0.0008656454,0.0106851095,0.00022368724,0.0009679531,0.00031520295,0.0000025680552,0.0001667769,0.0046066283],"genre_scores_gemma":[0.98601705,0.000052842213,0.012986033,0.000057796362,0.0000032344683,0.000025702793,0.0000013736662,0.000017863726,0.00083811185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778694,0.00038959054,0.00035899653,0.00042109855,0.0005371302,0.00050621986],"domain_scores_gemma":[0.9981816,0.00029582405,0.0001569242,0.0010674965,0.00014557374,0.00015259295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064103364,0.00019313072,0.00031605264,0.00019774625,0.00019197767,0.000046983587,0.0012628773,0.00007664406,0.000053039228],"category_scores_gemma":[0.00037881167,0.00018372116,0.000105429164,0.0010197539,0.00016940483,0.00048156793,0.0003092631,0.00017608887,0.000028606537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000805848,0.0001463441,0.0006553204,0.000026406331,0.00001967097,0.0000113546785,0.00021712406,0.000033957393,0.016732702,0.9806087,0.0002772329,0.0012631197],"study_design_scores_gemma":[0.0009842722,0.00029436807,0.00071211724,0.000040900028,0.000005803863,0.0000134416105,0.00002876334,0.0016860791,0.059057817,0.9357835,0.0011737661,0.00021919352],"about_ca_topic_score_codex":0.000022238499,"about_ca_topic_score_gemma":0.0000043349364,"teacher_disagreement_score":0.044825234,"about_ca_system_score_codex":0.00006989281,"about_ca_system_score_gemma":0.00015406254,"threshold_uncertainty_score":0.74919313},"labels":[],"label_agreement":null},{"id":"W2399164534","doi":"","title":"A note on the minus edge domination number in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.014579100765571505,"score_gpt":0.2773220108462605,"score_spread":0.262742910080689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399164534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803839,0.00002651686,0.0013747297,0.0037346769,0.001028548,0.0006308319,6.172081e-7,0.00009369821,0.012726482],"genre_scores_gemma":[0.9982777,0.00000644115,0.00085935456,0.00032681494,0.0000040268183,0.00015936194,7.426819e-7,0.000011238581,0.00035427196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848914,0.0002423774,0.00018136179,0.00033090328,0.00038675513,0.00036946457],"domain_scores_gemma":[0.9982933,0.0006901056,0.00005808246,0.000764236,0.00011926204,0.0000750165],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00059613684,0.00013253372,0.00012501092,0.00014536966,0.00012763566,0.00013530634,0.0011294541,0.000062771505,0.00009435069],"category_scores_gemma":[0.00020612529,0.000096750846,0.00005714989,0.001012167,0.00010164295,0.0005345452,0.0002300499,0.00031189658,0.0011210921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005325536,0.00008464483,0.001066996,0.0000028773131,0.0000034120715,0.0000080099735,0.0003896536,0.0000049054593,0.00043849339,0.98801285,0.0017508528,0.008231954],"study_design_scores_gemma":[0.00047939725,0.00005260537,0.009919221,0.000017102397,7.2280363e-7,0.00000364435,0.00002252454,0.0025630968,0.003195358,0.9830704,0.00055306894,0.0001228687],"about_ca_topic_score_codex":0.000052062638,"about_ca_topic_score_gemma":0.000008112441,"teacher_disagreement_score":0.017893849,"about_ca_system_score_codex":0.00007578994,"about_ca_system_score_gemma":0.000033977034,"threshold_uncertainty_score":0.9996567},"labels":[],"label_agreement":null},{"id":"W2399194235","doi":"","title":"On the Graceful Conjecture of Permutation Graphs of Paths.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Permutation (music); Combinatorics; Permutation graph; Discrete mathematics; Graph","score_opus":0.012217092392140286,"score_gpt":0.2677866521883211,"score_spread":0.2555695597961808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399194235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.993827,0.000109736495,0.0027397794,0.0010867204,0.00031758833,0.00023928512,0.0000025833033,0.0000418597,0.0016354818],"genre_scores_gemma":[0.9993372,0.000010518805,0.00047600517,0.00013766572,0.0000012630984,0.000005030015,0.0000010507626,0.0000047331346,0.000026535043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884206,0.00016523358,0.00019832654,0.0002019288,0.0004105857,0.00018186595],"domain_scores_gemma":[0.99853516,0.00047569518,0.00013955125,0.00064905355,0.0001587216,0.00004183111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044419107,0.00009994325,0.00015688686,0.00012683927,0.00007537413,0.000017909282,0.00083204056,0.0000483737,0.000010118764],"category_scores_gemma":[0.00019778742,0.000069413756,0.000082870785,0.00072767923,0.0001195326,0.00015920079,0.00006147204,0.0001795976,0.0000063608813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016073649,0.00009175257,0.00016921242,0.0000051066377,0.000008163745,0.0000028718569,0.00048524071,0.00005736892,0.0030312012,0.99200803,0.00019050963,0.003934488],"study_design_scores_gemma":[0.00030838457,0.00048105526,0.0040633287,0.000020303763,0.0000023804203,0.000002174747,0.000031928204,0.0005900432,0.027076319,0.96732634,0.000030727228,0.00006700491],"about_ca_topic_score_codex":0.000003244205,"about_ca_topic_score_gemma":4.249081e-7,"teacher_disagreement_score":0.02468166,"about_ca_system_score_codex":0.000015049572,"about_ca_system_score_gemma":0.00003755258,"threshold_uncertainty_score":0.2830611},"labels":[],"label_agreement":null},{"id":"W2399259489","doi":"","title":"Stratified Graphs and Distance Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Pathwidth; Combinatorics; Graph; Line graph","score_opus":0.012345431544107287,"score_gpt":0.2620143591608478,"score_spread":0.24966892761674053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399259489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98404,0.0007268522,0.001828096,0.00040250973,0.00047509305,0.0002686387,0.0000040610344,0.00033088616,0.011923813],"genre_scores_gemma":[0.99666154,0.00017777282,0.002210835,0.000105007086,0.0000015306582,0.00002328083,0.000001758537,0.0000127811545,0.00080550706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844044,0.00010906866,0.00019137509,0.00049698685,0.00034390306,0.000418233],"domain_scores_gemma":[0.99881893,0.0001427765,0.00003956145,0.0007508564,0.00006027852,0.00018759091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029518997,0.00016719034,0.00017495606,0.00011423143,0.00023334468,0.00016986809,0.00083556154,0.000059761445,0.00006987153],"category_scores_gemma":[0.000024282572,0.00016196426,0.00005575548,0.00083167147,0.00022080589,0.0006401604,0.00011237756,0.0002239065,0.00005568141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014900541,0.000049749626,0.0012436294,0.000006926142,0.000010641749,0.00002098451,0.00015991673,0.000003700239,0.00019657546,0.9709309,0.00030457333,0.02705755],"study_design_scores_gemma":[0.00052090845,0.00009735465,0.004879062,0.000011805729,0.0000022040874,0.000010684991,0.000012093568,0.00062418036,0.000648888,0.99102336,0.0019760926,0.00019333493],"about_ca_topic_score_codex":0.00000949031,"about_ca_topic_score_gemma":0.000005563725,"teacher_disagreement_score":0.026864216,"about_ca_system_score_codex":0.000017087159,"about_ca_system_score_gemma":0.000030352669,"threshold_uncertainty_score":0.6604711},"labels":[],"label_agreement":null},{"id":"W2399307741","doi":"","title":"On super connectedness and super restricted edge-connectedness of total graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Social connectedness; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Computer science; Telecommunications; Social psychology; Psychology","score_opus":0.01126689764005305,"score_gpt":0.24872080505315078,"score_spread":0.23745390741309774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399307741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944899,0.00009923647,0.0019884582,0.00020595058,0.0013875559,0.00028601568,0.0000055340265,0.0001864973,0.0013508416],"genre_scores_gemma":[0.9990753,0.00001545361,0.00063696486,0.0000852372,0.000007552296,0.00002795218,0.0000059597264,0.000028040346,0.00011757471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748445,0.00041569263,0.00035125506,0.00067019975,0.0005441772,0.0005342479],"domain_scores_gemma":[0.99688256,0.0013272212,0.00009659487,0.0010841214,0.00036984423,0.00023967042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048271834,0.00026999382,0.0004081976,0.00040716561,0.00018932862,0.000091442096,0.0008761218,0.00014835941,0.00002458099],"category_scores_gemma":[0.0008310426,0.0002511244,0.0000866861,0.0013688606,0.00033022912,0.0005015848,0.00041177147,0.00034489852,0.000025863841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058361784,0.00017035294,0.00224206,0.000028097731,0.000027005817,0.000009498631,0.00035076417,0.000014029927,0.0042194976,0.9904938,0.0002911914,0.0020953876],"study_design_scores_gemma":[0.0020068137,0.0006875867,0.018041467,0.00005617654,0.000008842353,0.000022323355,0.000051262876,0.0025550602,0.012130021,0.96391726,0.00016125498,0.00036191152],"about_ca_topic_score_codex":0.000032645203,"about_ca_topic_score_gemma":0.0000032653365,"teacher_disagreement_score":0.026576474,"about_ca_system_score_codex":0.00003397995,"about_ca_system_score_gemma":0.00006593817,"threshold_uncertainty_score":0.9999941},"labels":[],"label_agreement":null},{"id":"W2399320116","doi":"","title":"Equality in Vizing’s conjecture fixing one factor of the Cartesian product.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Bipartite graph; Conjecture; Combinatorics; Vertex (graph theory); Product (mathematics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Geometry","score_opus":0.0228087891237739,"score_gpt":0.2871580980097687,"score_spread":0.26434930888599484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399320116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99572426,0.000045836194,0.00029417436,0.0010068055,0.0016826539,0.0003440884,0.0000035316325,0.00005359337,0.0008450817],"genre_scores_gemma":[0.9985691,0.0000012213434,0.0012620483,0.00004765742,0.0000093564895,0.000012830205,4.56178e-7,0.000010306352,0.000087053035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983424,0.00023600714,0.0002559568,0.0003803199,0.00043442773,0.00035087258],"domain_scores_gemma":[0.9981917,0.00021954282,0.00011768268,0.0012820946,0.000116010924,0.000072942195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007033833,0.00012814614,0.00021012998,0.00009816623,0.00010572987,0.00004452075,0.0015436129,0.00007372029,0.000013053252],"category_scores_gemma":[0.0004213695,0.000099653174,0.00006889174,0.0008503286,0.00018158637,0.0002917195,0.00047327348,0.000695928,0.0000066721136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045299485,0.00009967781,0.024493767,0.000020767002,0.000007462301,0.000002014629,0.0010075633,0.0000038819644,0.06445951,0.9083947,0.000026738566,0.001479388],"study_design_scores_gemma":[0.00045795177,0.000042574567,0.059552092,0.000027062286,0.0000016719341,0.0000033831013,0.000023189828,0.00021670198,0.15841775,0.7808409,0.00027047034,0.00014625023],"about_ca_topic_score_codex":0.00007219092,"about_ca_topic_score_gemma":0.000116506664,"teacher_disagreement_score":0.12755379,"about_ca_system_score_codex":0.000035384117,"about_ca_system_score_gemma":0.00012489344,"threshold_uncertainty_score":0.40637386},"labels":[],"label_agreement":null},{"id":"W2399337215","doi":"","title":"Upper signed k-domination number in graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Discrete mathematics; Graph","score_opus":0.021875333837572754,"score_gpt":0.29686836802903455,"score_spread":0.2749930341914618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399337215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96954554,0.000107082866,0.008258884,0.0008157824,0.0018411039,0.000371079,9.0392655e-7,0.00021396996,0.018845668],"genre_scores_gemma":[0.9953237,0.000004432827,0.004185561,0.00009257038,0.0000034424706,0.000037057023,0.0000020452783,0.000012852314,0.0003383282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983531,0.00021763818,0.00020606112,0.0003625641,0.0004813717,0.00037921744],"domain_scores_gemma":[0.9988431,0.0001588663,0.00005400416,0.0005735246,0.00019218658,0.00017833877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009438303,0.00012840345,0.00015965015,0.00022149856,0.000054700595,0.00008349138,0.00088010746,0.00007254564,0.000018019999],"category_scores_gemma":[0.00024390065,0.00012926328,0.000048714603,0.0012271982,0.00007287973,0.0008520397,0.0002730208,0.00020181653,0.00033405604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016290629,0.00009693465,0.012636801,0.0000028786403,0.0000041192234,0.00002374366,0.0005028648,0.000013442336,0.00018080391,0.983036,0.00086943666,0.0026166895],"study_design_scores_gemma":[0.0013490882,0.00006508703,0.0038300161,0.0000099353065,9.680383e-7,0.0000074686204,0.000052517717,0.0019025512,0.001503219,0.99041563,0.00070425606,0.00015928205],"about_ca_topic_score_codex":0.000023186165,"about_ca_topic_score_gemma":0.0000058173337,"teacher_disagreement_score":0.025778186,"about_ca_system_score_codex":0.00011659805,"about_ca_system_score_gemma":0.00009103278,"threshold_uncertainty_score":0.52712035},"labels":[],"label_agreement":null},{"id":"W2399364444","doi":"","title":"Universal Graphs for Two Graph Properties.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019782428225242375,"score_gpt":0.26455577135395875,"score_spread":0.24477334312871638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399364444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47525674,0.00033393202,0.50553745,0.001615205,0.0050054747,0.0016608062,0.000005963007,0.0010884281,0.009496011],"genre_scores_gemma":[0.99222463,0.0000057560574,0.007191061,0.00014711687,0.000007793194,0.000058498033,0.00000189366,0.000020727719,0.0003425348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841166,0.00014374254,0.00016748528,0.00046061972,0.00031570878,0.0005007599],"domain_scores_gemma":[0.99853706,0.00021506882,0.00006359892,0.00080942374,0.00021154089,0.00016327939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006239574,0.00016357008,0.00018795628,0.00022402036,0.00026184967,0.00010568473,0.0013927314,0.000051521656,0.0000045492334],"category_scores_gemma":[0.00014471401,0.0001484131,0.00012376066,0.0007012708,0.00016133026,0.00056552415,0.00028014043,0.00016464008,0.000037012203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024598623,0.00005528493,0.00022612876,0.000012629417,0.000016241074,0.0000019867666,0.00013776595,0.00003089995,0.0017214285,0.9913497,0.00061233144,0.0058109886],"study_design_scores_gemma":[0.0014773487,0.00025034376,0.000107646396,0.000014242592,0.000004152738,0.0000035078099,0.000016896402,0.007382877,0.0066797347,0.97899383,0.0048611583,0.00020824843],"about_ca_topic_score_codex":0.000013847741,"about_ca_topic_score_gemma":0.0000034530788,"teacher_disagreement_score":0.5169679,"about_ca_system_score_codex":0.000039771294,"about_ca_system_score_gemma":0.000054485725,"threshold_uncertainty_score":0.6052111},"labels":[],"label_agreement":null},{"id":"W2399497525","doi":"","title":"On Strong Biclique Covering.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complete bipartite graph; Combinatorics; Bipartite graph; Graph","score_opus":0.019870713523877256,"score_gpt":0.2927214093300953,"score_spread":0.272850695806218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399497525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.938382,0.0002425099,0.034632366,0.0003620386,0.0036880164,0.0002833795,0.000002059816,0.00040216072,0.022005456],"genre_scores_gemma":[0.99770707,0.0000060629195,0.0018024592,0.00016159085,0.000011443928,0.00001903918,8.295602e-7,0.000013976259,0.00027750607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864113,0.00010888313,0.00012308455,0.00023791296,0.00034198596,0.0005469923],"domain_scores_gemma":[0.9987076,0.00028031995,0.000043732052,0.0007135098,0.00004970737,0.0002051587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047312558,0.0001240342,0.0001203193,0.00011536015,0.00012052416,0.00006202569,0.0008268794,0.000052241016,0.000026514903],"category_scores_gemma":[0.00012413153,0.00011789208,0.000051196934,0.0004042837,0.000050750787,0.00072478305,0.00030304055,0.00024174355,0.00040255312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151614,0.00010131128,0.0017181339,0.0000034246152,0.0000074865316,0.0000040150508,0.00012319288,0.000021937578,0.00031112594,0.9950334,0.0006011164,0.0020666986],"study_design_scores_gemma":[0.00042408612,0.00015683794,0.0032020742,0.000012559775,0.0000012903296,0.0000057378948,0.0000104635965,0.00063833897,0.0066664782,0.98564106,0.0030582945,0.00018276602],"about_ca_topic_score_codex":0.000004481632,"about_ca_topic_score_gemma":3.2435614e-7,"teacher_disagreement_score":0.05932508,"about_ca_system_score_codex":0.000076467244,"about_ca_system_score_gemma":0.000030651536,"threshold_uncertainty_score":0.51741403},"labels":[],"label_agreement":null},{"id":"W2399511925","doi":"","title":"A Note on Spanning Eulerian Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eulerian path; Combinatorics; Pure mathematics","score_opus":0.033092864583891206,"score_gpt":0.28432877365137516,"score_spread":0.25123590906748394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399511925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.837471,0.00017158782,0.03367943,0.00055661873,0.0060772635,0.00067141815,0.0000032935557,0.001189243,0.120180115],"genre_scores_gemma":[0.98891467,0.0000073644483,0.010616392,0.00021648464,0.0000046941127,0.000023169407,7.1604336e-7,0.000020159887,0.00019636602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983334,0.00012805466,0.00017955898,0.00047345363,0.000383944,0.000501584],"domain_scores_gemma":[0.99851966,0.00012827462,0.00006952413,0.0010032488,0.00009126712,0.00018800404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000434294,0.00017249271,0.00016893465,0.0002508208,0.00019425541,0.000069114496,0.0014221654,0.000069847025,0.00004117013],"category_scores_gemma":[0.00009932906,0.00016586889,0.00008713307,0.00080196466,0.000106390864,0.00047256058,0.00033757943,0.00030109184,0.00035819213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022807482,0.000097067124,0.000733522,0.0000037171599,0.000009931646,0.00005645295,0.00096334645,0.0000022731224,0.00041079748,0.9914211,0.00022855024,0.0060504256],"study_design_scores_gemma":[0.00047062783,0.00029413556,0.0048378464,0.000022569691,0.0000019393217,0.000006880506,0.00001607225,0.00048787106,0.0078109517,0.98491037,0.0009363282,0.00020439184],"about_ca_topic_score_codex":0.00001757254,"about_ca_topic_score_gemma":0.000001582446,"teacher_disagreement_score":0.15144362,"about_ca_system_score_codex":0.00004104372,"about_ca_system_score_gemma":0.000044377157,"threshold_uncertainty_score":0.6763937},"labels":[],"label_agreement":null},{"id":"W2399604044","doi":"","title":"The Upper and Lower Geodetic Numbers of Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Geodetic datum; Vertex (graph theory); Digraph; Graph; Connectivity; Conjecture; Upper and lower bounds; Discrete mathematics; Geodesy","score_opus":0.00831600444327827,"score_gpt":0.2604379802694791,"score_spread":0.25212197582620083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399604044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890258,0.000951162,0.0011663265,0.0017118404,0.0009318991,0.0002192218,7.43007e-7,0.000083210696,0.0059098215],"genre_scores_gemma":[0.9986492,0.00010939254,0.0009584217,0.000105209474,0.0000015883145,0.0000040030795,1.6800362e-7,0.000004970103,0.00016706368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895406,0.00008480981,0.00015410676,0.0002297728,0.00028797175,0.00028926396],"domain_scores_gemma":[0.9988758,0.00026907222,0.00005450217,0.00062385254,0.00009144675,0.000085339765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000411753,0.000095428106,0.00011750965,0.00006341479,0.00018512538,0.00006805762,0.0007833177,0.000037567595,0.0000034665056],"category_scores_gemma":[0.000078525925,0.000069220056,0.000051572388,0.0004459252,0.00020814453,0.00024215125,0.00021050693,0.00014686552,0.000010066949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011419545,0.00003773298,0.0009226738,0.000001960822,0.0000070575798,0.000004448544,0.00012569722,0.0000019366,0.00031573328,0.98329186,0.0002703458,0.015009149],"study_design_scores_gemma":[0.0003036655,0.00016959643,0.008248077,0.0000087026165,0.0000019908061,0.0000062796835,0.000018182394,0.0003600407,0.0010361632,0.9889733,0.00079107546,0.00008289429],"about_ca_topic_score_codex":0.000004688815,"about_ca_topic_score_gemma":0.0000010518629,"teacher_disagreement_score":0.014926255,"about_ca_system_score_codex":0.000012200817,"about_ca_system_score_gemma":0.000024936135,"threshold_uncertainty_score":0.28227118},"labels":[],"label_agreement":null},{"id":"W2399633863","doi":"","title":"On (l, m)-Walk-regular Digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02446002684681085,"score_gpt":0.2597508041205264,"score_spread":0.23529077727371558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399633863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86951643,0.0003378904,0.023488354,0.0003825309,0.004155176,0.0006245724,0.0000031317925,0.0010319076,0.10046001],"genre_scores_gemma":[0.9948833,0.000011471966,0.0044493843,0.00020071414,0.0000036223926,0.000028551805,8.848089e-7,0.00001893774,0.00040312987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982702,0.00013096347,0.00017832873,0.0004855621,0.00045050768,0.0004844327],"domain_scores_gemma":[0.9982272,0.00015649959,0.000060710336,0.001262246,0.00010102692,0.00019231539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038777463,0.00017753325,0.0001704887,0.00023117589,0.00016868567,0.000060749495,0.0016481428,0.00007284332,0.000066547276],"category_scores_gemma":[0.00009656689,0.00016443725,0.00010048892,0.0007868561,0.00013449694,0.00047428912,0.00032653013,0.00025671403,0.0004387741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018847155,0.00015834557,0.0004910648,0.0000036064048,0.00001596125,0.000044601897,0.0003674715,0.0000013888036,0.00020050093,0.99366945,0.0008477029,0.0041810567],"study_design_scores_gemma":[0.00045960804,0.00030243944,0.0022808528,0.00001354527,0.000002145405,0.0000060549264,0.000011557126,0.00021441789,0.008979017,0.98658097,0.0009528909,0.0001965259],"about_ca_topic_score_codex":0.000011910539,"about_ca_topic_score_gemma":0.0000011461241,"teacher_disagreement_score":0.12536688,"about_ca_system_score_codex":0.000035801044,"about_ca_system_score_gemma":0.00003775853,"threshold_uncertainty_score":0.67055565},"labels":[],"label_agreement":null},{"id":"W2399636163","doi":"","title":"k-Domination stable graphs upon edge removal.","year":2015,"lang":"ceb","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.034739600357956174,"score_gpt":0.2989108015642031,"score_spread":0.26417120120624693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399636163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.861386,0.008737967,0.01714348,0.0030770325,0.033712298,0.0025100613,0.00003948372,0.00092297734,0.07247069],"genre_scores_gemma":[0.98859763,0.00017921333,0.004930952,0.00014872325,0.000040754938,0.000046441037,0.000018745779,0.00007828998,0.005959229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99416596,0.00093204406,0.0006619782,0.0012018337,0.001691953,0.0013462168],"domain_scores_gemma":[0.99508923,0.00046720452,0.00033025397,0.0019849732,0.0012475528,0.000880794],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036123684,0.0005109681,0.0005701664,0.00064080564,0.0004277185,0.00053552305,0.0024300169,0.0002995474,0.000067391025],"category_scores_gemma":[0.00097046694,0.0005572891,0.00021371007,0.0029838104,0.0003047465,0.0020538894,0.0011420819,0.00079876074,0.0011674671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012591887,0.00038192607,0.00045090498,0.00004658638,0.000055286073,0.00020202603,0.001368663,0.000077881916,0.00056778465,0.97340107,0.009604199,0.013717765],"study_design_scores_gemma":[0.0029484937,0.00055863016,0.00031498194,0.000091077985,0.000024992261,0.00006947267,0.0002624148,0.011894154,0.0042784116,0.9518277,0.027117217,0.0006124712],"about_ca_topic_score_codex":0.00008580092,"about_ca_topic_score_gemma":0.000013792312,"teacher_disagreement_score":0.12721163,"about_ca_system_score_codex":0.0005034716,"about_ca_system_score_gemma":0.00068901945,"threshold_uncertainty_score":0.99968785},"labels":[],"label_agreement":null},{"id":"W2399752582","doi":"","title":"A surprising regularity in the number of Hamilton paths in polygonal bigraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.013920836536014064,"score_gpt":0.2833612627848556,"score_spread":0.26944042624884157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399752582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99368155,0.000058502465,0.0024216322,0.00022872536,0.00030879516,0.00016063672,7.6491625e-7,0.000026641488,0.0031127275],"genre_scores_gemma":[0.9979921,0.00001007357,0.001851067,0.00009472918,0.0000033382344,0.000014534216,9.0510446e-7,0.000007851847,0.000025418492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780846,0.0006934352,0.00029710372,0.00032609067,0.00050091353,0.00037398317],"domain_scores_gemma":[0.9983428,0.0006092862,0.000085729,0.0008455724,0.000068634756,0.000047978516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002547542,0.00012217066,0.00021264839,0.0002155204,0.000060358998,0.000049842936,0.001369042,0.00007363144,0.0000043473674],"category_scores_gemma":[0.00019941169,0.00009942189,0.00006586546,0.0015637592,0.00014976751,0.00031572676,0.00019523005,0.00036649007,0.000010509477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001238599,0.00014198454,0.069906905,0.000009889114,0.0000028834986,0.000012457514,0.0012731133,0.000009170564,0.00035329792,0.92544794,0.000024422692,0.0028055434],"study_design_scores_gemma":[0.00061030436,0.0000404774,0.09438747,0.000035326648,8.500437e-7,0.000010300651,0.00005057852,0.0017007468,0.0009294073,0.9019827,0.00014742506,0.00010438176],"about_ca_topic_score_codex":0.00019493833,"about_ca_topic_score_gemma":0.00006890265,"teacher_disagreement_score":0.024480566,"about_ca_system_score_codex":0.000037144873,"about_ca_system_score_gemma":0.000044667006,"threshold_uncertainty_score":0.40543073},"labels":[],"label_agreement":null},{"id":"W2399769410","doi":"","title":"On Some Rational Difference Equations.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Applied mathematics","score_opus":0.022771295870573267,"score_gpt":0.292089862847564,"score_spread":0.26931856697699075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399769410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7337517,0.00025421174,0.24135534,0.0101727,0.0028227477,0.00066772546,0.0000052222294,0.0007432651,0.010227092],"genre_scores_gemma":[0.9968033,0.000005483382,0.0019323925,0.00078419794,0.0000059228787,0.000012916794,0.0000033985646,0.000004549173,0.00044783315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987183,0.00009125465,0.00014299076,0.0003119093,0.00046740272,0.0002681356],"domain_scores_gemma":[0.9987533,0.00044497257,0.000045186775,0.0005625218,0.00009292222,0.00010109271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023111945,0.00010876067,0.00010382868,0.00013579939,0.00018750191,0.000103965474,0.0008424511,0.00004103634,0.000017818706],"category_scores_gemma":[0.00025151932,0.000102557555,0.000042916017,0.00041075452,0.00004469698,0.00046642422,0.00008310528,0.0001856087,0.00021515238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070720766,0.000112249894,0.000033220065,7.8354066e-7,0.0000029701152,0.000005376076,0.000056735436,0.000062470186,0.0008042451,0.98966265,0.00029130242,0.008960918],"study_design_scores_gemma":[0.00036598172,0.0002386973,0.004645067,0.000008028314,7.3312845e-7,0.0000013655425,0.0000018815431,0.0072610746,0.0014720625,0.9858147,0.000074063384,0.000116362055],"about_ca_topic_score_codex":8.274775e-7,"about_ca_topic_score_gemma":1.8426788e-7,"teacher_disagreement_score":0.2630516,"about_ca_system_score_codex":0.000055192766,"about_ca_system_score_gemma":0.00006484506,"threshold_uncertainty_score":0.41821757},"labels":[],"label_agreement":null},{"id":"W2399777153","doi":"","title":"Edge choosability and total choosability of toroidal graphs without intersecting triangles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Combinatorics; Physics; Plasma","score_opus":0.019398212443042493,"score_gpt":0.28856796817331604,"score_spread":0.2691697557302735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399777153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99529636,0.00042820207,0.0012371389,0.00008079058,0.0015017112,0.0003687416,0.000004623066,0.00011977874,0.00096266036],"genre_scores_gemma":[0.997173,0.0000067514056,0.0027117904,0.00001735225,0.00001572512,0.000024762747,0.0000013527639,0.000014948429,0.000034309338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997712,0.00037689204,0.00041319965,0.00049048965,0.00040187806,0.0006055095],"domain_scores_gemma":[0.99789375,0.00049679383,0.0001584408,0.00097389217,0.00016430859,0.00031280017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020792224,0.00021451316,0.00037920268,0.00013424769,0.00015224922,0.00005642168,0.0006848922,0.00010123005,0.00002154021],"category_scores_gemma":[0.00074905844,0.00020335935,0.00012693327,0.0006116601,0.00040795628,0.0011985372,0.0007005146,0.0003559504,0.0000104765695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006918503,0.00036767015,0.37755567,0.00006746414,0.000032822387,0.0000010874136,0.0018557791,0.0000013463456,0.0025265028,0.60897154,0.000041994732,0.008508927],"study_design_scores_gemma":[0.0019210933,0.00031697954,0.23295952,0.00003724904,0.000012914326,0.000033942008,0.00037339292,0.0005190209,0.01447923,0.74883795,0.00011101142,0.00039768426],"about_ca_topic_score_codex":0.000051463285,"about_ca_topic_score_gemma":0.0000046164564,"teacher_disagreement_score":0.14459613,"about_ca_system_score_codex":0.00010531658,"about_ca_system_score_gemma":0.000057225057,"threshold_uncertainty_score":0.8292753},"labels":[],"label_agreement":null},{"id":"W2399807751","doi":"","title":"A Unified A pproach to External Graphs for Different Indices.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.046065597460661016,"score_gpt":0.30777249807071533,"score_spread":0.2617069006100543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399807751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78377336,0.00015247906,0.2115407,0.00057608885,0.0017484864,0.00094577373,0.000005031874,0.0002227578,0.0010353207],"genre_scores_gemma":[0.98152006,0.0000025022782,0.017632391,0.00020255712,0.000009821238,0.00024441336,0.0000025474149,0.000020464424,0.000365244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804956,0.000119851364,0.00021806934,0.0005129552,0.00055128173,0.00054826034],"domain_scores_gemma":[0.99818546,0.00019001162,0.00007012795,0.00079251605,0.00022958919,0.0005322914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063741056,0.00018868255,0.0002306744,0.0002879808,0.00012456838,0.00016571989,0.001649499,0.00006704752,0.0000027305975],"category_scores_gemma":[0.0002014123,0.00016671846,0.00009171103,0.00073637406,0.000057193003,0.000352125,0.000524119,0.00018581127,0.000043081996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006639332,0.00014385034,0.0012096922,0.000009783176,0.000015375472,0.0000083005,0.0006735721,0.000017822778,0.0005153931,0.9909985,0.00089944876,0.0054418542],"study_design_scores_gemma":[0.0015120738,0.00048023788,0.001903643,0.000017674565,0.0000038138628,0.000006655513,0.0000467577,0.0017909812,0.002786331,0.9900379,0.0011974993,0.00021643448],"about_ca_topic_score_codex":0.0000113886645,"about_ca_topic_score_gemma":0.0000037733798,"teacher_disagreement_score":0.1977467,"about_ca_system_score_codex":0.000098409306,"about_ca_system_score_gemma":0.00009450693,"threshold_uncertainty_score":0.67985815},"labels":[],"label_agreement":null},{"id":"W2399867629","doi":"","title":"Number of Embeddings of Wheel Graphs on Surfaces of Small Genus.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genus; Mathematics; Combinatorics; Zoology; Biology","score_opus":0.031631023267120896,"score_gpt":0.28210353163178187,"score_spread":0.25047250836466095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399867629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900435,0.00006655846,0.0006298468,0.000012887179,0.0004244653,0.00014599337,0.0000047609524,0.00003366116,0.008638316],"genre_scores_gemma":[0.98835486,0.000024269091,0.011498585,0.000010784884,9.024321e-7,0.0000055098676,5.580737e-7,0.000012902312,0.000091635586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985367,0.00011931293,0.00037524413,0.00029171453,0.00040483038,0.00027219846],"domain_scores_gemma":[0.99827355,0.00022731647,0.00028776066,0.0008139893,0.00031472716,0.00008263103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005320976,0.00013882536,0.00032705395,0.00016901677,0.00003447554,0.0000068522086,0.001275428,0.00007240386,0.00004411295],"category_scores_gemma":[0.00009524206,0.00013080254,0.00012181208,0.00072482525,0.00027383096,0.00021627764,0.0002950974,0.00015085257,0.000017233891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048540605,0.00028001328,0.022416433,0.000052954765,0.00003638464,0.000003861516,0.0012592656,0.000008768621,0.0035460608,0.97120523,0.000060352446,0.001082103],"study_design_scores_gemma":[0.00047589946,0.00028726834,0.009935001,0.000053335494,0.000005162555,0.000002299747,0.000050994,0.00025579735,0.15861613,0.83017135,0.000033596767,0.00011319769],"about_ca_topic_score_codex":0.00009075554,"about_ca_topic_score_gemma":0.0000028414945,"teacher_disagreement_score":0.15507007,"about_ca_system_score_codex":0.000013448565,"about_ca_system_score_gemma":0.000048744663,"threshold_uncertainty_score":0.53339726},"labels":[],"label_agreement":null},{"id":"W2399957385","doi":"","title":"Equitable Coloring and Equitable Choosability of Planar Graphs without 6- and 7-Cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar graph; List coloring; Combinatorics; Graph","score_opus":0.026221059166199247,"score_gpt":0.2945141008722831,"score_spread":0.2682930417060838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399957385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940381,0.0017884205,0.0016133708,0.000088434506,0.00047790707,0.00025989523,0.0000035258,0.00007968842,0.0016506742],"genre_scores_gemma":[0.9942832,0.00007026424,0.005513116,0.0000230746,0.0000051120746,0.000021509572,8.3801433e-7,0.000012846039,0.00007001509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981206,0.00013201547,0.00024126624,0.0003578532,0.00032816106,0.0008200804],"domain_scores_gemma":[0.9986193,0.0003240293,0.00009480706,0.0005970548,0.00008852679,0.0002762442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016826681,0.00016085917,0.00029457128,0.00013467015,0.000226091,0.00006541811,0.0005048,0.0000718046,0.0000061776855],"category_scores_gemma":[0.00015449758,0.00015544203,0.00003437294,0.00046651004,0.00029772086,0.0012429451,0.0007867914,0.00019664338,0.000004724429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018085355,0.0000827016,0.20533629,0.00005228964,0.000016187858,0.0000010361076,0.00036151306,0.0000011355152,0.0023291258,0.790467,0.000043765805,0.0012908453],"study_design_scores_gemma":[0.0008081618,0.00015945251,0.041946992,0.000030539315,0.000008662571,0.000014352955,0.00010254258,0.00031881506,0.0081821745,0.9479523,0.0002708596,0.0002052048],"about_ca_topic_score_codex":0.000041902298,"about_ca_topic_score_gemma":0.0000032549963,"teacher_disagreement_score":0.1633893,"about_ca_system_score_codex":0.000038976228,"about_ca_system_score_gemma":0.000036519083,"threshold_uncertainty_score":0.6338742},"labels":[],"label_agreement":null},{"id":"W2400036930","doi":"","title":"Extremal Values for Identification, Domination and Maximum Cliques in Twin-Free Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Identification (biology); Combinatorics; Discrete mathematics; Biology; Botany","score_opus":0.031186157292333417,"score_gpt":0.29171948966739675,"score_spread":0.2605333323750633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400036930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9220075,0.0004602444,0.0735316,0.00041137973,0.0011371569,0.0009319631,0.0000057529433,0.00020087948,0.0013135494],"genre_scores_gemma":[0.982769,0.00004396582,0.016888062,0.000036026096,0.000003687131,0.00012997196,0.0000029008722,0.000013220416,0.000113173934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998644,0.00013151566,0.00027984063,0.00042931823,0.00022566193,0.00028968058],"domain_scores_gemma":[0.99867934,0.00022267638,0.00009679538,0.0007142624,0.00020961436,0.00007732412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010854674,0.00012297744,0.00015056752,0.00031867134,0.00012187429,0.00008842846,0.0009449789,0.00006736831,0.0000045436136],"category_scores_gemma":[0.00032002517,0.00012689109,0.000045433848,0.0004883119,0.0001336542,0.0008852937,0.00027655961,0.00011124415,0.0000057354723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003214675,0.00009174091,0.0052411715,0.000018126459,0.000006742507,0.0000035663572,0.0012112366,4.3646767e-7,0.00059582974,0.98545355,0.00021922313,0.0071262293],"study_design_scores_gemma":[0.0009192095,0.00010870518,0.036342736,0.000014436486,0.0000029520259,0.0000033094398,0.00005405463,0.0011385691,0.0074441256,0.9537576,0.00007766149,0.00013666638],"about_ca_topic_score_codex":0.00002025645,"about_ca_topic_score_gemma":0.000013020181,"teacher_disagreement_score":0.060761515,"about_ca_system_score_codex":0.000037347214,"about_ca_system_score_gemma":0.000030181262,"threshold_uncertainty_score":0.5174469},"labels":[],"label_agreement":null},{"id":"W2400067391","doi":"","title":"The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Strong perfect graph theorem; Graph; 1-planar graph; Line graph","score_opus":0.009662535985603777,"score_gpt":0.25304128848461727,"score_spread":0.2433787524990135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400067391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99080884,0.00022622582,0.00037088463,0.0012826286,0.003129153,0.0003598622,7.1318e-7,0.00014948321,0.0036722166],"genre_scores_gemma":[0.9993952,0.00009399375,0.00019874885,0.00016623863,0.000013094143,0.000038182716,6.7789097e-7,0.000022313265,0.0000715533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742633,0.0005587659,0.00029163875,0.00056555175,0.0005343658,0.00062336016],"domain_scores_gemma":[0.9970065,0.0016927567,0.00009125751,0.000962386,0.00007759367,0.00016954984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001942648,0.00023403838,0.00025459242,0.00020922608,0.00048443177,0.00029278253,0.0012155419,0.00009484557,0.000003880903],"category_scores_gemma":[0.00037373477,0.00017849583,0.00007216171,0.0007564061,0.0002640701,0.00036548713,0.0004368931,0.000524547,0.00006876587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048864204,0.00007718269,0.003047328,0.000007746362,0.000008667093,0.0000076095025,0.00038889472,0.00000560781,0.000322032,0.9874476,0.00024724376,0.008391225],"study_design_scores_gemma":[0.0014237373,0.00040986703,0.003065131,0.000033196313,0.0000021577675,0.0000070438095,0.000029867215,0.0025545962,0.0026821468,0.98586315,0.0037083663,0.00022075123],"about_ca_topic_score_codex":0.000025448408,"about_ca_topic_score_gemma":0.0000103191105,"teacher_disagreement_score":0.008586365,"about_ca_system_score_codex":0.000052383784,"about_ca_system_score_gemma":0.000034829616,"threshold_uncertainty_score":0.7278849},"labels":[],"label_agreement":null},{"id":"W2400282143","doi":"","title":"Alternating Domination In Arc-Colored Digraphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Colored; Combinatorics; Geometry; Political science; Law","score_opus":0.013368183136049077,"score_gpt":0.28732149776533844,"score_spread":0.27395331462928935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400282143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850744,0.00011303284,0.007595912,0.000949457,0.0006544497,0.00028557077,4.719038e-7,0.00017591042,0.005150822],"genre_scores_gemma":[0.99508715,0.000014991646,0.004638652,0.00015267907,0.000005037857,0.000017383449,0.0000015910845,0.0000070744204,0.000075438154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842197,0.00013603456,0.0002471161,0.00038771017,0.00039440155,0.00041278324],"domain_scores_gemma":[0.99904835,0.00018593704,0.000081785925,0.00050578656,0.00008749269,0.00009067017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000635909,0.00013062899,0.00016226184,0.0003731181,0.000097308584,0.00010984534,0.0010445627,0.000055629633,0.0000047399203],"category_scores_gemma":[0.00018201639,0.0001354671,0.000054028493,0.0011350123,0.000044494886,0.0007518809,0.00013788289,0.00025128154,0.000028604372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012203654,0.00010487938,0.0019280681,0.0000025396077,0.0000030966987,0.00003725639,0.00037305176,0.000053283427,0.0020907419,0.9628869,0.000051554758,0.032456394],"study_design_scores_gemma":[0.0009357117,0.00015126186,0.02638312,0.000021530186,7.867554e-7,0.0000050386116,0.000017744487,0.007994827,0.005402824,0.95882016,0.000117029595,0.0001499625],"about_ca_topic_score_codex":0.000013071207,"about_ca_topic_score_gemma":0.000005717205,"teacher_disagreement_score":0.032306433,"about_ca_system_score_codex":0.00009137326,"about_ca_system_score_gemma":0.000034069522,"threshold_uncertainty_score":0.5524188},"labels":[],"label_agreement":null},{"id":"W2400294061","doi":"","title":"The E 2 -Hamiltonian Property of Circuit Graphs of Matroids.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Mathematics; Property (philosophy); Hamiltonian (control theory); Combinatorics; Graphic matroid; Discrete mathematics; Mathematical optimization","score_opus":0.014765639995292693,"score_gpt":0.24988504009855467,"score_spread":0.235119400103262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400294061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93242633,0.0007529479,0.026831402,0.0009813006,0.0029089083,0.0010256646,0.0000055040346,0.00026115237,0.034806773],"genre_scores_gemma":[0.99885434,0.000030777934,0.00074680353,0.000024503512,0.0000024671044,0.000015400406,3.6019884e-7,0.000011362564,0.00031396098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839103,0.00024755727,0.00030329745,0.00025509717,0.0004764989,0.00032652722],"domain_scores_gemma":[0.99790484,0.00041850653,0.00016318998,0.0011870856,0.00024550754,0.000080876816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011052922,0.00011454782,0.00020966512,0.00010148419,0.0001609499,0.0000363878,0.0018812865,0.000045981313,0.0000036445665],"category_scores_gemma":[0.00023611017,0.000066597815,0.00010038434,0.00068829564,0.00035635868,0.00021356449,0.00033862333,0.00016787594,0.000014217766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008943025,0.000052756088,0.0014750551,0.000019306917,0.000016395888,7.5453545e-7,0.0001749166,0.0000045606685,0.0038914757,0.97943056,0.00018318958,0.014742092],"study_design_scores_gemma":[0.00037452613,0.00021356028,0.0033645155,0.000019180587,0.00000273664,0.0000029559894,0.000017624232,0.0008047192,0.012168433,0.98065394,0.0022866183,0.00009120865],"about_ca_topic_score_codex":0.000023757091,"about_ca_topic_score_gemma":0.000004187223,"teacher_disagreement_score":0.06642801,"about_ca_system_score_codex":0.000017501068,"about_ca_system_score_gemma":0.00005815955,"threshold_uncertainty_score":0.34959298},"labels":[],"label_agreement":null},{"id":"W2400363530","doi":"","title":"Cubic, edge critical, Hamilton laceable bigraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.038777966897189264,"score_gpt":0.31665537306395475,"score_spread":0.2778774061667655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400363530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7244144,0.005718998,0.10562473,0.0074487124,0.021782937,0.0014380557,0.000016414184,0.003091876,0.13046384],"genre_scores_gemma":[0.98883647,0.000032462285,0.009417662,0.00029243345,0.000015956319,0.000040789055,0.0000021769713,0.000027054606,0.0013350159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997579,0.00022856917,0.00024134031,0.0005637432,0.00067581574,0.0007115759],"domain_scores_gemma":[0.9973791,0.00039631975,0.000046111425,0.001231891,0.00041700696,0.00052952924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009485748,0.0002028307,0.00024176786,0.00024534966,0.00019767239,0.00023305647,0.0016485947,0.000102275655,0.000018712852],"category_scores_gemma":[0.00058742147,0.00019872628,0.00008930785,0.0012305761,0.0002700511,0.0010019777,0.00045260534,0.00033861084,0.0005717854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012856538,0.00013779571,0.00052170834,0.000010236796,0.000010273344,0.000042526117,0.00037361908,0.000010139713,0.00035292405,0.98710376,0.01033648,0.0010876727],"study_design_scores_gemma":[0.00072450365,0.00022609286,0.00012611126,0.00001662421,0.0000036460026,0.000015352389,0.000057995698,0.0021157686,0.00454199,0.97441936,0.017501496,0.00025106195],"about_ca_topic_score_codex":0.000018681476,"about_ca_topic_score_gemma":0.0000026551022,"teacher_disagreement_score":0.26442203,"about_ca_system_score_codex":0.000089452726,"about_ca_system_score_gemma":0.00016674571,"threshold_uncertainty_score":0.81038225},"labels":[],"label_agreement":null},{"id":"W2400495332","doi":"","title":"On the Packing Number of Generalized Petersen Graphs P(n, 2).","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02485309128922991,"score_gpt":0.29933999395994476,"score_spread":0.27448690267071485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400495332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889826,0.000079531594,0.001572892,0.00037404135,0.0012309795,0.00018341052,0.0000011883596,0.000074433825,0.00750089],"genre_scores_gemma":[0.997784,0.000010840896,0.0018400649,0.00020384886,0.000006539516,0.00002066559,6.5824236e-7,0.000013441982,0.000119896045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984317,0.00029086636,0.00018270669,0.00019979377,0.0004448867,0.00045009164],"domain_scores_gemma":[0.9982105,0.0006021765,0.00009805303,0.0008872486,0.00009127537,0.0001107334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008469694,0.00012893228,0.00015787719,0.000076299344,0.00014548903,0.00004028311,0.0010189209,0.000044113287,0.00006752518],"category_scores_gemma":[0.00015637404,0.000089666406,0.000103049446,0.00059233746,0.00012750518,0.00037765788,0.0002849112,0.00020187048,0.0001379064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010031959,0.00007908544,0.0058853896,0.0000040509253,0.000019617619,0.0000017755053,0.00042531991,0.000003293341,0.0009106295,0.99141896,0.00063368893,0.00060818007],"study_design_scores_gemma":[0.00035406035,0.00003695596,0.002573148,0.000013925994,0.0000029621174,0.00000704378,0.000026655047,0.00020207943,0.0069535826,0.98924434,0.0004717993,0.00011345198],"about_ca_topic_score_codex":0.000008533372,"about_ca_topic_score_gemma":3.326486e-7,"teacher_disagreement_score":0.008801411,"about_ca_system_score_codex":0.000026605427,"about_ca_system_score_gemma":0.000021161617,"threshold_uncertainty_score":0.36564898},"labels":[],"label_agreement":null},{"id":"W2400589288","doi":"","title":"On 2-domination and independence domination numbers of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Domination analysis; Combinatorics; Statistics; Graph; Vertex (graph theory)","score_opus":0.018587035095333476,"score_gpt":0.2655439694014125,"score_spread":0.24695693430607904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400589288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817394,0.00004807452,0.008987919,0.000053472657,0.00053319626,0.00023101376,0.0000011326636,0.00006199533,0.008343796],"genre_scores_gemma":[0.9961562,0.000020646368,0.003708308,0.000027070164,9.260267e-7,0.000015235259,7.9689585e-7,0.000007846216,0.000062976076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987542,0.00012227657,0.00018548539,0.0003094557,0.00043204502,0.00019655025],"domain_scores_gemma":[0.99895453,0.00022358728,0.00012229153,0.00043150838,0.00018956304,0.000078529076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006284559,0.000108180044,0.00013724223,0.00025517636,0.000082881634,0.00002403365,0.0005482473,0.00007288684,0.000014027504],"category_scores_gemma":[0.00017967226,0.00010726823,0.000036212,0.0005372839,0.00014930897,0.00059943413,0.00016569221,0.00016698155,0.000013918572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035439294,0.000094606556,0.0015713166,0.000010443792,0.0000081717,0.0000051720244,0.0009157559,0.0000012824759,0.00075991475,0.9879416,0.000037373484,0.008618925],"study_design_scores_gemma":[0.0006713241,0.00023656625,0.012829228,0.000020916405,0.0000026623068,0.0000048634083,0.000038900605,0.00062471785,0.023605973,0.96184874,0.00001000557,0.00010611649],"about_ca_topic_score_codex":0.000026210753,"about_ca_topic_score_gemma":0.0000032853757,"teacher_disagreement_score":0.026092874,"about_ca_system_score_codex":0.00002979965,"about_ca_system_score_gemma":0.000029162153,"threshold_uncertainty_score":0.43742716},"labels":[],"label_agreement":null},{"id":"W2400632756","doi":"","title":"Acyclic edge coloring of triangle-free toroidal graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Combinatorics; Enhanced Data Rates for GSM Evolution; Edge coloring; Graph; Computer science; Physics; Line graph; Artificial intelligence; Plasma","score_opus":0.03914921778049262,"score_gpt":0.27086943091467974,"score_spread":0.23172021313418711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400632756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97304547,0.00050172705,0.004738132,0.00009506649,0.0028422833,0.00043660743,0.0000062550275,0.00028836864,0.018046066],"genre_scores_gemma":[0.9920646,0.000026175323,0.0076460396,0.00002936428,0.0000060108673,0.00003348196,9.0674894e-7,0.000018958226,0.0001744927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981428,0.00016749845,0.00034862783,0.00041932781,0.00043955634,0.00048223766],"domain_scores_gemma":[0.9977051,0.00024312874,0.00015365197,0.0015505446,0.00017076092,0.00017681195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069367024,0.00017544963,0.00031476247,0.00026559757,0.00012021857,0.000032679392,0.0027942713,0.00008587936,0.000041123003],"category_scores_gemma":[0.00030049536,0.00017440082,0.00014924885,0.0009770464,0.00019191628,0.00066551415,0.0009188764,0.00023469281,0.000054239503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046994333,0.00016767844,0.0031274217,0.00001546079,0.000028954497,0.00002089635,0.00077324477,7.618996e-7,0.0017980606,0.9900604,0.0004609145,0.0034992273],"study_design_scores_gemma":[0.0014509705,0.00031681661,0.0056256624,0.00001858482,0.0000055476394,0.0000066315906,0.000039859762,0.00014147357,0.030189004,0.9615219,0.0004956087,0.00018790823],"about_ca_topic_score_codex":0.000044575838,"about_ca_topic_score_gemma":0.0000052962478,"teacher_disagreement_score":0.028538452,"about_ca_system_score_codex":0.00004635611,"about_ca_system_score_gemma":0.00007645256,"threshold_uncertainty_score":0.71118593},"labels":[],"label_agreement":null},{"id":"W2400845803","doi":"","title":"Counting Spanning Trees in Cographs: An Algorithmic Approach.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Discrete mathematics","score_opus":0.019523300530695085,"score_gpt":0.2850213839657436,"score_spread":0.26549808343504855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400845803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247154,0.00047708052,0.06624835,0.0002735649,0.00071079115,0.00050376105,0.00000133604,0.000548038,0.006521701],"genre_scores_gemma":[0.9681972,0.000012940711,0.031578217,0.00012871418,0.000009978285,0.000018122731,0.000003893272,0.000013744108,0.00003714801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978289,0.00019892615,0.00027907407,0.00059818086,0.00046353324,0.00063136965],"domain_scores_gemma":[0.99878764,0.000109985616,0.000085354055,0.00077238074,0.00009090762,0.00015371421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009742322,0.00019633672,0.00024421499,0.00045080046,0.0001737973,0.00020620231,0.0014142247,0.00008523308,0.0000027031404],"category_scores_gemma":[0.000072474686,0.00020423987,0.000064492124,0.0016596686,0.000086369,0.0013198868,0.0001524649,0.00039655188,0.00001317324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010272978,0.00026480365,0.0033565224,0.0000037324703,0.0000059188487,0.00004035218,0.00079942367,0.0002670071,0.0009581147,0.95727897,0.00003660118,0.036978308],"study_design_scores_gemma":[0.0009036184,0.0002654557,0.019922396,0.000027631862,0.0000019805998,0.00001532613,0.0001655489,0.080366895,0.00056301506,0.897323,0.00015246155,0.00029264367],"about_ca_topic_score_codex":0.0000240963,"about_ca_topic_score_gemma":0.000004820844,"teacher_disagreement_score":0.08009989,"about_ca_system_score_codex":0.00006281085,"about_ca_system_score_gemma":0.000050899194,"threshold_uncertainty_score":0.832866},"labels":[],"label_agreement":null},{"id":"W2400986846","doi":"","title":"Multicolored Spanning Subgraphs in G-Colorings of Complete Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.023360363500033152,"score_gpt":0.2688719543067487,"score_spread":0.24551159080671556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400986846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961438,0.000107393455,0.00077482255,0.000235009,0.0003786278,0.00051556784,0.0000011708507,0.00011046193,0.0017331494],"genre_scores_gemma":[0.9923569,0.000013289107,0.007410465,0.00005738182,0.0000010662421,0.00010355741,0.0000013809038,0.000016378917,0.00003956578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979611,0.0001652154,0.00041600657,0.0004515069,0.00042616995,0.0005800006],"domain_scores_gemma":[0.998348,0.00039589143,0.00014431663,0.0007537266,0.00021011698,0.0001479458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941405,0.00018480871,0.0003362382,0.0005628053,0.00008563673,0.00007178395,0.0014023115,0.0000795007,0.00002643262],"category_scores_gemma":[0.00014809622,0.00018689115,0.00010186366,0.001722164,0.00022344221,0.0008417435,0.00045711113,0.00030565765,0.00006878816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010831389,0.0001242333,0.03435959,0.000018905605,0.000013701354,0.000011885088,0.00044101724,0.0000424823,0.011990727,0.9516128,0.0000655397,0.001308344],"study_design_scores_gemma":[0.0010967936,0.00015632629,0.09845846,0.000037632777,0.0000017490978,0.0000031475392,0.000070328715,0.004986303,0.0053087617,0.8895734,0.00011160999,0.00019546575],"about_ca_topic_score_codex":0.00026103604,"about_ca_topic_score_gemma":0.000010230153,"teacher_disagreement_score":0.06409887,"about_ca_system_score_codex":0.000049946884,"about_ca_system_score_gemma":0.000041608215,"threshold_uncertainty_score":0.76212},"labels":[],"label_agreement":null},{"id":"W2401108363","doi":"","title":"Block Diagonalization Method for the Covering Graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Graph; Combinatorics","score_opus":0.020171086465542665,"score_gpt":0.3196195414713774,"score_spread":0.2994484550058347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401108363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057731518,0.0003303785,0.99029946,0.0016695487,0.00083619426,0.00044595078,0.0000015756019,0.00014831182,0.00049541],"genre_scores_gemma":[0.94451773,0.000047729,0.054538332,0.00061901525,0.000015155915,0.00006752354,0.0000021297221,0.000012587244,0.0001798127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888515,0.000103491424,0.00014721895,0.0002858542,0.00027371384,0.00030453943],"domain_scores_gemma":[0.9982735,0.0008746179,0.00005977842,0.000589832,0.00013752669,0.000064761545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077830383,0.00010814043,0.00011441159,0.00008402056,0.00030545983,0.000120758545,0.0010139131,0.00004109326,0.0000024122355],"category_scores_gemma":[0.00019520782,0.000083276325,0.00008615124,0.0006633254,0.0000330492,0.00033191906,0.000108616885,0.00011785986,0.000007739074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096536605,0.000032245873,0.00006624605,0.0000030443907,0.000011319845,0.0000013609961,0.00013284881,0.0006269691,0.00078926474,0.97727793,0.0005402063,0.020508917],"study_design_scores_gemma":[0.00041116067,0.00012131915,0.0008427472,0.000006194859,0.000004837644,0.000004911587,0.000009587052,0.03343435,0.0044833664,0.9563504,0.0042238296,0.00010732102],"about_ca_topic_score_codex":0.0000034790473,"about_ca_topic_score_gemma":8.314476e-7,"teacher_disagreement_score":0.93874454,"about_ca_system_score_codex":0.00003037298,"about_ca_system_score_gemma":0.000032881417,"threshold_uncertainty_score":0.339591},"labels":[],"label_agreement":null},{"id":"W2401130130","doi":"","title":"Sharp lower bounds on signed domination numbers of digraphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.022703947547692106,"score_gpt":0.28914195132592274,"score_spread":0.2664380037782306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401130130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9519708,0.00012257216,0.012277962,0.0005881658,0.003655731,0.0004578263,0.0000046944824,0.00024554136,0.030676672],"genre_scores_gemma":[0.99787647,0.0000031811212,0.0016399388,0.00007104213,0.0000054523302,0.000018835646,0.0000028858785,0.000014318736,0.00036785429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820924,0.00015438825,0.00023564426,0.0003638767,0.00071418256,0.00032268566],"domain_scores_gemma":[0.99832505,0.00024614506,0.000120180295,0.0007849,0.0003275052,0.00019619436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007689773,0.00014696798,0.00019935134,0.00023933375,0.000077382625,0.000073204596,0.001038645,0.00007486979,0.0000127434305],"category_scores_gemma":[0.00027379335,0.0001418794,0.00008612085,0.00095232954,0.00014576426,0.0005792073,0.00021620805,0.00017008616,0.000087698885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074888754,0.00020553924,0.00045198516,0.0000065195118,0.000015362846,0.000012362749,0.00046734023,0.000024253726,0.00071648206,0.9939965,0.0016986906,0.0023300739],"study_design_scores_gemma":[0.0013447729,0.000614142,0.0005007022,0.000022939706,0.0000031624404,0.0000027841563,0.000046383288,0.001033589,0.0077301585,0.9875523,0.0009773925,0.0001716944],"about_ca_topic_score_codex":0.000015557871,"about_ca_topic_score_gemma":0.0000022996353,"teacher_disagreement_score":0.045905653,"about_ca_system_score_codex":0.00009232668,"about_ca_system_score_gemma":0.000102649436,"threshold_uncertainty_score":0.5785674},"labels":[],"label_agreement":null},{"id":"W2401195966","doi":"","title":"On Equitable Coloring of Sun let Graph Families.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph coloring; Combinatorics; Graph","score_opus":0.024938220869828817,"score_gpt":0.287927573149643,"score_spread":0.2629893522798142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401195966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9749203,0.0004132851,0.0059991647,0.00008814013,0.0024038844,0.00023658377,0.0000027694578,0.00014651069,0.015789393],"genre_scores_gemma":[0.9973812,0.000028593257,0.0022736292,0.000062702784,0.0000075316125,0.000022951977,0.0000010956501,0.000014713185,0.00020756411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981659,0.00011675215,0.00021707652,0.0002614094,0.0004892679,0.00074957043],"domain_scores_gemma":[0.9983885,0.000433909,0.000088874884,0.000804305,0.000108783956,0.0001756013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039326,0.0001441366,0.00021797414,0.00024488618,0.00014524514,0.00003380002,0.001052111,0.00006122051,0.00001942877],"category_scores_gemma":[0.00015965065,0.00013991454,0.00007899041,0.0009248264,0.000120135264,0.0007550204,0.00051877653,0.00021870785,0.000093821196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016324471,0.00017088339,0.00334231,0.000014990448,0.000015536378,0.00000269975,0.00032901522,0.00003627966,0.0017872291,0.9920619,0.0005029042,0.0017199125],"study_design_scores_gemma":[0.0005940303,0.00025012554,0.0021620842,0.000026175996,0.000003247001,0.000003010942,0.00005826376,0.00020420027,0.02267294,0.97273767,0.0011087856,0.00017945716],"about_ca_topic_score_codex":0.000017649187,"about_ca_topic_score_gemma":8.23768e-7,"teacher_disagreement_score":0.022460949,"about_ca_system_score_codex":0.000057948033,"about_ca_system_score_gemma":0.000038668757,"threshold_uncertainty_score":0.5705549},"labels":[],"label_agreement":null},{"id":"W2401251957","doi":"","title":"Enumeration for no-trivial spanning forests of complete bipartite graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Enumeration; Combinatorics; Spanning tree; Discrete mathematics; Graph","score_opus":0.02250903153387597,"score_gpt":0.2956067320429401,"score_spread":0.2730977005090641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401251957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92097867,0.000034782886,0.073941745,0.00019458463,0.003610505,0.00058949704,0.000012265369,0.000127909,0.0005100298],"genre_scores_gemma":[0.9787903,0.0000023412852,0.0210036,0.000031277614,0.000018574658,0.000061609346,0.00000879156,0.000015745049,0.00006780716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861234,0.00006209318,0.00027902532,0.0003398058,0.00033180517,0.00037495422],"domain_scores_gemma":[0.9982998,0.00037565676,0.00014380818,0.00065528933,0.0004125977,0.000112891496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006133254,0.00013527834,0.0002084999,0.00020047105,0.0001866464,0.00007371392,0.0008617702,0.00007842474,0.000009754106],"category_scores_gemma":[0.0003486229,0.00013639031,0.00011081319,0.0005079419,0.00013925172,0.00053927774,0.00019475466,0.0002409399,0.000030370853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029656458,0.000056234676,0.004688216,0.000018853234,0.00001308894,0.0000014688384,0.00013006826,0.000020256675,0.05185383,0.94081855,0.00033446844,0.0020353254],"study_design_scores_gemma":[0.00096692203,0.00024859278,0.0051886477,0.000013649816,0.000004238918,0.0000031185814,0.000003215278,0.01637646,0.020976659,0.9531362,0.0029205387,0.00016177057],"about_ca_topic_score_codex":0.000010512489,"about_ca_topic_score_gemma":0.00002599112,"teacher_disagreement_score":0.057811573,"about_ca_system_score_codex":0.000012671858,"about_ca_system_score_gemma":0.000058812275,"threshold_uncertainty_score":0.5561836},"labels":[],"label_agreement":null},{"id":"W2401403958","doi":"","title":"Upper embeddable graphs via the degree-sum of adjacent vertices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Physics","score_opus":0.021763697373662544,"score_gpt":0.27377275107005056,"score_spread":0.25200905369638804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401403958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98067063,0.00041023007,0.005524129,0.0010509623,0.0044607916,0.0004778483,0.0000026409796,0.00016904609,0.007233717],"genre_scores_gemma":[0.99617904,0.000019343888,0.0034130802,0.00009854354,0.000006530581,0.000030195035,7.7820164e-7,0.000016830563,0.0002356831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813193,0.00014210424,0.00026877734,0.00037800576,0.00058090826,0.0004982987],"domain_scores_gemma":[0.9975827,0.0003537429,0.0001180512,0.0015571847,0.0002386585,0.00014971211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008140249,0.00016881872,0.00020252477,0.00013203797,0.00022574974,0.00007729349,0.0023017915,0.000088668414,0.00006312159],"category_scores_gemma":[0.00015945677,0.00012057703,0.00012531038,0.0008991937,0.00031884556,0.00048553268,0.0005787761,0.000545797,0.00009227149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013681298,0.00012401589,0.003321756,0.000010513085,0.00002378463,0.00000535582,0.00032085087,0.000009809166,0.013646173,0.9751419,0.00053509243,0.0068470654],"study_design_scores_gemma":[0.0005107895,0.000101036545,0.0047842623,0.000010178904,0.0000069051553,0.0000106304915,0.000027586677,0.003706217,0.03593279,0.95058924,0.004154725,0.00016564367],"about_ca_topic_score_codex":0.00004203386,"about_ca_topic_score_gemma":0.000019042676,"teacher_disagreement_score":0.02455267,"about_ca_system_score_codex":0.000020149646,"about_ca_system_score_gemma":0.00008256413,"threshold_uncertainty_score":0.49169886},"labels":[],"label_agreement":null},{"id":"W2401454933","doi":"","title":"Up-embeddability and independent number of simple graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Combinatorics; Discrete mathematics","score_opus":0.02679606737701527,"score_gpt":0.2976182622539376,"score_spread":0.27082219487692233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401454933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926432,0.0000535541,0.0020889074,0.00002127991,0.00050107896,0.00017137048,0.0000022659337,0.00007345892,0.004444897],"genre_scores_gemma":[0.9965611,0.000013548152,0.0033190409,0.000022559529,0.0000011178423,0.000013183229,6.602132e-7,0.000009051614,0.000059701124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860096,0.0001443291,0.00023323025,0.00038172095,0.0003400841,0.00029970074],"domain_scores_gemma":[0.99865943,0.00014314002,0.00008654058,0.00080796843,0.00015849683,0.00014439278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006045816,0.00012458183,0.00019825749,0.00008331591,0.00007897509,0.000023725192,0.00077390496,0.00006723239,0.00007454641],"category_scores_gemma":[0.00009732903,0.000117479176,0.000059166632,0.00045840236,0.00022965005,0.0004292374,0.00055672356,0.00018250497,0.000024748855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016939122,0.00010074056,0.09890998,0.000015067422,0.000014021095,0.0000049433365,0.00077246485,1.7840345e-7,0.00018164565,0.8972025,0.00005930962,0.002722233],"study_design_scores_gemma":[0.00044630395,0.0000779159,0.046879504,0.0000049576156,0.0000027944495,0.000010447873,0.000038619684,0.0001385118,0.006972306,0.9452314,0.000080284546,0.00011697905],"about_ca_topic_score_codex":0.00007408902,"about_ca_topic_score_gemma":0.000005114847,"teacher_disagreement_score":0.052030478,"about_ca_system_score_codex":0.00002056369,"about_ca_system_score_gemma":0.00004092277,"threshold_uncertainty_score":0.4790662},"labels":[],"label_agreement":null},{"id":"W2401456693","doi":"","title":"On the Crossing Numbers of the k-th Power of P n .","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Path (computing); Graph; Crossing number (knot theory); Join (topology); Discrete mathematics","score_opus":0.013496781498378328,"score_gpt":0.27951284807187704,"score_spread":0.2660160665734987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401456693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98906463,0.000043616954,0.00072632416,0.0014539646,0.00057293585,0.00016155887,9.2552415e-7,0.000024641007,0.007951375],"genre_scores_gemma":[0.99934685,0.0000013507091,0.00028153253,0.00023321182,0.0000012597435,0.0000017974853,6.152207e-8,0.0000045139373,0.0001294001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885595,0.00015695365,0.0001705242,0.0001706931,0.00043762446,0.00020827133],"domain_scores_gemma":[0.9983475,0.00040208292,0.00012332479,0.0009980127,0.000095378746,0.000033655353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051776966,0.000084251784,0.00011994558,0.000040873056,0.0002024145,0.00005215254,0.0015262458,0.000033283355,0.000012329186],"category_scores_gemma":[0.00022481909,0.00004710381,0.00009024554,0.0006608845,0.0003090847,0.00014567703,0.00017945522,0.00019379596,0.0000073942247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009962673,0.0000680708,0.0003534278,0.0000018277319,0.0000059047297,9.1718687e-7,0.00070621015,0.000029602053,0.0019117561,0.9954103,0.00037891022,0.0011230658],"study_design_scores_gemma":[0.00021245731,0.00012781224,0.00726616,0.000031025025,0.0000012742528,0.0000015451159,0.000036179965,0.00020133708,0.032054033,0.9598779,0.00013658269,0.000053698102],"about_ca_topic_score_codex":0.0000055450973,"about_ca_topic_score_gemma":4.8891854e-7,"teacher_disagreement_score":0.035532452,"about_ca_system_score_codex":0.000023405084,"about_ca_system_score_gemma":0.000069264825,"threshold_uncertainty_score":0.283617},"labels":[],"label_agreement":null},{"id":"W2401458535","doi":"","title":"Quasi-tree graphs with the second largest number of maximal independent sets.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics; Discrete mathematics","score_opus":0.009570758433077683,"score_gpt":0.2655886262805301,"score_spread":0.2560178678474524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401458535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99144095,0.00002526016,0.0007577809,0.00052927504,0.00078065536,0.00024542754,0.000006595687,0.000077110766,0.006136938],"genre_scores_gemma":[0.9965551,0.000002455402,0.0027951747,0.00009193095,0.0000035017654,0.000030487401,0.0000016910504,0.00002008243,0.0004995597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813896,0.00013855634,0.00020404092,0.00040469115,0.000666234,0.0004475143],"domain_scores_gemma":[0.9979439,0.00028958562,0.00013804519,0.0012645927,0.00022550565,0.0001383671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007703235,0.00018660187,0.00021415592,0.00009517199,0.00018951991,0.00009078073,0.0018658732,0.000097041535,0.00017014134],"category_scores_gemma":[0.00004201319,0.00012527782,0.00008118914,0.00074507843,0.00034506255,0.00045394353,0.00044536818,0.00073643314,0.00007543487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002705961,0.0002302833,0.023107905,0.000012116733,0.00003296423,0.00002335937,0.00036414913,7.906332e-7,0.0017463473,0.9728474,0.00034517786,0.0012624422],"study_design_scores_gemma":[0.0009581228,0.00022853375,0.020770574,0.000008703969,0.000005460127,0.00007717692,0.000077551274,0.00018909664,0.009703384,0.96582717,0.0019447634,0.00020945286],"about_ca_topic_score_codex":0.000018370138,"about_ca_topic_score_gemma":0.0002326417,"teacher_disagreement_score":0.007957037,"about_ca_system_score_codex":0.000015400725,"about_ca_system_score_gemma":0.000102209415,"threshold_uncertainty_score":0.5108681},"labels":[],"label_agreement":null},{"id":"W2401704331","doi":"","title":"[a, b]-factors With Given Edges In Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019172001908479938,"score_gpt":0.26158656298563204,"score_spread":0.2424145610771521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401704331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98815817,0.000051683077,0.00707509,0.00031025123,0.00051891804,0.00017924471,5.312701e-7,0.00016059894,0.003545509],"genre_scores_gemma":[0.9983317,0.0000048895918,0.0014640958,0.000049810056,0.0000025770228,0.000017931134,0.0000012353311,0.0000151288195,0.00011260738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847555,0.00018328044,0.00015164123,0.00040825695,0.0003524449,0.000428851],"domain_scores_gemma":[0.9986925,0.00031985567,0.00005411123,0.00072843465,0.00007498241,0.00013012002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044425981,0.000163551,0.00020238402,0.00027405078,0.00009243557,0.00007787323,0.0011014768,0.000054612898,0.000007724161],"category_scores_gemma":[0.00009526828,0.00012710848,0.00004189497,0.0010124611,0.0001256502,0.00049613084,0.00022131299,0.00024964934,0.000030336925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008267662,0.000060625738,0.06321524,0.000005857332,0.0000068410777,0.0000069303424,0.00024962626,0.000024360123,0.00008781892,0.93319124,0.000114209404,0.003028987],"study_design_scores_gemma":[0.0006942732,0.00024573694,0.059376553,0.000022311413,0.0000013292085,0.0000019546305,0.000030759507,0.00068422663,0.002609009,0.93499947,0.0011414657,0.00019289013],"about_ca_topic_score_codex":0.00001970431,"about_ca_topic_score_gemma":0.00001976506,"teacher_disagreement_score":0.010173551,"about_ca_system_score_codex":0.00004104377,"about_ca_system_score_gemma":0.000036877074,"threshold_uncertainty_score":0.5183334},"labels":[],"label_agreement":null},{"id":"W2401767591","doi":"","title":"A sufficient condition for a toroidal graph to be 3-choosable.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Graph; Combinatorics; Physics; Plasma; Quantum mechanics","score_opus":0.026195673508615798,"score_gpt":0.309235088491795,"score_spread":0.2830394149831792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401767591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8452869,0.00021615287,0.1466518,0.0015944839,0.003594339,0.0011352623,0.000021210606,0.00028312003,0.0012167478],"genre_scores_gemma":[0.9887604,0.0000032673308,0.010140746,0.0005406865,0.000022137603,0.00026237234,0.000008561314,0.000018753683,0.00024306517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815935,0.000090423906,0.0002009673,0.0003635847,0.00040755785,0.00077814417],"domain_scores_gemma":[0.9984044,0.00029052026,0.000057961734,0.0006540768,0.00019450812,0.00039857643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008219086,0.0001582942,0.00017469496,0.00021898678,0.00026727302,0.00010235352,0.00083140255,0.0000630581,0.000020553722],"category_scores_gemma":[0.00021352626,0.00015869967,0.000101899626,0.00076740375,0.00005578211,0.0007489582,0.0002818885,0.00013293233,0.00009280303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000244396,0.00020822466,0.0005557012,0.000010213045,0.000012351982,0.0000013566374,0.0008478918,0.000029809753,0.00204913,0.9897003,0.0057702833,0.00079028966],"study_design_scores_gemma":[0.0012091232,0.0005386014,0.0018575368,0.00001636748,0.0000075535786,0.000011625126,0.00016236604,0.0009724828,0.012885901,0.95360583,0.028349966,0.0003826546],"about_ca_topic_score_codex":0.000006300187,"about_ca_topic_score_gemma":0.0000022571955,"teacher_disagreement_score":0.14347352,"about_ca_system_score_codex":0.000106438034,"about_ca_system_score_gemma":0.00004756873,"threshold_uncertainty_score":0.64715844},"labels":[],"label_agreement":null},{"id":"W2401787488","doi":"","title":"On The Average Crosscap Number Of A Graph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.013550550745601516,"score_gpt":0.2768355687554542,"score_spread":0.26328501800985266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401787488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9824225,0.000025158872,0.0028208965,0.0008356525,0.0006071183,0.00033150514,0.0000011876566,0.00007905239,0.012876944],"genre_scores_gemma":[0.99847525,0.0000058884034,0.0007248059,0.00023195596,0.0000024795513,0.000057183905,3.720238e-7,0.000010484346,0.00049159303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866366,0.00015829514,0.0001761706,0.0002632308,0.0004211839,0.00031746793],"domain_scores_gemma":[0.99798733,0.00066165335,0.00007668229,0.0010253311,0.00016794092,0.00008104396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038245748,0.00011877004,0.00013794994,0.00006475105,0.0001561818,0.000106171734,0.0014267229,0.0000452509,0.00027642463],"category_scores_gemma":[0.00014928008,0.00008060159,0.000088445646,0.00065125665,0.00019299908,0.0003586879,0.00030647704,0.0002294599,0.0007520309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000424369,0.00007356131,0.00084674184,0.000004221888,0.000012147797,0.0000027879335,0.0002067748,0.000011485354,0.00059384527,0.99486387,0.0025897024,0.0007906415],"study_design_scores_gemma":[0.00027488038,0.00006362385,0.0023604543,0.0000126012,8.0839584e-7,0.000003935781,0.0000135730825,0.0007247695,0.0047631417,0.9914838,0.00020540539,0.000092999915],"about_ca_topic_score_codex":0.00003188215,"about_ca_topic_score_gemma":5.2921996e-7,"teacher_disagreement_score":0.01605275,"about_ca_system_score_codex":0.000018832678,"about_ca_system_score_gemma":0.000029174524,"threshold_uncertainty_score":0.96660864},"labels":[],"label_agreement":null},{"id":"W2401867789","doi":"","title":"On k-connected restrained domination in graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.025865712801062674,"score_gpt":0.2704484851857391,"score_spread":0.24458277238467643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401867789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98112655,0.000023350023,0.00227892,0.00014647286,0.0007733332,0.0002800362,7.787735e-7,0.00018655104,0.015184013],"genre_scores_gemma":[0.99699074,0.000005401347,0.002801636,0.00007510209,0.0000013677674,0.000035611673,0.0000016327889,0.000011414428,0.00007707586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856496,0.0001949568,0.00020188306,0.00038932826,0.0002995821,0.00034930228],"domain_scores_gemma":[0.99884963,0.00025756334,0.00006033304,0.00065010635,0.00009071471,0.00009163195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054951996,0.00012920593,0.00014396531,0.0004452735,0.00007393806,0.00003428542,0.0008935984,0.00007104781,0.000029745746],"category_scores_gemma":[0.000287742,0.00012839727,0.000047544774,0.0012114651,0.00007507843,0.0004359651,0.00013874174,0.00024471668,0.000080402926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046222493,0.00015844412,0.0008312469,0.000003251898,0.0000049847877,0.000048513597,0.0006751105,0.0000031828808,0.0004536056,0.9945667,0.00008400167,0.0031247414],"study_design_scores_gemma":[0.0010531899,0.0002331193,0.026431771,0.000018569752,8.392148e-7,0.0000029788014,0.000019598489,0.0007875204,0.004608787,0.96668017,0.000022746091,0.00014072732],"about_ca_topic_score_codex":0.000025235657,"about_ca_topic_score_gemma":0.000010570921,"teacher_disagreement_score":0.027886542,"about_ca_system_score_codex":0.00005924779,"about_ca_system_score_gemma":0.00003815463,"threshold_uncertainty_score":0.52358884},"labels":[],"label_agreement":null},{"id":"W2402028350","doi":"","title":"A Neighborhood Condition for Graphs to Have (g, f)-Factors.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01911855302737888,"score_gpt":0.304653859299141,"score_spread":0.28553530627176216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402028350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7290359,0.00012186512,0.25559494,0.005047121,0.0025405255,0.0021394365,0.000030394533,0.00075688766,0.004732926],"genre_scores_gemma":[0.9940835,0.0000029224823,0.005095326,0.0005910821,0.000006983938,0.000057706497,0.000010582913,0.000012786865,0.00013906353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998402,0.00006628342,0.00020311843,0.0004865988,0.0003344336,0.0005075754],"domain_scores_gemma":[0.99852765,0.0002512699,0.00006125464,0.000703455,0.0002015691,0.00025483174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003111809,0.00017808523,0.00020260422,0.0002555361,0.00021313378,0.00013656483,0.0009748367,0.00007205912,0.000007780692],"category_scores_gemma":[0.00019027966,0.00017296475,0.00011688764,0.00060877524,0.00003602061,0.00054374244,0.00010849681,0.00014441973,0.000038395367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019310839,0.00010735627,0.00085870817,0.0000036020397,0.000009399415,0.000004043254,0.00028205567,0.000012941175,0.0013423264,0.9922223,0.0016857262,0.0034522398],"study_design_scores_gemma":[0.0007128998,0.00076527486,0.0040209405,0.000009824261,0.0000034308766,0.0000031792479,0.00003234017,0.0007796603,0.0061081396,0.9859763,0.0013732575,0.00021477713],"about_ca_topic_score_codex":0.000002725038,"about_ca_topic_score_gemma":0.0000012060808,"teacher_disagreement_score":0.26504764,"about_ca_system_score_codex":0.000061850275,"about_ca_system_score_gemma":0.00004519045,"threshold_uncertainty_score":0.7053298},"labels":[],"label_agreement":null},{"id":"W2402036020","doi":"","title":"On competition polysemy and m-competition polysemy.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polysemy; Competition (biology); Mathematics; Characterization (materials science); Combinatorics; Graph; Competition model; Linguistics; Philosophy; Biology; Political science; Physics","score_opus":0.009342753128615452,"score_gpt":0.2652600831487611,"score_spread":0.25591733002014566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402036020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837495,0.00005113273,0.00612833,0.0011619676,0.0021276004,0.00024522236,0.000004369645,0.00027591933,0.0062559755],"genre_scores_gemma":[0.99560255,0.000013569996,0.0038621612,0.0002708628,0.000018674327,0.00001866104,0.0000065282716,0.000018521792,0.0001884474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983199,0.00012584835,0.0001957167,0.0005096937,0.0004468721,0.00040194578],"domain_scores_gemma":[0.9985123,0.00033668705,0.00007971916,0.0007576177,0.000105321145,0.00020835277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000438544,0.00019057201,0.00018548577,0.00024972935,0.0002881275,0.00018114915,0.00069433963,0.0001100711,0.000058825317],"category_scores_gemma":[0.00012270141,0.00018966367,0.00005675304,0.0004782675,0.00019238268,0.0005603624,0.0002655875,0.000558572,0.00018041382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017174023,0.00010451585,0.00032209407,0.0000071911586,0.000008256656,0.000012868955,0.000117790034,0.0000022192114,0.014745025,0.9789718,0.00009571784,0.005595372],"study_design_scores_gemma":[0.0007410643,0.00022659468,0.00413037,0.00002241811,0.0000031991729,0.00002950419,0.000010994337,0.0012112416,0.008051407,0.9845394,0.0008128492,0.00022096152],"about_ca_topic_score_codex":0.000016541719,"about_ca_topic_score_gemma":0.000009789824,"teacher_disagreement_score":0.0118530905,"about_ca_system_score_codex":0.00003316953,"about_ca_system_score_gemma":0.000039237708,"threshold_uncertainty_score":0.773426},"labels":[],"label_agreement":null},{"id":"W2402115169","doi":"","title":"Path Extendability and Degree Sum in Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Path (computing); Discrete mathematics; Computer science; Computer network; Physics","score_opus":0.04391162493109703,"score_gpt":0.2983913215405891,"score_spread":0.2544796966094921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402115169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99461246,0.00050370843,0.0016190851,0.0003437048,0.0006589896,0.00021404597,0.0000012443303,0.0001087659,0.0019379924],"genre_scores_gemma":[0.9963542,0.000017759825,0.003502275,0.00004892484,0.0000018328059,0.000019639181,6.826421e-7,0.000008116107,0.000046569545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845743,0.00021598957,0.00018165205,0.0004367011,0.00033955296,0.00036864853],"domain_scores_gemma":[0.9987177,0.00017552957,0.000038898637,0.00070222863,0.00012118652,0.0002444574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001226441,0.00012345305,0.00017159956,0.00016211541,0.00005625025,0.00007200121,0.000702212,0.000058024456,0.0000024727321],"category_scores_gemma":[0.0003034267,0.00011635834,0.000029976749,0.0007492434,0.00016412468,0.00055213866,0.00048102115,0.00023248559,0.000018706522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013564258,0.00008530595,0.052127276,0.000008022313,0.0000028596846,0.000030441255,0.00037542498,0.000001892408,0.000053104854,0.9382358,0.0001692025,0.008897098],"study_design_scores_gemma":[0.00081028603,0.0001182936,0.046430513,0.0000099326335,7.5252984e-7,0.000008176664,0.00004477368,0.0010596144,0.00021846597,0.9508872,0.0002825814,0.00012942596],"about_ca_topic_score_codex":0.000051734663,"about_ca_topic_score_gemma":0.000020305166,"teacher_disagreement_score":0.012651377,"about_ca_system_score_codex":0.00006600006,"about_ca_system_score_gemma":0.0000858236,"threshold_uncertainty_score":0.4744955},"labels":[],"label_agreement":null},{"id":"W2402131518","doi":"","title":"On the index of quasi-tree graphs with perfect matchings.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Tree (set theory); Computer science","score_opus":0.020114682710685113,"score_gpt":0.2650000639831325,"score_spread":0.24488538127244736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402131518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98232424,0.00006711071,0.009394558,0.0007399019,0.0004582626,0.0002836254,0.000001052485,0.00010425791,0.0066269953],"genre_scores_gemma":[0.9990258,0.0000027153483,0.0006979767,0.0001236155,0.0000022755548,0.000021669899,4.5428325e-7,0.000014622602,0.000110865134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824804,0.00024657487,0.00015537176,0.0003037642,0.00073989417,0.00030635647],"domain_scores_gemma":[0.9980562,0.0004912451,0.00010151556,0.0010049142,0.00020989202,0.00013628759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009783767,0.00014954997,0.00018502043,0.00014088073,0.00011051216,0.000061092825,0.0014484455,0.000045455992,0.0000059787953],"category_scores_gemma":[0.00019006374,0.000090700116,0.00005653841,0.00088909833,0.00020632676,0.00028377632,0.00026227857,0.000310248,0.00003718477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006299047,0.00013211435,0.003887495,0.000005137179,0.000020600399,0.000010400668,0.00065795344,0.000039188275,0.00008181858,0.9932394,0.000538352,0.0013245433],"study_design_scores_gemma":[0.0006875501,0.0008305326,0.0015221151,0.00002814341,0.0000025494592,0.000007869063,0.00010770583,0.0013368106,0.0018734542,0.99338615,0.000094381765,0.00012271838],"about_ca_topic_score_codex":0.000032683598,"about_ca_topic_score_gemma":0.000007890287,"teacher_disagreement_score":0.01670157,"about_ca_system_score_codex":0.00003890874,"about_ca_system_score_gemma":0.00010999865,"threshold_uncertainty_score":0.36986434},"labels":[],"label_agreement":null},{"id":"W2402247018","doi":"","title":"On the sum of out-domination number and in-domination number of digraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Graph","score_opus":0.024210418008993297,"score_gpt":0.30581729691435144,"score_spread":0.2816068789053581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402247018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99229956,0.000025894804,0.0011792944,0.00036914521,0.0004253691,0.00023809056,0.0000017150633,0.000015916617,0.005445027],"genre_scores_gemma":[0.99922985,0.0000085880765,0.0005868564,0.00002286987,0.0000021949706,0.000018472132,0.0000011898497,0.000008038823,0.00012193446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860305,0.00024640284,0.00025791922,0.00022869272,0.00047978805,0.00018416053],"domain_scores_gemma":[0.99836445,0.00067325676,0.00015223384,0.00046681872,0.0002794995,0.00006376885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012582554,0.00010449075,0.00018212844,0.000121378915,0.0000381736,0.00002556471,0.00051059085,0.0000566577,0.000009253243],"category_scores_gemma":[0.000439221,0.00008203161,0.000039449016,0.00060591154,0.00018348485,0.00037233313,0.00018391789,0.00015409975,0.00002042745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048667935,0.0001242209,0.015259153,0.0000109616485,0.000007739463,0.0000019744232,0.0011128794,0.000008546554,0.00031516777,0.9809955,0.0002480432,0.0018671879],"study_design_scores_gemma":[0.0010714993,0.000069602786,0.008043702,0.000033227254,0.0000025347206,0.0000048584307,0.00011618285,0.0013054806,0.010973745,0.97824454,0.00004828734,0.00008630815],"about_ca_topic_score_codex":0.000020524476,"about_ca_topic_score_gemma":0.000009570522,"teacher_disagreement_score":0.010658577,"about_ca_system_score_codex":0.000043408134,"about_ca_system_score_gemma":0.000047668585,"threshold_uncertainty_score":0.33451518},"labels":[],"label_agreement":null},{"id":"W2402311781","doi":"","title":"Edge-colorings of complete bipartite graphs without large rainbow trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Bipartite graph; Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Edge coloring; Discrete mathematics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.021036747929879997,"score_gpt":0.2709517347338764,"score_spread":0.2499149868039964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402311781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98624367,0.00022817896,0.0043802755,0.0005816038,0.001021732,0.00078624894,0.000009384396,0.00031004264,0.0064388653],"genre_scores_gemma":[0.99510425,0.0000184392,0.004036249,0.00013249619,0.000004307046,0.00010758182,0.0000033784913,0.000025614077,0.00056767865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755925,0.00018938651,0.00039866057,0.0005268613,0.0005736151,0.0007522458],"domain_scores_gemma":[0.9977938,0.00026108642,0.00018653455,0.0011720238,0.0003363207,0.00025022426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062631717,0.00023566575,0.00039341903,0.00031919,0.00019022387,0.00011039576,0.0016959984,0.00008688196,0.0001072296],"category_scores_gemma":[0.00013032179,0.00022236191,0.00014935686,0.0012338879,0.00024808958,0.0009583664,0.0006516697,0.00029586974,0.00023996146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104656,0.00015395618,0.014313982,0.000018197743,0.0000322789,0.0000051169086,0.00028913326,0.0000061967717,0.0062748794,0.9768821,0.0009844105,0.0010292834],"study_design_scores_gemma":[0.0013842733,0.00022871031,0.020013997,0.00003166749,0.0000053844096,0.0000053586514,0.000034648474,0.0027201022,0.0055813855,0.9635137,0.006206973,0.00027381483],"about_ca_topic_score_codex":0.00004800607,"about_ca_topic_score_gemma":0.000007620178,"teacher_disagreement_score":0.013368415,"about_ca_system_score_codex":0.000043185264,"about_ca_system_score_gemma":0.00006240091,"threshold_uncertainty_score":0.9067655},"labels":[],"label_agreement":null},{"id":"W2402386276","doi":"","title":"Resolvably Decomposing Complete Equipartite Graphs Minus a One-Factor into Cycles of Uniform Even Length.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factor (programming language); Combinatorics; Discrete mathematics; Computer science","score_opus":0.03150782474623839,"score_gpt":0.28791442364979214,"score_spread":0.2564065989035538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402386276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901834,0.00034058813,0.0058447514,0.0004832539,0.00071391615,0.00060471985,0.0000075692,0.00021324112,0.0016085221],"genre_scores_gemma":[0.9772886,0.000028110142,0.022436354,0.00007498617,0.000006809304,0.00005511856,0.000004903016,0.000032438267,0.00007267827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971009,0.00024528333,0.00057786383,0.00058884994,0.0007384032,0.00074869324],"domain_scores_gemma":[0.997161,0.00056271855,0.0002544141,0.0013132711,0.00041061343,0.0002980177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004563107,0.0002870083,0.0004569763,0.0004095847,0.00027381192,0.00018722356,0.0020365065,0.00011367715,0.000056678236],"category_scores_gemma":[0.000115379706,0.00028830313,0.00016874561,0.0010923779,0.0003197715,0.0013952509,0.0008744822,0.00034518453,0.0001783352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024350671,0.00020052318,0.0033035702,0.000055320008,0.00006643147,0.000009638504,0.0010364081,0.000026690315,0.041894786,0.9426763,0.00022987048,0.010476121],"study_design_scores_gemma":[0.0008518792,0.00030347044,0.011002547,0.000098255565,0.000007296223,0.0000073237566,0.000059080543,0.0041874787,0.019985443,0.96257275,0.000577206,0.00034727683],"about_ca_topic_score_codex":0.00028955349,"about_ca_topic_score_gemma":0.000025450094,"teacher_disagreement_score":0.021909343,"about_ca_system_score_codex":0.00011012377,"about_ca_system_score_gemma":0.00009598223,"threshold_uncertainty_score":0.9999569},"labels":[],"label_agreement":null},{"id":"W2402410623","doi":"","title":"Domination number in iterated line digraph of a complete bipartite digraph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Iterated function; Bipartite graph; Combinatorics; Line (geometry); Discrete mathematics; Graph","score_opus":0.024745808959017738,"score_gpt":0.300256535776357,"score_spread":0.2755107268173393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402410623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917128,0.0002548506,0.0051448075,0.0001572386,0.00079015765,0.0003019717,0.0000069482476,0.00009352793,0.001537712],"genre_scores_gemma":[0.9972617,0.00002509359,0.002533945,0.000045513665,0.000007307724,0.000036761197,0.000009273372,0.000014750548,0.00006567641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980554,0.00025973542,0.0004063989,0.00029461287,0.00042314036,0.0005607376],"domain_scores_gemma":[0.9985509,0.00030233813,0.00015052033,0.00063590636,0.00020214698,0.00015816982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008619223,0.00017175924,0.00028126562,0.00039487696,0.00007021814,0.000049784136,0.00073524535,0.00007778128,0.000026923011],"category_scores_gemma":[0.00012839536,0.00016805291,0.00008940969,0.0023904385,0.0001363414,0.0011445014,0.0002455879,0.00023416504,0.00006759336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031520005,0.00033649517,0.08464302,0.000019802867,0.00001622117,0.0000050664426,0.0008480102,0.000017961678,0.0047042505,0.9072443,0.000094416304,0.0020388854],"study_design_scores_gemma":[0.0022933113,0.00015490403,0.08812599,0.0000875305,0.0000068688123,0.00001315535,0.000039900213,0.0054048854,0.016384276,0.88554376,0.0015648534,0.0003805546],"about_ca_topic_score_codex":0.000030742744,"about_ca_topic_score_gemma":0.000008674747,"teacher_disagreement_score":0.021700578,"about_ca_system_score_codex":0.00004312654,"about_ca_system_score_gemma":0.00002814984,"threshold_uncertainty_score":0.6852999},"labels":[],"label_agreement":null},{"id":"W2402469379","doi":"","title":"On the Surface Areas of the Alternating Group Graph and the Split-Star Graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Graph; Combinatorics; Voltage graph; Coxeter graph; Line graph; Mathematical analysis","score_opus":0.011484713832612558,"score_gpt":0.244929003647124,"score_spread":0.23344428981451143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402469379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99218285,0.00018516352,0.0022754995,0.002430862,0.0007989967,0.0004182049,0.0000016383252,0.000047423935,0.0016593446],"genre_scores_gemma":[0.99907285,0.00003135694,0.00045072043,0.00034648238,0.0000063580505,0.000016228018,2.7348352e-7,0.000013796437,0.000061932195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975114,0.00092374056,0.00023776844,0.00035406524,0.000629275,0.0003437505],"domain_scores_gemma":[0.9952564,0.0029343285,0.00018459417,0.0014542891,0.00010529244,0.00006508706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025891322,0.0001722652,0.00020427526,0.000054599637,0.0005072784,0.00011810609,0.0023567844,0.000043201442,0.0000043789405],"category_scores_gemma":[0.000519958,0.000080493475,0.0001335081,0.0007635629,0.0007705547,0.00017958427,0.0007214853,0.00040240263,0.000006188306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027485965,0.000033158416,0.0018504069,0.0000071862933,0.000023535173,6.864139e-7,0.00042840154,0.00007433712,0.00020526678,0.9964943,0.00011519936,0.0007400201],"study_design_scores_gemma":[0.0008807868,0.00008293416,0.0051492047,0.00003851952,0.0000057211646,0.000003944672,0.000055125805,0.0063798036,0.0013168198,0.98581743,0.00016823973,0.00010145236],"about_ca_topic_score_codex":0.00006344041,"about_ca_topic_score_gemma":0.000008643064,"teacher_disagreement_score":0.010676868,"about_ca_system_score_codex":0.000015843902,"about_ca_system_score_gemma":0.000017588214,"threshold_uncertainty_score":0.4379531},"labels":[],"label_agreement":null},{"id":"W2402601247","doi":"","title":"A lower bound for 2-rainbow domination number of generalized Petersen graphs P(n, 3).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rainbow; Combinatorics; Domination analysis; Graph; Physics","score_opus":0.028371979712307385,"score_gpt":0.29753301196464027,"score_spread":0.2691610322523329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402601247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96077853,0.00005713633,0.031099182,0.00010049641,0.002047394,0.0006959239,0.00000831913,0.00012697159,0.005086025],"genre_scores_gemma":[0.9571351,0.000009836385,0.042327967,0.000056640805,0.0000046670416,0.000095368676,0.0000039535444,0.000020078733,0.00034637985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850744,0.00012033439,0.00028595485,0.0003825448,0.00032742944,0.00037630947],"domain_scores_gemma":[0.99846125,0.00019539092,0.00015260081,0.0007289265,0.0003536805,0.000108158376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062316586,0.00015492196,0.00023498721,0.00015616034,0.00011780802,0.00004230186,0.00093185744,0.00007626718,0.00005614803],"category_scores_gemma":[0.00013484368,0.00015145709,0.00015476742,0.00053405814,0.00016284856,0.0005499091,0.00020080467,0.00010458523,0.00002911361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100561396,0.00017106651,0.00079311617,0.000019881754,0.00003333247,0.000005925436,0.0007864315,7.728275e-7,0.00207729,0.99405617,0.00041035764,0.0015451018],"study_design_scores_gemma":[0.0016791025,0.00018389735,0.0011398927,0.000013261253,0.000007828522,0.000007725805,0.000022760882,0.00080241915,0.011436854,0.9839261,0.00060464867,0.00017550345],"about_ca_topic_score_codex":0.00002163652,"about_ca_topic_score_gemma":0.000002635599,"teacher_disagreement_score":0.011228785,"about_ca_system_score_codex":0.00003650396,"about_ca_system_score_gemma":0.000060098293,"threshold_uncertainty_score":0.6176241},"labels":[],"label_agreement":null},{"id":"W2402605984","doi":"","title":"Fractional incidence coloring and star arboricity of graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Edge coloring; Star (game theory); Combinatorics; Graph; Planar graph; Mathematical analysis; Line graph","score_opus":0.020157839940887285,"score_gpt":0.28700055136077607,"score_spread":0.2668427114198888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402605984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930737,0.0004306696,0.0049902108,0.000068989306,0.0007919679,0.00010321312,0.0000012496896,0.00005221923,0.00048776885],"genre_scores_gemma":[0.99441737,0.000043089498,0.0054680514,0.000028306133,0.0000056705458,0.000011399308,3.8306578e-7,0.0000059742083,0.00001977154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988531,0.00008957979,0.00016209894,0.00019820857,0.0003771955,0.0003198436],"domain_scores_gemma":[0.99893963,0.0003535265,0.00008856242,0.0003440308,0.0001227422,0.00015149468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006388899,0.000093614835,0.00014073495,0.00013367059,0.00011440988,0.00002405681,0.00044332942,0.00004449103,0.0000086289565],"category_scores_gemma":[0.00014864646,0.00009399665,0.00003262725,0.0005455075,0.00013426492,0.0010901608,0.00033357905,0.00018987304,0.000008628578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009367869,0.0000703338,0.073383935,0.000009961503,0.000009773177,0.000001665892,0.00020168276,0.0000029329099,0.0015832625,0.9240012,0.000035687135,0.0006902048],"study_design_scores_gemma":[0.00026975526,0.00007706423,0.132473,0.000011821969,0.0000027099877,0.000008583595,0.000024954055,0.00052107696,0.0069746342,0.85921013,0.00031413083,0.00011211606],"about_ca_topic_score_codex":0.000022440416,"about_ca_topic_score_gemma":9.199161e-7,"teacher_disagreement_score":0.06479105,"about_ca_system_score_codex":0.000036734586,"about_ca_system_score_gemma":0.000036849717,"threshold_uncertainty_score":0.38330722},"labels":[],"label_agreement":null},{"id":"W2402639370","doi":"","title":"The Hamiltonian number of graphs with prescribed connectivity.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Mathematical optimization","score_opus":0.01062008269438518,"score_gpt":0.27046130490837533,"score_spread":0.25984122221399014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402639370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98057973,0.0002093993,0.0047707297,0.0013392768,0.00050689926,0.0004218734,0.0000016334918,0.00018231553,0.0119881155],"genre_scores_gemma":[0.9972042,0.00001884198,0.0024642635,0.00007307759,0.0000020609561,0.000013541139,3.922295e-7,0.000008708082,0.00021494707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984674,0.00018074118,0.00017815644,0.00031273472,0.00046268097,0.00039830484],"domain_scores_gemma":[0.99812967,0.0004419873,0.000101412916,0.0010226481,0.00020324391,0.00010103289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005170061,0.00014035565,0.00017812772,0.000059572365,0.0002693253,0.00009268727,0.0012774513,0.0000442493,0.000004545533],"category_scores_gemma":[0.000098647666,0.00009283003,0.0000626368,0.0008452369,0.0002359526,0.00040833105,0.00013558535,0.00022047265,0.000017785795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050590737,0.00009215266,0.003674276,0.0000027744918,0.000019569048,0.00001008341,0.00022537571,0.0000068818504,0.00040563042,0.98920524,0.00019909754,0.00610833],"study_design_scores_gemma":[0.00072962756,0.0002894043,0.014262963,0.000016581469,0.0000033149397,0.000016072177,0.000020740148,0.00034505306,0.004661427,0.9784502,0.0010738542,0.00013075508],"about_ca_topic_score_codex":0.000012397984,"about_ca_topic_score_gemma":0.000008113546,"teacher_disagreement_score":0.01662441,"about_ca_system_score_codex":0.000024778265,"about_ca_system_score_gemma":0.00007021715,"threshold_uncertainty_score":0.37854987},"labels":[],"label_agreement":null},{"id":"W2402648100","doi":"","title":"Minimal weak separators of chordal graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Graph","score_opus":0.025998766570302315,"score_gpt":0.2776326157876752,"score_spread":0.25163384921737286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402648100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9694347,0.00017783298,0.0027203856,0.000040238036,0.0012975669,0.00021269068,0.0000028810205,0.00016044169,0.02595331],"genre_scores_gemma":[0.99004185,0.000012784283,0.0097362725,0.00002485504,0.0000027255505,0.0000173146,7.267722e-7,0.000014361458,0.00014909139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983828,0.00013199169,0.0002815181,0.00038310105,0.00040415477,0.00041642343],"domain_scores_gemma":[0.9985778,0.00011061588,0.00011675132,0.0008639443,0.00016551127,0.00016541757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044256743,0.00015902291,0.00023142205,0.00023748486,0.00008683969,0.000023217228,0.0015100386,0.00007481197,0.000052806387],"category_scores_gemma":[0.00006884145,0.00015415602,0.00011585357,0.0009696986,0.0002208971,0.00050336187,0.00039159457,0.00019838025,0.000074711425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027864204,0.00014809602,0.008069747,0.000009167734,0.000023505265,0.000011876701,0.0006226483,5.440719e-7,0.0012146807,0.9880256,0.00044663565,0.0013996012],"study_design_scores_gemma":[0.00052508846,0.00031780623,0.010121534,0.000010983575,0.0000039411116,0.0000071693794,0.00004529626,0.00018812533,0.03383034,0.95420307,0.0005688058,0.00017785974],"about_ca_topic_score_codex":0.000020529444,"about_ca_topic_score_gemma":0.0000017996064,"teacher_disagreement_score":0.033822585,"about_ca_system_score_codex":0.00002195158,"about_ca_system_score_gemma":0.000071980925,"threshold_uncertainty_score":0.62863},"labels":[],"label_agreement":null},{"id":"W2402766034","doi":"","title":"On D -equivalence class of complete bipartite graphs","year":2014,"lang":"ca","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Vertex (graph theory); Conjecture; Graph; Discrete mathematics; Complete bipartite graph; Dominating set","score_opus":0.02770719562700326,"score_gpt":0.29023539180456365,"score_spread":0.2625281961775604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402766034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.953809,0.00073266897,0.012897282,0.0012890884,0.008551433,0.0009863678,0.0000602901,0.0002910979,0.02138272],"genre_scores_gemma":[0.9980098,0.00009796168,0.0010311712,0.0003105164,0.000014789295,0.000024175431,0.0000049922783,0.00004933625,0.00045727828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99456984,0.0010171443,0.00077069737,0.0011009774,0.0014111275,0.0011301999],"domain_scores_gemma":[0.9941817,0.0018929568,0.00045900024,0.0025291448,0.0005019846,0.00043525055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018456199,0.0004818244,0.0007368235,0.0005428024,0.00033534583,0.00015157484,0.002998399,0.00020689752,0.000098262746],"category_scores_gemma":[0.00072038535,0.0004953869,0.00031953957,0.0020292255,0.0009582222,0.0005406028,0.00089425576,0.00074831396,0.0006190468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107937434,0.00035535925,0.001081325,0.0001304093,0.000057669888,0.000014759544,0.0003172054,0.00019554028,0.0032890365,0.9879027,0.0011745641,0.0053734775],"study_design_scores_gemma":[0.0014906045,0.0017443083,0.0022575883,0.00030585792,0.000019548954,0.0000068701174,0.00001819127,0.019686867,0.0051601157,0.9651467,0.0036848113,0.00047849893],"about_ca_topic_score_codex":0.000024016874,"about_ca_topic_score_gemma":0.0000037926318,"teacher_disagreement_score":0.044200726,"about_ca_system_score_codex":0.00009518508,"about_ca_system_score_gemma":0.00013107357,"threshold_uncertainty_score":0.9997498},"labels":[],"label_agreement":null},{"id":"W2402876546","doi":"","title":"Paths in the Square Unit Lattice.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Square lattice; Unit (ring theory); Lattice (music); Unit square; Combinatorics; Statistical physics; Geometry; Physics; Mathematics education","score_opus":0.02329165036726255,"score_gpt":0.28435407931640216,"score_spread":0.2610624289491396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402876546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842039,0.00017389886,0.0014654499,0.003134662,0.00060509035,0.00060394977,7.726743e-7,0.00012897997,0.009683301],"genre_scores_gemma":[0.9982183,0.000009069649,0.0010835525,0.00039045373,0.000004368754,0.00009527865,0.000001231539,0.000008687412,0.00018905978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848276,0.00031524297,0.00015991296,0.00026665712,0.00038494307,0.00039047375],"domain_scores_gemma":[0.9984142,0.00045075492,0.000039443108,0.00092053483,0.00010500295,0.00007004995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000618524,0.00011126726,0.00011045617,0.00011944022,0.000121533914,0.00018812837,0.0018908621,0.00004903558,0.000055038487],"category_scores_gemma":[0.0001205301,0.000079725,0.000040435523,0.0010242997,0.00007610261,0.00065571384,0.0002812427,0.00031733737,0.0006248409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013190073,0.00006755113,0.004757878,0.0000047274666,0.0000027557885,0.000017768578,0.0007688362,0.000005281696,0.00006560637,0.988636,0.00077364105,0.0048986007],"study_design_scores_gemma":[0.00036528803,0.00007119811,0.025139414,0.000009159401,7.7381424e-7,0.0000057968246,0.00020187451,0.0016444202,0.00014709403,0.97037566,0.0019309638,0.00010834991],"about_ca_topic_score_codex":0.00005850851,"about_ca_topic_score_gemma":0.0000073640863,"teacher_disagreement_score":0.020381536,"about_ca_system_score_codex":0.000025000025,"about_ca_system_score_gemma":0.00003613721,"threshold_uncertainty_score":0.80312735},"labels":[],"label_agreement":null},{"id":"W2402909918","doi":"","title":"The diameter and the chromatic number of almost self-complementary graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.009039655011315144,"score_gpt":0.26160114102053666,"score_spread":0.2525614860092215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402909918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903219,0.00044354203,0.0010304438,0.004057275,0.00074112375,0.0010095775,0.0000018828475,0.00010058728,0.0022936985],"genre_scores_gemma":[0.9952831,0.00009421035,0.004199931,0.00022920266,0.0000030552667,0.00010859629,6.622585e-7,0.0000105878335,0.00007063734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849325,0.0003318843,0.00025859653,0.0002264391,0.00036462015,0.00032519916],"domain_scores_gemma":[0.9973951,0.0014535718,0.00010728081,0.0008582625,0.00011308858,0.0000727026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080601766,0.00012587807,0.00017695005,0.000037629805,0.00034797672,0.00014762163,0.0012431078,0.000025602274,0.000041904488],"category_scores_gemma":[0.00006810393,0.00006739102,0.0000703222,0.0004247782,0.00050551543,0.0005030228,0.00043938376,0.00016342029,0.00006759188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006194279,0.000035523553,0.0033752136,0.000010764715,0.000052970998,9.687255e-7,0.00057908375,2.6124812e-7,0.00008899524,0.99186176,0.0012419983,0.0027462412],"study_design_scores_gemma":[0.001079671,0.00003927961,0.006447579,0.000009727282,0.000006814558,0.000011550224,0.00010694106,0.0015568481,0.0005397486,0.98951775,0.00059639616,0.0000876989],"about_ca_topic_score_codex":0.00009000959,"about_ca_topic_score_gemma":0.000003020908,"teacher_disagreement_score":0.004961248,"about_ca_system_score_codex":0.000016932778,"about_ca_system_score_gemma":0.000022068127,"threshold_uncertainty_score":0.2748126},"labels":[],"label_agreement":null},{"id":"W2402911904","doi":"","title":"Some basic properties of a class of total transformation digraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transformation (genetics); Class (philosophy); Pure mathematics; Algebra over a field; Computer science; Chemistry; Artificial intelligence","score_opus":0.0150144772365516,"score_gpt":0.23880884342100983,"score_spread":0.22379436618445822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402911904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928013,0.00019844524,0.0053041624,0.00018574667,0.0004224535,0.00020264914,0.0000013846109,0.00005685903,0.0008269971],"genre_scores_gemma":[0.99945235,0.000014257963,0.00045773902,0.00001655054,0.0000042952574,0.000014589038,7.21831e-7,0.0000072494545,0.000032257703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988124,0.00013315918,0.00028479454,0.00017443593,0.0003816767,0.00021356509],"domain_scores_gemma":[0.99913424,0.00007603737,0.000107065964,0.00047155534,0.0001535528,0.000057549925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046252707,0.00009813658,0.00020549951,0.00018114725,0.000051163606,0.000019266663,0.0005459721,0.000046947862,0.0000019887195],"category_scores_gemma":[0.0000678408,0.0000840075,0.00008490617,0.0004595502,0.0001621786,0.0008276405,0.00009062077,0.0001106782,0.000006717633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001993942,0.00007956438,0.00018928747,0.00007663975,0.000012062843,2.4454837e-7,0.0008975231,0.000028521717,0.022966422,0.9713437,0.000014114607,0.004372003],"study_design_scores_gemma":[0.00064923515,0.00028674168,0.00080695236,0.00005361167,0.000003515752,0.0000023245861,0.000040534564,0.007389936,0.21543875,0.7751239,0.000097165626,0.00010735237],"about_ca_topic_score_codex":0.000010297964,"about_ca_topic_score_gemma":7.5858065e-7,"teacher_disagreement_score":0.1962198,"about_ca_system_score_codex":0.000015389573,"about_ca_system_score_gemma":0.000040690404,"threshold_uncertainty_score":0.34257263},"labels":[],"label_agreement":null},{"id":"W2402934917","doi":"","title":"On the Independence Number of Edge Chromatic Critical Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Mathematics; Independence (probability theory); Enhanced Data Rates for GSM Evolution; Independence number; Critical graph; Combinatorics; Graph; Computer science; Statistics; Artificial intelligence; Line graph","score_opus":0.032152945611647936,"score_gpt":0.30465624579117373,"score_spread":0.2725033001795258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402934917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579995,0.00005446654,0.006313696,0.00040340336,0.0012897162,0.0002956483,0.0000019212735,0.00012736108,0.03351428],"genre_scores_gemma":[0.9974016,0.0000047034996,0.002362234,0.00013567213,0.0000018654318,0.000027860267,1.6581073e-7,0.000010862478,0.000055050117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982837,0.00024748853,0.00022332232,0.00030116332,0.00059586286,0.00034850682],"domain_scores_gemma":[0.9974589,0.0011283695,0.000063015425,0.0010643187,0.00018089026,0.000104543586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074248057,0.00013190712,0.00016772332,0.000080888705,0.00014170125,0.000033742013,0.0017820791,0.000070236034,0.00020070886],"category_scores_gemma":[0.00066196837,0.000094015035,0.00008133091,0.0006609836,0.0004068597,0.0003323959,0.00035828695,0.00033939962,0.00026983672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100546085,0.00016406241,0.0013239289,0.000013527936,0.000011299896,0.000014979601,0.00053965824,2.3085946e-7,0.00015829882,0.99708873,0.00027546295,0.00039978288],"study_design_scores_gemma":[0.00018466458,0.00012883895,0.0034518843,0.00003623045,0.0000029899247,0.000013549572,0.000031448006,0.00030644066,0.007908837,0.9878135,0.0000145387085,0.00010712398],"about_ca_topic_score_codex":0.000013743798,"about_ca_topic_score_gemma":7.648469e-7,"teacher_disagreement_score":0.03940208,"about_ca_system_score_codex":0.000021329206,"about_ca_system_score_gemma":0.00005690408,"threshold_uncertainty_score":0.38338217},"labels":[],"label_agreement":null},{"id":"W2402942974","doi":"","title":"Spanning trees whose stems have a few leaves.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Horticulture; Biology","score_opus":0.02038433947615764,"score_gpt":0.28091679411747006,"score_spread":0.2605324546413124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402942974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7863829,0.00089192524,0.1675777,0.0017551808,0.004842881,0.00076421665,0.0000028429433,0.001177103,0.036605217],"genre_scores_gemma":[0.9936325,0.0000112718135,0.0043252152,0.00014844094,0.000021768434,0.000027261294,0.0000012189746,0.000025207926,0.0018070913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784136,0.0002569687,0.0002430314,0.0005483192,0.0005177256,0.00059259275],"domain_scores_gemma":[0.9980769,0.00034903624,0.000097767086,0.0011221067,0.00013226544,0.0002219197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086991047,0.00020398347,0.00026130598,0.00019991872,0.0002497226,0.00023528698,0.0015461202,0.00008286776,0.000013956792],"category_scores_gemma":[0.00022771921,0.00019701934,0.0000941324,0.0005239638,0.0001380353,0.0006756167,0.0005364569,0.0003237107,0.0002800096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007987392,0.000059386948,0.0028654044,0.000008555857,0.000014600356,0.000016838687,0.00052820763,0.000053609463,0.00071841676,0.9691744,0.0006863088,0.0258663],"study_design_scores_gemma":[0.00090484647,0.00023899664,0.0042712437,0.000042802734,0.000003669258,0.000013875432,0.00006753884,0.017929439,0.003926391,0.9589132,0.013369551,0.00031845385],"about_ca_topic_score_codex":0.000023643492,"about_ca_topic_score_gemma":0.0000059367003,"teacher_disagreement_score":0.2072496,"about_ca_system_score_codex":0.00006061365,"about_ca_system_score_gemma":0.000049097514,"threshold_uncertainty_score":0.80342156},"labels":[],"label_agreement":null},{"id":"W2402960228","doi":"","title":"On the Maximum Number of Disjoint Chorded Cycles in Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics","score_opus":0.028278054149201388,"score_gpt":0.2801251987870706,"score_spread":0.2518471446378692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402960228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98151934,0.000025973126,0.0005849355,0.0002314474,0.00046132712,0.00022293506,0.0000011275089,0.000051042,0.016901845],"genre_scores_gemma":[0.9986436,0.000012834652,0.001182088,0.00007559747,0.0000010536633,0.000031460073,3.4147706e-7,0.000010909795,0.000042139567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986257,0.00020351108,0.00022655411,0.00028711953,0.0003399318,0.000317209],"domain_scores_gemma":[0.9985535,0.00033519077,0.00008072385,0.00090037927,0.000066969835,0.00006319289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615475,0.00012522655,0.00016702052,0.00012627398,0.00006803714,0.00002141836,0.0013133863,0.000047751735,0.00007827061],"category_scores_gemma":[0.00013857026,0.00008905054,0.000074606076,0.0008051794,0.00018447071,0.00021676798,0.00030994465,0.0002548958,0.00008700193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002431908,0.00018533661,0.009174055,0.0000046001865,0.000008868282,0.000010723343,0.00071981613,0.0000015805285,0.00013992237,0.9881415,0.00010521672,0.0014841079],"study_design_scores_gemma":[0.00036033962,0.00007649421,0.022957204,0.000023946892,0.0000010582033,0.000002718056,0.000049388556,0.00015937394,0.006066909,0.97017235,0.000030430294,0.0000998116],"about_ca_topic_score_codex":0.000061040504,"about_ca_topic_score_gemma":0.000008348553,"teacher_disagreement_score":0.017969128,"about_ca_system_score_codex":0.000025732204,"about_ca_system_score_gemma":0.000028383285,"threshold_uncertainty_score":0.36313757},"labels":[],"label_agreement":null},{"id":"W2403021968","doi":"","title":"On the structure of graphs with exactly two near-perfect matchings.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015499850818069281,"score_gpt":0.24958455808302155,"score_spread":0.23408470726495226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403021968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948073,0.000029493704,0.0015463558,0.00008743,0.00035736614,0.00024671157,0.0000027317753,0.00008048073,0.002842115],"genre_scores_gemma":[0.9960502,0.0000022109039,0.0037555636,0.00013089969,0.0000017538982,0.000005651083,5.6238434e-7,0.000017686509,0.000035472716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984948,0.00019728602,0.00015805445,0.00034110184,0.00047686647,0.0003318682],"domain_scores_gemma":[0.9982708,0.00031514355,0.00011458018,0.0010899286,0.00012342024,0.00008612205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003229308,0.00017396317,0.0001862272,0.00008828476,0.00021016743,0.00006269297,0.0015336904,0.000043040443,0.00006589227],"category_scores_gemma":[0.00006136512,0.00010275117,0.00006245713,0.00073713355,0.00028394532,0.00029953607,0.00021859341,0.0003663959,0.000018877627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057874808,0.00005839137,0.001651206,0.0000065335,0.000029572211,0.000011641754,0.0012704127,0.000015264648,0.0017176891,0.99440676,0.00009069461,0.00068397186],"study_design_scores_gemma":[0.0004904883,0.00045916103,0.0025817382,0.000025948084,0.000004225929,0.000010371992,0.00003225909,0.00029312103,0.030578097,0.96537143,0.000021489142,0.00013168142],"about_ca_topic_score_codex":0.00005618908,"about_ca_topic_score_gemma":0.000007844194,"teacher_disagreement_score":0.029035328,"about_ca_system_score_codex":0.000019736148,"about_ca_system_score_gemma":0.00006323385,"threshold_uncertainty_score":0.4190071},"labels":[],"label_agreement":null},{"id":"W2403055888","doi":"","title":"Kernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Colored; Chromatic scale; Mathematics; Transitive relation; Fibonacci number; Combinatorics; Optics; Physics; Materials science; Composite material","score_opus":0.010168500101461857,"score_gpt":0.2549953809335078,"score_spread":0.24482688083204596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403055888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98372513,0.00066492194,0.012697712,0.00017546704,0.0004437998,0.000774421,0.0000068128784,0.00044205846,0.0010696491],"genre_scores_gemma":[0.99572265,0.000028253542,0.0038618587,0.0000756886,0.000005235943,0.00019121708,0.0000098166465,0.00003912882,0.00006613812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690926,0.00047652563,0.0004053707,0.0005274646,0.0006512875,0.0010300761],"domain_scores_gemma":[0.99792963,0.00060674944,0.00015161684,0.0008611246,0.00012230029,0.0003285656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006980726,0.00034273037,0.0004732619,0.000318029,0.00014950577,0.00011830158,0.001041241,0.00012512434,0.000016786447],"category_scores_gemma":[0.00011562761,0.00029967524,0.00008064074,0.0020559442,0.0002227942,0.0015429584,0.00016959792,0.00040195507,0.00006834346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015174068,0.0029557615,0.06885204,0.00018764392,0.00020596356,0.00014469348,0.010529937,0.000030298745,0.012005375,0.899223,0.001044834,0.0046686893],"study_design_scores_gemma":[0.005985748,0.0014890683,0.13928902,0.0004431096,0.000040882587,0.00007791144,0.00062325294,0.02094485,0.019117368,0.8102439,0.00024360808,0.0015012788],"about_ca_topic_score_codex":0.000053841653,"about_ca_topic_score_gemma":0.000018738161,"teacher_disagreement_score":0.08897912,"about_ca_system_score_codex":0.0001854255,"about_ca_system_score_gemma":0.00009969452,"threshold_uncertainty_score":0.9999455},"labels":[],"label_agreement":null},{"id":"W2403124968","doi":"","title":"Large sets of P 3 -decompostitions of complete multipartite graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.02941349928033445,"score_gpt":0.3080258019436919,"score_spread":0.27861230266335746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403124968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827459,0.0004353793,0.013314434,0.00011237599,0.0011723372,0.00027384356,0.000061381805,0.000094735624,0.0017896504],"genre_scores_gemma":[0.9918958,0.000015568075,0.007998178,0.000030520514,0.000002743993,0.000014202911,0.00000759728,0.000011231335,0.00002416453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843293,0.00016309659,0.00033084347,0.00020073871,0.00037744752,0.00049492466],"domain_scores_gemma":[0.99836296,0.0003160204,0.00016624256,0.00076348375,0.00022012163,0.00017119391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061764714,0.00012530937,0.00025972532,0.00022437592,0.00010391306,0.000012541237,0.0008399032,0.000051307885,0.000032581665],"category_scores_gemma":[0.00010402596,0.0001255557,0.0001163513,0.0007888556,0.00016566238,0.0006041727,0.00039159608,0.00015384628,0.000044625638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008480616,0.00036947965,0.018649409,0.000025951382,0.000025055995,0.0000012408069,0.0005677249,0.000008247197,0.0065130983,0.9733188,0.0002537337,0.00025875014],"study_design_scores_gemma":[0.0010890835,0.00014115417,0.032154735,0.000039020262,0.000008171976,0.000006647036,0.000050426996,0.0015989098,0.018157432,0.9448891,0.0016755173,0.00018975708],"about_ca_topic_score_codex":0.000009285351,"about_ca_topic_score_gemma":0.0000022158251,"teacher_disagreement_score":0.028429683,"about_ca_system_score_codex":0.000019104342,"about_ca_system_score_gemma":0.000029753954,"threshold_uncertainty_score":0.5120013},"labels":[],"label_agreement":null},{"id":"W2403137284","doi":"","title":"On a Family of 4-Critical Graphs with Diameter Three.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.021440355788581122,"score_gpt":0.28756598327571176,"score_spread":0.26612562748713064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403137284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9530568,0.00027107346,0.041337848,0.0001926922,0.000956154,0.00020463236,0.0000025261681,0.00010834834,0.00386993],"genre_scores_gemma":[0.99074715,0.0000027516564,0.009074676,0.00011385275,0.0000038066025,0.000022984426,4.890736e-7,0.000014563971,0.000019724304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984717,0.00010406921,0.00015648607,0.00025578248,0.00050889445,0.0005030618],"domain_scores_gemma":[0.9981831,0.00069819595,0.000042372863,0.000757838,0.00012170693,0.00019679706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004081247,0.00013916314,0.00018953036,0.00017050224,0.00007396736,0.000028758985,0.00072878046,0.000051104158,0.000010229576],"category_scores_gemma":[0.00015366708,0.00010817965,0.00006180566,0.0006496432,0.00028743263,0.0005275752,0.0001866033,0.00021657303,0.000051135885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032351898,0.00029719857,0.004664307,0.0000126799905,0.000013963193,0.0000055103915,0.0001524262,0.0000021576416,0.0005898088,0.99215233,0.00011434389,0.0019629346],"study_design_scores_gemma":[0.00047559344,0.000527907,0.0101326695,0.000026966043,0.0000046567857,0.000005363156,0.0000137336665,0.00017366413,0.003898213,0.9845244,0.000069299706,0.00014750856],"about_ca_topic_score_codex":0.000005729514,"about_ca_topic_score_gemma":7.8307744e-7,"teacher_disagreement_score":0.037690356,"about_ca_system_score_codex":0.000022069451,"about_ca_system_score_gemma":0.000031439944,"threshold_uncertainty_score":0.4411438},"labels":[],"label_agreement":null},{"id":"W2403154468","doi":"","title":"Competition Graphs of Acyclic Digraphs Satisfying Condition C*(p).","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Competition (biology); Discrete mathematics; Biology","score_opus":0.013415520567717342,"score_gpt":0.2833103321507263,"score_spread":0.269894811583009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403154468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97304535,0.00025797178,0.019654829,0.0004978182,0.00076915964,0.00034139206,0.0000056756876,0.0002848724,0.0051429598],"genre_scores_gemma":[0.99645317,0.000049324855,0.0033165547,0.00012537655,0.000003110524,0.000010203056,0.000010480042,0.000008192995,0.000023598317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838495,0.00015374365,0.00030694949,0.00035235603,0.00046189074,0.0003401096],"domain_scores_gemma":[0.9987153,0.00018785919,0.00015714133,0.00066376175,0.00016371753,0.0001122548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037905146,0.00015235395,0.00023057553,0.0003557352,0.00015738253,0.00006132235,0.0007829284,0.0000697628,0.000017607648],"category_scores_gemma":[0.000070503294,0.00015907573,0.00011406044,0.0011188927,0.00013046758,0.0007575068,0.00009704184,0.00020314651,0.000028247761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010175474,0.00010806654,0.0012807589,0.000009958198,0.000011017426,0.000007786862,0.00016555487,0.000013678572,0.010861983,0.979191,0.00010644751,0.008233571],"study_design_scores_gemma":[0.0006252868,0.00027044397,0.025992116,0.000043079523,0.000004118977,0.0000083341165,0.000020589812,0.00047894215,0.0134428125,0.9588425,0.00011517558,0.00015657875],"about_ca_topic_score_codex":0.00000719454,"about_ca_topic_score_gemma":0.0000014952894,"teacher_disagreement_score":0.024711356,"about_ca_system_score_codex":0.000035095225,"about_ca_system_score_gemma":0.000032732463,"threshold_uncertainty_score":0.648692},"labels":[],"label_agreement":null},{"id":"W2403213260","doi":"","title":"A Study on Radial Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.019578667271630268,"score_gpt":0.3005948862521077,"score_spread":0.2810162189804774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403213260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99067783,0.0000078226785,0.00030570134,0.00023386897,0.0035982314,0.00038610233,7.187963e-7,0.00022454218,0.0045652003],"genre_scores_gemma":[0.99881333,0.0000010096309,0.00088768505,0.00009673736,0.000009673446,0.000046722565,4.4851632e-7,0.000014417082,0.00012995022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983539,0.00013917594,0.00015636993,0.0004653045,0.0004985066,0.00038672567],"domain_scores_gemma":[0.9982384,0.000237939,0.000046339028,0.0012172934,0.000084053354,0.00017596132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005977689,0.0001496204,0.00015530318,0.00022593126,0.00019860065,0.00012469638,0.0015450084,0.00005896941,0.000017323138],"category_scores_gemma":[0.00015256762,0.00013744716,0.00006677879,0.00076952676,0.00009323435,0.000323904,0.00030358706,0.0005918582,0.00024444243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014117846,0.00048370237,0.0058275834,9.0491346e-7,0.00001331942,0.000061498,0.00049387803,0.0000012655216,0.0011986836,0.9883758,0.00034378763,0.0031854482],"study_design_scores_gemma":[0.0011237073,0.00065872836,0.019295398,0.0000025040495,0.0000021617989,0.000007916154,0.00005023814,0.000114875096,0.0016396627,0.97613406,0.0007979252,0.0001728355],"about_ca_topic_score_codex":0.0000070254746,"about_ca_topic_score_gemma":0.0000076288297,"teacher_disagreement_score":0.013467814,"about_ca_system_score_codex":0.000017012711,"about_ca_system_score_gemma":0.000049082897,"threshold_uncertainty_score":0.5604933},"labels":[],"label_agreement":null},{"id":"W2403260949","doi":"","title":"Distance-Dominating Cycles in P3-Dominated Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016016955823797568,"score_gpt":0.2865911891191448,"score_spread":0.2705742332953472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403260949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838441,0.0008412863,0.0077022575,0.00025894953,0.0016964915,0.00034296705,0.0000016452008,0.00022863872,0.0050836857],"genre_scores_gemma":[0.9944236,0.000024433888,0.005273304,0.00005448137,0.000007460406,0.000056197667,0.0000023300063,0.00002303041,0.00013513226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976106,0.00027409318,0.00033517205,0.00040211412,0.00044876372,0.00092920184],"domain_scores_gemma":[0.9983746,0.00044190188,0.000109800894,0.0007543804,0.000093212904,0.00022613577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012317656,0.00021287988,0.0002693711,0.00035542273,0.00016615319,0.000089589594,0.0012189433,0.00008725054,0.0000149474035],"category_scores_gemma":[0.0002736768,0.000213305,0.00008215371,0.0016300674,0.0001447465,0.001422512,0.00043876897,0.00037843065,0.00007952264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018258288,0.00017937917,0.040083017,0.000012712769,0.00000783806,0.000017714183,0.0006751033,0.000006913968,0.0009956248,0.94758976,0.000111964386,0.010301713],"study_design_scores_gemma":[0.0012335752,0.00006141426,0.029315738,0.0000473174,0.0000025144652,0.0000104419405,0.00011394529,0.0024563398,0.005248483,0.9605186,0.00066851464,0.00032309935],"about_ca_topic_score_codex":0.000022554535,"about_ca_topic_score_gemma":0.000009940704,"teacher_disagreement_score":0.012928856,"about_ca_system_score_codex":0.00013043563,"about_ca_system_score_gemma":0.000036390844,"threshold_uncertainty_score":0.8698326},"labels":[],"label_agreement":null},{"id":"W2403346694","doi":"","title":"Skewness, splitting number and vertex deletion of some toroidal meshes.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Skewness; Vertex (graph theory); Toroid; Polygon mesh; Combinatorics; Geometry; Statistics; Physics; Plasma; Quantum mechanics","score_opus":0.01008359434466397,"score_gpt":0.26936116564442564,"score_spread":0.25927757129976164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403346694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915089,0.000318818,0.0053682,0.00045518568,0.00053101406,0.00015510723,9.00915e-7,0.00010578439,0.0015560625],"genre_scores_gemma":[0.99629575,0.000038561695,0.0034675596,0.00010006831,0.000006695374,0.0000038938297,0.0000010784414,0.0000072865,0.00007909264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875087,0.000087700675,0.00021453944,0.00031804462,0.00032923886,0.000299585],"domain_scores_gemma":[0.99911094,0.00014661264,0.00008411049,0.00044658905,0.00011155162,0.00010019475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043857613,0.000119930606,0.00018892447,0.00006786229,0.000106708074,0.000055109198,0.00051252614,0.0000632226,0.000006827095],"category_scores_gemma":[0.00010130542,0.00011979224,0.000044552227,0.00033489504,0.00008518134,0.00075707893,0.00017374747,0.0001543505,0.000019247855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010191136,0.00006003983,0.0019746493,0.000009856668,0.0000063824114,0.000007545662,0.0001558924,0.0000039165766,0.0032206506,0.97619677,0.00009108252,0.018263007],"study_design_scores_gemma":[0.0005097923,0.000106939355,0.01029984,0.000022656921,0.0000027115636,0.000012292965,0.000013966636,0.0014248324,0.0074460725,0.9797767,0.0002560939,0.00012809827],"about_ca_topic_score_codex":0.000008751308,"about_ca_topic_score_gemma":3.9305294e-7,"teacher_disagreement_score":0.018134909,"about_ca_system_score_codex":0.000037236536,"about_ca_system_score_gemma":0.00003797684,"threshold_uncertainty_score":0.48849857},"labels":[],"label_agreement":null},{"id":"W2403458251","doi":"","title":"Supergraphs And Graphical Complexity Of Permutation Groups.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Permutation group; Combinatorics","score_opus":0.043855397309992855,"score_gpt":0.27886234143306055,"score_spread":0.2350069441230677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403458251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906188,0.00013012663,0.006566775,0.00009166955,0.0002481022,0.00014435843,0.0000015001204,0.000083092906,0.002115552],"genre_scores_gemma":[0.99282014,0.000027576521,0.007097986,0.000026619417,0.0000013873049,0.000009263223,0.0000014970698,0.0000075671883,0.000007953743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885833,0.00013630495,0.00019584135,0.00029875184,0.00027581933,0.00023493666],"domain_scores_gemma":[0.9991379,0.00010007245,0.000058963178,0.00044891323,0.00013656789,0.000117611395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036173,0.00010768305,0.00017186547,0.00019120298,0.00009962788,0.000021583632,0.00056631345,0.000056032284,0.00001518323],"category_scores_gemma":[0.000056832032,0.0001036183,0.000055329143,0.00061995746,0.0005797761,0.00044208072,0.0002531288,0.00015480259,0.0000055723785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016484639,0.00009577463,0.014504409,0.0000144199585,0.0000122997,0.0000059014137,0.000951447,1.5190518e-7,0.00072382967,0.98259264,0.000018654375,0.001063985],"study_design_scores_gemma":[0.00040178554,0.00017964665,0.083927445,0.000008346626,0.0000029871414,0.000009387662,0.000052793304,0.00065879675,0.0032678333,0.9113784,0.000011873653,0.00010072141],"about_ca_topic_score_codex":0.000035127032,"about_ca_topic_score_gemma":0.0000049844293,"teacher_disagreement_score":0.07121426,"about_ca_system_score_codex":0.00000991757,"about_ca_system_score_gemma":0.00002084785,"threshold_uncertainty_score":0.42254317},"labels":[],"label_agreement":null},{"id":"W2403530833","doi":"10.1007/978-3-319-29221-2_23","title":"Medians of Permutations: Building Constraints","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.022009729105714134,"score_gpt":0.29823651536144885,"score_spread":0.2762267862557347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403530833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007394822,0.00030400552,0.9917991,0.0005769142,0.00068282644,0.0003315566,0.000016135062,0.00009587527,0.006119594],"genre_scores_gemma":[0.35226676,0.000070883245,0.6466416,0.0003576605,0.00023917377,0.00001192517,0.0000014675626,0.000038058766,0.0003724533],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629116,0.00005261226,0.0005439679,0.0012204556,0.0012191738,0.00067260675],"domain_scores_gemma":[0.9962299,0.0014797517,0.0003098888,0.001346059,0.00044137603,0.00019304077],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011589912,0.00037962652,0.00048819007,0.0013274403,0.00017936203,0.00014987294,0.0039355108,0.00022752336,0.000060507133],"category_scores_gemma":[0.00035927896,0.00030968615,0.00013547772,0.00069173734,0.0034422427,0.0006822373,0.0011860166,0.0005757193,0.000034323464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026971097,0.00000966227,0.00002193106,0.000022315207,0.000007888869,0.000044397653,0.0002975391,0.001683028,0.0013472474,0.43200913,0.0000019690099,0.5645522],"study_design_scores_gemma":[0.0002585704,0.00011612913,0.000033365537,0.00061224896,0.0000035522266,0.000076967895,2.3278592e-7,0.029207885,0.0062709157,0.9627428,0.0002589236,0.000418402],"about_ca_topic_score_codex":0.0000021650499,"about_ca_topic_score_gemma":0.000008639031,"teacher_disagreement_score":0.56413376,"about_ca_system_score_codex":0.00021453452,"about_ca_system_score_gemma":0.00077431183,"threshold_uncertainty_score":0.9999355},"labels":[],"label_agreement":null},{"id":"W2403544395","doi":"","title":"A note on graphs containing all trees of a given size.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01628100681929117,"score_gpt":0.29396104742290224,"score_spread":0.27768004060361107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403544395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928756,0.000026690994,0.0011374666,0.0006178363,0.0014195505,0.00023645771,0.0000031790069,0.00014626958,0.0035369624],"genre_scores_gemma":[0.99425757,0.0000053113085,0.0054698857,0.00014240183,0.000004792989,0.000019653198,8.0062324e-7,0.000015135046,0.000084436404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984597,0.000111057285,0.00022871517,0.00037892777,0.000435605,0.0003860153],"domain_scores_gemma":[0.99763525,0.0010370244,0.000120131874,0.0009161145,0.00014663384,0.00014482673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000575063,0.00015494628,0.00023861037,0.00017064132,0.000090587666,0.000049621016,0.0013031515,0.000088570756,0.000019536212],"category_scores_gemma":[0.00049223704,0.00014505655,0.00010748203,0.00052906433,0.00016987525,0.0002944434,0.00028206347,0.00046803374,0.000035949295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007033499,0.00011312255,0.0010298421,0.0000054815655,0.000018853363,0.00001939509,0.0005916403,0.0000070531023,0.024699297,0.9687848,0.000113803835,0.0045463443],"study_design_scores_gemma":[0.0009755662,0.0005730823,0.005075136,0.000020822357,0.0000036151598,0.0000056306876,0.00002075931,0.0009041502,0.016702266,0.9742183,0.0013351459,0.00016550065],"about_ca_topic_score_codex":0.000018851735,"about_ca_topic_score_gemma":0.000022261582,"teacher_disagreement_score":0.007997029,"about_ca_system_score_codex":0.000018743674,"about_ca_system_score_gemma":0.00006241996,"threshold_uncertainty_score":0.5915234},"labels":[],"label_agreement":null},{"id":"W2403587392","doi":"","title":"On (k, t)-choosability of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; List coloring; Mathematics; Vertex (graph theory); Graph; Fractional coloring; Graph coloring; Complete coloring; Planar graph; Brooks' theorem; Edge coloring; Discrete mathematics; Chordal graph; 1-planar graph; Graph power; Line graph","score_opus":0.030211719015776954,"score_gpt":0.2773091559090248,"score_spread":0.2470974368932478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403587392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97294223,0.000040403484,0.002593127,0.000048946942,0.0008297031,0.0001914772,0.0000015943308,0.00012766449,0.023224864],"genre_scores_gemma":[0.9959129,0.0000046173495,0.0039677154,0.000043202643,7.8021054e-7,0.000012460864,3.4337307e-7,0.000007797692,0.000050155664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987197,0.00013999164,0.00020148793,0.00033390298,0.0003354404,0.0002694941],"domain_scores_gemma":[0.99835336,0.00022997543,0.00007533525,0.0011043615,0.00012946187,0.0001074856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005173535,0.000109989545,0.0001650308,0.0001435289,0.00006200177,0.000012044586,0.0011890458,0.0000501388,0.000050587074],"category_scores_gemma":[0.0001887084,0.00010074126,0.00008649413,0.0006394673,0.0001777355,0.00027471132,0.00024360322,0.00017914135,0.00006524329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025662659,0.00023617489,0.0038456954,0.000007961869,0.00000974669,0.0000049784803,0.00033032533,9.214508e-7,0.0002877165,0.99299204,0.00011976491,0.002139],"study_design_scores_gemma":[0.00032463679,0.00030336622,0.0131789865,0.000009234876,0.0000013456844,0.0000013845208,0.000009091038,0.000089754845,0.021415452,0.9645275,0.000043027303,0.00009620495],"about_ca_topic_score_codex":0.000018055121,"about_ca_topic_score_gemma":9.634687e-7,"teacher_disagreement_score":0.028464537,"about_ca_system_score_codex":0.000024238254,"about_ca_system_score_gemma":0.000035481982,"threshold_uncertainty_score":0.41081092},"labels":[],"label_agreement":null},{"id":"W2403590840","doi":"","title":"Quasi-tree graphs with the largest and the second largest numbers of maximum independent sets.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics; Discrete mathematics","score_opus":0.007807377460355607,"score_gpt":0.23400131493171958,"score_spread":0.22619393747136396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403590840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990715,0.00039285092,0.00071362755,0.0034200032,0.00035259372,0.00077115756,0.00000528025,0.000063755375,0.0035656977],"genre_scores_gemma":[0.99863046,0.00002921786,0.00054475403,0.0002568177,0.0000023139817,0.00009882687,0.0000012783157,0.000018486122,0.00041782114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796355,0.00037016088,0.00022598937,0.00039138578,0.00059754954,0.00045138557],"domain_scores_gemma":[0.9976919,0.0007052664,0.00016218542,0.0011003789,0.00021441195,0.0001258558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747737,0.00020416308,0.0002667323,0.00009342025,0.0003025895,0.00018369316,0.0015482516,0.00007092019,0.00006469113],"category_scores_gemma":[0.000053107142,0.00010740015,0.000073051306,0.0006734747,0.0007899434,0.00055524893,0.0005450676,0.0004385846,0.00003792444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003750113,0.00011672111,0.008167351,0.000017762366,0.0000604947,0.000007061787,0.0009878911,0.0000022633396,0.00010380327,0.9883468,0.0008242338,0.0013280949],"study_design_scores_gemma":[0.0023741187,0.00021504724,0.015779661,0.00001568036,0.000008802616,0.000031610114,0.0003821614,0.00047399587,0.0008754252,0.97892904,0.0007429504,0.00017150135],"about_ca_topic_score_codex":0.00014481027,"about_ca_topic_score_gemma":0.00019880483,"teacher_disagreement_score":0.009417776,"about_ca_system_score_codex":0.00002075339,"about_ca_system_score_gemma":0.000060082824,"threshold_uncertainty_score":0.4379651},"labels":[],"label_agreement":null},{"id":"W2403593319","doi":"","title":"Extending matchings in planar odd graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar; Planar graph; Graph; Computer science","score_opus":0.029042415767146314,"score_gpt":0.2952516997471866,"score_spread":0.2662092839800403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403593319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808744,0.00048411664,0.007272211,0.00078540156,0.0022035155,0.00029140033,0.0000014937701,0.00033238804,0.00775503],"genre_scores_gemma":[0.99397427,0.0000143431325,0.005705685,0.000120089855,0.0000038715953,0.00002040409,0.0000015389136,0.000015481533,0.00014434145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982305,0.00015931834,0.0002175059,0.00041054867,0.00048617125,0.00049591286],"domain_scores_gemma":[0.99882436,0.00016016122,0.00005929943,0.0006385093,0.00007963111,0.00023806293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010582497,0.00014653157,0.00018902935,0.00036941003,0.00007818283,0.0001080999,0.0012963391,0.00006332241,0.000004388821],"category_scores_gemma":[0.00015721937,0.00014719034,0.000047320347,0.0011160065,0.000070543865,0.0008003266,0.00029612813,0.00031739936,0.000121000536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012125762,0.000058036672,0.0062080384,0.0000046783684,0.000004828962,0.00009583229,0.0006892872,0.000018472982,0.00018863479,0.98963696,0.0007639062,0.002319196],"study_design_scores_gemma":[0.00082233595,0.000086202075,0.0024856993,0.000021826576,8.402764e-7,0.000017379578,0.000080557096,0.001166351,0.0005019325,0.99361485,0.0010273182,0.00017468748],"about_ca_topic_score_codex":0.000049796756,"about_ca_topic_score_gemma":0.000007904206,"teacher_disagreement_score":0.013099801,"about_ca_system_score_codex":0.00011077792,"about_ca_system_score_gemma":0.00007814187,"threshold_uncertainty_score":0.60022473},"labels":[],"label_agreement":null},{"id":"W2403622411","doi":"","title":"A Result on Linear Arboricity of Planar Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Planar; Planar graph; Combinatorics; Graph; Computer science; Computer graphics (images)","score_opus":0.037354521562636245,"score_gpt":0.3021261858310823,"score_spread":0.26477166426844606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403622411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97243845,0.00020369024,0.008053042,0.0009110851,0.0024015524,0.00041426282,0.000011862296,0.0003182698,0.015247792],"genre_scores_gemma":[0.99340206,0.00001014356,0.0063293944,0.00009652138,0.0000061417427,0.000010635122,0.0000020457583,0.000011989695,0.00013107744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823505,0.00017413999,0.00024335,0.0003592583,0.00065995206,0.0003282267],"domain_scores_gemma":[0.99819404,0.00023917951,0.00010892841,0.0009465375,0.00028093127,0.00023036741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007984454,0.00013757752,0.0002167144,0.00022950783,0.0000612737,0.000023949651,0.0012000264,0.000070407856,0.0000020741863],"category_scores_gemma":[0.0003892432,0.00012567206,0.00006876128,0.0010250597,0.00011889966,0.00026390376,0.00018258604,0.00025868166,0.00007113871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007106797,0.00015566908,0.0008082642,0.0000059303998,0.000013202018,0.000022039863,0.00027771536,0.00004849283,0.00024132757,0.9961837,0.0013829379,0.00078964425],"study_design_scores_gemma":[0.0010050093,0.00056910276,0.00076120434,0.00001876257,0.0000021468477,0.0000032913927,0.000023024637,0.0014646971,0.0074333344,0.9871842,0.0013971712,0.00013802569],"about_ca_topic_score_codex":0.000033356453,"about_ca_topic_score_gemma":0.0000016191243,"teacher_disagreement_score":0.020963607,"about_ca_system_score_codex":0.00005145127,"about_ca_system_score_gemma":0.00010672143,"threshold_uncertainty_score":0.5124758},"labels":[],"label_agreement":null},{"id":"W2403658863","doi":"","title":"Circumferences of 2-connected quasi-claw-free graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Structural engineering; Engineering","score_opus":0.017842507082741984,"score_gpt":0.2738109842358083,"score_spread":0.2559684771530663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403658863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97485125,0.00057792984,0.011485064,0.0015005298,0.00138259,0.0003899099,0.000006207907,0.00045055506,0.009355983],"genre_scores_gemma":[0.9958257,0.00003220949,0.0039234734,0.00011366126,0.0000037207733,0.000008259166,0.0000019570423,0.000008416864,0.00008261011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979924,0.00018328785,0.00033198408,0.0004534688,0.0005767764,0.00046209228],"domain_scores_gemma":[0.9975963,0.000315718,0.00014479,0.0015235737,0.00026584818,0.0001537429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048547765,0.00018288383,0.00030658263,0.0002937772,0.00012756344,0.00006712744,0.002829671,0.00008938621,0.000023135774],"category_scores_gemma":[0.00036691886,0.00017497646,0.00011563401,0.0015135044,0.00016587117,0.0005677599,0.00027748814,0.00024213576,0.000025979893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013487005,0.00022211266,0.0010412523,0.000007449499,0.00001529209,0.0000123971295,0.00022490232,0.000003093869,0.0029159852,0.98585546,0.00045972204,0.009228863],"study_design_scores_gemma":[0.00079335534,0.00058031816,0.009463477,0.000023903112,0.000003589716,0.0000066416173,0.00002698104,0.0004991161,0.008598869,0.97968423,0.00012792906,0.00019160818],"about_ca_topic_score_codex":0.000015692747,"about_ca_topic_score_gemma":0.0000034316245,"teacher_disagreement_score":0.020974461,"about_ca_system_score_codex":0.00002827874,"about_ca_system_score_gemma":0.00008807584,"threshold_uncertainty_score":0.7135333},"labels":[],"label_agreement":null},{"id":"W2403749856","doi":"","title":"The total number of matchings in triangle graph of a connected graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.01968312109272709,"score_gpt":0.29154948413963094,"score_spread":0.27186636304690387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403749856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958011,0.00020798732,0.0010543597,0.00022275528,0.0007007088,0.00024542678,0.0000026340263,0.000044198736,0.001720841],"genre_scores_gemma":[0.9985672,0.000013721756,0.0012769218,0.000011318035,0.0000021395158,0.000019783763,8.932673e-7,0.000010448573,0.0000975589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821305,0.0003091145,0.00039626955,0.0002471557,0.00050478836,0.00032959384],"domain_scores_gemma":[0.99802566,0.00068201515,0.0001828807,0.000708648,0.00028783272,0.00011298887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013945953,0.000121872436,0.00028533247,0.00016976302,0.000060477487,0.00003229987,0.0010974461,0.000060903094,0.0000043917694],"category_scores_gemma":[0.00046227826,0.000094480856,0.000102936545,0.0016638061,0.00024781417,0.00031794937,0.000322713,0.00021176833,0.00001119366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079526915,0.0001275131,0.0047718463,0.000009039041,0.000019292422,0.00000761183,0.00095096935,0.000025197663,0.00066654786,0.9921828,0.00023900434,0.0009206747],"study_design_scores_gemma":[0.0017746387,0.00013228177,0.0035587142,0.000024573874,0.0000023376413,0.000011481261,0.00019817182,0.00044790778,0.0040956982,0.9895802,0.00007151306,0.000102478625],"about_ca_topic_score_codex":0.00011121181,"about_ca_topic_score_gemma":0.000011034896,"teacher_disagreement_score":0.0034291502,"about_ca_system_score_codex":0.000031067375,"about_ca_system_score_gemma":0.00011584018,"threshold_uncertainty_score":0.38528174},"labels":[],"label_agreement":null},{"id":"W2403788893","doi":"","title":"Signed Edge Domination Numbers In Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.012313408805457445,"score_gpt":0.28020714517940465,"score_spread":0.2678937363739472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403788893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9401288,0.00024286755,0.02353675,0.0029277548,0.001727123,0.00066027854,0.0000011068888,0.00040872008,0.030366596],"genre_scores_gemma":[0.99697846,0.000008009674,0.002538182,0.0001611237,0.0000045965403,0.000012691316,0.0000017073645,0.0000069195803,0.00028829835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985835,0.00014387819,0.00020241906,0.00035966287,0.0003336006,0.0003769642],"domain_scores_gemma":[0.9990656,0.00015886418,0.000054485772,0.0005463051,0.00007591751,0.00009887488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353608,0.00012446969,0.00015712893,0.00024967446,0.00007873976,0.00007758868,0.00089347665,0.00006755117,0.00001193961],"category_scores_gemma":[0.00012471479,0.00013003775,0.000048897633,0.0011067401,0.00004772857,0.0007166258,0.00010100204,0.00019675487,0.00008473963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146435295,0.00012375596,0.000501071,0.0000016677235,0.0000022995616,0.00002840426,0.0003456555,0.000023467186,0.0017299713,0.96881324,0.000352379,0.028063469],"study_design_scores_gemma":[0.0011102895,0.00015148353,0.011748679,0.000012648524,8.8896604e-7,0.0000036484423,0.000020121317,0.0025013455,0.0032700503,0.9806819,0.0003423455,0.000156603],"about_ca_topic_score_codex":0.0000103257635,"about_ca_topic_score_gemma":0.000010490534,"teacher_disagreement_score":0.056849666,"about_ca_system_score_codex":0.00012470556,"about_ca_system_score_gemma":0.0000502364,"threshold_uncertainty_score":0.53027856},"labels":[],"label_agreement":null},{"id":"W2403814521","doi":"","title":"Forbidden subgraphs and the hamiltonian index of a 2-connected graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Hamiltonian (control theory); Index (typography); Hamiltonian path; Discrete mathematics; Computer science; Mathematical optimization; World Wide Web","score_opus":0.00857023606629457,"score_gpt":0.24250863033377912,"score_spread":0.23393839426748456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403814521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97304535,0.00036748263,0.021288106,0.00088500435,0.0006078811,0.00044553765,0.0000015272019,0.00013863936,0.00322049],"genre_scores_gemma":[0.99883586,0.000033174478,0.0009217576,0.000111458045,0.0000034661632,0.000026949774,6.024425e-7,0.000011535528,0.000055184395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838585,0.0003710251,0.00023238055,0.00032800288,0.00035890585,0.00032384857],"domain_scores_gemma":[0.9978511,0.0008631994,0.00011687121,0.0009098845,0.00015653801,0.00010241839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011910382,0.00014082144,0.00026066724,0.00020528247,0.00017455452,0.00007185053,0.001165366,0.00006402286,0.0000041488443],"category_scores_gemma":[0.0003143165,0.00009958997,0.00008883016,0.00096550107,0.0005974143,0.00027477366,0.0004038201,0.0002200571,0.0000055022506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047357295,0.000028497658,0.0054069413,0.000010964134,0.000025315454,0.0000013970194,0.0004402121,0.0000034401812,0.00022864931,0.98934937,0.00007233951,0.004385531],"study_design_scores_gemma":[0.0023561034,0.000109329856,0.014204271,0.000014982551,0.000005053589,0.0000071976756,0.000029212073,0.0047520893,0.001040999,0.97704464,0.00031762884,0.00011850467],"about_ca_topic_score_codex":0.000056359953,"about_ca_topic_score_gemma":0.000016747847,"teacher_disagreement_score":0.02579054,"about_ca_system_score_codex":0.0000094758125,"about_ca_system_score_gemma":0.000029869867,"threshold_uncertainty_score":0.4061161},"labels":[],"label_agreement":null},{"id":"W2403821435","doi":"","title":"A Genus Inequality Of The Union Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Inequality; Combinatorics; Mathematical economics; Zoology; Mathematical analysis; Biology","score_opus":0.020134050661004356,"score_gpt":0.28847178304732296,"score_spread":0.2683377323863186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403821435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99042445,0.00014418535,0.0049343486,0.0012795444,0.0008332968,0.00021544527,0.0000015199529,0.000087323795,0.002079864],"genre_scores_gemma":[0.9988846,0.000008751077,0.0008870436,0.00014940627,0.0000018978122,0.0000035346443,3.547925e-7,0.0000038702838,0.00006050841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861044,0.00032891004,0.00019354704,0.00022793152,0.00039816176,0.00024101445],"domain_scores_gemma":[0.9985554,0.0001099153,0.00009801843,0.0010490157,0.00012495737,0.00006269605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007429068,0.00009264303,0.00013373373,0.000077895966,0.000113838636,0.000026630047,0.0014839236,0.000045095094,0.000003579813],"category_scores_gemma":[0.00012564927,0.00006748709,0.000092064794,0.001111846,0.00010060763,0.00024669286,0.00025002466,0.0001840941,0.0000075124763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042738193,0.00007762822,0.002228283,0.0000035448984,0.0000045699962,0.0000018513416,0.00016479394,0.000007897498,0.0014070775,0.9854553,0.00013744195,0.010507363],"study_design_scores_gemma":[0.000289878,0.000101676786,0.04353394,0.000011155998,0.0000015586978,0.0000027969877,0.0000072114944,0.000266222,0.008834877,0.946547,0.00032852602,0.00007516784],"about_ca_topic_score_codex":0.000010976998,"about_ca_topic_score_gemma":0.0000012361595,"teacher_disagreement_score":0.041305657,"about_ca_system_score_codex":0.000026388127,"about_ca_system_score_gemma":0.000049102586,"threshold_uncertainty_score":0.2757524},"labels":[],"label_agreement":null},{"id":"W2403916259","doi":"","title":"Noncrossing matchings with fixed points.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Fixed point; Mathematical analysis","score_opus":0.010903709763263011,"score_gpt":0.2549594325959743,"score_spread":0.2440557228327113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403916259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96391374,0.000056337823,0.028889446,0.0013227322,0.00053832214,0.00035554543,5.518278e-7,0.00034724435,0.0045760563],"genre_scores_gemma":[0.9665182,0.0000022485333,0.032559395,0.00027922794,0.000004511793,0.000045046192,0.000001000969,0.000020948784,0.0005694086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984313,0.00008768406,0.00016263955,0.00040670077,0.000417895,0.0004937629],"domain_scores_gemma":[0.9986286,0.00017060686,0.00007170413,0.00077400357,0.00018087012,0.00017419993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025176653,0.00016120546,0.00016786293,0.00011060196,0.00027216875,0.00046275253,0.0011122139,0.00004955681,0.00005416213],"category_scores_gemma":[0.000051556162,0.00013100059,0.000042021307,0.0006088458,0.0001539547,0.0013962215,0.00035395697,0.00026256772,0.0005692489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077404775,0.00004996511,0.0033661842,0.000008953532,0.000014438831,0.000018989374,0.00043026463,0.0000067695964,0.0019847613,0.98689896,0.0009529197,0.006260052],"study_design_scores_gemma":[0.0007033593,0.00013998146,0.006681438,0.000029996923,0.0000017423932,0.000026261598,0.000042866224,0.0015929617,0.004230599,0.9856264,0.00069466693,0.00022975587],"about_ca_topic_score_codex":0.00005682339,"about_ca_topic_score_gemma":0.0000017411246,"teacher_disagreement_score":0.006030296,"about_ca_system_score_codex":0.000052431493,"about_ca_system_score_gemma":0.00006596105,"threshold_uncertainty_score":0.73167336},"labels":[],"label_agreement":null},{"id":"W2403955642","doi":"","title":"Hamiltonian Properties of the 3-(γ, 2)-Critical Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Pure mathematics; Mathematical optimization","score_opus":0.026700328697763495,"score_gpt":0.27766484826031174,"score_spread":0.2509645195625482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403955642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913796,0.0012423776,0.0008082175,0.0011733342,0.0027964655,0.00023459145,0.0000011332573,0.000099417084,0.0022648305],"genre_scores_gemma":[0.9987232,0.0000072123344,0.0010352974,0.00009305094,0.0000052964483,0.000017987182,7.9379156e-8,0.00000981424,0.00010807829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985353,0.00020652777,0.00017856916,0.00017753783,0.0004383896,0.00046372623],"domain_scores_gemma":[0.99868107,0.00012912128,0.00004355568,0.0008893331,0.00013154828,0.00012538729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005143967,0.00010777381,0.00013768702,0.00007276263,0.00017538601,0.000036217167,0.0013859659,0.000049051818,0.000007031541],"category_scores_gemma":[0.00033559185,0.00007010185,0.0000946543,0.0006474956,0.00042855492,0.00060854974,0.0005804078,0.00021178402,0.00002983885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043033074,0.000112546026,0.007995604,0.000017186836,0.000007945619,5.417065e-7,0.0005013564,7.230607e-7,0.0061110775,0.9843946,0.00014158146,0.0007125404],"study_design_scores_gemma":[0.00021237628,0.000045933306,0.011518268,0.000038209855,0.0000040096006,0.000009577939,0.000036867692,0.00014986358,0.072814554,0.91410416,0.000940453,0.0001257288],"about_ca_topic_score_codex":0.0000074352515,"about_ca_topic_score_gemma":7.201786e-7,"teacher_disagreement_score":0.07029044,"about_ca_system_score_codex":0.000024501593,"about_ca_system_score_gemma":0.00004873855,"threshold_uncertainty_score":0.28586707},"labels":[],"label_agreement":null},{"id":"W2404002013","doi":"10.9734/bjmcs/2015/19380","title":"On the DAG Decomposition","year":2015,"lang":"en","type":"article","venue":"British Journal of Mathematics & Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Decomposition; Mathematics; Computer science; Chemistry","score_opus":0.039834141254032354,"score_gpt":0.318650714686656,"score_spread":0.27881657343262367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404002013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12640843,0.0001114347,0.8716239,0.00068010663,0.00050360704,0.00010832192,5.857128e-7,0.000028324803,0.0005353423],"genre_scores_gemma":[0.5616207,0.000010727903,0.43786618,0.00037247268,0.00010084196,0.0000018691218,5.6201447e-8,0.0000069208704,0.000020227066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971418,0.00014084186,0.00044756485,0.00024558825,0.0016561608,0.0003680376],"domain_scores_gemma":[0.9972906,0.0005400225,0.00037228616,0.0005584294,0.0009296764,0.00030896335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054992465,0.00011464736,0.00020387684,0.0002496164,0.00034244728,0.001031663,0.0039548646,0.000026436326,0.0000055162736],"category_scores_gemma":[0.00056881795,0.00008840082,0.00009177662,0.001116945,0.0004673376,0.0012427769,0.0005813727,0.00037324912,0.00004304988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118803155,0.00052983064,0.00002815985,0.000020943857,0.000025763975,0.00066106784,0.003673535,0.006589418,0.00077339035,0.85207474,0.0051456303,0.13046564],"study_design_scores_gemma":[0.00051082874,0.0005852569,0.00030194886,0.00042222493,0.0000047575018,0.008155235,0.00010861362,0.2898335,0.001899637,0.69776356,0.00020588493,0.00020855507],"about_ca_topic_score_codex":0.0000015811496,"about_ca_topic_score_gemma":7.3628826e-7,"teacher_disagreement_score":0.43521228,"about_ca_system_score_codex":0.00010634567,"about_ca_system_score_gemma":0.00034344784,"threshold_uncertainty_score":0.9948351},"labels":[],"label_agreement":null},{"id":"W2404003086","doi":"","title":"The Hamiltonicity of k-Connected [s, t]-Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02613998589114777,"score_gpt":0.2833053795794481,"score_spread":0.2571653936883004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404003086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97630054,0.0013638478,0.0069323736,0.0011654033,0.0029235468,0.00042425792,0.0000028055094,0.00030044295,0.010586803],"genre_scores_gemma":[0.9983907,0.000027238008,0.0013592001,0.00003853965,0.0000023396324,0.0000145301765,6.580984e-7,0.0000088844145,0.00015793354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984149,0.00023597623,0.00022907207,0.00025535957,0.0005097837,0.00035491693],"domain_scores_gemma":[0.99775165,0.0005077968,0.00010520466,0.0010681638,0.00040142206,0.00016573245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160642,0.00011070007,0.00016041407,0.00008604904,0.00017387024,0.000068865505,0.0017789567,0.000049515726,0.0000018576102],"category_scores_gemma":[0.0005552318,0.00007983798,0.000072516494,0.0009778208,0.00025451632,0.00030589168,0.00046635934,0.00019951919,0.00003110002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017417638,0.00004361045,0.00090505055,0.0000024815395,0.000017071154,0.000004301779,0.00020248088,0.000011151733,0.00031991958,0.99443364,0.0011901694,0.002852707],"study_design_scores_gemma":[0.00059054134,0.0001358867,0.0012654753,0.0000062542513,0.0000019913457,0.000004475422,0.000051170988,0.0014982561,0.0075289593,0.98619413,0.0026262617,0.00009660806],"about_ca_topic_score_codex":0.00002426804,"about_ca_topic_score_gemma":0.0000065943427,"teacher_disagreement_score":0.022090157,"about_ca_system_score_codex":0.000041401894,"about_ca_system_score_gemma":0.00014606815,"threshold_uncertainty_score":0.33057737},"labels":[],"label_agreement":null},{"id":"W2404107916","doi":"","title":"Characterizations and Structure of Sequential Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010124542616694543,"score_gpt":0.2571487610710402,"score_spread":0.24702421845434563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404107916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98029274,0.000027685357,0.018539337,0.00015643613,0.0005352318,0.000095109615,0.0000051104103,0.00005468723,0.00029365253],"genre_scores_gemma":[0.9971525,0.000008270517,0.002760378,0.000038500704,0.000003047135,0.0000020013958,0.0000035821822,0.000006341513,0.000025397037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923253,0.000095114505,0.00012604649,0.0002050305,0.00018076118,0.00016053504],"domain_scores_gemma":[0.99929744,0.000081697086,0.00006343844,0.0003957986,0.000090369285,0.00007124189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012719427,0.00007700099,0.00011954246,0.00011485705,0.000083930936,0.000039940358,0.00043299678,0.000041451625,0.000009725718],"category_scores_gemma":[0.0000638649,0.00007335559,0.00002562582,0.0003815939,0.00011366068,0.00030029152,0.00020452095,0.00009972081,0.0000023777293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024401186,0.000013103173,0.0019310197,0.000008798809,0.0000068254,6.3294414e-7,0.00011483602,0.000002706014,0.04460961,0.9511266,0.000015264504,0.0021681671],"study_design_scores_gemma":[0.00028929845,0.00006556002,0.009444111,0.0000068170293,0.0000022292775,0.0000052726145,0.0000031031116,0.0012899287,0.018617745,0.9699247,0.0002738385,0.00007742941],"about_ca_topic_score_codex":0.0000031750697,"about_ca_topic_score_gemma":9.895274e-7,"teacher_disagreement_score":0.025991866,"about_ca_system_score_codex":0.0000063816033,"about_ca_system_score_gemma":0.000018581568,"threshold_uncertainty_score":0.29913542},"labels":[],"label_agreement":null},{"id":"W2404156276","doi":"","title":"Long Paths containing k-ordered vertices in Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014797750166804078,"score_gpt":0.2744156440679045,"score_spread":0.2596178939011004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404156276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783796,0.00023139772,0.014774962,0.00026775044,0.0010857728,0.0002265866,4.0545035e-7,0.00021077831,0.0048227166],"genre_scores_gemma":[0.99785984,0.000014132379,0.0018700127,0.00015021692,0.0000037284606,0.000028844774,0.0000012218167,0.000014792907,0.000057210837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808747,0.00030799443,0.00025387117,0.00045045643,0.00036905627,0.0005311263],"domain_scores_gemma":[0.998473,0.0005010749,0.00007325535,0.0007262532,0.000091748225,0.00013467677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010116159,0.00015546569,0.00022480635,0.00026732223,0.0001251663,0.00012609648,0.0012008834,0.000069378795,0.000009354799],"category_scores_gemma":[0.00034784607,0.00015703846,0.000057404126,0.0009365253,0.00009254569,0.0006637957,0.0003493785,0.00028611455,0.00005835364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016880753,0.000060681577,0.03490272,0.000008788376,0.0000068510826,0.00002501956,0.0003346361,0.00003135949,0.00020857934,0.9523131,0.000024165693,0.01206717],"study_design_scores_gemma":[0.0011651871,0.00020526956,0.02590019,0.000034698685,0.0000016100336,0.0000043786563,0.000035337944,0.00960937,0.0009067605,0.96148336,0.0004491443,0.00020470194],"about_ca_topic_score_codex":0.000035293997,"about_ca_topic_score_gemma":0.00003474267,"teacher_disagreement_score":0.01948021,"about_ca_system_score_codex":0.00004770178,"about_ca_system_score_gemma":0.00004300472,"threshold_uncertainty_score":0.64038426},"labels":[],"label_agreement":null},{"id":"W2404232981","doi":"","title":"Note on the number of rooted complete N-ary trees.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.020299227730678764,"score_gpt":0.2957994487092154,"score_spread":0.2755002209785366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404232981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9781217,0.0000125355655,0.0022681917,0.0023438102,0.0021099385,0.00029727718,0.000006977144,0.00013834967,0.014701195],"genre_scores_gemma":[0.99721366,0.0000025988556,0.0023094527,0.00024101614,0.000008594719,0.000015953843,0.0000014615664,0.000014489296,0.00019275372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984955,0.00016068199,0.00021018772,0.0003139366,0.00048625006,0.00033341866],"domain_scores_gemma":[0.99736345,0.00089169526,0.000101186706,0.0013745346,0.00014909226,0.00012002531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006069842,0.00014308967,0.00018116481,0.00007169297,0.00016915095,0.00004952768,0.0018305947,0.00007362316,0.000118264856],"category_scores_gemma":[0.0003282235,0.00010255851,0.000090306305,0.0006378435,0.00025201897,0.00021028232,0.00037911604,0.00058719266,0.0002677946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014609509,0.00008554323,0.0009808178,0.0000029347439,0.000010094911,0.000007275386,0.00013761199,0.000005121768,0.011105782,0.984543,0.0006180927,0.002489108],"study_design_scores_gemma":[0.00046017967,0.0000718784,0.007949308,0.000012002593,0.000002257664,0.00000884132,0.0000069847733,0.002657021,0.010029186,0.9753887,0.0032787113,0.0001349244],"about_ca_topic_score_codex":0.000019988478,"about_ca_topic_score_gemma":0.000010763812,"teacher_disagreement_score":0.019091954,"about_ca_system_score_codex":0.000017263153,"about_ca_system_score_gemma":0.00006706686,"threshold_uncertainty_score":0.41822144},"labels":[],"label_agreement":null},{"id":"W2404421201","doi":"","title":"The cordiality of the complement of a graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Complement (music); Mathematics; Graph; Combinatorics","score_opus":0.01919454894763078,"score_gpt":0.28610220613432136,"score_spread":0.2669076571866906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404421201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9664103,0.00018791787,0.02207339,0.0020373177,0.0029286768,0.0006852895,0.0000066349003,0.00006040163,0.0056100967],"genre_scores_gemma":[0.999369,0.000008688538,0.0005196814,0.000042141022,0.0000024644428,0.000011524756,2.1892275e-7,0.0000044854064,0.000041791758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998422,0.00044258757,0.00026371042,0.00016903086,0.00047551654,0.00022715399],"domain_scores_gemma":[0.99760455,0.0007185009,0.00018212666,0.0012675611,0.00018404295,0.000043239095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014511592,0.000078954174,0.0001488515,0.000034161516,0.00021757034,0.00002329746,0.0020346746,0.000021967959,0.0000033529116],"category_scores_gemma":[0.00022036869,0.000044938835,0.000108710585,0.0005820929,0.00038306278,0.00008529146,0.0006493492,0.00012789754,0.0000030309554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007966793,0.00004406104,0.004282047,0.000007826871,0.00001333707,8.960029e-8,0.00013131285,0.000008625649,0.000664037,0.990914,0.00028725207,0.0036394317],"study_design_scores_gemma":[0.00034160315,0.00009545967,0.018066378,0.00001092962,0.0000026070238,6.161647e-7,0.000021425161,0.00073131244,0.009181682,0.9688106,0.0026869061,0.000050460738],"about_ca_topic_score_codex":0.000034624285,"about_ca_topic_score_gemma":0.000011687856,"teacher_disagreement_score":0.032958727,"about_ca_system_score_codex":0.000015533687,"about_ca_system_score_gemma":0.000042034084,"threshold_uncertainty_score":0.37809655},"labels":[],"label_agreement":null},{"id":"W2404426095","doi":"","title":"The Signed Total Domination Number of Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Graph; Vertex (graph theory)","score_opus":0.017725726149767678,"score_gpt":0.2737648429059831,"score_spread":0.2560391167562154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404426095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96258795,0.00011335549,0.009790762,0.00015250653,0.0017446661,0.0003212027,0.0000012569317,0.00012326216,0.025165012],"genre_scores_gemma":[0.99663424,0.000010744299,0.0030307893,0.00001215226,0.0000017815161,0.00002086775,4.1745128e-7,0.000007984748,0.0002809915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988473,0.00014990808,0.00019541735,0.00020907281,0.00033782888,0.00026045673],"domain_scores_gemma":[0.99869406,0.0002938044,0.000100101126,0.00065245375,0.00019552455,0.00006407642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061815465,0.000091923706,0.00010979697,0.00005803983,0.00018342948,0.000034729987,0.0009866687,0.000042986398,0.000024376986],"category_scores_gemma":[0.00011401981,0.00006839902,0.00007189807,0.00058100134,0.00019266707,0.0003797724,0.0002541107,0.00012038203,0.000058441714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020701991,0.00006215225,0.0012074688,0.0000030873202,0.000013143224,0.0000032837322,0.0005194444,3.577233e-7,0.00060386467,0.991317,0.00012478324,0.0061247405],"study_design_scores_gemma":[0.00037002438,0.00007521722,0.0050677336,0.0000052141745,0.0000021735152,0.0000075198236,0.000038684175,0.00030874947,0.014093292,0.9798694,0.00007941742,0.00008253684],"about_ca_topic_score_codex":0.000014576494,"about_ca_topic_score_gemma":0.0000013405044,"teacher_disagreement_score":0.034046296,"about_ca_system_score_codex":0.000019649562,"about_ca_system_score_gemma":0.00003480122,"threshold_uncertainty_score":0.27892312},"labels":[],"label_agreement":null},{"id":"W2404683094","doi":"","title":"Characterisation Of Graphs On Domination Parameters.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0233302204979648,"score_gpt":0.2840831426103755,"score_spread":0.2607529221124107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404683094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99330705,0.00003971938,0.0040059118,0.00013892245,0.0011797968,0.00017522917,0.0000012001244,0.00006413089,0.0010880098],"genre_scores_gemma":[0.9970052,0.000010179432,0.0028583384,0.000054474283,0.0000036120655,0.00002049613,0.0000034243267,0.000007975764,0.000036248635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886554,0.00014417354,0.00018256207,0.00017646913,0.0003533077,0.00027793305],"domain_scores_gemma":[0.9989545,0.00023478665,0.00012618274,0.0004975275,0.000096961376,0.00009004054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006224116,0.0000960097,0.00013084106,0.00021761817,0.000063535335,0.000025112871,0.00046744526,0.000051046125,0.0000075652315],"category_scores_gemma":[0.00012468829,0.00009205712,0.000057714384,0.00050650944,0.000060303588,0.00082024885,0.00009643424,0.00012133607,0.000055950866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016312106,0.00014995379,0.0038465848,0.00000721572,0.000008432903,5.214347e-7,0.00044014593,0.000003051858,0.0036763928,0.9801677,0.00005548971,0.011628228],"study_design_scores_gemma":[0.00046645475,0.00019356576,0.046903726,0.000016305035,0.0000028965896,0.000002233551,0.000018502971,0.00044067702,0.0634947,0.88815457,0.00018070708,0.00012566091],"about_ca_topic_score_codex":0.00000354106,"about_ca_topic_score_gemma":1.17338516e-7,"teacher_disagreement_score":0.0920131,"about_ca_system_score_codex":0.000040293748,"about_ca_system_score_gemma":0.000014416745,"threshold_uncertainty_score":0.37539804},"labels":[],"label_agreement":null},{"id":"W2404723669","doi":"","title":"A Degree Condition for Graphs to Have (g, f)-Factors.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.04731212229158397,"score_gpt":0.3243610738014469,"score_spread":0.2770489515098629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404723669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8968676,0.00013125106,0.0966525,0.00043997366,0.0029006153,0.00097146624,0.000016356322,0.00027755913,0.0017426964],"genre_scores_gemma":[0.99020815,0.0000022627012,0.0092623625,0.00014623102,0.000012366708,0.00014597729,0.000009282986,0.000019240884,0.00019411666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843466,0.00008028135,0.00017499473,0.00032044822,0.000318281,0.00067131926],"domain_scores_gemma":[0.99839073,0.00037640455,0.000057069086,0.0006512704,0.0001632117,0.00036132094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005310429,0.00016000675,0.00017435398,0.00022410057,0.0002103968,0.00008075532,0.00082694634,0.00006905638,0.000012378374],"category_scores_gemma":[0.00022496036,0.00015182878,0.000103114864,0.0004714368,0.000052931064,0.0008553986,0.00024088753,0.00013073128,0.00008825178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012666967,0.00009737449,0.010029447,0.000008186787,0.000013998474,8.9132095e-7,0.0005587951,0.0000028308239,0.00082814845,0.9848795,0.0016307666,0.0019373976],"study_design_scores_gemma":[0.0005408534,0.00021946468,0.011072764,0.000010210365,0.0000045480856,0.0000032463913,0.00007649167,0.0002078796,0.010720112,0.9723211,0.0046003,0.00022302796],"about_ca_topic_score_codex":0.0000069332755,"about_ca_topic_score_gemma":0.0000023811351,"teacher_disagreement_score":0.09334058,"about_ca_system_score_codex":0.0000705382,"about_ca_system_score_gemma":0.0000317594,"threshold_uncertainty_score":0.6191398},"labels":[],"label_agreement":null},{"id":"W2404724826","doi":"","title":"Spanning trees with a bounded number of leaves in a claw-free graph","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spanning tree; Minimum degree spanning tree; Claw; Graph; Bounded function; Trémaux tree; Minimum spanning tree; Discrete mathematics; Degree (music); Line graph; Pathwidth; Physics; Biology","score_opus":0.017776776517319338,"score_gpt":0.2891600823010217,"score_spread":0.27138330578370234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404724826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909459,0.00024026833,0.004082958,0.00014211626,0.0003541838,0.0001871354,0.0000011237823,0.000082048704,0.0039643026],"genre_scores_gemma":[0.98387164,0.000008616537,0.015941521,0.000029859977,0.0000056071635,0.000026533884,5.878246e-7,0.00001669044,0.000098914104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829644,0.00015567442,0.00023175094,0.00027682382,0.00045208604,0.00058719574],"domain_scores_gemma":[0.99846965,0.00023785535,0.000103408165,0.0009582122,0.00009054402,0.00014033233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061175396,0.00015842852,0.00025785982,0.00021692547,0.00007600894,0.00004772883,0.0011962904,0.00006205947,0.00001171885],"category_scores_gemma":[0.00011164581,0.00013751292,0.000056220262,0.0012668675,0.00022021736,0.0009826786,0.00040649532,0.0002507084,0.00001872261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003439597,0.00016845381,0.18548548,0.000011494178,0.0000160165,0.000009189137,0.00105537,0.0000075021917,0.0002826012,0.8122104,0.00007771116,0.00064142485],"study_design_scores_gemma":[0.0014069098,0.00011495546,0.052242238,0.000060783615,0.0000034480252,0.000021623177,0.00012156856,0.00016367943,0.0032753525,0.94224566,0.0001544757,0.00018928519],"about_ca_topic_score_codex":0.000051488627,"about_ca_topic_score_gemma":0.000031049894,"teacher_disagreement_score":0.13324325,"about_ca_system_score_codex":0.000044869095,"about_ca_system_score_gemma":0.000058862715,"threshold_uncertainty_score":0.56076145},"labels":[],"label_agreement":null},{"id":"W2404781106","doi":"","title":"A Sequential Locating Game on Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Mathematical economics","score_opus":0.01985553086630328,"score_gpt":0.28000909311008143,"score_spread":0.26015356224377817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404781106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97467804,0.000086350025,0.012064417,0.0009484804,0.0019144136,0.0005398331,8.145599e-7,0.0004594915,0.009308133],"genre_scores_gemma":[0.9965262,0.0000054121892,0.0027945535,0.00028043787,0.0000068451604,0.00007716605,0.0000011906942,0.000016836344,0.00029135507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982741,0.00014542922,0.00019396597,0.00043884153,0.0004535776,0.00049412425],"domain_scores_gemma":[0.9985401,0.00020004841,0.000069192065,0.00085730833,0.00015987335,0.0001734893],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030821963,0.00015732148,0.00015165503,0.00018957349,0.00014517226,0.00020994476,0.0012154673,0.000060312246,0.00006914846],"category_scores_gemma":[0.00011462728,0.00014812591,0.00007725513,0.00074668886,0.00010430333,0.000654524,0.00034048365,0.00029322575,0.0010734317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033046024,0.000064797,0.00033379218,0.0000053830317,0.000010969455,0.00001024378,0.00016608073,0.000026738995,0.0016669108,0.9873606,0.00074582937,0.009605366],"study_design_scores_gemma":[0.00043244095,0.00017020597,0.001134233,0.000019216046,0.0000012688822,0.0000065230456,0.000017525632,0.0043813013,0.0050632744,0.9882183,0.00037998136,0.0001757488],"about_ca_topic_score_codex":0.0000399556,"about_ca_topic_score_gemma":9.092101e-7,"teacher_disagreement_score":0.021848137,"about_ca_system_score_codex":0.00005540682,"about_ca_system_score_gemma":0.000047908663,"threshold_uncertainty_score":0.99970436},"labels":[],"label_agreement":null},{"id":"W2404905038","doi":"","title":"Boundary powerful k-alliances in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Alliance; Boundary (topology); Combinatorics; Graph; Offensive; Discrete mathematics; Mathematical analysis; Political science; Operations research","score_opus":0.01297498511765379,"score_gpt":0.2712440401254521,"score_spread":0.25826905500779834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404905038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816064,0.00087709574,0.002077392,0.0014081945,0.0017859216,0.00046971967,7.6815724e-7,0.00022976863,0.011544741],"genre_scores_gemma":[0.99467206,0.000052461968,0.0044677365,0.00021450431,0.0000031521754,0.000052425217,0.0000010939968,0.0000135493,0.0005229897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982193,0.0001438783,0.00023954819,0.00044870313,0.00039647144,0.00055210403],"domain_scores_gemma":[0.9987318,0.00018527312,0.00005871634,0.00075849367,0.000117007316,0.00014873478],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003987573,0.00015794656,0.00019000306,0.0002582594,0.000106100466,0.00020536318,0.0013688261,0.00006900842,0.00009981841],"category_scores_gemma":[0.00008659304,0.00015183934,0.00006258611,0.001208129,0.00017424743,0.0013511283,0.00035909034,0.00031523526,0.00083064195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033306756,0.000080396145,0.009823875,0.0000066150797,0.0000060231782,0.000020353022,0.00020800877,0.000006637431,0.0004264147,0.9811879,0.0014062295,0.006824232],"study_design_scores_gemma":[0.0004602689,0.00008536938,0.027341608,0.000018561499,5.3748323e-7,0.000004782326,0.00003427437,0.00089241384,0.0007155214,0.96752495,0.0027399992,0.00018174351],"about_ca_topic_score_codex":0.00007178678,"about_ca_topic_score_gemma":0.000009139624,"teacher_disagreement_score":0.017517734,"about_ca_system_score_codex":0.000059608188,"about_ca_system_score_gemma":0.00007794141,"threshold_uncertainty_score":0.9999473},"labels":[],"label_agreement":null},{"id":"W2404996762","doi":"","title":"Acyclic Total Colorings of Planar Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Planar; Discrete mathematics; Graph; Computer science; Computer graphics (images)","score_opus":0.027790670485247873,"score_gpt":0.2829276525119263,"score_spread":0.25513698202667845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404996762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98554873,0.00020398787,0.0032807975,0.00031195185,0.0011206164,0.0002150735,0.0000027067645,0.00017281764,0.009143341],"genre_scores_gemma":[0.996463,0.000006439193,0.0032315608,0.000035805217,0.0000024744077,0.00001562799,0.0000013504334,0.000011129925,0.00023260135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985195,0.000099091245,0.00021609008,0.00030429786,0.0005130988,0.0003479428],"domain_scores_gemma":[0.9986495,0.00015228611,0.000093460585,0.0006856818,0.00018287609,0.00023623758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005249522,0.00012408786,0.00020753586,0.00018628853,0.000058087437,0.000037942405,0.001071373,0.000059290574,0.0000042310594],"category_scores_gemma":[0.00015774097,0.00012161339,0.00006785364,0.00082439143,0.00014165758,0.0004934885,0.00029576715,0.00017778121,0.00005891023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002205758,0.000077952325,0.0024286627,0.000006647094,0.000015209947,0.000017414706,0.00028969787,0.00001735275,0.0008852486,0.99488306,0.0007343496,0.00062233565],"study_design_scores_gemma":[0.0008201825,0.00029490786,0.001623742,0.000010605286,0.0000024608912,0.000015287584,0.00005010084,0.00028806453,0.006025945,0.9897659,0.0009668488,0.00013596486],"about_ca_topic_score_codex":0.000023082892,"about_ca_topic_score_gemma":9.711697e-7,"teacher_disagreement_score":0.010914303,"about_ca_system_score_codex":0.00004664403,"about_ca_system_score_gemma":0.000096650685,"threshold_uncertainty_score":0.495925},"labels":[],"label_agreement":null},{"id":"W2405356971","doi":"","title":"On the existence and the number of (2-d)-kernels in graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03151041872127789,"score_gpt":0.30050542928615226,"score_spread":0.26899501056487435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405356971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882819,0.00015341015,0.00033877854,0.0016705997,0.00036018356,0.0002569287,5.605742e-7,0.000023726614,0.008913927],"genre_scores_gemma":[0.99925786,0.000019497173,0.00041167618,0.00017871847,0.0000012678071,0.00002712886,1.03354196e-7,0.0000053430495,0.00009842485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998665,0.00037013396,0.00016134679,0.00021274868,0.00038174118,0.00020902495],"domain_scores_gemma":[0.99788696,0.0011892669,0.000065499386,0.00069759856,0.00009684678,0.00006383285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017431373,0.00008925972,0.0001449977,0.00005180931,0.00006334463,0.000045508175,0.0010756588,0.000030935047,0.000004103798],"category_scores_gemma":[0.00047337392,0.000048004542,0.000035348312,0.00065457745,0.00049687555,0.00018194932,0.00033923006,0.00021906628,0.00002224704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042964766,0.000033585606,0.0030327549,0.0000023996283,0.000004898991,0.0000041834305,0.00094705087,0.0000050839385,0.000008286696,0.99521863,0.00015494067,0.00054519955],"study_design_scores_gemma":[0.0011684414,0.00004020862,0.0018748074,0.000017231769,0.0000010262794,0.0000064635205,0.00011193384,0.0009771275,0.00033207017,0.9953385,0.00007354513,0.000058628684],"about_ca_topic_score_codex":0.000042315787,"about_ca_topic_score_gemma":0.0000032747334,"teacher_disagreement_score":0.010975955,"about_ca_system_score_codex":0.000018930945,"about_ca_system_score_gemma":0.000042142918,"threshold_uncertainty_score":0.19988596},"labels":[],"label_agreement":null},{"id":"W2405359541","doi":"","title":"Generating 3-connected quadrangulations on surfaces","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01779331823970243,"score_gpt":0.27962684747481426,"score_spread":0.26183352923511183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405359541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.953939,0.000036588415,0.03957942,0.0005489994,0.0010297289,0.00015521912,9.1823716e-7,0.00033742556,0.0043727034],"genre_scores_gemma":[0.988236,0.0000016907187,0.011336223,0.00017504126,0.000011132964,0.000014904116,0.0000027708477,0.000013081117,0.00020915568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985588,0.00026224944,0.00017031019,0.00035917963,0.00033053564,0.00031889253],"domain_scores_gemma":[0.9983893,0.0006049335,0.000061100756,0.00071814074,0.00012127359,0.000105255174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005224395,0.00012472247,0.00013720068,0.00012648816,0.00031071904,0.00013235472,0.0007415023,0.00004988382,0.00001756107],"category_scores_gemma":[0.00038424256,0.000119390075,0.000047164613,0.0005862568,0.000052012365,0.00032135614,0.00014960977,0.00017708361,0.00015978327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000319041,0.000041219173,0.00051856856,0.000002669978,0.0000067471765,0.000001840802,0.00014907979,0.0025944544,0.003183555,0.9889512,0.00019636117,0.0043511316],"study_design_scores_gemma":[0.00043167968,0.0001393985,0.0021779966,0.000011621602,0.0000014407013,0.0000019424156,0.000010067823,0.17062998,0.0044232337,0.8211713,0.00083535654,0.00016601023],"about_ca_topic_score_codex":0.000009987036,"about_ca_topic_score_gemma":0.0000048100824,"teacher_disagreement_score":0.16803552,"about_ca_system_score_codex":0.00003322176,"about_ca_system_score_gemma":0.000028268789,"threshold_uncertainty_score":0.4868586},"labels":[],"label_agreement":null},{"id":"W2405378676","doi":"","title":"The Diameters of Almost All Bi-Cayley Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Graph","score_opus":0.01693888341381419,"score_gpt":0.26619785381850813,"score_spread":0.24925897040469394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405378676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866884,0.0006413029,0.0036667534,0.0024616693,0.0023408397,0.0007533397,0.000002301856,0.00019507219,0.0032503465],"genre_scores_gemma":[0.9966147,0.00013374214,0.0026901278,0.00014247611,0.0000026012265,0.00006789974,8.90311e-7,0.000015138757,0.00033240736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828076,0.00019524312,0.00026339962,0.00032147756,0.00045923676,0.00047985432],"domain_scores_gemma":[0.9976154,0.0007067477,0.00011757359,0.0011993987,0.00021607395,0.00014482948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005691166,0.00014374628,0.00017031503,0.00011984002,0.00019134035,0.00013829484,0.0018279314,0.00005232198,0.00001739996],"category_scores_gemma":[0.00017729582,0.00010217402,0.00011089782,0.000760061,0.00031354322,0.00054177025,0.00048903667,0.00021137086,0.00015962459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043690893,0.00004678301,0.0020787232,0.00000548781,0.000032170345,0.000002503304,0.000179446,0.000004431328,0.0013744271,0.98520344,0.0031497267,0.007918489],"study_design_scores_gemma":[0.00031868857,0.00011178485,0.00469128,0.000009072211,0.0000027360102,0.0000028550112,0.000023679075,0.0008237698,0.0042899125,0.98680896,0.0027899698,0.00012727187],"about_ca_topic_score_codex":0.00015813689,"about_ca_topic_score_gemma":0.0000053642893,"teacher_disagreement_score":0.009926342,"about_ca_system_score_codex":0.000026380563,"about_ca_system_score_gemma":0.000040293988,"threshold_uncertainty_score":0.41665354},"labels":[],"label_agreement":null},{"id":"W2405439435","doi":"","title":"Stable Well-Covered Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013570825426856514,"score_gpt":0.2684787006737458,"score_spread":0.2549078752468893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405439435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81577754,0.0012674361,0.03662459,0.0040333704,0.0047684372,0.001062282,0.000006512628,0.0017217669,0.13473804],"genre_scores_gemma":[0.99429864,0.00003470984,0.004286651,0.00042877466,0.0000043708114,0.000008641693,0.0000020312268,0.0000105024465,0.0009256805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982024,0.00010806348,0.00019723471,0.00045439467,0.0004712694,0.0005666288],"domain_scores_gemma":[0.9984939,0.00011696877,0.00006291362,0.0010244151,0.000118956035,0.00018280772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041218108,0.00016557462,0.00018920856,0.00018826094,0.0001982023,0.00015714101,0.0014467062,0.00006774555,0.000042721807],"category_scores_gemma":[0.0000637575,0.00016414975,0.00008787613,0.0010967614,0.000061645456,0.0008255609,0.00019307068,0.0002494182,0.00030345903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001159847,0.000105046594,0.00033306246,0.0000025999095,0.00000828205,0.00002594601,0.000082266364,0.0000161532,0.0012697246,0.9904182,0.0028748834,0.004852238],"study_design_scores_gemma":[0.0006091445,0.00020692991,0.0023537183,0.000008931309,0.0000018863923,0.000007729898,0.000009033641,0.00079619203,0.0064625097,0.9840047,0.005341914,0.00019736197],"about_ca_topic_score_codex":0.000007002447,"about_ca_topic_score_gemma":6.9452847e-7,"teacher_disagreement_score":0.17852108,"about_ca_system_score_codex":0.000054018266,"about_ca_system_score_gemma":0.00006113129,"threshold_uncertainty_score":0.6693833},"labels":[],"label_agreement":null},{"id":"W2405502509","doi":"","title":"θ-graphs of partial cubes and strong edge colorings.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.017846575939835834,"score_gpt":0.28261183447950045,"score_spread":0.2647652585396646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405502509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938173,0.00031732637,0.0022363572,0.0002646357,0.0004062052,0.00016387244,0.0000012437109,0.00009282246,0.002700211],"genre_scores_gemma":[0.9979023,0.000032205553,0.0019667551,0.000031899708,0.0000031916425,0.0000058224537,4.898454e-7,0.0000050651915,0.000052316307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998879,0.00007160559,0.00018224955,0.00029024636,0.00026892082,0.00030793928],"domain_scores_gemma":[0.9991842,0.000107552885,0.000065210974,0.00043548417,0.00008893655,0.00011862552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030296794,0.000110784866,0.00018200523,0.00012333461,0.000096041396,0.00004896401,0.0005841207,0.00004772399,0.0000044066633],"category_scores_gemma":[0.00006116358,0.000108117456,0.000045148976,0.0004609139,0.00013661994,0.00042044066,0.00017592596,0.00014692676,0.0000057298143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014472317,0.000069301626,0.002101817,0.0000055069686,0.000008040551,0.000006505903,0.0001636111,0.000007184686,0.001557872,0.9892227,0.00008160955,0.0067613604],"study_design_scores_gemma":[0.0005710606,0.0004174701,0.009393839,0.000014701278,0.0000032085104,0.000004373576,0.000025122252,0.001347034,0.017340316,0.970368,0.0003919846,0.00012288068],"about_ca_topic_score_codex":0.0000045877878,"about_ca_topic_score_gemma":4.7126326e-7,"teacher_disagreement_score":0.01885471,"about_ca_system_score_codex":0.000015698988,"about_ca_system_score_gemma":0.000033681867,"threshold_uncertainty_score":0.4408902},"labels":[],"label_agreement":null},{"id":"W2405545741","doi":"","title":"Maximum Detour Index of Unicyclic Graphs with Given Maximum Degree.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Degree (music); Combinatorics; Statistics; Computer science; Physics; World Wide Web","score_opus":0.03357057070404769,"score_gpt":0.25792935872662576,"score_spread":0.22435878802257808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405545741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9213066,0.00028620544,0.055678044,0.00016789071,0.00096551434,0.0006534892,0.000005681646,0.00034939573,0.02058715],"genre_scores_gemma":[0.9872902,0.000021401886,0.0124381725,0.00004623484,0.0000027249368,0.000030221237,0.000001272846,0.000031301846,0.0001384606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977405,0.00018706809,0.00031803636,0.0005437016,0.00060648005,0.000604236],"domain_scores_gemma":[0.99775517,0.0001404067,0.0001981361,0.0014007344,0.00027532285,0.00023024886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004619216,0.0002526362,0.00033351558,0.00038043756,0.00013255527,0.000038240178,0.0021471959,0.00011060478,0.00004247444],"category_scores_gemma":[0.00004547371,0.00021799297,0.00010421672,0.0014636179,0.00034255837,0.000640452,0.00054544606,0.00035299742,0.000048571295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008500102,0.00024494933,0.029216602,0.000020741592,0.00006967652,0.00008583052,0.00071173516,0.0000046150917,0.00030671404,0.9507662,0.00012165509,0.018366296],"study_design_scores_gemma":[0.0011341149,0.00053321465,0.022360021,0.00003771367,0.000008449483,0.000026978061,0.00007555008,0.00038093902,0.0068006827,0.9681659,0.00020698889,0.00026945412],"about_ca_topic_score_codex":0.00009360434,"about_ca_topic_score_gemma":0.00002449659,"teacher_disagreement_score":0.06598358,"about_ca_system_score_codex":0.000043849515,"about_ca_system_score_gemma":0.000119470154,"threshold_uncertainty_score":0.8889496},"labels":[],"label_agreement":null},{"id":"W2405578918","doi":"","title":"Dominating cycles in triangle-free graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Independence number; Graph; Dominating set; Connectivity; Discrete mathematics; Vertex (graph theory)","score_opus":0.0340622158210912,"score_gpt":0.2772688516101176,"score_spread":0.2432066357890264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405578918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97508764,0.0003273129,0.0026761892,0.00018995143,0.0012431073,0.0003596418,0.0000016616209,0.00026132984,0.019853191],"genre_scores_gemma":[0.98368645,0.000019411267,0.016086377,0.000053555643,0.0000029647556,0.000042488828,5.6702845e-7,0.000016539752,0.00009167505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981541,0.0002309957,0.0003038513,0.00044365608,0.00035210463,0.00051528163],"domain_scores_gemma":[0.99822736,0.00029022933,0.00009239516,0.0011819229,0.000081481354,0.00012658477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010201723,0.00016159365,0.00023923663,0.00042055224,0.00011022465,0.000057977333,0.0023365133,0.000075624666,0.000026864445],"category_scores_gemma":[0.00044280235,0.00016095607,0.000088180976,0.0012527747,0.000117823496,0.0007179563,0.0007336848,0.00029721606,0.000054739205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020885163,0.0001264542,0.0069245906,0.0000066265684,0.000007456129,0.00007099639,0.0014139311,0.0000010883891,0.00033815307,0.9786516,0.00012906227,0.012309201],"study_design_scores_gemma":[0.0016448728,0.00009937408,0.016561303,0.000030360665,0.0000014980988,0.0000069830376,0.00008958166,0.000490915,0.0039432608,0.9768942,0.000051885243,0.0001857498],"about_ca_topic_score_codex":0.000061373255,"about_ca_topic_score_gemma":0.000020794536,"teacher_disagreement_score":0.019761516,"about_ca_system_score_codex":0.000054261684,"about_ca_system_score_gemma":0.00004891503,"threshold_uncertainty_score":0.6563598},"labels":[],"label_agreement":null},{"id":"W2405614798","doi":"","title":"The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Class (philosophy); Integer (computer science); Discrete mathematics; Graph; Planar graph; Computer science; Artificial intelligence","score_opus":0.011205868209185203,"score_gpt":0.25843431065947703,"score_spread":0.24722844245029182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405614798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96556437,0.00044229397,0.019156119,0.00086008344,0.004015722,0.0007482334,0.0000067918077,0.00009454459,0.009111841],"genre_scores_gemma":[0.99872446,0.000050388702,0.0009840507,0.000023407838,0.00001361382,0.000025243266,5.012419e-7,0.000009928266,0.00016840949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836177,0.00015838604,0.00035234005,0.00027265344,0.00051152025,0.0003433488],"domain_scores_gemma":[0.9977599,0.00059748907,0.00018655384,0.00094899785,0.0004159156,0.00009113741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046797667,0.00013238183,0.00023633179,0.00008978101,0.00013090658,0.000040146308,0.0016848197,0.000057417026,0.00002136617],"category_scores_gemma":[0.00026231323,0.00009540724,0.00011603324,0.0009331466,0.00045022045,0.00037907093,0.00037084435,0.00026065085,0.000036298043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019275843,0.00008827708,0.0013541474,0.000011230878,0.000019749015,0.0000015010783,0.00020131777,0.000006092294,0.00080578506,0.9922429,0.0012029556,0.004046799],"study_design_scores_gemma":[0.00037435966,0.00013393904,0.0039948015,0.000020121486,0.000002527272,9.915957e-7,0.00004309545,0.0035670537,0.007217949,0.9825928,0.0019477704,0.00010454304],"about_ca_topic_score_codex":0.00003739011,"about_ca_topic_score_gemma":0.000008238135,"teacher_disagreement_score":0.033160087,"about_ca_system_score_codex":0.000036152673,"about_ca_system_score_gemma":0.00006735271,"threshold_uncertainty_score":0.38905942},"labels":[],"label_agreement":null},{"id":"W2405659013","doi":"","title":"Independent sets in trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.015495804366295458,"score_gpt":0.2755330185237369,"score_spread":0.26003721415744147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405659013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898626,0.00011861877,0.0015109298,0.0007881794,0.000869851,0.00038793258,4.4988755e-7,0.00014729144,0.006314148],"genre_scores_gemma":[0.99770224,0.000009065296,0.0017738742,0.00011599912,0.000002045359,0.000075184245,7.983305e-7,0.000010251865,0.00031055778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985126,0.00012372684,0.00019024218,0.00035857136,0.00038114868,0.0004337059],"domain_scores_gemma":[0.998915,0.00013499359,0.000041379233,0.0006935262,0.000080399775,0.00013467582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003447312,0.00011917317,0.00014465231,0.00021630968,0.00005902868,0.00012028852,0.0011854656,0.000064900596,0.00007737191],"category_scores_gemma":[0.00007000401,0.000114628805,0.000039950788,0.0007082434,0.000052999287,0.0008313012,0.00043561475,0.00027544113,0.0007145202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002217553,0.000092165224,0.010223148,0.0000030201172,0.000004510036,0.000026585602,0.00023323738,0.000018799707,0.00050878926,0.9751139,0.0006915641,0.013082019],"study_design_scores_gemma":[0.0006017101,0.00005523771,0.05866953,0.00000919478,3.9165386e-7,0.000005240414,0.000023225653,0.0030269872,0.0008981025,0.9362821,0.00029375337,0.00013452457],"about_ca_topic_score_codex":0.00009446211,"about_ca_topic_score_gemma":0.000022441933,"teacher_disagreement_score":0.04844638,"about_ca_system_score_codex":0.00008429383,"about_ca_system_score_gemma":0.0000487298,"threshold_uncertainty_score":0.918395},"labels":[],"label_agreement":null},{"id":"W2405693563","doi":"","title":"Graphs with complete minimal k-vertex separators.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Vertex (graph theory); Maximal independent set; Separator (oil production); Clique-sum; Discrete mathematics; Indifference graph; Split graph; Graph; 1-planar graph; Physics","score_opus":0.021869780911674106,"score_gpt":0.27722341290001556,"score_spread":0.25535363198834143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405693563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97884786,0.00067313283,0.007853006,0.00028346106,0.0018936644,0.0004057317,0.0000058536502,0.00043554173,0.0096017765],"genre_scores_gemma":[0.99175245,0.00000935391,0.007824666,0.0001673798,0.000007886133,0.00003512344,0.0000030176518,0.000024584062,0.00017554668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977775,0.0001690667,0.00020158532,0.000397929,0.00057775725,0.0008761545],"domain_scores_gemma":[0.9982172,0.00022999826,0.00008528028,0.00095161225,0.00013589134,0.00037997193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048898143,0.00023019263,0.00024778245,0.0001879066,0.0002406549,0.000104201674,0.0012358197,0.00006631426,0.000031576186],"category_scores_gemma":[0.00003905922,0.00019402053,0.0000757019,0.001066488,0.00020168736,0.0012128508,0.00035928315,0.00027897416,0.00032272466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027959592,0.00014181674,0.014472147,0.0000071529644,0.000030474845,0.000014079685,0.00034041776,0.0000024997555,0.0006872922,0.98187584,0.0012885056,0.001111818],"study_design_scores_gemma":[0.0015080945,0.000475122,0.01986148,0.000031329197,0.000011085739,0.000075623946,0.000057879708,0.00087956386,0.0033524416,0.9628829,0.01030145,0.0005630295],"about_ca_topic_score_codex":0.000008276852,"about_ca_topic_score_gemma":0.0000017763414,"teacher_disagreement_score":0.018992936,"about_ca_system_score_codex":0.00005273255,"about_ca_system_score_gemma":0.000060084767,"threshold_uncertainty_score":0.79119277},"labels":[],"label_agreement":null},{"id":"W2405879761","doi":"","title":"A note on the graphs with given small matching number.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Statistics","score_opus":0.029044962929171775,"score_gpt":0.2824514324751962,"score_spread":0.2534064695460244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405879761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9457219,0.00004488314,0.022030925,0.005243385,0.0012058076,0.00053968607,0.0000019981376,0.00036450787,0.024846887],"genre_scores_gemma":[0.99356556,0.0000030384924,0.0057033724,0.0003916569,0.0000057786756,0.00003856159,7.2539643e-7,0.000020304968,0.00027098684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826914,0.0002451666,0.0001329645,0.00037639283,0.0005603894,0.00041594604],"domain_scores_gemma":[0.99808246,0.00047890338,0.00007164513,0.0010115387,0.00016089469,0.000194546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008692467,0.00016872115,0.00014982506,0.000072585586,0.00021256367,0.00016650427,0.0015853278,0.000047670605,0.0000072916205],"category_scores_gemma":[0.000107145985,0.000106725136,0.00005126027,0.00075739325,0.00013109056,0.00028557147,0.0003425471,0.00039699016,0.00028966917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003912166,0.000059497917,0.000680908,0.000002844149,0.000014105829,0.000038021146,0.0011122723,0.00006879864,0.000045521832,0.9960848,0.0006446003,0.0012095274],"study_design_scores_gemma":[0.0006234363,0.00023087129,0.0004684623,0.000029247687,0.000002615086,0.000021245009,0.000095221,0.000615962,0.00062288373,0.99570566,0.001421176,0.00016319136],"about_ca_topic_score_codex":0.000037613136,"about_ca_topic_score_gemma":0.000011401436,"teacher_disagreement_score":0.047843657,"about_ca_system_score_codex":0.00006483278,"about_ca_system_score_gemma":0.000105500556,"threshold_uncertainty_score":0.43521246},"labels":[],"label_agreement":null},{"id":"W2406017774","doi":"","title":"Domination In The Cross Product Of Digraphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cross product; Product (mathematics); Combinatorics; Geometry","score_opus":0.012294303277651677,"score_gpt":0.3021413337009847,"score_spread":0.28984703042333304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406017774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960242,0.000041364096,0.00047334438,0.00046525203,0.0009556485,0.00024790483,6.592531e-7,0.000028759529,0.0017628605],"genre_scores_gemma":[0.99863166,0.000003857762,0.0012511907,0.000029259698,0.000005096053,0.00002772321,7.348505e-7,0.0000048645907,0.000045637727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988625,0.0001305802,0.0001798873,0.0002455381,0.00036536256,0.00021615018],"domain_scores_gemma":[0.9986405,0.00026570316,0.00007140789,0.0008533106,0.0001398993,0.000029194063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014058747,0.0000771664,0.00010076834,0.000150259,0.00007549632,0.00007177541,0.0014950787,0.000035929945,0.0000046930336],"category_scores_gemma":[0.0003191611,0.000056404988,0.000041731702,0.0010086825,0.00019128296,0.0004565067,0.00015245799,0.00033210177,0.000009468533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067227907,0.00010108586,0.012293915,0.0000066647435,0.0000022339061,0.00000394688,0.00072603044,0.0000041787134,0.006647976,0.975454,0.00005739294,0.004695881],"study_design_scores_gemma":[0.000394788,0.00004515861,0.07394317,0.000004465027,6.620889e-7,0.0000054767215,0.000017892378,0.00029726562,0.018870728,0.90597737,0.00037536558,0.00006767546],"about_ca_topic_score_codex":0.000014937642,"about_ca_topic_score_gemma":0.0000173111,"teacher_disagreement_score":0.06947662,"about_ca_system_score_codex":0.000008555941,"about_ca_system_score_gemma":0.000038065413,"threshold_uncertainty_score":0.2778253},"labels":[],"label_agreement":null},{"id":"W2406020986","doi":"","title":"The Vertices of Lower Degree in Contraction-Critical k-Connected Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Contraction (grammar); Combinatorics; Degree (music); Physics; Internal medicine; Medicine","score_opus":0.03778802458224832,"score_gpt":0.29298102535967374,"score_spread":0.2551930007774254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406020986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841904,0.0005304974,0.002182749,0.00043355467,0.0026645772,0.0002842146,0.0000013141637,0.00010280213,0.009609915],"genre_scores_gemma":[0.9989786,0.000030999756,0.0009052944,0.000029446206,0.000001805828,0.000022316384,1.8723955e-7,0.000007823153,0.000023513556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985904,0.00021005645,0.00026927819,0.00025419425,0.0003043255,0.00037174055],"domain_scores_gemma":[0.9975952,0.0013997767,0.00005930135,0.00065033213,0.00020906604,0.00008632239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006430516,0.00010405136,0.00015549548,0.00012458455,0.00013679895,0.00004098581,0.0010716527,0.000058936046,0.000018327459],"category_scores_gemma":[0.0008111597,0.00007931913,0.000063141226,0.00072116766,0.00033598457,0.00049511454,0.00017982494,0.00025147086,0.00002294561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007792067,0.00016060814,0.0030427768,0.0000049648165,0.000012538347,0.000026525511,0.00024702417,4.281537e-7,0.0006090852,0.9919372,0.00004101916,0.0038398937],"study_design_scores_gemma":[0.0004824179,0.00018524608,0.03363223,0.000016484408,0.0000029210303,0.0000056303106,0.000056824174,0.00048544566,0.005963055,0.95894265,0.00013030294,0.00009679614],"about_ca_topic_score_codex":0.00005838255,"about_ca_topic_score_gemma":0.00004254895,"teacher_disagreement_score":0.03299457,"about_ca_system_score_codex":0.0000247108,"about_ca_system_score_gemma":0.00005218896,"threshold_uncertainty_score":0.32345402},"labels":[],"label_agreement":null},{"id":"W2406179673","doi":"","title":"Note On odd path extendable graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Combinatorics; Computer science; Programming language","score_opus":0.014090335045029358,"score_gpt":0.2849480019081853,"score_spread":0.27085766686315593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406179673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7661054,0.0012659435,0.07788561,0.010260308,0.01021008,0.0018867959,0.000014239211,0.0030583157,0.12931328],"genre_scores_gemma":[0.9935054,0.000032003445,0.0051768003,0.0007673583,0.000006806017,0.000011038618,0.0000016667337,0.000012874232,0.0004860362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980032,0.00012459673,0.00019560731,0.00053931284,0.00055468356,0.0005826171],"domain_scores_gemma":[0.99829376,0.00017941228,0.00006566192,0.0011499407,0.00011031935,0.00020093593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046279418,0.00019308046,0.00019790734,0.00021907785,0.00023121596,0.00012865123,0.0013952726,0.00007668066,0.000018400242],"category_scores_gemma":[0.000106275795,0.00017939432,0.00010072802,0.00097154314,0.00006734151,0.00051729864,0.00015617974,0.00034299903,0.00029618578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017754399,0.0001640381,0.00008769119,0.0000023675427,0.0000044191333,0.00005221716,0.00011067103,0.000022145676,0.00082313083,0.97038656,0.0014501549,0.026878841],"study_design_scores_gemma":[0.00058101706,0.00056229293,0.0028603608,0.000021139173,0.0000016543868,0.000007408555,0.0000045923666,0.0013211921,0.004275487,0.9869961,0.003154497,0.00021424207],"about_ca_topic_score_codex":0.000004199037,"about_ca_topic_score_gemma":4.554759e-7,"teacher_disagreement_score":0.22739999,"about_ca_system_score_codex":0.00006334317,"about_ca_system_score_gemma":0.00005579354,"threshold_uncertainty_score":0.7315488},"labels":[],"label_agreement":null},{"id":"W2406194317","doi":"","title":"Edge colorings of planar graphs with maximum degree five.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Graph; Artificial intelligence; Computer science; Physics; Computer graphics (images)","score_opus":0.03775239169665943,"score_gpt":0.25280587512344765,"score_spread":0.21505348342678823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406194317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9466263,0.00016586584,0.00850801,0.00009049021,0.00064749276,0.0004273884,0.0000051363445,0.00023617897,0.04329316],"genre_scores_gemma":[0.98266685,0.0000135655755,0.016991384,0.000035027995,0.000001417185,0.000027706441,0.0000010400014,0.000017600327,0.00024542017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848807,0.000084528154,0.00020915276,0.00039190485,0.0004057587,0.000420615],"domain_scores_gemma":[0.9985367,0.0001313352,0.00012358825,0.0008605435,0.0001934089,0.00015438837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032874517,0.00016839607,0.00023795567,0.00022082112,0.00010443316,0.000023580316,0.0014557317,0.00006433289,0.000024493265],"category_scores_gemma":[0.000036857495,0.00014370638,0.00006168769,0.00087433564,0.00025793802,0.00048026047,0.00023601556,0.00021435015,0.000038283575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008297082,0.00012901194,0.00691429,0.000017034197,0.000033830882,0.000051613948,0.00071896304,7.470197e-7,0.0002815181,0.9901655,0.00019130712,0.0014132129],"study_design_scores_gemma":[0.0008126336,0.0006903906,0.012115761,0.000029099645,0.000005932006,0.000016406218,0.00006438295,0.000047620826,0.010739818,0.97495824,0.00033196868,0.00018772416],"about_ca_topic_score_codex":0.000065590815,"about_ca_topic_score_gemma":0.000010158499,"teacher_disagreement_score":0.04304774,"about_ca_system_score_codex":0.000027879121,"about_ca_system_score_gemma":0.00007461232,"threshold_uncertainty_score":0.5860176},"labels":[],"label_agreement":null},{"id":"W2406306592","doi":"","title":"Defensive alliances in regular graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013542901488435264,"score_gpt":0.2653162974456306,"score_spread":0.25177339595719533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406306592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9698524,0.000567626,0.016501483,0.0012824483,0.0020186848,0.0003949342,8.448225e-7,0.00030940634,0.009072209],"genre_scores_gemma":[0.99439424,0.00003235477,0.005180995,0.0002097086,0.000003939109,0.000025674006,9.392918e-7,0.000011903417,0.00014021795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828386,0.00025141734,0.00019951067,0.0004519833,0.00036454428,0.00044868593],"domain_scores_gemma":[0.9985923,0.0002860372,0.0000623872,0.0008248248,0.00011795684,0.00011649887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007063431,0.00014028518,0.00019902688,0.00021340665,0.00009330426,0.00007442784,0.0012282601,0.00006524467,0.0000062419113],"category_scores_gemma":[0.00022551932,0.00013807967,0.00006227902,0.0010046891,0.00012735926,0.0004821481,0.00028212083,0.00023226203,0.00010101321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060340153,0.00004002277,0.0042039608,0.000006042612,0.0000051947613,0.000015774063,0.00015454077,0.000039382026,0.00034195185,0.9895773,0.00029520117,0.0053145858],"study_design_scores_gemma":[0.00055859215,0.00009754976,0.0046645394,0.000022208334,9.64123e-7,0.00000409968,0.000020207712,0.0026046005,0.00263989,0.9864376,0.0027833066,0.00016643912],"about_ca_topic_score_codex":0.000013862798,"about_ca_topic_score_gemma":0.00001092362,"teacher_disagreement_score":0.024541905,"about_ca_system_score_codex":0.00003917441,"about_ca_system_score_gemma":0.000032310996,"threshold_uncertainty_score":0.56307256},"labels":[],"label_agreement":null},{"id":"W2406639167","doi":"","title":"Vulnerability Of Mycielski Graphs Via Residual Closeness.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Closeness; Mathematics; Residual; Statistics; Combinatorics; Algorithm","score_opus":0.03400394482779249,"score_gpt":0.3046801913416691,"score_spread":0.2706762465138766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406639167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97865695,0.00031174664,0.013657351,0.00042252897,0.0018430932,0.00031368117,0.0000040969544,0.00021684656,0.00457369],"genre_scores_gemma":[0.9945125,0.0000061875153,0.00528626,0.000045524346,0.0000061027445,0.000018682007,0.0000021944534,0.000014035835,0.00010853025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975391,0.00041003997,0.00035564232,0.000489661,0.0007772603,0.0004283075],"domain_scores_gemma":[0.99742264,0.0003304091,0.00012987034,0.0013487403,0.00048918073,0.00027919238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017404632,0.00017187824,0.00029404435,0.00019531969,0.00009687131,0.000046370824,0.0015460808,0.000094977404,0.000008289967],"category_scores_gemma":[0.0004252096,0.00016364404,0.00009082147,0.0011484975,0.0002850549,0.0005981462,0.00058624614,0.0002834642,0.000042597898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035367935,0.00018076689,0.0058266306,0.000015124605,0.000016550786,0.00001384586,0.00036659822,0.000037616494,0.001105648,0.98798436,0.00070588675,0.0037116092],"study_design_scores_gemma":[0.0008332407,0.0002707487,0.0027589053,0.000009276143,0.0000033398562,0.000008715563,0.000034242024,0.00063792657,0.019572195,0.97528857,0.000410783,0.00017203885],"about_ca_topic_score_codex":0.000045643385,"about_ca_topic_score_gemma":0.0000043999153,"teacher_disagreement_score":0.018466547,"about_ca_system_score_codex":0.00006617112,"about_ca_system_score_gemma":0.00018991056,"threshold_uncertainty_score":0.667321},"labels":[],"label_agreement":null},{"id":"W2406692538","doi":"","title":"One of Ferran Hurtado's favorite topics - Flips.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Point (geometry); World Wide Web; Information retrieval; Mathematics; Geometry","score_opus":0.10719563354728603,"score_gpt":0.3121231820828642,"score_spread":0.20492754853557818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406692538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06646449,0.00025231298,0.8456053,0.010755787,0.0010968474,0.0005626773,0.00013864435,0.00016937582,0.07495454],"genre_scores_gemma":[0.9633907,0.000003989866,0.035274453,0.00061053,0.00007703985,0.000007444983,0.000029736357,0.000010265232,0.0005958527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981448,0.0000992228,0.00026828932,0.00038574202,0.000670493,0.00043144895],"domain_scores_gemma":[0.99770236,0.00016321904,0.00008775022,0.00046164912,0.000763344,0.0008216553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039419287,0.00014614758,0.00022625372,0.00084944564,0.00010175141,0.00010577411,0.0010309896,0.00008451925,0.00012569928],"category_scores_gemma":[0.00023623025,0.00017015827,0.000056541434,0.0011465304,0.00015014719,0.0002981481,0.00010152251,0.00025242523,0.00013282167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009174875,0.000038352497,0.00069222425,0.000011321321,0.000021172465,0.000016738939,0.00022812467,0.006808224,0.000016830436,0.94517255,0.0005491551,0.04643614],"study_design_scores_gemma":[0.0009351435,0.00041732672,0.013668176,0.000081195576,0.0000057719235,0.000015819971,0.0001782091,0.10878829,0.00032774624,0.8674507,0.007647311,0.00048428506],"about_ca_topic_score_codex":0.0025388517,"about_ca_topic_score_gemma":0.002936722,"teacher_disagreement_score":0.89692616,"about_ca_system_score_codex":0.00020987954,"about_ca_system_score_gemma":0.0020553456,"threshold_uncertainty_score":0.69388527},"labels":[],"label_agreement":null},{"id":"W2406837711","doi":"","title":"Number of disjoint 5-cycles in graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics","score_opus":0.012320935471179507,"score_gpt":0.293827753271477,"score_spread":0.28150681780029746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406837711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99400926,0.00001927739,0.0005021528,0.00017932394,0.0010069526,0.000118788674,0.0000010330386,0.000057114255,0.00410613],"genre_scores_gemma":[0.993356,0.000007763097,0.0065319445,0.00002267007,0.0000020769562,0.000014646353,6.191691e-7,0.000009418858,0.00005489082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988122,0.000074766576,0.00022881204,0.00028185852,0.00030112008,0.00030123047],"domain_scores_gemma":[0.9988231,0.00018543756,0.00006741092,0.0007505133,0.00008351982,0.0000899864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004832701,0.00010445737,0.00017509646,0.00015748583,0.00004221987,0.000029826295,0.0010198748,0.00006623426,0.000037810307],"category_scores_gemma":[0.00013007446,0.00009967092,0.00006345152,0.0008035507,0.00016452525,0.00037046292,0.00032593397,0.0003690117,0.000052402764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005598061,0.0001104071,0.058695942,0.000007030042,0.0000040751156,0.000010230353,0.00017183759,0.0000016943989,0.0052497606,0.9327429,0.000055266748,0.0029452387],"study_design_scores_gemma":[0.00042276646,0.000025103443,0.03891393,0.000010308066,7.074503e-7,0.00000742964,0.000013004564,0.00032787074,0.01034202,0.9496543,0.00017720606,0.00010536258],"about_ca_topic_score_codex":0.000035210785,"about_ca_topic_score_gemma":0.000029085664,"teacher_disagreement_score":0.01978201,"about_ca_system_score_codex":0.0000129354285,"about_ca_system_score_gemma":0.00004241121,"threshold_uncertainty_score":0.40644622},"labels":[],"label_agreement":null},{"id":"W2406906987","doi":"","title":"Colourfully panconnected subgraphs II.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Order (exchange); Vertex connectivity; Discrete mathematics","score_opus":0.01684305340759623,"score_gpt":0.2724569552815831,"score_spread":0.25561390187398686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406906987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98441154,0.0006202122,0.0039166696,0.0005015966,0.0032468277,0.00029122145,0.0000020009356,0.0005153508,0.0064946073],"genre_scores_gemma":[0.9950834,0.000016271613,0.0041727955,0.00017598564,0.00001469276,0.000038745256,0.0000023951598,0.000019356525,0.00047638017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979838,0.00018736445,0.00021072444,0.0003372821,0.0004311739,0.0008496403],"domain_scores_gemma":[0.99824023,0.0002626185,0.00007905228,0.0009227579,0.00016282477,0.00033250186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071931974,0.00018055977,0.0002035481,0.00019793748,0.00036149262,0.00006911026,0.0012758464,0.00009167279,0.00005298911],"category_scores_gemma":[0.00020028715,0.00017507609,0.000091275746,0.0012446932,0.000111127236,0.0010541062,0.0006489261,0.0002824425,0.00025328618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009839193,0.00018306251,0.008266816,0.0000047501826,0.000018935687,0.000006813053,0.0004563538,0.0000014447817,0.0013264442,0.98595345,0.001753678,0.0020183965],"study_design_scores_gemma":[0.00072924065,0.0002042129,0.011718412,0.000010048071,0.000004614634,0.000019738678,0.00003401989,0.00031978957,0.00700304,0.96915984,0.010498486,0.00029857905],"about_ca_topic_score_codex":0.000008129983,"about_ca_topic_score_gemma":0.00000181389,"teacher_disagreement_score":0.016793648,"about_ca_system_score_codex":0.00006359637,"about_ca_system_score_gemma":0.00005811566,"threshold_uncertainty_score":0.7139396},"labels":[],"label_agreement":null},{"id":"W2406945348","doi":"","title":"Full cycle extendability of triangularly connected almost claw-free graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Structural engineering; Engineering","score_opus":0.011092520383730512,"score_gpt":0.2691681834380562,"score_spread":0.2580756630543257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406945348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909611,0.00008888383,0.0035594758,0.0005006765,0.002313797,0.00043801888,0.000017128816,0.00025846626,0.0018625059],"genre_scores_gemma":[0.9898831,0.0000059672375,0.009933302,0.00004815352,0.000008114512,0.00003181203,0.000004308409,0.000022261213,0.00006294899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973721,0.0002889214,0.0004670132,0.0006568006,0.00064920797,0.00056599575],"domain_scores_gemma":[0.995376,0.00069271954,0.00019627831,0.00297432,0.0004997739,0.00026090303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013283673,0.00023170133,0.00039120566,0.00024227847,0.00018151662,0.00008856791,0.0031338015,0.00017355151,0.00009083748],"category_scores_gemma":[0.0014944187,0.000224874,0.00018665113,0.001415206,0.00049037393,0.00070958864,0.00082974177,0.00067061716,0.00003943903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008688269,0.00026928363,0.0016270598,0.000018039349,0.000025283827,0.000015033164,0.00020283004,0.0000022578383,0.037724994,0.956551,0.00025325615,0.0032240502],"study_design_scores_gemma":[0.0018815384,0.0003614053,0.007737549,0.000009644513,0.0000061658193,0.00001599115,0.000023091754,0.00095861393,0.019053282,0.9692505,0.0004659915,0.00023623569],"about_ca_topic_score_codex":0.000047699283,"about_ca_topic_score_gemma":0.000041859836,"teacher_disagreement_score":0.018671712,"about_ca_system_score_codex":0.000029771252,"about_ca_system_score_gemma":0.00013549664,"threshold_uncertainty_score":0.9170096},"labels":[],"label_agreement":null},{"id":"W2407087625","doi":"","title":"A novel characterization of n-extendable bipartite graphs","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Characterization (materials science); Combinatorics; Graph; Nanotechnology","score_opus":0.015949664627679903,"score_gpt":0.2696472850536127,"score_spread":0.2536976204259328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407087625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90931195,0.000053507894,0.08732513,0.00059155514,0.0007273194,0.00026427206,0.0000057462976,0.00019072971,0.0015297957],"genre_scores_gemma":[0.9950954,0.000018914936,0.0045800754,0.00012048566,0.0000027321973,0.0000073134565,0.000005601494,0.000007051078,0.00016242755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988213,0.000046217792,0.0002254483,0.0002852485,0.00032350371,0.0002982759],"domain_scores_gemma":[0.99895793,0.000048295784,0.000116234296,0.0006144079,0.00017032101,0.000092783506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030895948,0.000111297464,0.00017125321,0.00020885815,0.00008397892,0.00004846122,0.0007565745,0.000048376376,0.000008806736],"category_scores_gemma":[0.000052324485,0.00011010089,0.00006312866,0.0011030862,0.000058758473,0.0006893174,0.00010578596,0.00011843865,0.00002218092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007789494,0.00012964598,0.00025868154,0.0000037934908,0.000004725029,0.0000019052961,0.00008687152,0.000003978165,0.2893327,0.7055673,0.000017395334,0.00458527],"study_design_scores_gemma":[0.0005408828,0.00023092741,0.024266293,0.000020497815,0.0000024365497,0.000006280395,0.0000031949703,0.00211881,0.07098843,0.90119964,0.00048607905,0.00013652997],"about_ca_topic_score_codex":0.0000032902633,"about_ca_topic_score_gemma":2.6031182e-7,"teacher_disagreement_score":0.21834424,"about_ca_system_score_codex":0.000020083246,"about_ca_system_score_gemma":0.000041753887,"threshold_uncertainty_score":0.4489784},"labels":[],"label_agreement":null},{"id":"W2407156328","doi":"","title":"An Extremal Problem Resulting in Many Paths.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical optimization; Applied mathematics; Mathematical economics","score_opus":0.016209006955684398,"score_gpt":0.2811812595192991,"score_spread":0.26497225256361473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407156328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95152134,0.00006203404,0.037089262,0.00039509402,0.0007479438,0.00037416947,8.679023e-7,0.0003473181,0.009461962],"genre_scores_gemma":[0.97818446,0.0000033738686,0.021585405,0.000073734904,0.000009340914,0.00002969228,0.0000015660013,0.000016582631,0.000095824675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978998,0.00038315638,0.00027167218,0.000539114,0.00037283683,0.0005334696],"domain_scores_gemma":[0.99848896,0.00022663269,0.00007624403,0.00096520793,0.00008767986,0.00015527928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015894643,0.00014565128,0.00018004706,0.00020804025,0.00012538384,0.00013180678,0.0013972978,0.00007145103,0.000005724907],"category_scores_gemma":[0.00016823095,0.00014548961,0.000038001595,0.00073140516,0.00006498279,0.0008290878,0.00030852415,0.00031248055,0.00006012727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010429665,0.000108078355,0.005335534,0.000009057251,0.0000021211454,0.000019517125,0.00043715432,0.00007212483,0.0020007358,0.9703971,0.000042532836,0.02156563],"study_design_scores_gemma":[0.0008246669,0.00019184122,0.0066986694,0.000030678344,7.003385e-7,0.000005586618,0.00002746201,0.043461405,0.0013961099,0.9465763,0.0005942099,0.00019238071],"about_ca_topic_score_codex":0.000025050576,"about_ca_topic_score_gemma":0.000011326674,"teacher_disagreement_score":0.04338928,"about_ca_system_score_codex":0.00006047156,"about_ca_system_score_gemma":0.00003957209,"threshold_uncertainty_score":0.5932894},"labels":[],"label_agreement":null},{"id":"W2407321404","doi":"","title":"On edge colorings of 1-planar graphs without chordal 5-cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Outerplanar graph; Planar graph; Planar; Pathwidth; Graph; Computer science; Telecommunications; Line graph","score_opus":0.019376495285452763,"score_gpt":0.28517836554494047,"score_spread":0.2658018702594877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407321404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844216,0.0002006927,0.001564303,0.00012945972,0.001430139,0.00026815888,0.000003367725,0.0001528313,0.01182944],"genre_scores_gemma":[0.99721336,0.000014984334,0.0024422323,0.000085123036,0.000006766444,0.000025997122,0.0000016037069,0.000019327452,0.00019059752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815613,0.00013492336,0.000241408,0.00031713475,0.0005346873,0.0006156983],"domain_scores_gemma":[0.99839026,0.00029962175,0.00012103851,0.00083251327,0.00010590997,0.0002506754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006657008,0.00018097801,0.00026125237,0.00024779263,0.0001242874,0.00003339929,0.001148035,0.000080137725,0.000015617115],"category_scores_gemma":[0.00012007596,0.00017086139,0.0000925411,0.00073872076,0.00017538066,0.00062733004,0.00021247938,0.0002845754,0.00011062155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037329613,0.0002200523,0.020836653,0.000013608229,0.0000211784,0.0000034604882,0.00023853594,0.000002612579,0.0011255536,0.9760144,0.00044387727,0.0010427528],"study_design_scores_gemma":[0.000763524,0.0002888006,0.016417721,0.000027336195,0.000004739895,0.000007031952,0.0000198867,0.00007275149,0.012602026,0.96825784,0.0013311463,0.00020720164],"about_ca_topic_score_codex":0.000013666253,"about_ca_topic_score_gemma":9.356418e-7,"teacher_disagreement_score":0.012791759,"about_ca_system_score_codex":0.000055689667,"about_ca_system_score_gemma":0.000043115266,"threshold_uncertainty_score":0.6967525},"labels":[],"label_agreement":null},{"id":"W2407372527","doi":"","title":"Binding numbers and (a, b, k)-critical graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.029864495822640415,"score_gpt":0.2918640294097059,"score_spread":0.2619995335870655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407372527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9704797,0.00022560653,0.0061956625,0.00025170037,0.0016432174,0.00017470235,0.0000016633156,0.0003017591,0.020725954],"genre_scores_gemma":[0.9870684,0.000020992658,0.012726652,0.000063218715,0.000002029341,0.000012554982,3.7840198e-7,0.000011880711,0.00009386783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987051,0.00009848679,0.00014291627,0.0003811231,0.0002555889,0.00041677963],"domain_scores_gemma":[0.99895984,0.00023373505,0.000026484136,0.00049046683,0.00007341698,0.00021605878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038315504,0.00012328611,0.0001353789,0.00016470478,0.00018833033,0.000076722295,0.000689223,0.00005912376,0.000030354322],"category_scores_gemma":[0.000167546,0.00012226573,0.00004301544,0.00053503615,0.0002724612,0.000652954,0.00038938297,0.00021262765,0.0000837925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006184831,0.00004818534,0.0065152086,0.000007505805,0.000008235498,0.000038563638,0.0005098305,3.3404348e-8,0.0002969818,0.9903497,0.00014801283,0.0020715324],"study_design_scores_gemma":[0.00029168068,0.00009914107,0.0028726924,0.000011797918,0.000002764868,0.0000255854,0.000048095942,0.00014010545,0.0024208734,0.99373937,0.00019290947,0.00015501001],"about_ca_topic_score_codex":0.000018923449,"about_ca_topic_score_gemma":0.0000015325385,"teacher_disagreement_score":0.020632086,"about_ca_system_score_codex":0.000019971623,"about_ca_system_score_gemma":0.000024624802,"threshold_uncertainty_score":0.4985852},"labels":[],"label_agreement":null},{"id":"W2407380772","doi":"","title":"Efficient domination in directed tori and the Vizing's conjecture for directed graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Torus; Combinatorics; Domination analysis; Discrete mathematics; Graph; Geometry","score_opus":0.008464802313407668,"score_gpt":0.26430056715055583,"score_spread":0.25583576483714815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407380772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98357594,0.001030594,0.007399347,0.0037716967,0.0012474153,0.0017122311,0.000003808157,0.0005071641,0.0007518273],"genre_scores_gemma":[0.99701744,0.00002135508,0.0026718366,0.00014774234,0.0000056420417,0.00007675966,0.0000028098852,0.000008835194,0.000047553858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845695,0.00025970393,0.00022380194,0.000406277,0.0002867446,0.00036650512],"domain_scores_gemma":[0.99832267,0.00091391575,0.00008458358,0.0004490072,0.00015577121,0.000074053365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009890388,0.00015939391,0.0002387235,0.00021395578,0.00021122258,0.00011735313,0.000594346,0.00007801663,0.000001424664],"category_scores_gemma":[0.0004715809,0.000116047624,0.000065150736,0.0011135517,0.00014970935,0.00012880922,0.000101803715,0.00021258647,0.0000016917247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013109297,0.000081228005,0.00013360393,0.00000567761,0.00000787716,0.0000038697553,0.00075795496,0.00009067733,0.00051295577,0.98906296,0.00012229665,0.009089804],"study_design_scores_gemma":[0.00433503,0.00014155054,0.007998492,0.00002142062,0.0000046965965,0.000004905581,0.000019514307,0.06119418,0.0012378364,0.92463326,0.00025627716,0.00015285569],"about_ca_topic_score_codex":0.000012349984,"about_ca_topic_score_gemma":0.000007214676,"teacher_disagreement_score":0.06442972,"about_ca_system_score_codex":0.00006319415,"about_ca_system_score_gemma":0.00003400856,"threshold_uncertainty_score":0.47322845},"labels":[],"label_agreement":null},{"id":"W2407427864","doi":"","title":"On the signed edge domination numbers of K m, n .","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Arithmetic; Telecommunications; Computer science","score_opus":0.012944301504125903,"score_gpt":0.2590284015321941,"score_spread":0.2460841000280682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407427864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97044814,0.000031144686,0.009003654,0.0022460974,0.0009231949,0.000585945,7.48202e-7,0.00008992228,0.016671179],"genre_scores_gemma":[0.99871206,0.0000024034337,0.00076026784,0.00013330356,0.00000250246,0.000053587024,5.305602e-7,0.000007568498,0.00032778212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988863,0.00017762401,0.00015311438,0.00020518963,0.00036078834,0.0002169839],"domain_scores_gemma":[0.99814445,0.0008554014,0.00008201989,0.0006802035,0.000181588,0.00005632921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045323334,0.00008987729,0.000107078675,0.00008107323,0.00010890187,0.00005739887,0.0010409958,0.000038916176,0.00008674081],"category_scores_gemma":[0.00025597378,0.00006298173,0.00005136831,0.00051795505,0.00011585512,0.0003712375,0.00017801856,0.00013922493,0.0002996495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045625475,0.000057128036,0.00007287531,0.0000034097236,0.000007422768,7.8929475e-7,0.00022349539,0.000007275739,0.0026502903,0.9913701,0.0024723245,0.003130345],"study_design_scores_gemma":[0.00030598926,0.00011521089,0.00089120545,0.000010407236,0.0000010447885,8.024809e-7,0.00003469272,0.0018393872,0.015528267,0.9810962,0.000104207116,0.0000725676],"about_ca_topic_score_codex":0.00002113827,"about_ca_topic_score_gemma":6.42421e-7,"teacher_disagreement_score":0.02826394,"about_ca_system_score_codex":0.00003477718,"about_ca_system_score_gemma":0.000029398067,"threshold_uncertainty_score":0.3851488},"labels":[],"label_agreement":null},{"id":"W2407462674","doi":"","title":"The hypergraph of θ-classes and θ-graphs of partial cubes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Hypergraph; Interval graph; Pathwidth; Indifference graph; Split graph; Discrete mathematics; Vertex (graph theory); Graph; Line graph; 1-planar graph","score_opus":0.010957420666458346,"score_gpt":0.2600561760749702,"score_spread":0.24909875540851187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407462674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99391085,0.0005968264,0.0027099212,0.00030267044,0.00063276617,0.0001425825,0.0000011937354,0.00004164162,0.0016615536],"genre_scores_gemma":[0.99888206,0.0001286544,0.0009234564,0.000015917349,0.0000024556155,0.000008824351,2.230668e-7,0.000006671502,0.000031731386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988087,0.00018821156,0.00022998091,0.0002143895,0.0003179653,0.00024080009],"domain_scores_gemma":[0.9981944,0.0008035495,0.00011519076,0.0006631992,0.00015006698,0.00007357306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000725824,0.0000943914,0.00018013759,0.00009443627,0.00013845401,0.000033909175,0.00082672643,0.000039852443,0.0000015122556],"category_scores_gemma":[0.00023173288,0.000067981324,0.000062314844,0.00052364956,0.0004693987,0.00019273872,0.0002851556,0.00011382076,0.0000021485073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012193741,0.00003633606,0.0049652345,0.000012080405,0.000016058922,4.742152e-7,0.000093957286,0.000004606661,0.0023772551,0.9835172,0.00008943729,0.008875128],"study_design_scores_gemma":[0.00033441378,0.00019789235,0.0036605888,0.000012925198,0.000003822951,0.0000023423686,0.000021925996,0.0021832108,0.027306879,0.96470344,0.0014970301,0.000075555],"about_ca_topic_score_codex":0.000011479361,"about_ca_topic_score_gemma":0.0000024696185,"teacher_disagreement_score":0.024929624,"about_ca_system_score_codex":0.000004765669,"about_ca_system_score_gemma":0.000029223198,"threshold_uncertainty_score":0.27721977},"labels":[],"label_agreement":null},{"id":"W2407485278","doi":"","title":"On traceable and upper traceable numbers of graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02202488961978434,"score_gpt":0.2776144362891288,"score_spread":0.25558954666934447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407485278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9831923,0.00039133293,0.0012539165,0.0003242451,0.0007651374,0.00022156192,0.0000022824115,0.00010528726,0.013743887],"genre_scores_gemma":[0.99579877,0.000021090258,0.003447311,0.00006477154,0.0000019259264,0.0000120808645,7.866835e-7,0.000014128875,0.00063911994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984985,0.000119824275,0.00019519943,0.00036256143,0.0004688269,0.00035507054],"domain_scores_gemma":[0.998658,0.00023877747,0.000074593576,0.0006251655,0.00015348675,0.00024997175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006857132,0.0001418121,0.000221032,0.00017860027,0.00007910453,0.000056472418,0.00065319834,0.00006990646,0.000010377092],"category_scores_gemma":[0.0001533859,0.00013323534,0.0000536446,0.0006489101,0.0001618784,0.0005276223,0.00017284109,0.00020116569,0.000035092435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003356088,0.00012493534,0.0020114675,0.000010506478,0.000013925615,0.000008862977,0.00049581856,0.00004862069,0.00023592639,0.99369234,0.0018372441,0.0014867729],"study_design_scores_gemma":[0.0010922198,0.00036060667,0.0006317408,0.000019633264,0.0000031250781,0.000009446203,0.00008856085,0.001106724,0.0046320087,0.99102217,0.0008865784,0.0001471638],"about_ca_topic_score_codex":0.000029520741,"about_ca_topic_score_gemma":0.0000019089152,"teacher_disagreement_score":0.013104767,"about_ca_system_score_codex":0.0000354871,"about_ca_system_score_gemma":0.000074833486,"threshold_uncertainty_score":0.543318},"labels":[],"label_agreement":null},{"id":"W2407539193","doi":"","title":"Roman domination subdivision number of a graph and its complement.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Complement (music); Combinatorics; Graph; Discrete mathematics; Geography; Biology; Archaeology","score_opus":0.0162250119811454,"score_gpt":0.2957556756950597,"score_spread":0.27953066371391433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407539193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994317,0.00009417422,0.003142163,0.00019822849,0.0002694615,0.0003517918,0.0000014614211,0.00005531178,0.0015704405],"genre_scores_gemma":[0.9973944,0.0000225866,0.0024184464,0.000025057003,0.000001888957,0.000031827953,0.0000024897188,0.000008234907,0.00009507938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987845,0.000119330536,0.0002127094,0.00027835154,0.00035760415,0.00024754787],"domain_scores_gemma":[0.99901813,0.00017591835,0.000096358184,0.0003660961,0.00024191091,0.00010159812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003537253,0.000107833686,0.00015730855,0.00012693013,0.00010424009,0.000066928675,0.0005289494,0.000039455645,0.00009301454],"category_scores_gemma":[0.00005907559,0.000102026715,0.000037405378,0.00048653543,0.00006537346,0.0007713699,0.00037365025,0.000103554514,0.00008574871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035317082,0.000063544074,0.004944184,0.000016359332,0.000009149322,0.0000014490374,0.00018966998,6.408786e-7,0.0029473207,0.98822117,0.00035869336,0.003244281],"study_design_scores_gemma":[0.00073407404,0.00008916586,0.027015168,0.00001872585,0.0000022666593,0.00000600144,0.00002523463,0.004818637,0.0067916946,0.9602481,0.00013653102,0.00011438264],"about_ca_topic_score_codex":0.000028081482,"about_ca_topic_score_gemma":0.0000014511517,"teacher_disagreement_score":0.027973058,"about_ca_system_score_codex":0.000021567454,"about_ca_system_score_gemma":0.000017221166,"threshold_uncertainty_score":0.41605285},"labels":[],"label_agreement":null},{"id":"W2407623588","doi":"","title":"The Global Connected Domination In Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00913539524891057,"score_gpt":0.2703753785844049,"score_spread":0.26123998333549436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407623588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96123374,0.00022297277,0.02114296,0.0024294571,0.0024815272,0.0004331789,0.000001220174,0.0002559264,0.011799039],"genre_scores_gemma":[0.9990873,0.0000141857345,0.000742844,0.00007699921,0.0000027786784,0.000027068192,9.3454776e-7,0.0000050013828,0.00004292085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853045,0.0003439341,0.00017791509,0.00027579413,0.00031961707,0.00035226982],"domain_scores_gemma":[0.9985281,0.0006023126,0.000057626054,0.00062324596,0.00011623781,0.00007243581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787477,0.000098610224,0.00010791726,0.00007281029,0.00020914116,0.0001345869,0.0011804504,0.000048538634,0.0000021035664],"category_scores_gemma":[0.00051174505,0.00007631916,0.000040345545,0.0012057516,0.00011829116,0.0003160683,0.00023633445,0.00015638265,0.0000439675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010166854,0.000029003995,0.0047022793,0.0000016361507,0.0000034992493,0.000002598931,0.000051937233,0.000009980692,0.000049825605,0.9788675,0.000116997115,0.0161546],"study_design_scores_gemma":[0.00071463274,0.00006455715,0.020299694,0.000006562334,6.9610036e-7,0.000003172771,0.000012497701,0.0076335007,0.00033346144,0.96911955,0.0017190465,0.00009263194],"about_ca_topic_score_codex":0.000016768872,"about_ca_topic_score_gemma":0.0000440011,"teacher_disagreement_score":0.03785355,"about_ca_system_score_codex":0.0000925086,"about_ca_system_score_gemma":0.00003351813,"threshold_uncertainty_score":0.31122047},"labels":[],"label_agreement":null},{"id":"W2407706320","doi":"","title":"Signed and minus total domination on subclasses of bipartite graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.024405225870331063,"score_gpt":0.2605811588223199,"score_spread":0.23617593295198885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407706320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949626,0.00008727019,0.0015865205,0.000050723487,0.00045194317,0.0001761676,0.0000015184179,0.00006086178,0.0026224453],"genre_scores_gemma":[0.99742407,0.0000111069385,0.0024213437,0.000019033296,0.0000016020077,0.000014954238,7.994623e-7,0.000008459563,0.00009866157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891865,0.00010883319,0.00017669247,0.0002888548,0.00027903778,0.00022792885],"domain_scores_gemma":[0.9990146,0.0002087592,0.00008851337,0.00043960437,0.00015697963,0.00009154686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032572448,0.0001122685,0.00015503059,0.00022429258,0.00007328917,0.000026966985,0.00040254617,0.00005077798,0.00001105541],"category_scores_gemma":[0.00011979133,0.00010538905,0.000039258626,0.00062362064,0.00015507123,0.0004020107,0.00016299149,0.00009978515,0.000013838082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045953973,0.00012849255,0.0016501767,0.000011492889,0.000012039618,0.000010393073,0.0005819807,9.182492e-7,0.0049649747,0.9888589,0.00006334146,0.0036713704],"study_design_scores_gemma":[0.00065208296,0.00056483573,0.01665875,0.000017224584,0.0000037266254,0.0000065621693,0.000027679818,0.00042915595,0.07941408,0.9020707,0.000029509118,0.00012567606],"about_ca_topic_score_codex":0.000013182277,"about_ca_topic_score_gemma":0.000001691615,"teacher_disagreement_score":0.08678815,"about_ca_system_score_codex":0.000016389205,"about_ca_system_score_gemma":0.000027914528,"threshold_uncertainty_score":0.4297641},"labels":[],"label_agreement":null},{"id":"W2407737784","doi":"","title":"Notes on Endomorphisms of Henson Graphs and their Complements.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Combinatorics","score_opus":0.021565794672974346,"score_gpt":0.28024049619726915,"score_spread":0.2586747015242948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407737784","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99622405,0.000050265757,0.0013549774,0.00033680702,0.00089097704,0.00021204803,0.0000081020735,0.000081408405,0.00084135396],"genre_scores_gemma":[0.99697906,0.000013232068,0.0028823728,0.0000781597,0.0000023047912,0.000012432755,0.0000020729087,0.0000109231005,0.000019418103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884975,0.00008322291,0.000189353,0.00032720965,0.00026025003,0.0002902126],"domain_scores_gemma":[0.9982911,0.0006860765,0.00008980392,0.0007079415,0.00010994414,0.00011516277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042099104,0.0001522257,0.00021358953,0.00017123688,0.00012286603,0.0000423354,0.000755523,0.00005027363,0.000019338719],"category_scores_gemma":[0.0001360363,0.00012089599,0.000056097902,0.00036634243,0.0002377874,0.0002062749,0.00030292466,0.00030133483,0.000011912705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014805475,0.0000925258,0.0029027942,0.0000069235944,0.000014351792,0.0000033002038,0.0002352231,0.0000010804171,0.033652086,0.9565398,0.000060264138,0.006476857],"study_design_scores_gemma":[0.00076607213,0.00026217723,0.0035370353,0.0000104777455,0.0000014156574,0.0000060873945,0.00001758476,0.00044041255,0.08138177,0.9128183,0.0006417047,0.00011695443],"about_ca_topic_score_codex":0.000017474136,"about_ca_topic_score_gemma":0.0000070805595,"teacher_disagreement_score":0.047729682,"about_ca_system_score_codex":0.000007997485,"about_ca_system_score_gemma":0.000022067268,"threshold_uncertainty_score":0.49299952},"labels":[],"label_agreement":null},{"id":"W2407743056","doi":"","title":"On Helly Hypergraphs with Variable Intersection Sizes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Intersection (aeronautics); Cardinality (data modeling); Characterization (materials science); Generalization; Disjoint sets; Discrete mathematics; Computer science","score_opus":0.007428131006928234,"score_gpt":0.23315796827942664,"score_spread":0.2257298372724984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407743056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59041005,0.000035581426,0.34750482,0.00041207776,0.0028869277,0.00040643872,0.0000011533259,0.0006415814,0.05770138],"genre_scores_gemma":[0.99220806,0.00000263535,0.0070372173,0.00025337207,0.000007232333,0.000026001295,0.0000011757322,0.000018517278,0.00044576195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984823,0.00016613661,0.00013581976,0.00045134485,0.0003934256,0.00037099852],"domain_scores_gemma":[0.99850756,0.0003586225,0.00006122114,0.0008150742,0.00012781374,0.00012972555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997807,0.00015898404,0.0001614417,0.00019005824,0.00017747455,0.00011391984,0.0008088407,0.000058334903,0.0000203615],"category_scores_gemma":[0.00012839475,0.00013237334,0.00004123415,0.0008767349,0.000086426764,0.00041445135,0.00015761162,0.00026920176,0.00013002731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048821712,0.00008801911,0.00037515792,0.000006150805,0.000013229562,0.000004354714,0.00008780605,0.00018282184,0.0005651931,0.99612373,0.0003752407,0.002129483],"study_design_scores_gemma":[0.0008317471,0.00093332434,0.00039631224,0.000033934575,0.000003019128,0.000012274976,0.000011496525,0.005071829,0.0028833216,0.9879419,0.0016956708,0.00018517663],"about_ca_topic_score_codex":0.000015198296,"about_ca_topic_score_gemma":0.000002990274,"teacher_disagreement_score":0.40179804,"about_ca_system_score_codex":0.00006061318,"about_ca_system_score_gemma":0.000041954838,"threshold_uncertainty_score":0.53980285},"labels":[],"label_agreement":null},{"id":"W2408004674","doi":"","title":"On trees with double domination number equal to total domination number plus one.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Combinatorics; Graph","score_opus":0.031216537974426327,"score_gpt":0.2883537486928328,"score_spread":0.2571372107184065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408004674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8871276,0.000005606308,0.06406054,0.0002301635,0.0009951968,0.0007214934,0.0000028147065,0.00024286124,0.046613764],"genre_scores_gemma":[0.9871619,0.0000016263721,0.011270875,0.00009941479,0.000013896072,0.00013253157,0.000005336352,0.0000321812,0.0012822698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975978,0.00014408918,0.00026198782,0.0006416411,0.00082115066,0.00053334294],"domain_scores_gemma":[0.9982645,0.00023115615,0.00011454529,0.0008268119,0.00031676996,0.0002462463],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005688945,0.00024898697,0.00025675684,0.00018232397,0.00021899985,0.0001397532,0.00086802087,0.00010380529,0.00021277832],"category_scores_gemma":[0.00007353069,0.00022896414,0.00006506907,0.00097026455,0.000096688935,0.0010175924,0.00028905514,0.00026745745,0.0012967068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006029415,0.00029984757,0.0005724034,0.0000074516774,0.00002721288,0.000024841314,0.0019344176,0.00006631569,0.00028336464,0.9919986,0.00033554455,0.0038470738],"study_design_scores_gemma":[0.004691905,0.000698194,0.0064315917,0.00006222031,0.000010847455,0.000031363492,0.00007786554,0.0011922031,0.01707787,0.969115,0.00014162893,0.0004692949],"about_ca_topic_score_codex":0.00007941119,"about_ca_topic_score_gemma":0.000030516021,"teacher_disagreement_score":0.100034304,"about_ca_system_score_codex":0.00025372178,"about_ca_system_score_gemma":0.00009995617,"threshold_uncertainty_score":0.9994809},"labels":[],"label_agreement":null},{"id":"W2408084491","doi":"","title":"Dominating Sets and Independent Sets in a Tree.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics","score_opus":0.012446516962027863,"score_gpt":0.2880995305409314,"score_spread":0.27565301357890354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408084491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962072,0.0000615113,0.0004346738,0.00032546383,0.0008272532,0.0001938572,6.5447824e-7,0.00007339256,0.0018760046],"genre_scores_gemma":[0.99383026,0.000008262549,0.006000964,0.000052075884,0.0000027670833,0.000025529847,7.014371e-7,0.000011146563,0.00006831675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855894,0.00010949891,0.00019024567,0.0004175681,0.00033576653,0.0003879714],"domain_scores_gemma":[0.9989199,0.00028730943,0.000057943376,0.0005316106,0.00006162522,0.00014158146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086940266,0.0001316943,0.00016178032,0.00021800828,0.00010541521,0.00012035776,0.000735143,0.00009155278,0.000007925347],"category_scores_gemma":[0.0002195328,0.00013088214,0.000027766306,0.0005062207,0.000094431365,0.00051743485,0.0005499722,0.0005870059,0.000018850344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007362848,0.000069820024,0.013578587,0.000008109933,0.0000042972842,0.00006769068,0.00084133993,0.0000023172768,0.0050519817,0.9298467,0.000031500793,0.05049032],"study_design_scores_gemma":[0.0011811433,0.00006678112,0.040388536,0.000019073997,0.0000010326787,0.000034787456,0.000050735573,0.0064302273,0.002365708,0.94916385,0.00012360356,0.00017449028],"about_ca_topic_score_codex":0.000019989535,"about_ca_topic_score_gemma":0.00010606516,"teacher_disagreement_score":0.050315827,"about_ca_system_score_codex":0.000029962779,"about_ca_system_score_gemma":0.000051252562,"threshold_uncertainty_score":0.53372186},"labels":[],"label_agreement":null},{"id":"W2408167455","doi":"","title":"Alternating Subsets and Successions.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.014368515993745282,"score_gpt":0.28083414515952987,"score_spread":0.2664656291657846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408167455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927462,0.00019178953,0.0027071445,0.0007283068,0.00068273436,0.0001815523,3.1559478e-7,0.00014136393,0.0026206274],"genre_scores_gemma":[0.9937309,0.000021269141,0.00581787,0.000109617526,0.0000040272735,0.000032591623,5.1292886e-7,0.000008872395,0.0002743387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989238,0.00008224708,0.00013367596,0.00030117412,0.00025246132,0.00030665818],"domain_scores_gemma":[0.9990718,0.00018036022,0.000047840764,0.00044449873,0.00009950068,0.00015600481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443835,0.00009845513,0.00010632101,0.00009446326,0.00017835254,0.00020702904,0.000741258,0.000035742254,0.00003646471],"category_scores_gemma":[0.00010803132,0.00008722338,0.000022490614,0.0003139341,0.00007259804,0.0009265942,0.0005149849,0.000164374,0.00017350588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.118455e-7,0.000022754528,0.010331567,0.000005046732,0.000005022464,0.000007636548,0.00013637348,0.0000014197489,0.0010742071,0.9710228,0.0005818398,0.016810546],"study_design_scores_gemma":[0.00031287715,0.0000354146,0.014462948,0.000014579329,7.1608196e-7,0.000009867341,0.000018778866,0.005676518,0.0018676181,0.97715765,0.00032318354,0.000119826625],"about_ca_topic_score_codex":0.000047541347,"about_ca_topic_score_gemma":0.0000010402212,"teacher_disagreement_score":0.01669072,"about_ca_system_score_codex":0.000019020403,"about_ca_system_score_gemma":0.000019918094,"threshold_uncertainty_score":0.35568663},"labels":[],"label_agreement":null},{"id":"W2408235952","doi":"","title":"On geodetic and k-geodetic sets in graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Geodesy; Combinatorics; Geography","score_opus":0.009871037274039877,"score_gpt":0.27051668293231473,"score_spread":0.26064564565827486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408235952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963943,0.000060740127,0.00022597895,0.00040512835,0.001074662,0.00019340188,9.3448654e-7,0.000091709066,0.0015531648],"genre_scores_gemma":[0.9981285,0.000015840093,0.0016050972,0.00014291902,0.0000017899935,0.00002475842,7.48673e-7,0.000013431307,0.000066953384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850506,0.00010354431,0.00017247333,0.00046990142,0.00032098553,0.00042802235],"domain_scores_gemma":[0.99857813,0.00039759133,0.00004106988,0.00077090797,0.000052190608,0.00016012357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154433,0.00015317452,0.00016783805,0.0003087651,0.000102553924,0.00009767246,0.00079303316,0.000089651825,0.000015750375],"category_scores_gemma":[0.00019344722,0.00014817127,0.000034618068,0.00067368074,0.00016338997,0.0003049452,0.0002985898,0.00058900856,0.000069148366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098913615,0.00008302204,0.0035776058,0.000006384174,0.0000032710075,0.000036824473,0.00017050016,0.0000065022873,0.001194553,0.9887591,0.00007094009,0.0060814195],"study_design_scores_gemma":[0.0007103462,0.00013889081,0.018308338,0.000015435126,0.0000011089145,0.000013754329,0.0000070418973,0.0027795848,0.0010028647,0.97669834,0.00015997117,0.00016433308],"about_ca_topic_score_codex":0.000017677177,"about_ca_topic_score_gemma":0.000032082276,"teacher_disagreement_score":0.014730732,"about_ca_system_score_codex":0.000018617513,"about_ca_system_score_gemma":0.00003612171,"threshold_uncertainty_score":0.60422486},"labels":[],"label_agreement":null},{"id":"W2408343898","doi":"","title":"Restricted total domination in graphs with minimum degree two.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.016865700453849705,"score_gpt":0.27530552873986064,"score_spread":0.2584398282860109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408343898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99123585,0.00007655047,0.00360083,0.00056203926,0.00032551875,0.00031951448,7.0308687e-7,0.00015390717,0.0037251008],"genre_scores_gemma":[0.9942501,0.0000071878244,0.005519508,0.00006882463,0.000003468196,0.00001872423,0.0000028043544,0.000009379648,0.0001199589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982501,0.00015903071,0.00022128201,0.00044387157,0.0004771799,0.000448494],"domain_scores_gemma":[0.99882805,0.00018344916,0.00007829345,0.0006450528,0.00014497383,0.00012016018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003132722,0.00016495408,0.00018516342,0.00045305755,0.00009846353,0.00009383343,0.0007837447,0.000060298196,0.0000041181147],"category_scores_gemma":[0.0000996096,0.00014890468,0.000040359566,0.0022316852,0.00007365224,0.00073008763,0.00010423998,0.00028099565,0.000020864663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007282758,0.00016714116,0.0019495931,0.0000024306737,0.000005326943,0.000098095625,0.00020949096,0.000056952627,0.0014217823,0.97893935,0.00009296692,0.016984018],"study_design_scores_gemma":[0.0025114124,0.000551957,0.08213682,0.000027027429,0.0000021300903,0.000025753181,0.000021465074,0.0030370222,0.0017523186,0.9096914,0.000031124942,0.00021156915],"about_ca_topic_score_codex":0.000015790385,"about_ca_topic_score_gemma":0.000012435485,"teacher_disagreement_score":0.080187224,"about_ca_system_score_codex":0.0000869302,"about_ca_system_score_gemma":0.0000780442,"threshold_uncertainty_score":0.6072157},"labels":[],"label_agreement":null},{"id":"W2408452789","doi":"10.1080/03155986.2005.11732724","title":"Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem","year":2005,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Block (permutation group theory); Integer programming; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Induced subgraph isomorphism problem; Linear programming; Induced subgraph; Discrete mathematics; Mathematical optimization; Computer science; Line graph; Artificial intelligence","score_opus":0.06202741432814226,"score_gpt":0.3603149411181166,"score_spread":0.2982875267899744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408452789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014205707,0.00044063176,0.9652456,0.00812597,0.00018373075,0.003694293,0.000057782767,0.00011428555,0.007931997],"genre_scores_gemma":[0.986094,0.00006754172,0.010966023,0.00035208635,0.00017934077,0.0014496278,0.00005737051,0.000007757424,0.0008262765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761593,0.000094174524,0.00057217485,0.00016489258,0.0010801312,0.00047267487],"domain_scores_gemma":[0.99706537,0.0009990021,0.000087319386,0.00038972351,0.0013237852,0.00013477806],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029203466,0.00012931076,0.0001380375,0.00041418424,0.0016573295,0.001717712,0.0006564413,0.00006829091,0.000007548929],"category_scores_gemma":[0.0002910734,0.00008255113,0.000058048936,0.0005548469,0.00014338443,0.005387349,0.00027536775,0.0002833947,0.000057833444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015788268,0.0000121867715,0.00019771862,0.00005378092,0.000013224831,6.0491985e-8,0.0017521171,0.004312347,0.00006727562,0.9676752,0.0021673804,0.023732904],"study_design_scores_gemma":[0.000726146,0.00015079767,0.0015096725,0.00005540666,0.0000019433699,0.000027009275,0.0006729536,0.5474412,0.00030870558,0.013308678,0.4356023,0.00019520168],"about_ca_topic_score_codex":0.00003465809,"about_ca_topic_score_gemma":0.000028916873,"teacher_disagreement_score":0.97188824,"about_ca_system_score_codex":0.00010221413,"about_ca_system_score_gemma":0.00018931275,"threshold_uncertainty_score":0.9996424},"labels":[],"label_agreement":null},{"id":"W2408485812","doi":"","title":"Upper Domination Number and Domination Number in a Tree.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Domination analysis; Tree (set theory); Combinatorics; Graph","score_opus":0.008080176089906686,"score_gpt":0.28300423481012643,"score_spread":0.27492405872021974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408485812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98554295,0.000012463538,0.0019361129,0.00064312504,0.0010913156,0.000259675,7.0528785e-7,0.00007892468,0.010434698],"genre_scores_gemma":[0.99245703,0.000011002062,0.006829184,0.00005730587,0.000009430047,0.000050729763,0.0000025877528,0.000014448403,0.0005682885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853903,0.0001350489,0.00021713118,0.00042492023,0.00035026227,0.00033362198],"domain_scores_gemma":[0.9988959,0.00029352662,0.00006990246,0.00049289357,0.00013749294,0.00011031669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081592065,0.00014518168,0.00016367805,0.00014717333,0.00010816181,0.00013599994,0.0005132897,0.00012183493,0.0000661754],"category_scores_gemma":[0.00023664646,0.00014577348,0.00003816279,0.0006608116,0.00011966858,0.001014921,0.00025111862,0.00041577526,0.00015971797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014173278,0.00009245242,0.032261577,0.0000066348143,0.0000039084625,0.000011697726,0.0004727915,8.580767e-7,0.002910117,0.9413956,0.00013342783,0.022696754],"study_design_scores_gemma":[0.0014945087,0.000026172234,0.061946753,0.000012406781,0.000002011151,0.000032728745,0.000027385262,0.0039947005,0.0034921532,0.9277228,0.0010591436,0.00018922512],"about_ca_topic_score_codex":0.000021748063,"about_ca_topic_score_gemma":0.000053720796,"teacher_disagreement_score":0.029685177,"about_ca_system_score_codex":0.000049504284,"about_ca_system_score_gemma":0.000041630756,"threshold_uncertainty_score":0.59444696},"labels":[],"label_agreement":null},{"id":"W2408513405","doi":"","title":"Minimum Degree, Independence Number and (a, b, k)-Critical Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Degree (music); Independence (probability theory); Combinatorics; Discrete mathematics; Statistics; Graph; Physics","score_opus":0.0209072817346366,"score_gpt":0.29422861548338325,"score_spread":0.2733213337487467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408513405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98098516,0.00024913752,0.0061520115,0.0014464905,0.0012293631,0.00037483292,0.000001470963,0.0002487276,0.009312824],"genre_scores_gemma":[0.9908468,0.00002414505,0.0085787345,0.00020468437,0.000004501552,0.000060382394,5.4781225e-7,0.000014952921,0.00026526462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800986,0.0001485686,0.00020876912,0.00053294713,0.0005388523,0.0005610129],"domain_scores_gemma":[0.9980965,0.0005660843,0.00003673716,0.0007184025,0.00026101127,0.00032122352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037234783,0.0001782402,0.0001887944,0.00011066871,0.00020039367,0.0002711438,0.0010092919,0.000116508505,0.00013299307],"category_scores_gemma":[0.00031984583,0.00016946725,0.000050543127,0.00058250595,0.00035509755,0.0013298958,0.00064027717,0.00038173256,0.00061348634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030782444,0.000058406902,0.012584376,0.000010778253,0.000007883445,0.000022726741,0.0001104141,1.8453744e-7,0.0004890775,0.9783253,0.0009900628,0.00739771],"study_design_scores_gemma":[0.00038303286,0.00007183874,0.016927354,0.000014659707,0.0000023467146,0.000052348863,0.000029067965,0.0010364477,0.00089024875,0.980165,0.00021746824,0.00021015883],"about_ca_topic_score_codex":0.000044018394,"about_ca_topic_score_gemma":0.000001838131,"teacher_disagreement_score":0.009861645,"about_ca_system_score_codex":0.000024458799,"about_ca_system_score_gemma":0.000048458995,"threshold_uncertainty_score":0.78853303},"labels":[],"label_agreement":null},{"id":"W2408734287","doi":"","title":"The Diameter of Connected Domination Critical Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01786029530915067,"score_gpt":0.30252337271576896,"score_spread":0.2846630774066183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408734287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8513451,0.002317561,0.12733893,0.003086849,0.00840576,0.0007111625,0.000005392214,0.00031277086,0.006476466],"genre_scores_gemma":[0.9958865,0.000018053614,0.003974407,0.00003961262,0.000005339856,0.000023706716,6.3114123e-7,0.000007977768,0.000043780896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986118,0.00026231742,0.00019523434,0.00015855538,0.00036076136,0.00041130203],"domain_scores_gemma":[0.9968576,0.0021424221,0.00005565824,0.0005943443,0.00023294947,0.000117068776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097646937,0.00008945004,0.00011892498,0.00009009657,0.00019865907,0.00005301616,0.00079137884,0.0000474465,0.000008723761],"category_scores_gemma":[0.0011111834,0.00006496523,0.00006604463,0.00058428914,0.00029913653,0.0006032946,0.00016621724,0.00015490779,0.000027981598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009335524,0.000078303914,0.0018721585,0.0000054716315,0.000009710025,7.3956613e-7,0.00021711849,2.8069664e-7,0.0017704889,0.9914446,0.0002283067,0.0043634973],"study_design_scores_gemma":[0.00029208593,0.00007124946,0.0073031047,0.0000071439704,0.0000034327716,0.000003901477,0.000030335917,0.00036590028,0.018406112,0.9728157,0.00061482674,0.00008624098],"about_ca_topic_score_codex":0.000002965693,"about_ca_topic_score_gemma":5.918647e-7,"teacher_disagreement_score":0.14454138,"about_ca_system_score_codex":0.000023284321,"about_ca_system_score_gemma":0.000022591816,"threshold_uncertainty_score":0.2649205},"labels":[],"label_agreement":null},{"id":"W2409344144","doi":"10.1002/jgt.22362","title":"Optimal‐size clique transversals in chordal graphs","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Treewidth; Clique-sum; Split graph; Vertex (graph theory); Clique graph; Interval graph; Clique; Discrete mathematics; Graph; Block graph; Pathwidth; 1-planar graph; Line graph; Graph power","score_opus":0.020456285358371813,"score_gpt":0.3103444728800291,"score_spread":0.2898881875216573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409344144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37465486,0.0033097698,0.6155984,0.0008794052,0.0026924678,0.00063588965,0.000022989865,0.00010381238,0.0021024442],"genre_scores_gemma":[0.87301445,0.0020936206,0.123802684,0.0003679357,0.00040962212,0.00003217577,0.0000019379647,0.000087123095,0.00019043166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936317,0.002055369,0.0015232372,0.0007592214,0.0011781526,0.000852282],"domain_scores_gemma":[0.9944262,0.0017367707,0.0012004798,0.001493009,0.0007404588,0.0004030897],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.009799943,0.00056775863,0.001131068,0.002225156,0.0001299681,0.0002581141,0.005441834,0.00054610695,0.00011873558],"category_scores_gemma":[0.00075052254,0.00049649255,0.0011040063,0.0013870653,0.0007658848,0.0008538714,0.0011059339,0.0033299932,0.000017906832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024491157,0.0008524712,0.0019574182,0.0003598118,0.0008431285,0.0016984013,0.005949555,0.007591267,0.0028258779,0.9565698,0.001409549,0.017493634],"study_design_scores_gemma":[0.0011247017,0.00054382795,0.0018164383,0.000553987,0.000034008193,0.00024212956,0.0001318747,0.00030683886,0.002202352,0.99206436,0.00048211418,0.0004973842],"about_ca_topic_score_codex":0.0000069260514,"about_ca_topic_score_gemma":0.000009306451,"teacher_disagreement_score":0.4983596,"about_ca_system_score_codex":0.00016241317,"about_ca_system_score_gemma":0.00060804235,"threshold_uncertainty_score":0.9999392},"labels":[],"label_agreement":null},{"id":"W2409819057","doi":"10.1007/978-3-030-45771-6_15","title":"Recognizing Even-Cycle and Even-Cut Matroids","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Matroid partitioning; Combinatorics; Binary number; Computer science; Class (philosophy); Oriented matroid; Time complexity; Discrete mathematics; Mathematics; Arithmetic; Artificial intelligence","score_opus":0.023010251030053632,"score_gpt":0.2739879953730963,"score_spread":0.2509777443430427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409819057","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016989256,0.000994544,0.9918539,0.0020374556,0.0008303212,0.00044549938,0.000007166325,0.00023928098,0.003421919],"genre_scores_gemma":[0.21294938,0.00023523625,0.7823454,0.0029666852,0.0007360299,0.000022177768,0.000005836504,0.000107476466,0.0006317747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951171,0.000082292245,0.00050999795,0.0021884234,0.0012068879,0.0008952619],"domain_scores_gemma":[0.9969966,0.00076492113,0.00022896752,0.0013794176,0.00022301977,0.00040706666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010938572,0.00058991194,0.00062572595,0.0008339031,0.00038539342,0.0006465865,0.003765536,0.00029203927,0.000021364107],"category_scores_gemma":[0.00024557905,0.0005674874,0.0001299299,0.0009783328,0.0010866647,0.00096788513,0.0032893852,0.0013907559,0.00009595694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017128259,0.00001781931,0.000060290222,0.00007736927,0.000018028628,0.00023373308,0.00084298686,0.003521745,0.000604634,0.08262558,0.000025403553,0.9119553],"study_design_scores_gemma":[0.00029006577,0.00024357381,0.000074505784,0.00031426156,0.000005815062,0.00014390281,3.378343e-7,0.22300853,0.0012270709,0.77215064,0.0018244341,0.0007168724],"about_ca_topic_score_codex":0.000008667601,"about_ca_topic_score_gemma":0.0000314591,"teacher_disagreement_score":0.91123843,"about_ca_system_score_codex":0.0002173406,"about_ca_system_score_gemma":0.00043612713,"threshold_uncertainty_score":0.99967766},"labels":[],"label_agreement":null},{"id":"W2411014121","doi":"","title":"Finding a Second Hamiltonian cycle in Barnette Graphs","year":2015,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Hamiltonian path; Mathematics; Combinatorics; Graph","score_opus":0.015476916428341658,"score_gpt":0.2466652934985891,"score_spread":0.23118837707024745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411014121","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961155,0.00016133947,0.0001570774,0.0002479127,0.00024729362,0.00027162945,0.00001738112,0.00007931405,0.0027025344],"genre_scores_gemma":[0.46569413,0.00007264886,0.013987864,0.0000298306,0.000022577906,0.0000016670483,0.00018840532,0.00004861678,0.51995426],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809724,0.00015288252,0.00014728848,0.0006085466,0.0005019285,0.0004921018],"domain_scores_gemma":[0.9986794,0.00006226562,0.00020277165,0.0006799371,0.00019435512,0.00018128689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047225223,0.0002480592,0.00042021787,0.0011120484,0.00014623966,0.000048630023,0.0017161517,0.0002690642,0.00012392554],"category_scores_gemma":[0.000023656414,0.00031038697,0.00014783324,0.00093354157,0.000108456676,0.0007692462,0.00026308742,0.00052059395,0.000083423074],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078878977,0.0004460851,0.004345594,0.0012254989,0.00034030923,0.0016446946,0.846277,0.0011440697,0.016431918,0.0689892,0.0061796727,0.052187175],"study_design_scores_gemma":[0.009006977,0.001236865,0.068774536,0.001934161,0.00013057645,0.000044916604,0.35136548,0.019805094,0.01005526,0.5261564,0.0072647333,0.0042249877],"about_ca_topic_score_codex":0.0055505354,"about_ca_topic_score_gemma":0.11337413,"teacher_disagreement_score":0.5304214,"about_ca_system_score_codex":0.00014205641,"about_ca_system_score_gemma":0.00018936206,"threshold_uncertainty_score":0.99993485},"labels":[],"label_agreement":null},{"id":"W2411941568","doi":"10.23638/dmtcs-20-1-6","title":"A Study of $k$-dipath Colourings of Oriented Graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.020189179021580617,"score_gpt":0.3130555463560788,"score_spread":0.29286636733449817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411941568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43821698,0.00000519379,0.5597229,0.000036307527,0.00013272018,0.00037797567,0.0000022411696,0.00006236044,0.0014433241],"genre_scores_gemma":[0.75152,0.0000010343501,0.24840532,0.000022309305,0.000020987713,0.000012919988,2.1799974e-7,0.0000118139415,0.0000054003735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958835,0.00018382499,0.0007673593,0.0007884319,0.0016932973,0.00068356],"domain_scores_gemma":[0.99600387,0.00052811735,0.00034531162,0.0018628557,0.000985333,0.00027454444],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002744486,0.00026142137,0.0005271836,0.00056027033,0.00032631747,0.00011812491,0.004139055,0.000052460768,0.000033638604],"category_scores_gemma":[0.00036312419,0.00020171877,0.000118552896,0.0034868254,0.00741315,0.00055674836,0.0024531707,0.00021213229,0.000016894857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020531006,0.0006683959,0.00025105214,0.00004136163,0.000018876191,0.00000841292,0.009804854,0.00001420251,0.002170738,0.98592573,0.000005155608,0.0010706809],"study_design_scores_gemma":[0.00065385894,0.002755616,0.0005034627,0.00011279596,0.0000164153,0.000024515079,0.0006898756,0.21454105,0.022092799,0.7583295,0.0000057037873,0.00027440098],"about_ca_topic_score_codex":0.0000036212143,"about_ca_topic_score_gemma":0.0000015532326,"teacher_disagreement_score":0.31330302,"about_ca_system_score_codex":0.000027140693,"about_ca_system_score_gemma":0.00012294283,"threshold_uncertainty_score":0.9952881},"labels":[],"label_agreement":null},{"id":"W2418252267","doi":"","title":"Pancyclism of 3-domination-critical graphs with small minimum degree","year":2008,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Degree (music); Combinatorics","score_opus":0.03469367632630748,"score_gpt":0.22654552902218283,"score_spread":0.19185185269587535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418252267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4343394,0.00011497852,0.5099004,0.00015218605,0.0004890642,0.00023059374,0.0000124329,0.00016905226,0.05459189],"genre_scores_gemma":[0.95126605,0.000022506478,0.0459188,0.000019662539,0.000046184556,0.000002099838,0.0000053081967,0.000009779732,0.0027095836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99801826,0.00015327688,0.00024726527,0.0005526089,0.00066427625,0.00036429652],"domain_scores_gemma":[0.9981575,0.00036516495,0.00011979277,0.0005794188,0.00055320567,0.00022489532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001482818,0.00020443683,0.00024442046,0.0005941703,0.0010511574,0.00003789451,0.0010555115,0.00010543515,0.000009090229],"category_scores_gemma":[0.00012526836,0.00020966512,0.0001293651,0.0011599632,0.0020115566,0.0010385581,0.00027321107,0.0002799279,0.000013529109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014164955,0.0002013539,0.009513321,0.0000358074,0.000055057528,0.0034635777,0.00019212048,0.0004893025,0.0042499215,0.98084354,0.00005190262,0.0007624171],"study_design_scores_gemma":[0.017925942,0.0038244366,0.6543957,0.0020732433,0.00042847666,0.023852581,0.0020084227,0.021603674,0.12735975,0.07793706,0.06233831,0.0062523815],"about_ca_topic_score_codex":0.000049011254,"about_ca_topic_score_gemma":0.000018073126,"teacher_disagreement_score":0.90290654,"about_ca_system_score_codex":0.0001586587,"about_ca_system_score_gemma":0.00062342803,"threshold_uncertainty_score":0.8549895},"labels":[],"label_agreement":null},{"id":"W24206502","doi":"10.1103/physrevlett.111.175501","title":"A note on the spatiality degree of graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music)","score_opus":0.04942459947340829,"score_gpt":0.2878263316629336,"score_spread":0.2384017321895253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24206502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94034386,0.0002907671,0.014028833,0.006024144,0.0021588458,0.00074681005,0.000007396643,0.0002629873,0.036136374],"genre_scores_gemma":[0.99868935,0.00001787834,0.00095330895,0.00018420418,0.000002775504,0.000016327223,2.358455e-7,0.000008081623,0.00012785586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998515,0.00024179049,0.00019050007,0.0002775328,0.00049128244,0.0002839139],"domain_scores_gemma":[0.997905,0.0006415321,0.00009179742,0.0011752639,0.00011326767,0.00007310353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005865883,0.000115926705,0.00014939418,0.00009879111,0.00014425413,0.00003815092,0.0014596235,0.00004642786,0.00006398516],"category_scores_gemma":[0.00025401937,0.000081480415,0.0000926801,0.00078138435,0.00018769848,0.00018019218,0.0002604706,0.00024232082,0.0001086745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006062723,0.00010920159,0.0004727147,0.000004408725,0.000008750725,0.000005201575,0.00028091102,0.0000057278517,0.00026644324,0.9879168,0.0007519952,0.010171762],"study_design_scores_gemma":[0.0003017762,0.00016599368,0.002529854,0.000013616807,0.0000018903477,0.000001966483,0.0000065368376,0.0035563186,0.006395453,0.9863009,0.0006287816,0.00009693437],"about_ca_topic_score_codex":0.000019094397,"about_ca_topic_score_gemma":0.0000037186373,"teacher_disagreement_score":0.05834549,"about_ca_system_score_codex":0.000025758334,"about_ca_system_score_gemma":0.000014515483,"threshold_uncertainty_score":0.3322675},"labels":[],"label_agreement":null},{"id":"W242281779","doi":"","title":"Erratum to \"Inducing regularization of graphs, multigraphs and pseudographs\" [Ars Combinatoria 65 (2002), 129-133].","year":2007,"lang":"en","type":"erratum","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regularization (linguistics); Pure mathematics; Computer science; Artificial intelligence","score_opus":0.015201718010173145,"score_gpt":0.27535159430298567,"score_spread":0.2601498762928125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W242281779","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20302407,0.041271374,0.04198789,0.0029391514,0.5611777,0.018486226,0.00059036893,0.005429007,0.12509422],"genre_scores_gemma":[0.8042531,0.0048779114,0.065564595,0.0016544297,0.00032762674,0.0008473633,0.0010499007,0.0015535932,0.11987149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99091583,0.0006582337,0.0015897375,0.0025447723,0.002396513,0.0018948861],"domain_scores_gemma":[0.99236006,0.00061148853,0.0010466026,0.003517882,0.0014326978,0.0010312813],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0027599335,0.0012739905,0.0016943696,0.0039367955,0.00063770014,0.000447514,0.0042056125,0.0015369755,0.000028741162],"category_scores_gemma":[0.0007914966,0.0014062107,0.00052230695,0.0075967815,0.0007371062,0.0011561628,0.0018634549,0.0026902158,0.000037254486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006927586,0.0003231788,0.0007910223,0.00030028928,0.00021286093,0.00007643026,0.0007514678,0.000012581331,0.00088705414,0.7860157,0.20766863,0.0028915168],"study_design_scores_gemma":[0.0019752483,0.00080781104,0.0030161329,0.00086329936,0.000085117965,0.00005178339,0.00011700998,0.00058231043,0.0023087645,0.97145087,0.017182717,0.0015589662],"about_ca_topic_score_codex":0.0001402134,"about_ca_topic_score_gemma":0.00004399785,"teacher_disagreement_score":0.601229,"about_ca_system_score_codex":0.00021010484,"about_ca_system_score_gemma":0.00053708337,"threshold_uncertainty_score":0.99975926},"labels":[],"label_agreement":null},{"id":"W2423480771","doi":"10.1002/jgt.22053","title":"Minimum Power Dominating Sets of Random Cubic Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Cubic graph; Combinatorics; Heuristics; Random graph; Independent set; Dominating set; Discrete mathematics; Graph; Line graph; Mathematical optimization; Voltage graph; Vertex (graph theory)","score_opus":0.012297420658721215,"score_gpt":0.28186232163078867,"score_spread":0.2695649009720675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2423480771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5022993,0.0013762155,0.49305218,0.0005388224,0.0006580493,0.00016587558,0.0000051190177,0.000031604533,0.0018728423],"genre_scores_gemma":[0.98777074,0.00015907286,0.011763793,0.00007425336,0.00003098945,0.0000028099491,7.075271e-8,0.000018552526,0.00017974712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969112,0.0008229943,0.0008235409,0.00024175755,0.00077209546,0.0004283992],"domain_scores_gemma":[0.9951504,0.0025628104,0.0008770788,0.0006163234,0.0005852861,0.00020811066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005257805,0.0001948234,0.00049949513,0.0010219994,0.00010930329,0.000039055263,0.0017206533,0.000082403945,0.00008341706],"category_scores_gemma":[0.0009035298,0.000116338655,0.00051793864,0.00087579945,0.00047026316,0.000985483,0.00022922731,0.00029050815,0.000010614259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012878333,0.00018076456,0.0010596742,0.000027454937,0.00021296149,0.00012406155,0.0010273916,0.000012005365,0.12946458,0.78917205,0.00038028212,0.077050954],"study_design_scores_gemma":[0.0037160509,0.00047869937,0.000908332,0.00024967128,0.000016984402,0.0002145595,0.00014519293,0.000021989674,0.03232275,0.9615219,0.00023286437,0.0001710019],"about_ca_topic_score_codex":4.2657672e-7,"about_ca_topic_score_gemma":3.653564e-7,"teacher_disagreement_score":0.48547143,"about_ca_system_score_codex":0.000031011514,"about_ca_system_score_gemma":0.00010480929,"threshold_uncertainty_score":0.47441527},"labels":[],"label_agreement":null},{"id":"W2429536804","doi":"10.1016/j.dam.2016.05.018","title":"On color-critical (<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>,co-<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs","year":2016,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Graph; Chromatic scale; Combinatorics; Mathematics; Discrete mathematics; Algorithm; Physics","score_opus":0.0199158217559506,"score_gpt":0.263607790125686,"score_spread":0.24369196836973542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2429536804","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4239704,0.0020865067,0.009316193,0.0018590841,0.005380781,0.00022316087,0.0021306186,0.0010143663,0.55401886],"genre_scores_gemma":[0.9579021,0.003448196,0.01680094,0.0038402914,0.004353821,0.005745206,0.0035586138,0.0032784983,0.0010723843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9676669,0.0014566183,0.006285709,0.0063414085,0.009469656,0.008779664],"domain_scores_gemma":[0.969679,0.009070802,0.006016241,0.010076816,0.0007162466,0.0044409223],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0070654666,0.003470756,0.0014248937,0.0021511842,0.0051570614,0.005244015,0.0105829295,0.007023012,0.4917266],"category_scores_gemma":[0.007457853,0.0061960765,0.0060644154,0.0044917692,0.007832006,0.004870803,0.009459377,0.005950128,0.009799812],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041513257,0.0011984995,0.000012072763,0.003478708,0.0033648307,0.003717985,0.0034127277,0.0019929917,0.0065045026,0.6755232,0.29405573,0.0025874097],"study_design_scores_gemma":[0.005902575,0.004368342,0.00007452228,0.0042059715,0.0034645072,0.0035099515,0.0036570453,0.14932172,0.8117243,0.002310123,0.0061174827,0.005343458],"about_ca_topic_score_codex":0.0014544751,"about_ca_topic_score_gemma":0.002481148,"teacher_disagreement_score":0.8052198,"about_ca_system_score_codex":0.00008912011,"about_ca_system_score_gemma":0.004952572,"threshold_uncertainty_score":0.9985519},"labels":[],"label_agreement":null},{"id":"W2438977958","doi":"10.55016/ojs/cdm.v12i1.62598","title":"First-Fit coloring of Cartesian product graphs and its defining sets","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Product (mathematics); Mathematics; Combinatorics; Geometry","score_opus":0.03617069705655002,"score_gpt":0.3428559451413638,"score_spread":0.3066852480848138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2438977958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5019066,0.0012752741,0.4836165,0.0070778765,0.0003165304,0.0020009764,0.00041412466,0.00029732336,0.0030948413],"genre_scores_gemma":[0.957943,0.000027462247,0.04182323,0.000013548816,0.000007976605,0.00006751612,0.00000224707,0.000011847908,0.00010316706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859154,0.000038859365,0.00032092424,0.0003481572,0.00028802364,0.00041251347],"domain_scores_gemma":[0.9976574,0.0002777771,0.00023006338,0.0012627518,0.00037563534,0.00019633932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072196627,0.00015842282,0.00030827653,0.00016121035,0.0009265283,0.0002542961,0.001155944,0.000043664062,0.0000045275383],"category_scores_gemma":[0.002881974,0.0001450097,0.000067714136,0.00025838372,0.0001501861,0.00052970194,0.00082291634,0.00014333383,0.000026316027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045316524,0.000033377655,0.0003877297,0.000100016274,0.000026625106,0.000005902818,0.00089395535,0.000085608,0.0008122796,0.99686176,0.000048607544,0.00073963037],"study_design_scores_gemma":[0.0010609732,0.000277761,0.008058263,0.0006396817,0.000056401936,0.0000649327,0.00022412477,0.083408505,0.025925197,0.8788249,0.00082081696,0.0006384502],"about_ca_topic_score_codex":0.000005407473,"about_ca_topic_score_gemma":0.00001704047,"teacher_disagreement_score":0.45603645,"about_ca_system_score_codex":0.000040759653,"about_ca_system_score_gemma":0.00005630582,"threshold_uncertainty_score":0.71262},"labels":[],"label_agreement":null},{"id":"W2443199731","doi":"","title":"Inapproximability of treewidth and related problems","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Partial k-tree; Pathwidth; Tree-depth; Graphical model; Tree decomposition; Combinatorics; Computer science; Mathematics; 1-planar graph; Inference; Discrete mathematics; Graph; Chordal graph; Theoretical computer science; Artificial intelligence; Line graph","score_opus":0.1818545937339058,"score_gpt":0.3737240228359098,"score_spread":0.19186942910200397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2443199731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12338957,0.00008069753,0.80480343,0.0051627057,0.00096735044,0.0005196997,0.000015053085,0.00017874668,0.06488273],"genre_scores_gemma":[0.99261594,0.000020594602,0.007087782,0.00003759974,0.00001798519,0.000018767176,0.0000028070576,0.0000060971406,0.00019241356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821246,0.00012354333,0.00044314322,0.00044426767,0.00058047636,0.00019610405],"domain_scores_gemma":[0.9984549,0.00014597915,0.00014408314,0.00041384884,0.0006858453,0.00015531057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083749543,0.00013375153,0.00016630632,0.00021307277,0.00004300589,0.000108515625,0.0010728575,0.00006395599,0.00007025305],"category_scores_gemma":[0.00057445397,0.00012220832,0.00004250528,0.00037425398,0.0003674854,0.00044550785,0.00030094493,0.00022736528,0.00007571125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038831906,0.00011948537,0.00021194917,0.000005303242,0.00001281962,0.000003781215,0.0008568929,0.00045214372,0.0016833247,0.8976069,0.0000082858305,0.099000245],"study_design_scores_gemma":[0.000043267926,0.00023141499,0.0001499383,0.000034760407,0.0000012024278,0.000009157118,0.00017645735,0.1479452,0.017885007,0.83333844,0.00007663423,0.00010849525],"about_ca_topic_score_codex":0.000035958194,"about_ca_topic_score_gemma":0.000021053464,"teacher_disagreement_score":0.8692264,"about_ca_system_score_codex":0.00006111022,"about_ca_system_score_gemma":0.00013115736,"threshold_uncertainty_score":0.49835104},"labels":[],"label_agreement":null},{"id":"W2460448338","doi":"10.1007/s00373-016-1724-9","title":"Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity","year":2016,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Indifference graph; 1-planar graph; Pathwidth; Chordal graph; Discrete mathematics; Cograph; Graph; Line graph; Computer science","score_opus":0.01344883607917286,"score_gpt":0.23785468601881501,"score_spread":0.22440584993964216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460448338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99236375,0.0012994397,0.0047080624,0.00050268514,0.0001432931,0.00039994958,0.000006892538,0.00014940677,0.00042654958],"genre_scores_gemma":[0.9975903,0.0013038089,0.00082943914,0.00010106591,0.0000034314228,0.00007465707,9.89641e-7,0.000023815277,0.00007248337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744445,0.00025390746,0.00035208798,0.0008423038,0.0003992216,0.00070801785],"domain_scores_gemma":[0.9976689,0.0011813204,0.00012797913,0.0006453676,0.0001384312,0.00023799887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009461533,0.00033267043,0.00041395042,0.0011437957,0.00017442745,0.00016240262,0.0006217001,0.00015617268,0.0000024903397],"category_scores_gemma":[0.00021808391,0.00024058894,0.000059542293,0.002853213,0.00041204473,0.0009692855,0.00045546162,0.00044282238,0.0000022487477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041621035,0.00013302421,0.37634742,0.00003300173,0.000013320135,0.00005882655,0.0006630372,0.0000035045537,0.00020347706,0.609119,0.000014881464,0.0133689],"study_design_scores_gemma":[0.0022906505,0.00040257958,0.20217241,0.00016285425,0.0000042643,0.000013951043,0.000052945856,0.00035618164,0.00039545228,0.79358363,0.00020734084,0.00035775665],"about_ca_topic_score_codex":0.00008032319,"about_ca_topic_score_gemma":0.0001250123,"teacher_disagreement_score":0.18446463,"about_ca_system_score_codex":0.000035202414,"about_ca_system_score_gemma":0.00006232228,"threshold_uncertainty_score":0.9810932},"labels":[],"label_agreement":null},{"id":"W2476701528","doi":"10.1016/s0012-365x(01)00209-6","title":"On dijoins","year":2002,"lang":"es","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Arc (geometry); Integer (computer science); Minimum weight; Combinatorics; Weight function; Discrete mathematics; Function (biology); Statistics; Computer science; Geometry","score_opus":0.04444712923435091,"score_gpt":0.31091035705345427,"score_spread":0.26646322781910337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476701528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045233484,0.001022532,0.6827967,0.0038017412,0.00069135946,0.0010949475,0.00008573261,0.0005294986,0.26474398],"genre_scores_gemma":[0.9351928,0.0003345198,0.052341476,0.00040021396,0.0001561983,0.000039222174,0.000003591493,0.00009450683,0.011437424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715817,0.00013561244,0.00047112585,0.00056865986,0.00091979397,0.00074662204],"domain_scores_gemma":[0.9969358,0.0007749059,0.00019807724,0.0017345524,0.000094995914,0.0002616562],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004336387,0.0003700326,0.0004022566,0.00024420625,0.00027666707,0.0005406401,0.0015515594,0.00012481144,0.0008095879],"category_scores_gemma":[0.0004641994,0.00031169315,0.00021575783,0.00074903027,0.0002741631,0.00036389328,0.0004989123,0.00045613002,0.0052386806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004120945,0.00031731316,0.00002420959,0.00020746882,0.000038542617,0.000053378204,0.00236426,0.00010027746,0.00012221138,0.98760515,0.0020391345,0.007123917],"study_design_scores_gemma":[0.00048948394,0.0004579629,0.00007047869,0.00051943556,0.000024114113,0.00003242195,0.0001715782,0.39966786,0.0010540605,0.59132284,0.005584915,0.0006048306],"about_ca_topic_score_codex":0.0000011048288,"about_ca_topic_score_gemma":4.716817e-7,"teacher_disagreement_score":0.88995934,"about_ca_system_score_codex":0.00006434644,"about_ca_system_score_gemma":0.000016556258,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W2476908243","doi":"10.1016/j.dam.2016.07.002","title":"Uniquely forced perfect matching and unique 3-edge-coloring","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Science Foundation of Sri Lanka; Simons Foundation; National Natural Science Foundation of China; National Sanitarium Association; National Science Foundation","keywords":"Mathematics; Combinatorics; Matching (statistics); Edge coloring; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Graph; Computer science; Statistics","score_opus":0.018810681003194614,"score_gpt":0.27401836684245623,"score_spread":0.2552076858392616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476908243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13917416,0.000025277226,0.8487498,0.00027798346,0.00003408696,0.0004014133,0.0000027194662,0.00027039603,0.011064167],"genre_scores_gemma":[0.73197633,0.000044368902,0.26741913,0.00006278518,0.000017143791,0.00009879361,7.143804e-7,0.000033838023,0.0003469123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984401,0.000039997372,0.0002939863,0.00043619814,0.00030861137,0.0004811412],"domain_scores_gemma":[0.99824,0.0006553745,0.000119952776,0.0007708117,0.00004807225,0.00016580427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006934596,0.0002300258,0.00027594864,0.00014322472,0.00019748218,0.0001368995,0.0007885421,0.00007935995,0.000012552076],"category_scores_gemma":[0.00007256638,0.00015290108,0.00005579376,0.00028392175,0.00015215867,0.00040282856,0.00064254843,0.00016657589,0.0000468284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007402845,0.000013863613,0.000012023695,0.00007691445,0.000014580077,0.000005072845,0.0012018088,0.0000065154973,0.07746394,0.91056645,0.000010775515,0.010620648],"study_design_scores_gemma":[0.0004077221,0.000047510806,0.00005013438,0.0001052684,0.0000065863096,0.00002139525,0.00020241085,0.0015548962,0.04394953,0.95318645,0.00018742417,0.00028065048],"about_ca_topic_score_codex":0.0000017486623,"about_ca_topic_score_gemma":0.0000020409054,"teacher_disagreement_score":0.59280217,"about_ca_system_score_codex":0.000054296095,"about_ca_system_score_gemma":0.000036799287,"threshold_uncertainty_score":0.6235125},"labels":[],"label_agreement":null},{"id":"W2477185620","doi":"10.1016/j.dam.2016.07.020","title":"Safe set problem on graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Set (abstract data type); Discrete mathematics; Computer science; Programming language","score_opus":0.025103304140731954,"score_gpt":0.287618367183075,"score_spread":0.262515063042343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477185620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045986674,0.000011752051,0.8974883,0.0008018031,0.000050738425,0.0005542265,0.000014102708,0.00030302684,0.09617736],"genre_scores_gemma":[0.4636917,0.00003296427,0.5342586,0.0002802553,0.00003754508,0.00023852417,0.000003524663,0.00005484701,0.0014020433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981388,0.00002625019,0.00031140438,0.0004583287,0.0005553082,0.0005098942],"domain_scores_gemma":[0.99799746,0.0004480612,0.00012802733,0.0012195915,0.0000491121,0.00015775427],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004668721,0.0002266621,0.00024159288,0.00016972159,0.00013371721,0.00008586968,0.0012715339,0.000068669106,0.00005134862],"category_scores_gemma":[0.000047620204,0.00013580271,0.00008735161,0.00044883147,0.0001479548,0.00021352341,0.00035409862,0.00013854424,0.0008408703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009899179,0.000047149788,0.000004750535,0.00004036024,0.000016139316,0.0000045831816,0.00043862738,0.0000071516524,0.01008903,0.973525,0.000501572,0.015315772],"study_design_scores_gemma":[0.0004161124,0.00007422186,0.00001559471,0.00007091151,0.0000038985986,0.00000604357,0.000060511597,0.00043072883,0.015443428,0.9811777,0.002056037,0.00024484083],"about_ca_topic_score_codex":3.4904355e-7,"about_ca_topic_score_gemma":7.1438654e-7,"teacher_disagreement_score":0.45909303,"about_ca_system_score_codex":0.000039997878,"about_ca_system_score_gemma":0.00003070141,"threshold_uncertainty_score":0.9999371},"labels":[],"label_agreement":null},{"id":"W2482477387","doi":"10.1016/j.dam.2016.06.019","title":"A deterministic version of the game of zombies and survivors on graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; Memorial University of Newfoundland; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013771039968413844,"score_gpt":0.25651936903229,"score_spread":0.24274832906387617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482477387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80112714,0.000022692033,0.19340862,0.00015356748,0.000060756243,0.0003991529,0.000018864219,0.00003803386,0.0047711753],"genre_scores_gemma":[0.98838186,0.000019469837,0.011499304,0.000012716985,0.0000026794255,0.000011328035,1.6924928e-7,0.000009136121,0.00006332769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905235,0.000028004502,0.00023273127,0.0001802639,0.0003419656,0.00016469786],"domain_scores_gemma":[0.99837625,0.00065947074,0.0001788454,0.00070309144,0.000040179722,0.000042148222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027787348,0.000107128755,0.00019754545,0.000085329775,0.00004602242,0.000011950963,0.0006550118,0.00003541987,0.0000048833763],"category_scores_gemma":[0.0001026102,0.00005452574,0.000057631816,0.00025571583,0.00037565923,0.00006454496,0.00035068084,0.00005647157,0.0000060720613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017112896,0.000036935522,0.00008276435,0.00012054781,0.0000114913055,4.8574685e-7,0.0008149909,0.0000036060246,0.036247265,0.95851094,0.000008528479,0.004145306],"study_design_scores_gemma":[0.00042704958,0.00011146662,0.0007887189,0.00018969068,0.00001028796,0.0000030863973,0.00019262059,0.0008916763,0.08433152,0.91289485,0.000040829906,0.000118221134],"about_ca_topic_score_codex":0.000001232238,"about_ca_topic_score_gemma":0.0000018375948,"teacher_disagreement_score":0.18725473,"about_ca_system_score_codex":0.000008196496,"about_ca_system_score_gemma":0.000016900263,"threshold_uncertainty_score":0.22234951},"labels":[],"label_agreement":null},{"id":"W2483716866","doi":"10.1016/j.dam.2016.06.030","title":"Well-covered triangulations: Part IV","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Plane (geometry); Triangulation; Graph; Simple (philosophy); Pitteway triangulation; Geometry; Delaunay triangulation","score_opus":0.02604900886195653,"score_gpt":0.2851178197495272,"score_spread":0.25906881088757067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483716866","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030423957,0.000030156627,0.94913214,0.00064642366,0.0000923686,0.00045439892,0.000010433368,0.00026726854,0.04632439],"genre_scores_gemma":[0.4746641,0.00007312631,0.5187254,0.00026335433,0.00018957657,0.0003513274,0.000008785002,0.000075535485,0.005648837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831337,0.000028825047,0.00037631174,0.00038878218,0.00046313822,0.0004295491],"domain_scores_gemma":[0.99790454,0.0005433693,0.00015040563,0.0012085645,0.000057158893,0.00013594],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047805344,0.00018792556,0.00024150302,0.00012303598,0.00014132907,0.00010290653,0.0010099087,0.000068863745,0.00017228546],"category_scores_gemma":[0.00012785869,0.000121179815,0.00009005832,0.00042317255,0.00012375148,0.00034173598,0.0003256963,0.000091929905,0.0010580905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009173422,0.000043502947,0.0000057179154,0.000023528097,0.000019517618,0.0000029962866,0.00027279626,0.000012559336,0.006615264,0.9828424,0.00079848943,0.009354054],"study_design_scores_gemma":[0.0008676313,0.00002992137,0.000033936278,0.00005622957,0.000008417117,0.000006673276,0.00009191265,0.0031801146,0.009749697,0.97422475,0.011466079,0.0002846232],"about_ca_topic_score_codex":3.845145e-7,"about_ca_topic_score_gemma":8.396884e-7,"teacher_disagreement_score":0.4716217,"about_ca_system_score_codex":0.00004547493,"about_ca_system_score_gemma":0.000042241147,"threshold_uncertainty_score":0.9997197},"labels":[],"label_agreement":null},{"id":"W2486389624","doi":"10.1007/978-3-319-39817-4_6","title":"Positive Zero Forcing and Edge Clique Coverings","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Clique problem; Clique; Forcing (mathematics); Computer science; Popularity; Uniqueness; Enhanced Data Rates for GSM Evolution; Graph; Context (archaeology); Zero (linguistics); Discrete mathematics; Combinatorics; Mathematics; Theoretical computer science; Chordal graph; 1-planar graph; Artificial intelligence; Mathematical analysis","score_opus":0.013882316641440514,"score_gpt":0.26798024283240585,"score_spread":0.25409792619096533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486389624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014676529,0.0004931233,0.99093425,0.0007665116,0.0006638964,0.00042142748,0.000009488468,0.00013479688,0.006429759],"genre_scores_gemma":[0.42681065,0.00029596995,0.5663345,0.0032049115,0.00061903393,0.00002836878,0.0000031415298,0.00011564061,0.00258779],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612623,0.00005099818,0.0003798671,0.0017339891,0.0008426352,0.0008662844],"domain_scores_gemma":[0.9968551,0.0011992513,0.00020604563,0.0011986989,0.0002765176,0.00026441124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001054696,0.0005036753,0.00049055874,0.00087570475,0.00033578387,0.00047534122,0.0027286175,0.00028140785,0.000009582845],"category_scores_gemma":[0.00015764896,0.00040973796,0.00009950814,0.0004558099,0.0014193996,0.0011249487,0.0027889519,0.0008034005,0.00003411542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136522285,0.0000086663185,0.00004930758,0.000028570443,0.000010176433,0.00011492617,0.0004940836,0.00077261444,0.00084102666,0.34808078,0.0000071285217,0.64957905],"study_design_scores_gemma":[0.000314466,0.00024173291,0.000114260976,0.0006695346,0.0000034054624,0.00014770369,7.7495294e-8,0.03420497,0.004891736,0.95798844,0.00077449507,0.00064914837],"about_ca_topic_score_codex":0.000006453561,"about_ca_topic_score_gemma":0.000014355402,"teacher_disagreement_score":0.6489299,"about_ca_system_score_codex":0.000303838,"about_ca_system_score_gemma":0.00036882402,"threshold_uncertainty_score":0.99983543},"labels":[],"label_agreement":null},{"id":"W2490114670","doi":"10.1016/j.dam.2017.04.027","title":"The complexity of tropical graph homomorphisms","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Combinatorics; Graph homomorphism; Conjecture; Discrete mathematics; Constraint satisfaction problem; Vertex (graph theory); Graph; Decision problem; Line graph; Graph power; Algorithm","score_opus":0.06269867441457949,"score_gpt":0.31791921410978163,"score_spread":0.25522053969520214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490114670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013282317,0.000045438,0.956657,0.00092523964,0.0000960001,0.00039845752,0.000008243276,0.0000793472,0.028507985],"genre_scores_gemma":[0.8273069,0.000025548981,0.17247929,0.000019103347,0.000021460395,0.000039859962,9.175402e-7,0.000013054111,0.00009385504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985731,0.000024443738,0.00032597524,0.00024402441,0.0004814214,0.00035098926],"domain_scores_gemma":[0.9967044,0.00028571236,0.00033837397,0.0025032572,0.00007421875,0.00009404831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000400352,0.00014588852,0.00025631176,0.00004403205,0.00096035487,0.00027905413,0.0033779743,0.00004775319,0.000006828826],"category_scores_gemma":[0.00014531355,0.00009322778,0.00010811496,0.00011738169,0.0020986628,0.00017160889,0.000884106,0.00019355152,0.00003300547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008272797,0.000038211936,0.000027467315,0.000030455514,0.000019446854,0.0000020539553,0.00023179645,0.000003656033,0.001338993,0.99535155,0.000053534433,0.0028945378],"study_design_scores_gemma":[0.00025036064,0.00002871584,0.0014433796,0.000013576817,0.00000561781,0.000004449627,0.00010173688,0.0038976846,0.0065990402,0.98729414,0.00024559288,0.00011570001],"about_ca_topic_score_codex":0.000002273095,"about_ca_topic_score_gemma":0.00000553124,"teacher_disagreement_score":0.8140246,"about_ca_system_score_codex":0.000012618868,"about_ca_system_score_gemma":0.000028025786,"threshold_uncertainty_score":0.773261},"labels":[],"label_agreement":null},{"id":"W2498882618","doi":"10.1090/stml/061/04","title":"Graph products and classes","year":2011,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Graph; Computer science; Theoretical computer science","score_opus":0.035084098261499885,"score_gpt":0.2763680966478449,"score_spread":0.241283998386345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498882618","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004699853,0.0015394511,0.01689276,0.0007827886,0.00012881658,0.00066482095,0.0000097142365,0.000451936,0.9794827],"genre_scores_gemma":[0.0014168033,0.0009823565,0.07866168,0.00034872312,0.00020463599,0.000060683396,0.0000117874,0.00014988477,0.9181634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770766,0.000043418804,0.00039813697,0.00080605544,0.000653126,0.0003916019],"domain_scores_gemma":[0.9981104,0.00028882714,0.00013675432,0.0011822835,0.000045683802,0.0002360654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001967096,0.00040338316,0.0005030803,0.0002822695,0.00008336134,0.00026459392,0.0016888387,0.00019152791,0.00044972202],"category_scores_gemma":[0.000039808707,0.00032272504,0.00011312521,0.000113442635,0.00039013117,0.0010302922,0.0023827904,0.0005138243,0.0005485957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062429285,0.000066448396,0.00001621987,0.0002050284,0.00006802994,0.00007861417,0.0002596232,3.4076788e-8,0.0000065258632,0.99317855,0.0028798103,0.0032348859],"study_design_scores_gemma":[0.000111343645,0.00011477966,0.00004705089,0.00020464465,0.000016326843,0.000036244503,0.000006046672,0.000009130529,0.000106020714,0.96574706,0.03325888,0.00034244888],"about_ca_topic_score_codex":7.0648e-8,"about_ca_topic_score_gemma":5.5010997e-8,"teacher_disagreement_score":0.06176892,"about_ca_system_score_codex":0.000008739151,"about_ca_system_score_gemma":0.000072482624,"threshold_uncertainty_score":0.99992245},"labels":[],"label_agreement":null},{"id":"W2503340257","doi":"10.1016/j.dam.2016.12.012","title":"Dominating and irredundant broadcasts in graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Graph; Function (biology); Discrete mathematics","score_opus":0.023517136945559337,"score_gpt":0.310361409231844,"score_spread":0.2868442722862847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503340257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44361895,0.00013749364,0.5092815,0.0004580157,0.00010331643,0.000768094,0.0000045804695,0.00014681266,0.04548124],"genre_scores_gemma":[0.791067,0.00002638787,0.20875634,0.000020450772,0.000009056362,0.00004212616,5.5865723e-7,0.000013872769,0.00006421102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987301,0.0000150005635,0.00025857214,0.0003498271,0.00027823617,0.0003682242],"domain_scores_gemma":[0.99835783,0.00018420344,0.00018835996,0.0011457454,0.000025516667,0.00009835419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061067584,0.00015761337,0.00023705988,0.00014248784,0.00035140268,0.00043873704,0.0012043418,0.000050217637,0.0000037405428],"category_scores_gemma":[0.00014767428,0.00013707917,0.00003490787,0.00013365364,0.00024405489,0.00039250858,0.0008544439,0.00019530304,0.0000179023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042656216,0.000030904834,0.00015196133,0.000071371076,0.0000061385085,0.000015506295,0.002095043,0.000006239021,0.0046669515,0.9628189,0.000008020093,0.03012467],"study_design_scores_gemma":[0.0005796033,0.000020414038,0.0019304282,0.00008833549,0.0000031179682,0.0000167658,0.00043687498,0.01916036,0.0030901409,0.97439593,0.000048602444,0.00022939811],"about_ca_topic_score_codex":0.0000054704815,"about_ca_topic_score_gemma":0.000010302127,"teacher_disagreement_score":0.34744805,"about_ca_system_score_codex":0.00001828798,"about_ca_system_score_gemma":0.000019536563,"threshold_uncertainty_score":0.5589926},"labels":[],"label_agreement":null},{"id":"W25053562","doi":"10.1099/vir.0.066423-0","title":"Dimensions for Cographs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Biotechnology and Biological Sciences Research Council","keywords":"Mathematics","score_opus":0.01702045984928318,"score_gpt":0.28752908839130725,"score_spread":0.27050862854202407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25053562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93357444,0.00077785173,0.03838743,0.0020103187,0.0026131552,0.0015097763,0.0000155143,0.0010266209,0.020084906],"genre_scores_gemma":[0.9843309,0.000042985324,0.013865686,0.0002321507,0.000004932756,0.00009686552,0.0000030880049,0.000015771378,0.0014076394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988297,0.000058717702,0.00014283226,0.00034525685,0.0002255091,0.00039794156],"domain_scores_gemma":[0.9987691,0.0002888115,0.00002540527,0.0006808489,0.0000964236,0.0001393909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028606132,0.00011101269,0.00013099302,0.000107402404,0.0002480091,0.00006796482,0.00084989244,0.000047982685,0.000075846714],"category_scores_gemma":[0.00004920897,0.00010668416,0.00009872275,0.00063466735,0.00008406512,0.00033694095,0.00009867743,0.000117479685,0.00015525376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013481471,0.00006686336,0.00014138543,0.0000033089682,0.000010985578,0.0000042660495,0.00007742498,0.0000143874895,0.00026047035,0.97434694,0.0021609997,0.022899516],"study_design_scores_gemma":[0.00064030755,0.00014217613,0.000335702,0.0000069191833,0.0000026234375,0.000004866746,0.0000052733617,0.001969877,0.0013025877,0.9675924,0.027859498,0.00013775876],"about_ca_topic_score_codex":0.0000036667725,"about_ca_topic_score_gemma":8.758205e-7,"teacher_disagreement_score":0.05075645,"about_ca_system_score_codex":0.00001876356,"about_ca_system_score_gemma":0.00003411181,"threshold_uncertainty_score":0.4350454},"labels":[],"label_agreement":null},{"id":"W2507346374","doi":"10.1002/jgt.22416","title":"Bounded diameter arboricity","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arboricity; Mathematics; Combinatorics; Bounded function; Dense graph; Planar graph; Degeneracy (biology); 1-planar graph; Graph; Discrete mathematics; Biology; Chordal graph; Mathematical analysis","score_opus":0.027473957245941583,"score_gpt":0.3093677013235276,"score_spread":0.281893744077586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507346374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06859636,0.0015571077,0.92259467,0.0003675116,0.003581422,0.00023496513,0.000008833311,0.000080953905,0.0029782047],"genre_scores_gemma":[0.79420114,0.0008244918,0.20189036,0.00072049897,0.0016472649,0.000019350093,0.0000021839803,0.00009165024,0.00060306635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99549043,0.001274208,0.00094668556,0.0005467007,0.00114999,0.000591957],"domain_scores_gemma":[0.9946943,0.0008844928,0.0013632277,0.0016676937,0.0010434869,0.00034680055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006155578,0.00040923976,0.0007706175,0.0013284131,0.00018630637,0.0003875341,0.004914147,0.00033813535,0.00008536838],"category_scores_gemma":[0.00067258097,0.0003270161,0.00088185363,0.00071993546,0.00067610055,0.0006513901,0.00221951,0.0021860772,0.000041526015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046454353,0.0003775989,0.0005357553,0.00015558065,0.0007855365,0.00040258685,0.0016187734,0.0001674878,0.0009570315,0.96582425,0.0032204762,0.025490366],"study_design_scores_gemma":[0.00037648034,0.0003351024,0.00073496153,0.00020528442,0.000039389375,0.00014429222,0.000030858784,0.00018588148,0.002164511,0.9940306,0.001419383,0.0003332338],"about_ca_topic_score_codex":0.000002124601,"about_ca_topic_score_gemma":0.0000013175269,"teacher_disagreement_score":0.7256048,"about_ca_system_score_codex":0.00014353929,"about_ca_system_score_gemma":0.0004512113,"threshold_uncertainty_score":0.99991816},"labels":[],"label_agreement":null},{"id":"W2513478778","doi":"10.46298/dmtcs.2151","title":"Connected Tropical Subgraphs in Vertex-Colored Graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université Paris-Sud; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Distance-hereditary graph; Induced subgraph isomorphism problem; Graph factorization; Discrete mathematics; Vertex (graph theory); Colored; Vertex connectivity; Graph; Line graph; Graph power; Voltage graph","score_opus":0.014897976962016534,"score_gpt":0.27965574467572957,"score_spread":0.264757767713713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513478778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17342167,0.00002175083,0.8221879,0.0014894581,0.00029679728,0.00041521346,0.00000468691,0.00026682406,0.0018957029],"genre_scores_gemma":[0.80834454,0.000012710041,0.19137584,0.00017065565,0.000019390704,0.00003989916,5.146558e-7,0.000021085709,0.000015384996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99474376,0.00029092256,0.0007220947,0.0013123673,0.0014805467,0.0014502814],"domain_scores_gemma":[0.99535084,0.0018067694,0.0001405393,0.0018470703,0.0002987026,0.00055606366],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018147394,0.00040309408,0.0005387421,0.0008549923,0.000351579,0.00042745523,0.0049691834,0.00012312758,0.000116213916],"category_scores_gemma":[0.00081620977,0.00025462447,0.00019045689,0.0036006474,0.005863239,0.0012149039,0.0017522424,0.0003466296,0.00014421892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022808677,0.00014436232,0.000556741,0.00001772385,0.000008092655,0.0000497118,0.000650066,0.0000067468636,0.0047081728,0.9870759,0.000018934012,0.006740731],"study_design_scores_gemma":[0.00078651134,0.0002262379,0.002036322,0.0001477837,0.000004075339,0.00004394201,0.00002952475,0.12109009,0.0044112974,0.8708114,0.000020173604,0.0003926457],"about_ca_topic_score_codex":0.0000015281778,"about_ca_topic_score_gemma":0.000004442917,"teacher_disagreement_score":0.63492286,"about_ca_system_score_codex":0.0001157877,"about_ca_system_score_gemma":0.00017263976,"threshold_uncertainty_score":0.9999906},"labels":[],"label_agreement":null},{"id":"W2514094964","doi":"10.1007/978-3-319-50106-2_39","title":"Stack and Queue Layouts via Layered Separators","year":2016,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Book embedding; Bounded function; Planar graph; 1-planar graph; Mathematics; Vertex (graph theory); Pathwidth; Stack (abstract data type); Graph; Genus; Discrete mathematics; Queue; Chordal graph; Computer science; Line graph","score_opus":0.019318804897004098,"score_gpt":0.30960468144179637,"score_spread":0.29028587654479227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514094964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02225667,0.00072234485,0.9726558,0.0019037542,0.0016413684,0.00051781966,0.000010374439,0.00024065094,0.00005123824],"genre_scores_gemma":[0.7137004,0.00003292946,0.28554288,0.0004869217,0.00018528075,0.000028005488,0.0000011669533,0.000019356865,0.0000030907902],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944999,0.00028904172,0.00047574425,0.002426162,0.0011363223,0.0011728287],"domain_scores_gemma":[0.9950576,0.0008205237,0.00022779433,0.003202302,0.0003189903,0.00037281698],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017758531,0.0005457454,0.0005587042,0.00097541395,0.00030275824,0.00086411217,0.0070684426,0.00032306658,0.0000072162247],"category_scores_gemma":[0.00037972297,0.00042872792,0.000099738245,0.0018373637,0.0012838745,0.000899397,0.013164513,0.001153165,0.0000304258],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030196114,0.00009514421,0.004270655,0.00013539549,0.000025782652,0.00017798843,0.002445685,0.040033918,0.0037299227,0.008297208,0.00003367449,0.94072443],"study_design_scores_gemma":[0.0003040738,0.00009914588,0.0012163499,0.00021800384,0.0000019603194,0.00004545796,2.8142713e-7,0.39794624,0.011489548,0.58804774,0.00006927,0.0005619445],"about_ca_topic_score_codex":0.00003327685,"about_ca_topic_score_gemma":0.00005339971,"teacher_disagreement_score":0.9401625,"about_ca_system_score_codex":0.00027697365,"about_ca_system_score_gemma":0.0006822347,"threshold_uncertainty_score":0.9998165},"labels":[],"label_agreement":null},{"id":"W2514737704","doi":"10.1002/net.21700","title":"The Rainbow Cycle Cover Problem","year":2016,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rainbow; Mathematics; Disjoint sets; Cover (algebra); Integer programming; Combinatorics; Graph; Computer science; Algorithm","score_opus":0.009872359546378906,"score_gpt":0.2553044581065949,"score_spread":0.245432098560216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514737704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005280521,0.0003610277,0.9855279,0.0032068081,0.00025096055,0.00016600384,4.121139e-7,0.00013563583,0.009823242],"genre_scores_gemma":[0.9801818,0.00025864528,0.008746988,0.0004296705,0.00026957612,0.000058397163,2.5238288e-7,0.00001704649,0.010037589],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885595,0.000114663926,0.00011076854,0.00024161271,0.00022744933,0.00044958183],"domain_scores_gemma":[0.9984734,0.0006740296,0.000039442024,0.00067409046,0.00005696027,0.00008206986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005929814,0.00007954785,0.0000664685,0.000022471751,0.00028266513,0.000113868984,0.0011381321,0.000044152403,0.000023185905],"category_scores_gemma":[0.000043806143,0.000037861242,0.000044696804,0.00029450966,0.00014860526,0.00030028445,0.00034270808,0.00012816415,0.00020153697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015831149,0.000011594405,0.00031198384,9.881422e-7,0.000010842873,0.0000064543874,0.000044125718,0.0024505085,0.00012168815,0.4457418,0.011026394,0.54025775],"study_design_scores_gemma":[0.00062897423,0.00009315366,0.0009467613,0.000042023483,0.0000017503196,0.000014058584,0.000005288191,0.095238656,0.00028137775,0.5992912,0.30321905,0.00023770706],"about_ca_topic_score_codex":0.0000010831488,"about_ca_topic_score_gemma":0.0000030238975,"teacher_disagreement_score":0.9796538,"about_ca_system_score_codex":0.000029280365,"about_ca_system_score_gemma":0.000025801915,"threshold_uncertainty_score":0.25904173},"labels":[],"label_agreement":null},{"id":"W2515761800","doi":"10.1016/j.jctb.2017.06.004","title":"Five-list-coloring graphs on surfaces III. One list of size one and one list of size two","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Lemma (botany); Bounded function; Vertex (graph theory); Graph; Planar graph; List coloring; Discrete mathematics; Mathematical analysis","score_opus":0.028470303022839833,"score_gpt":0.30270284349428384,"score_spread":0.274232540471444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515761800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9786107,0.0021072086,0.0025190876,0.00095532206,0.01010167,0.00086802227,0.000082674436,0.000075931406,0.0046793865],"genre_scores_gemma":[0.9909414,0.0015245683,0.0060872748,0.000028882137,0.0005851532,0.000013875038,0.0000021861583,0.00006252194,0.0007541576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934824,0.0013177344,0.0018010719,0.0007533249,0.0019710776,0.00067440985],"domain_scores_gemma":[0.9866935,0.0048899553,0.0041602864,0.0020521113,0.0017970253,0.00040711384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0064207395,0.00065083976,0.0022755223,0.00050745124,0.00045835713,0.00045453044,0.0043428363,0.00042973383,0.00009648224],"category_scores_gemma":[0.0046571014,0.0006408115,0.0005835222,0.0004486339,0.001869981,0.0012613906,0.0029303615,0.0022358098,0.0000018157639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065974374,0.0010332486,0.00035150244,0.00053596287,0.0008045416,0.00007363465,0.0015752416,0.00045383323,0.013920251,0.9724919,0.000056397694,0.002106048],"study_design_scores_gemma":[0.0036586993,0.0022505212,0.0011835505,0.0017967348,0.00012755921,0.000031151652,0.00018494717,0.000055139244,0.048863377,0.94099754,0.00032761166,0.00052315625],"about_ca_topic_score_codex":0.00019036148,"about_ca_topic_score_gemma":0.000039662267,"teacher_disagreement_score":0.034943126,"about_ca_system_score_codex":0.0001799975,"about_ca_system_score_gemma":0.0006946402,"threshold_uncertainty_score":0.99960434},"labels":[],"label_agreement":null},{"id":"W2516346504","doi":"10.1016/j.jctb.2016.07.009","title":"Properties of regular graphs with large girth via local algorithms","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação de Amparo à Pesquisa do Estado do Rio Grande do Sul; Australian Research Council; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Girth (graph theory); Discrete mathematics; Upper and lower bounds","score_opus":0.009874030088849246,"score_gpt":0.23027590097219577,"score_spread":0.22040187088334653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516346504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0984369,0.0007403746,0.8977489,0.0005178684,0.0020099634,0.00020119324,0.000004287944,0.000048713802,0.000291784],"genre_scores_gemma":[0.9938647,0.00008204872,0.0055570244,0.000024977959,0.00015698593,0.000004817456,1.1861027e-7,0.000024045701,0.00028526277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971881,0.0005757804,0.0006008756,0.00023425491,0.0009530191,0.00044800484],"domain_scores_gemma":[0.9973837,0.0002363169,0.00057922007,0.00062965066,0.0009732821,0.00019784035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023819704,0.00022357692,0.00050532486,0.0003082407,0.00014238167,0.00005344323,0.0014726879,0.000092317365,0.000028746012],"category_scores_gemma":[0.00019265077,0.00011891636,0.0001798623,0.0005981693,0.00083916815,0.0019012765,0.0002760806,0.0002746182,0.0000045055417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022712264,0.00018981655,0.00011410417,0.000028235954,0.00013005234,0.00007324385,0.0003869812,0.000010179758,0.017891541,0.96231973,0.00004629474,0.016538564],"study_design_scores_gemma":[0.0023477417,0.0021513742,0.000063114036,0.00022826287,0.000014280988,0.00024030927,0.00018454492,0.00002577498,0.17799348,0.81401986,0.0025499256,0.00018131183],"about_ca_topic_score_codex":0.0000010569704,"about_ca_topic_score_gemma":7.7195926e-7,"teacher_disagreement_score":0.8954278,"about_ca_system_score_codex":0.00006435217,"about_ca_system_score_gemma":0.00020548148,"threshold_uncertainty_score":0.48492682},"labels":[],"label_agreement":null},{"id":"W2516383456","doi":"10.1002/rsa.20743","title":"Arboricity and spanning‐tree packing in random graphs","year":2017,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Arboricity; Combinatorics; Mathematics; Random graph; Graph; Disjoint sets; Spanning tree; Minimum spanning tree; Degeneracy (biology); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Planar graph","score_opus":0.018074560900552906,"score_gpt":0.2960829136122864,"score_spread":0.27800835271173346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516383456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837275,0.003799309,0.20856413,0.0008113861,0.0005935535,0.0007367277,0.000010901177,0.00011936145,0.0016371232],"genre_scores_gemma":[0.98289055,0.00050834124,0.016400632,0.00005286287,0.000076127064,0.00001449571,9.2316134e-7,0.000011653586,0.000044397413],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838823,0.00012675644,0.00022429503,0.0005381233,0.00028657698,0.00043602329],"domain_scores_gemma":[0.99867636,0.000314851,0.0001402321,0.00066316954,0.000047771093,0.0001576356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068658165,0.00021315344,0.00040771454,0.00019409155,0.0006571117,0.0006096128,0.00073999714,0.00008261032,0.00000457225],"category_scores_gemma":[0.00025677079,0.00016604921,0.00006423386,0.00014799349,0.00034434153,0.00063906267,0.000496399,0.00031441302,5.885253e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007905494,0.000031332103,0.0330611,0.00006847054,0.00007106827,0.00024794773,0.0014777137,0.00009656852,0.0012925623,0.18853915,0.000046908604,0.7742766],"study_design_scores_gemma":[0.022728236,0.0000935418,0.20687695,0.00006936167,0.000010853124,0.00008647715,0.00006389213,0.028910479,0.0012716731,0.73890054,0.00053831504,0.0004496904],"about_ca_topic_score_codex":0.0001297932,"about_ca_topic_score_gemma":0.00005036482,"teacher_disagreement_score":0.77382696,"about_ca_system_score_codex":0.0000121541725,"about_ca_system_score_gemma":0.000025182637,"threshold_uncertainty_score":0.67712903},"labels":[],"label_agreement":null},{"id":"W2517590891","doi":"10.1109/candar.2015.10","title":"A Practical Algorithm for Embedding Graphs on Torus","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Torus; Embedding; Time complexity; Exponential function; Computer science; Graph embedding; Algorithm; Graph; Implementation; Exponential growth; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.10039724446471492,"score_gpt":0.4175264391665561,"score_spread":0.31712919470184114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517590891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024403371,0.0000106722255,0.98946023,0.0014175901,0.00024677784,0.00024442776,0.0000015780012,0.00017985557,0.008194856],"genre_scores_gemma":[0.013514554,0.0000020000182,0.9845445,0.00044551998,0.00005507344,0.00006223786,9.0579647e-7,0.000010147294,0.0013650742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876934,0.00006208644,0.000111230234,0.00033240864,0.00036734866,0.0003576074],"domain_scores_gemma":[0.9986267,0.0004919067,0.000029016961,0.00044156378,0.00016718151,0.00024362312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006823885,0.00009172719,0.000101602,0.00013055062,0.00008097756,0.000107296124,0.00046699742,0.000040646166,0.000008765601],"category_scores_gemma":[0.00037380424,0.00007380726,0.000058229365,0.00033719762,0.00004605582,0.00052202016,0.00017072904,0.00012770802,0.00009398069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016319562,0.00005807072,0.0000069408634,0.0000012499047,0.000009091672,0.000013409985,0.00008821792,0.000030403618,0.000034063865,0.8701977,0.007812229,0.121732295],"study_design_scores_gemma":[0.00067428953,0.00060171145,0.000008988277,0.000005921797,0.0000023168836,0.000030396535,0.000110906956,0.4868282,0.002760115,0.49062505,0.018182948,0.00016915679],"about_ca_topic_score_codex":0.0000031437403,"about_ca_topic_score_gemma":0.0000010941759,"teacher_disagreement_score":0.4867978,"about_ca_system_score_codex":0.000043601172,"about_ca_system_score_gemma":0.00009448779,"threshold_uncertainty_score":0.3009773},"labels":[],"label_agreement":null},{"id":"W2519651985","doi":"10.1016/j.jctb.2017.05.006","title":"Layered separators in minor-closed graph classes with applications","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Mathematics; Combinatorics; Graph; Minor (academic); Discrete mathematics; Humanities","score_opus":0.015371805154149988,"score_gpt":0.29770729704332677,"score_spread":0.2823354918891768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519651985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66246855,0.00094483764,0.30698738,0.002384416,0.0057221167,0.0013979077,0.000011466569,0.0001515156,0.019931821],"genre_scores_gemma":[0.9933226,0.0000607751,0.0061094095,0.000029779481,0.00022946214,0.000025103871,3.4798356e-7,0.000016802212,0.0002057004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998093,0.0003287971,0.000453308,0.00023585474,0.0005427398,0.0003462841],"domain_scores_gemma":[0.9972307,0.00035508475,0.0007297004,0.0010685099,0.00043651,0.0001794899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015506465,0.00018836757,0.00038493265,0.0003392368,0.0004436316,0.0003998016,0.002604816,0.000086767046,0.000014707251],"category_scores_gemma":[0.00026886925,0.00014674153,0.00011431231,0.0004127005,0.0004664055,0.002331081,0.00025658731,0.00045729545,0.000006970436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008212189,0.0001463821,0.0024574143,0.000011418745,0.000048981008,0.00008712111,0.0002347463,0.000053283165,0.00071622065,0.9927591,0.00007306963,0.00259104],"study_design_scores_gemma":[0.0019259455,0.00063944055,0.003263188,0.000048625177,0.000008457613,0.00010102637,0.0001668205,0.000012897645,0.0052000037,0.9801695,0.00827277,0.00019136602],"about_ca_topic_score_codex":0.0000032443281,"about_ca_topic_score_gemma":0.000008851009,"teacher_disagreement_score":0.33085406,"about_ca_system_score_codex":0.000066436,"about_ca_system_score_gemma":0.0002633198,"threshold_uncertainty_score":0.5983946},"labels":[],"label_agreement":null},{"id":"W2519804096","doi":"10.4230/lipics.itcs.2017.1","title":"A QPTAS for Facility Location on Unit Disk Graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Intersection graph; Mathematics; Bounded function; Conjecture; Graph; Planar graph; Vertex (graph theory); Discrete mathematics; Line graph","score_opus":0.1243178623298497,"score_gpt":0.2416566583914334,"score_spread":0.1173387960615837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519804096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06964377,0.000028197295,0.92738897,0.00018652678,0.00034445943,0.00077595096,0.00016144344,0.00025616123,0.0012145317],"genre_scores_gemma":[0.99666977,0.00005813524,0.0009832004,0.000057383935,0.000030465997,0.00000943242,0.00003195869,0.0000144247915,0.002145213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749506,0.00024430724,0.0001858816,0.0014192228,0.000151437,0.0005040696],"domain_scores_gemma":[0.9966291,0.00047430696,0.00019039566,0.002046941,0.0004420641,0.00021716738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052217115,0.0003230732,0.0002923359,0.00046785534,0.00025194397,0.00008561713,0.0024470815,0.0002510065,0.000017642486],"category_scores_gemma":[0.00016350596,0.0003115684,0.00025542028,0.00082615623,0.0002518463,0.00041563725,0.0013731851,0.0004590013,0.00016061997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001546239,0.000095510106,0.00096348074,0.000093309274,0.000060669783,0.00002629276,0.00007417721,0.017618645,0.000050856994,0.9765914,0.00013824757,0.0041327756],"study_design_scores_gemma":[0.0006320422,0.00014364475,0.00089880795,0.00009839597,0.00001975589,9.1430786e-7,0.000024634732,0.044640075,0.00048654567,0.9512481,0.0013998025,0.00040726244],"about_ca_topic_score_codex":0.000019089766,"about_ca_topic_score_gemma":0.00001548906,"teacher_disagreement_score":0.92702603,"about_ca_system_score_codex":0.00020601196,"about_ca_system_score_gemma":0.00022035798,"threshold_uncertainty_score":0.99993366},"labels":[],"label_agreement":null},{"id":"W2521832422","doi":"10.23638/lmcs-13(1:1)2017","title":"Logical compactness and constraint satisfaction problems","year":2017,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compact space; Constraint satisfaction problem; Constraint (computer-aided design); Mathematics; Axiom; Hierarchy; Ultrafilter; Local consistency; Constraint satisfaction; Constraint logic programming; Discrete mathematics; Pure mathematics; Probabilistic logic; Statistics","score_opus":0.1790849006281343,"score_gpt":0.4639551405760599,"score_spread":0.2848702399479256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521832422","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016022667,0.000310453,0.9792175,0.00083643524,0.0018478938,0.00082303653,0.0000047715703,0.00023896227,0.00069826207],"genre_scores_gemma":[0.32129094,0.00007662131,0.6783199,0.0001506272,0.0000917353,0.000053866515,7.3649346e-7,0.000008600442,0.0000070312503],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928744,0.0015294931,0.00070495455,0.0026692264,0.0010903911,0.0011315289],"domain_scores_gemma":[0.9946309,0.0016422998,0.0004587317,0.002429613,0.0003078025,0.00053067197],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.010213622,0.000536696,0.0009189717,0.0006489702,0.0006960686,0.0020501628,0.005725055,0.00042970033,0.000013830608],"category_scores_gemma":[0.0010700162,0.0004242634,0.00013733242,0.0008206278,0.005080994,0.0010062362,0.013189898,0.0021741479,0.000008929011],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009567154,0.00008199122,0.003290958,0.00008233535,0.000008056617,0.00008414413,0.0003276451,0.0071222167,0.0010937677,0.14069952,0.000005385978,0.84719443],"study_design_scores_gemma":[0.00023913907,0.00014432157,0.06161649,0.00017945767,0.000002582379,0.00010760495,0.0000037503844,0.37528655,0.00034221137,0.56158704,0.0000636735,0.0004271979],"about_ca_topic_score_codex":0.00006564135,"about_ca_topic_score_gemma":0.000012539849,"teacher_disagreement_score":0.8467672,"about_ca_system_score_codex":0.00024063274,"about_ca_system_score_gemma":0.0004090697,"threshold_uncertainty_score":0.99982095},"labels":[],"label_agreement":null},{"id":"W2522164511","doi":"10.1007/s00373-018-1964-y","title":"Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Regina; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Line graph; Upper and lower bounds; Set (abstract data type); Line (geometry); Graph power","score_opus":0.017773008886015833,"score_gpt":0.2793316129552443,"score_spread":0.26155860406922843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522164511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98062575,0.0010635987,0.015714677,0.00012245859,0.00031695364,0.00021336746,0.000007841709,0.00013129103,0.0018040752],"genre_scores_gemma":[0.99590695,0.0010389253,0.002797145,0.0001049898,0.000010349985,0.00001167683,0.0000017352894,0.000025376828,0.00010282565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802953,0.00012053233,0.00035376626,0.0006325539,0.000333207,0.00053038273],"domain_scores_gemma":[0.99837834,0.00030538428,0.00016009541,0.0005996989,0.00028342876,0.00027304052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000717347,0.00030721803,0.00040370453,0.00025663117,0.00045587728,0.00019161744,0.0005246199,0.00013786508,0.000008983465],"category_scores_gemma":[0.000062099156,0.00025862124,0.00009041679,0.0014349278,0.000751519,0.0006661124,0.00065176445,0.00032186607,0.0000035289477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020422312,0.000061814295,0.0714749,0.000054884833,0.000040918065,0.000005925509,0.0011168047,3.5585478e-7,0.00051109976,0.914929,0.000092777096,0.01169111],"study_design_scores_gemma":[0.0007843784,0.00021424201,0.007334566,0.00006420195,0.000010900205,0.0000952778,0.00016172035,0.0012397369,0.002629385,0.9867805,0.00038044705,0.00030461716],"about_ca_topic_score_codex":0.00006182706,"about_ca_topic_score_gemma":0.000008472935,"teacher_disagreement_score":0.071851544,"about_ca_system_score_codex":0.000010936055,"about_ca_system_score_gemma":0.000028963268,"threshold_uncertainty_score":0.9999866},"labels":[],"label_agreement":null},{"id":"W2522691152","doi":"10.33915/etd.3559","title":"Cycles, Disjoint Spanning Trees and Orientations of Graphs","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Connectivity; Path graph; Discrete mathematics; Graph power; Vertex (graph theory); Line graph; Graph","score_opus":0.023836266989896025,"score_gpt":0.32880651674925776,"score_spread":0.3049702497593617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522691152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56790525,0.005224778,0.34958714,0.00019645739,0.0015794529,0.0010437478,0.00003262383,0.00040307097,0.07402747],"genre_scores_gemma":[0.9524805,0.00012015553,0.0410015,0.000011007065,0.000024931687,0.000037202033,0.00010988681,0.000021210357,0.006193642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988361,0.000053680553,0.00024294449,0.0003013189,0.00031472903,0.00025124796],"domain_scores_gemma":[0.99906266,0.0001417115,0.00014757743,0.0004093406,0.00012944658,0.00010929443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020553306,0.00015416446,0.00021306115,0.0003695242,0.00010589381,0.00004814388,0.00045024077,0.000087489076,0.000034718334],"category_scores_gemma":[0.000046855504,0.00013534467,0.000069467766,0.00047533977,0.00007027897,0.00048099566,0.00009299751,0.00017734813,0.000007333296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014043692,0.000049783015,0.0020434405,0.00007949408,0.00003338112,0.000001723843,0.0027126991,0.000008641345,0.0031364812,0.9384901,0.00010316784,0.05332705],"study_design_scores_gemma":[0.0006403673,0.00020263472,0.39916253,0.0002906167,0.000060390037,0.000014014338,0.0045061493,0.0014650362,0.02570087,0.5661976,0.0009012061,0.0008586102],"about_ca_topic_score_codex":0.000054569267,"about_ca_topic_score_gemma":0.0002468617,"teacher_disagreement_score":0.39711908,"about_ca_system_score_codex":0.000011667421,"about_ca_system_score_gemma":0.00004683043,"threshold_uncertainty_score":0.5519195},"labels":[],"label_agreement":null},{"id":"W2526410593","doi":"10.1002/jgt.20448","title":"Coloring plane graphs with independent crossings","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Plane (geometry); Graph; Discrete mathematics; Geometry","score_opus":0.013184250265308796,"score_gpt":0.271164064961363,"score_spread":0.25797981469605424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526410593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6022644,0.00095458044,0.3922083,0.00058568356,0.00031509085,0.00015042882,0.0000013557409,0.00007833996,0.0034418406],"genre_scores_gemma":[0.98212487,0.000065340806,0.017208148,0.00034513892,0.000060833318,0.0000013834692,2.0914193e-7,0.000011777657,0.00018231239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977866,0.00024754737,0.00042996262,0.00024319856,0.0008421805,0.00045051132],"domain_scores_gemma":[0.99823934,0.00029766595,0.00043689183,0.00045619486,0.00031726446,0.00025264575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002317952,0.0001909171,0.0003166142,0.00076088536,0.00025302,0.00025048392,0.0014649453,0.00006963539,0.000016385373],"category_scores_gemma":[0.000084347834,0.00013498348,0.00017575103,0.0009819337,0.00025241356,0.0011522803,0.00008370263,0.0006481104,0.0000062539825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009063311,0.00017826747,0.001449347,0.000008887542,0.00009290435,0.0006947861,0.0010059016,0.00028614645,0.0066252444,0.9537409,0.00016296278,0.03484834],"study_design_scores_gemma":[0.0011636997,0.0016261925,0.010483277,0.000105988205,0.000014987511,0.00129774,0.00015253681,0.00003771741,0.0058325725,0.97837245,0.0006943244,0.00021851613],"about_ca_topic_score_codex":8.802532e-7,"about_ca_topic_score_gemma":0.0000013216827,"teacher_disagreement_score":0.37986046,"about_ca_system_score_codex":0.000046546378,"about_ca_system_score_gemma":0.00013042866,"threshold_uncertainty_score":0.5504466},"labels":[],"label_agreement":null},{"id":"W2527528646","doi":"10.5539/jmr.v8n5p101","title":"Even Star Decomposition of Complete Bipartite Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Span (engineering); Font; Life span; Art; Biology","score_opus":0.12643192132662556,"score_gpt":0.4262276552944801,"score_spread":0.2997957339678545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527528646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40038797,0.000265973,0.59644645,0.0018088487,0.00011467147,0.00023769018,0.000009738171,0.00001784622,0.00071081775],"genre_scores_gemma":[0.82049185,0.00023178858,0.17900988,0.000010440894,0.000045503224,0.000004870353,1.85201e-7,0.000016990753,0.0001885082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960726,0.0005049377,0.0007559758,0.00016658092,0.002024195,0.00047569766],"domain_scores_gemma":[0.9948167,0.002227604,0.00040881833,0.0006532575,0.0016743602,0.00021922211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006487344,0.0001073295,0.00034345058,0.001043872,0.00012062752,0.000066479995,0.0018260257,0.00005467255,0.00006146828],"category_scores_gemma":[0.0007544905,0.00006574058,0.00016977223,0.0009325915,0.00033597468,0.00068798935,0.000415382,0.0003740169,0.000059654427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008494018,0.0005489415,0.00035225312,0.00020826457,0.000110622634,0.00007726002,0.0010806781,0.000028264873,0.4634771,0.5198694,0.0012244488,0.012937845],"study_design_scores_gemma":[0.00086165103,0.0008402628,0.0006303832,0.0005824843,0.0000056162053,0.00017463625,0.00014923651,0.0025787994,0.050950266,0.94204897,0.0010551073,0.00012257602],"about_ca_topic_score_codex":0.000002085321,"about_ca_topic_score_gemma":0.000002065825,"teacher_disagreement_score":0.4221796,"about_ca_system_score_codex":0.00009356703,"about_ca_system_score_gemma":0.00017506038,"threshold_uncertainty_score":0.33932403},"labels":[],"label_agreement":null},{"id":"W2527693017","doi":"10.1002/jgt.20057","title":"Disjoint clique cutsets in graphs without long holes","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Dayton","keywords":"Combinatorics; Mathematics; Complete bipartite graph; Cograph; Split graph; Discrete mathematics; Clique graph; Disjoint sets; Block graph; Vertex (graph theory); Separable space; Clique problem; Clique-sum; Bipartite graph; Chordal graph; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.015483659464262872,"score_gpt":0.3015029554822439,"score_spread":0.286019296017981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527693017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.536603,0.0021704189,0.45801523,0.0013342524,0.00031160272,0.0001861494,0.000001796814,0.000052728883,0.0013248711],"genre_scores_gemma":[0.979821,0.0003794563,0.019209323,0.000337681,0.00010611476,0.00000520706,2.893995e-7,0.000021652604,0.00011924168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701095,0.00075241004,0.00075536984,0.00029557603,0.00064385467,0.0005418374],"domain_scores_gemma":[0.99801797,0.0004493612,0.00043633132,0.00060339435,0.00023176112,0.00026117344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043319496,0.00022254568,0.00041865715,0.0013925778,0.00010732986,0.00011258617,0.0016896465,0.00009667062,0.000027130842],"category_scores_gemma":[0.00025074006,0.00017669146,0.00032690604,0.0011460305,0.0003952069,0.0014772628,0.00023278207,0.0008447733,0.000020585456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002703665,0.00027978088,0.023273177,0.000017873583,0.000061776256,0.000260795,0.0011085115,0.00079921016,0.0017072059,0.90121186,0.00012593564,0.070883505],"study_design_scores_gemma":[0.001005749,0.00025774274,0.02231032,0.00016290804,0.0000085081365,0.00044130546,0.0001275731,0.000323832,0.003961987,0.9706259,0.00052859145,0.00024557838],"about_ca_topic_score_codex":0.0000016798735,"about_ca_topic_score_gemma":0.000027723858,"teacher_disagreement_score":0.44321808,"about_ca_system_score_codex":0.00008182391,"about_ca_system_score_gemma":0.00011987781,"threshold_uncertainty_score":0.7205269},"labels":[],"label_agreement":null},{"id":"W2528053456","doi":"10.1002/jgt.10006","title":"Even‐hole‐free graphs part I: Decomposition theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Joins; Mathematics; Combinatorics; Star (game theory); Decomposition theorem; Robertson–Seymour theorem; Discrete mathematics; Graph; Decomposition; 1-planar graph; Chordal graph; Computer science; Chemistry","score_opus":0.018466310932835055,"score_gpt":0.29944446350443865,"score_spread":0.2809781525716036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528053456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17901663,0.0023512323,0.8037664,0.0016750006,0.0011616307,0.00024383616,0.000007074742,0.0001398031,0.011638359],"genre_scores_gemma":[0.9811466,0.0009006363,0.016831212,0.00050358917,0.00026119244,0.0000076909855,0.0000014657043,0.00003428507,0.00031338443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965494,0.00094107114,0.0007204508,0.00032117256,0.0008942619,0.0005736211],"domain_scores_gemma":[0.9967396,0.000768889,0.00055876793,0.0011219821,0.0004790126,0.0003317426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041916384,0.00025516484,0.00039183756,0.0010110716,0.00028439233,0.00016039726,0.0029711325,0.00010916659,0.00011189696],"category_scores_gemma":[0.0003072766,0.00020469743,0.00050614605,0.0014679213,0.00035544336,0.001419766,0.00032823574,0.0006579448,0.000034559947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003724126,0.00017741242,0.00069353456,0.000007881063,0.00010534765,0.00031743819,0.00024851217,0.00017260699,0.002876887,0.9671648,0.0012969413,0.026566194],"study_design_scores_gemma":[0.0009727423,0.0004459059,0.0010953078,0.000091690505,0.000022258608,0.001022217,0.00016146693,0.00013301046,0.0023698185,0.9891744,0.004278603,0.00023252986],"about_ca_topic_score_codex":8.9211073e-7,"about_ca_topic_score_gemma":0.0000022141612,"teacher_disagreement_score":0.8021299,"about_ca_system_score_codex":0.00005839813,"about_ca_system_score_gemma":0.00009630707,"threshold_uncertainty_score":0.8347319},"labels":[],"label_agreement":null},{"id":"W2531764386","doi":"","title":"23rd International Workshop on Combinatorial Algorithms (IWOCA 2012)","year":2013,"lang":"en","type":"article","venue":"Murdoch Research Repository (Murdoch University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tamil; Situated; Volume (thermodynamics); Algorithm; Computer science; Library science; Geography; Mathematics; Artificial intelligence; Physics; Art","score_opus":0.042445367253699066,"score_gpt":0.30941762524805416,"score_spread":0.2669722579943551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531764386","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13075846,0.00042616064,0.11998733,0.009437527,0.011429331,0.0038240494,0.000023016062,0.0016978851,0.7224162],"genre_scores_gemma":[0.8386799,0.00022012899,0.008498694,0.00015323453,0.0014025808,0.00006486891,0.000022950357,0.00008975508,0.15086786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9924004,0.001362747,0.0003847434,0.001414562,0.0028866823,0.001550828],"domain_scores_gemma":[0.9939704,0.001340751,0.00014234052,0.0019180187,0.0018113876,0.00081712997],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001349662,0.00039097166,0.00036436247,0.0022879476,0.0013365013,0.0009966174,0.0057924786,0.00029165324,0.00027378328],"category_scores_gemma":[0.00038715682,0.0004097621,0.00024219588,0.0031059254,0.00077226164,0.0033555357,0.0022753554,0.0018408119,0.0013347263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003532495,0.00090152054,0.0007221429,0.00003350727,0.00025109286,0.0021004116,0.000602405,0.00024015633,0.014049149,0.91462404,0.028043931,0.038078386],"study_design_scores_gemma":[0.008387742,0.002333313,0.007192076,0.0005201035,0.000030435544,0.00030047147,0.0026379942,0.04292691,0.040275294,0.13353808,0.75915253,0.0027050572],"about_ca_topic_score_codex":0.00029842491,"about_ca_topic_score_gemma":0.000008269978,"teacher_disagreement_score":0.78108597,"about_ca_system_score_codex":0.0010051876,"about_ca_system_score_gemma":0.00045157064,"threshold_uncertainty_score":0.99996364},"labels":[],"label_agreement":null},{"id":"W2544865958","doi":"10.1016/j.ejc.2019.04.001","title":"Graph homomorphisms via vector colorings","year":2019,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; National Research Foundation Singapore","keywords":"Combinatorics; Mathematics; Bipartite graph; Homomorphism; Graph homomorphism; Graph; Discrete mathematics; Multipartite; Unit vector; Graph power; Line graph","score_opus":0.024339746574552523,"score_gpt":0.2597267797700776,"score_spread":0.23538703319552506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544865958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036791027,0.0023830459,0.9361773,0.00067477435,0.009851294,0.00039313783,0.00000681349,0.00013971377,0.01358288],"genre_scores_gemma":[0.99032575,0.0004150042,0.008138992,0.00011087549,0.00022082624,0.000002172982,0.000002187369,0.00009406513,0.00069014914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99502033,0.0014068122,0.0010545674,0.0005526746,0.0013810154,0.00058458484],"domain_scores_gemma":[0.9949109,0.0003338523,0.0015758222,0.0015926453,0.0011731971,0.00041355757],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003700087,0.00045449362,0.0007770688,0.0008351917,0.00013861521,0.0003886264,0.006090207,0.00011358173,0.000016818247],"category_scores_gemma":[0.0002590936,0.00042505155,0.00053764536,0.0008713172,0.000159345,0.0005367177,0.0033590735,0.0028444193,0.00022906723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016746816,0.0006957295,0.0010088236,0.000370481,0.0004792261,0.005283959,0.00089497614,0.005441912,0.0010451825,0.96785194,0.0049591227,0.011801184],"study_design_scores_gemma":[0.0027617102,0.002415076,0.006019921,0.00069429853,0.00007925857,0.0008664815,0.00003224759,0.0018560486,0.001883994,0.95254207,0.029582711,0.001266176],"about_ca_topic_score_codex":8.248301e-7,"about_ca_topic_score_gemma":5.9556626e-8,"teacher_disagreement_score":0.9535347,"about_ca_system_score_codex":0.00022524869,"about_ca_system_score_gemma":0.00034372183,"threshold_uncertainty_score":0.9998201},"labels":[],"label_agreement":null},{"id":"W2544933647","doi":"10.1007/978-3-319-48749-6_12","title":"Fast Searching on Complete k-partite Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Bipartite graph; Combinatorics; Computer science; Complete bipartite graph; Upper and lower bounds; Discrete mathematics; Graph; Mathematics","score_opus":0.03263267048262919,"score_gpt":0.29235206204778147,"score_spread":0.2597193915651523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544933647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009482793,0.00016767916,0.9804228,0.0012973613,0.0011515204,0.0005052711,0.000020050507,0.00026450178,0.016075965],"genre_scores_gemma":[0.33338362,0.00021169733,0.65378505,0.0058591035,0.001372683,0.00006639374,0.000011704804,0.00025927124,0.0050504617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933601,0.00013150739,0.0005579738,0.0023672658,0.0021326786,0.0014505006],"domain_scores_gemma":[0.9947708,0.0015991733,0.00025931117,0.0026552202,0.00030528023,0.0004102056],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001729545,0.000708592,0.0006420008,0.0020847733,0.0005684551,0.0006585955,0.0065316353,0.0002655494,0.000048497324],"category_scores_gemma":[0.00017030186,0.0005544763,0.00023503383,0.0010244708,0.001859369,0.00088302454,0.0026238675,0.0015385533,0.000430091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001468188,0.000018456405,0.00002833597,0.000018759582,0.000010233261,0.0001174188,0.00023544219,0.0054638702,0.00057785853,0.43560097,0.000011297019,0.5579027],"study_design_scores_gemma":[0.00035825532,0.00036128,0.00008928115,0.00072101457,0.0000026518228,0.000056676643,8.789533e-8,0.075072706,0.0013617533,0.9185855,0.0026097973,0.00078103575],"about_ca_topic_score_codex":0.0000045932093,"about_ca_topic_score_gemma":0.000024713043,"teacher_disagreement_score":0.55712163,"about_ca_system_score_codex":0.00035667807,"about_ca_system_score_gemma":0.00042726612,"threshold_uncertainty_score":0.99969065},"labels":[],"label_agreement":null},{"id":"W2550083616","doi":"10.1016/j.disc.2016.11.001","title":"On 2-limited packings of complete grid graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Grid; Discrete mathematics; Geometry","score_opus":0.03446265618759715,"score_gpt":0.29242364559519884,"score_spread":0.2579609894076017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550083616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081036985,0.000024645587,0.911792,0.00078553514,0.00014601059,0.00028420077,0.000051116866,0.00016836761,0.0057111415],"genre_scores_gemma":[0.91889524,0.000021919619,0.08057286,0.000111023546,0.000019818843,0.000019352494,0.0000025900863,0.00002809563,0.00032908565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840915,0.00007047477,0.00034724767,0.00029214757,0.0005322222,0.0003487595],"domain_scores_gemma":[0.99761766,0.0008972894,0.00019458537,0.0010622503,0.00012381724,0.00010441194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041320067,0.00016712968,0.0002706052,0.00021856195,0.000071674345,0.000037596055,0.0011169713,0.00004532334,0.00004090604],"category_scores_gemma":[0.00033864647,0.000100702724,0.00012905206,0.00049884146,0.00022107355,0.00025050677,0.00028128596,0.00009506051,0.00011696455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009034395,0.000056052508,0.000060370443,0.00005054711,0.000020203712,0.0000051923594,0.00043125558,0.000004930049,0.01042171,0.9858511,0.00026252173,0.0028270893],"study_design_scores_gemma":[0.00043076614,0.00019135301,0.00019269915,0.00023362742,0.0000049748883,0.0000078280145,0.000041672818,0.0027633603,0.013127281,0.98242044,0.0003958,0.00019018193],"about_ca_topic_score_codex":0.000001073195,"about_ca_topic_score_gemma":7.435739e-7,"teacher_disagreement_score":0.83785826,"about_ca_system_score_codex":0.00002215829,"about_ca_system_score_gemma":0.000018883979,"threshold_uncertainty_score":0.41065377},"labels":[],"label_agreement":null},{"id":"W2550851713","doi":"10.1002/jgt.22414","title":"Generating near‐bipartite bricks","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Brick; Vertex (graph theory); Mathematics; Complete bipartite graph; Matching (statistics); Graph; Discrete mathematics; Composite material; Materials science","score_opus":0.02844527706474328,"score_gpt":0.31266091903551524,"score_spread":0.284215641970772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550851713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12721822,0.0036597764,0.8640412,0.000337574,0.0028934781,0.00021550883,0.0000065900063,0.00008424327,0.0015434168],"genre_scores_gemma":[0.55361474,0.0007117568,0.4411762,0.0009682718,0.0025362917,0.000021372562,0.0000036077586,0.00011610828,0.00085163646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558884,0.001182114,0.0010402522,0.0005321719,0.001042648,0.00061396457],"domain_scores_gemma":[0.99518454,0.0005829617,0.001421381,0.0014020636,0.0010640483,0.00034501642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0063487184,0.00038564,0.0006766978,0.0007480879,0.00035056158,0.0006884507,0.003948884,0.00029258634,0.00008139278],"category_scores_gemma":[0.00061635993,0.00032386027,0.0007099792,0.0006612644,0.0005985339,0.0006476096,0.0022198125,0.0020112297,0.00004635699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007713554,0.0006098633,0.0018110387,0.00041933008,0.0017190399,0.0013619054,0.007374672,0.030635038,0.009712154,0.74980104,0.013507412,0.18227713],"study_design_scores_gemma":[0.0003865044,0.00030960146,0.00022781118,0.00034377194,0.00003560033,0.00030041332,0.00004547485,0.0073719546,0.0019122069,0.9863565,0.0023235735,0.0003865814],"about_ca_topic_score_codex":0.000002360513,"about_ca_topic_score_gemma":0.0000014503856,"teacher_disagreement_score":0.42639652,"about_ca_system_score_codex":0.000091908114,"about_ca_system_score_gemma":0.00057170057,"threshold_uncertainty_score":0.9999213},"labels":[],"label_agreement":null},{"id":"W2552451242","doi":"10.1017/cbo9780511977152","title":"Iterative Methods in Combinatorial Optimization","year":2011,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Variety (cybernetics); Combinatorial optimization; Computer science; Mathematical optimization; Optimization problem; Theoretical computer science; Simple (philosophy); Mathematics; Algorithm; Artificial intelligence; Discrete mathematics","score_opus":0.03728163721373292,"score_gpt":0.28791957560492315,"score_spread":0.25063793839119025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552451242","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.4847275e-7,0.000042112384,0.46734184,0.0000026131138,0.00035912514,0.00030040726,0.000015554344,0.000090301044,0.5318471],"genre_scores_gemma":[0.000014382941,0.00003170111,0.13595685,0.00002087262,0.0000608605,0.0000026867156,0.000023509756,0.000027591812,0.86386156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754965,0.00074464915,0.00022329036,0.00076602015,0.0003041286,0.00041225608],"domain_scores_gemma":[0.998126,0.00029540298,0.00021537878,0.0009293541,0.00026736228,0.00016651854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005070502,0.00033411346,0.00043866926,0.0006027622,0.0001473162,0.000089346366,0.002028415,0.00037735963,0.0000028001998],"category_scores_gemma":[0.00004709908,0.0004067055,0.0001421342,0.00008775441,0.0002564871,0.00047508712,0.0012986296,0.0007935988,0.0000062120453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007308705,0.000023611534,7.2993555e-7,0.00003209193,0.000038245147,0.0002193324,0.00025195547,0.00027123684,0.000015198367,0.9926362,0.0043940106,0.0020443117],"study_design_scores_gemma":[0.0029590111,0.00029393611,0.000009463404,0.00032134668,0.00005923438,0.000021827153,0.00003726207,0.034359965,0.0023760363,0.0054589123,0.95271736,0.0013856123],"about_ca_topic_score_codex":0.000035563025,"about_ca_topic_score_gemma":5.3031266e-7,"teacher_disagreement_score":0.98717725,"about_ca_system_score_codex":0.0005164369,"about_ca_system_score_gemma":0.00042079279,"threshold_uncertainty_score":0.9998385},"labels":[],"label_agreement":null},{"id":"W2554213973","doi":"10.5555/3192424.3192432","title":"Tradeoffs between density and size in extracting dense subgraphs: a unified framework","year":2016,"lang":"en","type":"article","venue":"Advances in Social Networks Analysis and Mining","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Range (aeronautics); Maximization; Quadratic equation; Generalization; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.018226966470228687,"score_gpt":0.3146003937833189,"score_spread":0.2963734273130902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554213973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5731259,0.002030222,0.4244656,0.00017799951,0.000033113527,0.00006506529,7.373851e-7,0.000024568079,0.00007678027],"genre_scores_gemma":[0.9740313,0.002095978,0.023648383,0.000053361127,0.00013158609,0.000010672032,6.9111763e-7,0.00000962392,0.000018368155],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979426,0.00029443734,0.0003871799,0.0006097839,0.00022759284,0.00053838023],"domain_scores_gemma":[0.99587536,0.0035741257,0.0001727008,0.0002294774,0.000042557345,0.00010576475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011820674,0.0001825301,0.000513255,0.00029221651,0.00027833227,0.00009541255,0.00031486643,0.00015679121,0.0000038952107],"category_scores_gemma":[0.00036170954,0.00015048787,0.00009878787,0.0027779988,0.00024315818,0.000884432,0.0002153254,0.00032699757,2.2820666e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002265338,0.000014878992,0.68035865,0.000005424247,0.000071603965,0.000029103203,0.001265269,0.00039366004,0.000036161167,0.013433031,0.0000011130749,0.30436844],"study_design_scores_gemma":[0.0010493114,0.000077225544,0.8186008,0.00025857612,0.00014756656,0.0000046034756,0.0015207019,0.015788827,0.000067462934,0.1615176,0.0002959221,0.000671429],"about_ca_topic_score_codex":0.000021314934,"about_ca_topic_score_gemma":0.00060132705,"teacher_disagreement_score":0.40090543,"about_ca_system_score_codex":0.00004130398,"about_ca_system_score_gemma":0.00001649144,"threshold_uncertainty_score":0.6136717},"labels":[],"label_agreement":null},{"id":"W2557594551","doi":"10.1002/jgt.22102","title":"Characterizing Graphs with Crossing Number at Least 2","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Crossing number (knot theory); Mathematics; Vertex (graph theory); Disjoint sets; Graph; Discrete mathematics","score_opus":0.01596033645025523,"score_gpt":0.27684189557277383,"score_spread":0.2608815591225186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557594551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6615863,0.00020464315,0.33549088,0.00065595185,0.00030973332,0.00007960074,0.0000027546387,0.000051421117,0.0016187191],"genre_scores_gemma":[0.98786575,0.000055951838,0.011002782,0.00028852184,0.00009487114,0.0000028261995,1.1185823e-7,0.000027804797,0.00066137366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977232,0.00037491616,0.0004464041,0.0002779839,0.000666779,0.0005107182],"domain_scores_gemma":[0.9977278,0.00055596646,0.00054256874,0.0005576468,0.0003545981,0.0002614295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020384225,0.0002068143,0.00031670483,0.00040974558,0.00042755916,0.00022521855,0.0012263275,0.00006255686,0.00011966357],"category_scores_gemma":[0.00011828439,0.0001126338,0.00023730838,0.00069875136,0.0007097629,0.0017407364,0.0002562914,0.0002886617,0.00006112993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012292772,0.00012354826,0.024814581,0.000021833912,0.00019873881,0.0004581326,0.0011659131,0.000005765563,0.14342275,0.74744314,0.00017426405,0.08094206],"study_design_scores_gemma":[0.002055324,0.0004532451,0.014946431,0.0005296161,0.000022782515,0.00321168,0.00010693994,0.000010175096,0.03203693,0.9409084,0.005291547,0.00042695517],"about_ca_topic_score_codex":4.889959e-7,"about_ca_topic_score_gemma":0.0000014940323,"teacher_disagreement_score":0.32627946,"about_ca_system_score_codex":0.00008552665,"about_ca_system_score_gemma":0.00011774853,"threshold_uncertainty_score":0.4593073},"labels":[],"label_agreement":null},{"id":"W2557672902","doi":"","title":"On proper-path colorings in graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Combinatorics; Discrete mathematics; Computer science; Computer network","score_opus":0.017883129417424988,"score_gpt":0.27404983667660204,"score_spread":0.25616670725917706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557672902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94740057,0.00012663465,0.042700246,0.000565924,0.007416657,0.00036699043,8.656712e-7,0.00005997721,0.0013621522],"genre_scores_gemma":[0.99162006,0.00004183808,0.008040159,0.000028427408,0.00022778372,0.0000033859276,6.454994e-8,0.000025322945,0.00001296088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969828,0.00020527818,0.0010168095,0.00033416692,0.00094924914,0.0005116914],"domain_scores_gemma":[0.9963965,0.00176619,0.00072073523,0.00043508617,0.00044032093,0.00024116698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026533948,0.00028368694,0.00066575775,0.0005456261,0.00017278975,0.00020128803,0.001199055,0.0001310797,0.000003979495],"category_scores_gemma":[0.0010849016,0.00018784002,0.00015285084,0.00072387466,0.00013638417,0.00058129587,0.00046327978,0.00049425475,0.0000067906813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011101534,0.00043994287,0.00028722544,0.000044796154,0.000025896521,0.000075343734,0.000398381,0.000010187328,0.0014171781,0.99264735,0.000055673212,0.004486983],"study_design_scores_gemma":[0.00485668,0.0015198261,0.00019737323,0.0006989187,0.0000076054475,0.00007767653,0.000045500008,0.0010462314,0.0015799594,0.9894699,0.0002460714,0.0002542669],"about_ca_topic_score_codex":0.0000024831347,"about_ca_topic_score_gemma":2.0555889e-7,"teacher_disagreement_score":0.044219505,"about_ca_system_score_codex":0.00014832782,"about_ca_system_score_gemma":0.00015631033,"threshold_uncertainty_score":0.7659894},"labels":[],"label_agreement":null},{"id":"W2557683753","doi":"10.55630/sjc.2013.7.115-134","title":"Programming and Testing a Two-Tree Algorithm","year":2013,"lang":"en","type":"article","venue":"Serdica Journal of Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Computer science; GRASP; Algorithm; Path (computing); Tree (set theory); Architecture; Markov chain; Theoretical computer science; Mathematics; Machine learning; Programming language","score_opus":0.020057569802886293,"score_gpt":0.29342859971696356,"score_spread":0.27337102991407725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557683753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1399594,0.00039936387,0.8583729,0.0004356311,0.00014537296,0.0001324622,7.9628954e-8,0.00005749626,0.00049727585],"genre_scores_gemma":[0.48483428,0.0000024357767,0.5149535,0.000056549503,0.00013584396,6.390255e-7,3.823269e-8,0.00000739151,0.000009344656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826545,0.00015123717,0.00045642,0.00020814127,0.00046959243,0.0004491413],"domain_scores_gemma":[0.99790066,0.00068867457,0.0003919275,0.00022570601,0.0005406042,0.0002524309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012894316,0.0001335832,0.0002466076,0.00024350228,0.000246338,0.00037873216,0.0008029997,0.000031615808,0.0000040015966],"category_scores_gemma":[0.0003027438,0.000111861336,0.000066204215,0.00064728176,0.00010562765,0.00087979063,0.0005464259,0.00046252133,0.000009829199],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012391087,0.000021438296,0.0021299808,0.000010208787,0.000020433054,0.00005220329,0.00040765348,0.00018198452,0.00094580156,0.0017150991,0.000027913968,0.99448603],"study_design_scores_gemma":[0.001568118,0.0006775083,0.015999008,0.00048108585,0.000014903063,0.0033826255,0.00045572894,0.8989734,0.0012704664,0.07594053,0.0008093372,0.00042727584],"about_ca_topic_score_codex":0.000009490849,"about_ca_topic_score_gemma":4.4356665e-7,"teacher_disagreement_score":0.9940588,"about_ca_system_score_codex":0.00003032743,"about_ca_system_score_gemma":0.000090142334,"threshold_uncertainty_score":0.4561573},"labels":[],"label_agreement":null},{"id":"W2558490395","doi":"10.1016/j.disc.2017.09.013","title":"Structure and algorithms for (cap, even hole)-free graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Mathematics; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.03568801725379487,"score_gpt":0.3306678270001661,"score_spread":0.2949798097463712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558490395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025029536,0.00014430618,0.9717465,0.00093181396,0.00015877488,0.0005883642,0.00013304736,0.00009895679,0.0011687011],"genre_scores_gemma":[0.32024205,0.000024955078,0.67901117,0.000046218356,0.00006371844,0.000046184887,0.0000057660563,0.000031046628,0.000528887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987512,0.00002532443,0.00020172058,0.0003531325,0.00031009837,0.00035851003],"domain_scores_gemma":[0.99719,0.00021620688,0.00019281893,0.0021723993,0.00009713057,0.00013144311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036848692,0.00017669778,0.00024380126,0.00008284092,0.0005806014,0.0005222262,0.0023795618,0.000073276555,0.000005850732],"category_scores_gemma":[0.00056832103,0.00014029263,0.00008366683,0.00007604808,0.00024578892,0.0005655826,0.0009271548,0.00013898729,0.0000037086065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054681245,0.000018095467,0.00014840513,0.00015714961,0.000032244963,0.0000056220756,0.0008461866,0.000006841913,0.0007292539,0.98496294,0.00037651006,0.012711278],"study_design_scores_gemma":[0.000512892,0.00006740405,0.00043661587,0.000040993917,0.0000090063595,0.000012131461,0.00009023752,0.04725459,0.002034123,0.9489145,0.00043220265,0.00019526637],"about_ca_topic_score_codex":0.0000027529122,"about_ca_topic_score_gemma":0.000006639247,"teacher_disagreement_score":0.2952125,"about_ca_system_score_codex":0.000011698592,"about_ca_system_score_gemma":0.000022517146,"threshold_uncertainty_score":0.57209677},"labels":[],"label_agreement":null},{"id":"W2559029563","doi":"10.1016/j.dam.2017.01.022","title":"Restraints permitting the largest number of colourings","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.029000003550814873,"score_gpt":0.3319107348315454,"score_spread":0.3029107312807305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559029563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42523158,0.000016788335,0.34549627,0.001328494,0.00013537928,0.0008561473,0.000011896265,0.0001618793,0.22676158],"genre_scores_gemma":[0.8690699,0.0000065367226,0.1304899,0.000034221954,0.00002862044,0.000038835504,6.430011e-7,0.000016786005,0.00031460682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867266,0.00002049764,0.00029274978,0.0002488099,0.00042648893,0.00033876047],"domain_scores_gemma":[0.997194,0.00032800567,0.00039013676,0.0019493153,0.000070494745,0.00006804686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009033854,0.00013972954,0.00021707187,0.000029048319,0.0006044641,0.00023323277,0.0027695464,0.0000519042,0.000023964603],"category_scores_gemma":[0.00029510248,0.000094230636,0.00007553487,0.00010226133,0.00041186015,0.00022425472,0.000940987,0.00021795482,0.00008426281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034241132,0.00003287883,0.00028338522,0.00006533226,0.00001695824,0.000004316351,0.0013920704,0.0000057204848,0.002483009,0.9926791,0.00004977492,0.0029840001],"study_design_scores_gemma":[0.00045795,0.000020545194,0.002822079,0.000085322026,0.000014424425,0.00003101904,0.0007363034,0.008476504,0.017673194,0.96887505,0.00053653616,0.0002710656],"about_ca_topic_score_codex":0.0000048885854,"about_ca_topic_score_gemma":0.0000022928805,"teacher_disagreement_score":0.4438383,"about_ca_system_score_codex":0.000014019834,"about_ca_system_score_gemma":0.000029225312,"threshold_uncertainty_score":0.51465523},"labels":[],"label_agreement":null},{"id":"W2561228181","doi":"10.1109/focs.2016.38","title":"Structure of Protocols for XOR Functions","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Boolean function; Discrete mathematics; XOR gate; Function (biology); Mathematics; Parity (physics); Communication complexity; Entropy (arrow of time); Computational complexity theory; Computer science; Combinatorics; Theoretical computer science; Algorithm; Logic gate; Physics; Biology","score_opus":0.03665431445611443,"score_gpt":0.3531629271273651,"score_spread":0.31650861267125063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561228181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010166474,0.0000017121903,0.9924046,0.00055107306,0.000034718658,0.005184417,0.00001632468,0.00005372838,0.00073677464],"genre_scores_gemma":[0.6839113,4.194094e-7,0.29753798,0.00008783559,0.0000596903,0.0056248815,6.5810207e-7,0.000011801956,0.012765393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994675,0.000018428582,0.00009213414,0.00015748058,0.00011841664,0.00014604893],"domain_scores_gemma":[0.9992303,0.00017442748,0.000030205701,0.00039623803,0.0001292586,0.000039524886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008276269,0.0000440549,0.00006519056,0.000060696984,0.00004180462,0.00001185215,0.00045003698,0.000022497812,0.000097804215],"category_scores_gemma":[0.000082417835,0.000023512888,0.000037482674,0.0001728273,0.00005265529,0.00025270853,0.00008985411,0.000022662369,0.000010000274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022508471,0.00001602869,0.00022414156,0.000013755986,0.0000064996234,1.4740577e-7,0.000020052088,0.0000041644857,0.20379959,0.7254966,0.0013363396,0.069060154],"study_design_scores_gemma":[0.0007454725,0.00030477598,0.0005223069,0.000024207433,9.557739e-7,0.0000030565182,0.000007967947,0.0003876441,0.37108585,0.5987125,0.028109036,0.00009623743],"about_ca_topic_score_codex":5.8983846e-7,"about_ca_topic_score_gemma":0.0000037287723,"teacher_disagreement_score":0.69486666,"about_ca_system_score_codex":0.000009613609,"about_ca_system_score_gemma":0.000036187575,"threshold_uncertainty_score":0.10708875},"labels":[],"label_agreement":null},{"id":"W2562647514","doi":"10.1145/3026744.3026746","title":"An improved homomorphism preservation theorem from lower bounds in circuit complexity","year":2016,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphism; Quantifier elimination; Rank (graph theory); Mathematics; Isomorphism (crystallography); Sentence; Quantifier (linguistics); Discrete mathematics; Upper and lower bounds; Function (biology); Combinatorics; Computer science","score_opus":0.06368496125477932,"score_gpt":0.30681698521299294,"score_spread":0.24313202395821362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562647514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5252822,0.00007179305,0.46951038,0.0027958383,0.0003535875,0.0004285387,0.000032070846,0.00023996305,0.0012856534],"genre_scores_gemma":[0.9794418,0.000018704086,0.019619307,0.00046554365,0.00009209056,0.000051656873,0.000013289581,0.000021355323,0.00027623016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763,0.0003660937,0.00032753177,0.00075253064,0.00036585887,0.0005579957],"domain_scores_gemma":[0.99615026,0.00071563135,0.000114895876,0.0027184777,0.00012140667,0.00017933366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061991165,0.0002018487,0.0002517623,0.00017822652,0.00012770381,0.00016186792,0.0033734636,0.00011887133,0.00018358314],"category_scores_gemma":[0.0006278562,0.00014924855,0.00006701777,0.000570303,0.00031781182,0.0022244982,0.0007095621,0.00021429757,0.0001151994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014915351,0.0003861666,0.026756192,0.000006631422,0.000025736794,0.000054271575,0.0010306024,0.000012420003,0.29136413,0.51952505,0.0005978914,0.16009171],"study_design_scores_gemma":[0.0009975608,0.00021955074,0.034722026,0.000022671526,0.0000018639164,0.0000024756948,0.00002148936,0.003267331,0.0030934406,0.9556391,0.0017654175,0.00024707118],"about_ca_topic_score_codex":0.00060990086,"about_ca_topic_score_gemma":0.0008905889,"teacher_disagreement_score":0.45415965,"about_ca_system_score_codex":0.00012712307,"about_ca_system_score_gemma":0.000093162824,"threshold_uncertainty_score":0.6268791},"labels":[],"label_agreement":null},{"id":"W2565352292","doi":"10.1007/978-3-319-44543-4_27","title":"Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Cactus; Vertex (graph theory); Combinatorics; Generalization; Binary tree; Binary number; Tree (set theory); Mathematics; Computer science; Time complexity; Algorithm; Class (philosophy); Discrete mathematics; Graph; Artificial intelligence; Arithmetic","score_opus":0.027257716468281526,"score_gpt":0.2906350169032979,"score_spread":0.2633773004350164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565352292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007619607,0.00037693616,0.99465287,0.00031663326,0.001121616,0.0007091453,0.000016958908,0.00004981103,0.001994078],"genre_scores_gemma":[0.14260696,0.00040259192,0.8545291,0.00032424522,0.0013867752,0.00006984988,0.000004021436,0.00008678819,0.0005896854],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638337,0.00005104871,0.00056586193,0.0014095303,0.0007988405,0.00079136965],"domain_scores_gemma":[0.99645483,0.0019170627,0.00028021348,0.00091143267,0.00026913977,0.00016733643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010966182,0.00044248658,0.0006701309,0.0017365525,0.00015081302,0.00016969329,0.0023630047,0.00027447435,0.000011256273],"category_scores_gemma":[0.00015728593,0.00035912884,0.00012398223,0.0007971887,0.0013270121,0.0006990219,0.0010547191,0.000519607,0.00000306234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040986157,0.00002528577,0.00018685106,0.000058882662,0.000010635723,0.000043331853,0.0003644066,0.00027361262,0.00049012504,0.14442232,0.000007155386,0.8540764],"study_design_scores_gemma":[0.0008149789,0.00040202742,0.00045168115,0.00047617868,0.0000041885105,0.000021891252,3.3239246e-7,0.05402814,0.005059282,0.93750656,0.00073536526,0.00049938494],"about_ca_topic_score_codex":0.000008685297,"about_ca_topic_score_gemma":0.00018309524,"teacher_disagreement_score":0.853577,"about_ca_system_score_codex":0.00021346589,"about_ca_system_score_gemma":0.00039688588,"threshold_uncertainty_score":0.9998861},"labels":[],"label_agreement":null},{"id":"W2568140225","doi":"10.1016/j.jctb.2012.11.002","title":"Flow-cut gaps for integer and fractional multiflows","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Integer (computer science); Flow (mathematics); Maximum flow problem; Integer programming; Graph; Discrete mathematics; Planar graph; Mathematical optimization; Computer science; Geometry","score_opus":0.01700801821673222,"score_gpt":0.29596328350016127,"score_spread":0.27895526528342907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568140225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07622166,0.0017328374,0.90047467,0.00087774236,0.019037578,0.00038325315,0.0000101617,0.000059069473,0.0012030329],"genre_scores_gemma":[0.9596093,0.00008211527,0.03805509,0.000107625514,0.0017358322,0.00001372686,9.4195275e-7,0.00002171648,0.00037361748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984231,0.00027603665,0.0003851333,0.00013789181,0.00040351236,0.00037435343],"domain_scores_gemma":[0.99759054,0.0011535028,0.00027687813,0.00025287268,0.00046951478,0.00025669232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027548033,0.00015119927,0.00028174664,0.0001909096,0.00020439955,0.000111067726,0.0005868725,0.00008704992,0.000043649175],"category_scores_gemma":[0.00090075453,0.0001226508,0.00014264965,0.00020330066,0.00018110772,0.0028336893,0.00018504034,0.0003570092,0.000005623881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009581696,0.00012094735,0.00015713411,0.000015354532,0.00006061243,0.000004455002,0.00060729595,0.00003739785,0.0010572611,0.9904471,0.0005286788,0.0060055866],"study_design_scores_gemma":[0.0013572141,0.00047091927,0.00017858933,0.000026140946,0.000012904888,0.0002276447,0.00017761678,0.0004524318,0.0060396167,0.9352195,0.055683102,0.00015431987],"about_ca_topic_score_codex":3.2749466e-7,"about_ca_topic_score_gemma":1.8729519e-7,"teacher_disagreement_score":0.8833877,"about_ca_system_score_codex":0.000059975948,"about_ca_system_score_gemma":0.00009054804,"threshold_uncertainty_score":0.5001555},"labels":[],"label_agreement":null},{"id":"W2571724965","doi":"","title":"Paired-domination in claw-free graphs with minimum degree at least four.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Degree (music); Combinatorics; Biology; Physics","score_opus":0.028184767203854506,"score_gpt":0.2531364262116594,"score_spread":0.22495165900780487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571724965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98081344,0.00010865078,0.011719457,0.0026285334,0.00075416453,0.00047261582,0.000005080715,0.00021732609,0.0032807323],"genre_scores_gemma":[0.9954618,0.000020817124,0.0034093382,0.00006430281,0.000005496358,0.00007070682,0.000001217822,0.000025856934,0.00094041455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975945,0.00024081134,0.00027036926,0.0006265196,0.0006501753,0.00061763835],"domain_scores_gemma":[0.99760026,0.00051156495,0.00011689007,0.0014157809,0.00018022103,0.0001752635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070055784,0.00022516314,0.00024170252,0.00036652436,0.00016004016,0.000060962364,0.0017866701,0.00009659213,0.000021993104],"category_scores_gemma":[0.00025254648,0.00015848625,0.00006818801,0.00108435,0.00024926683,0.0009119924,0.0007388132,0.00017527139,0.00010872731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012672352,0.00010841844,0.024161302,0.000009873545,0.000015013908,0.00009778006,0.0001789489,0.0000029198893,0.002260696,0.95213664,0.0009057772,0.01999594],"study_design_scores_gemma":[0.004052368,0.0003454442,0.02809853,0.000092857204,0.0000032451878,0.000032972122,0.000018064626,0.00036397492,0.0040114666,0.96212095,0.0005603182,0.00029978246],"about_ca_topic_score_codex":0.00001287179,"about_ca_topic_score_gemma":0.00014664624,"teacher_disagreement_score":0.019696157,"about_ca_system_score_codex":0.00025057112,"about_ca_system_score_gemma":0.0000814566,"threshold_uncertainty_score":0.64628816},"labels":[],"label_agreement":null},{"id":"W2571725614","doi":"","title":"On the 2-rainbow bondage number of planar graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Planar graph; Combinatorics; Rainbow; Graph; Computer graphics (images); Computer science; Optics; Physics","score_opus":0.015961758262073477,"score_gpt":0.27647453151757984,"score_spread":0.26051277325550637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571725614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9685256,0.000050887782,0.0063440744,0.005513884,0.0012949615,0.0003640379,0.000012122351,0.00017432348,0.017720144],"genre_scores_gemma":[0.9983161,0.000013852224,0.0007716726,0.00021112637,0.000002699548,0.00001710673,3.2376224e-7,0.00001215379,0.00065494416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850875,0.00019579886,0.00018088055,0.00030408966,0.00047434578,0.00033615206],"domain_scores_gemma":[0.9973045,0.0012975256,0.00008851403,0.0011282947,0.0000957608,0.00008543421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006386907,0.0001281999,0.00015074264,0.000081459235,0.00012211512,0.000029457502,0.0015424744,0.00004927649,0.0000846493],"category_scores_gemma":[0.0002611405,0.00006814489,0.000086516484,0.00052972336,0.00023550239,0.00025164362,0.00019520507,0.00014569318,0.00026370777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015815824,0.00005746869,0.0012786274,0.0000031711788,0.00001562954,0.0000092020255,0.00011508091,2.1719866e-7,0.0014577388,0.9913353,0.0036012551,0.0021105232],"study_design_scores_gemma":[0.00044559943,0.00008960576,0.0010610129,0.000033451637,0.0000014366416,0.0000053421377,0.000009928617,0.0000205848,0.0076381513,0.9891592,0.0014323951,0.00010328693],"about_ca_topic_score_codex":0.0000050327185,"about_ca_topic_score_gemma":6.9757306e-7,"teacher_disagreement_score":0.029790556,"about_ca_system_score_codex":0.00002752655,"about_ca_system_score_gemma":0.00003961278,"threshold_uncertainty_score":0.33895177},"labels":[],"label_agreement":null},{"id":"W2572445898","doi":"","title":"On independent domination critical graphs and k-factor critical.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factor (programming language); Combinatorics; Discrete mathematics; Computer science","score_opus":0.017014493474890476,"score_gpt":0.3097578847512327,"score_spread":0.29274339127634225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572445898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91480595,0.0002141798,0.06714654,0.010701845,0.00332981,0.0003928839,0.000014662951,0.00042121438,0.0029728962],"genre_scores_gemma":[0.99819934,0.000022082555,0.0014613869,0.00016611423,0.0000041164185,0.000026599268,2.633679e-7,0.0000134066195,0.00010668418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981188,0.00019472024,0.00018469042,0.0005139188,0.0005558228,0.00043205195],"domain_scores_gemma":[0.9960664,0.0028858385,0.000025574569,0.00056518853,0.00020327573,0.00025374323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039159777,0.00015438673,0.00015779023,0.00021102958,0.00018184276,0.00012728354,0.00058111706,0.000091972746,0.000050436276],"category_scores_gemma":[0.0022274714,0.00011241477,0.000048987717,0.00029526383,0.0003375505,0.0007440768,0.00029174428,0.00018740236,0.000112250236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021493033,0.00010264737,0.00038337448,0.000009349834,0.000005419058,0.000024574943,0.00006439294,7.0943145e-8,0.0025218532,0.98272717,0.00017213382,0.013967492],"study_design_scores_gemma":[0.0007025975,0.00028995986,0.0044570086,0.000044961627,0.0000022515378,0.000011025884,0.0000065827026,0.00012708585,0.0057231877,0.9883324,0.00013422304,0.00016870644],"about_ca_topic_score_codex":0.0000017166296,"about_ca_topic_score_gemma":6.5759764e-7,"teacher_disagreement_score":0.08339338,"about_ca_system_score_codex":0.00006398808,"about_ca_system_score_gemma":0.000034527693,"threshold_uncertainty_score":0.4584141},"labels":[],"label_agreement":null},{"id":"W2572626022","doi":"","title":"Critical Hamiltonian Connected Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Pure mathematics; Mathematical optimization","score_opus":0.016508396975828617,"score_gpt":0.29168138779847747,"score_spread":0.27517299082264884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572626022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81941605,0.00051685947,0.13530523,0.017592689,0.0075441618,0.0006787755,0.000017354001,0.002028712,0.016900178],"genre_scores_gemma":[0.9960082,0.000017408618,0.0034172977,0.00019537641,0.000005156436,0.000027170472,4.4892994e-7,0.00001728083,0.0003116695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998045,0.0002037821,0.00020711764,0.000509292,0.0004295968,0.0006052126],"domain_scores_gemma":[0.9973584,0.0010702851,0.000035470577,0.000996233,0.00027102474,0.00026857914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040691468,0.00016252557,0.00018356025,0.00018603947,0.00018813576,0.000104003004,0.0013459026,0.00008224884,0.00007273112],"category_scores_gemma":[0.0009697729,0.000117113836,0.00008496545,0.00072193786,0.00033365694,0.000816885,0.00039314525,0.00015984342,0.00041067382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009443857,0.00006541197,0.0009527075,0.000004275377,0.000010303334,0.000042043794,0.000052683194,1.0355103e-7,0.006728796,0.98280704,0.00077228504,0.00855488],"study_design_scores_gemma":[0.00072620355,0.00013909405,0.0031856564,0.000028688308,0.000002112768,0.000016292908,0.000005420656,0.000104863524,0.008631299,0.98486066,0.0020970327,0.00020267048],"about_ca_topic_score_codex":0.000003953993,"about_ca_topic_score_gemma":0.0000018636467,"teacher_disagreement_score":0.17659214,"about_ca_system_score_codex":0.00005544462,"about_ca_system_score_gemma":0.000068222434,"threshold_uncertainty_score":0.5278518},"labels":[],"label_agreement":null},{"id":"W2572745867","doi":"","title":"On total domination number of Cartesian product of directed cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Arithmetic; Combinatorics; Geometry","score_opus":0.009828459400459243,"score_gpt":0.2770102242897745,"score_spread":0.2671817648893153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572745867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941423,0.000021599848,0.0017817544,0.00026936748,0.00054641935,0.00020082995,0.0000040803016,0.00008494304,0.0029487077],"genre_scores_gemma":[0.9980472,0.000004534382,0.0016301171,0.000005474279,0.000004019757,0.000012251324,6.736713e-7,0.000010114099,0.00028562205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869204,0.00014475218,0.00022910592,0.00030391655,0.00041405146,0.00021614168],"domain_scores_gemma":[0.9984931,0.0003556375,0.00013797001,0.000684899,0.00026674807,0.00006169614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035867584,0.0001031977,0.0001903024,0.00011687752,0.000037670365,0.000009609159,0.00052209664,0.000037364433,0.000024380273],"category_scores_gemma":[0.00035979235,0.00007611078,0.000059338523,0.000534951,0.00013904895,0.00031337005,0.00013986939,0.00007138995,0.00003536779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003208624,0.0001459346,0.0028363457,0.000013034526,0.000013559522,0.00000266144,0.00014830142,0.000002109831,0.022037933,0.95928156,0.00014400692,0.015342451],"study_design_scores_gemma":[0.00083371415,0.000118514195,0.01837453,0.00006146815,0.0000025664795,0.000005116852,0.0000044669423,0.00013175703,0.17544957,0.80488634,0.000026649712,0.00010530167],"about_ca_topic_score_codex":0.000009946957,"about_ca_topic_score_gemma":8.1992613e-7,"teacher_disagreement_score":0.15439524,"about_ca_system_score_codex":0.000047791593,"about_ca_system_score_gemma":0.000053957152,"threshold_uncertainty_score":0.31037074},"labels":[],"label_agreement":null},{"id":"W2573172438","doi":"","title":"Implicit degree condition for hamiltonicity of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics; Physics","score_opus":0.029337958254696428,"score_gpt":0.30411784511476975,"score_spread":0.2747798868600733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573172438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75780565,0.00009557761,0.2386112,0.00055940525,0.0009375972,0.0005717242,0.00003479621,0.00015906006,0.0012250093],"genre_scores_gemma":[0.99485487,0.00001573813,0.0048823687,0.000037299644,0.0000029431133,0.00006593145,0.0000018712564,0.000011607004,0.00012739793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876297,0.00007061003,0.00022988598,0.00033073316,0.00026051674,0.00034526084],"domain_scores_gemma":[0.99823904,0.00058572163,0.000119439326,0.000692594,0.00026882542,0.00009435739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045820756,0.000115478084,0.00019178467,0.00015179123,0.00010047368,0.000020536841,0.00090653653,0.00006329551,0.000011296093],"category_scores_gemma":[0.0001904466,0.00008588544,0.000115093906,0.00038787932,0.00015561913,0.0004656093,0.00019593968,0.00006421858,0.000018057623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021593341,0.00005350154,0.00093973405,0.000012774095,0.000016395825,0.0000011801754,0.00003979164,7.9325883e-7,0.022157744,0.96413994,0.00048800235,0.012128574],"study_design_scores_gemma":[0.0011291615,0.00023557962,0.004402307,0.000025270398,0.0000031728887,0.0000030196154,0.000004651573,0.00015643389,0.059982218,0.93337554,0.0005674749,0.00011514687],"about_ca_topic_score_codex":0.000005934777,"about_ca_topic_score_gemma":0.0000019223448,"teacher_disagreement_score":0.23704922,"about_ca_system_score_codex":0.000046100005,"about_ca_system_score_gemma":0.000055414028,"threshold_uncertainty_score":0.35023066},"labels":[],"label_agreement":null},{"id":"W2573503267","doi":"","title":"Total Domination in generalized θ graphs and ladder graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Combinatorics; Indifference graph; Graph","score_opus":0.012360631949996733,"score_gpt":0.2662108344896399,"score_spread":0.25385020253964313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573503267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951828,0.00021286609,0.0023393517,0.0008150864,0.0005753703,0.00020791923,0.0000016299408,0.00010388408,0.0005610583],"genre_scores_gemma":[0.9972426,0.0000891977,0.0022899427,0.000056062414,0.0000018679759,0.000039344995,7.4726296e-7,0.000011366554,0.00026884375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855417,0.00017884508,0.0001975716,0.00041744698,0.0002931017,0.00035888667],"domain_scores_gemma":[0.9990535,0.00024169282,0.00005461149,0.0004550618,0.00008297286,0.000112197245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050409726,0.00013644935,0.00016694468,0.000355244,0.00008387386,0.000064860964,0.0004537739,0.00006869657,0.000014991441],"category_scores_gemma":[0.00010736498,0.00010276107,0.00004646547,0.00073176995,0.00014054065,0.0007416592,0.00026128057,0.000108698914,0.000020486923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017493452,0.000046027395,0.0056796474,0.000003755241,0.0000072617772,0.000015363015,0.00013819546,8.9559427e-7,0.005605901,0.97231895,0.00014620951,0.016020311],"study_design_scores_gemma":[0.002081664,0.00007374724,0.020062175,0.000020790028,0.000001391461,0.0000116242745,0.000007856414,0.0002880038,0.003376858,0.9737922,0.0001239712,0.00015973086],"about_ca_topic_score_codex":0.000016040172,"about_ca_topic_score_gemma":0.000008553998,"teacher_disagreement_score":0.01586058,"about_ca_system_score_codex":0.000040514286,"about_ca_system_score_gemma":0.00002825425,"threshold_uncertainty_score":0.41904747},"labels":[],"label_agreement":null},{"id":"W2573525493","doi":"","title":"Upper bound on the diameter of a total domination vertex critical graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Upper and lower bounds; Graph; Mathematical analysis","score_opus":0.016297136367318665,"score_gpt":0.28457141688818155,"score_spread":0.2682742805208629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573525493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94113874,0.000076396405,0.045664333,0.007728248,0.002029861,0.0003276198,0.0000063840207,0.00008967431,0.002938748],"genre_scores_gemma":[0.998731,0.000006666196,0.00090965925,0.00012709112,0.000004621802,0.000030579773,2.248747e-7,0.000010165683,0.0001799851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984998,0.00023739082,0.00018050692,0.0002978511,0.00047603442,0.0003083817],"domain_scores_gemma":[0.9964766,0.0024787716,0.000044851513,0.00074966194,0.00017076284,0.0000793418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058640906,0.00011454318,0.00013752213,0.00013370375,0.00012853311,0.00005590208,0.00070688355,0.000052896787,0.0000524093],"category_scores_gemma":[0.0009562758,0.00006346604,0.000098879726,0.00040660604,0.00036801433,0.00040573033,0.00016643049,0.00012761296,0.00009272629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022703874,0.00009542085,0.0002721036,0.0000041003723,0.000011143665,0.000003829729,0.00011761028,2.6233977e-7,0.007824438,0.98494136,0.00049658073,0.0062104496],"study_design_scores_gemma":[0.0004592304,0.00024862093,0.002928366,0.000040838637,0.0000027324536,0.000004597766,0.000012256617,0.00015430577,0.030930659,0.9650084,0.00011112323,0.00009886981],"about_ca_topic_score_codex":0.0000028028867,"about_ca_topic_score_gemma":4.2043837e-7,"teacher_disagreement_score":0.05759227,"about_ca_system_score_codex":0.000041917585,"about_ca_system_score_gemma":0.00003651917,"threshold_uncertainty_score":0.258807},"labels":[],"label_agreement":null},{"id":"W2573740254","doi":"","title":"Neighbourly regular strength of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.012490780127481652,"score_gpt":0.2589532010007833,"score_spread":0.24646242087330164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573740254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93713427,0.0003414396,0.055195257,0.0012465116,0.0013610024,0.0002959611,0.000009027063,0.00027695415,0.004139591],"genre_scores_gemma":[0.9952578,0.000034241475,0.004276137,0.000025494965,0.000003860957,0.000011992625,3.6145417e-7,0.000012362581,0.00037774644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848235,0.0001323452,0.0002292836,0.00035336948,0.00043591883,0.00036673876],"domain_scores_gemma":[0.99819714,0.00032108877,0.00010746594,0.0010654876,0.00017514582,0.0001336951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040392755,0.00012825723,0.00019382927,0.00019624353,0.00006864538,0.00002701257,0.0013307657,0.000057978257,0.000029686898],"category_scores_gemma":[0.00015836215,0.00009053093,0.000096536554,0.0007135487,0.00018792869,0.00052744045,0.0003239715,0.00009451056,0.000047526253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011232641,0.00007352384,0.0013370254,0.0000062055806,0.000017468083,0.000009372905,0.000071693816,5.451423e-7,0.009831084,0.9682527,0.0003245463,0.02006458],"study_design_scores_gemma":[0.0007838492,0.00018082945,0.0018052659,0.000037160145,0.0000022017055,0.0000042414904,0.000007767644,0.00005788779,0.03824861,0.95789146,0.00085339684,0.00012732552],"about_ca_topic_score_codex":0.0000062120002,"about_ca_topic_score_gemma":0.0000010228883,"teacher_disagreement_score":0.058123544,"about_ca_system_score_codex":0.00003179323,"about_ca_system_score_gemma":0.000061104634,"threshold_uncertainty_score":0.3691744},"labels":[],"label_agreement":null},{"id":"W2573798597","doi":"","title":"Equitable and List Equitable Colorings of Graphs with Bounded Maximum Average Degree.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Degree (music); Combinatorics; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.023622399493169022,"score_gpt":0.2620874077055633,"score_spread":0.2384650082123943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573798597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9591375,0.00045158868,0.026121171,0.0005776614,0.00044352093,0.00045801324,0.000008992287,0.00019823256,0.012603307],"genre_scores_gemma":[0.9939296,0.000062587445,0.004659314,0.000039452047,0.0000022493123,0.00003584699,6.6313527e-7,0.000023407361,0.0012468724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760777,0.000099745324,0.00025962127,0.0005409334,0.0005299534,0.0009619916],"domain_scores_gemma":[0.9981521,0.0003956064,0.0001437955,0.0008629665,0.00023198556,0.00021358104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090220006,0.00021321379,0.0003198169,0.00021365038,0.00029030876,0.00012263059,0.0010257405,0.00007536975,0.000029302491],"category_scores_gemma":[0.00009646874,0.00014885112,0.00005010962,0.00080669933,0.0004272757,0.0011551661,0.0010782134,0.000149314,0.000017291584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007914269,0.00008180894,0.00475227,0.000032746586,0.000033937697,0.000027775784,0.000101719146,0.0000015526032,0.0096164495,0.98198754,0.00013501533,0.0031500172],"study_design_scores_gemma":[0.0018778226,0.00064419064,0.00093291956,0.000093830284,0.000006583234,0.000023489034,0.000022633283,0.00007401385,0.024519559,0.9703516,0.0012140125,0.00023934306],"about_ca_topic_score_codex":0.000048559894,"about_ca_topic_score_gemma":0.000014930776,"teacher_disagreement_score":0.034792095,"about_ca_system_score_codex":0.000072111296,"about_ca_system_score_gemma":0.00011506731,"threshold_uncertainty_score":0.60699725},"labels":[],"label_agreement":null},{"id":"W2573856633","doi":"","title":"Resistance Distance of Three Classes of Join Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Combinatorics","score_opus":0.018444873667050863,"score_gpt":0.26835553325632894,"score_spread":0.24991065958927808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573856633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7967454,0.0016619661,0.19143915,0.001175133,0.0013049595,0.00043530014,0.000030401514,0.00018178794,0.0070259073],"genre_scores_gemma":[0.9934491,0.00007575236,0.006021109,0.000011960893,0.0000019765746,0.000013967477,3.0219675e-7,0.000012578623,0.00041328484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982891,0.000108127184,0.0003689584,0.00036910866,0.00053099124,0.00033368883],"domain_scores_gemma":[0.9976327,0.0005553792,0.00023971632,0.001180199,0.0003022541,0.0000897774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004658311,0.00013921778,0.00029178738,0.00015839418,0.000059074486,0.000014391231,0.0014481515,0.000056312587,0.00001246322],"category_scores_gemma":[0.0002513865,0.000102259575,0.00010442929,0.00089542754,0.0004152746,0.00049331377,0.00027782586,0.00009515388,0.00001068262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042448286,0.00007648657,0.009253885,0.000037893537,0.000017565038,0.0000050471845,0.00005040076,5.716284e-7,0.014092723,0.973397,0.00043105174,0.0025949073],"study_design_scores_gemma":[0.00061782164,0.00009418692,0.0094170645,0.00012777868,0.0000025386764,8.403252e-7,0.0000057861243,0.000020359304,0.049836025,0.9389139,0.00084029575,0.0001234216],"about_ca_topic_score_codex":0.000004608069,"about_ca_topic_score_gemma":0.00002926916,"teacher_disagreement_score":0.19670367,"about_ca_system_score_codex":0.00003699532,"about_ca_system_score_gemma":0.00007764306,"threshold_uncertainty_score":0.41700244},"labels":[],"label_agreement":null},{"id":"W2574512124","doi":"","title":"Forbidden subgraph conditions for Hamilton cycles in implicit claw-heavy graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Induced subgraph isomorphism problem; Combinatorics; Biology; Graph; Line graph","score_opus":0.02018336651925866,"score_gpt":0.3056736585531554,"score_spread":0.28549029203389675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574512124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9696643,0.00018524246,0.025130888,0.0013988739,0.001194157,0.0010159622,0.00005414669,0.00030349992,0.0010529315],"genre_scores_gemma":[0.99692017,0.000067538014,0.0023115675,0.00013417992,0.00000701002,0.00034043434,0.0000066092225,0.000027679553,0.00018483767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781203,0.00012527805,0.000336941,0.00059809285,0.00031880825,0.00080886786],"domain_scores_gemma":[0.99774504,0.0008792611,0.00009400859,0.0009186698,0.00016870044,0.00019431765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006346564,0.00021079909,0.00027100474,0.0005008461,0.00021962641,0.00008162597,0.0013143655,0.00011788437,0.000012971546],"category_scores_gemma":[0.00014706863,0.00016961839,0.00016493419,0.0009794872,0.00021355395,0.00082834123,0.00019967767,0.00015855019,0.000048792368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030915184,0.00010478662,0.006482591,0.000011023467,0.0000169146,0.00000801075,0.00012977487,0.0000017693371,0.00589195,0.9832747,0.0009786383,0.003068924],"study_design_scores_gemma":[0.0018139061,0.00018803003,0.014463299,0.00005105996,0.0000034180975,0.000006651061,0.000019518877,0.00017742504,0.008453851,0.9733411,0.0012313965,0.0002503513],"about_ca_topic_score_codex":0.000023423325,"about_ca_topic_score_gemma":0.000052433727,"teacher_disagreement_score":0.027255846,"about_ca_system_score_codex":0.0001029378,"about_ca_system_score_gemma":0.00007511688,"threshold_uncertainty_score":0.6916837},"labels":[],"label_agreement":null},{"id":"W2574604220","doi":"10.1002/jgt.22169","title":"Grünbaum colorings of even triangulations on surfaces","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Exploratory Research for Advanced Technology; Japan Science and Technology Agency; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Klein bottle; Mathematics; Combinatorics; Triangulation; Torus; Surface (topology); Point set triangulation; Projective plane; Boundary (topology); Plane (geometry); Geometry; Delaunay triangulation; Mathematical analysis","score_opus":0.03733898809966781,"score_gpt":0.33191517968683176,"score_spread":0.29457619158716397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574604220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9073575,0.00046503684,0.07742057,0.0014789677,0.00083751854,0.0002020394,0.0000071011905,0.000027735181,0.012203548],"genre_scores_gemma":[0.99388754,0.000060628732,0.0054724705,0.000036794754,0.000046991736,0.0000015956765,1.11491524e-7,0.000009359016,0.00048448192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983752,0.00028880726,0.00043042895,0.00014995063,0.00053149404,0.00022415986],"domain_scores_gemma":[0.997057,0.00064814277,0.0009777631,0.0008591322,0.0003352881,0.00012265643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029059695,0.00011272343,0.0002963333,0.00044349683,0.00035343133,0.000110825196,0.0022014033,0.00005414125,0.000023937451],"category_scores_gemma":[0.0008214203,0.00008786899,0.0002491282,0.00022689816,0.0003458191,0.0009083285,0.0001941156,0.00030431277,0.000007461894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003115255,0.00010352834,0.0018329369,0.000010270815,0.00008026105,0.000029956356,0.0002974279,0.0003686979,0.004282323,0.98467374,0.00013896999,0.007870366],"study_design_scores_gemma":[0.0008331085,0.00055442686,0.03885788,0.00009053264,0.000012850781,0.000033172833,0.00007764114,0.00011836599,0.009361752,0.94908476,0.00086798624,0.00010754587],"about_ca_topic_score_codex":0.0000025813856,"about_ca_topic_score_gemma":0.0000018772005,"teacher_disagreement_score":0.08653008,"about_ca_system_score_codex":0.000024594385,"about_ca_system_score_gemma":0.00008894722,"threshold_uncertainty_score":0.40907913},"labels":[],"label_agreement":null},{"id":"W2574740122","doi":"","title":"Two-Distance-Transitve Graphs Of Valency 7.","year":2016,"lang":"sl","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Valency; Mathematics; Combinatorics; Linguistics; Philosophy","score_opus":0.015891366817252495,"score_gpt":0.28257321282705694,"score_spread":0.26668184600980444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574740122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90169245,0.0050987485,0.06410146,0.0019789522,0.010097917,0.0012444172,0.00014106398,0.00035348206,0.015291528],"genre_scores_gemma":[0.99578726,0.00061964407,0.0019849285,0.000051760988,0.000014705234,0.000026769905,0.0000014091352,0.000051839022,0.0014616692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952676,0.0005521717,0.0007962576,0.0010579076,0.0011907574,0.0011352542],"domain_scores_gemma":[0.9955565,0.00090329984,0.0003660764,0.0021403464,0.00063739484,0.0003964251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011328987,0.00046486786,0.0006640499,0.00041892033,0.00023575874,0.00007508065,0.0026674634,0.00018354734,0.0001703738],"category_scores_gemma":[0.00023454159,0.00036914682,0.00037648028,0.0018414636,0.0010112795,0.0010385773,0.00050000736,0.00037781862,0.00019138206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103056824,0.00034487626,0.0051007885,0.00009859315,0.00009535334,0.00005609129,0.00062372594,0.000003726072,0.009884059,0.9487218,0.00037541907,0.034592483],"study_design_scores_gemma":[0.0030754847,0.0005334858,0.002238872,0.0004523187,0.000028339595,0.000011165733,0.00013598253,0.00013781725,0.02045658,0.97187495,0.00056231,0.0004926857],"about_ca_topic_score_codex":0.000031129763,"about_ca_topic_score_gemma":0.0000117340405,"teacher_disagreement_score":0.094094835,"about_ca_system_score_codex":0.00013558869,"about_ca_system_score_gemma":0.00028466762,"threshold_uncertainty_score":0.999876},"labels":[],"label_agreement":null},{"id":"W2575008982","doi":"","title":"A new version for Co-PI Iindex of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Graph; Combinatorics; Geometry","score_opus":0.018288781800409767,"score_gpt":0.2950765841365649,"score_spread":0.27678780233615513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575008982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27116245,0.0002131935,0.7217259,0.00168101,0.0018727707,0.000828392,0.000021700454,0.00022707199,0.0022674997],"genre_scores_gemma":[0.98565906,0.000014902632,0.013399967,0.000034479668,0.0000066164994,0.000019007668,0.0000010940768,0.0000127373205,0.00085210585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998824,0.00005498689,0.0001708755,0.00030539517,0.00031880956,0.00032596124],"domain_scores_gemma":[0.9985009,0.00048302868,0.00008570404,0.00063097733,0.00014665397,0.00015276355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003730121,0.0001049049,0.00016669801,0.00017233325,0.000081786005,0.000019803401,0.0009738239,0.0000578845,0.000025465008],"category_scores_gemma":[0.00015184346,0.00007781702,0.00010755088,0.00041800298,0.00007934264,0.00039668425,0.00017715809,0.0000595654,0.000043971966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060610546,0.00004063538,0.00079227204,0.00001007413,0.000015231751,0.0000019404108,0.000085669504,5.967924e-7,0.00884549,0.9592146,0.006098294,0.024834566],"study_design_scores_gemma":[0.0019066843,0.00032417386,0.00049273093,0.000035446494,0.0000027120998,0.0000018639618,0.000007083006,0.000071501505,0.05584514,0.9355717,0.005632339,0.000108659515],"about_ca_topic_score_codex":0.000008073049,"about_ca_topic_score_gemma":9.838736e-7,"teacher_disagreement_score":0.7144966,"about_ca_system_score_codex":0.000037867616,"about_ca_system_score_gemma":0.00010903702,"threshold_uncertainty_score":0.3173286},"labels":[],"label_agreement":null},{"id":"W2575159521","doi":"","title":"Star coloring of Cartesian product of paths and cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Star (game theory); Cartesian coordinate system; Product (mathematics); Pure mathematics; Combinatorics; Geometry; Mathematical analysis","score_opus":0.014895824934223171,"score_gpt":0.26191021000611775,"score_spread":0.24701438507189458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575159521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99745446,0.00024334028,0.001193944,0.00026260279,0.00029457244,0.00016341242,0.0000031762963,0.000034823956,0.0003496429],"genre_scores_gemma":[0.9972464,0.00004081222,0.0026352264,0.0000047261547,0.000002805241,0.0000075473145,1.2284517e-7,0.00000748141,0.000054875934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989794,0.00008115295,0.00019304692,0.00027165783,0.00025731593,0.00021743793],"domain_scores_gemma":[0.9989118,0.00020492577,0.00009793723,0.00056384184,0.00014700595,0.00007446471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041734238,0.0000841578,0.00018228157,0.00010336973,0.00003942634,0.000009724274,0.0005007002,0.00002540484,0.0000035466496],"category_scores_gemma":[0.00015332577,0.000062654224,0.000030078494,0.00031028304,0.00020002904,0.00032154514,0.00028366598,0.000058703306,0.0000029809082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012792488,0.000047243804,0.010932989,0.000030190076,0.000011962596,0.000004393258,0.000261295,5.4656914e-7,0.049188517,0.92342466,0.000025792902,0.016059617],"study_design_scores_gemma":[0.0006613266,0.00022003976,0.01744068,0.00006542153,0.0000028154154,0.0000037125685,0.00002270593,0.00006812126,0.18828477,0.79294837,0.00017559553,0.00010644864],"about_ca_topic_score_codex":0.000010114953,"about_ca_topic_score_gemma":0.0000015676751,"teacher_disagreement_score":0.13909625,"about_ca_system_score_codex":0.000021255742,"about_ca_system_score_gemma":0.000051239953,"threshold_uncertainty_score":0.2554965},"labels":[],"label_agreement":null},{"id":"W2575188506","doi":"","title":"On the signed star domination numbers of trees.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Combinatorics; Mathematical analysis","score_opus":0.014020620469574039,"score_gpt":0.26280127864075636,"score_spread":0.24878065817118233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575188506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97072506,0.00004119183,0.018927705,0.0036305678,0.0007772025,0.00032909375,0.000004243845,0.00008904623,0.0054758615],"genre_scores_gemma":[0.99879724,0.000006423268,0.00045444365,0.00006973823,0.000002371355,0.000018756993,3.198064e-7,0.000008323383,0.0006423722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987434,0.00020427014,0.00015829627,0.00024070089,0.0004280231,0.00022531534],"domain_scores_gemma":[0.9976145,0.0013570744,0.00009144236,0.00075221737,0.00012993261,0.00005485534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611898,0.00009426819,0.000113310445,0.0000876647,0.00009129619,0.00002366756,0.0009355222,0.000037869933,0.00006595392],"category_scores_gemma":[0.0003652589,0.000051564974,0.000057925135,0.00042880786,0.00016563137,0.0002946147,0.00016152718,0.000079965124,0.000104350875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024359328,0.00005418022,0.000092199756,0.0000018895222,0.000009668,0.0000022309882,0.00012520506,0.0000020203495,0.009905403,0.97884065,0.0010105438,0.009931628],"study_design_scores_gemma":[0.0006378954,0.00017483991,0.0006497998,0.000024151455,0.0000013991041,6.78987e-7,0.00001676723,0.00014303178,0.04449695,0.9534907,0.00028690396,0.000076934426],"about_ca_topic_score_codex":0.000006138926,"about_ca_topic_score_gemma":0.000004704879,"teacher_disagreement_score":0.034591544,"about_ca_system_score_codex":0.000059119728,"about_ca_system_score_gemma":0.000042964002,"threshold_uncertainty_score":0.21027586},"labels":[],"label_agreement":null},{"id":"W2575220639","doi":"","title":"Arc-Transitive Pentavalent Graphs Of Order Four Times A Prime Power.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Prime power; Arc (geometry); Prime (order theory); Order (exchange); Combinatorics; Discrete mathematics; Geometry; Business","score_opus":0.013361877877724427,"score_gpt":0.2661985043003224,"score_spread":0.25283662642259797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575220639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89196706,0.00037491194,0.09515663,0.0021386,0.0017548123,0.00085136946,0.000020870526,0.0003203867,0.0074153533],"genre_scores_gemma":[0.99568534,0.000041439616,0.003577696,0.000044630247,0.0000023079315,0.000021752125,5.983188e-7,0.000018921104,0.00060732476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979903,0.00021105631,0.0002791312,0.0004730639,0.0005768807,0.0004695751],"domain_scores_gemma":[0.99808365,0.0004022398,0.00011931525,0.0008648786,0.00037033774,0.00015957445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048417418,0.00018867802,0.00026330305,0.00022194447,0.000092339375,0.000029993906,0.0011618823,0.00006625533,0.00011166351],"category_scores_gemma":[0.00013799436,0.00013800903,0.00012454961,0.00078771415,0.00025471227,0.0005380211,0.00031260657,0.00013794121,0.00012470991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038248145,0.0001399739,0.0020478207,0.000008751672,0.00004758937,0.00001913016,0.00040792284,8.012318e-7,0.016386734,0.9767468,0.00026477248,0.003891446],"study_design_scores_gemma":[0.0012802569,0.00034958232,0.005602774,0.00007198446,0.0000057612874,0.000013206648,0.00002959452,0.00006783987,0.048430692,0.94353765,0.00039799197,0.00021267415],"about_ca_topic_score_codex":0.000008367284,"about_ca_topic_score_gemma":0.0000014421541,"teacher_disagreement_score":0.10371827,"about_ca_system_score_codex":0.00005194709,"about_ca_system_score_gemma":0.000120818666,"threshold_uncertainty_score":0.56278443},"labels":[],"label_agreement":null},{"id":"W2575803557","doi":"","title":"The Structure and Automorphisms of Semi-directed Graphs.","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Automorphism; Computer science; Mathematics; Combinatorics","score_opus":0.010183790082802537,"score_gpt":0.25503622250835684,"score_spread":0.2448524324255543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575803557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5024927,0.0009449071,0.48426923,0.007519127,0.00036839652,0.00046607372,0.00002035779,0.00075766037,0.0031615193],"genre_scores_gemma":[0.986014,0.00007191046,0.012767998,0.00003791488,0.0000057137804,0.0000018585009,1.00512345e-7,0.0000041643234,0.0010963039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925905,0.00007041906,0.000103047096,0.00018270599,0.0001962305,0.00018855],"domain_scores_gemma":[0.9989056,0.00045733745,0.00003868016,0.00045406804,0.000087446206,0.00005688879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019426085,0.00006431739,0.0000765351,0.00005706821,0.00010740901,0.000029511806,0.00058947713,0.000028141689,0.00002619818],"category_scores_gemma":[0.00008422663,0.000027110831,0.000022583952,0.00032683596,0.0002830402,0.00019285169,0.000224297,0.00005287009,0.000002796518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007049623,0.0000042527545,0.0012269638,0.000002535725,0.000011656981,0.0000016194834,0.000059052065,7.182258e-7,0.06161418,0.82116336,0.00053598033,0.11537265],"study_design_scores_gemma":[0.0002900976,0.00006059379,0.008209822,0.000012182614,0.0000012797576,0.00001516512,0.0000071535255,0.0012568078,0.109680705,0.8782569,0.0021270448,0.00008220438],"about_ca_topic_score_codex":0.0000039947245,"about_ca_topic_score_gemma":0.000011692689,"teacher_disagreement_score":0.4835213,"about_ca_system_score_codex":0.000006304339,"about_ca_system_score_gemma":0.000020639953,"threshold_uncertainty_score":0.11055476},"labels":[],"label_agreement":null},{"id":"W2576316065","doi":"","title":"Bicoloured ordered trees, non-nesting partitions and non-crossing partitions.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Nesting (process); Combinatorics","score_opus":0.020219836248142803,"score_gpt":0.28565529809543233,"score_spread":0.2654354618472895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576316065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9307578,0.000119423035,0.06374547,0.0025872611,0.0008484282,0.00035491766,0.0000090546255,0.0002754419,0.0013021748],"genre_scores_gemma":[0.99216455,0.000020632966,0.0072885333,0.00008211111,0.00001323031,0.0000803336,0.000001955527,0.000019783522,0.00032884616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821997,0.00011466116,0.00027460844,0.0005183177,0.0002935199,0.0005789325],"domain_scores_gemma":[0.99828726,0.00050582294,0.000102514365,0.0006882914,0.00017854618,0.00023753908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046987753,0.0001836423,0.00021053327,0.00016805342,0.00084661273,0.00036361234,0.0005735665,0.000079780584,0.000019474199],"category_scores_gemma":[0.00031886713,0.00014694552,0.000056036017,0.0007474552,0.00039851334,0.0009475981,0.0003696509,0.00016075744,0.000089131274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026926358,0.00026323847,0.018594317,0.000024944618,0.000044776767,0.000074361924,0.0007970377,0.000032682554,0.040623073,0.90805596,0.0022760811,0.029186612],"study_design_scores_gemma":[0.0015523778,0.00014655445,0.020799939,0.00012735135,0.0000071188606,0.000023416944,0.00003077401,0.0019361153,0.006205439,0.9675418,0.0013363407,0.00029273418],"about_ca_topic_score_codex":0.000016472311,"about_ca_topic_score_gemma":0.00002063273,"teacher_disagreement_score":0.061406743,"about_ca_system_score_codex":0.000064086096,"about_ca_system_score_gemma":0.00014047613,"threshold_uncertainty_score":0.65115464},"labels":[],"label_agreement":null},{"id":"W2576567135","doi":"","title":"On the forcing connected geodetic number and the connected geodetic number of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Geodesy; Forcing (mathematics); Combinatorics; Geology; Mathematical analysis","score_opus":0.011563575579334354,"score_gpt":0.26113307531360913,"score_spread":0.24956949973427478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576567135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873401,0.000075101016,0.005480672,0.003226584,0.000559019,0.0006211246,0.000005389884,0.00012425224,0.0025677918],"genre_scores_gemma":[0.9990041,0.00004444336,0.00030821122,0.00027586342,0.0000060600314,0.00008250609,6.150805e-7,0.000025374267,0.0002528165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972666,0.0007576243,0.00036400152,0.00050155044,0.0005636779,0.0005465495],"domain_scores_gemma":[0.99093276,0.0071512633,0.00019560636,0.0013058162,0.00029638,0.00011818534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012680739,0.00024862573,0.0003525041,0.000079562706,0.00034318256,0.000096649645,0.0013688419,0.0000898778,0.00013902296],"category_scores_gemma":[0.0012628357,0.000119401004,0.00012493695,0.00086919736,0.0009631207,0.00028324235,0.00050183636,0.0002872559,0.00012554103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012719516,0.00005407943,0.002065991,0.000010260004,0.000054783446,0.0000068011186,0.00045829525,0.000002632995,0.0008368265,0.9950205,0.0002909193,0.0010717269],"study_design_scores_gemma":[0.0033173768,0.000080872356,0.0021038572,0.000107921616,0.000014657662,0.00003528188,0.00006100254,0.0012160947,0.0036043113,0.9891614,0.0001039166,0.00019333416],"about_ca_topic_score_codex":0.00004590515,"about_ca_topic_score_gemma":0.0000070621345,"teacher_disagreement_score":0.011664045,"about_ca_system_score_codex":0.000037750186,"about_ca_system_score_gemma":0.000059663478,"threshold_uncertainty_score":0.48690316},"labels":[],"label_agreement":null},{"id":"W2577346904","doi":"","title":"p-Factor-Criticality of Vertex-Transitive Graphs with Large Girth.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Transitive relation; Vertex (graph theory); Odd graph; Criticality; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Physics","score_opus":0.01251476753406263,"score_gpt":0.2697306604009778,"score_spread":0.2572158928669152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577346904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94107157,0.0000826201,0.05475274,0.0007159336,0.00051910774,0.0002797523,0.000036827416,0.00016758671,0.0023738903],"genre_scores_gemma":[0.99859893,0.000016083663,0.0012276237,0.00005525968,0.0000016508353,0.000014409659,6.5341106e-7,0.000014922267,0.0000704738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980292,0.00021869713,0.00022381208,0.00044863852,0.000545854,0.00053382554],"domain_scores_gemma":[0.9979823,0.00058322714,0.00006112919,0.0008544087,0.00033617963,0.0001827225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039408225,0.00017075006,0.00026478356,0.00013410946,0.0000891558,0.000024620975,0.000876513,0.00006882871,0.000029078134],"category_scores_gemma":[0.00013350582,0.00011187983,0.00007926424,0.00065870717,0.00032926342,0.00049922825,0.00018709255,0.0001547806,0.000020621477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053730637,0.00017178337,0.008716118,0.000015000127,0.000033307162,0.00002423826,0.00020378147,1.2650699e-7,0.004386036,0.98405486,0.000023359136,0.002317673],"study_design_scores_gemma":[0.0016430388,0.00035393922,0.015435699,0.00007214908,0.0000047519643,0.000006684253,0.000022773404,0.00008233593,0.03075664,0.95126915,0.00015536854,0.00019748253],"about_ca_topic_score_codex":0.000009684855,"about_ca_topic_score_gemma":0.000006455471,"teacher_disagreement_score":0.057527382,"about_ca_system_score_codex":0.00004232238,"about_ca_system_score_gemma":0.00008918684,"threshold_uncertainty_score":0.45623273},"labels":[],"label_agreement":null},{"id":"W2577389189","doi":"","title":"Enumeration of the degree sequences of 3-connected graphs and cactus graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Cactus; Degree (music); Combinatorics; Biology; Botany; Physics","score_opus":0.026795077744073213,"score_gpt":0.2623174185012079,"score_spread":0.23552234075713466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577389189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99696755,0.00024533417,0.0014614307,0.00041247628,0.00048173277,0.000167549,0.000004333684,0.00003504052,0.00022456629],"genre_scores_gemma":[0.99916923,0.00005739041,0.0007021306,0.0000166087,8.4601027e-7,0.000009016708,2.2321824e-7,0.000005582752,0.00003899357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988435,0.00018824328,0.00021813456,0.00023576351,0.00032367875,0.00019068187],"domain_scores_gemma":[0.9986062,0.00039512024,0.00015938719,0.0005816981,0.00020348106,0.00005408443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035618665,0.000098461845,0.00015762083,0.00012143619,0.00009457259,0.000017044486,0.00074943184,0.000050053284,0.000007813242],"category_scores_gemma":[0.00019361505,0.000056378856,0.000061644736,0.0006448225,0.00038871725,0.0003756479,0.00022099083,0.00007851944,0.000001894146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008332768,0.000024201852,0.008572921,0.000009715518,0.000012633742,8.7578246e-7,0.00017983779,8.8794076e-7,0.086187996,0.8976152,0.00002968318,0.007357734],"study_design_scores_gemma":[0.00038670047,0.0000911041,0.016127938,0.000036324967,0.0000033120589,0.000003790413,0.000011346813,0.000048700917,0.18887678,0.79432964,0.000019945064,0.000064396365],"about_ca_topic_score_codex":0.00002894355,"about_ca_topic_score_gemma":0.000010908945,"teacher_disagreement_score":0.10328553,"about_ca_system_score_codex":0.0000139224385,"about_ca_system_score_gemma":0.000058980346,"threshold_uncertainty_score":0.22990629},"labels":[],"label_agreement":null},{"id":"W2577405957","doi":"","title":"Rainbow vertex connection number of dense and sparse graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Connection (principal bundle); Mathematics; Vertex (graph theory); Rainbow; Combinatorics; Dense graph; Graph; Chordal graph; 1-planar graph; Geometry; Physics; Optics","score_opus":0.015736897010209912,"score_gpt":0.2748202763442786,"score_spread":0.25908337933406866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577405957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933584,0.000100884245,0.0042187306,0.00034585973,0.0008059067,0.00013647575,0.0000017960731,0.00008476459,0.0009472017],"genre_scores_gemma":[0.9981265,0.000077584045,0.0015127172,0.00003740134,0.0000020030395,0.000010461312,2.1919584e-7,0.000009817572,0.00022327376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988609,0.00013026678,0.00017687352,0.00031495534,0.00025673307,0.0002602688],"domain_scores_gemma":[0.998744,0.0004112921,0.000078473146,0.0005111034,0.00014061936,0.00011452803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041050217,0.00010972202,0.00016881671,0.000109250395,0.00008150861,0.000026530604,0.00040674864,0.00005735815,0.00002871837],"category_scores_gemma":[0.00020143153,0.000082791135,0.000049313156,0.0004125322,0.00020752862,0.00045304786,0.00022432815,0.00008006217,0.000050554623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022799837,0.000043669857,0.013251919,0.000007762742,0.000015414138,0.000008396706,0.000100308804,2.1556833e-7,0.005303239,0.9683597,0.0002835039,0.012603082],"study_design_scores_gemma":[0.0010629469,0.000086206666,0.006555312,0.000038767434,0.0000030476813,0.000030167756,0.000011456909,0.00012324027,0.012102622,0.9795298,0.0003366067,0.00011985806],"about_ca_topic_score_codex":0.000010724923,"about_ca_topic_score_gemma":0.0000019423717,"teacher_disagreement_score":0.012483223,"about_ca_system_score_codex":0.000025803023,"about_ca_system_score_gemma":0.000031204137,"threshold_uncertainty_score":0.33761245},"labels":[],"label_agreement":null},{"id":"W2577800761","doi":"","title":"On the Q-index and index of triangle-free quasi-tree graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Tree (set theory); Discrete mathematics; Computer science","score_opus":0.0168470497386582,"score_gpt":0.25894127368911746,"score_spread":0.24209422395045926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577800761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96739596,0.00024434223,0.020398574,0.0058140606,0.0010002764,0.0005223228,0.000008074498,0.00014172062,0.0044746757],"genre_scores_gemma":[0.99937034,0.000034276694,0.00018086546,0.00011440298,0.0000038176595,0.000024865556,1.457404e-7,0.000013635472,0.00025767426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982227,0.0002625559,0.00023403045,0.00038357452,0.0005443468,0.00035277798],"domain_scores_gemma":[0.9961856,0.0018728204,0.00012466214,0.0015749318,0.00012585842,0.00011610749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088361703,0.0001606695,0.00023048012,0.0002076031,0.00013668553,0.0000469092,0.0018812642,0.00007405761,0.000019127963],"category_scores_gemma":[0.0007659176,0.00008927336,0.000086062,0.0006623064,0.00034840932,0.00031208212,0.0006210588,0.00017910881,0.000019991901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006108655,0.000094128736,0.004567805,0.000005192517,0.000021906913,0.000006302546,0.000097551936,4.5763917e-7,0.00059203233,0.973435,0.00080826215,0.020310296],"study_design_scores_gemma":[0.001859725,0.00032582198,0.007520684,0.000044172568,0.0000023474597,0.000003864192,0.000017717914,0.00026067696,0.0032866066,0.98628277,0.00026864567,0.0001269713],"about_ca_topic_score_codex":0.0000120667955,"about_ca_topic_score_gemma":0.000008679703,"teacher_disagreement_score":0.031974364,"about_ca_system_score_codex":0.000028849792,"about_ca_system_score_gemma":0.000050992476,"threshold_uncertainty_score":0.3640462},"labels":[],"label_agreement":null},{"id":"W2578103029","doi":"","title":"Tournaments whose indecomposability graph admits a vertex cover of size 2.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Vertex cover; Cover (algebra); Discrete mathematics","score_opus":0.014072295542171206,"score_gpt":0.2799166196258348,"score_spread":0.2658443240836636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578103029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902147,0.00009378173,0.0060441014,0.00057433086,0.0012860699,0.00029944288,0.000009331311,0.00010951905,0.0013687013],"genre_scores_gemma":[0.9976146,0.000028038065,0.0019070709,0.00007853169,0.0000032064675,0.000018932293,3.3533476e-7,0.000014368344,0.0003348944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774474,0.00026405457,0.0003725613,0.00049803866,0.00064527994,0.00047534742],"domain_scores_gemma":[0.9969512,0.001165417,0.0001627255,0.0012223667,0.00026552594,0.00023272369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073091063,0.00018676533,0.0002995826,0.00013264162,0.00009740594,0.000043157685,0.0015648645,0.000087626424,0.000104133374],"category_scores_gemma":[0.00076482864,0.00013713216,0.00013839696,0.00072286645,0.0002366648,0.0008213213,0.00059986225,0.00016693129,0.00012015118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008557629,0.00042691603,0.039056506,0.000021482545,0.00005718512,0.000016532038,0.00020853197,0.0000025398867,0.010717762,0.9334832,0.001001737,0.014922025],"study_design_scores_gemma":[0.0017444192,0.00026348344,0.028254889,0.00006435899,0.0000037733764,0.000005323536,0.0000060441234,0.000076520904,0.015494641,0.9533385,0.00056026794,0.00018778454],"about_ca_topic_score_codex":0.000008276502,"about_ca_topic_score_gemma":0.0000013578108,"teacher_disagreement_score":0.019855287,"about_ca_system_score_codex":0.00011112187,"about_ca_system_score_gemma":0.00012413289,"threshold_uncertainty_score":0.5592087},"labels":[],"label_agreement":null},{"id":"W2578758224","doi":"","title":"On The Detour Monophonic Number of a Graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.015210940631470826,"score_gpt":0.27634517660121527,"score_spread":0.26113423596974444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578758224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852639,0.00003816458,0.007581431,0.001776505,0.0007240627,0.00019076317,0.0000019648023,0.00008168964,0.004341529],"genre_scores_gemma":[0.99883235,0.000019823965,0.00060562225,0.000105796615,0.0000026667872,0.000025895415,7.748623e-8,0.000010498543,0.0003972698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870276,0.00017649881,0.00016438933,0.00027070782,0.00038054213,0.00030512715],"domain_scores_gemma":[0.99758977,0.0011009873,0.00008020441,0.0010479053,0.00010842611,0.000072707895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050322997,0.000111132555,0.00013165265,0.00007189511,0.00009969133,0.000025104024,0.0014193669,0.000041895775,0.00007338985],"category_scores_gemma":[0.00022680391,0.00005825216,0.00008915664,0.00059399765,0.00016424137,0.0002166775,0.00027505253,0.00012459098,0.0003277231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137328825,0.00005584227,0.0010351735,0.000002169225,0.000013976263,0.000004568932,0.000071466595,9.336046e-7,0.002096432,0.99257964,0.0008975504,0.003228486],"study_design_scores_gemma":[0.00041167636,0.00008561904,0.0010315052,0.00002925264,0.0000013269381,0.000004360851,0.0000071859276,0.000053873577,0.016463008,0.9815552,0.0002704935,0.00008646517],"about_ca_topic_score_codex":0.000005666423,"about_ca_topic_score_gemma":8.7754194e-7,"teacher_disagreement_score":0.0143665755,"about_ca_system_score_codex":0.000032647695,"about_ca_system_score_gemma":0.000047990343,"threshold_uncertainty_score":0.42123267},"labels":[],"label_agreement":null},{"id":"W2578989106","doi":"","title":"A characterization of the graphs with high degree sum that are not covered by three cycles.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Characterization (materials science); Combinatorics; Discrete mathematics; Materials science; Nanotechnology","score_opus":0.0214172698619869,"score_gpt":0.23372365351360555,"score_spread":0.21230638365161864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578989106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9823594,0.000019553374,0.015390423,0.0011268881,0.0005606246,0.0003284343,0.00004233433,0.00007604288,0.000096309595],"genre_scores_gemma":[0.9994195,0.000019083329,0.00024522888,0.000096616786,0.0000027649467,0.000029319204,0.0000031397924,0.000019103054,0.00016521575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983537,0.00013120129,0.00017600863,0.00037647662,0.0006296552,0.0003329579],"domain_scores_gemma":[0.99820477,0.00018528377,0.0002621755,0.0010908757,0.00017335135,0.00008352709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025566647,0.0001674038,0.00020832253,0.000083487874,0.00014433004,0.00005099237,0.0014619344,0.00006870269,0.000010379301],"category_scores_gemma":[0.000053716663,0.000091122696,0.00006598992,0.00063678087,0.0002648295,0.0006302111,0.0003626952,0.00012750394,0.0000122244655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006597638,0.00007456821,0.04853521,0.000011265043,0.00002960461,0.0000034956374,0.00006090829,6.72259e-7,0.12729444,0.82075876,0.00011412827,0.0030509687],"study_design_scores_gemma":[0.001314173,0.00012282083,0.22774366,0.000108256325,0.000006052297,0.0000043743225,0.000005835935,0.000050191607,0.23142292,0.538875,0.00016239553,0.0001843219],"about_ca_topic_score_codex":0.00001986247,"about_ca_topic_score_gemma":0.000019219051,"teacher_disagreement_score":0.28188375,"about_ca_system_score_codex":0.00006303852,"about_ca_system_score_gemma":0.00006945462,"threshold_uncertainty_score":0.37158757},"labels":[],"label_agreement":null},{"id":"W2579056633","doi":"10.4230/lipics.isaac.2016.20","title":"Degree-Constrained Orientation of Maximum Satisfaction : Graph Classes and Parameterized Complexity","year":2016,"lang":"en","type":"article","venue":"TU/e Research Portal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Combinatorics; Treewidth; Mathematics; Chordal graph; Pathwidth; Degeneracy (biology); Discrete mathematics; Parameterized complexity; Indifference graph; Split graph; 1-planar graph; Independent set; Bipartite graph; Bounded function; Time complexity; Clique-sum; Graph; Line graph","score_opus":0.14200655131551848,"score_gpt":0.3923633862723219,"score_spread":0.25035683495680344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579056633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81179386,0.000057878326,0.18530035,0.0005982514,0.00007790379,0.00045474604,0.000029156488,0.00008961822,0.0015982058],"genre_scores_gemma":[0.97935146,0.000102282356,0.020352975,0.000007983625,0.000022092829,0.0000416793,0.0000041171984,0.000011428287,0.00010599652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969249,0.0005559213,0.00034013638,0.000516496,0.0010597224,0.00060286076],"domain_scores_gemma":[0.99760866,0.00096271065,0.0001124418,0.0005980569,0.0004831576,0.00023497287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001916721,0.00013813727,0.00023332932,0.0005300313,0.00021214779,0.00008019743,0.00047195755,0.0000719924,0.0001495928],"category_scores_gemma":[0.0006345566,0.00010092102,0.000066728004,0.00090879673,0.0015009316,0.00088829227,0.00033244886,0.00024536776,0.000021035044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025894988,0.00010233112,0.038497645,0.0000713981,0.000063183994,0.000076286306,0.00031022076,0.0000012748405,0.18015963,0.40550113,0.00022067147,0.3747373],"study_design_scores_gemma":[0.002040593,0.000761446,0.2550259,0.000095174175,0.0000051580273,0.000097342236,0.00031439855,0.00059660646,0.033543788,0.70706195,0.00017085581,0.00028682462],"about_ca_topic_score_codex":0.00012088561,"about_ca_topic_score_gemma":0.000102714235,"teacher_disagreement_score":0.37445045,"about_ca_system_score_codex":0.00003579099,"about_ca_system_score_gemma":0.00017019197,"threshold_uncertainty_score":0.55302453},"labels":[],"label_agreement":null},{"id":"W2579231286","doi":"","title":"Domination numbers of m-cactus chains","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cactus; Mathematics; Equidistant; Combinatorics; Domination analysis; Graph; Invariant (physics); Upper and lower bounds; Discrete mathematics; Geometry; Botany; Biology; Mathematical analysis","score_opus":0.013307967540432569,"score_gpt":0.274592659922865,"score_spread":0.26128469238243246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579231286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83809507,0.00008515379,0.14767699,0.0019487316,0.0022393523,0.00033551146,0.00000466154,0.00021695676,0.009397578],"genre_scores_gemma":[0.9968379,0.000019932564,0.0022898074,0.00002603436,0.0000035755613,0.000012016044,3.661746e-7,0.000008689493,0.00080167875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988605,0.00009923646,0.00017731592,0.0002541731,0.0003475476,0.0002612647],"domain_scores_gemma":[0.99872696,0.00032474927,0.00009519837,0.00060714764,0.00015979067,0.00008617065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042051414,0.000091615715,0.00013498506,0.00013709681,0.00005779746,0.00001781434,0.00080794835,0.000048423186,0.000029468172],"category_scores_gemma":[0.00019598096,0.00006703715,0.0000566147,0.000447394,0.0001215137,0.00050763873,0.0002097863,0.00006712791,0.0000871083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009709932,0.00004728458,0.0007875039,0.000005036361,0.000008640507,0.0000038011735,0.00015379618,8.866158e-7,0.00978834,0.96351063,0.00023155498,0.025452795],"study_design_scores_gemma":[0.0009008443,0.00009954457,0.0021194657,0.00002598915,0.0000015607444,0.0000034052007,0.00001113505,0.00021796128,0.04710258,0.9486388,0.00076952623,0.00010918859],"about_ca_topic_score_codex":0.0000061244455,"about_ca_topic_score_gemma":0.000001492847,"teacher_disagreement_score":0.15874285,"about_ca_system_score_codex":0.000062320214,"about_ca_system_score_gemma":0.000047575035,"threshold_uncertainty_score":0.27336955},"labels":[],"label_agreement":null},{"id":"W2579377738","doi":"","title":"On the {4, -k}-hypomorphy for digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.022155598587601417,"score_gpt":0.273440382427533,"score_spread":0.2512847838399316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579377738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5492726,0.00028479352,0.38114226,0.044280965,0.006227825,0.002721898,0.000036965503,0.0008904794,0.015142238],"genre_scores_gemma":[0.99758863,0.000011104864,0.0010279844,0.00047401458,0.0000066437697,0.00015321285,3.6927904e-7,0.000014388039,0.0007236603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871624,0.00010550647,0.0001303297,0.00034005576,0.00030982186,0.00039805734],"domain_scores_gemma":[0.99635184,0.0024085536,0.000053332085,0.00097573386,0.00011974267,0.00009078634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894626,0.00012461636,0.000114628354,0.00009104877,0.00024448126,0.00007135181,0.0014965994,0.000041126288,0.000021966265],"category_scores_gemma":[0.00044449215,0.00006267566,0.00010422698,0.00040698083,0.00014657217,0.0002629892,0.00019480621,0.00009429051,0.00014673217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020208596,0.0000430523,0.00009075673,0.0000019393965,0.000012157647,0.0000021692108,0.00004135097,5.4128e-7,0.0014665305,0.9832601,0.007458332,0.007602842],"study_design_scores_gemma":[0.0006103651,0.00022814941,0.00023098322,0.000018862747,0.0000013658769,0.0000017949513,0.0000045290562,0.000117531556,0.009764095,0.98209554,0.006813808,0.000112969356],"about_ca_topic_score_codex":0.0000011568305,"about_ca_topic_score_gemma":5.941772e-7,"teacher_disagreement_score":0.44831607,"about_ca_system_score_codex":0.00003499198,"about_ca_system_score_gemma":0.00003509444,"threshold_uncertainty_score":0.27810788},"labels":[],"label_agreement":null},{"id":"W2579740192","doi":"","title":"Weakly convex and convex domination numbers of some products of graphs","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Convex set; Convex polytope; Subderivative; Dominating set; Convex analysis; Regular polygon; Discrete mathematics; Graph; Vertex (graph theory); Convex optimization; Geometry","score_opus":0.01142241835444885,"score_gpt":0.2557556759484341,"score_spread":0.24433325759398528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579740192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99587876,0.00026992167,0.0013129307,0.0008600135,0.0007252185,0.0003083765,0.000004818334,0.000050727715,0.0005892355],"genre_scores_gemma":[0.9981919,0.00008431472,0.0014995246,0.000019006635,0.0000031390703,0.000012001383,5.863228e-7,0.000010145563,0.00017936516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985896,0.00013590517,0.00028279333,0.00035962352,0.00038686203,0.00024525376],"domain_scores_gemma":[0.99837446,0.0003550345,0.00019811894,0.0006178084,0.00036994388,0.00008464653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061708945,0.000120733544,0.0002634749,0.00020074053,0.000048400943,0.000015085022,0.0005813975,0.000058866564,0.0000075268576],"category_scores_gemma":[0.00031102015,0.00009280123,0.00004196844,0.00053562,0.0004537711,0.00075085106,0.00023799669,0.00007879346,0.000008482934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002514043,0.000064010084,0.002972487,0.000047803445,0.000019733121,0.0000022377078,0.0002258098,2.0262993e-7,0.06757993,0.9225103,0.000127096,0.006425194],"study_design_scores_gemma":[0.000949916,0.00017550454,0.0046778913,0.000047482175,0.0000037904358,0.000003899621,0.000019598327,0.000050219573,0.19357313,0.8002731,0.00012326213,0.000102153],"about_ca_topic_score_codex":0.000008973287,"about_ca_topic_score_gemma":5.301548e-7,"teacher_disagreement_score":0.1259932,"about_ca_system_score_codex":0.00002343884,"about_ca_system_score_gemma":0.000071260016,"threshold_uncertainty_score":0.37843242},"labels":[],"label_agreement":null},{"id":"W2579796062","doi":"","title":"Matchings in 4-total restrained domination vertex critical graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.012588696912176423,"score_gpt":0.28900393182183975,"score_spread":0.27641523490966335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579796062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751697,0.00005469703,0.016637854,0.004570067,0.0014042413,0.00022005249,0.0000026705063,0.00019441104,0.0017462665],"genre_scores_gemma":[0.9969677,0.00000955756,0.0027401072,0.000068658905,0.0000033397641,0.000030868232,6.561528e-7,0.000013702085,0.00016545576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816984,0.00020036519,0.00024816708,0.0004534472,0.0004405998,0.00048756498],"domain_scores_gemma":[0.99821395,0.000919715,0.00003828293,0.00056800357,0.000115959876,0.00014407598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007029329,0.00014304451,0.00017068253,0.00030164528,0.000096147414,0.00007659387,0.00080647087,0.00008335273,0.000023980258],"category_scores_gemma":[0.00083946576,0.00011268488,0.00006246703,0.0007049579,0.0001970613,0.0010414144,0.00027274218,0.00019005011,0.00010737961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022454813,0.000087895765,0.0009666374,0.000006575982,0.0000035189312,0.0000516172,0.00016261492,5.934602e-7,0.006992392,0.97996444,0.00015541559,0.011585846],"study_design_scores_gemma":[0.0011778458,0.00010743047,0.014824588,0.000054138967,0.0000011220504,0.000017034368,0.000012880411,0.00042025823,0.0027448656,0.98040676,0.00006757717,0.00016551274],"about_ca_topic_score_codex":0.000011330757,"about_ca_topic_score_gemma":0.0000034959075,"teacher_disagreement_score":0.021797914,"about_ca_system_score_codex":0.000101951984,"about_ca_system_score_gemma":0.00005961842,"threshold_uncertainty_score":0.4595156},"labels":[],"label_agreement":null},{"id":"W2582739324","doi":"10.48550/arxiv.1401.5714","title":"Reconfiguration of Dominating Sets","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Control reconfiguration; Graph; Domination analysis; Adjacency list; Discrete mathematics; Connected dominating set; Computer science","score_opus":0.078056358029308,"score_gpt":0.22691487864325507,"score_spread":0.14885852061394705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582739324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23644303,0.000017745595,0.75830734,0.000041599673,0.00022046306,0.00018590679,0.000005055864,0.000091993505,0.004686852],"genre_scores_gemma":[0.9930157,0.000034745277,0.0062752664,0.000019159806,0.000024891919,6.9711945e-7,0.000007578433,0.000011192189,0.0006107673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983947,0.00028398892,0.00020486691,0.0007472895,0.00010829649,0.00026085737],"domain_scores_gemma":[0.9978224,0.0002710508,0.00034580464,0.001191307,0.0002707254,0.00009873069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005925042,0.00018453262,0.00028294057,0.00033030388,0.00009267307,0.000046985733,0.0017489172,0.00018561666,0.00002305025],"category_scores_gemma":[0.00012879948,0.00021768043,0.00014782973,0.00047855254,0.00013218014,0.0003381301,0.0013117935,0.00045596578,0.000038702994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034072345,0.000050653773,0.00065684837,0.00016542256,0.000052882646,0.00005681825,0.00028633777,0.14944956,0.0008744157,0.838131,0.00007312365,0.0101688625],"study_design_scores_gemma":[0.000295851,0.00005364061,0.00041260812,0.00010285735,0.000012705637,0.0000025356653,0.000034329943,0.59811616,0.0035493418,0.39706835,0.00010484333,0.00024679076],"about_ca_topic_score_codex":0.000025565467,"about_ca_topic_score_gemma":0.0000076005113,"teacher_disagreement_score":0.75657266,"about_ca_system_score_codex":0.00009424137,"about_ca_system_score_gemma":0.00011383938,"threshold_uncertainty_score":0.887675},"labels":[],"label_agreement":null},{"id":"W2582871424","doi":"10.1007/978-3-319-21840-3_33","title":"The Complexity of Dominating Set Reconfiguration","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control reconfiguration; Computer science; Set (abstract data type); Programming language; Embedded system","score_opus":0.08715331853177619,"score_gpt":0.3293101202288042,"score_spread":0.242156801697028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582871424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005706357,0.00052083796,0.9903318,0.0010289887,0.00083919603,0.00039101302,0.0000069371986,0.00006448012,0.0067596543],"genre_scores_gemma":[0.3790901,0.00009149332,0.61884105,0.0003446469,0.0004611153,0.00002215488,0.000010863342,0.000056336274,0.001082258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964619,0.00011459834,0.00057348976,0.000929028,0.0013522739,0.0005686619],"domain_scores_gemma":[0.99577576,0.0012404404,0.00045165617,0.0016020047,0.0007878387,0.0001423226],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034442528,0.00032629035,0.00040718575,0.00047167935,0.00042240223,0.00034431426,0.004456886,0.00017229612,0.000009809387],"category_scores_gemma":[0.00048075803,0.00024026626,0.000100426885,0.0007040975,0.0035128111,0.0005758151,0.0013444663,0.00078438624,0.000018646764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010996696,0.000007848065,0.0000065457607,0.00001847358,0.000006644573,0.0000110210185,0.0007910124,0.0061298767,0.00020782824,0.4133504,0.000025199779,0.57943416],"study_design_scores_gemma":[0.00014500412,0.00011503696,0.000021119813,0.000119657976,0.0000017485751,0.000024453937,6.1470485e-7,0.21559024,0.001841123,0.78097373,0.00094370806,0.00022356353],"about_ca_topic_score_codex":0.000011714641,"about_ca_topic_score_gemma":0.00010747129,"teacher_disagreement_score":0.5792106,"about_ca_system_score_codex":0.00025869027,"about_ca_system_score_gemma":0.0006245102,"threshold_uncertainty_score":0.99919903},"labels":[],"label_agreement":null},{"id":"W2585451022","doi":"10.1016/j.dam.2016.08.016","title":"Characterizations of (<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs","year":2016,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Induced subgraph; Algorithm; Discrete mathematics","score_opus":0.019238483340077613,"score_gpt":0.2523574263767693,"score_spread":0.23311894303669167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585451022","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44472525,0.0034762586,0.007671399,0.0020020227,0.00830768,0.00030462389,0.004280753,0.0014489769,0.52778304],"genre_scores_gemma":[0.93907034,0.007320685,0.015786948,0.004661042,0.00707408,0.0089998245,0.010082063,0.005477249,0.0015277485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9545386,0.0022834204,0.009774056,0.008854216,0.012652464,0.011897236],"domain_scores_gemma":[0.9583513,0.0089552915,0.011763962,0.0135365445,0.0011967296,0.006196177],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.009604784,0.0051839035,0.0020972276,0.0035273777,0.0075633256,0.0075277165,0.014389951,0.010694209,0.63472295],"category_scores_gemma":[0.008682413,0.00980366,0.00957345,0.007348282,0.010064878,0.008196932,0.013685564,0.008366873,0.010359456],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056710006,0.0017125801,0.000028106337,0.005207442,0.0063468837,0.00459818,0.0049007363,0.0035526431,0.011041787,0.60014683,0.35370788,0.0030859627],"study_design_scores_gemma":[0.008012619,0.0049968516,0.0001609187,0.0058920295,0.0063194106,0.005413761,0.0051003215,0.14240089,0.80239666,0.00090219703,0.010667611,0.0077367155],"about_ca_topic_score_codex":0.0035822017,"about_ca_topic_score_gemma":0.005484938,"teacher_disagreement_score":0.7913549,"about_ca_system_score_codex":0.00012767881,"about_ca_system_score_gemma":0.008348068,"threshold_uncertainty_score":0.9996679},"labels":[],"label_agreement":null},{"id":"W2585703313","doi":"10.1016/j.jctb.2018.06.007","title":"The list chromatic number of graphs with small clique number","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Clique number; Chromatic scale; Mathematics; Clique; Graph; Discrete mathematics","score_opus":0.01616007451721822,"score_gpt":0.2906845463848654,"score_spread":0.27452447186764717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585703313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80368775,0.0010821401,0.134869,0.0016304695,0.031863097,0.0016351908,0.000030034082,0.00019641711,0.025005883],"genre_scores_gemma":[0.96934897,0.000609779,0.027790824,0.00006677734,0.0011670225,0.00003696149,0.0000023319672,0.00009617916,0.00088118063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994725,0.0017190281,0.0013171685,0.0004211068,0.0012361651,0.00058155315],"domain_scores_gemma":[0.99157786,0.001841116,0.0024114982,0.0017747305,0.0021382095,0.0002565867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005745589,0.00049301784,0.0010052162,0.00017786706,0.00038775514,0.00043984933,0.0048273276,0.00033343933,0.00010063447],"category_scores_gemma":[0.00079067127,0.00030632553,0.00049479713,0.0006560185,0.001749613,0.0007062634,0.0017985228,0.0017402902,0.000018518163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018493156,0.00016536571,0.0006270641,0.00015337858,0.000442028,0.00007539678,0.0008021572,0.000029272058,0.000072764495,0.994336,0.00040302868,0.0010442124],"study_design_scores_gemma":[0.0009990183,0.0007538752,0.00014811692,0.0005581168,0.00005899642,0.00057486043,0.00015869174,0.000023040247,0.0035360784,0.98818344,0.00466933,0.00033641735],"about_ca_topic_score_codex":0.00000826301,"about_ca_topic_score_gemma":0.0000071103245,"teacher_disagreement_score":0.16566117,"about_ca_system_score_codex":0.0001293545,"about_ca_system_score_gemma":0.00092494657,"threshold_uncertainty_score":0.9999389},"labels":[],"label_agreement":null},{"id":"W2586403007","doi":"","title":"Vertex-disjoint cycles passing through specified elements in graphs","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Disjoint sets; Vertex (graph theory); Computer science; Combinatorics; Graph; Mathematics","score_opus":0.031754642399546465,"score_gpt":0.30442901628539404,"score_spread":0.2726743738858476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586403007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2779912,0.00022456188,0.6089138,0.0011324093,0.00031521398,0.00040211543,0.000001861839,0.00035999288,0.11065887],"genre_scores_gemma":[0.9069825,0.000016946242,0.09218202,0.00016414438,0.00002036282,0.00001569805,0.0000024040498,0.000010928577,0.00060502184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825716,0.00007617385,0.00031961146,0.00043832095,0.00039443362,0.0005143244],"domain_scores_gemma":[0.99922067,0.00008882888,0.00005092793,0.0005533464,0.000038970633,0.000047263457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000316004,0.00013809209,0.00015341087,0.0002017104,0.00010765936,0.0001386576,0.0007668406,0.00004043245,0.000068707166],"category_scores_gemma":[0.00001682544,0.00012159217,0.00006241329,0.0008600223,0.00008868417,0.0008203437,0.00029916142,0.00016369259,0.00008510005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010195226,0.00010155643,0.009622913,0.0000047185626,0.0000040661703,0.000036709385,0.00009784365,0.00010886602,0.0021215414,0.97579867,0.00070188195,0.011391012],"study_design_scores_gemma":[0.0005349406,0.000033291362,0.037299953,0.000018813294,7.149342e-7,0.0000048433694,0.000057088462,0.0043809023,0.010257666,0.9455747,0.0016447707,0.00019232152],"about_ca_topic_score_codex":0.00019410707,"about_ca_topic_score_gemma":0.00024719638,"teacher_disagreement_score":0.62899125,"about_ca_system_score_codex":0.00006666097,"about_ca_system_score_gemma":0.000028571496,"threshold_uncertainty_score":0.4958385},"labels":[],"label_agreement":null},{"id":"W2589794168","doi":"10.1016/j.dam.2017.01.025","title":"Proximity, remoteness and girth in graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics","score_opus":0.02733397661248872,"score_gpt":0.30344173437951144,"score_spread":0.27610775776702273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589794168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2476076,0.00007441408,0.7107049,0.0006178477,0.00007816522,0.000912865,0.0000040585674,0.00016128096,0.039838865],"genre_scores_gemma":[0.8419137,0.000037068858,0.15785716,0.000032803735,0.000009755605,0.000039931067,8.191703e-7,0.000016302894,0.00009242695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987274,0.000016193517,0.00023134353,0.0003735134,0.00029887125,0.00035269116],"domain_scores_gemma":[0.998109,0.00010793065,0.00015856986,0.0014928994,0.000030744668,0.00010085409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005779436,0.00015969921,0.00024353013,0.00013375169,0.00030264497,0.0003414848,0.001482877,0.00006235171,0.0000028705324],"category_scores_gemma":[0.00010482388,0.00013548379,0.00003368582,0.00015247778,0.00025880316,0.0004923914,0.0009878115,0.00019287186,0.000016369724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053816607,0.000035646804,0.00028781177,0.0000972232,0.000006032301,0.000012587572,0.00079377467,0.0000054036927,0.0015511971,0.9810502,0.0000061933843,0.016148534],"study_design_scores_gemma":[0.0004115589,0.000017034476,0.0026704266,0.000044000783,0.0000026572382,0.000010035132,0.000134025,0.011968017,0.0023867153,0.98210716,0.000055528635,0.0001928465],"about_ca_topic_score_codex":0.0000059473073,"about_ca_topic_score_gemma":0.000019042633,"teacher_disagreement_score":0.5943061,"about_ca_system_score_codex":0.0000150499945,"about_ca_system_score_gemma":0.000023475992,"threshold_uncertainty_score":0.55248684},"labels":[],"label_agreement":null},{"id":"W2591604206","doi":"","title":"On the complexity of recognizing tenacious graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.07314943444469264,"score_gpt":0.31333394933723807,"score_spread":0.24018451489254544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591604206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97170234,0.00005755733,0.001771057,0.0045866207,0.001672451,0.00038943547,0.000004795003,0.00012054788,0.019695213],"genre_scores_gemma":[0.99841446,0.000011193766,0.001348589,0.00011467552,0.000002689512,0.000013595181,4.2994225e-7,0.000009643825,0.000084754625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986377,0.00016117308,0.00017931026,0.00030468742,0.00040557943,0.00031155226],"domain_scores_gemma":[0.99693316,0.00044961288,0.00021570754,0.0021668717,0.00015814397,0.0000765267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084811234,0.00012296635,0.00017920152,0.0000862612,0.00080393837,0.00016035682,0.0031725438,0.00004374096,0.000014800578],"category_scores_gemma":[0.00069307984,0.00008523618,0.000094157265,0.00019961693,0.00088619906,0.00034436918,0.0006611826,0.00027734888,0.00005361178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011734351,0.000060697166,0.00073935126,0.000005211622,0.00001529995,0.0000070875362,0.000114586415,0.0000015175791,0.00041415053,0.9945975,0.00042341123,0.003609441],"study_design_scores_gemma":[0.00033026305,0.000121752,0.006092677,0.000028441336,0.0000019326162,0.0000029309629,0.000014799696,0.00064383197,0.006933463,0.9855946,0.00013366608,0.00010168282],"about_ca_topic_score_codex":0.000029072908,"about_ca_topic_score_gemma":0.00000539439,"teacher_disagreement_score":0.026712107,"about_ca_system_score_codex":0.00002250898,"about_ca_system_score_gemma":0.00003480926,"threshold_uncertainty_score":0.6183325},"labels":[],"label_agreement":null},{"id":"W25916205","doi":"10.1007/s13277-015-3292-7","title":"The Linear 2-Arboricity of Outerplanar Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Dense graph; Outerplanar graph; Pathwidth; 1-planar graph; Combinatorics; Chordal graph; Graph; Planar graph; Line graph","score_opus":0.013677726103518254,"score_gpt":0.27601834291488475,"score_spread":0.2623406168113665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25916205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94537467,0.00083015533,0.043708295,0.0026289092,0.0032551659,0.0005139912,0.000005292692,0.0003078423,0.003375701],"genre_scores_gemma":[0.99573547,0.00007242169,0.004044161,0.00006049695,0.0000042071265,0.000011535485,5.989385e-7,0.0000095132045,0.00006162628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986118,0.00009334573,0.00023206828,0.000264831,0.0004400444,0.00035791856],"domain_scores_gemma":[0.9984342,0.00026673934,0.00009857754,0.00093909417,0.00016379237,0.00009763031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058215245,0.0001185568,0.00015212805,0.00009221951,0.00025440642,0.000045296118,0.0016858557,0.000049854414,0.0000016190164],"category_scores_gemma":[0.00013006166,0.000085910215,0.0000908035,0.0008406206,0.0002184481,0.00027327533,0.00031022378,0.00022472285,0.00003229714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010572471,0.000063200336,0.0005713545,0.0000044735048,0.000015664238,0.000009252714,0.0001593453,0.00007795762,0.00032955018,0.99695826,0.00007630678,0.0017240852],"study_design_scores_gemma":[0.0005391344,0.00013636236,0.0012768189,0.000010698865,0.0000021231149,0.0000046064524,0.000016007254,0.00030653548,0.009063171,0.9874137,0.001132117,0.000098735036],"about_ca_topic_score_codex":0.000032391254,"about_ca_topic_score_gemma":0.000005476414,"teacher_disagreement_score":0.05036079,"about_ca_system_score_codex":0.000043323576,"about_ca_system_score_gemma":0.00008641111,"threshold_uncertainty_score":0.3503317},"labels":[],"label_agreement":null},{"id":"W2591800080","doi":"","title":"On the upper broadcast domination number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.020878372076711466,"score_gpt":0.3067115787654745,"score_spread":0.28583320668876305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591800080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8964867,0.000032411015,0.005043782,0.009035218,0.0031415713,0.00044177068,0.0000021325636,0.00016887668,0.08564752],"genre_scores_gemma":[0.9978719,0.000009071874,0.00060488784,0.00020915926,0.000009124543,0.000031205076,5.3778274e-7,0.0000109890225,0.0012531518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870825,0.00013373171,0.000117186064,0.00031259048,0.0004269372,0.00030132188],"domain_scores_gemma":[0.9972964,0.0004512002,0.0001131022,0.0019474082,0.00011688873,0.00007500042],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006822209,0.000117877804,0.00010416037,0.00004289976,0.001063503,0.0004895929,0.002655836,0.000049072274,0.0000682814],"category_scores_gemma":[0.0006048495,0.000083516396,0.000064213724,0.00013460997,0.00018522971,0.0006458231,0.000530905,0.00025168044,0.00086907914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008948858,0.0000454379,0.0009410159,0.0000016469253,0.000007220976,0.000008011005,0.00013422903,0.0000020096077,0.00012898524,0.98539424,0.001974988,0.011353291],"study_design_scores_gemma":[0.0003990328,0.00004962822,0.0069903806,0.000014423007,0.0000012885408,0.000005280507,0.00001194019,0.0012617417,0.002504279,0.98609734,0.0025548136,0.00010986331],"about_ca_topic_score_codex":0.000011021362,"about_ca_topic_score_gemma":0.0000010249406,"teacher_disagreement_score":0.101385154,"about_ca_system_score_codex":0.000048315527,"about_ca_system_score_gemma":0.00003278711,"threshold_uncertainty_score":0.99990886},"labels":[],"label_agreement":null},{"id":"W2591835446","doi":"","title":"The Maximum Size of C 4 -Free Planar Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Combinatorics; Planar graph; Graph; Computer science; Computer graphics (images)","score_opus":0.017474622676120894,"score_gpt":0.27933435601917594,"score_spread":0.26185973334305507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591835446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9102943,0.001363757,0.00475118,0.012130486,0.010068253,0.0010800262,0.000022938526,0.00040941936,0.059879623],"genre_scores_gemma":[0.9974773,0.000072712304,0.0020182848,0.000036836856,0.0000043500495,0.000015562346,2.3577593e-7,0.00001100027,0.0003637458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985539,0.00010254173,0.00020085888,0.00028224176,0.0004746247,0.0003858575],"domain_scores_gemma":[0.99497056,0.0007687832,0.00020945322,0.0038040243,0.00014641999,0.00010078866],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00079248514,0.00012103493,0.00016366939,0.000047669982,0.0009863479,0.00024430876,0.006715743,0.000052416297,0.0000048150773],"category_scores_gemma":[0.0011905548,0.00008834666,0.00009366483,0.0001795205,0.00050799904,0.00047640348,0.0009860396,0.00021077352,0.000025693567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016985909,0.000031926094,0.0020416742,0.000005400742,0.000019900579,0.000012152,0.000078025,6.073996e-7,0.00048433896,0.9904602,0.0015057607,0.0053429925],"study_design_scores_gemma":[0.0006250869,0.00009319661,0.011714225,0.0000114872455,0.0000022946415,0.0000040804125,0.000016335001,0.00011259536,0.003526773,0.9815172,0.0022746087,0.00010212996],"about_ca_topic_score_codex":0.000029675286,"about_ca_topic_score_gemma":0.000011961826,"teacher_disagreement_score":0.087182954,"about_ca_system_score_codex":0.000018286713,"about_ca_system_score_gemma":0.000055041924,"threshold_uncertainty_score":0.9986584},"labels":[],"label_agreement":null},{"id":"W2591852761","doi":"","title":"Panconnectedness of K-trees with Sufficiently Large Toughness.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Tree (set theory); Combinatorics; Composite material; Materials science","score_opus":0.017093275294003507,"score_gpt":0.2818853324690745,"score_spread":0.264792057175071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591852761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805057,0.00009309678,0.013842224,0.00027442788,0.0010020374,0.0002199892,0.0000064096257,0.00011642992,0.0039396775],"genre_scores_gemma":[0.99787587,0.00000674347,0.0017912469,0.000021177237,0.0000048996053,0.00001765952,0.0000013175476,0.000015324735,0.0002657735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837136,0.000081654995,0.00018916333,0.00041091954,0.00048641974,0.00046049056],"domain_scores_gemma":[0.99712867,0.0001564225,0.00024147928,0.002046788,0.0003095277,0.00011713308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047098007,0.00015599917,0.00025906102,0.00011353498,0.0004862533,0.00017698416,0.0026322934,0.000057060217,0.000012054738],"category_scores_gemma":[0.00021910312,0.00012704791,0.000055452216,0.0003103893,0.0002672067,0.0008001332,0.00070575543,0.00017477029,0.000026336138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029844887,0.0002078496,0.022118472,0.000015669315,0.000020860854,0.000033837,0.0003102264,0.000012593814,0.000464998,0.97550565,0.00010388082,0.0011760959],"study_design_scores_gemma":[0.002635934,0.00053702167,0.08367242,0.000096967226,0.000009306584,0.000014287986,0.00014287395,0.0020106907,0.020606792,0.888507,0.0013710539,0.0003956539],"about_ca_topic_score_codex":0.000023787916,"about_ca_topic_score_gemma":0.00005287498,"teacher_disagreement_score":0.08699867,"about_ca_system_score_codex":0.00002608063,"about_ca_system_score_gemma":0.0000986683,"threshold_uncertainty_score":0.5180863},"labels":[],"label_agreement":null},{"id":"W2591927635","doi":"","title":"A Fan-type result on fractional ID-k-factor-critical graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Factor (programming language); Combinatorics; Computer science; Geology; Programming language","score_opus":0.03812353792731751,"score_gpt":0.35103290513582835,"score_spread":0.3129093672085108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591927635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8973958,0.00027254925,0.00999227,0.01161503,0.02343608,0.0008077899,0.00004152992,0.00094523653,0.05549373],"genre_scores_gemma":[0.99776554,0.00001915503,0.0016028682,0.00021784905,0.000022121458,0.000014158376,0.0000027800481,0.000019109926,0.00033640684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976988,0.00014532785,0.00021777322,0.0006100961,0.00078404153,0.0005439701],"domain_scores_gemma":[0.9966298,0.00072454574,0.000105509724,0.0019763536,0.00029991544,0.0002639291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041286796,0.0002005055,0.00020808098,0.00017652744,0.001041181,0.00049585826,0.0023185355,0.00012245157,0.000061845036],"category_scores_gemma":[0.001879405,0.0001920594,0.000093329254,0.00026021796,0.0003684434,0.0011048759,0.00053577154,0.0005651313,0.0004965175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006412146,0.0001471079,0.001516494,0.0000057411744,0.000017006274,0.00006147018,0.00005894721,0.000003412038,0.00068065757,0.99340487,0.0013939987,0.0026461738],"study_design_scores_gemma":[0.00063259207,0.00030571796,0.021053936,0.000023848552,0.0000024446256,0.000011218325,0.000006154222,0.0005666469,0.0026821431,0.9703924,0.0040941336,0.00022874717],"about_ca_topic_score_codex":0.000024478057,"about_ca_topic_score_gemma":0.0000026054347,"teacher_disagreement_score":0.10036977,"about_ca_system_score_codex":0.00007152375,"about_ca_system_score_gemma":0.00010707291,"threshold_uncertainty_score":0.8008028},"labels":[],"label_agreement":null},{"id":"W2591998382","doi":"10.1016/j.dam.2017.02.001","title":"Non-edge orientation and vertex ordering characterizations of some classes of bigraphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Bipartite graph; Interval graph; Chordal graph; Mathematics; Permutation graph; Vertex (graph theory); Complete bipartite graph; Discrete mathematics; Indifference graph; Directed acyclic graph; Pathwidth; Graph; Line graph; 1-planar graph","score_opus":0.022062988815600343,"score_gpt":0.30128016225120774,"score_spread":0.27921717343560737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591998382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4463173,0.000017142454,0.5509936,0.000053299747,0.00005233332,0.00026950872,0.000010443128,0.000026905922,0.0022594605],"genre_scores_gemma":[0.92669433,0.00005196886,0.073159024,0.000006962684,0.000008378153,0.0000237645,0.000004436738,0.000011286981,0.00003984493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999135,0.000006116493,0.000278394,0.00019897868,0.0002233105,0.00015819634],"domain_scores_gemma":[0.9985763,0.00010274474,0.00035470998,0.00083589175,0.00007843814,0.00005193298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018838355,0.000104863175,0.00022586968,0.00012789833,0.00020599959,0.000080580015,0.0006497525,0.000038894304,0.0000030709734],"category_scores_gemma":[0.00007122513,0.00009459517,0.000035190227,0.0001514036,0.00023934711,0.0004783288,0.00034051033,0.0000671257,0.0000027494384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036675676,0.000042596024,0.00025506885,0.00025549482,0.000018978495,5.268668e-7,0.0015597655,0.000012098265,0.1412757,0.8539083,0.0000030538204,0.0026647663],"study_design_scores_gemma":[0.00080456695,0.000090226145,0.012619787,0.00017040099,0.00002773067,0.000003828723,0.00059966865,0.032286063,0.18881725,0.76423633,0.000043413987,0.0003007494],"about_ca_topic_score_codex":0.0000018152173,"about_ca_topic_score_gemma":9.945253e-7,"teacher_disagreement_score":0.48037705,"about_ca_system_score_codex":0.0000058067703,"about_ca_system_score_gemma":0.000025682868,"threshold_uncertainty_score":0.38574788},"labels":[],"label_agreement":null},{"id":"W2592020534","doi":"","title":"The signed cycle domatic number of a graph","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014183076852899861,"score_gpt":0.30502034391492233,"score_spread":0.29083726706202245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592020534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9696911,0.00013030617,0.0073274383,0.0011597428,0.001815884,0.00036109512,0.0000014714219,0.00011538604,0.019397572],"genre_scores_gemma":[0.9975764,0.000016802378,0.0020813646,0.000018567664,0.0000032930395,0.000023449677,1.7426092e-7,0.0000093468425,0.00027060643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872535,0.00012719694,0.00020037062,0.00022755092,0.00039488205,0.00032466024],"domain_scores_gemma":[0.9970052,0.0004651359,0.00020712143,0.0021019618,0.00013682708,0.000083720595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000726495,0.00010362661,0.00015525118,0.000036829017,0.00091763615,0.0002512157,0.0031374805,0.00003978819,0.000009072782],"category_scores_gemma":[0.00036282258,0.00007428445,0.00008870059,0.00019264796,0.0003991176,0.000506726,0.0006488606,0.00013743955,0.00008889899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008788488,0.000040661766,0.0022054634,0.0000074675854,0.000018231953,0.000006082755,0.00014497085,0.0000018697559,0.00038005374,0.99279433,0.00017519773,0.0042168503],"study_design_scores_gemma":[0.00047816077,0.00004010403,0.004909839,0.000016123686,0.0000025263976,0.0000053277267,0.00001794376,0.0008405485,0.0025282796,0.990866,0.00020539585,0.000089773326],"about_ca_topic_score_codex":0.000022610528,"about_ca_topic_score_gemma":0.0000039160846,"teacher_disagreement_score":0.02788529,"about_ca_system_score_codex":0.00001657215,"about_ca_system_score_gemma":0.000043808297,"threshold_uncertainty_score":0.7057808},"labels":[],"label_agreement":null},{"id":"W2592152114","doi":"10.5614/ejgta.2017.5.2.14","title":"On the nullity number of graphs","year":2016,"lang":"fr","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Clique number; Upper and lower bounds; Graph; Clique; Discrete mathematics; Domination analysis; Linear algebra; Vertex (graph theory); Geometry","score_opus":0.32268975650327775,"score_gpt":0.5750101694187498,"score_spread":0.2523204129154721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592152114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.864895,0.03500626,0.04393598,0.011618599,0.003971455,0.0016935962,0.00026936454,0.00007704158,0.038532685],"genre_scores_gemma":[0.9735976,0.018279955,0.00093783316,0.0005697733,0.00016229716,0.000053952383,0.0000010276933,0.00006940511,0.006328187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924464,0.0022312012,0.0013655646,0.0009178853,0.0020096188,0.0010293067],"domain_scores_gemma":[0.98916274,0.005410631,0.0014631667,0.0023127599,0.0011461396,0.00050457584],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00619202,0.0005320968,0.0010427027,0.0007057257,0.0004992962,0.0013167653,0.013180461,0.00020971835,0.034769922],"category_scores_gemma":[0.0020224215,0.0003257994,0.00056235114,0.0031287172,0.0018156676,0.005354714,0.0037917965,0.0008720889,0.00030419117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065587094,0.00093275565,0.16217753,0.000157656,0.00042929652,0.000092132046,0.0003769649,0.00006199646,0.03945656,0.58736855,0.056134094,0.1521566],"study_design_scores_gemma":[0.00058624794,0.000030642004,0.14642794,0.0014905429,0.000037371276,0.000039043596,0.000029188972,0.0000892409,0.04511762,0.7913631,0.014349598,0.00043946836],"about_ca_topic_score_codex":0.0005242939,"about_ca_topic_score_gemma":0.00003412465,"teacher_disagreement_score":0.20399457,"about_ca_system_score_codex":0.00016382487,"about_ca_system_score_gemma":0.00038002522,"threshold_uncertainty_score":0.9999194},"labels":[],"label_agreement":null},{"id":"W2592318313","doi":"10.21914/anziamj.v58i0.10993","title":"Isolated Scattering Number Can be Computed in Polynomial Time for Interval Graphs","year":2017,"lang":"en","type":"article","venue":"ANZIAM Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"China Scholarship Council; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Interval graph; Planarity testing; Combinatorics; Mathematics; Discrete mathematics; Interval (graph theory); Conjecture; Graph theory; Graph; Indifference graph; Chordal graph; 1-planar graph","score_opus":0.029942500811953328,"score_gpt":0.32584863179448786,"score_spread":0.29590613098253454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592318313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64237624,0.000048875085,0.3469558,0.007801841,0.0012004749,0.00038055112,0.00001534897,0.000097675824,0.0011231676],"genre_scores_gemma":[0.98043144,0.000008900031,0.01865819,0.0003228866,0.00018849155,0.000008542307,0.0000020737918,0.000021203656,0.00035825995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983973,0.000108180306,0.0003368324,0.00030795654,0.00025308502,0.00059665926],"domain_scores_gemma":[0.998663,0.00011622537,0.00024030241,0.0006204306,0.00014699051,0.00021304359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081289903,0.00016401608,0.00025163265,0.00023838089,0.00071750814,0.000792053,0.0021735504,0.00007267942,0.000048370603],"category_scores_gemma":[0.000101226186,0.00015567867,0.00015389598,0.00017135142,0.00015447642,0.0009745952,0.0005150562,0.0004959739,0.000032586027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024367364,0.0012825221,0.12461929,0.00015551512,0.00085186865,0.0024286532,0.009390318,0.001426003,0.10865213,0.049561158,0.062293816,0.636902],"study_design_scores_gemma":[0.015104246,0.0015806152,0.10814403,0.0008143851,0.000036271722,0.0053318534,0.0001490487,0.60353875,0.009663764,0.23842873,0.0149452565,0.0022630496],"about_ca_topic_score_codex":0.000044559874,"about_ca_topic_score_gemma":0.000057941244,"teacher_disagreement_score":0.63463897,"about_ca_system_score_codex":0.00008265667,"about_ca_system_score_gemma":0.00009839612,"threshold_uncertainty_score":0.7637785},"labels":[],"label_agreement":null},{"id":"W2593543367","doi":"","title":"Covering finite groups by subset products.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.02073209783085663,"score_gpt":0.27983381248092654,"score_spread":0.2591017146500699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593543367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95232415,0.00071105786,0.020441784,0.004492301,0.0070084324,0.00076528493,0.00002548267,0.00063274737,0.013598786],"genre_scores_gemma":[0.9970702,0.000034549306,0.001811779,0.00007809257,0.000012328574,0.000024731413,0.0000048201605,0.000018876075,0.0009446424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983042,0.0000779943,0.0001678867,0.00054760015,0.00041190223,0.0004904399],"domain_scores_gemma":[0.99713594,0.00015147596,0.0001429363,0.0022898647,0.0001410464,0.00013874388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056275085,0.00016358867,0.00018112767,0.00007053298,0.0007173877,0.00053197553,0.0029574663,0.000058920417,0.000007725715],"category_scores_gemma":[0.0006635426,0.00016531642,0.000047557663,0.00021434076,0.00018325925,0.0013989976,0.0010030495,0.00026642927,0.00014666028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009894362,0.00006676244,0.0026935865,0.00001465982,0.000014207987,0.000027538517,0.00014129071,0.0000068812624,0.002789164,0.9859147,0.004568529,0.0037527508],"study_design_scores_gemma":[0.00073969696,0.00010863697,0.0033254928,0.00002037352,0.000002651028,0.0000064324586,0.000007821006,0.0014564161,0.019245736,0.96020526,0.014589457,0.00029205275],"about_ca_topic_score_codex":0.000018907265,"about_ca_topic_score_gemma":0.0000016553736,"teacher_disagreement_score":0.044746056,"about_ca_system_score_codex":0.000048928556,"about_ca_system_score_gemma":0.00005282473,"threshold_uncertainty_score":0.6741408},"labels":[],"label_agreement":null},{"id":"W2593589874","doi":"","title":"Roman domination edge critical graphs having precisely two cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.026605463062883215,"score_gpt":0.34238888851757715,"score_spread":0.31578342545469396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593589874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9278551,0.00031138962,0.03583003,0.0025265745,0.0065555773,0.00063750404,0.000005452993,0.0005388277,0.02573959],"genre_scores_gemma":[0.9926049,0.000012129027,0.0070345425,0.000048072532,0.000015941412,0.000043083808,0.0000016016,0.000022061115,0.00021764409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778545,0.00018065887,0.00025498233,0.00061315217,0.0005837087,0.0005820333],"domain_scores_gemma":[0.99694765,0.0004677894,0.00012829198,0.0019474801,0.00026736068,0.00024141982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009180273,0.00019783214,0.00022857386,0.00019794643,0.0011848052,0.00081316015,0.0029169999,0.00008400813,0.000017369894],"category_scores_gemma":[0.0012320506,0.00020474508,0.00011332244,0.00023252386,0.0004171888,0.0020568392,0.00097007136,0.00034433685,0.00012290708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011107059,0.00010298886,0.0032689723,0.00001120963,0.000009639506,0.000040483796,0.00016998977,0.000002570437,0.00096452894,0.9794879,0.0003178852,0.01561274],"study_design_scores_gemma":[0.0009062288,0.000085319494,0.027350722,0.00003891478,0.0000057959833,0.0000127762905,0.000011538927,0.0032307336,0.0040545654,0.9636814,0.00038299744,0.00023899898],"about_ca_topic_score_codex":0.000030454485,"about_ca_topic_score_gemma":0.00001011906,"teacher_disagreement_score":0.06474987,"about_ca_system_score_codex":0.0000883377,"about_ca_system_score_gemma":0.000073675656,"threshold_uncertainty_score":0.91126835},"labels":[],"label_agreement":null},{"id":"W2594112171","doi":"","title":"Vertices of Degree 9 in Contraction Critical 8-Connected Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Contraction (grammar); Combinatorics; Physics","score_opus":0.04019856368834564,"score_gpt":0.3374120237219961,"score_spread":0.29721346003365046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594112171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908456,0.00013282515,0.0021260295,0.0007768167,0.0013792337,0.00016369902,0.000001419629,0.00006306801,0.004511307],"genre_scores_gemma":[0.9987037,0.000015653075,0.0012186279,0.00002085079,0.0000024933465,0.00001375231,4.1173564e-7,0.000006980537,0.000017526161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987423,0.00012816547,0.00022607452,0.0002901511,0.00030113917,0.00031219906],"domain_scores_gemma":[0.99800074,0.0005911708,0.000108502914,0.0010198653,0.00019019893,0.00008953297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051173376,0.00009898904,0.00019654744,0.00017134873,0.00020463324,0.00012448471,0.0013602953,0.00007090294,0.000010194875],"category_scores_gemma":[0.0018526515,0.000099282835,0.000052828862,0.00022727411,0.00028632794,0.0011473293,0.00026480822,0.00022274992,0.000015562007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030539602,0.00012106002,0.013338414,0.000013705609,0.0000074957384,0.00002636744,0.000093698785,0.0000014665904,0.0033690433,0.97674805,0.000025904013,0.0062242467],"study_design_scores_gemma":[0.0007397236,0.00009669334,0.14836907,0.000031317843,0.0000024372123,0.000003633412,0.000015264368,0.0013754738,0.011296452,0.83793306,0.000041291703,0.00009555116],"about_ca_topic_score_codex":0.00007992791,"about_ca_topic_score_gemma":0.000036795485,"teacher_disagreement_score":0.13881497,"about_ca_system_score_codex":0.000029980074,"about_ca_system_score_gemma":0.000047774112,"threshold_uncertainty_score":0.40486366},"labels":[],"label_agreement":null},{"id":"W2594200469","doi":"","title":"Rainbow connection numbers of ladders and Mobius ladders.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Connection (principal bundle); Mathematics; Rainbow; Combinatorics; Topology (electrical circuits); Geometry; Physics; Quantum mechanics","score_opus":0.018724114707772615,"score_gpt":0.29011712497642955,"score_spread":0.2713930102686569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594200469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802584,0.00016232373,0.0034492768,0.0010922103,0.0018047441,0.00031248873,0.0000031740303,0.00012795464,0.012789417],"genre_scores_gemma":[0.9980778,0.00003993971,0.001569773,0.000032099488,0.000004787519,0.000011070097,7.6143857e-7,0.000010656361,0.00025308417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887025,0.000084112005,0.00015822216,0.00033415662,0.00027403934,0.0002792064],"domain_scores_gemma":[0.9984448,0.00014429931,0.00017246591,0.0010148332,0.00010764075,0.0001159801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045683357,0.00011908219,0.00018598123,0.000098022465,0.0004087936,0.00015529596,0.0009791536,0.00006894488,0.000014556658],"category_scores_gemma":[0.00029073146,0.00012157574,0.000050203824,0.00014253057,0.0003751408,0.0007550958,0.00042289638,0.00016462864,0.000012193983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016361724,0.00004211082,0.004697037,0.000016348004,0.000027944196,0.000011226978,0.00043759818,0.000006731104,0.001023692,0.98719376,0.0006561535,0.005871039],"study_design_scores_gemma":[0.0011903612,0.00014926362,0.012846559,0.000023390076,0.0000051686866,0.0000133407375,0.00012223354,0.0014301908,0.00645527,0.9769496,0.000638557,0.00017606665],"about_ca_topic_score_codex":0.00010892218,"about_ca_topic_score_gemma":0.000010711955,"teacher_disagreement_score":0.017819418,"about_ca_system_score_codex":0.000022558974,"about_ca_system_score_gemma":0.000043040185,"threshold_uncertainty_score":0.49577147},"labels":[],"label_agreement":null},{"id":"W2594391380","doi":"","title":"Spanning 3-ended trees in k-connected claw-free graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Spanning tree; Structural engineering","score_opus":0.025766973302576705,"score_gpt":0.2983453865105893,"score_spread":0.27257841320801257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594391380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810586,0.00018060674,0.0014039715,0.001720919,0.0018775086,0.00032708116,0.0000026721214,0.00030146036,0.013127205],"genre_scores_gemma":[0.9968235,0.000020589358,0.0028525586,0.000070361966,0.0000067498045,0.00003507023,0.0000015020512,0.000019547484,0.00017014853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978195,0.00017365286,0.00027657358,0.0006075009,0.00046426014,0.00065850007],"domain_scores_gemma":[0.9960136,0.00026358917,0.00017520707,0.0032557354,0.00012406161,0.00016779997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073069835,0.00021246294,0.00029678422,0.0003427451,0.0005665149,0.00044014625,0.005048502,0.00010989953,0.000011348568],"category_scores_gemma":[0.001004722,0.00021674804,0.0000986835,0.0005014421,0.00024715788,0.0013510153,0.0015208618,0.0004413428,0.00005026408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020067573,0.000080616286,0.018552303,0.0000049095142,0.000014641863,0.00015472909,0.00027375494,0.000020439997,0.00096181396,0.9764264,0.00057015417,0.0029201473],"study_design_scores_gemma":[0.0018139777,0.00008643034,0.07655388,0.000038680246,0.0000020295167,0.000009323576,0.000025008909,0.0023630036,0.0020012762,0.91650045,0.0003663808,0.00023955246],"about_ca_topic_score_codex":0.00008767399,"about_ca_topic_score_gemma":0.0001134471,"teacher_disagreement_score":0.059925966,"about_ca_system_score_codex":0.00006735977,"about_ca_system_score_gemma":0.000071589006,"threshold_uncertainty_score":0.9381456},"labels":[],"label_agreement":null},{"id":"W2594885100","doi":"","title":"Subgraphs And Similarity Of Vertices.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Similarity (geometry); Artificial intelligence; Computer science","score_opus":0.023551922607211114,"score_gpt":0.300733246410696,"score_spread":0.27718132380348487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594885100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932812,0.00023806997,0.0013492,0.00047581882,0.0006067039,0.00011923953,0.0000015914592,0.00004870232,0.003879493],"genre_scores_gemma":[0.9979024,0.000045645473,0.0019642843,0.000025761221,0.0000016800135,0.000004246,2.0867127e-7,0.000005220076,0.00005055289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911624,0.000054232954,0.00012472356,0.0002529005,0.0002375343,0.00021439244],"domain_scores_gemma":[0.9983345,0.00012692442,0.00011120134,0.0012233992,0.00010508537,0.000098848126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041914475,0.00008256693,0.00014708647,0.000070383685,0.00030811434,0.00013070376,0.0013605369,0.000044873985,0.000004082075],"category_scores_gemma":[0.0002652399,0.000079391306,0.000037231162,0.00010905761,0.0003140007,0.0006891301,0.000678348,0.00013179031,0.0000053489466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000747126,0.000038408143,0.028125398,0.000013585648,0.000010107288,0.0000074460513,0.0001162344,4.7348541e-7,0.0007739979,0.9666264,0.0000675541,0.0042129457],"study_design_scores_gemma":[0.00045761507,0.00007017375,0.07275897,0.000011500311,0.0000025829295,0.000002376395,0.000006425746,0.00081614906,0.007335682,0.9182053,0.00024761492,0.00008558674],"about_ca_topic_score_codex":0.00003151775,"about_ca_topic_score_gemma":0.00000510948,"teacher_disagreement_score":0.04842106,"about_ca_system_score_codex":0.000009004599,"about_ca_system_score_gemma":0.000028902403,"threshold_uncertainty_score":0.32374835},"labels":[],"label_agreement":null},{"id":"W2595320992","doi":"","title":"Nordhaus-Gaddum Relations for Proximity and Remoteness in Graphs","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.02090497517781242,"score_gpt":0.2545152877863284,"score_spread":0.233610312608516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595320992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52314895,0.00018601614,0.47428378,0.0013571474,0.00008431454,0.00039434148,0.0000039855076,0.00008648916,0.0004549601],"genre_scores_gemma":[0.8485307,0.000102735554,0.15025055,0.00019759053,0.000026809492,0.00006763514,0.000003944837,0.000014416263,0.00080561364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988366,0.000091538655,0.00017653359,0.0003870034,0.00017891637,0.00032944838],"domain_scores_gemma":[0.9990829,0.0003069404,0.000047253263,0.00038339678,0.000081504026,0.00009796633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003500083,0.00011670335,0.00015179696,0.0002686992,0.0004553467,0.000036238973,0.00040672152,0.00010228623,0.0000023798975],"category_scores_gemma":[0.0001855469,0.000114387054,0.000052726038,0.00064611755,0.00038060598,0.0005633482,0.00009134827,0.0002646802,0.0000043256637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038403872,0.000055664288,0.018752847,0.000021234968,0.000010856181,0.0000457178,0.0024632842,0.00007207039,0.0003544161,0.96200556,0.00031413097,0.015865827],"study_design_scores_gemma":[0.0011255204,0.000112651585,0.06482249,0.000014592023,0.0000033695271,0.000110812354,0.00007272026,0.009118578,0.0006097126,0.9192576,0.004451035,0.00030094254],"about_ca_topic_score_codex":0.00002289741,"about_ca_topic_score_gemma":0.00004086279,"teacher_disagreement_score":0.32538173,"about_ca_system_score_codex":0.00006137671,"about_ca_system_score_gemma":0.000052278476,"threshold_uncertainty_score":0.46645686},"labels":[],"label_agreement":null},{"id":"W2596648514","doi":"","title":"On the Feedback Vertex Set Polytope of a Series-Parallel Graph","year":2006,"lang":"fr","type":"article","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Vertex (graph theory); Pathwidth; Polytope; Indifference graph; Subdivision; Discrete mathematics; Maximal independent set; Series (stratigraphy); 1-planar graph; Graph; Line graph","score_opus":0.016078159843473577,"score_gpt":0.2133130183830099,"score_spread":0.19723485853953632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596648514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48128003,0.0163091,0.38050735,0.04225492,0.002117735,0.0025548483,0.0012594906,0.0010832148,0.07263333],"genre_scores_gemma":[0.91273963,0.004975518,0.01759916,0.0018161633,0.0005126606,0.000022312564,0.00021078992,0.00022100566,0.061902743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99186325,0.0014678511,0.0008510313,0.0017069582,0.0013914618,0.0027194608],"domain_scores_gemma":[0.99404263,0.0012160987,0.00075188174,0.0024145872,0.0006111202,0.00096365233],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.0011945798,0.0012541387,0.0010970413,0.0013701436,0.0026888885,0.00051697117,0.0058928546,0.0010461916,0.0011270512],"category_scores_gemma":[0.00018748551,0.0013484156,0.0011212409,0.004993975,0.0031046125,0.004671136,0.0023375838,0.001882344,0.00052699604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003217018,0.00073951035,0.0013315828,0.00025775196,0.0004331273,0.0023401978,0.006462852,0.036702637,0.0016925012,0.86525464,0.07618824,0.0053799357],"study_design_scores_gemma":[0.025636641,0.0028324442,0.032172933,0.0031666714,0.0010490876,0.0053183846,0.03693378,0.09633444,0.009515239,0.37551916,0.40604582,0.005475407],"about_ca_topic_score_codex":0.0029438992,"about_ca_topic_score_gemma":0.0008554949,"teacher_disagreement_score":0.4897355,"about_ca_system_score_codex":0.0015402009,"about_ca_system_score_gemma":0.0024394174,"threshold_uncertainty_score":0.9997861},"labels":[],"label_agreement":null},{"id":"W2597508670","doi":"10.1002/jgt.21884","title":"SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Planar straight-line graph; Book embedding; Vertex (graph theory); Outerplanar graph; Embedding; Polyhedral graph; Discrete mathematics; Neighbourhood (mathematics); Graph; 1-planar graph; Pathwidth; Chordal graph; Line graph; Computer science","score_opus":0.03866764437602641,"score_gpt":0.30251051878559765,"score_spread":0.2638428744095712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597508670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7321912,0.0011195863,0.26348874,0.00035366658,0.001093876,0.00028593722,0.000007465773,0.00009166738,0.0013678356],"genre_scores_gemma":[0.98901075,0.00007661675,0.010360969,0.00035904426,0.00007868245,0.0000073408587,0.0000023665477,0.00003271257,0.00007152344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552065,0.0011028417,0.00097347895,0.00042210572,0.0011190047,0.00086190697],"domain_scores_gemma":[0.9971161,0.00045042802,0.0006559228,0.0007840739,0.000421508,0.00057199044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007818529,0.00034235598,0.00066759455,0.0027085887,0.0001319106,0.00013777081,0.0021949077,0.00018005124,0.0000176493],"category_scores_gemma":[0.00033113974,0.00028593588,0.00029651335,0.0022812223,0.00017326648,0.0013568386,0.00034965292,0.001205269,0.000027250882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011913707,0.0007058314,0.07072448,0.000062080035,0.00031079102,0.0016743684,0.007460403,0.0001508893,0.012395598,0.8843672,0.0006684192,0.020288534],"study_design_scores_gemma":[0.002867149,0.0005748772,0.0065383473,0.00015938979,0.000012501054,0.00086681056,0.0008373865,0.0002986446,0.0014556032,0.98530173,0.0007060726,0.00038146373],"about_ca_topic_score_codex":0.0000099692215,"about_ca_topic_score_gemma":0.000024291543,"teacher_disagreement_score":0.25681952,"about_ca_system_score_codex":0.00009117633,"about_ca_system_score_gemma":0.00020866402,"threshold_uncertainty_score":0.9999593},"labels":[],"label_agreement":null},{"id":"W2598883699","doi":"10.1002/jgt.22111","title":"Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Chordal graph; Combinatorics; Mathematics; Treewidth; Split graph; Clique-sum; Interval graph; Indifference graph; Discrete mathematics; Bounded function; Independence number; Induced subgraph; Pathwidth; Vertex (graph theory); Graph; 1-planar graph; Line graph","score_opus":0.025118459155473852,"score_gpt":0.3149270744807101,"score_spread":0.2898086153252363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598883699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43026042,0.003427238,0.5446255,0.004755511,0.002988619,0.0004401307,0.000012134168,0.00006722962,0.013423209],"genre_scores_gemma":[0.98752016,0.00036942167,0.011640068,0.00017327456,0.00013511207,0.000003347716,1.0926267e-7,0.000019503881,0.00013899842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970994,0.00068864395,0.00066936854,0.00022961156,0.0008732007,0.00043977215],"domain_scores_gemma":[0.994491,0.000998126,0.0014899134,0.002377115,0.00046767824,0.00017618817],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0079775695,0.00019409707,0.00040336477,0.00049589074,0.0009079562,0.000335592,0.00800689,0.0000795913,0.000019451309],"category_scores_gemma":[0.0015376224,0.00012162509,0.00052354485,0.00040586072,0.0011792454,0.0014138583,0.00086397555,0.000757319,0.0000039859506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019086406,0.000069244124,0.0024235512,0.000016475748,0.000121062956,0.00005485776,0.0006002462,0.000020367801,0.0044185724,0.9727404,0.00049682386,0.018847505],"study_design_scores_gemma":[0.00070209114,0.00029052974,0.0070009953,0.00009272435,0.000021345046,0.00018974148,0.0001241337,0.000045314948,0.0077983327,0.9825237,0.0010768619,0.00013424687],"about_ca_topic_score_codex":0.000004959654,"about_ca_topic_score_gemma":0.000005751346,"teacher_disagreement_score":0.55725974,"about_ca_system_score_codex":0.000028446595,"about_ca_system_score_gemma":0.00015188236,"threshold_uncertainty_score":0.9973603},"labels":[],"label_agreement":null},{"id":"W2599299976","doi":"","title":"Variable Neighborhood Search for Extremal Graphs. 22. Extending Bounds for Independence to Upper Irredundance","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Mathematics; Mathematical proof; Independence number; Graph; Discrete mathematics; Independent set; Independence (probability theory)","score_opus":0.01918832843579429,"score_gpt":0.2993492857366926,"score_spread":0.28016095730089835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599299976","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02682496,0.00030891155,0.9679646,0.0005861403,0.00068127154,0.0013062336,0.00003326332,0.00021145449,0.00208318],"genre_scores_gemma":[0.4498512,0.000011461771,0.54688895,0.00048595775,0.00020780133,0.00024458638,0.000008504916,0.000052678733,0.0022488213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959893,0.000088352834,0.00043134223,0.0010827848,0.0007866541,0.0016215577],"domain_scores_gemma":[0.9966512,0.0013508212,0.00009463893,0.00094389886,0.00047472867,0.00048475654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031263223,0.00032763282,0.00034729822,0.0006524402,0.0010963947,0.00041586516,0.001956259,0.00025363662,0.000027333954],"category_scores_gemma":[0.00041117644,0.0003354401,0.00020960926,0.0015735502,0.00029911028,0.0009899626,0.0003097025,0.0005379761,0.000018030316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022944977,0.00007271773,0.0013052962,0.000063644955,0.00003419103,0.000024043602,0.0010910375,0.00015246909,0.0065020663,0.9488939,0.0004280985,0.041203074],"study_design_scores_gemma":[0.0018164617,0.0007172239,0.0020986851,0.00008191805,0.000015555086,0.00014531173,0.00046400476,0.012270993,0.01945021,0.93832535,0.023692675,0.00092162885],"about_ca_topic_score_codex":0.000021289454,"about_ca_topic_score_gemma":0.000009299147,"teacher_disagreement_score":0.42302626,"about_ca_system_score_codex":0.00030064586,"about_ca_system_score_gemma":0.00020065656,"threshold_uncertainty_score":0.99990976},"labels":[],"label_agreement":null},{"id":"W2599540576","doi":"10.1002/jgt.20344","title":"Average distance and maximum induced forest","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Graph; Conjecture; Bipartite graph; Bound graph; Path graph; Order (exchange); Discrete mathematics; Graph power; Line graph","score_opus":0.02272741783119209,"score_gpt":0.2674605634724172,"score_spread":0.2447331456412251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599540576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43044308,0.00093577895,0.56728655,0.00018772724,0.0002020321,0.00006205796,9.1083655e-7,0.000021297044,0.00086055085],"genre_scores_gemma":[0.9914749,0.00039838985,0.007748186,0.00014754414,0.00006726362,0.0000017413668,1.2001229e-7,0.00001211602,0.0001497237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984312,0.0002710689,0.0003494114,0.00019346022,0.00045176843,0.00030305964],"domain_scores_gemma":[0.99853843,0.00039214434,0.00026891098,0.00039291996,0.00019702855,0.00021057928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013132254,0.0001388788,0.00024836388,0.0003863272,0.00023310004,0.00005237486,0.0009084939,0.000056049754,0.0000105336085],"category_scores_gemma":[0.00018268469,0.000109366745,0.00013457355,0.00053665746,0.00028927348,0.0008805166,0.00017409303,0.0004407441,0.00000540858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024360404,0.00009713078,0.0075988057,0.000017627966,0.00006371917,0.0007824332,0.0011849053,0.00014752519,0.0027981845,0.9676069,0.00019166793,0.019267503],"study_design_scores_gemma":[0.0006221809,0.00029037643,0.011808251,0.000037403603,0.000003773907,0.0013687852,0.000048937854,0.00018733292,0.0011940192,0.98350865,0.00078511686,0.00014516996],"about_ca_topic_score_codex":7.737887e-7,"about_ca_topic_score_gemma":0.0000018503489,"teacher_disagreement_score":0.5610318,"about_ca_system_score_codex":0.000025469813,"about_ca_system_score_gemma":0.00007313589,"threshold_uncertainty_score":0.44598466},"labels":[],"label_agreement":null},{"id":"W2600215958","doi":"10.4310/joc.2016.v7.n2.a1","title":"Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Danmarks Tekniske Universitet","keywords":"Combinatorics; Group (periodic table); Claw; Enhanced Data Rates for GSM Evolution; Mathematics; Planar; Computer science; Physics; Telecommunications; Engineering; Structural engineering; Computer graphics (images)","score_opus":0.013092982817670634,"score_gpt":0.27448150736668137,"score_spread":0.26138852454901074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600215958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8215447,0.000413761,0.17543784,0.0014773664,0.00069075474,0.00017361277,0.0000041911735,0.00004474544,0.00021304647],"genre_scores_gemma":[0.99445003,0.00028823808,0.0051015085,0.00006451552,0.000033507564,0.000007851821,6.460786e-7,0.000015439487,0.000038261445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979186,0.00033839917,0.00054583565,0.00028173262,0.00052574516,0.00038967218],"domain_scores_gemma":[0.9975629,0.0011737571,0.0003712672,0.00035465162,0.00029777578,0.00023967207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011133649,0.00017684618,0.00033230468,0.00085916196,0.00019145326,0.0001140636,0.0007994786,0.00009463151,0.0000071532577],"category_scores_gemma":[0.00032301983,0.00013562615,0.000102496386,0.0012363788,0.00013582091,0.0014930809,0.0001836731,0.00039650997,0.000005364472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054111733,0.00036232892,0.024017476,0.000013002482,0.000031777192,0.00014425986,0.00030486952,0.0000043648693,0.005446788,0.9659804,0.00021211599,0.0034285048],"study_design_scores_gemma":[0.0026304715,0.00069191284,0.072574355,0.00011498687,0.0000095592595,0.0002993071,0.000077332006,0.0001066883,0.0009390572,0.9218102,0.00054094195,0.00020515172],"about_ca_topic_score_codex":0.00000777826,"about_ca_topic_score_gemma":0.00003482622,"teacher_disagreement_score":0.17290534,"about_ca_system_score_codex":0.00020151243,"about_ca_system_score_gemma":0.00007255835,"threshold_uncertainty_score":0.5530674},"labels":[],"label_agreement":null},{"id":"W2602127376","doi":"","title":"On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function","year":2004,"lang":"en","type":"preprint","venue":"Tilburg University Research Portal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Technische Universiteit Delft; Universiteit Utrecht; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Semidefinite programming; Bounded function; Approximation algorithm; Graph; Relaxation (psychology); Discrete mathematics; Function (biology); Algorithm; Mathematical optimization","score_opus":0.05670983328273239,"score_gpt":0.3036296669863463,"score_spread":0.24691983370361392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602127376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2794581,0.00024336726,0.5483038,0.012350289,0.0012504284,0.007265312,0.00027609756,0.001348758,0.14950384],"genre_scores_gemma":[0.9947887,0.00012305712,0.0015998672,0.0001648487,0.00008008345,0.000023623577,0.000035483066,0.00004405603,0.0031402858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941386,0.0010542882,0.00021399313,0.001386639,0.002169026,0.0010374463],"domain_scores_gemma":[0.9959578,0.0011562419,0.00015087618,0.0019222191,0.00044229082,0.00037059997],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003554842,0.00040205987,0.00036534743,0.0013401206,0.0012584201,0.00037331908,0.0027333542,0.0003191475,0.00014288818],"category_scores_gemma":[0.00020961794,0.00033354643,0.00023003893,0.0012186766,0.0010023769,0.00033229744,0.0030437426,0.0033057458,0.000066730194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009780556,0.00053104176,0.00021669267,0.00019293676,0.00021536766,0.0018771463,0.0005700127,0.023043865,0.00015019112,0.964196,0.002227693,0.005800982],"study_design_scores_gemma":[0.0022752262,0.0018614302,0.0016575163,0.0007259224,0.000044643813,0.000033623124,0.0011887716,0.20089899,0.0012655545,0.78629273,0.002632652,0.0011229208],"about_ca_topic_score_codex":0.00013643006,"about_ca_topic_score_gemma":0.000028738756,"teacher_disagreement_score":0.7153306,"about_ca_system_score_codex":0.00031463403,"about_ca_system_score_gemma":0.00067986635,"threshold_uncertainty_score":0.99991167},"labels":[],"label_agreement":null},{"id":"W2604168044","doi":"","title":"Automated Generation of Conjectures on Forbidden Subgraph Characterization","year":2007,"lang":"en","type":"other","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; École de Technologie Supérieure","funders":"","keywords":"Combinatorics; Induced subgraph isomorphism problem; Characterization (materials science); Cograph; Split graph; Induced subgraph; Mathematics; Discrete mathematics; Graph; Distance-hereditary graph; Class (philosophy); Computer science; Line graph; Pathwidth; Graph power; Voltage graph; Artificial intelligence","score_opus":0.018208286242535607,"score_gpt":0.2738985082275193,"score_spread":0.2556902219849837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604168044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012331236,0.00054610963,0.9762279,0.00031418802,0.00029182356,0.0012497063,0.0001263075,0.003558021,0.016452836],"genre_scores_gemma":[0.18378885,0.0020105755,0.5015547,0.005206189,0.0017851219,0.001427674,0.0019414461,0.002444025,0.29984137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700654,0.00023823898,0.00054429274,0.00074110314,0.00075873215,0.0007111197],"domain_scores_gemma":[0.99723387,0.00011087476,0.00065292505,0.001615545,0.00016414169,0.00022264135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007309172,0.0004989144,0.0005556614,0.0029985255,0.00011697485,0.0001474731,0.0014128498,0.0007149921,0.000113031725],"category_scores_gemma":[0.00013879039,0.00049018615,0.00020116729,0.0014870719,0.00014748255,0.0002566275,0.00026130088,0.00050064933,0.00003328812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014803288,0.0005318252,0.0013842863,0.00024985147,0.00028099044,0.00013319604,0.00030337254,0.00087637536,0.1785187,0.6442914,0.10373044,0.069551535],"study_design_scores_gemma":[0.0016650403,0.0011347439,0.008677746,0.000789595,0.000068713445,0.000121812234,0.000019317133,0.65990686,0.22221619,0.0077077886,0.095344014,0.0023481965],"about_ca_topic_score_codex":0.00095903827,"about_ca_topic_score_gemma":0.0007097232,"teacher_disagreement_score":0.65903044,"about_ca_system_score_codex":0.0002120365,"about_ca_system_score_gemma":0.00020490303,"threshold_uncertainty_score":0.99975497},"labels":[],"label_agreement":null},{"id":"W2604224124","doi":"10.1002/jgt.10070","title":"Fold‐2‐covering triangular embeddings","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Université du Maine","keywords":"Combinatorics; Mathematics; Conjecture; Euler characteristic; Vertex (graph theory); Surface (topology); Triangulation; Graph; Discrete mathematics; Geometry","score_opus":0.014731016123299518,"score_gpt":0.27928599252315794,"score_spread":0.2645549763998584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604224124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075068675,0.0027278375,0.9146374,0.00013805395,0.0007576884,0.00010684249,7.5289154e-7,0.000045993107,0.00651675],"genre_scores_gemma":[0.9480193,0.00021028868,0.050884906,0.00024371833,0.00009476413,0.0000029014811,9.054349e-8,0.000025560614,0.00051843503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997689,0.000606038,0.00048699183,0.00021030688,0.00059496454,0.00041271557],"domain_scores_gemma":[0.99809796,0.0005390973,0.0003767231,0.0005087395,0.00025437714,0.00022313566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004692681,0.00016092537,0.00031255174,0.000689205,0.000149983,0.00012503866,0.001260867,0.00006673312,0.000073250405],"category_scores_gemma":[0.0008253303,0.00013252861,0.00035315688,0.0009781994,0.0001297193,0.0010720668,0.000104656596,0.00044610817,0.000019460987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000745418,0.000055760553,0.00014792227,0.000008977216,0.000072536146,0.00014730648,0.00038342355,0.00014943884,0.005715999,0.9808998,0.00014689787,0.012197362],"study_design_scores_gemma":[0.00083961955,0.00023260895,0.00014844125,0.000043841414,0.000011908359,0.000473652,0.00016544477,0.000059162485,0.012860424,0.9763217,0.008678413,0.00016479465],"about_ca_topic_score_codex":2.9358094e-7,"about_ca_topic_score_gemma":1.6998973e-7,"teacher_disagreement_score":0.8729507,"about_ca_system_score_codex":0.000050227984,"about_ca_system_score_gemma":0.00010805399,"threshold_uncertainty_score":0.54043597},"labels":[],"label_agreement":null},{"id":"W2604526143","doi":"10.1007/s00373-018-1943-3","title":"On Well-Covered Cartesian Products","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Simons Foundation","keywords":"Cartesian product; Mathematics; Combinatorics; Cartesian coordinate system; Graph; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.01298566698275696,"score_gpt":0.2510953005535228,"score_spread":0.23810963357076584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604526143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90449655,0.0008761437,0.032447513,0.0024926339,0.002686007,0.00077443663,0.000005710096,0.00068518484,0.055535797],"genre_scores_gemma":[0.99817324,0.000048117472,0.0008797903,0.0002266977,0.000024310128,0.000011105548,8.5435994e-7,0.000010770607,0.0006251324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868333,0.00006254957,0.0001181916,0.00046167604,0.000320789,0.00035346125],"domain_scores_gemma":[0.998859,0.00008568607,0.000042710868,0.0006941456,0.00018527679,0.0001332213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025608216,0.00013858844,0.00013039273,0.00018763442,0.00028119888,0.00011732172,0.0005753801,0.000051333962,0.0000072699468],"category_scores_gemma":[0.00007022629,0.00012304353,0.00003333024,0.0011419907,0.00018657873,0.00024857998,0.00019604168,0.0001615698,0.00007236363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011320719,0.00006382187,0.0004703115,0.000008388704,0.0000075263697,0.000008997494,0.00014569805,4.1308274e-7,0.00018264884,0.9941023,0.0014660527,0.00353251],"study_design_scores_gemma":[0.00037163513,0.00061386346,0.001803203,0.000010696584,0.0000021520207,0.000009459997,0.0000131490215,0.00047448397,0.0044433163,0.9859786,0.0061114407,0.00016797804],"about_ca_topic_score_codex":0.0000052935666,"about_ca_topic_score_gemma":0.0000012317548,"teacher_disagreement_score":0.09367665,"about_ca_system_score_codex":0.000018442972,"about_ca_system_score_gemma":0.000036358633,"threshold_uncertainty_score":0.50175697},"labels":[],"label_agreement":null},{"id":"W2604916992","doi":"10.46298/dmtcs.2092","title":"Complexity of conditional colouring with given template","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Template; Vertex (graph theory); Graph; Induced subgraph; Time complexity; Discrete mathematics; Computer science","score_opus":0.027875562355967724,"score_gpt":0.29527200499150835,"score_spread":0.26739644263554063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604916992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026299879,0.000004512777,0.96703064,0.00055764714,0.00007370169,0.00025476632,0.000007699473,0.00012356372,0.0056475652],"genre_scores_gemma":[0.572357,4.6087362e-7,0.42753935,0.00005901551,0.000021498567,0.000007643869,0.0000014745821,0.0000086483615,0.000004909323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671966,0.00015925705,0.00043388098,0.0006660558,0.0013616377,0.0006595278],"domain_scores_gemma":[0.99714917,0.0007840519,0.00020814994,0.0011444351,0.00040618383,0.00030801338],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002229682,0.00024184595,0.00040121208,0.00026343353,0.000438545,0.0002554833,0.0030028042,0.00004557735,0.000054642023],"category_scores_gemma":[0.00018065705,0.00017682146,0.00007288663,0.0011715374,0.009589703,0.0006545273,0.0012211138,0.00025110826,0.000033731703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012288173,0.00007918767,0.000044415,0.00005318071,0.000011088398,0.000005000886,0.00050306984,0.00043063896,0.0012022608,0.9968635,0.000009040737,0.00078634603],"study_design_scores_gemma":[0.00020988323,0.00029959666,0.00023588674,0.00006084272,0.0000039588945,0.00003897631,0.00001423935,0.40957227,0.0046887505,0.5847021,0.000018032986,0.0001554682],"about_ca_topic_score_codex":0.0000011926502,"about_ca_topic_score_gemma":7.044069e-7,"teacher_disagreement_score":0.5460571,"about_ca_system_score_codex":0.00003671526,"about_ca_system_score_gemma":0.00010400051,"threshold_uncertainty_score":0.99310565},"labels":[],"label_agreement":null},{"id":"W2605443665","doi":"10.26493/1855-3974.1013.46a","title":"Uniformly dissociated graphs","year":2017,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Univerza v Mariboru; Javna Agencija za Raziskovalno Dejavnost RS; Simons Foundation","keywords":"Combinatorics; Mathematics; Induced subgraph; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.04310956707898594,"score_gpt":0.3163105992394612,"score_spread":0.27320103216047525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605443665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21309325,0.00029104415,0.4447365,0.010999343,0.0007660992,0.0018858351,0.000026609347,0.0014765632,0.32672474],"genre_scores_gemma":[0.9817305,0.000014175348,0.015511261,0.000103062055,0.000010921169,0.00004036125,0.0000022464149,0.000022405398,0.002565033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981582,0.00009201376,0.0003472612,0.00041828703,0.00049396046,0.0004902397],"domain_scores_gemma":[0.9965479,0.00027604093,0.0003440138,0.0024762803,0.00015869635,0.0001970807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009976705,0.0002087736,0.00033931274,0.00013164757,0.0008345318,0.0005853691,0.0032363737,0.00007653018,0.00003705902],"category_scores_gemma":[0.0006990471,0.0001761763,0.00015159808,0.00018509287,0.00032278994,0.0012751945,0.00057630945,0.00021375778,0.00035343983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009494806,0.000082900915,0.00071099063,0.000037084472,0.00004407799,0.000059308633,0.0005952814,6.4592723e-7,0.0007435612,0.99357665,0.0004969565,0.0036430596],"study_design_scores_gemma":[0.00064381026,0.00006257448,0.0012772641,0.00007498489,0.0000058514665,0.000018850338,0.000065003995,0.0031630618,0.0014490503,0.99178797,0.0011833123,0.0002682729],"about_ca_topic_score_codex":0.000016504195,"about_ca_topic_score_gemma":0.000012336286,"teacher_disagreement_score":0.7686373,"about_ca_system_score_codex":0.000028387032,"about_ca_system_score_gemma":0.000068152236,"threshold_uncertainty_score":0.7184261},"labels":[],"label_agreement":null},{"id":"W2605510696","doi":"10.1016/j.disc.2017.03.007","title":"Reconfiguring dominating sets in some well-covered and other classes of graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Simons Foundation","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Graph; Discrete mathematics; Bound graph; Domination analysis; Graph power; Line graph","score_opus":0.035875787122762744,"score_gpt":0.32940287477408253,"score_spread":0.2935270876513198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605510696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94904226,0.00014787505,0.03050742,0.00020767032,0.00008183619,0.00032550914,0.000009603876,0.000040214218,0.019637635],"genre_scores_gemma":[0.9412633,0.000027081122,0.058499325,0.000022256143,0.000007780588,0.000011211029,2.8246598e-7,0.000014339714,0.00015442655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893695,0.000046301826,0.00030055986,0.00023808466,0.0002239021,0.00025418185],"domain_scores_gemma":[0.99847096,0.0002802775,0.00028991586,0.0008707368,0.000033888824,0.000054225417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063706486,0.00012271943,0.0002508779,0.00015609819,0.00014986201,0.00017792599,0.0008900758,0.000047458092,0.000011102907],"category_scores_gemma":[0.00033135922,0.00010649438,0.000048058275,0.000094482595,0.0001911679,0.0006276198,0.00038874173,0.0001320617,0.0000083835575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008407026,0.000051776125,0.00444701,0.0003452855,0.000021334488,0.000013268685,0.0029772685,0.000020740676,0.0040766024,0.98187995,0.000011354605,0.0061470256],"study_design_scores_gemma":[0.00054601044,0.00004270219,0.0026283006,0.0003429862,0.000004017711,0.000010826402,0.00036848424,0.030060567,0.015700376,0.9500478,0.000056765795,0.00019115294],"about_ca_topic_score_codex":0.000011478774,"about_ca_topic_score_gemma":0.0000117488335,"teacher_disagreement_score":0.031832118,"about_ca_system_score_codex":0.000012706011,"about_ca_system_score_gemma":0.000014662122,"threshold_uncertainty_score":0.43427148},"labels":[],"label_agreement":null},{"id":"W2605695111","doi":"10.4236/ojdm.2017.72007","title":"Length of the Longest Path and Diameter in Orientations of Graphs","year":2017,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Combinatorics; Interval (graph theory); Path (computing); Property (philosophy); Interval graph; Pathwidth; Discrete mathematics; Longest path problem; Indifference graph; Graph; Chordal graph; Line graph; Computer science","score_opus":0.0416074269276484,"score_gpt":0.35081594703235613,"score_spread":0.30920852010470773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605695111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9169836,0.00011433892,0.07837102,0.00081307587,0.0001319213,0.0003575568,0.000009051295,0.0000016295302,0.003217783],"genre_scores_gemma":[0.9033457,0.000050926606,0.096527405,0.0000075055323,0.000004684534,0.0000018515468,5.484607e-8,0.0000053256717,0.00005656478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894667,0.00008680928,0.0004543336,0.00008437663,0.0003136765,0.000114156996],"domain_scores_gemma":[0.9979188,0.00023449272,0.0009295637,0.0007121509,0.00015448451,0.00005050523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079593,0.00007144838,0.00026030254,0.00009675173,0.00011253819,0.00015813454,0.002491005,0.000021928774,0.00000576576],"category_scores_gemma":[0.00048667923,0.00004262919,0.000071394374,0.00015638258,0.0002768294,0.000780063,0.0008525421,0.00015529225,3.460081e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042299434,0.0003544084,0.045865163,0.000246138,0.0001118984,0.000025396423,0.01543789,0.00008796062,0.0034940082,0.92310286,0.00007130847,0.011160691],"study_design_scores_gemma":[0.0012767515,0.00033085773,0.05314863,0.00084291777,0.000028735923,0.000081040314,0.0016392409,0.0025020598,0.008957976,0.9310075,0.000037831123,0.00014648247],"about_ca_topic_score_codex":0.0000071497034,"about_ca_topic_score_gemma":0.000013927208,"teacher_disagreement_score":0.018156387,"about_ca_system_score_codex":0.000008500517,"about_ca_system_score_gemma":0.000058926544,"threshold_uncertainty_score":0.46289486},"labels":[],"label_agreement":null},{"id":"W2605957025","doi":"","title":"K-dominating sets of $P_(2k+2)\\times P_n$ and $P_m\\times P_n$","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Animal science; Biology","score_opus":0.014342453309719075,"score_gpt":0.2858869884345875,"score_spread":0.2715445351248684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605957025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98239464,0.001131762,0.0022961255,0.0007576805,0.00063740055,0.00033766642,0.0000031172026,0.00019772576,0.0122438595],"genre_scores_gemma":[0.9908189,0.0001345505,0.00802784,0.00006919543,0.00000857026,0.000018438459,0.0000019772915,0.000024765219,0.0008957643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774855,0.00020813163,0.00037419028,0.0005601137,0.00054106995,0.0005679593],"domain_scores_gemma":[0.9979357,0.00063822,0.00018083159,0.00081984844,0.00023085732,0.00019450569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008358087,0.00023882849,0.00036595564,0.00026493552,0.00021893394,0.00010912289,0.0011179515,0.00010103541,0.000056432422],"category_scores_gemma":[0.00032547247,0.00023512507,0.000086328575,0.0009043827,0.00027497645,0.0007853834,0.0007448886,0.00028366307,0.000039910257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027097001,0.000121078265,0.009096407,0.0000326957,0.000038278286,0.000053003412,0.00073512585,0.00001761919,0.0019153086,0.96767735,0.000781046,0.019504964],"study_design_scores_gemma":[0.001272751,0.0002004724,0.00430552,0.00007919715,0.000009227502,0.000048956892,0.00013350302,0.007598864,0.0070497566,0.9781618,0.0008232774,0.00031664871],"about_ca_topic_score_codex":0.000022227368,"about_ca_topic_score_gemma":0.0000018378756,"teacher_disagreement_score":0.019188317,"about_ca_system_score_codex":0.000042287807,"about_ca_system_score_gemma":0.00007152656,"threshold_uncertainty_score":0.95881224},"labels":[],"label_agreement":null},{"id":"W2606086083","doi":"10.1016/j.jctb.2018.04.003","title":"Infinitely many excluded minors for frame matroids and for lifted-graphic matroids","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Class (philosophy); Combinatorics; Graphic matroid; Frame (networking); Mathematics; Computer science; Artificial intelligence","score_opus":0.021781755135505218,"score_gpt":0.3062087531804304,"score_spread":0.28442699804492516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606086083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35432023,0.0008461155,0.63234574,0.0011909993,0.009365709,0.001027427,0.00002884976,0.00011491468,0.000760062],"genre_scores_gemma":[0.9309213,0.000099720346,0.06642654,0.00021373144,0.0018546185,0.00005309094,0.000001703331,0.000054711258,0.0003745725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761516,0.00028615643,0.00070761685,0.00032931464,0.00048352266,0.000578236],"domain_scores_gemma":[0.99602634,0.0014631416,0.00053611264,0.00052321074,0.0011681762,0.00028302954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029596812,0.00028288987,0.00054860796,0.0005010533,0.0004211843,0.00030681217,0.0013637309,0.00018020418,0.000019247456],"category_scores_gemma":[0.0010345266,0.00024395689,0.0003000865,0.00054303464,0.0007039059,0.0014918657,0.00028411121,0.00034340765,0.0000036991617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032312353,0.00007956673,0.00012557862,0.00006196281,0.00011231216,0.000007590823,0.0005690551,0.0000021662497,0.0040092445,0.98766094,0.0006996885,0.0034406553],"study_design_scores_gemma":[0.0028703357,0.004885865,0.00017764063,0.00005805807,0.00003289574,0.00015209096,0.00024006718,0.00015570257,0.012364711,0.95745736,0.02134267,0.00026258026],"about_ca_topic_score_codex":6.193174e-7,"about_ca_topic_score_gemma":7.951301e-7,"teacher_disagreement_score":0.5766011,"about_ca_system_score_codex":0.0000484987,"about_ca_system_score_gemma":0.00016585359,"threshold_uncertainty_score":0.99482733},"labels":[],"label_agreement":null},{"id":"W2606103541","doi":"10.1142/s0218195916600013","title":"The Price of Order","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Order (exchange); Discrete mathematics; Graph","score_opus":0.013356323884241277,"score_gpt":0.32675577623270985,"score_spread":0.31339945234846855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606103541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002076593,0.00035871356,0.990237,0.0060599255,0.00022927948,0.00016335843,0.000014419274,0.000016634533,0.00084410596],"genre_scores_gemma":[0.8621415,0.00019895974,0.13666171,0.00016959256,0.00033464545,0.00005336941,0.0000026494276,0.0000117478085,0.00042581698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977774,0.000075890115,0.000623909,0.00015887509,0.0011988883,0.0001650394],"domain_scores_gemma":[0.9929971,0.002239508,0.0006362026,0.00027607282,0.0037586365,0.000092485534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007925898,0.0000940136,0.00013259807,0.00043148614,0.00013155946,0.0000846226,0.002510343,0.000031962845,0.000033379583],"category_scores_gemma":[0.000260429,0.000055811684,0.0001225346,0.0009440262,0.00021880986,0.0005303297,0.00024302404,0.00013491478,0.000041221032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000363327,0.00011651275,0.0004909161,0.0000031018785,0.00015949616,0.000003324691,0.000033256518,0.004597233,0.0009552058,0.74441266,0.00035712484,0.24883485],"study_design_scores_gemma":[0.00076880795,0.00008980603,0.005268516,0.000038667713,0.0000070780047,0.0001986484,0.000028661603,0.0013212813,0.001541392,0.832884,0.15772809,0.0001250262],"about_ca_topic_score_codex":7.864087e-7,"about_ca_topic_score_gemma":4.234628e-7,"teacher_disagreement_score":0.8600649,"about_ca_system_score_codex":0.00008931538,"about_ca_system_score_gemma":0.00028037056,"threshold_uncertainty_score":0.46648833},"labels":[],"label_agreement":null},{"id":"W2606500388","doi":"10.1016/j.dam.2018.01.007","title":"Minimal obstructions to 2-polar cographs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Cograph; Combinatorics; Mathematics; Induced subgraph; Partition (number theory); Disjoint sets; Split graph; Multipartite; Induced path; Discrete mathematics; Graph; Polar; Chordal graph; 1-planar graph; Longest path problem","score_opus":0.020745311594055366,"score_gpt":0.2972813654376966,"score_spread":0.27653605384364127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606500388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02868704,0.000013204009,0.93553543,0.00027527977,0.00014814473,0.00045120736,0.000011782261,0.00029606334,0.034581825],"genre_scores_gemma":[0.3592488,0.0000023197374,0.64017236,0.00018027684,0.000092054135,0.000083583676,0.0000025085264,0.000024221523,0.00019388908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983171,0.000017101227,0.00029695348,0.00042766661,0.0004369903,0.00050416146],"domain_scores_gemma":[0.99829096,0.0001490952,0.00008082982,0.0011100078,0.000119978984,0.00024915233],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030268668,0.00019222626,0.00021541401,0.00025033526,0.0003010142,0.00015851653,0.001250939,0.00006180131,0.0000564339],"category_scores_gemma":[0.00007453508,0.00017196457,0.00007852257,0.0011514752,0.0002561034,0.00019792015,0.00051861856,0.00015630365,0.0008283085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076686965,0.00004116081,0.000012315333,0.000021981466,0.000020321717,0.0000022759498,0.001985961,0.0000057529232,0.01319063,0.9799115,0.0005647304,0.0042357156],"study_design_scores_gemma":[0.00038519382,0.00022785044,0.00021781988,0.000033531862,0.000016340382,0.000031274576,0.0009839466,0.004873071,0.033611935,0.9490152,0.010060542,0.00054328877],"about_ca_topic_score_codex":0.0000016611162,"about_ca_topic_score_gemma":0.000005124196,"teacher_disagreement_score":0.33056173,"about_ca_system_score_codex":0.000025718966,"about_ca_system_score_gemma":0.000032502703,"threshold_uncertainty_score":0.99994963},"labels":[],"label_agreement":null},{"id":"W2607431919","doi":"10.1016/j.dam.2017.03.004","title":"The game of Cops and Robber on circulant graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Mathematics; Circulant graph; Combinatorics; Wreath product; Discrete mathematics; Graph; Product (mathematics); Line graph; Voltage graph; Geometry","score_opus":0.02411534211884052,"score_gpt":0.29690292364961196,"score_spread":0.27278758153077143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607431919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2536088,0.0002813627,0.6327103,0.0015512881,0.00024056784,0.0016033521,0.000019929063,0.00017962603,0.10980479],"genre_scores_gemma":[0.9774568,0.000076757366,0.022260407,0.0000313955,0.000010121978,0.00003599166,5.8085254e-7,0.000013787811,0.0001141264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989269,0.000015749141,0.00021539001,0.00022932231,0.0003513561,0.0002613271],"domain_scores_gemma":[0.9976033,0.00038504173,0.00023653923,0.0016601281,0.0000418866,0.00007310509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051766104,0.00012767718,0.0001905402,0.000046300484,0.00044056727,0.00023729813,0.0013943169,0.000038460395,0.0000022725728],"category_scores_gemma":[0.00010981931,0.000079156365,0.000050194332,0.00007678616,0.00044848074,0.000112657646,0.00047400594,0.00014077894,0.00001647277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000721586,0.00002141642,0.000019656387,0.000039006358,0.000018108616,0.0000020215607,0.00052105676,0.000012223499,0.0020719157,0.9915822,0.00003512908,0.005670014],"study_design_scores_gemma":[0.00026657278,0.000040387276,0.00052842824,0.000036479123,0.000006113338,0.000006007222,0.00016060474,0.006039282,0.0056433794,0.9868481,0.0002998038,0.00012484839],"about_ca_topic_score_codex":0.0000015314191,"about_ca_topic_score_gemma":0.0000018279205,"teacher_disagreement_score":0.72384804,"about_ca_system_score_codex":0.000008109783,"about_ca_system_score_gemma":0.000016693692,"threshold_uncertainty_score":0.33885318},"labels":[],"label_agreement":null},{"id":"W2608271081","doi":"10.1016/j.disc.2018.03.026","title":"On 1-uniqueness and dense critical graphs for tree-depth","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Uniqueness; Conjecture; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.03676595863659552,"score_gpt":0.35349044696105836,"score_spread":0.3167244883244628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608271081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031118477,0.000029848808,0.96419114,0.0005428765,0.0000943454,0.0003128771,0.0000080441005,0.0001253819,0.0035770014],"genre_scores_gemma":[0.6728328,0.000005555677,0.32663667,0.00020875238,0.000041914507,0.00006504598,0.0000011453741,0.000025522177,0.0001825934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879324,0.000055162232,0.00019626989,0.00033269176,0.00025725583,0.00036539987],"domain_scores_gemma":[0.99780947,0.0012263736,0.000042346208,0.00061687035,0.00016133077,0.00014359049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046244304,0.00015126074,0.00018988096,0.00012913313,0.00021568725,0.0001486021,0.00054148294,0.00005750263,0.000007400027],"category_scores_gemma":[0.0007228097,0.000120654026,0.00006600689,0.0002416388,0.0004336048,0.00022205482,0.00019314398,0.00009880789,0.000027555468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001698573,0.000044296146,0.0000130184935,0.000082489976,0.000008570476,0.000004360511,0.00069394597,6.157562e-7,0.0004634426,0.9949449,0.00018598014,0.0035414167],"study_design_scores_gemma":[0.00023045242,0.00038040357,0.00004925025,0.000058794114,0.000006625055,0.000018189037,0.00008002689,0.031672236,0.0057678856,0.961417,0.00015868961,0.00016041388],"about_ca_topic_score_codex":7.177885e-7,"about_ca_topic_score_gemma":0.0000066896537,"teacher_disagreement_score":0.64171433,"about_ca_system_score_codex":0.000013705562,"about_ca_system_score_gemma":0.000022010441,"threshold_uncertainty_score":0.49201283},"labels":[],"label_agreement":null},{"id":"W2612340482","doi":"","title":"The upper vertex detour monophonic number of a graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Graph","score_opus":0.015572685197471878,"score_gpt":0.30079238006768977,"score_spread":0.28521969487021787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612340482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98420435,0.00028284176,0.0014670722,0.0010227025,0.0027907414,0.00025282864,0.0000017393006,0.00008353248,0.00989419],"genre_scores_gemma":[0.998025,0.00009168832,0.0012035298,0.000028756655,0.0000040256314,0.000023238694,2.2595253e-7,0.0000129983055,0.0006105396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985414,0.00011252192,0.00020431982,0.00030493457,0.00041465793,0.0004221301],"domain_scores_gemma":[0.9967714,0.00034971698,0.00018270612,0.0024143113,0.00017571953,0.00010615377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063191453,0.00013046425,0.00017068053,0.00004707724,0.00095313444,0.0002610002,0.003664392,0.000057936435,0.000012649418],"category_scores_gemma":[0.000316558,0.000095735224,0.00012367625,0.00021147475,0.00037341495,0.0005577331,0.0008473736,0.0002293629,0.00014557841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013861548,0.000040587885,0.013564685,0.0000042176625,0.00002477083,0.000007665453,0.000109356755,0.0000012146164,0.00032605627,0.97842604,0.00061133393,0.006870233],"study_design_scores_gemma":[0.0004938841,0.000044501172,0.021177879,0.000014600954,0.0000028918978,0.000008197459,0.000018035975,0.00064116786,0.003406577,0.9726764,0.0014010953,0.000114788505],"about_ca_topic_score_codex":0.00004016841,"about_ca_topic_score_gemma":0.0000071576665,"teacher_disagreement_score":0.013820645,"about_ca_system_score_codex":0.000028482864,"about_ca_system_score_gemma":0.00008117697,"threshold_uncertainty_score":0.7330836},"labels":[],"label_agreement":null},{"id":"W2612445428","doi":"","title":"Strongly Connected Components in graphs, formal proof of Tarjan1972 algorithm","year":2016,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Algorithm; Theoretical computer science","score_opus":0.02896939037415305,"score_gpt":0.262117333551516,"score_spread":0.23314794317736295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612445428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10305172,0.0016786465,0.8725528,0.006649939,0.00053319894,0.0014482805,0.00030255827,0.00016361407,0.013619233],"genre_scores_gemma":[0.8079833,0.00046423412,0.1827188,0.000033455704,0.000026055937,0.00018444465,0.00030533088,0.00008152639,0.00820286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98109573,0.01295083,0.0015603413,0.0016702389,0.0013144879,0.001408357],"domain_scores_gemma":[0.98564905,0.003625275,0.0012375041,0.004176446,0.0048517124,0.00046003942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0116401445,0.0007076059,0.0010067403,0.0008782449,0.000410753,0.00033642305,0.0051521575,0.00052412,0.00020154726],"category_scores_gemma":[0.0017708646,0.0007155648,0.00043845666,0.0017377659,0.0014847849,0.001159733,0.005328106,0.001370661,0.000054585053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052855852,0.0013908751,0.0036655453,0.00024340245,0.000121185425,0.000025568032,0.0076649725,0.00013802074,0.005335688,0.7519151,0.00008465236,0.22936213],"study_design_scores_gemma":[0.005544249,0.000009467922,0.042865362,0.01221122,0.00006460891,0.00007606122,0.00023455372,0.35894966,0.21679914,0.35046536,0.01079267,0.001987654],"about_ca_topic_score_codex":0.0014397837,"about_ca_topic_score_gemma":0.0014406756,"teacher_disagreement_score":0.70493156,"about_ca_system_score_codex":0.00033027589,"about_ca_system_score_gemma":0.00068791036,"threshold_uncertainty_score":0.99952954},"labels":[],"label_agreement":null},{"id":"W2612680057","doi":"","title":"On the monophonic sets of the strong product graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.025582562171351,"score_gpt":0.29246198838400117,"score_spread":0.26687942621265015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612680057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99019116,0.00008754815,0.00011371091,0.003925458,0.001870546,0.00040542736,0.0000020762272,0.000038015387,0.003366075],"genre_scores_gemma":[0.999534,0.000008877185,0.00014351163,0.00006710502,0.000003255404,0.00002364247,1.3941262e-7,0.0000097211405,0.00020975572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985469,0.00019679568,0.00014860234,0.00032492823,0.00047730134,0.0003054972],"domain_scores_gemma":[0.9957806,0.00027880812,0.00020232641,0.0035798873,0.00010998524,0.000048390244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000740504,0.0001220272,0.00013087122,0.000047367208,0.00080784207,0.0001459082,0.004673772,0.00002958034,0.000007865744],"category_scores_gemma":[0.00052690844,0.00006721581,0.000103474136,0.00025494487,0.00039216087,0.00030507502,0.00093315996,0.00030973004,0.00002656095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071803706,0.00004862179,0.0017346818,0.000004163127,0.000014925095,0.0000016563466,0.00016059878,0.000016065369,0.000429958,0.99475515,0.00076458417,0.0020624357],"study_design_scores_gemma":[0.00023739485,0.000066829096,0.023769904,0.000023652534,0.0000023246478,0.0000016740593,0.000012137624,0.0004859421,0.017374517,0.95780164,0.00014538958,0.00007856853],"about_ca_topic_score_codex":0.000019036872,"about_ca_topic_score_gemma":0.000003835421,"teacher_disagreement_score":0.036953464,"about_ca_system_score_codex":0.000027056436,"about_ca_system_score_gemma":0.0000745384,"threshold_uncertainty_score":0.8685109},"labels":[],"label_agreement":null},{"id":"W2612960494","doi":"","title":"Locating and differentiating-total dominating sets in unicyclic graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Graph","score_opus":0.018250348461669817,"score_gpt":0.2988495086141311,"score_spread":0.2805991601524613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612960494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965027,0.0001317762,0.0011031016,0.00021816221,0.0005134702,0.00017533285,6.9915023e-7,0.000070639115,0.0012840956],"genre_scores_gemma":[0.9959892,0.0000119295055,0.0038873295,0.00002020445,0.0000031182722,0.000021433454,8.209888e-7,0.000014947471,0.000051039573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836373,0.00014562273,0.0002467396,0.00048228624,0.00029350218,0.00046813095],"domain_scores_gemma":[0.9982538,0.00030123742,0.00020279198,0.0010534455,0.00006527293,0.00012343768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006968428,0.00016766577,0.00022104452,0.0001930397,0.000659234,0.00044472297,0.0012797271,0.00006802714,0.0000026632945],"category_scores_gemma":[0.0005322506,0.0001701821,0.000041624575,0.00024545594,0.00019940644,0.0008944283,0.0012177763,0.00034768437,0.000007815686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003874206,0.000053356845,0.07348266,0.000019944555,0.00000786342,0.000030437412,0.0005203293,0.0000042210486,0.000814901,0.86270964,0.000005719286,0.062347062],"study_design_scores_gemma":[0.0010783586,0.000055097407,0.17977974,0.00006450621,0.0000019663946,0.000013232607,0.000052606636,0.025503755,0.0010922598,0.7921569,0.0000033479532,0.00019823734],"about_ca_topic_score_codex":0.00006529252,"about_ca_topic_score_gemma":0.000024492592,"teacher_disagreement_score":0.106297076,"about_ca_system_score_codex":0.00004663476,"about_ca_system_score_gemma":0.000032293206,"threshold_uncertainty_score":0.6939825},"labels":[],"label_agreement":null},{"id":"W2613720717","doi":"10.1016/j.dam.2018.09.037","title":"Solving the clique cover problem on (bull, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e19\" altimg=\"si5.gif\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs","year":2018,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Graph; Clique; Discrete mathematics","score_opus":0.019581381596273616,"score_gpt":0.25814978523491006,"score_spread":0.23856840363863643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613720717","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2824058,0.0007591122,0.025748037,0.001133607,0.0019896247,0.00019007207,0.0005017297,0.00041867854,0.68685335],"genre_scores_gemma":[0.96590877,0.0008870228,0.025659943,0.0021085038,0.0016092669,0.0018682913,0.0006019443,0.0009089314,0.00044735346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.987937,0.00045075626,0.0022624792,0.0023299556,0.003737278,0.003282538],"domain_scores_gemma":[0.98785335,0.003108617,0.002425989,0.0051883752,0.00026816851,0.0011554748],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0036652966,0.0011999944,0.0005128109,0.0006163855,0.0024768023,0.00232477,0.0054983315,0.0019424452,0.1441864],"category_scores_gemma":[0.0016950202,0.0018464322,0.0016872276,0.0019147843,0.0032486382,0.0015854478,0.0047884746,0.0024066227,0.0035922593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009978634,0.00037856455,0.00000388859,0.0015497471,0.0010794887,0.0004797307,0.0048939744,0.0012002976,0.0030689882,0.8291553,0.15581916,0.0013729584],"study_design_scores_gemma":[0.002030916,0.0017819713,0.00002767612,0.0016381288,0.0008583856,0.0006674497,0.0024685417,0.18026134,0.7962552,0.008858795,0.0032500224,0.0019016152],"about_ca_topic_score_codex":0.00032791658,"about_ca_topic_score_gemma":0.00060046505,"teacher_disagreement_score":0.8202965,"about_ca_system_score_codex":0.000028116026,"about_ca_system_score_gemma":0.0014296544,"threshold_uncertainty_score":0.99989486},"labels":[],"label_agreement":null},{"id":"W2613721126","doi":"","title":"The orientable genus of the generalized Petersen graph P(km, m).","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Combinatorics; Petersen graph; Graph; Botany; Line graph; Biology; Voltage graph","score_opus":0.01885727857213785,"score_gpt":0.2842798774385462,"score_spread":0.26542259886640834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613721126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813524,0.000427718,0.0012070215,0.0021201596,0.00635913,0.0005178602,0.0000060094885,0.000078607154,0.007931131],"genre_scores_gemma":[0.9978349,0.000060744398,0.0008629129,0.000055752385,0.000009085479,0.000027025959,4.1873133e-7,0.000012269126,0.0011368974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998318,0.00021680979,0.00021526546,0.0002990275,0.0005252481,0.00042561183],"domain_scores_gemma":[0.99603015,0.000282374,0.00026125676,0.00316969,0.00017235898,0.000084150284],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007876916,0.00013101094,0.00016153748,0.000041819003,0.0017791808,0.00031679642,0.005065514,0.000045865927,0.000004823579],"category_scores_gemma":[0.0004033902,0.000076728946,0.000147731,0.00027466562,0.0005491002,0.00043635155,0.0014016621,0.00021705586,0.000019317455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012532988,0.000028460077,0.0028916723,0.0000032503249,0.000023841352,0.0000037226557,0.00015966865,0.000008505972,0.0011029434,0.99248034,0.0008238516,0.0024612402],"study_design_scores_gemma":[0.0006771205,0.00004779964,0.0103585385,0.000015314588,0.0000050787335,0.000005786595,0.000023032344,0.00050928973,0.010371297,0.970379,0.007494354,0.000113391536],"about_ca_topic_score_codex":0.00007626694,"about_ca_topic_score_gemma":0.000017370017,"teacher_disagreement_score":0.022101313,"about_ca_system_score_codex":0.000031817897,"about_ca_system_score_gemma":0.000082194354,"threshold_uncertainty_score":0.99952036},"labels":[],"label_agreement":null},{"id":"W2616398144","doi":"10.5539/jmr.v9n3p38","title":"The [a,b]-domination and [a,b]-total Domination of Graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chengdu University","keywords":"Domination analysis; Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Row; Graph; Discrete mathematics","score_opus":0.08169630544752136,"score_gpt":0.4265267107685333,"score_spread":0.34483040532101195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616398144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82154495,0.00085526274,0.16821486,0.004485959,0.00030712248,0.00046563998,0.000001949534,0.000009895136,0.004114361],"genre_scores_gemma":[0.9689272,0.00045861924,0.030143552,0.0000019437514,0.000038411392,0.0000046766736,6.120851e-8,0.000008371102,0.00041718318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972595,0.00028723883,0.00048401995,0.0001198841,0.0015622232,0.00028713504],"domain_scores_gemma":[0.99463695,0.0022285087,0.0006690895,0.0007976822,0.0015608396,0.000106928754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0118847815,0.00007734224,0.00020448765,0.00041491262,0.00090825337,0.000514926,0.0019404566,0.000050113846,0.0000033635374],"category_scores_gemma":[0.004276603,0.00004852823,0.00008406159,0.00023230542,0.00072225643,0.000902242,0.000608062,0.00048120908,0.0000040362775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049998922,0.00016374419,0.00023636087,0.00011682452,0.00004966064,0.000021663574,0.0016759535,0.000012942659,0.01163041,0.9086852,0.00029496575,0.07706224],"study_design_scores_gemma":[0.000767768,0.0003749026,0.0048811366,0.00014635126,0.000005656925,0.00019602443,0.0007228757,0.01966043,0.013894396,0.9590388,0.00023355646,0.00007810133],"about_ca_topic_score_codex":0.00000303826,"about_ca_topic_score_gemma":0.0000036511833,"teacher_disagreement_score":0.14738223,"about_ca_system_score_codex":0.00004192569,"about_ca_system_score_gemma":0.00011621505,"threshold_uncertainty_score":0.69856423},"labels":[],"label_agreement":null},{"id":"W2617479596","doi":"10.1016/j.tcs.2017.05.018","title":"The entire chromatic number of graphs embedded on the torus with large maximum degree","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Torus; Combinatorics; Mathematics; Graph; Colored; Degree (music); Chromatic scale; Edge coloring; Discrete mathematics; Graph power; Physics; Geometry; Line graph","score_opus":0.023421179190116572,"score_gpt":0.3095576618514181,"score_spread":0.28613648266130154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617479596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25192496,0.000022193268,0.72875714,0.0034268387,0.00045060687,0.0005026357,0.0000033994033,0.00010415888,0.014808082],"genre_scores_gemma":[0.9784808,0.0000071572526,0.021156436,0.00024269764,0.00003975047,0.000022806842,1.4504766e-7,0.0000120560135,0.0000381449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624366,0.00029347744,0.00029174017,0.00067404273,0.001549688,0.00094742567],"domain_scores_gemma":[0.9938569,0.0013714008,0.00023523676,0.0039987466,0.0003168587,0.00022087643],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0038168654,0.0002388036,0.0002435133,0.00008442229,0.0036244185,0.0011488984,0.010554751,0.000044193308,0.000044985863],"category_scores_gemma":[0.00042530382,0.00011005385,0.00010514382,0.00074237015,0.011542027,0.0006900713,0.0023263402,0.00038171007,0.00009747893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034516514,0.000063204025,0.00027780893,0.000006086662,0.000011335495,0.00001333962,0.0003498814,0.000010868589,0.00012686095,0.9794064,0.000036187605,0.019663498],"study_design_scores_gemma":[0.00035902802,0.00031868432,0.0046177073,0.00008267534,0.0000051576535,0.000046952948,0.00003422144,0.07634307,0.0048011644,0.9130865,0.000099789126,0.00020507631],"about_ca_topic_score_codex":0.0000030319036,"about_ca_topic_score_gemma":0.0000042176657,"teacher_disagreement_score":0.7265558,"about_ca_system_score_codex":0.000035872334,"about_ca_system_score_gemma":0.00014416063,"threshold_uncertainty_score":0.999888},"labels":[],"label_agreement":null},{"id":"W2619788868","doi":"10.1007/978-3-319-59250-3_23","title":"Min-Max Theorems for Packing and Covering Odd (u, v)-trails","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Disjoint sets; Cover (algebra); Mathematics; Vertex (graph theory); Graph; Upper and lower bounds; Vertex cover; Packing problems","score_opus":0.03460716648484819,"score_gpt":0.33221708495910884,"score_spread":0.29760991847426066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619788868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015977714,0.0007024932,0.97898793,0.0010936455,0.0020862275,0.00092719373,0.000012008715,0.00015198035,0.000060778846],"genre_scores_gemma":[0.58829653,0.00003917592,0.41116077,0.00020101656,0.00022716733,0.00005265032,0.0000017585047,0.000018646251,0.000002262364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99524885,0.00011820344,0.00040766635,0.0022121118,0.0008439999,0.0011691429],"domain_scores_gemma":[0.9949247,0.0015154651,0.00033986752,0.0026623623,0.0003082776,0.00024930658],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002843136,0.0005015482,0.0005837242,0.0007054797,0.0008296593,0.002511318,0.006811421,0.00027906513,0.000002087971],"category_scores_gemma":[0.0010478367,0.00045718334,0.0001434313,0.0006295903,0.00154898,0.0010468974,0.00783642,0.0010594726,0.0000031776342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001896172,0.000039186416,0.0006308516,0.00018360437,0.000014206031,0.000039721956,0.0018586577,0.060511522,0.0015161311,0.021215163,0.000004828925,0.9139672],"study_design_scores_gemma":[0.00024010504,0.00008744201,0.00044365617,0.0003003024,0.000002807361,0.00002288067,4.7165125e-7,0.46749908,0.0054362724,0.5254773,0.00009695897,0.00039271472],"about_ca_topic_score_codex":0.000029495266,"about_ca_topic_score_gemma":0.00004903581,"teacher_disagreement_score":0.91357446,"about_ca_system_score_codex":0.00019173573,"about_ca_system_score_gemma":0.000532851,"threshold_uncertainty_score":0.999788},"labels":[],"label_agreement":null},{"id":"W2621197517","doi":"10.1007/s00453-017-0328-y","title":"On the Planar Split Thickness of Graphs","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria; University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Planar graph; 1-planar graph; Planar straight-line graph; Outerplanar graph; Bipartite graph; Planar; Book embedding; Treewidth","score_opus":0.029007367667131502,"score_gpt":0.2991719772455107,"score_spread":0.2701646095783792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621197517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15189709,0.00024276493,0.75722766,0.025631746,0.0014281891,0.0010890162,0.000048554863,0.00030030214,0.062134713],"genre_scores_gemma":[0.98109573,0.000014330824,0.018079972,0.0002745566,0.000037897327,0.000020934205,7.2045975e-7,0.000011115986,0.00046473497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886125,0.0000898886,0.0001311167,0.00027130079,0.00038449702,0.00026194108],"domain_scores_gemma":[0.9971628,0.00049139623,0.00012991662,0.0020696924,0.00008589739,0.00006029613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058002124,0.00009978577,0.0001300427,0.000076099386,0.00050054584,0.00012379624,0.0033107132,0.000043467746,0.00002134718],"category_scores_gemma":[0.00025631738,0.00006424745,0.000075031894,0.00014018062,0.00036593105,0.00026269318,0.00031916043,0.0002258305,0.00007766345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008317436,0.000024459798,0.00005277031,0.0000036331814,0.000013808149,0.000010198969,0.0001052102,0.0000035653363,0.00040181575,0.969228,0.00045138857,0.029696828],"study_design_scores_gemma":[0.0001909602,0.00009975314,0.0031675482,0.000025960015,0.000002432963,0.000009746104,0.000020628177,0.0042215544,0.00874965,0.98207784,0.0013198102,0.00011410634],"about_ca_topic_score_codex":0.000025440519,"about_ca_topic_score_gemma":0.0000028354648,"teacher_disagreement_score":0.82919866,"about_ca_system_score_codex":0.0000096877675,"about_ca_system_score_gemma":0.00003363877,"threshold_uncertainty_score":0.6152184},"labels":[],"label_agreement":null},{"id":"W2623222487","doi":"","title":"Valid inequalities and separation algorithms for the set partitioning problem","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Solver; Set (abstract data type); Mathematics; Cutting-plane method; Mathematical optimization; Algorithm; Clique; Inequality; Computer science; Combinatorics; Integer programming","score_opus":0.03367840485521143,"score_gpt":0.311213719513426,"score_spread":0.27753531465821457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623222487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048499187,0.0004902817,0.9871752,0.0058523915,0.000066178225,0.00091488817,0.000017958024,0.0004364184,0.00019670968],"genre_scores_gemma":[0.57656246,0.00009797832,0.41947418,0.0013257669,0.00014077286,0.0017352742,0.000015096463,0.00003162635,0.0006168375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815893,0.0002496894,0.0003084706,0.00041219706,0.0003097697,0.00056096655],"domain_scores_gemma":[0.99789745,0.0009115228,0.00013900554,0.0007429304,0.00016064968,0.00014847389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021041897,0.00019687858,0.00019816785,0.00018902797,0.00063642976,0.00047537396,0.0007132332,0.00010366718,0.0000035772725],"category_scores_gemma":[0.0002924321,0.0001561251,0.0000799849,0.00040330947,0.00013926782,0.00073603296,0.0002960201,0.0002289026,0.0000043481386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025114035,0.000028713597,0.0014799334,0.000035142013,0.000023226927,0.0000014297711,0.0008382049,0.0033966019,0.0011721064,0.93995464,0.0008584971,0.052186407],"study_design_scores_gemma":[0.00032546042,0.00018452396,0.0016056705,0.0000241305,0.0000092612445,0.000033472086,0.00010522908,0.72818077,0.0059732283,0.25593847,0.007399733,0.00022006284],"about_ca_topic_score_codex":0.0005103133,"about_ca_topic_score_gemma":0.0003500398,"teacher_disagreement_score":0.72478414,"about_ca_system_score_codex":0.00008921092,"about_ca_system_score_gemma":0.00007509437,"threshold_uncertainty_score":0.6366597},"labels":[],"label_agreement":null},{"id":"W2624330451","doi":"","title":"Variable Neighborhood Search for Extremal Graphs: 5. Three Ways to Automate Finding Conjectures","year":2000,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Variable neighborhood search; Heuristic; Variable (mathematics); Mathematics; Algebraic number; Series (stratigraphy); Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Metaheuristic","score_opus":0.024638150233571892,"score_gpt":0.2699066596012974,"score_spread":0.2452685093677255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624330451","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07664785,0.00016968863,0.9140967,0.0006990732,0.00019639789,0.0007550003,0.000027177646,0.00043320947,0.006974917],"genre_scores_gemma":[0.4724756,0.000020660033,0.5250954,0.0008692859,0.00017533753,0.00022958388,0.000011439062,0.000062774714,0.0010599374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972366,0.00007945187,0.0002898451,0.00079184555,0.0005243189,0.0010779004],"domain_scores_gemma":[0.99800587,0.00061681616,0.00004363185,0.0008584625,0.00013758654,0.0003376298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080763025,0.0002870705,0.0003118795,0.0003873151,0.000820536,0.00033345536,0.0015957173,0.00017521522,0.00027999977],"category_scores_gemma":[0.00009951082,0.00026780486,0.00015351562,0.0011998509,0.00020858478,0.0005170596,0.00017613242,0.0004056501,0.00010235867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086420965,0.000042522723,0.00040067054,0.000030116575,0.000040655716,0.000035106692,0.0011562648,0.0016791776,0.0019680667,0.93895346,0.0005890188,0.055018544],"study_design_scores_gemma":[0.0010497012,0.00038179217,0.0010222974,0.00004068434,0.000010966995,0.00008794344,0.0000665302,0.04904736,0.0059846705,0.9338866,0.007856662,0.0005648027],"about_ca_topic_score_codex":0.0000354399,"about_ca_topic_score_gemma":0.000010516282,"teacher_disagreement_score":0.39582774,"about_ca_system_score_codex":0.00012796589,"about_ca_system_score_gemma":0.00010818071,"threshold_uncertainty_score":0.9999774},"labels":[],"label_agreement":null},{"id":"W2625770470","doi":"","title":"The Largest Small Octagon","year":2001,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Quadratic growth; Combinatorics; Conjecture; Mathematics; Unit (ring theory); Quadratic equation; Discrete mathematics; Algorithm; Geometry; Mathematics education","score_opus":0.024866541822454145,"score_gpt":0.26823908615889047,"score_spread":0.24337254433643632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625770470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014600375,0.04530729,0.86106455,0.0705646,0.0013520265,0.0012609909,0.00003891761,0.00094867154,0.004862608],"genre_scores_gemma":[0.3728861,0.04230546,0.30044,0.011362557,0.0022007683,0.0020326972,0.000035183184,0.00048012205,0.2682571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99288183,0.0010741652,0.0008657776,0.0011649282,0.00094984967,0.0030634215],"domain_scores_gemma":[0.9935062,0.0012874842,0.00037318133,0.0033741219,0.0005060469,0.0009529976],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0036675816,0.000720477,0.00053451443,0.0004846002,0.0018899598,0.0016535302,0.0043155123,0.0005884437,0.000098862205],"category_scores_gemma":[0.00093931664,0.0006335278,0.0004414195,0.0026946666,0.00096330186,0.0012515895,0.0016840626,0.0017799194,0.00041628312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014493763,0.00033020123,0.011143532,0.00003299747,0.000076970966,0.00065346924,0.0003181319,0.0012581395,0.001326851,0.74952435,0.00513833,0.23005211],"study_design_scores_gemma":[0.000850559,0.00048442127,0.016213786,0.00018390678,0.00004274273,0.0016218154,0.00016261898,0.2543009,0.0065204278,0.11740383,0.6011449,0.0010700753],"about_ca_topic_score_codex":0.008862255,"about_ca_topic_score_gemma":0.013792282,"teacher_disagreement_score":0.6321205,"about_ca_system_score_codex":0.0008490275,"about_ca_system_score_gemma":0.00074154517,"threshold_uncertainty_score":0.9996116},"labels":[],"label_agreement":null},{"id":"W2626158319","doi":"","title":"A Learning Optimization Algorithm in Graph Theory. Versatile Search for Extremal Graphs Using a Learning Algorithm","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algorithm; Variable neighborhood search; Heuristic; Computer science; Feature (linguistics); Optimization problem; Extremal optimization; Graph; Mathematics; Invariant (physics); Mathematical optimization; Theoretical computer science; Metaheuristic; Meta-optimization","score_opus":0.016419768284362,"score_gpt":0.2747208318595703,"score_spread":0.2583010635752083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626158319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024249312,0.00027612847,0.9740525,0.00016428862,0.00012170677,0.0005753388,0.00000438799,0.0002600276,0.00029633986],"genre_scores_gemma":[0.1328664,0.00008517678,0.8664487,0.00009482808,0.00008299532,0.000041458214,0.000024711982,0.000042409996,0.00031332774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648196,0.00080319913,0.00038578568,0.00079926127,0.0005678698,0.0009619208],"domain_scores_gemma":[0.99838704,0.00065756735,0.0001371802,0.00040445937,0.000223545,0.00019023422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002038632,0.000311108,0.0003513969,0.0010491003,0.00088459195,0.00027130533,0.00081997114,0.00021817297,0.000022346685],"category_scores_gemma":[0.00024808705,0.0003328536,0.00019915115,0.0019939626,0.00027625327,0.00094371324,0.00012577983,0.0010895627,0.000004099244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007591763,0.00009443366,0.0004074439,0.000016106931,0.000030182237,0.0000953353,0.005279162,0.29780227,0.00063969224,0.13162948,0.0000065927543,0.56392336],"study_design_scores_gemma":[0.0011399359,0.00041878378,0.00015832364,0.00003929135,0.000008227477,0.000061357874,0.00095301034,0.8997062,0.0006841626,0.09633505,0.00013551593,0.00036013895],"about_ca_topic_score_codex":0.000027010728,"about_ca_topic_score_gemma":0.0000013462356,"teacher_disagreement_score":0.6019039,"about_ca_system_score_codex":0.00023992798,"about_ca_system_score_gemma":0.00010556602,"threshold_uncertainty_score":0.9999123},"labels":[],"label_agreement":null},{"id":"W2626630915","doi":"10.1016/j.tcs.2017.12.024","title":"New results on edge partitions of 1-plane graphs","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cubic graph; Planar graph; Distance-regular graph; Regular graph; Graph power; Vertex (graph theory); Discrete mathematics; Complement graph; Butterfly graph; Line graph; Graph; Voltage graph","score_opus":0.0309586809723489,"score_gpt":0.32480655874926573,"score_spread":0.29384787777691684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626630915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015972624,0.000010641311,0.9550304,0.0024758761,0.0006025344,0.00018344908,0.0000104585115,0.00012204332,0.025591968],"genre_scores_gemma":[0.87287736,0.00000561898,0.12684229,0.00013309956,0.00007383162,0.000003311955,7.478744e-7,0.000006013416,0.00005770339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997159,0.00010606852,0.00032747525,0.00078725885,0.0009772946,0.00064290233],"domain_scores_gemma":[0.9956674,0.00047161328,0.00017885394,0.0029925918,0.00022486747,0.00046468896],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018034363,0.00017188412,0.00023099678,0.00029132533,0.0010655317,0.00050780165,0.006529089,0.000048953734,0.000029604187],"category_scores_gemma":[0.00056184316,0.00013904258,0.000087078726,0.0006573108,0.0051194313,0.00091607345,0.001585965,0.0002650194,0.00012644172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045564204,0.00005150277,0.00003649002,0.0000033037904,0.000003277686,0.000012993713,0.00014698366,0.000092671435,0.00072845776,0.9576966,0.00027548734,0.04090666],"study_design_scores_gemma":[0.0005097016,0.00052915234,0.0037336969,0.0000556138,0.0000023319717,0.000015191358,0.0000020611171,0.022434855,0.02497627,0.94732124,0.00023261219,0.00018725755],"about_ca_topic_score_codex":0.000009064906,"about_ca_topic_score_gemma":0.0000016167609,"teacher_disagreement_score":0.85690475,"about_ca_system_score_codex":0.000027661104,"about_ca_system_score_gemma":0.00019840393,"threshold_uncertainty_score":0.99884605},"labels":[],"label_agreement":null},{"id":"W2627073450","doi":"","title":"Integral Simplex Using Decomposition for the Set Partitioning Problem","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Simplex; Sequence (biology); Mathematics; Simplex algorithm; Degeneracy (biology); Constructive; Mathematical optimization; Polytope; Integer (computer science); Set (abstract data type); Combinatorics; Decomposition; Variable (mathematics); Revised simplex method; Algorithm; Linear programming; Computer science; Mathematical analysis","score_opus":0.028016135409146208,"score_gpt":0.3056867098088424,"score_spread":0.27767057439969617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2627073450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03159137,0.00029998485,0.960345,0.0051100366,0.00008018609,0.0019082731,0.000016276186,0.00054718036,0.00010172958],"genre_scores_gemma":[0.5403111,0.000018163526,0.45695555,0.0009561589,0.00007538414,0.0015278556,0.0000115269095,0.000030871768,0.000113405615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772125,0.00017708256,0.0003899141,0.00047574917,0.00034595293,0.000890041],"domain_scores_gemma":[0.99778396,0.0005630935,0.00017777659,0.000968218,0.00029078912,0.0002161932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009114981,0.0002563172,0.0002220655,0.00028343426,0.00081789267,0.0006990487,0.0013373608,0.00013166259,0.000031482894],"category_scores_gemma":[0.00014146323,0.00020067618,0.00017862904,0.00073104777,0.00014059902,0.0013687725,0.00041986525,0.00037619492,0.000022399334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006387781,0.00015550922,0.003894687,0.000056096273,0.00009509036,0.000011221398,0.0007690479,0.031423196,0.041126017,0.79612285,0.004060103,0.122222334],"study_design_scores_gemma":[0.00026396266,0.00010138166,0.0019768798,0.000034592562,0.000010420686,0.00006747166,0.00009590932,0.8054906,0.010458575,0.18003073,0.0012282332,0.00024120354],"about_ca_topic_score_codex":0.002949486,"about_ca_topic_score_gemma":0.0004611148,"teacher_disagreement_score":0.77406746,"about_ca_system_score_codex":0.00032638368,"about_ca_system_score_gemma":0.0001494295,"threshold_uncertainty_score":0.8183337},"labels":[],"label_agreement":null},{"id":"W2650918751","doi":"10.1007/978-3-540-28639-4_17","title":"Simplifying the Weft Hierarchy","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Hierarchy; Normalization (sociology); Monotone polygon; Simple (philosophy); Computer science; Discrete mathematics; Calculus (dental); Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics; Geometry; Philosophy; Epistemology","score_opus":0.02571374060812506,"score_gpt":0.28915049709039936,"score_spread":0.2634367564822743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2650918751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030604715,0.00068257033,0.9878468,0.002650483,0.0011521255,0.0005579391,0.0000034801126,0.00021574684,0.0068602473],"genre_scores_gemma":[0.33641073,0.00019140956,0.6548427,0.0058786804,0.001150127,0.00004513262,0.0000051121665,0.00012892576,0.0013472127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947314,0.00007683326,0.0005024238,0.0018015987,0.0017190274,0.0011687189],"domain_scores_gemma":[0.99525917,0.0012188564,0.00023248178,0.0027744602,0.0002776904,0.00023731879],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017718059,0.00058909314,0.0004768939,0.0009768496,0.0007474969,0.0008280141,0.0089355465,0.0002770365,0.000043747852],"category_scores_gemma":[0.00019546009,0.0004222506,0.00019553593,0.0012724476,0.0021927764,0.0008164675,0.0034090967,0.001907463,0.0001295418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050419667,0.000013830102,0.000014126633,0.000022082399,0.0000093161225,0.00011362117,0.0006715397,0.04343001,0.00010057226,0.4508524,0.000008235698,0.5047592],"study_design_scores_gemma":[0.00021180659,0.00011382925,0.00004650381,0.00023647939,0.000003261695,0.00009253524,1.6685533e-7,0.060512695,0.00082579424,0.93493813,0.0025050817,0.0005137007],"about_ca_topic_score_codex":0.000015882893,"about_ca_topic_score_gemma":0.00003836323,"teacher_disagreement_score":0.5042455,"about_ca_system_score_codex":0.00053027726,"about_ca_system_score_gemma":0.0010565287,"threshold_uncertainty_score":0.9998229},"labels":[],"label_agreement":null},{"id":"W26810115","doi":"","title":"Panpositionable Hamiltonian Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009376700706981624,"score_gpt":0.24881460989277235,"score_spread":0.23943790918579072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26810115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7959697,0.0012748226,0.052661855,0.004009459,0.0044410336,0.00094006764,0.000012189431,0.0018732791,0.13881758],"genre_scores_gemma":[0.99126387,0.0000071213744,0.007385495,0.00011656595,0.0000066776356,0.000031690208,0.0000058637256,0.000014163509,0.0011685342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848026,0.00009160895,0.00018365245,0.00038502086,0.00040182617,0.00045765215],"domain_scores_gemma":[0.99890405,0.00009905701,0.000051630235,0.0007223392,0.0001261949,0.00009672612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002833753,0.0001369345,0.00013558962,0.000182068,0.00025465383,0.0001450143,0.0009888988,0.00004967356,0.000019171863],"category_scores_gemma":[0.000020606676,0.00013910611,0.00007792592,0.0008939506,0.00013405953,0.0006052055,0.00024307777,0.00020216488,0.00021644717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034149455,0.000088191904,0.0011264127,0.0000039434176,0.0000059814947,0.000028141585,0.000020902286,0.000032416585,0.001455265,0.9925948,0.0024920546,0.002148496],"study_design_scores_gemma":[0.00039197746,0.00005920853,0.007944174,0.00000721071,0.000001660123,0.000009615164,0.0000025767258,0.00049341435,0.004777333,0.98167396,0.0044717393,0.00016715223],"about_ca_topic_score_codex":0.00004967751,"about_ca_topic_score_gemma":0.0000061455817,"teacher_disagreement_score":0.19529417,"about_ca_system_score_codex":0.000055824126,"about_ca_system_score_gemma":0.00005452218,"threshold_uncertainty_score":0.56725824},"labels":[],"label_agreement":null},{"id":"W26989905","doi":"","title":"On (g, f, n)-critical graphs","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012069397914073562,"score_gpt":0.286034205727043,"score_spread":0.27396480781296945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26989905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79886967,0.000709183,0.0854948,0.0048577846,0.0075825998,0.0006599616,0.000007315151,0.0016384566,0.10018025],"genre_scores_gemma":[0.9946708,0.0000023725288,0.0048056855,0.00017901859,0.00000609793,0.000018475597,0.0000013744024,0.000012919315,0.0003032659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984062,0.00011544181,0.0001635519,0.00040018838,0.0004623372,0.00045229262],"domain_scores_gemma":[0.998407,0.00061589014,0.000024643401,0.00074329425,0.00009849452,0.00011068258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029386365,0.00013417678,0.00013270226,0.00017213686,0.00017688696,0.0001119019,0.0009572251,0.00005902682,0.000024610259],"category_scores_gemma":[0.00017932756,0.00012843456,0.00007566837,0.0006579647,0.00015479639,0.00033938224,0.00019819803,0.00024176041,0.00032156144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007394736,0.00014536094,0.0003360595,0.0000036013878,0.0000029679782,0.000041719846,0.000012690941,0.000013946978,0.00028312896,0.99552536,0.0027983682,0.00082941714],"study_design_scores_gemma":[0.00034830993,0.0001556312,0.0009594149,0.000009673152,0.0000011983567,0.000007014427,0.0000023412533,0.0006170509,0.0022694704,0.99468094,0.00079881656,0.00015015423],"about_ca_topic_score_codex":0.00001166876,"about_ca_topic_score_gemma":0.0000012127615,"teacher_disagreement_score":0.19580114,"about_ca_system_score_codex":0.000039084025,"about_ca_system_score_gemma":0.000031009822,"threshold_uncertainty_score":0.52374095},"labels":[],"label_agreement":null},{"id":"W2726740999","doi":"10.1007/s00453-018-00538-5","title":"Maximum Induced Matching Algorithms via Vertex Ordering Characterizations","year":2019,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Line graph; Factor-critical graph; Discrete mathematics; Graph; Graph power","score_opus":0.015788022930710435,"score_gpt":0.26864112702820914,"score_spread":0.2528531040974987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726740999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10387988,0.000027034353,0.8923567,0.0005890745,0.00088980154,0.0003806948,0.000005279274,0.0003818927,0.0014896519],"genre_scores_gemma":[0.8424306,0.000012910568,0.15612324,0.00041998833,0.00012761515,0.000055002733,0.000020643061,0.000058733327,0.0007512841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978494,0.000099935176,0.00028958285,0.0006524171,0.0004696625,0.0006389997],"domain_scores_gemma":[0.9984081,0.00015897916,0.00009711926,0.0010264049,0.00012935585,0.0001800565],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003155868,0.00022907725,0.00025319657,0.00027321847,0.00021940903,0.00020444559,0.0014051477,0.000100713034,0.00012365796],"category_scores_gemma":[0.000030762538,0.00023293716,0.00008786598,0.0009538723,0.00003949088,0.0011698864,0.0006487308,0.0003968798,0.0011422674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001180196,0.00013706429,0.00025872706,0.000035695255,0.00007531837,0.000053194643,0.0010730008,0.00015847581,0.20609958,0.05057015,0.000037603735,0.7414894],"study_design_scores_gemma":[0.0020824987,0.0004702783,0.0077136895,0.00014323313,0.000016834107,0.00024738605,0.00018882447,0.52885914,0.057131104,0.3938615,0.0075117177,0.0017737871],"about_ca_topic_score_codex":0.000029080931,"about_ca_topic_score_gemma":0.000001545396,"teacher_disagreement_score":0.7397156,"about_ca_system_score_codex":0.00007242376,"about_ca_system_score_gemma":0.00007696831,"threshold_uncertainty_score":0.99963546},"labels":[],"label_agreement":null},{"id":"W2728728684","doi":"10.48550/arxiv.1707.00083","title":"Notes on Growing a Tree in a Graph","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of British Columbia; McGill University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Spanning tree; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Random graph; Tree (set theory); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.11561484606021308,"score_gpt":0.24108335698521177,"score_spread":0.1254685109249987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728728684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5099229,0.00007487283,0.4796403,0.00040919054,0.00050125294,0.00046563818,0.000009575221,0.00026930397,0.0087069385],"genre_scores_gemma":[0.99772185,0.00012222065,0.0014263052,0.000075547745,0.00003831235,0.0000021359156,0.0000034657396,0.00001967937,0.0005904535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997493,0.0002352313,0.00016642691,0.0013899498,0.00015852488,0.0005568356],"domain_scores_gemma":[0.99655795,0.00039359063,0.00019983605,0.0025839515,0.000090849,0.00017380554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005134578,0.000337529,0.00038221898,0.00097156526,0.00024452741,0.00019491749,0.004335707,0.0002596359,0.000008449075],"category_scores_gemma":[0.00022065015,0.00037439956,0.00026091255,0.0006223612,0.00022490544,0.00079969515,0.0030727724,0.0011205145,0.00009106026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008987893,0.00013310563,0.0054117567,0.000053032192,0.00004817063,0.0017703191,0.00023960885,0.0931763,0.000114745926,0.893121,0.000026116391,0.0058159786],"study_design_scores_gemma":[0.00076109555,0.000099964054,0.0048001143,0.000309487,0.000011751113,0.0000035678606,0.000031855674,0.1035243,0.00058358995,0.8891713,0.00014911652,0.0005538351],"about_ca_topic_score_codex":0.00017665242,"about_ca_topic_score_gemma":0.00018011354,"teacher_disagreement_score":0.48779896,"about_ca_system_score_codex":0.00020065618,"about_ca_system_score_gemma":0.00015913423,"threshold_uncertainty_score":0.9998708},"labels":[],"label_agreement":null},{"id":"W2730440053","doi":"10.1007/978-3-319-62127-2_9","title":"Dynamic Graph Coloring","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Japan Society for the Promotion of Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Exploratory Research for Advanced Technology; Fonds De La Recherche Scientifique - FNRS; Carleton University","keywords":"Combinatorics; List coloring; Omega; Graph; Vertex (graph theory); Fractional coloring; Mathematics; Complete coloring; Binary logarithm; Brooks' theorem; Edge coloring; Upper and lower bounds; Graph coloring; Discrete mathematics; Graph power; Physics; Line graph","score_opus":0.026295172870889456,"score_gpt":0.3273733207876667,"score_spread":0.30107814791677723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730440053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01820797,0.0005622166,0.9748558,0.0012764967,0.0041336,0.00056781387,0.0000046727987,0.00030561798,0.000085825355],"genre_scores_gemma":[0.5804072,0.000048919617,0.4192185,0.00018100895,0.000085538624,0.000038175487,0.000001684033,0.00001633225,0.0000026185949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99404895,0.00017478282,0.00046550954,0.0025527675,0.0014036057,0.0013543929],"domain_scores_gemma":[0.9935844,0.00058566977,0.00037311637,0.0048254016,0.00034350704,0.00028792996],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002417379,0.0005482816,0.0005923366,0.0014820023,0.00082712725,0.002127151,0.015289824,0.00032338596,0.000004335222],"category_scores_gemma":[0.00057658396,0.0005211447,0.00019291887,0.0016828735,0.0016522396,0.0011588498,0.014802129,0.0021005648,0.00003006287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093809695,0.00006511842,0.00095566956,0.00008491083,0.0000127983085,0.00018693598,0.0008858803,0.34010568,0.0008233425,0.0040671052,0.000003208772,0.65279996],"study_design_scores_gemma":[0.00014621805,0.000052878044,0.001705247,0.000198223,0.0000017609051,0.00002542401,1.5392041e-7,0.5636501,0.0019703496,0.43183196,0.000022784227,0.00039494789],"about_ca_topic_score_codex":0.000059275237,"about_ca_topic_score_gemma":0.00013213702,"teacher_disagreement_score":0.652405,"about_ca_system_score_codex":0.0004374171,"about_ca_system_score_gemma":0.0009909524,"threshold_uncertainty_score":0.99972403},"labels":[],"label_agreement":null},{"id":"W2734443656","doi":"","title":"A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for some NP-Hard Graph Optimization Problems","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Semidefinite programming; Mathematics; Hierarchy; Relaxation (psychology); Combinatorics; Projection (relational algebra); Graph; Mathematical optimization; Discrete mathematics; Algorithm","score_opus":0.01711668131733231,"score_gpt":0.24752913590911976,"score_spread":0.23041245459178744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734443656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009560483,0.00036847388,0.9818157,0.0037093824,0.00010260514,0.0034348909,0.000051562445,0.0008304373,0.0001264834],"genre_scores_gemma":[0.20264323,0.00012154902,0.7893856,0.00083515747,0.000047026886,0.006494096,0.000058833306,0.00007143418,0.0003430721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969224,0.0002449705,0.00071380695,0.00070868735,0.0005579261,0.0008522363],"domain_scores_gemma":[0.9966166,0.0005918721,0.0004739286,0.0013219928,0.000708659,0.00028692355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000918496,0.00034519038,0.00039554463,0.001713718,0.00041359247,0.00026361158,0.0012384929,0.00021313007,0.000021015483],"category_scores_gemma":[0.0005277586,0.00034415754,0.00031541832,0.0025253012,0.00022990227,0.0017019119,0.0002034475,0.00038865802,0.000008795992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096884905,0.00060747133,0.011713276,0.0002493434,0.00010178286,0.0000043588684,0.0004059248,0.41110954,0.01887039,0.5416665,0.0021135325,0.013061014],"study_design_scores_gemma":[0.000752966,0.00037617685,0.0018521355,0.00006774335,0.0000151117065,0.00001728864,0.000024331755,0.82371825,0.014259446,0.15824519,0.00029207996,0.00037926392],"about_ca_topic_score_codex":0.0017332428,"about_ca_topic_score_gemma":0.00018851359,"teacher_disagreement_score":0.41260874,"about_ca_system_score_codex":0.0002104591,"about_ca_system_score_gemma":0.00039798886,"threshold_uncertainty_score":0.99990106},"labels":[],"label_agreement":null},{"id":"W2736876508","doi":"10.46298/dmtcs.3396","title":"The Windy Postman Problem on Series-Parallel Graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Universidad Autónoma Metropolitana","keywords":"Mathematics; Combinatorics; Eulerian path; Conjecture; Polyhedron; Graph; Discrete mathematics; Pure mathematics","score_opus":0.013783356894273988,"score_gpt":0.28233515400538395,"score_spread":0.26855179711110994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736876508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00440365,0.00005268867,0.96502024,0.008666486,0.00025149496,0.00069053017,0.000003427779,0.0003507522,0.02056076],"genre_scores_gemma":[0.4665778,0.000020675932,0.53255725,0.0005338366,0.00009770105,0.0000467896,8.6405254e-7,0.000025857742,0.00013920272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947194,0.00022174977,0.0006156672,0.0010720459,0.001955064,0.0014161081],"domain_scores_gemma":[0.9955021,0.0010466368,0.00017978014,0.0024488522,0.0003263518,0.00049625745],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0036474338,0.00042161148,0.00034555228,0.00028473386,0.0019223137,0.0015206806,0.0070498926,0.0000791923,0.000031180913],"category_scores_gemma":[0.00022713559,0.00025996054,0.00019244388,0.0019510793,0.005849677,0.0013623055,0.0020224163,0.0005773097,0.0003395493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022829641,0.00010640213,0.000005233152,0.000012809402,0.000011203717,0.000009358783,0.0009845562,0.00051043014,0.0002097744,0.9816616,0.00010587537,0.016359895],"study_design_scores_gemma":[0.00019708509,0.0003179365,0.000033851968,0.00004706056,0.0000039855645,0.000064784654,0.000038017846,0.27098364,0.0009466883,0.72621596,0.00085820217,0.00029279792],"about_ca_topic_score_codex":5.649608e-7,"about_ca_topic_score_gemma":0.0000020118546,"teacher_disagreement_score":0.46217415,"about_ca_system_score_codex":0.00008909971,"about_ca_system_score_gemma":0.00014863405,"threshold_uncertainty_score":0.9999853},"labels":[],"label_agreement":null},{"id":"W2737383490","doi":"10.1007/978-3-319-71147-8_11","title":"A New Graph Parameter to Measure Linearity","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Discrete mathematics; Sigma; Conjecture; Vertex (graph theory); Bipartite graph; Graph","score_opus":0.045763194477085434,"score_gpt":0.3095016994705648,"score_spread":0.26373850499347934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737383490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020359597,0.00037546293,0.990751,0.0017496899,0.0019638794,0.0007356244,0.000006151578,0.00021629034,0.004181495],"genre_scores_gemma":[0.017870318,0.000026875976,0.97622645,0.0018731817,0.000701017,0.000017450988,0.0000023065725,0.000062662504,0.0032197305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99366003,0.00007001888,0.00051102234,0.002506594,0.0020151376,0.0012371937],"domain_scores_gemma":[0.9932386,0.00075514155,0.00028839562,0.0044571557,0.00047543313,0.0007852335],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017583163,0.00071959395,0.0007500124,0.0015682703,0.00060620776,0.0014910863,0.010545315,0.00043422947,0.000036038433],"category_scores_gemma":[0.0007998653,0.0006530655,0.00026433961,0.0006900185,0.0008515669,0.0010500684,0.0037378988,0.0016383178,0.0002252777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019448442,0.0000171596,0.000045759145,0.00001838563,0.000015470092,0.00014198812,0.00046061722,0.005279426,0.00012886927,0.03758777,0.00012641614,0.9561587],"study_design_scores_gemma":[0.00034833842,0.00031541983,0.00015624019,0.0004535406,0.0000069683315,0.00007687927,5.207045e-8,0.036462564,0.0016097007,0.9524949,0.00706448,0.0010109214],"about_ca_topic_score_codex":0.00006176249,"about_ca_topic_score_gemma":0.00024237703,"teacher_disagreement_score":0.95514774,"about_ca_system_score_codex":0.00026426173,"about_ca_system_score_gemma":0.0012076054,"threshold_uncertainty_score":0.99959207},"labels":[],"label_agreement":null},{"id":"W2737902914","doi":"","title":"Proximity and Remoteness in Graphs: Results and Conjectures","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Independence number; Upper and lower bounds; Graph; Matching (statistics); Discrete mathematics; Statistics","score_opus":0.01002575101590103,"score_gpt":0.24838504648810705,"score_spread":0.23835929547220602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737902914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582195,0.00095653866,0.035440568,0.003963785,0.000058161233,0.00027170836,0.0000036069052,0.00010689885,0.0009791915],"genre_scores_gemma":[0.9703137,0.00023479787,0.028719286,0.000614275,0.000017384667,0.0000035942953,0.000001261985,0.0000051855645,0.00009046074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987587,0.0001439827,0.00016859038,0.0004493137,0.0001818479,0.0002976147],"domain_scores_gemma":[0.9992726,0.0001826842,0.000044512657,0.00035091944,0.00004030147,0.0001089799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050599704,0.00012912808,0.00016298216,0.00022626216,0.00016631997,0.0001083149,0.00033445293,0.000098674376,4.6167688e-7],"category_scores_gemma":[0.00019800373,0.00011304533,0.000022413456,0.00045244943,0.00032254143,0.00039513438,0.00008017835,0.00030657247,7.386958e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001731252,0.000044258424,0.0021839822,0.000019115716,0.0000074988866,0.00014373715,0.0034827627,0.000020987822,0.0014143572,0.820746,0.00013071107,0.17163345],"study_design_scores_gemma":[0.0011995686,0.00017678438,0.076059036,0.000022510554,0.0000018130391,0.000083307124,0.00007074089,0.0020786126,0.0014575765,0.9177386,0.00088611036,0.0002253507],"about_ca_topic_score_codex":0.000023822671,"about_ca_topic_score_gemma":0.000028408682,"teacher_disagreement_score":0.1714081,"about_ca_system_score_codex":0.000027719865,"about_ca_system_score_gemma":0.000019952247,"threshold_uncertainty_score":0.46098548},"labels":[],"label_agreement":null},{"id":"W2739099791","doi":"10.1007/s00373-017-1833-0","title":"On Color Critical Graphs with Large Adaptable Chromatic Numbers","year":2017,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Mathematics; Critical graph; Monochromatic color; Chromatic scale; Edge coloring; Discrete mathematics; Graph; Colored; Graph power; Line graph; Physics","score_opus":0.01692756262995187,"score_gpt":0.28940403621936756,"score_spread":0.2724764735894157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739099791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91172665,0.00063070643,0.060225282,0.0018454115,0.0010447955,0.0006744861,0.00001897173,0.00042966686,0.023404004],"genre_scores_gemma":[0.9973833,0.00007034338,0.0020621102,0.00015422452,0.0000049030623,0.00004104236,9.777941e-7,0.000017753991,0.00026536407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813694,0.00007284296,0.00015789042,0.00049939833,0.00051408925,0.0006188255],"domain_scores_gemma":[0.99790984,0.00032446175,0.000088604975,0.0012539623,0.00014615027,0.00027696675],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042553217,0.00021198661,0.00025593123,0.00016703634,0.0013724959,0.00054389675,0.0011905892,0.00008148877,0.000011007463],"category_scores_gemma":[0.00021022472,0.00017071614,0.0000644958,0.00038344096,0.00039971463,0.0007051207,0.00036320565,0.00030143964,0.000018839251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028112414,0.00018755066,0.0030039158,0.00003214809,0.000019890498,0.000072752424,0.00010163611,0.0000020761258,0.000019024761,0.99561274,0.00033085173,0.0005892823],"study_design_scores_gemma":[0.0010418012,0.00071219786,0.005877303,0.000055566346,0.00000941097,0.000026188465,0.000051961182,0.0028460529,0.00016735955,0.98828256,0.0006692641,0.00026033068],"about_ca_topic_score_codex":0.00001953021,"about_ca_topic_score_gemma":0.000013521917,"teacher_disagreement_score":0.085656606,"about_ca_system_score_codex":0.000024109346,"about_ca_system_score_gemma":0.000051175528,"threshold_uncertainty_score":0.9999276},"labels":[],"label_agreement":null},{"id":"W2739569002","doi":"","title":"Even time constraints on the watchman's walk.","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Neighbourhood (mathematics); Traverse; Combinatorics; Vertex (graph theory); Mathematics; Conjecture; Tree (set theory); Interval (graph theory); Computer science; Discrete mathematics; Graph; Geography; Cartography","score_opus":0.0222203577737518,"score_gpt":0.26578216034643154,"score_spread":0.24356180257267973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739569002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75913024,0.00006804003,0.026530592,0.061677746,0.00090351736,0.0030702972,0.000020896523,0.0011273177,0.14747134],"genre_scores_gemma":[0.9877369,0.0000048985066,0.0020503544,0.00082370767,0.000049132745,0.00007773884,0.0000025424317,0.000015725838,0.00923902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980386,0.00021665568,0.00020926066,0.00042664865,0.00048624375,0.0006226134],"domain_scores_gemma":[0.99782443,0.0006559882,0.00006531252,0.0011550982,0.00011723118,0.00018193504],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00044768213,0.00019950751,0.0001741102,0.00009051392,0.00022732324,0.00022376534,0.0019620936,0.00007553203,0.0025262896],"category_scores_gemma":[0.00010775977,0.00013182127,0.000095262396,0.00041283594,0.00043891044,0.00048577224,0.00034647866,0.00043579563,0.011222152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118510825,0.0002070277,0.00060523814,0.000011350033,0.00008167388,0.000050326318,0.0005353563,0.00013094171,0.00807544,0.78900516,0.10500768,0.096277945],"study_design_scores_gemma":[0.0016651446,0.0010172473,0.039954495,0.00015088741,0.000016426113,0.00013077493,0.00024684973,0.015338681,0.029233566,0.87910044,0.031763755,0.0013817423],"about_ca_topic_score_codex":0.000020823787,"about_ca_topic_score_gemma":0.000001100588,"teacher_disagreement_score":0.22860663,"about_ca_system_score_codex":0.000042557826,"about_ca_system_score_gemma":0.00005128444,"threshold_uncertainty_score":0.99838555},"labels":[],"label_agreement":null},{"id":"W2739994513","doi":"","title":"A Note on \\(r\\)-Equitable \\(k\\)-Colorings of Trees","year":2013,"lang":"ca","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Graph; Order (exchange); Discrete mathematics","score_opus":0.01594935515695807,"score_gpt":0.26736908492634925,"score_spread":0.2514197297693912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739994513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14066455,0.0026209222,0.8286438,0.0107371425,0.00042912568,0.003616573,0.000099310135,0.0010662427,0.012122334],"genre_scores_gemma":[0.8919508,0.00040317216,0.09737244,0.0016605809,0.0001366438,0.0010995711,0.000008512888,0.00014194773,0.007226357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99240893,0.0005555346,0.0012593638,0.0014441909,0.0015357295,0.0027962434],"domain_scores_gemma":[0.99334925,0.0009627612,0.0007232441,0.003378909,0.00065134885,0.0009344707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019327002,0.00087975885,0.001098884,0.0015744936,0.0005548344,0.0006420387,0.003730298,0.0006408373,0.00035717848],"category_scores_gemma":[0.0007792683,0.0008837409,0.0005469617,0.0026945595,0.00062108185,0.0019508473,0.001915825,0.0014064845,0.00058467267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003823518,0.0014031073,0.0070748464,0.0002483792,0.00018027567,0.00014466124,0.001181257,0.0068552885,0.085371554,0.78107107,0.0058857854,0.11020142],"study_design_scores_gemma":[0.00294654,0.0047340617,0.061121162,0.0010477388,0.0001063096,0.00019802646,0.000390722,0.43268892,0.25477734,0.22858043,0.010765381,0.0026433824],"about_ca_topic_score_codex":0.011384341,"about_ca_topic_score_gemma":0.0014911945,"teacher_disagreement_score":0.7512862,"about_ca_system_score_codex":0.00090445986,"about_ca_system_score_gemma":0.0007048837,"threshold_uncertainty_score":0.99936134},"labels":[],"label_agreement":null},{"id":"W2740078596","doi":"","title":"Edge contraction and cop-win critical graphs.","year":2015,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Edge contraction; Combinatorics; Graph; Mathematics; Vertex (graph theory); Computer science; Discrete mathematics; Line graph; Voltage graph","score_opus":0.06036837910370964,"score_gpt":0.35186802948024765,"score_spread":0.291499650376538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740078596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6136714,0.0011088557,0.34920317,0.013988089,0.0026831464,0.0009125865,0.000017986898,0.0010158999,0.01739885],"genre_scores_gemma":[0.9919303,0.00001770062,0.007239606,0.0001889406,0.000047584756,0.000016262764,0.0000019245347,0.000010399543,0.00054725754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984726,0.00015094805,0.00018140252,0.00038741398,0.00036742716,0.00044023985],"domain_scores_gemma":[0.99851245,0.00038301144,0.000033146775,0.00046263353,0.00019224038,0.0004165043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005415774,0.00014090155,0.00017259733,0.00014117878,0.00012241288,0.00017399142,0.00047961535,0.00008708614,0.000023202716],"category_scores_gemma":[0.0003716998,0.00013444146,0.00004269871,0.00037624515,0.0003339718,0.0008804335,0.00020230649,0.00031829756,0.0001105462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036528098,0.00011011263,0.004090589,0.000015267658,0.000016124834,0.000073713556,0.00025729652,0.000015756059,0.0010575689,0.9736346,0.007936715,0.012755702],"study_design_scores_gemma":[0.0021226574,0.0007174481,0.023926882,0.000043552085,0.000017764674,0.00030849068,0.00023456078,0.005395116,0.005922205,0.9347506,0.025968553,0.00059212925],"about_ca_topic_score_codex":0.000020333375,"about_ca_topic_score_gemma":0.0000063796597,"teacher_disagreement_score":0.3782589,"about_ca_system_score_codex":0.000037103255,"about_ca_system_score_gemma":0.000067403766,"threshold_uncertainty_score":0.54823637},"labels":[],"label_agreement":null},{"id":"W2741433091","doi":"","title":"Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Partition (number theory); Transitive relation; Algebra homomorphism; Vertex (graph theory); Graph homomorphism; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.014305240025111307,"score_gpt":0.2726525584143579,"score_spread":0.2583473183892466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741433091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17286064,0.000052139494,0.8182541,0.0018757109,0.00028981798,0.0007553621,0.000024400388,0.00030755738,0.005580262],"genre_scores_gemma":[0.9462834,0.000021112786,0.05182552,0.001278166,0.00004159216,0.00007562511,0.000003917579,0.000023970293,0.00044670067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752384,0.000103679595,0.0002849111,0.0008513006,0.00049533846,0.0007409135],"domain_scores_gemma":[0.99769074,0.0004285323,0.00004997745,0.0009825462,0.00022610238,0.00062208576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005325741,0.00028734838,0.0003000799,0.00045280682,0.00026809823,0.000263983,0.0012788341,0.00011032948,0.000059444574],"category_scores_gemma":[0.000086573105,0.00025234776,0.00010598455,0.0011910247,0.00043458096,0.000630519,0.00043122523,0.00052809797,0.000111659705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087789005,0.00018497951,0.0015427727,0.00001756972,0.000046375335,0.0000907954,0.0014489198,0.000011739561,0.15966281,0.7659511,0.00071879453,0.07023636],"study_design_scores_gemma":[0.0059387274,0.00364777,0.039732218,0.00019331247,0.000050949402,0.0008724612,0.0012214767,0.041670367,0.122580074,0.7145917,0.06506874,0.0044322023],"about_ca_topic_score_codex":0.000046507863,"about_ca_topic_score_gemma":0.0003544843,"teacher_disagreement_score":0.7734228,"about_ca_system_score_codex":0.000014116972,"about_ca_system_score_gemma":0.00006097325,"threshold_uncertainty_score":0.99999285},"labels":[],"label_agreement":null},{"id":"W2742004821","doi":"","title":"The 2-star spectrum of stars.","year":2009,"lang":"es","type":"article","venue":"Digital Commons - East Tennessee State University (East Tennessee State University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Stars; Star (game theory); Graph; Chromatic scale; Spectrum (functional analysis); Block (permutation group theory); Element (criminal law); Tree (set theory); Discrete mathematics; Astrophysics; Physics","score_opus":0.012915187581400854,"score_gpt":0.20784282458879344,"score_spread":0.19492763700739257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742004821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85527986,0.0006064807,0.07248738,0.010565539,0.0010292787,0.0024818128,0.0075988914,0.0011506891,0.048800092],"genre_scores_gemma":[0.98463285,0.0009093762,0.00034670348,0.000047339043,0.00005430251,3.89347e-7,0.00013147792,0.0000908674,0.013786692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99166167,0.00086163764,0.00091934804,0.0020195395,0.001686961,0.0028508685],"domain_scores_gemma":[0.9922024,0.0008784393,0.0011100675,0.0029934065,0.0015638754,0.001251809],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow","sts"],"category_scores_codex":[0.0007944483,0.0013819378,0.0013916348,0.002369487,0.0028208357,0.0013660294,0.007734523,0.0002972858,0.000052401378],"category_scores_gemma":[0.00017394742,0.0014195761,0.0009420767,0.007365412,0.0031523237,0.0065086274,0.0031650942,0.001597266,0.0001972619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009628825,0.0043804594,0.01154894,0.0006151673,0.0022722576,0.012850839,0.010323122,0.0038040285,0.0025972216,0.84422994,0.0022388154,0.09551037],"study_design_scores_gemma":[0.022061825,0.009237745,0.07897009,0.0026457196,0.0010878441,0.0007205525,0.103231974,0.025571536,0.0033870998,0.113321654,0.6277662,0.011997758],"about_ca_topic_score_codex":0.00024378902,"about_ca_topic_score_gemma":0.0006057112,"teacher_disagreement_score":0.7309083,"about_ca_system_score_codex":0.0009365861,"about_ca_system_score_gemma":0.0010809487,"threshold_uncertainty_score":0.9998931},"labels":[],"label_agreement":null},{"id":"W2742025611","doi":"10.1016/j.disc.2017.06.006","title":"On nice and injective-nice tournaments","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; York University","funders":"","keywords":"Nice; Tournament; Mathematics; Combinatorics; Injective function; Homomorphism; Vertex (graph theory); Discrete mathematics; Graph; Computer science","score_opus":0.031090017430859575,"score_gpt":0.3399343565656918,"score_spread":0.3088443391348322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742025611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2948847,0.000088978755,0.6437707,0.0011785888,0.00023211897,0.00044202045,0.000009312979,0.00014112954,0.05925245],"genre_scores_gemma":[0.9336924,0.000028492874,0.06488819,0.0001192129,0.000027695505,0.000016989288,4.987224e-7,0.00001812421,0.0012083811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888635,0.0000422214,0.00016061179,0.0002871591,0.0003495619,0.00027409536],"domain_scores_gemma":[0.9980421,0.00026535743,0.00017520523,0.0013473969,0.00005512047,0.00011480311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043213114,0.00013549865,0.00016787142,0.00007140627,0.00050551945,0.00049726194,0.0013422278,0.00004038083,0.000010293659],"category_scores_gemma":[0.0005459997,0.00010877587,0.000042226962,0.00006774431,0.00015148327,0.0005688207,0.00071266486,0.00018425864,0.000073534975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009163197,0.000060820897,0.00022840193,0.00004820668,0.00002537771,0.00001835164,0.001544743,0.000010952746,0.00032457834,0.99032515,0.00014345741,0.007260808],"study_design_scores_gemma":[0.00044488566,0.00016243366,0.0019261956,0.00012480172,0.000006343749,0.000022447875,0.00015716825,0.024532218,0.0014036894,0.97072953,0.00026616876,0.00022411114],"about_ca_topic_score_codex":0.00000385123,"about_ca_topic_score_gemma":0.0000028267373,"teacher_disagreement_score":0.6388077,"about_ca_system_score_codex":0.000027497008,"about_ca_system_score_gemma":0.000018125933,"threshold_uncertainty_score":0.4795108},"labels":[],"label_agreement":null},{"id":"W2743168372","doi":"10.1007/s00493-019-3848-z","title":"Clustered Colouring in Minor-Closed Classes","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Monochromatic color; Conjecture; Chromatic scale; Graph; Windmill graph; Friendship graph; Integer (computer science); Graph coloring","score_opus":0.014357102561388977,"score_gpt":0.268063887531273,"score_spread":0.253706784969884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743168372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9689684,0.00028806672,0.008222707,0.0006102617,0.00085052353,0.0005105454,6.190942e-7,0.00021422403,0.020334661],"genre_scores_gemma":[0.9960073,0.000012367617,0.0022341267,0.00008850641,0.00000973957,0.000021910311,6.1895327e-7,0.000011908476,0.0016134747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849457,0.0001339984,0.00019542278,0.00041641796,0.0003127741,0.00044681574],"domain_scores_gemma":[0.99870783,0.00029335308,0.000055976943,0.0007768585,0.000065711494,0.00010025428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031275296,0.00012533205,0.00020118341,0.00025299288,0.000055738947,0.00008059426,0.0012686971,0.000065540604,0.00003260631],"category_scores_gemma":[0.0000775068,0.00012588197,0.00004922188,0.0010036265,0.000035980964,0.00043129423,0.0005421504,0.00025776416,0.00039184178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041520085,0.00031920502,0.05921134,0.000062300765,0.000014430264,0.000098508994,0.00052603416,0.000117295785,0.004091919,0.9246919,0.00064073026,0.010184819],"study_design_scores_gemma":[0.006221242,0.0008174569,0.1082132,0.00014091672,0.000004266436,0.000032392407,0.00017821188,0.032301165,0.015571404,0.8083243,0.027132332,0.0010631292],"about_ca_topic_score_codex":0.00000875459,"about_ca_topic_score_gemma":0.000003320143,"teacher_disagreement_score":0.11636761,"about_ca_system_score_codex":0.00014958512,"about_ca_system_score_gemma":0.00006762167,"threshold_uncertainty_score":0.5133318},"labels":[],"label_agreement":null},{"id":"W2743273005","doi":"","title":"Counting the Number of Non-Equivalent Vertex Colorings of a Graph","year":2013,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Degree (music); Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.0173763702336796,"score_gpt":0.2725153298099485,"score_spread":0.2551389595762689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743273005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34367183,0.004134735,0.6352246,0.010365609,0.00045212006,0.0019408426,0.000041410818,0.00019017645,0.003978707],"genre_scores_gemma":[0.91488874,0.0007521248,0.07885417,0.00071142113,0.0000684699,0.000616803,0.0000032546757,0.0000762007,0.004028805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949983,0.00046034832,0.0011422653,0.0007245445,0.0011664585,0.0015080827],"domain_scores_gemma":[0.99464333,0.0009715719,0.0008287411,0.002177558,0.0009933782,0.00038542727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002218934,0.00051248906,0.0007579042,0.00044519157,0.00035704396,0.00027266605,0.002962915,0.00037662455,0.00031874471],"category_scores_gemma":[0.0004950007,0.00044817425,0.00047871718,0.002440135,0.0013204778,0.001451314,0.0014642541,0.00095334486,0.000120400386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010229135,0.00072627445,0.06278777,0.00050880515,0.00024669955,0.000042440202,0.0019243945,0.0017582788,0.035373256,0.8424992,0.0038120023,0.050218605],"study_design_scores_gemma":[0.0017260901,0.0007503338,0.14530194,0.0012661545,0.00014607595,0.00047144346,0.0010569321,0.42093974,0.09859104,0.3222015,0.0062122806,0.001336491],"about_ca_topic_score_codex":0.028354283,"about_ca_topic_score_gemma":0.00043829795,"teacher_disagreement_score":0.57121694,"about_ca_system_score_codex":0.0003211667,"about_ca_system_score_gemma":0.0005182789,"threshold_uncertainty_score":0.999797},"labels":[],"label_agreement":null},{"id":"W2744335011","doi":"","title":"Augmenting Chains in Graphs Without a Skew Star","year":2003,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Corollary; Combinatorics; Mathematics; Chordal graph; Skew; Maximal independent set; Indifference graph; Generalization; Degree (music); Star (game theory); Interval graph; Pathwidth; Discrete mathematics; Class (philosophy); Matching (statistics); Cograph; Vertex (graph theory); Bipartite graph; 1-planar graph; Graph; Line graph; Computer science","score_opus":0.014547034210685027,"score_gpt":0.2619308745918902,"score_spread":0.24738384038120514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744335011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1565067,0.000890533,0.8381639,0.0010150674,0.00010525162,0.000791238,0.0000055500977,0.0007252922,0.001796463],"genre_scores_gemma":[0.6914104,0.000109911794,0.30655044,0.00078266807,0.000017659097,0.00038545742,0.000002496278,0.000047263613,0.0006936623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959988,0.0005193407,0.0005527128,0.00083950744,0.0006455989,0.0014440113],"domain_scores_gemma":[0.9975433,0.00019324078,0.00019045275,0.001561989,0.000118837685,0.0003922321],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021931042,0.0003881304,0.00042070754,0.0012110827,0.00029206474,0.00028669476,0.001564467,0.00020455063,0.000028532762],"category_scores_gemma":[0.00047490292,0.0004001356,0.00017222308,0.002386207,0.00014290107,0.00095797156,0.0004217106,0.0007397129,0.000026023006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025055195,0.00021128808,0.06219127,0.000023324583,0.000021394653,0.00012751095,0.00045180533,0.00057344174,0.0063160765,0.92082256,0.00011877806,0.009117477],"study_design_scores_gemma":[0.0027575146,0.00044266638,0.043921355,0.00024340782,0.000017252867,0.00035030456,0.00031298902,0.28341603,0.050704535,0.6088198,0.007187416,0.001826719],"about_ca_topic_score_codex":0.0012044266,"about_ca_topic_score_gemma":0.0020237674,"teacher_disagreement_score":0.53490376,"about_ca_system_score_codex":0.00042732255,"about_ca_system_score_gemma":0.0003049244,"threshold_uncertainty_score":0.999845},"labels":[],"label_agreement":null},{"id":"W2745422027","doi":"10.37236/6361","title":"Quasi-Eulerian Hypergraphs","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hypergraph; Eulerian path; Mathematics; Combinatorics; Euler's formula; Traverse; Connected component; Euler characteristic; Graph; Discrete mathematics; Pure mathematics; Lagrangian; Mathematical analysis","score_opus":0.014251556329555026,"score_gpt":0.28635943656400586,"score_spread":0.2721078802344508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745422027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1905855,0.0061512073,0.7804871,0.012807091,0.0024383806,0.00026297412,6.220681e-7,0.000068134206,0.0071989526],"genre_scores_gemma":[0.9985219,0.0007141004,0.00015739977,0.000065303626,0.000093957846,0.0000019199267,5.556162e-8,0.000012955506,0.0004323743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979957,0.00020028879,0.00031315154,0.0001469648,0.00063665165,0.0007072701],"domain_scores_gemma":[0.9972997,0.00020927553,0.00061471225,0.0014163303,0.00033868165,0.00012132582],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0024065333,0.00013692852,0.00023860982,0.0001450091,0.00082326937,0.00033967005,0.0058189845,0.000049981114,0.0000051049356],"category_scores_gemma":[0.00035209462,0.000089782756,0.00017383734,0.0002797177,0.00020431087,0.00091602537,0.00037774423,0.00093370094,0.000016101681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023686773,0.00011268571,0.00026078193,0.0000025057616,0.00004728792,0.000018101815,0.00011726769,0.00000891714,0.00025374486,0.9950911,0.0001693043,0.0038946285],"study_design_scores_gemma":[0.0006028693,0.00085503416,0.0007219394,0.000012701205,0.0000096817685,0.00023892875,0.00002756647,0.00034127737,0.0014676987,0.9879957,0.0076187225,0.000107887114],"about_ca_topic_score_codex":0.000004174935,"about_ca_topic_score_gemma":0.0000034815248,"teacher_disagreement_score":0.80793643,"about_ca_system_score_codex":0.00015289847,"about_ca_system_score_gemma":0.00045730258,"threshold_uncertainty_score":0.99956},"labels":[],"label_agreement":null},{"id":"W2749551738","doi":"10.37236/6738","title":"On $t$-Common List-Colorings","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Graph; Integer (computer science); Chromatic scale; Upper and lower bounds; Discrete mathematics","score_opus":0.014894760056865311,"score_gpt":0.3002501605083333,"score_spread":0.285355400451468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749551738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81335527,0.0021454121,0.14568822,0.014670437,0.0020703895,0.00032613953,5.1444573e-7,0.000075607015,0.021668022],"genre_scores_gemma":[0.9988038,0.00029605272,0.000043413274,0.0001119803,0.000060642444,0.0000023048879,4.1761947e-8,0.00001252123,0.000669263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980852,0.00015862928,0.00028306138,0.00014951512,0.0006773162,0.00064628554],"domain_scores_gemma":[0.99731374,0.00041260186,0.00060849683,0.0013352952,0.00022744585,0.000102414524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022246586,0.00013521568,0.00023174673,0.00012995584,0.0007481066,0.00030628665,0.005352647,0.000048034042,0.0000049763894],"category_scores_gemma":[0.00041961356,0.00008842185,0.00013996928,0.00021134915,0.00014657676,0.0006665121,0.00036793758,0.0012013355,0.000019925139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053690826,0.00007412974,0.00016985825,0.000002349382,0.000030597923,0.000023870321,0.0000814166,0.00004424768,0.00015790944,0.99638414,0.00024284334,0.0027349344],"study_design_scores_gemma":[0.00058184896,0.0010179447,0.00068821537,0.00001994525,0.0000071608115,0.000117207856,0.000009127555,0.0003447369,0.003019095,0.98983896,0.0042586992,0.00009705384],"about_ca_topic_score_codex":0.0000047820336,"about_ca_topic_score_gemma":0.000003220804,"teacher_disagreement_score":0.18544853,"about_ca_system_score_codex":0.0002882671,"about_ca_system_score_gemma":0.00029350055,"threshold_uncertainty_score":0.9946639},"labels":[],"label_agreement":null},{"id":"W2751545277","doi":"10.1007/978-3-319-73915-1_16","title":"EPG-representations with Small Grid-Size","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University; University of Waterloo","funders":"","keywords":"Treewidth; Pathwidth; Combinatorics; Monotone polygon; Bounded function; Mathematics; Vertex (graph theory); Discrete mathematics; Upper and lower bounds; Grid; Chordal graph; Graph; Line graph; Geometry","score_opus":0.028752380461927893,"score_gpt":0.28799816126131905,"score_spread":0.25924578079939115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751545277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015388647,0.00016131939,0.98847044,0.00078958384,0.0010783894,0.00056368025,0.000008740314,0.00023956272,0.008534406],"genre_scores_gemma":[0.013936617,0.00003266014,0.9810437,0.0011727908,0.0008708516,0.000032538304,0.0000054477255,0.00006765556,0.0028377424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949915,0.00007019903,0.00044788618,0.0021183474,0.001369082,0.0010030201],"domain_scores_gemma":[0.9947723,0.0014784805,0.00025924924,0.0025685858,0.00061125244,0.00031012367],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009720768,0.0005838723,0.0005052493,0.0009164114,0.00045785148,0.0006782748,0.0055805417,0.00024869427,0.00012628738],"category_scores_gemma":[0.00023915988,0.00047880266,0.00012246554,0.0013673336,0.0024926444,0.0008020709,0.0020564538,0.0010070426,0.00019114085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008630731,0.00013719093,0.00038010042,0.00010693627,0.00008789536,0.0007627104,0.0038262703,0.039835617,0.0005180626,0.2286854,0.00025330225,0.7253202],"study_design_scores_gemma":[0.0006145975,0.0006786588,0.0003045768,0.00044041369,0.0000120979885,0.00025916492,6.688886e-7,0.07287941,0.0029382934,0.9160311,0.004644709,0.0011962601],"about_ca_topic_score_codex":0.000019253946,"about_ca_topic_score_gemma":0.00023161153,"teacher_disagreement_score":0.72412395,"about_ca_system_score_codex":0.00024395458,"about_ca_system_score_gemma":0.00078315334,"threshold_uncertainty_score":0.9997997},"labels":[],"label_agreement":null},{"id":"W2751588130","doi":"10.1016/j.disc.2018.06.021","title":"Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Vertex (graph theory); Euler's formula; Spanning tree; Euler characteristic; Traverse; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.01965353357901875,"score_gpt":0.2796994088672856,"score_spread":0.26004587528826684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751588130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73940516,0.00019877464,0.25621575,0.00025990003,0.000096905715,0.00025283173,0.0000019321283,0.00012789448,0.0034408204],"genre_scores_gemma":[0.87912536,0.000026497351,0.12054092,0.00007123577,0.000030327144,0.00002849613,0.0000013882972,0.000032011416,0.00014377259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806976,0.00008028239,0.00030576842,0.00046857045,0.00047349642,0.00060212304],"domain_scores_gemma":[0.9985857,0.00032425646,0.00010270907,0.000718947,0.00011443364,0.00015395292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005261457,0.00024999736,0.00032040276,0.00027254285,0.0001861142,0.00020369135,0.0005952733,0.00006516401,0.000012881101],"category_scores_gemma":[0.0002154086,0.00019026993,0.00004733548,0.00079800346,0.00044877044,0.000584445,0.00037772034,0.00022636102,0.000036383448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012814155,0.00036891355,0.043882124,0.000576974,0.00025586292,0.0004534786,0.070774846,0.00077515276,0.008949463,0.85669726,0.00056502887,0.016572744],"study_design_scores_gemma":[0.0035157364,0.001434511,0.022172192,0.0022773207,0.00008941851,0.0003179854,0.0129111605,0.5135482,0.020965902,0.4179553,0.002414518,0.002397743],"about_ca_topic_score_codex":0.000010878809,"about_ca_topic_score_gemma":0.00002399556,"teacher_disagreement_score":0.51277304,"about_ca_system_score_codex":0.000025583486,"about_ca_system_score_gemma":0.000036003214,"threshold_uncertainty_score":0.7758983},"labels":[],"label_agreement":null},{"id":"W2751727209","doi":"10.1142/s1793830917500653","title":"Disjoint dominating sets with a perfect matching","year":2017,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Mount Allison University","keywords":"Combinatorics; Disjoint sets; Mathematics; Independence number; Discrete mathematics; Graph; Cardinality (data modeling); Matching (statistics); Computer science","score_opus":0.02575959521276084,"score_gpt":0.32599605541480425,"score_spread":0.3002364602020434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751727209","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027954606,0.0002911268,0.99129945,0.0005895575,0.00003565671,0.0013281081,0.00007375944,0.00017349547,0.003413376],"genre_scores_gemma":[0.11087896,0.00016005781,0.88640386,0.000026185604,0.000112793976,0.0019665281,0.000048289032,0.000064881184,0.00033842938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978509,0.000046156405,0.0003672572,0.0008576325,0.000467839,0.00041021875],"domain_scores_gemma":[0.99668694,0.00026513738,0.0004999924,0.0021945897,0.00016081623,0.00019254272],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006469968,0.0003849937,0.00047072832,0.00015409003,0.0008870319,0.0011762705,0.0017019927,0.00013637927,0.0000045009406],"category_scores_gemma":[0.000041129817,0.00030031032,0.00010858596,0.00014602178,0.00026037014,0.00027878326,0.0025187696,0.00067909475,0.000014617644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036829194,0.00014879869,0.000033281656,0.0010026924,0.00013526289,0.000016166252,0.0040087546,0.00063855445,0.00013008903,0.8490044,0.000019989708,0.14485836],"study_design_scores_gemma":[0.0002363476,0.00003759398,0.00010539185,0.00041736875,0.000036640537,0.000053064367,0.00030883416,0.21208751,0.00015574846,0.78575164,0.000324371,0.00048551182],"about_ca_topic_score_codex":0.000023228913,"about_ca_topic_score_gemma":0.000007271339,"teacher_disagreement_score":0.21144895,"about_ca_system_score_codex":0.00004508491,"about_ca_system_score_gemma":0.00010347482,"threshold_uncertainty_score":0.9999449},"labels":[],"label_agreement":null},{"id":"W2754102152","doi":"10.1287/moor.2017.0864","title":"Opposite Elements in Clutters","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Matroid; Combinatorics; Clutter; Ideal (ethics); Set (abstract data type); Cover (algebra); Property (philosophy); Discrete mathematics; Degenerate energy levels; Algorithm; Computer science","score_opus":0.1486357248062392,"score_gpt":0.46244065175271837,"score_spread":0.31380492694647916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754102152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60051763,0.00008639661,0.36445087,0.006104794,0.00011435038,0.001416156,0.0000121151725,0.000050280723,0.027247388],"genre_scores_gemma":[0.78777903,0.000026756039,0.21096307,0.000013266679,0.000011124574,0.000075344935,0.0000012212928,0.000009274142,0.0011208947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798787,0.00016023693,0.0003538929,0.00025335053,0.0008358996,0.0004087559],"domain_scores_gemma":[0.99744105,0.0002182979,0.000042668293,0.0018277997,0.0003862287,0.00008395445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031674884,0.00007914428,0.00016009925,0.0005156753,0.00064390356,0.0004999676,0.0028512843,0.000039608916,0.000033540233],"category_scores_gemma":[0.0011042536,0.00007231505,0.00003640479,0.0003600434,0.00030759198,0.000893313,0.0011404607,0.00029904154,0.00008919331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053211775,0.00035840186,0.0013231523,0.000078084384,0.0000152609,0.00001929003,0.0020052753,0.00090484374,0.019039545,0.9704846,0.00017590316,0.0055902814],"study_design_scores_gemma":[0.0012717455,0.00025967247,0.005667003,0.0002752151,0.0000023082403,0.00001163434,0.00057959644,0.6841882,0.041616026,0.26539537,0.00041805443,0.00031518366],"about_ca_topic_score_codex":0.0000664357,"about_ca_topic_score_gemma":0.00018022819,"teacher_disagreement_score":0.7050893,"about_ca_system_score_codex":0.00005833726,"about_ca_system_score_gemma":0.00012556034,"threshold_uncertainty_score":0.5298443},"labels":[],"label_agreement":null},{"id":"W2754199588","doi":"10.1002/jgt.20000","title":"Some remarks on domination","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012409671328413885,"score_gpt":0.2852600797355756,"score_spread":0.27285040840716174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754199588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10903512,0.0011661914,0.88332105,0.002333592,0.0010295899,0.00015033854,0.0000011088913,0.000053676773,0.0029093155],"genre_scores_gemma":[0.9783883,0.0001973874,0.02047061,0.00053693785,0.0002449173,0.0000021658352,2.0761026e-7,0.000013597187,0.00014585238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983561,0.00028214976,0.00034736938,0.00016473135,0.0005983531,0.0002512634],"domain_scores_gemma":[0.9985335,0.00038062746,0.0003081026,0.00040715406,0.00023103972,0.00013961342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027028853,0.00011753625,0.0001918866,0.0007268639,0.00012260345,0.00007130029,0.0010720367,0.000058397407,0.00001067414],"category_scores_gemma":[0.0003142526,0.00009047083,0.00020638964,0.00054560025,0.0001362386,0.0010698435,0.00008599539,0.00043339145,0.00002814685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017391624,0.00010300352,0.000013073801,0.000004762479,0.000027140533,0.000093264396,0.00026386735,0.00081479776,0.002753859,0.97647333,0.000077759985,0.019201243],"study_design_scores_gemma":[0.0009222422,0.0005081182,0.00060139,0.0000734159,0.000004881595,0.00014771117,0.000048716283,0.000022725559,0.010768665,0.98651224,0.00029198168,0.00009788625],"about_ca_topic_score_codex":3.7060116e-7,"about_ca_topic_score_gemma":3.0203424e-7,"teacher_disagreement_score":0.86935323,"about_ca_system_score_codex":0.000091572125,"about_ca_system_score_gemma":0.000097394695,"threshold_uncertainty_score":0.36892933},"labels":[],"label_agreement":null},{"id":"W2754517646","doi":"10.3390/a11040052","title":"Introduction to Reconfiguration","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":181,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control reconfiguration; Sequence (biology); Computer science; Graph; Space (punctuation); Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.01935662206999441,"score_gpt":0.30259472380446173,"score_spread":0.28323810173446734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754517646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002609905,0.000009841509,0.9846249,0.008601993,0.0008957475,0.00012891799,5.5692993e-7,0.00014632689,0.0029818069],"genre_scores_gemma":[0.17583759,0.0000092066675,0.80668306,0.001264083,0.008331616,0.00006944848,0.0000057635034,0.000022745617,0.0077764625],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914867,0.000045974397,0.00009649818,0.0003235694,0.00018077735,0.0002045087],"domain_scores_gemma":[0.99919367,0.000025921574,0.000021035097,0.0004902114,0.00018202538,0.00008711185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031258355,0.000059380225,0.000059326187,0.00012789946,0.000121772806,0.00007701658,0.0004256755,0.00002465179,0.00011115098],"category_scores_gemma":[0.00009455487,0.000056506822,0.000017966164,0.0006223512,0.000047417212,0.0004756301,0.00009770647,0.000066621215,0.0018125302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009031311,0.000019876861,0.000012527887,0.0000014347588,0.0000062902864,0.0000037340149,0.00052523887,0.000019684472,0.010234439,0.100768,0.015599762,0.8728],"study_design_scores_gemma":[0.00035983912,0.0011163432,0.001386946,0.000009899152,0.0000028068082,0.00009859808,0.00006928554,0.054365993,0.20579056,0.1528844,0.58347625,0.00043910684],"about_ca_topic_score_codex":0.0000054129155,"about_ca_topic_score_gemma":0.000004285872,"teacher_disagreement_score":0.8723609,"about_ca_system_score_codex":0.000032053915,"about_ca_system_score_gemma":0.000019701969,"threshold_uncertainty_score":0.99896467},"labels":[],"label_agreement":null},{"id":"W2755482418","doi":"10.37236/7311","title":"Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs","year":2018,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Degenerate energy levels; Graph; Planar graph; Degree (music); Induced subgraph; Planar; Discrete mathematics; Physics; Computer science; Quantum mechanics; Vertex (graph theory)","score_opus":0.025519931330893145,"score_gpt":0.2824454042820947,"score_spread":0.25692547295120155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755482418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7529243,0.01683037,0.22189844,0.0021091697,0.0042904564,0.0008301322,0.000015864825,0.00009317117,0.0010080546],"genre_scores_gemma":[0.99668384,0.0024151066,0.00048813826,0.000055066328,0.00018430792,0.000010857671,0.000002113259,0.000048377802,0.000112180474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99430186,0.0010883126,0.001303941,0.00045813265,0.0016661844,0.001181591],"domain_scores_gemma":[0.9925089,0.00066718867,0.002314163,0.0027475024,0.0015468503,0.00021543428],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0062582744,0.00047565854,0.0010755756,0.0010186564,0.00022194792,0.00014361936,0.010624571,0.0003546471,0.000007989849],"category_scores_gemma":[0.0005760815,0.00034093528,0.0007190309,0.00185109,0.00033143812,0.00034368408,0.001662477,0.0037018815,0.000005455403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019616123,0.00019607089,0.000085228225,0.00005246639,0.00044399637,0.000025091786,0.00043813718,0.00008639576,0.0014741886,0.9953021,0.0007768345,0.00092337275],"study_design_scores_gemma":[0.001552679,0.0015958626,0.000093711315,0.00012559175,0.00007880602,0.00014632914,0.000030446625,0.0002888672,0.019408273,0.9759068,0.00046589694,0.00030673153],"about_ca_topic_score_codex":0.000016065305,"about_ca_topic_score_gemma":0.000011104516,"teacher_disagreement_score":0.24375951,"about_ca_system_score_codex":0.00038573958,"about_ca_system_score_gemma":0.0021505079,"threshold_uncertainty_score":0.9999043},"labels":[],"label_agreement":null},{"id":"W2756635846","doi":"","title":"Paired domination number of generalized Petersen graphs P(n, 2).","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Discrete mathematics; Graph","score_opus":0.02345321183381491,"score_gpt":0.31202324743164106,"score_spread":0.2885700355978261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756635846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860255,0.000034493794,0.004123086,0.0004566063,0.0014507466,0.00023575354,0.000002613392,0.000101060046,0.0075701],"genre_scores_gemma":[0.9899912,0.000020088879,0.009539871,0.000027832413,0.0000043448645,0.000021559057,0.0000020074347,0.000012806893,0.00038031695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985452,0.00015098635,0.00023570532,0.00033851987,0.00042787998,0.0003016496],"domain_scores_gemma":[0.9976476,0.00011908405,0.00026690253,0.0016253255,0.0002380334,0.00010305362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005920255,0.00013334135,0.00022277578,0.00010340717,0.0003579652,0.00015421616,0.0018927688,0.00006612775,0.000027565302],"category_scores_gemma":[0.00025416177,0.00013021586,0.00011460322,0.00019364074,0.00022715575,0.0008762438,0.00050106295,0.00012752344,0.000059534614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019824889,0.00006335223,0.0074314917,0.000010523271,0.000020743817,0.000012340046,0.00017707504,0.0000020476223,0.0030076415,0.9842056,0.00027158362,0.0047777845],"study_design_scores_gemma":[0.001328107,0.00004584886,0.018096145,0.00001643752,0.0000042222396,0.0000074590625,0.000009305263,0.0013092345,0.011064722,0.96767515,0.00029613,0.00014723596],"about_ca_topic_score_codex":0.000039315266,"about_ca_topic_score_gemma":0.0000032793007,"teacher_disagreement_score":0.01653044,"about_ca_system_score_codex":0.000031249965,"about_ca_system_score_gemma":0.00004560301,"threshold_uncertainty_score":0.53100485},"labels":[],"label_agreement":null},{"id":"W2756820758","doi":"","title":"Dynamical 2-domination in Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016735094177169986,"score_gpt":0.3040113863474141,"score_spread":0.2872762921702441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756820758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837037,0.000045831053,0.005677306,0.0012594057,0.0014048924,0.00021771001,7.9869835e-7,0.00009569453,0.007594685],"genre_scores_gemma":[0.9975976,0.000011076789,0.002175527,0.000030268535,0.0000021547658,0.000021651826,9.498659e-7,0.000007906969,0.00015291097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988102,0.00009166235,0.00015334805,0.00033245367,0.00029761807,0.0003147611],"domain_scores_gemma":[0.99843436,0.00011602026,0.000086554,0.0012067836,0.000072169794,0.000084095176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005723822,0.00009837126,0.00013317155,0.00018948552,0.0002804847,0.00023434979,0.0019687028,0.00006195186,0.0000060648704],"category_scores_gemma":[0.00033007492,0.000100171055,0.000046927966,0.00022518617,0.00014780996,0.0009861229,0.0005139017,0.00022560233,0.0000597927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071135337,0.00006212749,0.010563482,0.0000031168358,0.0000029196606,0.00003012815,0.00007882153,0.0000036149875,0.00031546818,0.978816,0.000053067786,0.010064179],"study_design_scores_gemma":[0.0007198112,0.00004064826,0.0802746,0.000011769341,5.9994915e-7,0.0000032089756,0.0000055557175,0.009070451,0.0006612702,0.90898407,0.00012047626,0.00010753644],"about_ca_topic_score_codex":0.000025862544,"about_ca_topic_score_gemma":0.000021689297,"teacher_disagreement_score":0.069831885,"about_ca_system_score_codex":0.00006664387,"about_ca_system_score_gemma":0.00003476891,"threshold_uncertainty_score":0.4084857},"labels":[],"label_agreement":null},{"id":"W2757265255","doi":"10.1145/3282431","title":"Surjective H-Colouring over Reflexive Digraphs","year":2018,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Leverhulme Trust","keywords":"Surjective function; Mathematics; Combinatorics; Homomorphism; Transitive relation; Discrete mathematics; Unary operation; Digraph","score_opus":0.039183734717893305,"score_gpt":0.3530785267569117,"score_spread":0.3138947920390184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757265255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017017704,0.000100203804,0.97719735,0.00032082602,0.0017770791,0.0008012958,0.000056830617,0.00083213364,0.0018965754],"genre_scores_gemma":[0.89320207,0.0000670987,0.10523036,0.00035459467,0.00015173502,0.00024237699,0.000026117794,0.00007740007,0.0006482686],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955117,0.0011561906,0.0005270298,0.0014180983,0.0007873756,0.00059957814],"domain_scores_gemma":[0.9945404,0.0022459829,0.00032756478,0.002157041,0.00051434856,0.00021466542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001428091,0.00053536793,0.00046854155,0.0011354615,0.0006380466,0.00033926647,0.0027114318,0.00038362946,0.00013654631],"category_scores_gemma":[0.00016707835,0.00055925804,0.00042444488,0.0009731777,0.00043871798,0.0005825033,0.0003268322,0.0015758597,0.00024138778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092936546,0.0009239482,0.00005177899,0.00023311596,0.0010969063,0.00008028698,0.007326727,0.29009244,0.00026401028,0.28181943,0.0003339513,0.41684803],"study_design_scores_gemma":[0.00050656643,0.0002805995,0.0007181305,0.00015234262,0.00004053563,0.000012479589,0.000090813504,0.021695672,0.0031222096,0.972665,0.00015478482,0.00056085945],"about_ca_topic_score_codex":0.00001672442,"about_ca_topic_score_gemma":0.000012085129,"teacher_disagreement_score":0.87618434,"about_ca_system_score_codex":0.00032263508,"about_ca_system_score_gemma":0.00027947262,"threshold_uncertainty_score":0.9996859},"labels":[],"label_agreement":null},{"id":"W2757265658","doi":"","title":"On edge contractible graphs.","year":2017,"lang":"ceb","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.02807968809315036,"score_gpt":0.3185918459763213,"score_spread":0.2905121578831709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757265658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8096148,0.0013814088,0.0014837295,0.0054900604,0.03443611,0.001593384,0.000041489984,0.00043933268,0.1455197],"genre_scores_gemma":[0.9950156,0.0002019026,0.00037028038,0.00030367443,0.000029914287,0.00003436413,0.0000027676233,0.000057317717,0.0039841393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563694,0.0003613821,0.0004438269,0.001194775,0.0010691066,0.0012939582],"domain_scores_gemma":[0.99259835,0.0009195492,0.0005412279,0.005016347,0.0003798249,0.0005446776],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013896809,0.0004964243,0.00056796276,0.0003329819,0.0025307925,0.0017295055,0.0055716075,0.00027485215,0.00016470916],"category_scores_gemma":[0.0013520041,0.00050925347,0.00029162737,0.0004061707,0.0008537902,0.0017808975,0.0013107021,0.0011415508,0.0020043203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119977965,0.0004715586,0.0017952285,0.00003032916,0.000085599684,0.00022946525,0.000228215,0.000007874732,0.0003846398,0.978483,0.005461822,0.01270228],"study_design_scores_gemma":[0.00244506,0.0007096953,0.009916693,0.00015233915,0.00001808715,0.000014794771,0.000021550388,0.0012758259,0.0037512518,0.97580254,0.005340267,0.00055187516],"about_ca_topic_score_codex":0.000084151674,"about_ca_topic_score_gemma":0.000011190055,"teacher_disagreement_score":0.18540087,"about_ca_system_score_codex":0.00014677586,"about_ca_system_score_gemma":0.00025453817,"threshold_uncertainty_score":0.9998087},"labels":[],"label_agreement":null},{"id":"W2757539395","doi":"","title":"List vertex arboricity of graphs without forbidden minors.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Dense graph; Graph; 1-planar graph; Chordal graph; Planar graph","score_opus":0.023466917598065268,"score_gpt":0.3038951707554761,"score_spread":0.2804282531574108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757539395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98259884,0.00013110576,0.0019883972,0.0002764921,0.00199645,0.00027116892,0.000004209391,0.00011423563,0.012619086],"genre_scores_gemma":[0.9969138,0.0000219552,0.0025876926,0.000030484754,0.0000046084797,0.000016021857,9.1065095e-7,0.000015151876,0.00040938848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983012,0.000090658126,0.00024781708,0.00042956555,0.00050999626,0.0004207587],"domain_scores_gemma":[0.9969143,0.00014117784,0.0002659265,0.0022915544,0.00022486843,0.00016217426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053175737,0.00017100133,0.00029775404,0.00014711433,0.00044472935,0.0001794719,0.003327958,0.00008155667,0.0000128130505],"category_scores_gemma":[0.0003537239,0.0001638596,0.000121646655,0.00026318338,0.00036574248,0.0008580605,0.0008481538,0.00023316806,0.000032022213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017447583,0.00009484067,0.038124412,0.00001681122,0.00002397308,0.000012941493,0.0001380267,6.6095487e-7,0.0012834746,0.9561145,0.00036711417,0.0038058457],"study_design_scores_gemma":[0.0007522088,0.00013537896,0.041461956,0.000027501823,0.0000057411717,0.000004126973,0.000009434209,0.0007817945,0.010546242,0.9456568,0.00043572873,0.00018308473],"about_ca_topic_score_codex":0.00014818368,"about_ca_topic_score_gemma":0.000018277584,"teacher_disagreement_score":0.014314931,"about_ca_system_score_codex":0.000036332403,"about_ca_system_score_gemma":0.000075734686,"threshold_uncertainty_score":0.6682001},"labels":[],"label_agreement":null},{"id":"W2758261578","doi":"","title":"List vertex arboricity of planar graphs with 5-cycles not adjacent to 3-cycles and 4-cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Planar graph; Planar; Dense graph; 1-planar graph; Graph; Chordal graph; Computer science","score_opus":0.02108818712877475,"score_gpt":0.28472312712576175,"score_spread":0.263634939996987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758261578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950339,0.00014405977,0.0016429394,0.0010642522,0.0005412638,0.00037549945,0.000013860556,0.000094892814,0.0010893295],"genre_scores_gemma":[0.9944501,0.000071161456,0.005257039,0.00011181039,0.0000052678884,0.000024947896,0.0000013862109,0.000022997518,0.000055281234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978447,0.00010291052,0.00026708274,0.0006401529,0.0006275535,0.0005176046],"domain_scores_gemma":[0.99728864,0.00023566949,0.00021987734,0.0017320563,0.00018418353,0.00033957383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004651455,0.00025571405,0.0003863796,0.00022196413,0.00054428773,0.0002533165,0.0020167397,0.00008013071,0.0000047051662],"category_scores_gemma":[0.00019549656,0.00022210885,0.000064367334,0.00031034267,0.00046539845,0.0006696374,0.00066939957,0.00024681864,0.00001192853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013932068,0.00014340767,0.035319757,0.000035409153,0.00004452441,0.000040472954,0.00037033617,0.0000064161304,0.002148438,0.9541915,0.0002596512,0.007300737],"study_design_scores_gemma":[0.0013372161,0.00046761468,0.28021273,0.00011877136,0.000012515353,0.000012700322,0.00005494954,0.00035138254,0.014313406,0.7023023,0.00043999826,0.0003764263],"about_ca_topic_score_codex":0.00021412544,"about_ca_topic_score_gemma":0.00009234225,"teacher_disagreement_score":0.25188926,"about_ca_system_score_codex":0.00004705756,"about_ca_system_score_gemma":0.00007249369,"threshold_uncertainty_score":0.9057336},"labels":[],"label_agreement":null},{"id":"W2758506936","doi":"","title":"Limited packing vs tuple domination in graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tuple; Combinatorics; Discrete mathematics","score_opus":0.023760716884239745,"score_gpt":0.3022128325809602,"score_spread":0.27845211569672046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758506936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901183,0.000070440314,0.0028212513,0.0010669315,0.0014303441,0.00026508584,8.842318e-7,0.0001276488,0.004099082],"genre_scores_gemma":[0.9978058,0.00002374746,0.0019467076,0.00005458362,0.0000041826993,0.000027694581,0.0000016662125,0.000012476051,0.00012317946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851793,0.00012337173,0.00019745284,0.00040119747,0.00035546214,0.00040458576],"domain_scores_gemma":[0.9980608,0.00018649176,0.0001458955,0.001388801,0.00012340814,0.00009457111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080052635,0.00013052151,0.00017533507,0.00029658698,0.0004314415,0.0003704467,0.0019572887,0.00007335618,0.000007080075],"category_scores_gemma":[0.0005126921,0.00013549007,0.000057871457,0.00040870972,0.0001270532,0.0013274559,0.0005655698,0.00026066497,0.000051280083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016135953,0.00006515672,0.022780674,0.000006198122,0.000005182981,0.000034906494,0.0002532493,0.000007531683,0.0006372945,0.9656777,0.00009672135,0.010419297],"study_design_scores_gemma":[0.000986875,0.000066778535,0.093524694,0.000030488287,0.0000011373514,0.000003267729,0.000013201093,0.0044703865,0.0030159787,0.8974229,0.00031140924,0.00015285317],"about_ca_topic_score_codex":0.000045219243,"about_ca_topic_score_gemma":0.000027448647,"teacher_disagreement_score":0.07074402,"about_ca_system_score_codex":0.000070552735,"about_ca_system_score_gemma":0.000040455423,"threshold_uncertainty_score":0.55251247},"labels":[],"label_agreement":null},{"id":"W2758767216","doi":"","title":"More on domination polynomial and domination root.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Root (linguistics); Polynomial; Mathematical analysis; Linguistics; Philosophy","score_opus":0.015441702672047083,"score_gpt":0.3030483105918106,"score_spread":0.2876066079197635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758767216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98771656,0.000043693588,0.0025555475,0.0029222246,0.0014569069,0.00027300898,0.0000018402153,0.00009066995,0.0049395273],"genre_scores_gemma":[0.9984528,0.000010989816,0.0010385079,0.000052976033,0.000015886282,0.000021964597,0.0000017500827,0.000010910261,0.00039425757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878645,0.000078570076,0.0001365084,0.00038781393,0.000352625,0.0002580216],"domain_scores_gemma":[0.99848527,0.00017115907,0.00014082254,0.0009845145,0.0001119605,0.000106299536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051424577,0.00012912003,0.00013736871,0.00014864311,0.00066708936,0.00040336882,0.0010179706,0.00007359135,0.000004550346],"category_scores_gemma":[0.0003727136,0.00012574588,0.000036689744,0.00010313821,0.00017994242,0.001026228,0.000403425,0.00018107412,0.0000376948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003759601,0.00005314506,0.0015158491,0.0000056192594,0.0000072336065,0.000012135415,0.00026390998,0.0000036882386,0.00090342737,0.95445675,0.0004810471,0.042259615],"study_design_scores_gemma":[0.0022584877,0.0002571772,0.10540272,0.000030771134,0.0000043315385,0.000009015052,0.000024706882,0.005625724,0.011365159,0.8735641,0.0012028143,0.0002549819],"about_ca_topic_score_codex":0.000014797717,"about_ca_topic_score_gemma":0.0000049038917,"teacher_disagreement_score":0.10388687,"about_ca_system_score_codex":0.00006711692,"about_ca_system_score_gemma":0.00003206622,"threshold_uncertainty_score":0.513078},"labels":[],"label_agreement":null},{"id":"W2759598964","doi":"","title":"On the domination number of digraphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01990610623612386,"score_gpt":0.3113467483938648,"score_spread":0.2914406421577409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759598964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.958564,0.000015137643,0.0023367614,0.0018841827,0.0010205529,0.00021005486,0.0000013513182,0.00004604595,0.03592192],"genre_scores_gemma":[0.99914664,0.000007051507,0.0004884309,0.000053334963,0.000002613118,0.000015987824,2.7454954e-7,0.0000060396405,0.00027963167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904674,0.00009634988,0.00011977633,0.0001982564,0.00035713756,0.00018174428],"domain_scores_gemma":[0.9976694,0.00044842117,0.00015324586,0.0015622274,0.00012452212,0.00004219122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907954,0.00008028099,0.000102146136,0.000046065292,0.00041831564,0.00013004385,0.0020667228,0.000034930978,0.000025311328],"category_scores_gemma":[0.00048629617,0.000055744207,0.00006238084,0.00014825907,0.00021684144,0.0003989934,0.00032999064,0.0001462114,0.00008871931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008495229,0.000048381655,0.0018792262,0.0000027459032,0.0000083549785,0.000002570217,0.00011252347,0.0000012855786,0.00022125599,0.99377483,0.0005026116,0.0034377046],"study_design_scores_gemma":[0.00030457502,0.00004326311,0.010491355,0.000014659994,0.0000012773562,0.0000016796881,0.000007801723,0.00044097734,0.0074317423,0.9809692,0.00022986098,0.00006360153],"about_ca_topic_score_codex":0.0000109804605,"about_ca_topic_score_gemma":0.0000011798909,"teacher_disagreement_score":0.040582642,"about_ca_system_score_codex":0.000016323098,"about_ca_system_score_gemma":0.000022383567,"threshold_uncertainty_score":0.38405195},"labels":[],"label_agreement":null},{"id":"W2760251569","doi":"","title":"On the rainbow connection number of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Connection (principal bundle); Rainbow; Combinatorics; Geometry; Physics","score_opus":0.023847869553828203,"score_gpt":0.3087465662367306,"score_spread":0.28489869668290235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760251569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.974247,0.000014535354,0.001175325,0.0017734392,0.001674281,0.0002133818,0.0000013173672,0.00006590906,0.020834856],"genre_scores_gemma":[0.9992386,0.000008076712,0.00036192354,0.0000917079,0.000003129723,0.000017238792,2.863406e-7,0.000007739483,0.00027129476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989493,0.00013070456,0.00012910609,0.00023701291,0.00033563867,0.00021823091],"domain_scores_gemma":[0.99751914,0.00050104526,0.00015880725,0.0016418649,0.00012570206,0.000053450833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736202,0.0000942945,0.00012163051,0.000050568062,0.0005546778,0.00012858465,0.0018541052,0.00004357627,0.000039478393],"category_scores_gemma":[0.00055846607,0.00006727451,0.00007621824,0.0001765636,0.000258348,0.00035060223,0.0003223178,0.00019253054,0.00009741228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011921777,0.000047584184,0.0023579386,0.0000031057114,0.000013093116,0.0000034197212,0.0000961141,0.000002475285,0.00027630225,0.9947882,0.00084179663,0.0015580445],"study_design_scores_gemma":[0.00035227125,0.00006832156,0.0054380023,0.00001540734,0.0000015314131,0.000004059752,0.000012854335,0.00042012677,0.006847611,0.98644525,0.00031749165,0.00007709579],"about_ca_topic_score_codex":0.000019865569,"about_ca_topic_score_gemma":0.000001562797,"teacher_disagreement_score":0.024991646,"about_ca_system_score_codex":0.00001887662,"about_ca_system_score_gemma":0.00002690941,"threshold_uncertainty_score":0.4266189},"labels":[],"label_agreement":null},{"id":"W2761096769","doi":"10.1002/jgt.22032","title":"Planar Digraphs of Digirth Five Are 2‐Colorable","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Digraph; Combinatorics; Mathematics; Conjecture; Monochromatic color; Planar; Planar graph; Colored; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.013728620320958772,"score_gpt":0.2608323699805069,"score_spread":0.24710374965954812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761096769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30367705,0.0020563127,0.6895017,0.0011675317,0.0006231508,0.00020802715,0.000026510414,0.000058394267,0.0026813033],"genre_scores_gemma":[0.99234563,0.00035471987,0.006483771,0.000098753924,0.0000625103,0.0000029444204,1.307437e-7,0.000016284379,0.00063525065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977076,0.00043143975,0.00058638526,0.00022607025,0.00065472827,0.00039378493],"domain_scores_gemma":[0.9965758,0.0012297841,0.0008719583,0.00061347254,0.000495114,0.00021388936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002084937,0.00017295343,0.0004278424,0.0008207746,0.0001010671,0.000038924183,0.0017873396,0.0000766545,0.00003915539],"category_scores_gemma":[0.0004209962,0.000102822225,0.00035907474,0.00086062175,0.00042008542,0.0010976318,0.00014278451,0.00026315512,0.000013162251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005055674,0.00017400994,0.005826578,0.000027990578,0.00018416937,0.00014881074,0.00044619845,0.000032484302,0.012774968,0.9560548,0.0010472334,0.02277716],"study_design_scores_gemma":[0.0008942675,0.00052887533,0.0046023466,0.00024081142,0.000013256691,0.00012311417,0.0002051512,0.000009394283,0.011681445,0.9806496,0.00089861493,0.00015313034],"about_ca_topic_score_codex":0.0000011859532,"about_ca_topic_score_gemma":0.0000022587983,"teacher_disagreement_score":0.6886686,"about_ca_system_score_codex":0.000033854798,"about_ca_system_score_gemma":0.000103134065,"threshold_uncertainty_score":0.41929686},"labels":[],"label_agreement":null},{"id":"W2761101429","doi":"10.1137/17m1160094","title":"Doubly Exponentially Many Ingleton Matroids","year":2018,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Combinatorics; Mathematics; Set (abstract data type); Graphic matroid; Exponential growth; Exponential function; Matroid partitioning; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.03661481439885163,"score_gpt":0.3226857304034973,"score_spread":0.2860709160046457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761101429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024762651,0.0002875648,0.9571919,0.001312479,0.0021789751,0.0006068679,0.000020073821,0.00028352084,0.01335598],"genre_scores_gemma":[0.21224147,0.0005894593,0.78045654,0.0004748012,0.0020991422,0.00008465542,0.00001795555,0.00027116603,0.003764812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99444765,0.00035150925,0.001282785,0.0008557671,0.0020408174,0.0010214727],"domain_scores_gemma":[0.9948779,0.00032191796,0.0012561759,0.0025023285,0.00049349334,0.00054819824],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024157043,0.0007308947,0.0008787612,0.00078039686,0.0004768561,0.0018230038,0.0054245484,0.0004097877,0.00019227908],"category_scores_gemma":[0.0003298284,0.00059178344,0.0006456873,0.00043039728,0.00030383695,0.00055083714,0.0037197135,0.00281733,0.0006002887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021362212,0.00085400767,0.00004444333,0.0014750774,0.000762373,0.0011630288,0.006273744,0.0031719268,0.0023391005,0.96486527,0.009298195,0.009539223],"study_design_scores_gemma":[0.00066281966,0.0005621825,0.0000376017,0.0015618526,0.00004540065,0.00061042944,0.00010291429,0.025970826,0.0025700382,0.96459883,0.0024308134,0.00084627495],"about_ca_topic_score_codex":0.0000014284158,"about_ca_topic_score_gemma":0.0000011748316,"teacher_disagreement_score":0.18747883,"about_ca_system_score_codex":0.00030345912,"about_ca_system_score_gemma":0.00037375963,"threshold_uncertainty_score":0.9999566},"labels":[],"label_agreement":null},{"id":"W276204174","doi":"10.5555/2095116.2095171","title":"Finding an induced path of given parity in planar graphs in polynomial time","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Longest path problem; Mathematics; Discrete mathematics; Parity (physics); Planar graph; Time complexity; Graph; Chordal graph; Physics","score_opus":0.04210135392847901,"score_gpt":0.3148093836442222,"score_spread":0.27270802971574315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W276204174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99437416,0.000024438466,0.0031576485,0.000076459924,0.00006021976,0.00014796662,0.0000021686667,0.00003440195,0.0021225247],"genre_scores_gemma":[0.9916824,0.000002029692,0.008205702,0.00003209727,0.000015370411,0.000007152072,0.0000017487387,0.0000057026346,0.00004778347],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986429,0.00022381864,0.00022402575,0.0002264352,0.00022102971,0.0004617569],"domain_scores_gemma":[0.9992603,0.00014481413,0.000050531027,0.00040145512,0.000019080215,0.00012380401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010393518,0.00009331841,0.00017854139,0.00045121973,0.000029098723,0.00001860448,0.00069639186,0.0000706502,0.000032867694],"category_scores_gemma":[0.000057443463,0.0000866304,0.000030963518,0.0008133006,0.000045385394,0.0010136905,0.00016909066,0.00022755802,0.000024289653],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013337974,0.0008975319,0.72805107,0.000026123178,0.000013876157,0.000032492393,0.005835239,0.0000566206,0.10284855,0.13730372,0.00030035616,0.024501031],"study_design_scores_gemma":[0.0020481644,0.00047973634,0.88180715,0.00006885362,0.0000022223821,0.000013733261,0.00031571594,0.014811587,0.045625992,0.054061014,0.00015791283,0.00060790207],"about_ca_topic_score_codex":0.00024259562,"about_ca_topic_score_gemma":0.000087764834,"teacher_disagreement_score":0.1537561,"about_ca_system_score_codex":0.000043840428,"about_ca_system_score_gemma":0.000039939987,"threshold_uncertainty_score":0.35326853},"labels":[],"label_agreement":null},{"id":"W2763773774","doi":"10.1016/j.jcss.2015.06.011","title":"The complexity of minimum-length path decompositions","year":2015,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; Narodowe Centrum Nauki","keywords":"Mathematics; Combinatorics; Pathwidth; Discrete mathematics; Path (computing); Time complexity; Graph; Generalization; Longest path problem; Chordal graph; Line graph; Computer science","score_opus":0.08791787131458557,"score_gpt":0.33166942746323375,"score_spread":0.24375155614864819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763773774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11791286,0.0013990579,0.8768971,0.0011857433,0.00095048355,0.0001071315,0.0000017267201,0.000018239305,0.0015276442],"genre_scores_gemma":[0.92135197,0.000020056865,0.078492574,0.000022257394,0.0001004807,7.3299515e-7,3.852379e-8,0.0000018494196,0.000010062926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980801,0.00033643856,0.00048090212,0.00014625778,0.0007452578,0.00021105683],"domain_scores_gemma":[0.99828225,0.00044371808,0.00038668397,0.00022490494,0.00047044817,0.00019199608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003450248,0.000084199884,0.00023607959,0.0001586676,0.00038262154,0.0002613543,0.0014427514,0.000020935668,3.0095873e-7],"category_scores_gemma":[0.000028837296,0.00004654361,0.00007727106,0.00049174146,0.0010161591,0.0005836302,0.00026213654,0.00011895245,0.0000015503441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002869388,0.00006009045,0.0013223434,0.00003476277,0.000034943532,0.000027512217,0.0016514548,0.0008186145,0.00017022812,0.97779936,0.0011107154,0.016941274],"study_design_scores_gemma":[0.0021692365,0.004636428,0.010559042,0.0006729768,0.000026739946,0.0042602043,0.0050994037,0.6870642,0.0011045475,0.2806751,0.0032602383,0.0004719287],"about_ca_topic_score_codex":0.000004162877,"about_ca_topic_score_gemma":0.000001993612,"teacher_disagreement_score":0.8034391,"about_ca_system_score_codex":0.000027556503,"about_ca_system_score_gemma":0.00019690626,"threshold_uncertainty_score":0.37440804},"labels":[],"label_agreement":null},{"id":"W2765788600","doi":"10.1002/jgt.22143","title":"Retraction: ‘Quasi‐Graphic Matroids’ by J. Geelen, B. Gerards and G. Whittle","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.01420890413153508,"score_gpt":0.29248860798138504,"score_spread":0.27827970384984996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765788600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38809177,0.012763461,0.5781102,0.0060243076,0.003247665,0.0003398765,0.000016684542,0.00012418703,0.011281812],"genre_scores_gemma":[0.9901287,0.0016756519,0.0069823894,0.00018323907,0.00022590578,0.000003385297,3.676108e-7,0.000023053744,0.0007772896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978669,0.00035595565,0.0004402634,0.00029048324,0.00066197856,0.00038436244],"domain_scores_gemma":[0.9972449,0.00033842082,0.00075739657,0.0010472294,0.0003279226,0.0002841405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034140195,0.00019460988,0.00034019013,0.00048107308,0.00076511933,0.00052191387,0.001964708,0.00014125042,0.000038358226],"category_scores_gemma":[0.00038509787,0.00016002863,0.00022807595,0.00025965885,0.0005601687,0.0021690233,0.00028687957,0.00085186225,0.000009466938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048738264,0.00030451076,0.0069711227,0.000053793527,0.00023876021,0.0002638961,0.0006266825,0.0000072283456,0.015499009,0.8554951,0.014288604,0.105763905],"study_design_scores_gemma":[0.00093080726,0.0005774521,0.011870137,0.00007719773,0.000023364157,0.0007687032,0.00012986896,0.000102770486,0.0027498351,0.97149956,0.01100752,0.00026276306],"about_ca_topic_score_codex":0.0000022495497,"about_ca_topic_score_gemma":0.0000014775486,"teacher_disagreement_score":0.60203695,"about_ca_system_score_codex":0.000027343132,"about_ca_system_score_gemma":0.00007120711,"threshold_uncertainty_score":0.6525778},"labels":[],"label_agreement":null},{"id":"W2766314920","doi":"10.48550/arxiv.1710.10112","title":"Hyperopic Cops and Robbers","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; St. Francis Xavier University; Acadia University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Countable set; Discrete mathematics","score_opus":0.09949136672195237,"score_gpt":0.22190846105803536,"score_spread":0.12241709433608298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766314920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37871948,0.00028311036,0.61044836,0.00026546654,0.00058832695,0.0003643163,0.000012250144,0.00028229784,0.009036408],"genre_scores_gemma":[0.9927195,0.00044921157,0.0024883405,0.000043185624,0.000039786428,7.640854e-7,0.0000033560182,0.000015209002,0.0042406903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998156,0.00013460359,0.00010657624,0.001111807,0.00009928512,0.0003917397],"domain_scores_gemma":[0.997287,0.00011638047,0.0001712906,0.0020751946,0.00012093478,0.00022922974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025720516,0.00025141163,0.00028303143,0.00024717388,0.00036803493,0.0002452535,0.0028138657,0.00021280147,0.0000142765475],"category_scores_gemma":[0.00006951879,0.00028611106,0.00010967884,0.00019130381,0.00039466895,0.0005278385,0.0046052835,0.0006670842,0.00006861255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003388858,0.000050057944,0.006382612,0.00010139094,0.000102584105,0.0008020658,0.00022794318,0.017360348,0.00008732735,0.9693746,0.00026586626,0.0052113235],"study_design_scores_gemma":[0.00074577954,0.0000827568,0.004286919,0.00012521954,0.00003817957,0.000019149553,0.000051589,0.18648471,0.00022842661,0.8045957,0.002618622,0.0007229633],"about_ca_topic_score_codex":0.00006120291,"about_ca_topic_score_gemma":0.00002056052,"teacher_disagreement_score":0.61399996,"about_ca_system_score_codex":0.00010140697,"about_ca_system_score_gemma":0.0001470365,"threshold_uncertainty_score":0.9999591},"labels":[],"label_agreement":null},{"id":"W2766367798","doi":"10.23638/dmtcs-20-2-4","title":"Complexity of locally-injective homomorphisms to tournaments","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Homomorphism; Injective function; Mathematics; Neighbourhood (mathematics); Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.04145060192530764,"score_gpt":0.3299344338413944,"score_spread":0.2884838319160868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766367798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021347769,0.000026608108,0.9701828,0.0006920331,0.0009751089,0.0012954943,0.00005735662,0.00022732267,0.005195502],"genre_scores_gemma":[0.49630365,0.0000036385204,0.50335085,0.00016495031,0.000098803335,0.000037721387,0.000002963189,0.000027920196,0.0000095192645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920354,0.00034268055,0.0011876205,0.0020608548,0.0029769528,0.0013965187],"domain_scores_gemma":[0.9921464,0.00064229063,0.0005857574,0.0040865,0.001607436,0.0009316429],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0041248645,0.0007278239,0.0011782513,0.0009077682,0.0005208816,0.0008672911,0.012525999,0.00023823745,0.00011270113],"category_scores_gemma":[0.0006428977,0.0006124375,0.0003587612,0.0022734483,0.015243999,0.00052386586,0.02172864,0.0010157967,0.00017141397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025291245,0.00023970785,0.000010480346,0.00018109025,0.000045037665,0.000019445099,0.0027312117,0.00049378106,0.00044753923,0.993356,0.000066474,0.0023839276],"study_design_scores_gemma":[0.00015986853,0.0004231294,0.00006731699,0.00045317571,0.000013923699,0.000022606751,0.00003597067,0.34249648,0.0063659544,0.6495081,0.000007829864,0.00044564012],"about_ca_topic_score_codex":0.000006616105,"about_ca_topic_score_gemma":0.0000014352962,"teacher_disagreement_score":0.4749559,"about_ca_system_score_codex":0.00025569185,"about_ca_system_score_gemma":0.0005629954,"threshold_uncertainty_score":0.9996327},"labels":[],"label_agreement":null},{"id":"W2766396921","doi":"10.1016/j.jctb.2017.10.001","title":"Domination in tournaments","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; McGill University; Agence Nationale de la Recherche; National Science Foundation","keywords":"Tournament; Conjecture; Combinatorics; Mathematics; Vertex (graph theory); Dimension (graph theory); Transitive relation; Set (abstract data type); Bounded function; Class (philosophy); Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.016693407880547576,"score_gpt":0.30968788798114705,"score_spread":0.2929944801005995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766396921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8295842,0.0005048379,0.11472967,0.0041526724,0.026247706,0.0004533529,0.0000021670335,0.000053463642,0.02427195],"genre_scores_gemma":[0.99613994,0.00006169426,0.003171192,0.000024663099,0.000266242,0.0000022093898,8.966435e-8,0.00000818545,0.000325776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837524,0.00032809225,0.00042176375,0.00013092336,0.0005018353,0.00024212177],"domain_scores_gemma":[0.9980346,0.0002213799,0.0006933172,0.0006359343,0.00030895718,0.00010582761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003115864,0.000109536035,0.00025838864,0.0002643073,0.0002838623,0.00038704555,0.0023060073,0.00006230925,0.000023308672],"category_scores_gemma":[0.0013012275,0.0000937472,0.000096585,0.00014030456,0.00017607656,0.0035735592,0.00034837524,0.00036196757,0.0000067391625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046430508,0.00008612854,0.00077910844,0.000004618888,0.000017009035,0.00012667643,0.00035456024,0.000014792993,0.00089662505,0.9821826,0.00006268404,0.015010855],"study_design_scores_gemma":[0.0017552339,0.00036151553,0.0034482323,0.000051614734,0.0000027978751,0.000076393284,0.00007613173,0.000036671598,0.005952689,0.9856028,0.002538643,0.00009730171],"about_ca_topic_score_codex":0.0000015645658,"about_ca_topic_score_gemma":0.0000012339758,"teacher_disagreement_score":0.16655578,"about_ca_system_score_codex":0.00010832257,"about_ca_system_score_gemma":0.000112321446,"threshold_uncertainty_score":0.42851737},"labels":[],"label_agreement":null},{"id":"W2767821037","doi":"","title":"Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Edge coloring; Planar graph; Outerplanar graph; Planar; Pathwidth; Computer science; Graph; Telecommunications; Computer graphics (images); Line graph","score_opus":0.029177778095805466,"score_gpt":0.3063361373083527,"score_spread":0.2771583592125472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767821037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940092,0.00016429636,0.0017651023,0.00013951046,0.0011087577,0.00019633926,0.0000018990266,0.000073027615,0.0025418412],"genre_scores_gemma":[0.99634856,0.000030401226,0.0034972387,0.000012968285,0.0000073861997,0.0000125669485,4.5784205e-7,0.000013388118,0.00007702709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870616,0.0000928815,0.00022803749,0.0003767507,0.0002633043,0.00033288996],"domain_scores_gemma":[0.9983664,0.00021256841,0.00023848987,0.0009511989,0.00010491585,0.00012643113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000695691,0.00014490027,0.0002698935,0.00017067279,0.0004778831,0.00020440493,0.0013868464,0.00006072726,0.0000028660838],"category_scores_gemma":[0.00037575935,0.00014137819,0.00006240297,0.00015891161,0.00032321017,0.0007677481,0.00055340334,0.00023064551,0.0000045973334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004007205,0.00003979666,0.057200342,0.000026535326,0.000030468556,0.00001614447,0.000584853,8.112744e-7,0.0024446724,0.9298547,0.000037863367,0.00972375],"study_design_scores_gemma":[0.0015662163,0.00020996088,0.036652077,0.00008815927,0.0000070997758,0.000016752216,0.00016043927,0.00068517897,0.01036484,0.9498853,0.00015495684,0.00020902757],"about_ca_topic_score_codex":0.000058817117,"about_ca_topic_score_gemma":0.000016945736,"teacher_disagreement_score":0.020548267,"about_ca_system_score_codex":0.000027550046,"about_ca_system_score_gemma":0.00003716546,"threshold_uncertainty_score":0.57652354},"labels":[],"label_agreement":null},{"id":"W2767932262","doi":"","title":"Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Wheel graph; Planar graph; Planar; Graph; Graph power; Computer science; Line graph; Computer graphics (images)","score_opus":0.034848686404975196,"score_gpt":0.3167078772517278,"score_spread":0.2818591908467526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767932262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975195,0.00080218783,0.0040851827,0.0040450767,0.0046788,0.0008267296,0.000015405252,0.0005536801,0.009797968],"genre_scores_gemma":[0.99327433,0.00018233323,0.0043224134,0.0003213808,0.000014787649,0.000050156403,0.0000012890225,0.00002894922,0.0018043456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736834,0.00015712235,0.00029294845,0.00072876835,0.0007126781,0.0007401569],"domain_scores_gemma":[0.9964638,0.00023962808,0.00025921987,0.002548277,0.0001996798,0.0002894059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006495483,0.0002806677,0.00035745066,0.0001920125,0.0011751879,0.000715454,0.00396183,0.000118237054,0.00006443349],"category_scores_gemma":[0.00031316726,0.00023065048,0.00011926813,0.00032644166,0.00034227758,0.0019044636,0.0007305591,0.00033407146,0.0002623639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020426828,0.00025658787,0.03244949,0.000046569632,0.00010905491,0.00016244387,0.0006485293,0.000010047613,0.0010471693,0.9494787,0.007302366,0.008284799],"study_design_scores_gemma":[0.0013352669,0.0002720724,0.02227761,0.00007434043,0.000013896352,0.000019417728,0.000057772017,0.001277905,0.00976137,0.9576729,0.006805164,0.00043229587],"about_ca_topic_score_codex":0.00008204998,"about_ca_topic_score_gemma":0.000032165353,"teacher_disagreement_score":0.018079374,"about_ca_system_score_codex":0.00007229592,"about_ca_system_score_gemma":0.00015329321,"threshold_uncertainty_score":0.94056535},"labels":[],"label_agreement":null},{"id":"W2770344522","doi":"10.1016/j.dam.2017.10.027","title":"Perfect Roman domination in trees","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Johannesburg; National Research Foundation","keywords":"Mathematics; Combinatorics; Domination analysis; Vertex (graph theory); Minimum weight; Graph; Upper and lower bounds; Dominating set; Function (biology)","score_opus":0.023091819163926455,"score_gpt":0.31078932494871553,"score_spread":0.2876975057847891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770344522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15351537,0.000026374404,0.7312426,0.00044646778,0.00008122484,0.00059571693,0.0000025945853,0.00014171553,0.113947965],"genre_scores_gemma":[0.88329047,0.000008167898,0.11636824,0.000017147002,0.00002037441,0.00007108615,0.000001709187,0.000014280833,0.00020854303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988264,0.000018385283,0.00022732372,0.00030006893,0.00032106639,0.0003067947],"domain_scores_gemma":[0.99816185,0.00015114671,0.00016881333,0.0014258344,0.000026821908,0.00006553726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059947494,0.000140356,0.00020534432,0.00013931066,0.00028302157,0.00033773575,0.0016922875,0.00005397837,0.000012370182],"category_scores_gemma":[0.00014330841,0.000121007135,0.000048941336,0.00012898259,0.00012746587,0.00044650142,0.00048378212,0.00015738913,0.00008809675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005172726,0.000049795042,0.000088045585,0.00003470149,0.000005472595,0.000008194838,0.0012363415,0.000031822037,0.005276302,0.9809622,0.000028112689,0.01227381],"study_design_scores_gemma":[0.00076768966,0.000039752787,0.005085276,0.00005198002,0.0000045797647,0.000006160631,0.00025511728,0.049957898,0.010067374,0.93325114,0.00022427367,0.00028877935],"about_ca_topic_score_codex":0.000004390759,"about_ca_topic_score_gemma":0.00003387964,"teacher_disagreement_score":0.7297751,"about_ca_system_score_codex":0.000039701343,"about_ca_system_score_gemma":0.000020915106,"threshold_uncertainty_score":0.4934528},"labels":[],"label_agreement":null},{"id":"W2778851403","doi":"10.1137/1.9781611975031.17","title":"A Polynomial Excluded-Minor Approximation of Treedepth","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Combinatorics; Mathematics; Pathwidth; Minor (academic); Partial k-tree; 1-planar graph; Discrete mathematics; Tree decomposition; Graph minor; Planar graph; Bounded function; Tree-depth; Graph; Chordal graph; Line graph; Voltage graph","score_opus":0.07880150073156854,"score_gpt":0.27821666726179095,"score_spread":0.1994151665302224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778851403","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000952962,0.000086479966,0.28041935,0.00008317584,0.0003864163,0.0045193485,0.00022057928,0.00024225921,0.71308947],"genre_scores_gemma":[0.004189737,0.000033336328,0.5805577,0.00012995455,0.0024119145,0.00052449876,0.00008120835,0.00024612976,0.41182548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980317,0.000005820333,0.00062463863,0.00052501215,0.00045631392,0.0003565318],"domain_scores_gemma":[0.99816644,0.00035098655,0.00060717657,0.00061048404,0.00013680682,0.00012811217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006912344,0.000391841,0.00067540613,0.0000970192,0.00020846662,0.00009563945,0.00070740667,0.00071493105,0.000020393132],"category_scores_gemma":[0.000027200247,0.00035302178,0.0004966337,0.000038424794,0.0005539403,0.000065677676,0.00043486888,0.00041816448,0.000008214742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053594213,0.000032838532,5.0866532e-8,0.00035678584,0.0002118205,2.3256251e-7,0.0025739053,7.6160137e-7,0.0017512592,0.9479612,0.008502777,0.03855474],"study_design_scores_gemma":[0.0024211027,0.00033452746,4.6525614e-8,0.00025599764,0.00013732148,0.0000072151747,0.00026619714,0.0015917816,0.013578237,0.94904137,0.031748418,0.000617783],"about_ca_topic_score_codex":7.86547e-7,"about_ca_topic_score_gemma":8.767021e-7,"teacher_disagreement_score":0.30126396,"about_ca_system_score_codex":0.000053040854,"about_ca_system_score_gemma":0.00016935047,"threshold_uncertainty_score":0.9998922},"labels":[],"label_agreement":null},{"id":"W2779612036","doi":"10.1016/j.disc.2018.05.017","title":"Throttling for the game of Cops and Robbers on graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Bandwidth throttling; Combinatorics; Mathematics; Hypercube; Graph; Discrete mathematics; Physics","score_opus":0.04886693414521081,"score_gpt":0.34045688068476365,"score_spread":0.29158994653955284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779612036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013752646,0.00034932053,0.9828298,0.00041060115,0.00026784002,0.0012718558,0.000048694732,0.000071059396,0.0009981657],"genre_scores_gemma":[0.51116025,0.0003658827,0.48746502,0.00013473809,0.00011927447,0.00037010503,0.000012305132,0.000084649924,0.00028779873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838966,0.000058427697,0.00038367102,0.00043895785,0.0004199539,0.00030934534],"domain_scores_gemma":[0.9963608,0.0015675162,0.0003492923,0.0014761423,0.00017934082,0.00006691532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010021062,0.00025074912,0.00038801116,0.00013712991,0.00013542212,0.00015032692,0.0016057659,0.00012769629,0.000005250356],"category_scores_gemma":[0.00033912537,0.00016150775,0.0001851373,0.00018527196,0.00047334642,0.00008212998,0.0013516386,0.00034192175,0.0000045750508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001873364,0.000043031356,0.000014849438,0.0008897643,0.00012742964,0.0000010704924,0.004241355,0.00080290466,0.00010249843,0.9910907,0.00019427839,0.0024733646],"study_design_scores_gemma":[0.00016870258,0.00012009077,0.00002055236,0.00035434903,0.000026329919,0.0000030596127,0.00019930578,0.1526363,0.0014758598,0.8446803,0.00014437236,0.00017077372],"about_ca_topic_score_codex":0.0000028362392,"about_ca_topic_score_gemma":0.0000019616905,"teacher_disagreement_score":0.4974076,"about_ca_system_score_codex":0.000020075026,"about_ca_system_score_gemma":0.00005538113,"threshold_uncertainty_score":0.6586095},"labels":[],"label_agreement":null},{"id":"W2779660954","doi":"10.1137/1.9781611975031.15","title":"A submodular measure and approximate Gomory-Hu theorem for packing odd trails","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Discrete mathematics; Vertex (graph theory); Dual graph; Disjoint sets; Bipartite graph; Perimeter; Submodular set function; Graph; Planar graph; Geometry","score_opus":0.08882011198420672,"score_gpt":0.2753661026118458,"score_spread":0.18654599062763907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779660954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039451956,0.00026767165,0.89347667,0.00012261105,0.00024811958,0.0066215033,0.00031045458,0.00028667477,0.098271795],"genre_scores_gemma":[0.005974721,0.00012983593,0.8245308,0.00045052762,0.0034438996,0.002507296,0.000112644215,0.00065470947,0.16219556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973625,0.000011174905,0.00056745874,0.0009044842,0.00048971607,0.0006646555],"domain_scores_gemma":[0.9977582,0.00068170315,0.00044142536,0.00069235323,0.00019814918,0.00022815316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018743228,0.0006095744,0.0008563225,0.00008388426,0.0005933721,0.00034224545,0.0007236396,0.0009209769,0.000008576798],"category_scores_gemma":[0.00006438088,0.000525988,0.0005500916,0.000038026632,0.00075577805,0.00011129934,0.000428584,0.0006050964,0.0000026941716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057159323,0.000017086168,4.15999e-8,0.00049364666,0.00026295468,4.99896e-7,0.0028509179,7.2121753e-7,0.00052908866,0.96236044,0.0009564259,0.032471005],"study_design_scores_gemma":[0.0019951514,0.00018573331,1.8408205e-8,0.00029057218,0.00013743479,0.0000122972815,0.00030049786,0.0025374023,0.001821528,0.97452337,0.017603451,0.0005925719],"about_ca_topic_score_codex":2.9550753e-7,"about_ca_topic_score_gemma":9.861748e-7,"teacher_disagreement_score":0.06894585,"about_ca_system_score_codex":0.000057526497,"about_ca_system_score_gemma":0.0001409055,"threshold_uncertainty_score":0.99971914},"labels":[],"label_agreement":null},{"id":"W2780248561","doi":"10.48550/arxiv.1408.4099","title":"Continuous Yao Graphs","year":2014,"lang":"en","type":"article","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Vertex (graph theory); Mathematics; Algebraic number; Graph; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.021165714211939666,"score_gpt":0.244958602101487,"score_spread":0.22379288788954735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780248561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8270589,0.0002443525,0.07967022,0.0005921905,0.00012285492,0.0008924349,0.0004917914,0.00021307914,0.09071416],"genre_scores_gemma":[0.96540326,0.00010128749,0.010065131,0.000018424702,0.000033527594,1.9732819e-7,0.00001686533,0.000044510103,0.024316775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9939005,0.0012455573,0.0003348294,0.0011013177,0.0021813675,0.0012364241],"domain_scores_gemma":[0.995002,0.000819267,0.00046492333,0.0017733587,0.0013021395,0.0006383526],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00368611,0.00038084612,0.00077222864,0.001456818,0.0010270518,0.000066414395,0.0050607775,0.000347216,0.0037914615],"category_scores_gemma":[0.00027293467,0.00048189913,0.00054600777,0.0022556526,0.0027549034,0.0006038831,0.0020905314,0.0010152645,0.002711027],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066224835,0.0040965513,0.16591688,0.0016483648,0.003225896,0.005055136,0.15748827,0.00070616306,0.033970382,0.40306166,0.026941929,0.19126627],"study_design_scores_gemma":[0.015198463,0.0031006087,0.00883321,0.0010838885,0.00030880782,0.00018757358,0.7209901,0.017157687,0.0016988516,0.16355442,0.06411828,0.0037681],"about_ca_topic_score_codex":0.0018768364,"about_ca_topic_score_gemma":0.0010213145,"teacher_disagreement_score":0.56350183,"about_ca_system_score_codex":0.000083227744,"about_ca_system_score_gemma":0.00032203604,"threshold_uncertainty_score":0.99995905},"labels":[],"label_agreement":null},{"id":"W2782559833","doi":"10.1016/j.dam.2017.12.025","title":"On the b-chromatic number of cartesian products","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Cartesian product; Chromatic scale; Mathematics; Combinatorics; Cartesian coordinate system; Product (mathematics); Upper and lower bounds; Degree (music); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.021711555029133123,"score_gpt":0.29433126071343874,"score_spread":0.2726197056843056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782559833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18356602,0.000012134441,0.63813615,0.0014077817,0.00012849557,0.0012091807,0.000005975831,0.00020707984,0.1753272],"genre_scores_gemma":[0.8602204,0.0000013832537,0.13933599,0.00012181224,0.000046035682,0.00005862448,8.8354165e-7,0.00001995183,0.00019493255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998556,0.000035516157,0.0002974441,0.0002867936,0.00051046145,0.00031375972],"domain_scores_gemma":[0.9976494,0.00049869897,0.0001666484,0.0015075703,0.00012025152,0.000057476827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057601515,0.00016034415,0.00021738563,0.000054238622,0.00015355115,0.000058418915,0.0012519093,0.000039271374,0.000073437965],"category_scores_gemma":[0.00021246356,0.00009819052,0.000049049246,0.0006215053,0.00039169154,0.00009732889,0.000271313,0.00013987058,0.0005490964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043386995,0.000058407204,0.0000029487376,0.00008223393,0.00001749858,9.136132e-7,0.0021372053,0.000002542986,0.0056984914,0.99086064,0.00045579573,0.0006789829],"study_design_scores_gemma":[0.00013985844,0.00006268867,0.000025124555,0.00005257087,0.0000070878564,0.000008756366,0.00026169955,0.004597573,0.06947578,0.925082,0.00014562227,0.00014123226],"about_ca_topic_score_codex":8.4458236e-7,"about_ca_topic_score_gemma":7.1202913e-7,"teacher_disagreement_score":0.67665434,"about_ca_system_score_codex":0.000017977918,"about_ca_system_score_gemma":0.00004080419,"threshold_uncertainty_score":0.7057707},"labels":[],"label_agreement":null},{"id":"W2782669095","doi":"","title":"Edge domination in grids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.02811728436622272,"score_gpt":0.3019724679526868,"score_spread":0.27385518358646405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782669095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76928526,0.00061972195,0.20579152,0.00048435945,0.020530334,0.00040710892,6.204346e-7,0.00007045512,0.0028106135],"genre_scores_gemma":[0.97241175,0.00001757786,0.026872074,0.000017579601,0.00065320096,0.0000016933498,2.9537765e-7,0.000018548006,0.0000072499083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971793,0.00023057731,0.0010108695,0.00023740865,0.0009553204,0.00038650207],"domain_scores_gemma":[0.9970862,0.0007404007,0.00070234324,0.00033763333,0.00081936235,0.00031402227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004427517,0.00022168226,0.0005977245,0.0005065928,0.00011171112,0.00028325184,0.0010249657,0.00012895127,0.0000013289765],"category_scores_gemma":[0.0012683095,0.00020076089,0.00010586359,0.0008359572,0.000089115005,0.00077792007,0.00051247975,0.00057065254,0.0000038647017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056700468,0.0003546419,0.00030234404,0.000042408323,0.000018917222,0.00005783342,0.0018789929,0.000085510146,0.00018546643,0.99301165,0.00013621022,0.0038693433],"study_design_scores_gemma":[0.0051620603,0.0006877783,0.00014320073,0.0001644886,0.000009450057,0.00013437748,0.00029764549,0.019214429,0.0006112875,0.97283375,0.0005244806,0.00021702533],"about_ca_topic_score_codex":0.000004900548,"about_ca_topic_score_gemma":3.8256118e-7,"teacher_disagreement_score":0.2031265,"about_ca_system_score_codex":0.00018199137,"about_ca_system_score_gemma":0.00027600845,"threshold_uncertainty_score":0.81867915},"labels":[],"label_agreement":null},{"id":"W2783355325","doi":"","title":"Upward Order-Preserving 8-Grid-Drawings of Binary Trees.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary number; Binary tree; Grid; Computer graphics (images); Algorithm; Mathematics; Geometry; Arithmetic","score_opus":0.05160737549822516,"score_gpt":0.31323921461039234,"score_spread":0.2616318391121672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783355325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51513314,0.00026792844,0.37580022,0.023419717,0.0021073557,0.00093676936,0.0003423099,0.0002607056,0.08173184],"genre_scores_gemma":[0.9791776,0.000008869372,0.019843005,0.00037566715,0.000070335984,0.000012301993,0.000022108132,0.000015951822,0.00047419532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786747,0.00008426868,0.00029670648,0.0005513511,0.0006306253,0.00056956575],"domain_scores_gemma":[0.99689925,0.00034050664,0.00016955126,0.001227229,0.000791365,0.0005720935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044684243,0.00020702505,0.00027528754,0.0010072542,0.0007515569,0.00041164528,0.0032716547,0.00010035788,0.000247872],"category_scores_gemma":[0.0007223852,0.00022227255,0.00008429413,0.0006771045,0.00035349818,0.0007895364,0.00043607285,0.00031594632,0.00012064952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027714053,0.0000656253,0.0076315054,0.000048428203,0.00006623141,0.0001516486,0.00029925012,0.030970154,0.00047481002,0.9227329,0.0029782061,0.03455353],"study_design_scores_gemma":[0.0011887836,0.0004305634,0.26741403,0.00028091617,0.000009170964,0.000031230204,0.00013579038,0.41045904,0.00071080547,0.31310773,0.005394885,0.0008370402],"about_ca_topic_score_codex":0.007399025,"about_ca_topic_score_gemma":0.0067672366,"teacher_disagreement_score":0.60962516,"about_ca_system_score_codex":0.00014981654,"about_ca_system_score_gemma":0.0017643902,"threshold_uncertainty_score":0.9992108},"labels":[],"label_agreement":null},{"id":"W2783589701","doi":"10.1016/j.disopt.2017.08.005","title":"A linear time algorithm for the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml167\" display=\"inline\" overflow=\"scroll\" altimg=\"si167.gif\"><mml:mn>3</mml:mn></mml:math>-neighbour Travelling Salesman Problem on a Halin graph and extensions","year":2017,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Travelling salesman problem; Hamiltonian path; Algorithm; Graph; Discrete mathematics","score_opus":0.020127424260410667,"score_gpt":0.2707476361752828,"score_spread":0.25062021191487216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783589701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09048519,0.0002313863,0.9067416,0.000984285,0.00029029098,0.00044999793,0.00023550006,0.00018818263,0.00039354927],"genre_scores_gemma":[0.3006951,0.0012116767,0.6943742,0.0006180558,0.00064747385,0.0007759868,0.00069814426,0.00026619175,0.00071317883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970631,0.0001222722,0.0005112562,0.00090972637,0.0006770201,0.00071665226],"domain_scores_gemma":[0.9969477,0.0006037748,0.0005255494,0.0014972468,0.00018147964,0.00024423611],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010008399,0.00039170592,0.00027399248,0.00015426437,0.002051993,0.000804919,0.0012606937,0.00028509312,0.000009203649],"category_scores_gemma":[0.0003261277,0.0003462219,0.00028745568,0.0003085718,0.0004523656,0.0010745978,0.00059714296,0.0004511661,0.00009175299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013736615,0.00007808116,0.000002881558,0.000056566667,0.00010704731,0.000037986953,0.00047899602,0.088016205,0.00029189957,0.9038758,0.00007392748,0.006843215],"study_design_scores_gemma":[0.00085910305,0.0003875118,0.00004268718,0.0002248715,0.000085338586,0.00006024826,0.000086263964,0.993951,0.0008261456,0.0025881976,0.00053286855,0.0003557606],"about_ca_topic_score_codex":0.000044275148,"about_ca_topic_score_gemma":0.00002014772,"teacher_disagreement_score":0.9059348,"about_ca_system_score_codex":0.00001806125,"about_ca_system_score_gemma":0.00014955441,"threshold_uncertainty_score":0.99989897},"labels":[],"label_agreement":null},{"id":"W2784637848","doi":"","title":"Monochromatic Connectivity in Monochromatic-Star-Free Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Star (game theory); Combinatorics; Physics; Mathematical analysis; Optics","score_opus":0.017513092888051526,"score_gpt":0.27416907273808583,"score_spread":0.2566559798500343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784637848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87097925,0.0002629801,0.12196522,0.00054391613,0.005404424,0.00037811775,0.0000018530823,0.00007323643,0.00039098525],"genre_scores_gemma":[0.9647957,0.000051203057,0.034809705,0.000018917299,0.00028030042,0.0000047993967,1.3062258e-7,0.00003395417,0.0000052754626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591714,0.00040367764,0.0015328589,0.00041044515,0.0010695822,0.0006663046],"domain_scores_gemma":[0.99376696,0.0032757078,0.0011641287,0.000930147,0.00053717074,0.00032587553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037877578,0.0003929374,0.0010577115,0.00067173195,0.00022821946,0.00028255652,0.0021081173,0.00018086086,0.000006968538],"category_scores_gemma":[0.0025362065,0.0002869516,0.00023238857,0.00094208,0.00020844031,0.0010815922,0.0010275522,0.00051796134,0.0000055650544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062355764,0.0005085401,0.00052250817,0.00013274458,0.00006752142,0.000088092034,0.0008938862,0.000009238435,0.0028908025,0.9898189,0.000071757924,0.0049337083],"study_design_scores_gemma":[0.0068400707,0.0007761672,0.0007688288,0.00075534923,0.000020331416,0.00015974822,0.00011805491,0.0070999395,0.001903763,0.9811457,0.000052329324,0.00035975297],"about_ca_topic_score_codex":0.00000795087,"about_ca_topic_score_gemma":0.0000014858456,"teacher_disagreement_score":0.09381645,"about_ca_system_score_codex":0.0002050848,"about_ca_system_score_gemma":0.00021843231,"threshold_uncertainty_score":0.9999583},"labels":[],"label_agreement":null},{"id":"W2788116683","doi":"","title":"Trees With Given Degree Sequence in S-Order","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Sequence (biology); Order (exchange); Combinatorics; Chemistry; Business","score_opus":0.032819757193961276,"score_gpt":0.29169857787915165,"score_spread":0.25887882068519036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788116683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5982004,0.00023026486,0.39483792,0.0010718458,0.004325912,0.00035384047,0.0000014154847,0.000065161876,0.0009132884],"genre_scores_gemma":[0.9594528,0.00003873912,0.040147975,0.000015995556,0.00030699468,0.0000023706116,9.8500635e-8,0.000023847,0.0000111492045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728507,0.00018707341,0.0008547124,0.00030952264,0.00087395747,0.00048965187],"domain_scores_gemma":[0.99648416,0.0012837906,0.0007158334,0.00043166097,0.00086312473,0.0002214043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019139724,0.00027395147,0.00064114307,0.00038759137,0.00015292074,0.00019864019,0.0011724657,0.000111229754,0.0000039221773],"category_scores_gemma":[0.0007542998,0.0001717896,0.000077976554,0.0010101342,0.0001913223,0.00079510204,0.0004128539,0.000404286,0.0000031942486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111852205,0.0002872247,0.0011588946,0.00004304927,0.000043068165,0.00013893096,0.00068719534,0.00002635915,0.0019279106,0.97735703,0.00002783379,0.018190624],"study_design_scores_gemma":[0.0064886976,0.0013599873,0.00060043274,0.0008160954,0.000014664174,0.000282328,0.00010671737,0.0032248532,0.0013853526,0.9850978,0.00027785642,0.00034521273],"about_ca_topic_score_codex":0.0000053029007,"about_ca_topic_score_gemma":0.0000022826089,"teacher_disagreement_score":0.36125246,"about_ca_system_score_codex":0.00013225699,"about_ca_system_score_gemma":0.00027475628,"threshold_uncertainty_score":0.7005377},"labels":[],"label_agreement":null},{"id":"W2788975631","doi":"10.4230/lipics.swat.2018.27","title":"Reconfiguration of Colorable Sets in Classes of Perfect Graphs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Chordal graph; Interval graph; Indifference graph; Pathwidth; Combinatorics; Maximal independent set; Split graph; Mathematics; Discrete mathematics; Cograph; Treewidth; Longest path problem; Independent set; Clique-sum; Time complexity; 1-planar graph; Graph; Line graph","score_opus":0.08404564682421786,"score_gpt":0.23550534945761173,"score_spread":0.15145970263339387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788975631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91257733,0.000048916587,0.082201414,0.00002126165,0.00019677359,0.00033906466,0.000015037687,0.00004651421,0.0045536663],"genre_scores_gemma":[0.9977665,0.00018326679,0.0017639766,0.0000068688446,0.0000071981353,0.0000011008395,0.0000070134824,0.000009604742,0.00025449926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983082,0.0003280395,0.0002726409,0.00070136524,0.00011967025,0.000270102],"domain_scores_gemma":[0.99791586,0.00025456052,0.0003571416,0.0010327759,0.00036728446,0.000072379604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059427205,0.00018405783,0.00038113634,0.00075171416,0.000047503032,0.000021183529,0.0015260892,0.00021691647,0.000037590882],"category_scores_gemma":[0.0000978222,0.00021508378,0.00014807681,0.0012738924,0.0003255865,0.00041817373,0.0008830434,0.0003826938,0.000012942325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003165973,0.00029381472,0.028360369,0.0004417221,0.00010441694,0.00010290935,0.000595924,0.076594464,0.0028448622,0.88906425,0.00015435048,0.0011263298],"study_design_scores_gemma":[0.0008003543,0.00053470477,0.008445873,0.00034821944,0.000025043913,0.0000031638015,0.00014314681,0.19247049,0.023217069,0.7734927,0.00009282747,0.00042639775],"about_ca_topic_score_codex":0.000120193676,"about_ca_topic_score_gemma":0.0001342624,"teacher_disagreement_score":0.11587602,"about_ca_system_score_codex":0.000078868936,"about_ca_system_score_gemma":0.00025955227,"threshold_uncertainty_score":0.8770862},"labels":[],"label_agreement":null},{"id":"W2790020036","doi":"10.1007/978-3-319-94776-1_36","title":"Reconfiguring Spanning and Induced Subgraphs","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Control reconfiguration; Reachability; Induced subgraph isomorphism problem; Combinatorics; Subgraph isomorphism problem; Matching (statistics); Graph factorization; Independent set; Graph; Mathematics; Induced subgraph; Clique; Computer science; Split graph; Distance-hereditary graph; Theoretical computer science; Discrete mathematics; Line graph; Graph power; Vertex (graph theory); Pathwidth; Voltage graph","score_opus":0.036604699689667876,"score_gpt":0.3142294430628079,"score_spread":0.27762474337314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790020036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23688939,0.00029165237,0.76019293,0.00048039918,0.0015647516,0.00033655297,0.0000012482087,0.0001864579,0.000056624314],"genre_scores_gemma":[0.6503358,0.000023717465,0.349106,0.00028208137,0.00021703777,0.000018567529,7.8899325e-7,0.000015331127,6.5248236e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949618,0.00020133561,0.0004528576,0.0023744162,0.00091252587,0.0010970524],"domain_scores_gemma":[0.99649566,0.00061221793,0.00022648634,0.0020599398,0.00031851322,0.00028717844],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024741841,0.00047536023,0.00048995577,0.0015325366,0.00041777003,0.0012390289,0.00491354,0.00030702248,0.0000057626257],"category_scores_gemma":[0.00042381033,0.00045408474,0.00008974568,0.0025544611,0.0011301006,0.0008233419,0.008288119,0.0016077799,0.000012085874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013871047,0.000050285966,0.0045885188,0.00012383061,0.00001668474,0.00009945791,0.0041654636,0.018990437,0.005117228,0.0028447758,0.00000437762,0.9639851],"study_design_scores_gemma":[0.00022931227,0.0001541416,0.0049797925,0.00043007793,0.0000026053644,0.000063819905,8.951946e-7,0.5424814,0.031552378,0.41946384,0.000016714457,0.0006249763],"about_ca_topic_score_codex":0.000058295624,"about_ca_topic_score_gemma":0.000041527688,"teacher_disagreement_score":0.9633601,"about_ca_system_score_codex":0.0001729936,"about_ca_system_score_gemma":0.00051451946,"threshold_uncertainty_score":0.99979776},"labels":[],"label_agreement":null},{"id":"W2791062024","doi":"","title":"Digraph Isomorpshism Using Subdigraph Equivalent Vertices And Degree Pair Association.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Association (psychology); Mathematics; Degree (music); Combinatorics; Psychology; Physics; Acoustics","score_opus":0.04405361338829382,"score_gpt":0.2994501956152897,"score_spread":0.25539658222699585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791062024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867205,0.00060697994,0.009191769,0.00054368144,0.0015003928,0.00023249883,0.0000033782699,0.000226792,0.0009740122],"genre_scores_gemma":[0.9932828,0.000041847143,0.0062907417,0.00015977793,0.000022523322,0.000011617317,0.0000010107959,0.000018072982,0.00017158632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773675,0.00023035519,0.00025798782,0.0005246284,0.00062766275,0.00062261336],"domain_scores_gemma":[0.9982091,0.00041890985,0.00016552652,0.0006621755,0.00033316138,0.00021113288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009065439,0.00019785615,0.00022574645,0.00025130244,0.0004567796,0.00024946564,0.0008883329,0.000110091416,0.000017189386],"category_scores_gemma":[0.00027809292,0.00019615956,0.00008064469,0.0009932793,0.00024726597,0.0009457228,0.0005222942,0.00022589783,0.00004301529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017959637,0.00009705011,0.08275793,0.000015329462,0.000068252586,0.000014555051,0.00062356086,0.0000020113769,0.0024865894,0.9099046,0.0007888028,0.0032233638],"study_design_scores_gemma":[0.000935315,0.0003012672,0.025310278,0.000037442805,0.000017915692,0.000011723467,0.000049844028,0.0061660414,0.0050634616,0.95968467,0.002074893,0.00034714513],"about_ca_topic_score_codex":0.00004134543,"about_ca_topic_score_gemma":0.000012185449,"teacher_disagreement_score":0.057447646,"about_ca_system_score_codex":0.0001423717,"about_ca_system_score_gemma":0.00006833998,"threshold_uncertainty_score":0.79991543},"labels":[],"label_agreement":null},{"id":"W2791423452","doi":"","title":"On the Linear 2-Arboricity of Planar Graphs without Intersecting 3-Cycles or Intersecting 4-Cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Planar; Planar graph; Combinatorics; Graph; Computer science","score_opus":0.03236417449053471,"score_gpt":0.3100225160815461,"score_spread":0.2776583415910114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791423452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844921,0.000024274344,0.0106291585,0.00027904095,0.0017767343,0.00032133382,0.0000026544758,0.00018891355,0.0022857953],"genre_scores_gemma":[0.99649376,0.0000062405447,0.0031516943,0.00020233782,0.000029508312,0.000018020879,6.8037633e-7,0.00002951282,0.000068251466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753445,0.00037176535,0.00041879495,0.0005621797,0.00056137476,0.0005514219],"domain_scores_gemma":[0.9966896,0.0015294617,0.00027861362,0.001099492,0.00027889883,0.00012390039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013538211,0.00025849775,0.00031857347,0.000286986,0.00042976032,0.00008789346,0.0019763617,0.00009120699,0.000032740292],"category_scores_gemma":[0.0010925861,0.00017474382,0.00013261112,0.0012062686,0.000492265,0.00038255032,0.0005237911,0.0005689441,0.000049653194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019537211,0.00012234438,0.0040327897,0.000020072368,0.00006340172,0.000014395963,0.0028399029,0.000008007198,0.0017688179,0.98798853,0.00024410288,0.0027022513],"study_design_scores_gemma":[0.00078261114,0.0010681781,0.0013382635,0.00023126576,0.000009610876,0.000019844496,0.0012037064,0.006961982,0.036312617,0.9516498,0.00010942772,0.00031271524],"about_ca_topic_score_codex":0.00008484783,"about_ca_topic_score_gemma":0.000053194482,"teacher_disagreement_score":0.036338765,"about_ca_system_score_codex":0.00008400404,"about_ca_system_score_gemma":0.000074974676,"threshold_uncertainty_score":0.7125846},"labels":[],"label_agreement":null},{"id":"W2792181057","doi":"10.37236/8278","title":"Split Graphs: Combinatorial Species and Asymptotics","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Combinatorics; Split graph; Mathematics; Chordal graph; Conjecture; Clique-sum; Indifference graph; Clique; Graph; Cograph; 1-planar graph; Pathwidth; Discrete mathematics; Block graph; Line graph","score_opus":0.013820382609624227,"score_gpt":0.26091308678651526,"score_spread":0.24709270417689103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792181057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3523484,0.04372682,0.57205516,0.005252424,0.020439535,0.0016238054,0.000011329232,0.0001801256,0.0043624104],"genre_scores_gemma":[0.9923949,0.0065037315,0.0002347421,0.000066917266,0.00023577684,0.0000051071247,0.0000013783925,0.00004299994,0.0005144447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956005,0.0005878413,0.0008230014,0.00044971338,0.001431361,0.0011075507],"domain_scores_gemma":[0.9954225,0.0009227123,0.001140306,0.0014843121,0.0008349979,0.00019517209],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003595712,0.00045956904,0.00083492865,0.00046871908,0.00023859869,0.00044233835,0.0047461195,0.0003112619,0.0000056412127],"category_scores_gemma":[0.00029781536,0.00033437173,0.0003555791,0.00074959244,0.0003251074,0.000409601,0.0025622023,0.0046193684,0.000010787156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008106357,0.00011433369,0.00037035585,0.00006526703,0.00022790885,0.000015113244,0.00031588215,0.0002831689,0.000037669983,0.99763656,0.00036279362,0.0004899114],"study_design_scores_gemma":[0.0011662504,0.0009660709,0.00046841096,0.00010295821,0.00006477275,0.00021756257,0.000058050304,0.0012026436,0.00034187568,0.99064744,0.004429709,0.00033427117],"about_ca_topic_score_codex":0.0000032728292,"about_ca_topic_score_gemma":0.000001050973,"teacher_disagreement_score":0.64004654,"about_ca_system_score_codex":0.00054516795,"about_ca_system_score_gemma":0.0015892895,"threshold_uncertainty_score":0.99991083},"labels":[],"label_agreement":null},{"id":"W2792621676","doi":"","title":"Formulas for various domination numbers of products of paths and cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.014255761740252596,"score_gpt":0.28473081464186345,"score_spread":0.27047505290161084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792621676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9694037,0.00009150315,0.028277284,0.00020630834,0.0006675789,0.00055896275,0.0000047927524,0.00003713259,0.0007527274],"genre_scores_gemma":[0.9814192,0.000008168551,0.018469036,0.0000107646165,0.000006437558,0.000018271061,0.0000012025918,0.000008241407,0.00005868405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990991,0.00004340124,0.00019826544,0.00025246502,0.0002153092,0.00019151095],"domain_scores_gemma":[0.9986929,0.00019934724,0.00013462918,0.0004232227,0.0005038288,0.000046061523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208005,0.00008035426,0.00016164876,0.00010722255,0.00006864345,0.000015721602,0.00040280537,0.00004231426,0.0000014343942],"category_scores_gemma":[0.0003048282,0.00007724014,0.000029882767,0.00038903308,0.000226324,0.0003349732,0.00016953849,0.00005103118,0.0000018463221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003785492,0.00007241214,0.0005220299,0.00006490492,0.00001264726,5.110053e-7,0.0007935249,0.0000010674531,0.008362094,0.9786941,0.00011901355,0.011319879],"study_design_scores_gemma":[0.0008507859,0.00041346104,0.0015306899,0.000019174628,0.000004146989,0.0000029406433,0.000020596946,0.0017176952,0.13476977,0.8603334,0.000259573,0.00007775828],"about_ca_topic_score_codex":0.000010643113,"about_ca_topic_score_gemma":0.0000029191758,"teacher_disagreement_score":0.12640767,"about_ca_system_score_codex":0.000020151168,"about_ca_system_score_gemma":0.000056346853,"threshold_uncertainty_score":0.31497613},"labels":[],"label_agreement":null},{"id":"W2792869388","doi":"10.1007/978-3-319-61199-0","title":"Profinite Graphs and Groups","year":2017,"lang":"de","type":"book","venue":"Ergebnisse der Mathematik und ihrer Grenzgebiete","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Profinite group; Mathematics; Sociology; Computer science; Group (periodic table); Physics","score_opus":0.037553492994821566,"score_gpt":0.3150043441704566,"score_spread":0.277450851175635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792869388","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012097179,0.21379595,0.22533421,0.008729017,0.019047199,0.02600967,0.0015011302,0.0052914997,0.48819414],"genre_scores_gemma":[0.018057628,0.01614155,0.09882343,0.0013437538,0.0021428252,0.0018257294,0.00054980937,0.0016182372,0.859497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9885528,0.0006582843,0.0018903608,0.0037261106,0.0024538864,0.002718554],"domain_scores_gemma":[0.98758227,0.001282192,0.0020817986,0.0068716006,0.00081963174,0.001362535],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.002656485,0.002409555,0.0025985115,0.0015203247,0.0025803414,0.0028061764,0.0064494764,0.0013810925,0.0004520104],"category_scores_gemma":[0.0006792803,0.0022781973,0.0007997695,0.0007304963,0.002731454,0.0024316674,0.003992431,0.002926655,0.0039360956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016411507,0.000384787,0.00014800731,0.0024602108,0.0016943959,0.0007751968,0.0033390292,0.0000034019567,0.00031846212,0.94827485,0.02292983,0.019507697],"study_design_scores_gemma":[0.0018207129,0.00053727155,0.00023788743,0.002072857,0.00051688694,0.00026175953,0.000052152853,0.0030766563,0.00038292882,0.8649595,0.123548776,0.00253263],"about_ca_topic_score_codex":0.000016438911,"about_ca_topic_score_gemma":0.000028840677,"teacher_disagreement_score":0.3713029,"about_ca_system_score_codex":0.0002483433,"about_ca_system_score_gemma":0.00093373697,"threshold_uncertainty_score":0.99998254},"labels":[],"label_agreement":null},{"id":"W2793430794","doi":"10.1007/s13398-018-0503-2","title":"The optimal t-pebbling number of a certain complete m-ary tree","year":2018,"lang":"es","type":"article","venue":"Revista de la Real Academia de Ciencias Exactas Físicas y Naturales Serie A Matemáticas","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Tree (set theory); Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02170637069724794,"score_gpt":0.34333904925236497,"score_spread":0.321632678555117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793430794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96073,0.0063219974,0.0112560745,0.0034963712,0.00028353126,0.0013788,0.00017530507,0.00042305503,0.015934851],"genre_scores_gemma":[0.9710643,0.006035773,0.020952687,0.00050850713,0.00064799946,0.000070502036,0.000014474373,0.0001242601,0.0005814541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98923725,0.0030348906,0.0016619839,0.0015196473,0.0017559935,0.0027902178],"domain_scores_gemma":[0.98825103,0.006674492,0.0010584439,0.0020419604,0.0008760449,0.0010980476],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["sts","research_integrity"],"category_scores_codex":[0.0070645944,0.000934907,0.0012163197,0.00035478018,0.0014807583,0.0016726434,0.0054791262,0.0014165347,0.00012821899],"category_scores_gemma":[0.0033701244,0.0007250995,0.0005789242,0.00319565,0.0054658824,0.0013441336,0.0020755173,0.0042821015,0.00022221086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008611695,0.00017753741,0.0062468317,0.0006267912,0.0002703389,0.00039097652,0.0024903778,0.000046558507,0.03808969,0.91573685,0.0015100494,0.033552807],"study_design_scores_gemma":[0.0057020327,0.0027762796,0.08277174,0.006300465,0.0010315356,0.010180854,0.0035554708,0.23430316,0.043775056,0.10857455,0.4944331,0.006595756],"about_ca_topic_score_codex":0.00011619895,"about_ca_topic_score_gemma":0.000007721248,"teacher_disagreement_score":0.80716234,"about_ca_system_score_codex":0.0009013147,"about_ca_system_score_gemma":0.0013539417,"threshold_uncertainty_score":0.9999017},"labels":[],"label_agreement":null},{"id":"W2793769875","doi":"","title":"Disjoint cycles in directed graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics","score_opus":0.01647823941276952,"score_gpt":0.28604266281789886,"score_spread":0.2695644234051293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793769875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887934,0.00012824683,0.0019908666,0.0004386487,0.0014325095,0.000223388,0.0000011658008,0.0004582358,0.006533548],"genre_scores_gemma":[0.99590075,0.00001485579,0.003847106,0.00008082802,0.000006530835,0.000024476647,0.0000010691609,0.000013190106,0.000111211986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840057,0.0001676836,0.0002089418,0.0004329897,0.00032329612,0.00046649814],"domain_scores_gemma":[0.99876636,0.00016136534,0.000049501174,0.0007726273,0.00012768355,0.00012245045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000447011,0.00013746157,0.00017155889,0.00029874223,0.00012482284,0.00008086788,0.001106285,0.000058011305,0.000023156823],"category_scores_gemma":[0.00015672392,0.00013132868,0.000052817883,0.0015124112,0.00023624614,0.00046797554,0.00042047602,0.00020535002,0.00017231781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112527505,0.00009099683,0.008320535,0.00000339613,0.000006116514,0.000021336797,0.000330382,0.0000010723793,0.00086614763,0.9844443,0.00036137103,0.0055430527],"study_design_scores_gemma":[0.00050252205,0.00012095464,0.037962522,0.000019307596,8.1927334e-7,0.0000042454926,0.0000142207655,0.0018931304,0.0053395755,0.9534049,0.00057686877,0.00016090757],"about_ca_topic_score_codex":0.000033743647,"about_ca_topic_score_gemma":0.00003537538,"teacher_disagreement_score":0.031039417,"about_ca_system_score_codex":0.000055858665,"about_ca_system_score_gemma":0.000043289296,"threshold_uncertainty_score":0.5355428},"labels":[],"label_agreement":null},{"id":"W2793906705","doi":"","title":"On the total signed domination number of P m [square] C n .","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Combinatorics; Geometry","score_opus":0.014231687359934055,"score_gpt":0.2905970341272533,"score_spread":0.2763653467673192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793906705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97275877,0.000009717917,0.010784536,0.0007349589,0.0010461626,0.00023764266,0.0000013013897,0.0000689996,0.0143579235],"genre_scores_gemma":[0.99864036,9.1106233e-7,0.0009361408,0.00007297278,0.000009379935,0.00001727878,5.486605e-7,0.000008487214,0.00031394942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987627,0.00019170712,0.00015708168,0.00023595334,0.00042627988,0.00022625111],"domain_scores_gemma":[0.9982273,0.00067970174,0.0000826709,0.00071239576,0.0002482334,0.000049716316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006136386,0.00009539937,0.00011000217,0.000060962946,0.0001591007,0.000043296,0.0008224629,0.00004371487,0.00010947952],"category_scores_gemma":[0.00028597366,0.000068617046,0.000054103635,0.0005921702,0.00022662907,0.00024977475,0.00021594891,0.00012474695,0.00032377223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023893248,0.00006933857,0.00010229375,0.0000028554612,0.0000111943655,0.000001571809,0.00032870928,0.0000025444108,0.0018747022,0.9949461,0.00076209597,0.001874696],"study_design_scores_gemma":[0.00036669444,0.00025347804,0.0009206315,0.000014055375,0.000001562325,0.000004225852,0.000023636245,0.0018605475,0.027929286,0.96846324,0.000080683414,0.00008193698],"about_ca_topic_score_codex":0.0000053294343,"about_ca_topic_score_gemma":5.045191e-7,"teacher_disagreement_score":0.026482841,"about_ca_system_score_codex":0.000034982113,"about_ca_system_score_gemma":0.000036184618,"threshold_uncertainty_score":0.4161545},"labels":[],"label_agreement":null},{"id":"W2794063315","doi":"10.1016/j.ejc.2017.12.001","title":"The monotonicity property of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml4\" display=\"inline\" overflow=\"scroll\" altimg=\"si4.gif\"><mml:mi>M</mml:mi></mml:math>-partition problems","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Partition (number theory); Monotonic function; Scroll; Mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Theology; Philosophy","score_opus":0.02150163503203327,"score_gpt":0.25267805859292525,"score_spread":0.23117642356089196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794063315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9697744,0.00037195242,0.024222162,0.00045750578,0.001151552,0.000088828056,0.00000799045,0.00006172343,0.0038638555],"genre_scores_gemma":[0.9967764,0.00034103592,0.002208143,0.00014193874,0.0002881792,0.0000123561695,0.000003882062,0.0000741952,0.00015386373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964337,0.00055272086,0.00088534167,0.00037476554,0.0011547359,0.0005987673],"domain_scores_gemma":[0.9968169,0.0003662469,0.0010745511,0.0009793215,0.0004895211,0.00027348578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032833098,0.0002533804,0.00022790606,0.00013862342,0.00066334876,0.00034970063,0.0019722509,0.00010074013,0.000008219853],"category_scores_gemma":[0.00059537764,0.00019757326,0.0003050173,0.000613657,0.0005456402,0.00090279704,0.000833125,0.0007643919,0.0002590737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018909447,0.00021445863,0.000036433103,0.000070960166,0.000100769554,0.00018388956,0.0006170779,0.00048983184,0.0016803923,0.9933831,0.00060427055,0.0024297042],"study_design_scores_gemma":[0.0019751482,0.004404732,0.00059525,0.00058400864,0.00009878419,0.00070341,0.00019843107,0.9066075,0.028061574,0.032091066,0.024154115,0.00052595383],"about_ca_topic_score_codex":0.000008710096,"about_ca_topic_score_gemma":0.00000668811,"teacher_disagreement_score":0.961292,"about_ca_system_score_codex":0.000032727577,"about_ca_system_score_gemma":0.00030670635,"threshold_uncertainty_score":0.80568033},"labels":[],"label_agreement":null},{"id":"W2794432627","doi":"","title":"Maximal independent sets in complementary prism graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prism; Combinatorics; Discrete mathematics; Optics; Physics","score_opus":0.022734535536246138,"score_gpt":0.30125144275730725,"score_spread":0.2785169072210611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794432627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98895556,0.000090753616,0.003938386,0.0006798403,0.0017628794,0.00040840768,0.0000027738524,0.00017372821,0.003987688],"genre_scores_gemma":[0.9926259,0.000008872513,0.006972715,0.0002731152,0.0000068363124,0.000029895247,0.0000047936282,0.000015841122,0.0000620102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773353,0.00020017974,0.0002992671,0.00055106456,0.00058649486,0.00062944676],"domain_scores_gemma":[0.9987096,0.00011587036,0.000073124764,0.0008505622,0.00009113242,0.00015966374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000755932,0.00017974529,0.00019996944,0.00036248253,0.00017010483,0.00009172465,0.0016091992,0.0000686061,0.000069666115],"category_scores_gemma":[0.000037095822,0.00018538127,0.00005962722,0.0010249306,0.00021217231,0.0005955068,0.0008579411,0.00033764055,0.00020786795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024181769,0.00015581427,0.019550912,0.000005052367,0.0000139127,0.000070319635,0.0005245148,9.31312e-7,0.00037573805,0.9701422,0.0008938581,0.008242585],"study_design_scores_gemma":[0.001203153,0.0002730794,0.035545297,0.000016181493,0.0000014797844,0.000014567483,0.000038160633,0.0014107032,0.0022410532,0.95743454,0.001611394,0.00021041099],"about_ca_topic_score_codex":0.00006831335,"about_ca_topic_score_gemma":0.000048508275,"teacher_disagreement_score":0.015994385,"about_ca_system_score_codex":0.00011088414,"about_ca_system_score_gemma":0.00006896944,"threshold_uncertainty_score":0.75596285},"labels":[],"label_agreement":null},{"id":"W2794722099","doi":"10.37236/8594","title":"On Essentially 4-Edge-Connected Cubic Bricks","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal de Mato Grosso do Sul; Universidade Estadual de Campinas; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Fundação de Amparo à Pesquisa do Estado de São Paulo; Universität Wien; Massey University","keywords":"Combinatorics; Bipartite graph; Mathematics; Cubic graph; Conjecture; Invariant (physics); Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01661771185908935,"score_gpt":0.2803089121190195,"score_spread":0.26369120025993015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794722099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039454132,0.005388606,0.9416559,0.00857524,0.0028720717,0.00048464484,0.0000024622873,0.00013644695,0.0014305145],"genre_scores_gemma":[0.99777186,0.0011771125,0.00018770825,0.0003161552,0.00025571298,0.000008830219,0.0000020195164,0.000051927054,0.00022866052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99514675,0.00084073324,0.0008249806,0.0005148007,0.0015530715,0.0011196866],"domain_scores_gemma":[0.9951733,0.0010758819,0.0012160158,0.0014365352,0.0008370608,0.00026121514],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022797764,0.00045060387,0.0007433481,0.00040436248,0.00024718387,0.0003214696,0.0072763376,0.00024830966,0.000015470532],"category_scores_gemma":[0.0007715442,0.0003306718,0.0005039959,0.0012746903,0.0001478429,0.0002661161,0.0018513794,0.006398019,0.00004815698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012918012,0.00016845182,0.0000062274357,0.00003635415,0.00027370863,0.00009540613,0.0003192153,0.0010955404,0.00049206475,0.9949157,0.001060706,0.0014074459],"study_design_scores_gemma":[0.0008091451,0.0011072762,0.000046208366,0.00010630559,0.000055406737,0.00017582267,0.00001794428,0.0027204524,0.003586377,0.9895763,0.0014846142,0.00031416325],"about_ca_topic_score_codex":0.0000037988473,"about_ca_topic_score_gemma":0.0000018462408,"teacher_disagreement_score":0.95831776,"about_ca_system_score_codex":0.000740271,"about_ca_system_score_gemma":0.002665348,"threshold_uncertainty_score":0.9999145},"labels":[],"label_agreement":null},{"id":"W2794856912","doi":"10.3390/a11040040","title":"Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Multipartite; Bipartite graph; Discrete mathematics; Graph; Physics","score_opus":0.03247363405629961,"score_gpt":0.2995775671209701,"score_spread":0.2671039330646705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794856912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94486517,0.00035936967,0.05413264,0.00009015412,0.00009644044,0.00021516587,0.000024258166,0.000044330172,0.00017248842],"genre_scores_gemma":[0.96486336,0.00008164926,0.03497304,0.000032713808,0.000014216226,0.000009686142,6.399271e-7,0.000009049293,0.000015670294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99840707,0.00017532808,0.00030871786,0.00044778016,0.00029604393,0.0003650358],"domain_scores_gemma":[0.9984342,0.00050560455,0.00015160604,0.00050443545,0.00023842526,0.00016573958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007169692,0.00014889977,0.00036001348,0.00020597746,0.00015334431,0.000030593597,0.00041142886,0.0000654412,0.0000055243586],"category_scores_gemma":[0.00014164897,0.00013941877,0.000059182377,0.0006074791,0.0014414464,0.000337467,0.0005412316,0.0001624267,0.0000019045177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025980498,0.00048439912,0.14163703,0.00026277156,0.00030305647,0.000049409166,0.0033078757,0.000060968956,0.18857889,0.579943,0.00006786674,0.08504491],"study_design_scores_gemma":[0.0031724144,0.0020841437,0.43161222,0.00017759507,0.000038967613,0.00012983065,0.00011675028,0.19358899,0.14428884,0.22326235,0.00081192696,0.0007159796],"about_ca_topic_score_codex":0.00024388458,"about_ca_topic_score_gemma":0.00017307924,"teacher_disagreement_score":0.35668066,"about_ca_system_score_codex":0.000012219934,"about_ca_system_score_gemma":0.000049160004,"threshold_uncertainty_score":0.56853324},"labels":[],"label_agreement":null},{"id":"W2795132552","doi":"10.23638/dmtcs-21-3-23","title":"On the multipacking number of grid graphs","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Agence Nationale de la Recherche; Thompson Rivers University","keywords":"Mathematics; Grid; Combinatorics; Computer science; Geometry","score_opus":0.017292022634676753,"score_gpt":0.30150910850861823,"score_spread":0.28421708587394146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795132552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18627949,0.000006478893,0.79796976,0.0005920867,0.00041530226,0.00046302224,0.0000039108604,0.000100621575,0.014169319],"genre_scores_gemma":[0.82702005,0.0000023501575,0.1726542,0.00025080022,0.00002424925,0.000012129806,4.3427096e-7,0.00001537985,0.000020423906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962489,0.00018581534,0.00046408334,0.0007347002,0.0016197189,0.00074676506],"domain_scores_gemma":[0.99461454,0.0025085304,0.00019318676,0.0021916216,0.00028898104,0.0002031228],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030298997,0.00027071632,0.00035502118,0.00020697954,0.00034175877,0.00033823165,0.0050291717,0.000055714376,0.00023742893],"category_scores_gemma":[0.00039921212,0.00016178774,0.00018306488,0.0018714899,0.0033759044,0.0005377191,0.0016660484,0.0003912169,0.000423106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074028303,0.00007851334,0.000121531295,0.000031397052,0.000009312275,0.0000031802153,0.001056036,0.00014512708,0.0009214232,0.9965286,0.000023059429,0.0010744195],"study_design_scores_gemma":[0.00013088583,0.000086643384,0.000067270325,0.00009078483,0.000002573482,0.000016539121,0.000047699366,0.3316335,0.0037920782,0.6639657,0.000010911392,0.00015543717],"about_ca_topic_score_codex":9.658532e-7,"about_ca_topic_score_gemma":1.1799797e-7,"teacher_disagreement_score":0.6407406,"about_ca_system_score_codex":0.0000326517,"about_ca_system_score_gemma":0.00007920165,"threshold_uncertainty_score":0.99933636},"labels":[],"label_agreement":null},{"id":"W2795132661","doi":"10.1016/j.disc.2018.03.006","title":"Recolouring reflexive digraphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Homomorphism; Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Loop (graph theory); Path (computing); Computer science","score_opus":0.035949377190824854,"score_gpt":0.3399009822795958,"score_spread":0.30395160508877095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795132661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03031575,0.00003977412,0.9102793,0.00037163027,0.00020330606,0.00023444078,0.0000028709376,0.00033000248,0.058222946],"genre_scores_gemma":[0.5376842,0.000012959609,0.46054655,0.00013105376,0.000121438374,0.000028738896,0.0000013299192,0.000026190039,0.0014475615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862695,0.000053038428,0.00024436048,0.00031561186,0.00034313163,0.00041692407],"domain_scores_gemma":[0.99849963,0.00019265468,0.00010016241,0.00095343764,0.00013266866,0.000121462486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049544964,0.0001437899,0.00017167826,0.00014787143,0.00022025759,0.00014699886,0.0011705229,0.000049433766,0.00005311272],"category_scores_gemma":[0.0001894976,0.00011852797,0.000081320715,0.0005856376,0.00023046622,0.0004110744,0.0004534619,0.0001468089,0.0004165333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049910964,0.000040336414,0.0000763516,0.000036550624,0.000022168224,0.00001192129,0.003011695,0.0000033588465,0.0010584433,0.9895857,0.00032581505,0.005822681],"study_design_scores_gemma":[0.00018791956,0.00018651661,0.0001305241,0.000063412284,0.0000049618534,0.000022066748,0.00025069338,0.019886402,0.01230513,0.96432996,0.0023788856,0.00025350734],"about_ca_topic_score_codex":0.0000012319656,"about_ca_topic_score_gemma":0.0000046879663,"teacher_disagreement_score":0.50736845,"about_ca_system_score_codex":0.000029037252,"about_ca_system_score_gemma":0.000026828353,"threshold_uncertainty_score":0.53538316},"labels":[],"label_agreement":null},{"id":"W2795353754","doi":"10.1007/978-3-319-89441-6_7","title":"Approximating Domination on Intersection Graphs of Paths on a Grid","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Graph; String (physics); Approximation algorithm; Mathematics; Physics; Discrete mathematics","score_opus":0.020236276699641596,"score_gpt":0.2799436579717326,"score_spread":0.259707381272091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795353754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016586262,0.0000330774,0.99067795,0.00013939536,0.0018029639,0.0004848492,0.0000054988536,0.00010896294,0.0050886488],"genre_scores_gemma":[0.64398086,0.000019782203,0.3544195,0.0006800082,0.0005763855,0.000028520759,0.000007553729,0.00005867074,0.00022874156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602115,0.0000879431,0.0005753653,0.0014059884,0.0013742126,0.0005353543],"domain_scores_gemma":[0.9967418,0.00085500476,0.0004905248,0.0013889296,0.00040930972,0.00011446409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016928696,0.00043328895,0.00046034253,0.00203254,0.00022753036,0.00019773409,0.002592173,0.00024277455,0.000022403026],"category_scores_gemma":[0.0003142469,0.00038232768,0.00015901162,0.0010327399,0.0010334265,0.0005118481,0.00079390424,0.00085397897,0.000043853033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000652304,0.00008167309,0.000014364513,0.000074259835,0.000013971315,0.000025920574,0.0018894617,0.010893755,0.0010499309,0.22964495,0.00002066289,0.7562258],"study_design_scores_gemma":[0.00031173596,0.0013664984,0.00004906245,0.00094067137,0.0000033645097,0.000023376952,7.835371e-7,0.24800664,0.017260684,0.7314882,0.000119233475,0.00042974734],"about_ca_topic_score_codex":0.0000052439286,"about_ca_topic_score_gemma":0.00001477255,"teacher_disagreement_score":0.7557961,"about_ca_system_score_codex":0.0003210986,"about_ca_system_score_gemma":0.00018556113,"threshold_uncertainty_score":0.99986285},"labels":[],"label_agreement":null},{"id":"W2797568317","doi":"10.1137/18m1182255","title":"On a Generalization of Spikes","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Marsden Fund; National Science Foundation","keywords":"Matroid; Partition (number theory); Generalization; Matroid partitioning; Graphic matroid; Integer (computer science); Property (philosophy)","score_opus":0.018602800630308204,"score_gpt":0.30100844786668834,"score_spread":0.2824056472363801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797568317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21925433,0.000048594156,0.768728,0.0003464801,0.00025654622,0.00021768804,0.0000025549482,0.000037908845,0.01110788],"genre_scores_gemma":[0.91288304,0.00004701086,0.08567728,0.00016350874,0.000047403028,0.000003114667,9.471157e-7,0.000023964027,0.0011537011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851596,0.000086863234,0.00035389312,0.00015880997,0.0006563484,0.00022810642],"domain_scores_gemma":[0.9987102,0.00023669034,0.00029222155,0.00054345554,0.000120052704,0.000097340686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005807711,0.0001262087,0.00021804047,0.00023496106,0.00006760468,0.0000968851,0.00076087913,0.00004105536,0.000089735426],"category_scores_gemma":[0.00015402865,0.00009030736,0.00011157788,0.00033532066,0.000038775972,0.0002693762,0.00009473449,0.00023960184,0.0001671296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016280934,0.000090001035,0.00006520582,0.000055937322,0.000014323105,0.000008547629,0.0005089859,0.0036385763,0.0030869597,0.99122506,0.00015202543,0.0011380751],"study_design_scores_gemma":[0.00057107414,0.00092564104,0.00011097426,0.00035466146,0.000005416764,0.00008070588,0.000103340455,0.06601712,0.013809224,0.9175033,0.00032173327,0.00019682852],"about_ca_topic_score_codex":1.9646876e-7,"about_ca_topic_score_gemma":1.5490309e-7,"teacher_disagreement_score":0.6936287,"about_ca_system_score_codex":0.00003773346,"about_ca_system_score_gemma":0.000038877286,"threshold_uncertainty_score":0.36826274},"labels":[],"label_agreement":null},{"id":"W280278083","doi":"10.1090/stml/061","title":"The Game of Cops and Robbers on Graphs","year":2011,"lang":"en","type":"book","venue":"Student mathematical library","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":332,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Business","score_opus":0.019958407136896214,"score_gpt":0.2728467777638407,"score_spread":0.25288837062694447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W280278083","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019305754,0.001109355,0.0057156286,0.00035588126,0.00013849176,0.000731318,0.000013563091,0.00016694248,0.9915758],"genre_scores_gemma":[0.003327664,0.0011825528,0.0150207635,0.00035769318,0.0000851354,0.00010425718,0.000009656468,0.0001254284,0.9797869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978526,0.0001297689,0.0004386373,0.00044750594,0.0007720537,0.00035938283],"domain_scores_gemma":[0.9968669,0.0015821323,0.00019758737,0.0011552088,0.000029444376,0.00016873446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035586677,0.00029052218,0.00044151556,0.00016793385,0.000092693255,0.00016199442,0.002370938,0.00014420098,0.00008478415],"category_scores_gemma":[0.000051726398,0.00017947708,0.00016175825,0.0001696532,0.0006792146,0.0003708002,0.0016034564,0.00050098775,0.00012702345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018398134,0.00008291039,0.000011890928,0.00010747671,0.00007708846,0.000017008006,0.00046047944,3.345535e-7,0.0000020277173,0.9894595,0.00711495,0.0026479394],"study_design_scores_gemma":[0.00015213327,0.00023715787,0.000061656916,0.00026267368,0.0000119631595,0.0000076639235,0.000022513454,0.000062570914,0.00007684774,0.98454446,0.014377707,0.000182627],"about_ca_topic_score_codex":8.877063e-8,"about_ca_topic_score_gemma":9.176897e-8,"teacher_disagreement_score":0.011788913,"about_ca_system_score_codex":0.000013773145,"about_ca_system_score_gemma":0.000116445146,"threshold_uncertainty_score":0.7318863},"labels":[],"label_agreement":null},{"id":"W2802999861","doi":"10.1016/j.jctb.2019.08.007","title":"Matroid fragility and relaxations of circuit hyperplanes","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Conjecture; Hyperplane; Combinatorics; Bounded function; Mathematics; Function (biology); Discrete mathematics; Mathematical analysis","score_opus":0.01814264768711815,"score_gpt":0.27175819323546824,"score_spread":0.2536155455483501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802999861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6677359,0.0062691187,0.28765425,0.0008347291,0.028707992,0.001106659,0.00008974235,0.0001193926,0.007482228],"genre_scores_gemma":[0.99560326,0.00037821414,0.003431307,0.000019723018,0.00031145467,0.0000047680514,0.0000025498716,0.00002203775,0.00022668026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969293,0.0008099156,0.00089904765,0.00033312372,0.00075251004,0.00027613214],"domain_scores_gemma":[0.9954667,0.0010495363,0.0014402797,0.0010133919,0.0008705788,0.00015950396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031417827,0.00027214614,0.00082473765,0.00037221113,0.00010834301,0.00014518148,0.0018438991,0.000284357,0.00003278412],"category_scores_gemma":[0.0009403338,0.000239374,0.00025377344,0.00026714196,0.00041259412,0.0008177759,0.0013528757,0.0012471306,0.0000041880403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039758417,0.00009779742,0.0006864232,0.0001993034,0.00013840444,0.000021907834,0.0007416533,0.00026395003,0.0006022531,0.99520326,0.000075404634,0.0015720517],"study_design_scores_gemma":[0.00065888994,0.00048466818,0.0008874663,0.00016075303,0.00003308879,0.0001703383,0.00013867425,0.000052557767,0.0017451422,0.99398893,0.0014757898,0.0002036741],"about_ca_topic_score_codex":0.0000033453841,"about_ca_topic_score_gemma":3.5388396e-7,"teacher_disagreement_score":0.32786736,"about_ca_system_score_codex":0.000078231526,"about_ca_system_score_gemma":0.0004233065,"threshold_uncertainty_score":0.9761389},"labels":[],"label_agreement":null},{"id":"W2804339795","doi":"10.1002/jgt.20457","title":"Acyclic dominating partitions","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Partition (number theory); Bipartite graph; Mathematics; Graph; Upper and lower bounds; Vertex (graph theory); Conjecture; Mathematical analysis","score_opus":0.016758006590472153,"score_gpt":0.3044405940250349,"score_spread":0.28768258743456276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804339795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07289734,0.00090626173,0.91566783,0.0018942324,0.0003229872,0.00008851901,9.305709e-7,0.00005656398,0.008165346],"genre_scores_gemma":[0.9684783,0.000074905794,0.030652002,0.00045173432,0.000110042136,0.0000012495399,1.3720211e-7,0.000006137747,0.00022548361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839777,0.00035334617,0.00040004257,0.00014068937,0.00040900163,0.00029915862],"domain_scores_gemma":[0.99843895,0.00047478377,0.0003077065,0.00037783894,0.00023535799,0.00016535378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023072737,0.00010661279,0.00019979298,0.0004998071,0.00015240944,0.00009386279,0.00111819,0.000041255833,0.000029476863],"category_scores_gemma":[0.00037026824,0.00008522075,0.00022552253,0.00076188985,0.00011291495,0.00095092715,0.00006743295,0.00038790953,0.000016200178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043448046,0.0000939371,0.00008053503,0.0000024150602,0.000021859894,0.00007456845,0.0003697732,0.00013261652,0.0059247487,0.8608562,0.00026665544,0.13213326],"study_design_scores_gemma":[0.00037578907,0.00031281263,0.0021352933,0.00004059002,0.0000071690874,0.00023302561,0.00008408974,0.00012852188,0.003668905,0.99193704,0.000978951,0.00009782099],"about_ca_topic_score_codex":9.804645e-8,"about_ca_topic_score_gemma":1.7285419e-7,"teacher_disagreement_score":0.89558095,"about_ca_system_score_codex":0.000027493881,"about_ca_system_score_gemma":0.00005291889,"threshold_uncertainty_score":0.34752014},"labels":[],"label_agreement":null},{"id":"W2804416848","doi":"10.1007/s00453-018-0456-z","title":"The Fast Search Number of a Complete k-Partite Graph","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Theory of computation; Mathematics; Fleischer; Discrete mathematics; Complete bipartite graph; Upper and lower bounds; Graph; Computer science; Algorithm","score_opus":0.02728497382287947,"score_gpt":0.32107480510330555,"score_spread":0.2937898312804261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804416848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03884322,0.000119751756,0.94612545,0.0018303576,0.00043189034,0.0003558302,0.00001884951,0.00015827239,0.012116359],"genre_scores_gemma":[0.9156116,0.00003420687,0.08287491,0.00015084329,0.00021310509,0.00002754009,0.0000018246773,0.00002117125,0.001064801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981752,0.00019687967,0.00023033336,0.0003305478,0.0005365158,0.0005305001],"domain_scores_gemma":[0.9980208,0.00041774093,0.000060796847,0.0010172223,0.00036450496,0.00011893539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007215883,0.00011582628,0.00014621248,0.000077528515,0.00041639668,0.00009469502,0.0017708233,0.000037819176,0.000049037546],"category_scores_gemma":[0.00005594918,0.000081739716,0.00008771933,0.0009624424,0.0009851881,0.00024681617,0.0006063263,0.00020370782,0.0005081758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004610487,0.000081473605,0.0010273543,0.000012227932,0.00007729384,0.000013287837,0.0009890439,0.00000871913,0.0047075697,0.71532834,0.001609947,0.27609867],"study_design_scores_gemma":[0.0014526554,0.0007612407,0.007351054,0.00007307724,0.00001393303,0.0001638193,0.0003294297,0.1132809,0.08411996,0.6969337,0.094751045,0.0007691902],"about_ca_topic_score_codex":0.000024346242,"about_ca_topic_score_gemma":0.000010065201,"teacher_disagreement_score":0.87676835,"about_ca_system_score_codex":0.000017454768,"about_ca_system_score_gemma":0.00005886531,"threshold_uncertainty_score":0.65317416},"labels":[],"label_agreement":null},{"id":"W2805891430","doi":"10.1016/j.dam.2018.04.022","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml16\" display=\"inline\" overflow=\"scroll\" altimg=\"si16.gif\"><mml:mi>k</mml:mi></mml:math>-broadcast domination and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml17\" display=\"inline\" overflow=\"scroll\" altimg=\"si16.gif\"><mml:mi>k</mml:mi></mml:math>-multipacking","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Johannesburg; National Research Foundation","keywords":"Mathematics; Vertex (graph theory); Graph; Algorithm; Discrete mathematics; Database; Combinatorics; Computer science","score_opus":0.01952157953672921,"score_gpt":0.2670571021251731,"score_spread":0.24753552258844388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805891430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93494797,0.0006934279,0.05369272,0.0004772132,0.0015958551,0.0005838045,0.0006002668,0.00092676544,0.006481985],"genre_scores_gemma":[0.93150514,0.000832884,0.061347473,0.001014436,0.0017660323,0.0014953751,0.00087741995,0.0008802452,0.0002809664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858026,0.00034054698,0.0030815084,0.0032806303,0.0039890874,0.0035056535],"domain_scores_gemma":[0.9879557,0.0024990004,0.002908169,0.0047930195,0.0004622311,0.0013818803],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0036962023,0.0020452575,0.0013249808,0.00081003946,0.0027946713,0.0024784328,0.004171164,0.0019672008,0.00013199565],"category_scores_gemma":[0.0015112562,0.0023937721,0.001394615,0.0018585307,0.0024927643,0.0029156876,0.0045247423,0.0024279638,0.003350054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009547799,0.0007216685,0.000009547642,0.0017591319,0.0008925638,0.0005305905,0.005978162,0.0014844129,0.010073037,0.9724701,0.0009317746,0.0041942233],"study_design_scores_gemma":[0.0031878592,0.0011001929,0.000043364398,0.0013183269,0.0006907051,0.0008415023,0.0024892394,0.9499254,0.021995964,0.012264389,0.0040545273,0.0020885095],"about_ca_topic_score_codex":0.00028938352,"about_ca_topic_score_gemma":0.00023386638,"teacher_disagreement_score":0.96020573,"about_ca_system_score_codex":0.0001298513,"about_ca_system_score_gemma":0.0009609576,"threshold_uncertainty_score":0.99987346},"labels":[],"label_agreement":null},{"id":"W2807719019","doi":"10.1007/s10878-020-00587-z","title":"Power domination on triangular grids with triangular and hexagonal shape","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Hexagonal crystal system; Mathematics; Graph; Theory of computation; Dominating set; Grid; Domination analysis; Hexagonal tiling; Geometry; Crystallography; Chemistry; Algorithm","score_opus":0.011670298745533731,"score_gpt":0.2498061933835625,"score_spread":0.23813589463802876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807719019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023944905,0.00019559574,0.97028863,0.0038214514,0.0010181048,0.00027737257,0.0000015546829,0.00003670095,0.00041567473],"genre_scores_gemma":[0.88501066,0.000076803226,0.1139968,0.0004033,0.00046436142,0.0000040125115,0.0000028558763,0.000025680782,0.000015508074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982193,0.00023439189,0.00038778194,0.00021829977,0.0007614751,0.00017874042],"domain_scores_gemma":[0.9984874,0.00019887155,0.00039355876,0.00016616003,0.0005276009,0.0002263983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070688856,0.0001459002,0.0002837739,0.00022648249,0.000107273336,0.00017442663,0.00043885142,0.00007739079,0.00004044228],"category_scores_gemma":[0.0004689249,0.00011524049,0.000070718495,0.0006727096,0.00006075038,0.0010093345,0.000071427035,0.00029205348,0.000002697162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0071947607,0.0005078438,0.00022577397,0.000042658005,0.00020952937,0.0002976761,0.002291505,0.28707615,0.0016567311,0.6870325,0.0010980141,0.012366858],"study_design_scores_gemma":[0.0385721,0.020485535,0.0006633428,0.00024121627,0.000095767675,0.00030436012,0.00025114318,0.84325856,0.008979079,0.08020723,0.005979901,0.00096174184],"about_ca_topic_score_codex":2.2976627e-7,"about_ca_topic_score_gemma":1.4577733e-8,"teacher_disagreement_score":0.86106575,"about_ca_system_score_codex":0.000059194575,"about_ca_system_score_gemma":0.00013566687,"threshold_uncertainty_score":0.4699371},"labels":[],"label_agreement":null},{"id":"W2808380895","doi":"","title":"Random subgraphs of finite graphs. Part III: The phase transition for the n-cube","year":2003,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft; Microsoft Research","keywords":"Combinatorics; Mathematics; Discrete mathematics; Computer science","score_opus":0.038815622396553735,"score_gpt":0.314292359575483,"score_spread":0.2754767371789293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808380895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3511581,0.0025466683,0.6226285,0.01357641,0.00022029069,0.0046980935,0.000179475,0.00037100707,0.0046214494],"genre_scores_gemma":[0.9957756,0.00060185906,0.0031422076,0.000018095117,0.000007980335,0.000014787422,0.0000059205245,0.000012687919,0.00042087425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737537,0.00035658773,0.00028525622,0.00046403712,0.0008164353,0.00070233544],"domain_scores_gemma":[0.99621457,0.0014717756,0.00018083553,0.0013215509,0.00071364007,0.000097626296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003709519,0.00016595612,0.00033610774,0.0009999535,0.00084126776,0.000025052419,0.002755667,0.00020275786,0.00007827324],"category_scores_gemma":[0.0005471305,0.00012334378,0.00031089457,0.0032486003,0.0025282507,0.0003416886,0.00030446815,0.0007440344,0.0000061324836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010823866,0.00061007106,0.00020284452,0.00007707367,0.00034594457,0.00010162991,0.0013524935,0.0003195023,0.006945896,0.95646155,0.002742129,0.029758453],"study_design_scores_gemma":[0.02492848,0.0037227944,0.00022726518,0.0002328859,0.00014849902,0.00009237314,0.018741366,0.01077319,0.12584588,0.70404047,0.11048959,0.00075721415],"about_ca_topic_score_codex":0.000073357856,"about_ca_topic_score_gemma":0.00008358009,"teacher_disagreement_score":0.6446175,"about_ca_system_score_codex":0.00003178089,"about_ca_system_score_gemma":0.0002333462,"threshold_uncertainty_score":0.9315445},"labels":[],"label_agreement":null},{"id":"W2808957893","doi":"10.1016/j.dam.2018.05.041","title":"Chronological rectangle digraphs which are two-terminal series–parallel","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rectangle; Generalization; Interval (graph theory); Mathematics; Class (philosophy); Combinatorics; Terminal (telecommunication); Series (stratigraphy); Characterization (materials science); Time complexity; Discrete mathematics; Polynomial; Computer science; Artificial intelligence","score_opus":0.02441270266182032,"score_gpt":0.2966772765144264,"score_spread":0.27226457385260605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808957893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040234238,0.000056260138,0.8903457,0.0005139722,0.00015861916,0.0006355986,0.0000106240195,0.0005809689,0.067464024],"genre_scores_gemma":[0.56883824,0.00001681217,0.43027437,0.00012510557,0.00015977898,0.00014140163,0.000006169301,0.000034015007,0.00040410587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975892,0.00004725685,0.00041668277,0.00065669167,0.0005480713,0.0007421333],"domain_scores_gemma":[0.99782383,0.00017610703,0.00022881721,0.0013755334,0.00018737037,0.00020832784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004762721,0.000322896,0.00040868166,0.00015945025,0.0003555194,0.00021954523,0.0017493061,0.00012586829,0.00009666409],"category_scores_gemma":[0.000114222865,0.00025990128,0.00009768658,0.0010146518,0.00049872877,0.00040250216,0.00077787746,0.0003351461,0.0006680343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004835563,0.00012606346,0.00004402304,0.00006897151,0.000033629756,0.000030335712,0.0012038192,0.000019854602,0.004241602,0.9909855,0.00045667737,0.0027411764],"study_design_scores_gemma":[0.0009226758,0.00039582796,0.00027830116,0.00007741067,0.000019346067,0.00017026541,0.00076479494,0.012434365,0.0096001355,0.9720245,0.00259763,0.0007147673],"about_ca_topic_score_codex":0.0000012742411,"about_ca_topic_score_gemma":0.000026905427,"teacher_disagreement_score":0.52860403,"about_ca_system_score_codex":0.000053124804,"about_ca_system_score_gemma":0.000058367365,"threshold_uncertainty_score":0.99998534},"labels":[],"label_agreement":null},{"id":"W2809063493","doi":"10.1007/978-3-319-71840-8_12","title":"Lexicographic Orientation Algorithms","year":2018,"lang":"en","type":"book-chapter","venue":"Springer monographs in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Lexicographical order; Orientation (vector space); Graph; Computer science; Algorithm; Mathematics; Combinatorics; Geometry","score_opus":0.03766803626619856,"score_gpt":0.29975090573399643,"score_spread":0.26208286946779785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809063493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084180175,0.0011253265,0.5919183,0.00009924548,0.0011178004,0.0014606514,0.000028030981,0.0006955506,0.4027133],"genre_scores_gemma":[0.0026447466,0.0015406439,0.8808705,0.00013328431,0.00036630512,0.00018892757,0.00003706076,0.00031779133,0.11390072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965093,0.00004395409,0.0008742657,0.00096073805,0.00094643724,0.00066530745],"domain_scores_gemma":[0.9968654,0.00025997197,0.00046931236,0.0019690841,0.00025439213,0.00018186712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010771618,0.00059031916,0.0006255943,0.0021287983,0.00014318911,0.00022941068,0.0020648555,0.0004286535,0.00020612699],"category_scores_gemma":[0.00006410407,0.00059617526,0.00036241204,0.0007228717,0.0005063108,0.00048863236,0.0006998663,0.0008207355,0.00035805884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056208573,0.00008130735,0.000076084056,0.00016845671,0.00007697688,0.00005323337,0.0015070081,0.000009596296,0.000020046953,0.9876022,0.00030811114,0.010091381],"study_design_scores_gemma":[0.0002822986,0.00011883763,0.000040440762,0.0004348105,0.00001865898,0.00001668543,0.000045128545,0.0040323273,0.00015260023,0.98433125,0.009915118,0.00061181426],"about_ca_topic_score_codex":0.0000020799987,"about_ca_topic_score_gemma":0.00001741007,"teacher_disagreement_score":0.28895223,"about_ca_system_score_codex":0.000088052686,"about_ca_system_score_gemma":0.000075285745,"threshold_uncertainty_score":0.999649},"labels":[],"label_agreement":null},{"id":"W2811248481","doi":"","title":"Branch width and well-quasi-ordering in matroids and graphs","year":2000,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; University of Toronto","keywords":"Matroid; Bounded function; Combinatorics; Mathematics; Class (philosophy); Discrete mathematics; Graphic matroid; Finite field; Tree (set theory); Computer science; Mathematical analysis","score_opus":0.04149826586960008,"score_gpt":0.337673932763571,"score_spread":0.2961756668939709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811248481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7250898,0.00034509762,0.26056218,0.006058736,0.00019789714,0.002137948,0.000014929746,0.000060391132,0.005533028],"genre_scores_gemma":[0.95634466,0.0006404018,0.042292055,0.0004551191,0.000063257256,0.000140485,0.0000030158521,0.000011853779,0.000049154034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584675,0.00014336781,0.00057188637,0.00043246718,0.0020712873,0.0009342408],"domain_scores_gemma":[0.9972356,0.0016542266,0.00009404063,0.00049211393,0.00034320605,0.00018082326],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012414906,0.00023001667,0.0002663984,0.00069864327,0.0010907674,0.0012793225,0.0022301248,0.00007536435,0.000008625361],"category_scores_gemma":[0.00041542822,0.0001436851,0.00004598681,0.00202903,0.0021098265,0.0020193555,0.0007029829,0.00059355656,0.000007771576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048801212,0.00017514553,0.0003137346,0.00021431607,0.00001427496,0.000004290766,0.014455852,0.0020389766,0.000051003088,0.8370052,0.00017115539,0.14550723],"study_design_scores_gemma":[0.00060943735,0.00015323672,0.0011882997,0.00010401547,0.0000016079526,0.00009661023,0.00021049305,0.5406926,0.000031871154,0.45482025,0.0019528914,0.00013867216],"about_ca_topic_score_codex":0.00002185049,"about_ca_topic_score_gemma":0.00005379679,"teacher_disagreement_score":0.5386536,"about_ca_system_score_codex":0.00011344097,"about_ca_system_score_gemma":0.00028972927,"threshold_uncertainty_score":0.99975747},"labels":[],"label_agreement":null},{"id":"W2825514135","doi":"10.1016/j.jctb.2018.07.001","title":"Peripheral circuits in infinite binary matroids","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Matroid; Electronic circuit; Mathematics; Computer science; Combinatorics; Discrete mathematics; Physics; Arithmetic; Quantum mechanics","score_opus":0.015186765259390072,"score_gpt":0.28264592315740134,"score_spread":0.2674591578980113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2825514135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9153987,0.00070715894,0.05304738,0.00091938424,0.016592244,0.00030233877,0.0000029547843,0.00010793402,0.012921882],"genre_scores_gemma":[0.9957853,0.000046445453,0.0027283807,0.000115454015,0.0009735136,0.0000035142587,2.6415233e-7,0.000020115753,0.0003270426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735534,0.0006864369,0.000661791,0.000222659,0.00061144395,0.0004623285],"domain_scores_gemma":[0.9980444,0.00034639396,0.00035807228,0.00051280827,0.0005532643,0.00018510464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028243777,0.00019526409,0.00040691614,0.00050991814,0.00015952061,0.0001657564,0.0016868188,0.00010753391,0.0001221105],"category_scores_gemma":[0.0004919416,0.00017161462,0.0001515237,0.001036362,0.00047848898,0.0022346969,0.0003481689,0.0005540529,0.000024668829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006282628,0.00012374338,0.00067394064,0.000010050253,0.00002873384,0.00018209392,0.0013446128,0.000026280397,0.00369408,0.987567,0.00018973093,0.005531446],"study_design_scores_gemma":[0.0015854749,0.0022899997,0.0012050516,0.000065146385,0.0000041732146,0.00025979365,0.0002151091,0.00008189176,0.0038907551,0.9803491,0.009853106,0.00020038696],"about_ca_topic_score_codex":0.0000013744277,"about_ca_topic_score_gemma":0.0000013607956,"teacher_disagreement_score":0.08038655,"about_ca_system_score_codex":0.0001387448,"about_ca_system_score_gemma":0.00025740688,"threshold_uncertainty_score":0.6998241},"labels":[],"label_agreement":null},{"id":"W2883056852","doi":"10.1007/s00373-018-1925-5","title":"On the Structure of (Even Hole, Kite)-Free Graphs","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Kite; Chordal graph; Vertex (graph theory); Split graph; Discrete mathematics; Graph; 1-planar graph; Geometry","score_opus":0.013030967221145003,"score_gpt":0.24866358694866922,"score_spread":0.23563261972752422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883056852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98917973,0.00037169468,0.0064324993,0.0007772744,0.0005571087,0.0002697161,0.000020004258,0.00009313791,0.0022988415],"genre_scores_gemma":[0.9990212,0.000063132655,0.0005968945,0.00020532258,0.00000992717,0.0000037787877,8.306295e-7,0.000010908564,0.00008803881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858266,0.000114232666,0.00017806265,0.00034037366,0.00046723598,0.00031744564],"domain_scores_gemma":[0.99801266,0.0003143647,0.000097471224,0.0012556812,0.00021741998,0.00010241841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028181216,0.00016236829,0.00017448913,0.0002195174,0.00029515987,0.00007351651,0.0016378835,0.00007688965,0.000015642181],"category_scores_gemma":[0.00013358214,0.000107747685,0.00007721521,0.0014701413,0.0004842871,0.00017678866,0.00049728993,0.00026122172,0.000003940894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013358447,0.000040145133,0.0008731069,0.000008841458,0.000017723502,0.000002623314,0.00024528982,0.0000014282817,0.0008180771,0.9949421,0.0011528543,0.0018844388],"study_design_scores_gemma":[0.00036899498,0.00043790968,0.0024243025,0.000015999736,0.00000406521,0.000004602447,0.000037947084,0.00031768347,0.006517857,0.9892022,0.00053957885,0.00012883324],"about_ca_topic_score_codex":0.000008306923,"about_ca_topic_score_gemma":0.000004964409,"teacher_disagreement_score":0.009841443,"about_ca_system_score_codex":0.000009706127,"about_ca_system_score_gemma":0.00002762592,"threshold_uncertainty_score":0.43938228},"labels":[],"label_agreement":null},{"id":"W2883247096","doi":"10.1002/jgt.22466","title":"Naji's characterization of circle graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Characterization (materials science); Discrete mathematics","score_opus":0.009212636301056067,"score_gpt":0.2538532904317289,"score_spread":0.24464065413067282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883247096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8032287,0.0001702115,0.19494136,0.00011767052,0.00054259686,0.00012036089,0.0000026404248,0.0000193893,0.00085708185],"genre_scores_gemma":[0.9969225,0.000112284266,0.0026635956,0.000092948634,0.000033458844,0.0000011981633,7.8823166e-7,0.000012870141,0.0001603476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981971,0.00034798298,0.00050719036,0.00016816804,0.00054061774,0.00023896864],"domain_scores_gemma":[0.9980645,0.00026113298,0.0006345387,0.00051599904,0.0004144614,0.00010932149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020802496,0.00010962161,0.00030339058,0.00074362336,0.00004836326,0.000038600043,0.0011970489,0.000060236656,0.000066355584],"category_scores_gemma":[0.00009101402,0.00009683651,0.00025790965,0.00096630375,0.00012981106,0.0010104453,0.000129512,0.0002802822,0.00002386814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014233384,0.00009335449,0.0027342124,0.000032699932,0.00006551875,0.000013397576,0.00040039778,0.000027275284,0.33116135,0.63829887,0.000011954461,0.027018618],"study_design_scores_gemma":[0.0007077947,0.0004943912,0.034387488,0.000099814446,0.000010562187,0.000101322665,0.000072500756,0.00011724494,0.046702947,0.9167502,0.00040562448,0.00015011177],"about_ca_topic_score_codex":3.892061e-7,"about_ca_topic_score_gemma":1.2094776e-7,"teacher_disagreement_score":0.2844584,"about_ca_system_score_codex":0.000017530927,"about_ca_system_score_gemma":0.000074897616,"threshold_uncertainty_score":0.39488783},"labels":[],"label_agreement":null},{"id":"W2883406596","doi":"10.23638/dmtcs-21-3-1","title":"Binding Number, Toughness and General Matching Extendability in Graphs","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Matching (statistics); Graph; Discrete mathematics","score_opus":0.02073836180585886,"score_gpt":0.3185557908663956,"score_spread":0.29781742906053676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883406596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32707936,0.000045319375,0.66953,0.0002817005,0.0006361287,0.000694911,0.000012924778,0.00015544638,0.001564248],"genre_scores_gemma":[0.5994388,0.000024990028,0.40034163,0.00006569359,0.00004313823,0.000038166145,0.0000035260118,0.00002864984,0.000015428086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99302334,0.0004334266,0.000981993,0.0024003792,0.001730188,0.001430663],"domain_scores_gemma":[0.9948632,0.0011227621,0.00032457197,0.0029546553,0.00026411656,0.0004706923],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0060575106,0.0006943059,0.0009885185,0.00068707665,0.000423714,0.0017523633,0.0060768053,0.0002786256,0.000037714595],"category_scores_gemma":[0.0002925294,0.00059077493,0.00022326027,0.0017331924,0.0042753113,0.0010065556,0.0146200545,0.0015938431,0.000064638014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082629085,0.00010596841,0.00054621964,0.0003951439,0.000011250781,0.00003102079,0.0025370307,0.0012292028,0.00026546227,0.9913109,0.000003243009,0.0035563074],"study_design_scores_gemma":[0.00016500129,0.000029706714,0.00031720762,0.0003054541,0.0000053163412,0.00003902247,0.00004354684,0.41825536,0.00025095427,0.58016515,0.0000025318725,0.00042075655],"about_ca_topic_score_codex":0.000013517938,"about_ca_topic_score_gemma":0.0000025735983,"teacher_disagreement_score":0.41702613,"about_ca_system_score_codex":0.00018743786,"about_ca_system_score_gemma":0.00032417366,"threshold_uncertainty_score":0.99965435},"labels":[],"label_agreement":null},{"id":"W2883849606","doi":"10.1016/j.disc.2018.06.026","title":"A complexity dichotomy for signed <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml3\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi mathvariant=\"bold\">H</mml:mi></mml:math>-colouring","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Mathematics; Discrete mathematics; Algorithm; Computer science; Theology","score_opus":0.033416933724127615,"score_gpt":0.290930367711206,"score_spread":0.2575134339870784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883849606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6555393,0.000077029115,0.3401456,0.00032883225,0.00045823812,0.00031702113,0.00016083554,0.00033443153,0.0026387419],"genre_scores_gemma":[0.80696815,0.000031117797,0.19096667,0.00042866686,0.000518708,0.0005608808,0.00009379689,0.00019168535,0.00024029175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530345,0.00013696523,0.0009870032,0.0010212456,0.0012083609,0.001342993],"domain_scores_gemma":[0.9954744,0.0010965132,0.0007232924,0.0020627591,0.00021325449,0.00042980709],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016273375,0.0005676898,0.00048981427,0.00022368028,0.001054361,0.00075638946,0.0022883494,0.00039955703,0.000058624893],"category_scores_gemma":[0.00076780986,0.0005991973,0.00054014695,0.0006595181,0.00088267605,0.0010085875,0.0015600674,0.00054196594,0.00081151165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016740593,0.00022895538,0.0000050122467,0.0006283353,0.00020039879,0.00009307852,0.002486548,0.00009856139,0.0024427858,0.9926789,0.00031787535,0.0006521863],"study_design_scores_gemma":[0.0009698967,0.0005912155,0.000032166296,0.0003651543,0.00010121737,0.00015070397,0.000415828,0.9061473,0.007126952,0.08212925,0.0014093957,0.0005609448],"about_ca_topic_score_codex":0.000042575135,"about_ca_topic_score_gemma":0.00006018206,"teacher_disagreement_score":0.91054964,"about_ca_system_score_codex":0.000042099855,"about_ca_system_score_gemma":0.00028553416,"threshold_uncertainty_score":0.99996644},"labels":[],"label_agreement":null},{"id":"W2883962117","doi":"10.4230/lipics.mfcs.2018.37","title":"Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; University of California, Santa Barbara; National Science Foundation","keywords":"Diagonal; Combinatorics; Mathematics; Intersection (aeronautics); Line segment; Approximation algorithm; Logarithm; Dominating set; Line (geometry); Discrete mathematics; Geometry; Graph; Mathematical analysis","score_opus":0.028714842930334793,"score_gpt":0.3103756508637333,"score_spread":0.28166080793339854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883962117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53516614,0.000081038044,0.4575018,0.00011203285,0.0011702355,0.0019515465,0.0004391862,0.00028626082,0.003291739],"genre_scores_gemma":[0.8169689,0.000061859144,0.18207021,0.00018159278,0.00012679838,0.00025082193,0.00021169025,0.00006599322,0.00006209918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996031,0.0001571646,0.0016126557,0.00063770666,0.00077595166,0.00078553945],"domain_scores_gemma":[0.99564886,0.00064628024,0.0014737918,0.001419604,0.00061754364,0.00019389644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001965591,0.0006179474,0.0008425651,0.0009881092,0.0003794272,0.0005203562,0.001862723,0.00048276826,0.000007898208],"category_scores_gemma":[0.0006798402,0.00056832837,0.00034713573,0.00047866392,0.00048110975,0.0011593299,0.00293675,0.0012525395,0.000013927666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016511685,0.0013115854,0.011255654,0.025079198,0.0020250448,0.00002354907,0.15261462,0.0020353806,0.0012720308,0.41520858,0.0037313593,0.38379183],"study_design_scores_gemma":[0.004450203,0.0023792335,0.0006355352,0.005809991,0.00010068855,0.00014329422,0.0073321476,0.60583776,0.019805208,0.3490746,0.0022407945,0.002190538],"about_ca_topic_score_codex":0.000015743959,"about_ca_topic_score_gemma":0.000008236842,"teacher_disagreement_score":0.6038024,"about_ca_system_score_codex":0.0001654484,"about_ca_system_score_gemma":0.00009449399,"threshold_uncertainty_score":0.9996768},"labels":[],"label_agreement":null},{"id":"W2885565269","doi":"10.1016/j.ejc.2025.104223","title":"Splitter theorems for graph immersions","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Corollary; Mathematics; Splitter; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Geometry; Telecommunications","score_opus":0.01636324418123912,"score_gpt":0.2859100178305071,"score_spread":0.269546773649268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885565269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007876074,0.0005189445,0.9729821,0.0018748819,0.0014780927,0.00012336839,0.0000011764906,0.000026413867,0.015118918],"genre_scores_gemma":[0.98690575,0.0000754854,0.011240412,0.00042110594,0.00005727304,0.0000013722885,3.5596142e-7,0.000016898919,0.0012813322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845505,0.00041668155,0.00040009737,0.00016489653,0.00028756604,0.00027574063],"domain_scores_gemma":[0.9981598,0.00054566417,0.00021665262,0.00044343673,0.00051194016,0.00012245233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022792367,0.000116408155,0.00018987512,0.00044109236,0.00018120899,0.00010877609,0.0017234173,0.000017645718,0.000004569654],"category_scores_gemma":[0.0002794866,0.000095643256,0.00021528316,0.00087675074,0.00008636682,0.00034993843,0.00026901145,0.00031209193,0.000013287496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003413795,0.00008312859,0.00025627343,0.000013349288,0.000040401243,0.000058279576,0.00011419311,0.000022249063,0.00052561634,0.98085046,0.006271805,0.011730108],"study_design_scores_gemma":[0.0014927494,0.0004447603,0.0013009154,0.00007849354,0.00001559294,0.000039500283,0.00006512096,0.0003160597,0.0016538865,0.9244922,0.0699576,0.00014315563],"about_ca_topic_score_codex":7.5764554e-8,"about_ca_topic_score_gemma":2.0782462e-8,"teacher_disagreement_score":0.9790297,"about_ca_system_score_codex":0.000040625873,"about_ca_system_score_gemma":0.0000833467,"threshold_uncertainty_score":0.39002186},"labels":[],"label_agreement":null},{"id":"W2885573521","doi":"10.48550/arxiv.1807.11543","title":"The structure of claw-free binary matroids","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Matroid; Claw; Combinatorics; Mathematics; Rank (graph theory); Binary number; Graphic matroid; Simple (philosophy); Discrete mathematics; Arithmetic; Biology","score_opus":0.04717016372486876,"score_gpt":0.2124765314267545,"score_spread":0.16530636770188573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885573521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6377997,0.00025353732,0.35782745,0.0002539997,0.0009866119,0.00047709237,0.00007953018,0.00021849785,0.0021036079],"genre_scores_gemma":[0.9948343,0.00018598897,0.0034124074,0.000026690448,0.0000838316,2.6793086e-7,0.00000506104,0.000019251991,0.0014322028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979377,0.00029078752,0.00021671967,0.00089141034,0.00019755958,0.00046585506],"domain_scores_gemma":[0.995062,0.0003138026,0.00029469145,0.0038428307,0.00034684967,0.00013985581],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00034343492,0.0002769362,0.0003008167,0.00025689212,0.00033308312,0.00009243615,0.0076828045,0.00026457012,0.000031682386],"category_scores_gemma":[0.00011100084,0.00023421795,0.00023061819,0.00084470114,0.00082882604,0.00029713332,0.008425681,0.00078381115,0.000029424767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010776735,0.000038141374,0.0010893712,0.00008004769,0.00012050912,0.00011682706,0.00014810532,0.01951346,0.0011741631,0.97558635,0.001462928,0.00056231883],"study_design_scores_gemma":[0.0003431715,0.00012616141,0.00081204786,0.000054483615,0.000021159825,0.000005481859,0.00005406878,0.054953404,0.0021179821,0.9403497,0.0008797048,0.00028261633],"about_ca_topic_score_codex":0.000027772494,"about_ca_topic_score_gemma":0.000030484362,"teacher_disagreement_score":0.35703465,"about_ca_system_score_codex":0.00011794463,"about_ca_system_score_gemma":0.00022662802,"threshold_uncertainty_score":0.999594},"labels":[],"label_agreement":null},{"id":"W2885679157","doi":"10.37236/8211","title":"Classes of Graphs with $e$-Positive Chromatic Symmetric Function","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; Wilfrid Laurier University","keywords":"Combinatorics; Mathematics; Conjecture; Interval graph; Chromatic scale; Discrete mathematics; Graph; Comparability graph; Pathwidth; Cograph; Indifference graph; Complement (music); Line graph","score_opus":0.009679500078962637,"score_gpt":0.2523303625708365,"score_spread":0.24265086249187387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885679157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17085552,0.01217931,0.8137792,0.00041703723,0.0010904773,0.0006033548,0.0000023366258,0.000034433288,0.0010383363],"genre_scores_gemma":[0.99792224,0.0015942366,0.0002455782,0.000029044688,0.000040090294,0.000007468554,0.0000013278027,0.000030624215,0.00012940138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963493,0.00057249767,0.00068955985,0.00030396975,0.001382911,0.000701764],"domain_scores_gemma":[0.9947955,0.0009932921,0.0017785497,0.0011066004,0.0012322187,0.00009381123],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023221537,0.00032385366,0.0007214006,0.00095254526,0.00011490909,0.0001052993,0.0030137969,0.0001702228,0.000003286659],"category_scores_gemma":[0.00015178142,0.00020366855,0.00029734906,0.0022879404,0.00018127328,0.0003928803,0.00068126596,0.0027212366,0.0000055567775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018061014,0.00018478718,0.00023016849,0.00013240814,0.00052394444,0.000009583267,0.00019129337,0.0024313696,0.00013420271,0.9947063,0.00006139841,0.0012139367],"study_design_scores_gemma":[0.0008413183,0.0034136586,0.0011409114,0.00031484404,0.00014984093,0.00019384583,0.00006273441,0.0019599719,0.0018899958,0.98973465,0.00007845864,0.00021975198],"about_ca_topic_score_codex":0.00000599708,"about_ca_topic_score_gemma":0.0000018101922,"teacher_disagreement_score":0.8270667,"about_ca_system_score_codex":0.00054470636,"about_ca_system_score_gemma":0.0020588173,"threshold_uncertainty_score":0.99957955},"labels":[],"label_agreement":null},{"id":"W2887371649","doi":"10.1007/978-3-642-39206-1_29","title":"On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Travelling salesman problem; Digraph; Mathematics; Linear programming relaxation; Linear programming; Relaxation (psychology); Discrete mathematics; Algorithm","score_opus":0.03251250968723412,"score_gpt":0.30365985449521377,"score_spread":0.27114734480797964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887371649","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001857567,0.00028856576,0.9899375,0.002631611,0.0007894019,0.0018190369,0.000008094498,0.00008783895,0.004252193],"genre_scores_gemma":[0.35581672,0.00010600253,0.6296416,0.01172755,0.00072800205,0.00044688856,0.00002344984,0.0001035693,0.0014062016],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946943,0.00021781368,0.0006335004,0.00180468,0.0015923405,0.0010573464],"domain_scores_gemma":[0.9927546,0.0042167515,0.00024252574,0.0022858384,0.0003427424,0.00015758144],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033721412,0.00059906836,0.000575361,0.0016592358,0.00035442878,0.00091240497,0.007677523,0.00031213832,0.000026225534],"category_scores_gemma":[0.00071252586,0.00040983356,0.00021281277,0.0023522226,0.0009995344,0.000846982,0.00096790725,0.0016901223,0.00007145469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015935913,0.00004743511,0.000020790732,0.000025827036,0.000006126835,0.000023666531,0.00064578734,0.006264812,0.000020775202,0.48038384,0.00015422543,0.5123908],"study_design_scores_gemma":[0.00035774664,0.00042557737,0.00014144888,0.00014016207,0.0000022670679,0.000019007803,4.842636e-7,0.16165252,0.00031896413,0.83460945,0.0018796414,0.00045275505],"about_ca_topic_score_codex":0.00004414023,"about_ca_topic_score_gemma":0.00011555514,"teacher_disagreement_score":0.51193804,"about_ca_system_score_codex":0.00043084146,"about_ca_system_score_gemma":0.00042341358,"threshold_uncertainty_score":0.9998354},"labels":[],"label_agreement":null},{"id":"W2888654318","doi":"10.48550/arxiv.2011.08049","title":"Efficient polynomial-time approximation scheme for the genus of dense graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani","keywords":"Combinatorics; Mathematics; Embedding; Genus; Time complexity; Order (exchange); Polynomial; Discrete mathematics; Function (biology); Mathematical analysis; Computer science; Finance","score_opus":0.07299527911596179,"score_gpt":0.2208616486884298,"score_spread":0.14786636957246801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888654318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1846293,0.00013560681,0.81347173,0.00024388164,0.00019921662,0.00094534794,0.000032810065,0.000119581055,0.00022251635],"genre_scores_gemma":[0.98625815,0.000040632618,0.013295349,0.00004371456,0.00003836477,0.00000663791,0.000008005113,0.00002023082,0.00028892665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981824,0.00016253401,0.00023944516,0.000894901,0.00016445607,0.0003562255],"domain_scores_gemma":[0.9973401,0.00056477624,0.00033121262,0.0013443413,0.00028375455,0.00013580387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053242926,0.0002497286,0.00033230882,0.00027620292,0.00021251771,0.00006303407,0.0025919038,0.00016576631,0.000010522585],"category_scores_gemma":[0.00015821717,0.00023124462,0.00036581635,0.0009161559,0.000274992,0.000103158265,0.0019891986,0.00042455218,0.000038102713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000263303,0.00012013654,0.00012024874,0.00021355909,0.00021334866,0.00003580309,0.0004785908,0.45461816,0.0030754076,0.5382152,0.0003446257,0.0023015868],"study_design_scores_gemma":[0.00043983772,0.00006488829,0.00012334503,0.00003958127,0.00004101744,0.0000017666874,0.000042943117,0.91862607,0.0017526734,0.07845207,0.00019090425,0.00022489268],"about_ca_topic_score_codex":0.000020609412,"about_ca_topic_score_gemma":0.0000016746435,"teacher_disagreement_score":0.8016288,"about_ca_system_score_codex":0.000100061916,"about_ca_system_score_gemma":0.00019736234,"threshold_uncertainty_score":0.94298816},"labels":[],"label_agreement":null},{"id":"W2889763467","doi":"10.1016/j.dam.2018.08.003","title":"Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.018023949806797272,"score_gpt":0.2931661814805807,"score_spread":0.27514223167378343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889763467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007328633,0.00013369978,0.9849943,0.0003197219,0.000119378696,0.000712212,0.000010838391,0.00024507547,0.006136152],"genre_scores_gemma":[0.106461704,0.00018690129,0.892058,0.0003692457,0.00007117637,0.00013162264,0.000015271367,0.000059763883,0.0006463005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977048,0.00004823657,0.00040476554,0.0006625918,0.0006107026,0.00056887255],"domain_scores_gemma":[0.9978493,0.0003712189,0.00021078944,0.0012235089,0.00011817826,0.0002270034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048786905,0.00033390682,0.00035291948,0.00021545526,0.0002897838,0.00026029625,0.0009162269,0.0001363352,0.000038117058],"category_scores_gemma":[0.00008819428,0.0002787817,0.000065991015,0.00085766806,0.00043521187,0.00033961012,0.00041127592,0.0002868662,0.00009502567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039462426,0.00020682119,0.00007740189,0.00012291152,0.00009294836,0.000005647858,0.0018107962,0.006433767,0.00033036649,0.98176956,0.0025988985,0.0065114116],"study_design_scores_gemma":[0.0014181387,0.00029443347,0.0001900001,0.0002605795,0.000043795535,0.00002126916,0.00037386027,0.17767768,0.0040992405,0.8093883,0.0051719705,0.0010607325],"about_ca_topic_score_codex":0.0000010086222,"about_ca_topic_score_gemma":0.000002344428,"teacher_disagreement_score":0.17238127,"about_ca_system_score_codex":0.00003074741,"about_ca_system_score_gemma":0.00003672538,"threshold_uncertainty_score":0.99996644},"labels":[],"label_agreement":null},{"id":"W2892627562","doi":"10.7561/sacs.2018.2.237","title":"A Precise Characterisation of Step Traces and Their Concurrent Histories","year":2018,"lang":"en","type":"article","venue":"Scientific Annals of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; History; Programming language","score_opus":0.06472090157000439,"score_gpt":0.3354733992565607,"score_spread":0.27075249768655635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892627562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40908825,0.00023595968,0.58856833,0.0002945792,0.0014891275,0.00016009028,0.000008848625,0.000035478137,0.000119326636],"genre_scores_gemma":[0.9750988,0.000013354605,0.02469544,0.0000300595,0.00005522046,0.0000046367036,8.19566e-7,0.0000040014365,0.00009766448],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997507,0.00010028684,0.00039148936,0.00075648515,0.00081579643,0.0004289826],"domain_scores_gemma":[0.9969396,0.00014871269,0.0003190162,0.0008634696,0.0015476451,0.00018156879],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0031938178,0.00014727282,0.00025183713,0.000581863,0.00044123907,0.00033928608,0.0021010123,0.000030420682,0.000008430334],"category_scores_gemma":[0.000111706286,0.000116559815,0.00005909036,0.0021222623,0.0070049497,0.0019458674,0.0008325417,0.00008430193,0.0000054202364],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025692741,0.00017275286,0.0005003971,0.000069108195,0.00001180686,9.610399e-7,0.014955041,0.00001875266,0.10253932,0.12239634,0.0006378289,0.758672],"study_design_scores_gemma":[0.00034816662,0.0009824369,0.011949177,0.00015829994,0.000002702982,0.000016710215,0.00014697066,0.21411702,0.73251027,0.029956874,0.009425871,0.00038549988],"about_ca_topic_score_codex":0.0000037421441,"about_ca_topic_score_gemma":0.000003550046,"teacher_disagreement_score":0.7582865,"about_ca_system_score_codex":0.000016974347,"about_ca_system_score_gemma":0.00028857743,"threshold_uncertainty_score":0.99569744},"labels":[],"label_agreement":null},{"id":"W2894741972","doi":"10.1007/s00373-020-02174-9","title":"Which Graphs Occur as $$\\gamma $$-Graphs?","year":2020,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Split graph; Discrete mathematics; Dominating set; Pathwidth; Graph; Indifference graph; Line graph; Vertex (graph theory)","score_opus":0.027846297911901557,"score_gpt":0.2867018332296616,"score_spread":0.25885553531776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894741972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6901755,0.036530986,0.14813052,0.019910932,0.020787017,0.00809549,0.00040573932,0.007876278,0.068087555],"genre_scores_gemma":[0.9918352,0.003877051,0.0031091198,0.0005425773,0.000036124296,0.00021352194,0.00004710264,0.000089673704,0.00024962536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99396515,0.00039652907,0.00074398424,0.002310239,0.0014089408,0.0011751859],"domain_scores_gemma":[0.9950874,0.0003507626,0.0004250268,0.0024889074,0.00072055997,0.0009273282],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008449104,0.00093752635,0.0010283411,0.001032949,0.0005642232,0.000918617,0.0040366836,0.0006977904,0.000020308886],"category_scores_gemma":[0.00028309392,0.0009509059,0.00050093344,0.004263699,0.00034456057,0.000525497,0.0054457467,0.0026417393,0.00007551681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034874225,0.00016197118,0.0029445582,0.00024927707,0.00015748787,0.00010919941,0.00049050746,0.000020070473,0.000069667396,0.9895486,0.0017689212,0.0044448716],"study_design_scores_gemma":[0.00077272713,0.00038291578,0.0023746106,0.00011444329,0.000043761123,0.00004277477,0.00007272451,0.0018875878,0.00032900908,0.989619,0.00334146,0.0010189482],"about_ca_topic_score_codex":0.00008905531,"about_ca_topic_score_gemma":0.00001859522,"teacher_disagreement_score":0.30165973,"about_ca_system_score_codex":0.00006892588,"about_ca_system_score_gemma":0.00039631707,"threshold_uncertainty_score":0.9996592},"labels":[],"label_agreement":null},{"id":"W2895524825","doi":"10.22215/etd/2015-10989","title":"Facial Nonrepetitive Graph Colourings","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Bounded function; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.02347699655785219,"score_gpt":0.3341336922054354,"score_spread":0.3106566956475832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895524825","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03681844,0.0005022876,0.12292276,0.0002572918,0.0032855785,0.0012443241,0.00003088901,0.0010607452,0.8338777],"genre_scores_gemma":[0.17862758,0.00023973166,0.10712686,0.0005970171,0.00066128303,0.00057653344,0.0009926049,0.00021137737,0.710967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978784,0.00009288961,0.00021946675,0.00063130545,0.00076043734,0.000417503],"domain_scores_gemma":[0.99838823,0.00009556211,0.00012311467,0.000607343,0.0005807207,0.0002049996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044134283,0.00025211688,0.0002735486,0.0003951068,0.0001248539,0.0001571071,0.0015116482,0.00022438493,0.00011284179],"category_scores_gemma":[0.00014660388,0.00023451149,0.00012747858,0.0006316522,0.00005524717,0.0004319499,0.00016289276,0.0004441809,0.00042109593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018192569,0.00011827512,0.000059517413,0.00008081813,0.00009743933,0.00013795272,0.003985274,0.00001923718,0.00088207214,0.9069103,0.009963,0.07756418],"study_design_scores_gemma":[0.0005637788,0.0002789645,0.0008748375,0.00007305584,0.000011779584,0.0000116523515,0.0009841351,0.00030136365,0.0081576705,0.96587384,0.022085052,0.00078388356],"about_ca_topic_score_codex":0.000033075616,"about_ca_topic_score_gemma":0.00022326996,"teacher_disagreement_score":0.14180914,"about_ca_system_score_codex":0.00007450469,"about_ca_system_score_gemma":0.00033599956,"threshold_uncertainty_score":0.9563101},"labels":[],"label_agreement":null},{"id":"W2895552009","doi":"10.4230/lipics.icalp.2020.21","title":"Counting Homomorphisms in Plain Exponential Time","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Exponential function; Mathematics; Exponential growth; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.020173281068611455,"score_gpt":0.28427927199375524,"score_spread":0.2641059909251438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895552009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32257304,0.00021603692,0.65920955,0.0003673159,0.003264588,0.0046889423,0.0012184839,0.0008213384,0.007640714],"genre_scores_gemma":[0.79198784,0.00018365154,0.19889206,0.001381409,0.001350448,0.0014656007,0.00272098,0.0003460814,0.0016719229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99346054,0.00018922103,0.0021460948,0.0009585219,0.0013866063,0.0018590285],"domain_scores_gemma":[0.99492997,0.000413134,0.0010671915,0.0025926777,0.0006384967,0.00035851687],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028428559,0.0009246439,0.0011250069,0.0012856814,0.0004479655,0.001254997,0.0054160594,0.00082421734,0.00010032547],"category_scores_gemma":[0.00029175307,0.00094224414,0.0005110247,0.00074288715,0.00048665793,0.0022487862,0.0064425524,0.0020588948,0.00095995684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051630763,0.009743549,0.042904608,0.026379326,0.004877905,0.0011733639,0.14944912,0.021441046,0.0030834537,0.4270992,0.0909349,0.21775046],"study_design_scores_gemma":[0.0083099445,0.0007253939,0.0009865832,0.002292058,0.0000685366,0.0001983654,0.0006578491,0.80208474,0.003765622,0.12310842,0.054118846,0.003683626],"about_ca_topic_score_codex":0.000019725752,"about_ca_topic_score_gemma":0.00002152964,"teacher_disagreement_score":0.7806437,"about_ca_system_score_codex":0.00048991555,"about_ca_system_score_gemma":0.00037820422,"threshold_uncertainty_score":0.99996513},"labels":[],"label_agreement":null},{"id":"W2896168333","doi":"10.1177/1094342018803672","title":"New BSP/CGM algorithms for spanning trees","year":2018,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Spanning tree; Parallel algorithm; Algorithm; Graph; Computation; Bulk synchronous parallel; Ranking (information retrieval); Theoretical computer science; Parallel computing; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.03186813572026007,"score_gpt":0.3448644533184474,"score_spread":0.3129963175981873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896168333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038826894,0.00010472728,0.95526415,0.0046849553,0.00063452014,0.000199534,0.0000027893673,0.000046548197,0.00023585166],"genre_scores_gemma":[0.69681495,0.000030597083,0.30074897,0.00023034167,0.0019602824,0.000010407075,0.0000017561711,0.000009958095,0.00019271192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985205,0.000029773528,0.0004355005,0.00019242724,0.0005759906,0.00024583444],"domain_scores_gemma":[0.9975363,0.00042329368,0.00042451906,0.00038174266,0.0011423295,0.0000917877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092850195,0.00011417167,0.00014402387,0.00022017505,0.00041172607,0.00020075862,0.003421845,0.00003119605,0.000011038588],"category_scores_gemma":[0.00005991341,0.00008382603,0.00009138182,0.000362689,0.00013245326,0.00046529897,0.00035681375,0.00023358632,0.000033512017],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005858077,0.000049495404,0.00028115924,0.0000046565006,0.00011177094,0.000001363661,0.0006213803,0.0054967813,0.0013052749,0.1304573,0.0026812903,0.85893095],"study_design_scores_gemma":[0.0019685877,0.0007222862,0.008638011,0.00019048054,0.0000317973,0.00061794353,0.00013497559,0.66248006,0.02719714,0.18443343,0.11317461,0.00041065417],"about_ca_topic_score_codex":0.000011737218,"about_ca_topic_score_gemma":0.0000027686922,"teacher_disagreement_score":0.85852027,"about_ca_system_score_codex":0.00008462205,"about_ca_system_score_gemma":0.00019102379,"threshold_uncertainty_score":0.6358696},"labels":[],"label_agreement":null},{"id":"W2897168502","doi":"10.37236/8240","title":"Chromatic Polynomials of Oriented Graphs","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic polynomial; Combinatorics; Mathematics; Discrete mathematics; Chromatic scale; Foster graph; Graph; Friendship graph; Windmill graph; Line graph; Voltage graph","score_opus":0.012053478142036595,"score_gpt":0.2763215363540942,"score_spread":0.26426805821205757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897168502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37238437,0.016608495,0.6051625,0.0011019452,0.003167747,0.0007572725,0.000004433823,0.00004842046,0.000764836],"genre_scores_gemma":[0.99756795,0.0017775315,0.00030045406,0.00003375907,0.000056358003,0.000005633124,0.0000010153335,0.0000307196,0.00022656213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578834,0.00068576593,0.0010899812,0.00029571605,0.0012837428,0.00085643335],"domain_scores_gemma":[0.9944296,0.00078050554,0.0021245233,0.0016717757,0.00087608345,0.00011750689],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0039755623,0.00032625685,0.00090410333,0.0005729828,0.00009961267,0.00007747911,0.0053243935,0.00020394297,0.0000083609775],"category_scores_gemma":[0.00032913196,0.00022670253,0.00050469424,0.0010893572,0.0001916826,0.00027972128,0.0014635818,0.002749605,0.000010344141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005571045,0.00015380348,0.00010872083,0.000117011994,0.00029256567,0.000007858403,0.0003603549,0.0010637278,0.00060259196,0.9964957,0.00018819577,0.0005537437],"study_design_scores_gemma":[0.0007482447,0.00077787996,0.00013689463,0.00019569063,0.000059322432,0.000120214,0.00003991487,0.001248048,0.005072957,0.9909055,0.00049156847,0.00020371366],"about_ca_topic_score_codex":0.00000656683,"about_ca_topic_score_gemma":9.993167e-7,"teacher_disagreement_score":0.6251836,"about_ca_system_score_codex":0.00049106916,"about_ca_system_score_gemma":0.0023913123,"threshold_uncertainty_score":0.9995511},"labels":[],"label_agreement":null},{"id":"W2897482847","doi":"10.1016/j.dam.2018.08.021","title":"Broadcast domination and multipacking in strongly chordal graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Mathematics; Combinatorics; Interval graph; Graph; Tree (set theory); Treewidth; Discrete mathematics; Pathwidth; 1-planar graph; Line graph","score_opus":0.01801869487767191,"score_gpt":0.29331524957768434,"score_spread":0.27529655470001246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897482847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2511789,0.000034427052,0.739744,0.00006821921,0.000047952268,0.00041078567,0.0000025385552,0.00009333411,0.008419868],"genre_scores_gemma":[0.75130874,0.000009236363,0.24856524,0.000015806947,0.000023583249,0.000036277073,0.0000017205427,0.000013651681,0.00002574783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987076,0.000023832261,0.00026460455,0.0003482255,0.00029966398,0.0003560838],"domain_scores_gemma":[0.99910796,0.00017975981,0.0000966985,0.00047664667,0.000054993987,0.00008392969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005206107,0.00015494978,0.00019022907,0.0002373866,0.00011931308,0.00013253084,0.00049711973,0.00005699207,0.000008239263],"category_scores_gemma":[0.000063509055,0.00013983125,0.000027972392,0.00051470473,0.00023875899,0.00030506865,0.00032346736,0.00016127003,0.00002971841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012030718,0.000045861987,0.000116375704,0.000046482673,0.0000074228624,0.0000033884335,0.004043173,0.00002023451,0.00814656,0.961542,0.000011094969,0.026005378],"study_design_scores_gemma":[0.0014582943,0.00012300871,0.001518465,0.000084755804,0.000007103371,0.000017358325,0.0013114312,0.16896322,0.012661133,0.81317174,0.00023760175,0.00044586332],"about_ca_topic_score_codex":0.0000032350017,"about_ca_topic_score_gemma":0.000014283931,"teacher_disagreement_score":0.5001298,"about_ca_system_score_codex":0.000029748991,"about_ca_system_score_gemma":0.000017155397,"threshold_uncertainty_score":0.5702153},"labels":[],"label_agreement":null},{"id":"W2897704917","doi":"10.1137/1.9781611975482.37","title":"Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Laminar flow; Disjoint sets; Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Graph; Discrete mathematics; Planar; Computer science; Physics; Mechanics","score_opus":0.05912181164447611,"score_gpt":0.2845468274974068,"score_spread":0.22542501585293068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897704917","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0857731,0.00053981243,0.036101356,0.0002500043,0.0011255649,0.020383822,0.0012136104,0.00045181604,0.8541609],"genre_scores_gemma":[0.032523066,0.00021186958,0.53758025,0.00029648386,0.00070155197,0.0007721444,0.00027709015,0.00071062613,0.42692694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979386,0.000010356648,0.0006911781,0.0005300686,0.00038916414,0.00044066503],"domain_scores_gemma":[0.9984536,0.00056375796,0.00038959764,0.00046631054,0.000042841642,0.000083866216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000976792,0.00038160887,0.00083806115,0.00024854066,0.00007192864,0.000039957027,0.0006475696,0.0007615745,0.0000075839635],"category_scores_gemma":[0.000021682983,0.00036761453,0.00032695767,0.00009182838,0.00023156124,0.000060944756,0.00027989893,0.0007858941,0.000012143014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052877203,0.000034992216,0.0000040750283,0.00031922737,0.000074035466,0.0000030213532,0.0016671598,0.000018312521,0.00056319666,0.99214464,0.0003787233,0.00473976],"study_design_scores_gemma":[0.0025194522,0.00019379085,9.2407964e-7,0.0005749129,0.00003076246,0.0000051195116,0.00018818711,0.0033801303,0.0012639004,0.98827225,0.0030224107,0.0005481811],"about_ca_topic_score_codex":0.0000017462263,"about_ca_topic_score_gemma":0.0000026259606,"teacher_disagreement_score":0.50147885,"about_ca_system_score_codex":0.000070109396,"about_ca_system_score_gemma":0.00019034222,"threshold_uncertainty_score":0.9998776},"labels":[],"label_agreement":null},{"id":"W2897904393","doi":"10.1016/j.jctb.2022.01.009","title":"Colouring graphs with sparse neighbourhoods: Bounds and applications","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Neighbourhood (mathematics); Conjecture; Clique number; Chromatic scale; Vertex (graph theory); Brooks' theorem; Graph; Edge coloring; Discrete mathematics; Chordal graph; Graph power; 1-planar graph; Line graph","score_opus":0.009261596198324534,"score_gpt":0.24523861306012232,"score_spread":0.23597701686179778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897904393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5250181,0.0036557855,0.4500131,0.0025088927,0.006188903,0.0014632491,0.000022163595,0.00026822096,0.010861586],"genre_scores_gemma":[0.99512655,0.000062627456,0.004299604,0.000077233526,0.00016897342,0.00005195132,4.892331e-7,0.000018029397,0.00019452511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812347,0.00045219716,0.0003261721,0.0002018556,0.00061864033,0.0002776842],"domain_scores_gemma":[0.9984866,0.00035447988,0.0003625883,0.00039338128,0.00023026811,0.00017270082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018074481,0.0001408254,0.00026325785,0.00028282942,0.0007162683,0.0001759299,0.0010714512,0.000028612056,0.00004816549],"category_scores_gemma":[0.00006123313,0.00012003658,0.000073275805,0.0007814466,0.00027631628,0.000969834,0.00051933323,0.0005466981,9.938899e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067348924,0.00010806272,0.00038504452,0.000008216773,0.000057660633,0.00005620481,0.00040525387,0.00017773366,0.00029089142,0.99459046,0.000052162053,0.0031948336],"study_design_scores_gemma":[0.0011123877,0.0015031694,0.0002210093,0.000009519398,0.000013674598,0.0007464081,0.00059719686,0.000022170967,0.0006071121,0.9675163,0.027505003,0.00014606903],"about_ca_topic_score_codex":8.996852e-7,"about_ca_topic_score_gemma":5.1692274e-7,"teacher_disagreement_score":0.47010848,"about_ca_system_score_codex":0.00007957069,"about_ca_system_score_gemma":0.0001958609,"threshold_uncertainty_score":0.5509029},"labels":[],"label_agreement":null},{"id":"W2898198549","doi":"10.1007/978-3-319-97686-0_9","title":"Some of My Favourite Conjectures: Local Conditions Implying Global Cycle Properties","year":2018,"lang":"en","type":"book-chapter","venue":"Problem books in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Eulerian path; Conjecture; Mathematics; Hamiltonian path; Vertex (graph theory); Planar graph; Discrete mathematics; Graph; Pure mathematics","score_opus":0.03615258329350117,"score_gpt":0.29318633940565286,"score_spread":0.2570337561121517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898198549","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000879351,0.0034863772,0.51078534,0.00022543703,0.00035023087,0.0036711842,0.00026368926,0.0005458169,0.47979254],"genre_scores_gemma":[0.13168839,0.0007058499,0.63325864,0.00059243804,0.0006492339,0.0006490603,0.00005779248,0.00047383216,0.23192474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713945,0.000053001288,0.0009599648,0.0005765343,0.00072603737,0.0005449885],"domain_scores_gemma":[0.9977549,0.00020770417,0.00050738006,0.0011144511,0.0002899487,0.00012566925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065449305,0.0004573571,0.00072805595,0.00029407386,0.00014081574,0.000113237744,0.0016273118,0.0003117234,0.00007616404],"category_scores_gemma":[0.00006846009,0.0003994724,0.00019616127,0.000110502806,0.0010703934,0.00037843705,0.0008967503,0.0005229141,0.0001242962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007957737,0.000056531542,0.000003851821,0.0009527644,0.000067682755,0.000021347374,0.001756692,0.00022816524,0.0001744124,0.99539304,0.00019714756,0.0011404076],"study_design_scores_gemma":[0.00029787852,0.00012959355,0.000001512566,0.0016835108,0.000019746782,0.00005782911,0.00009895305,0.0066594607,0.0006822337,0.98882663,0.0011468757,0.0003957553],"about_ca_topic_score_codex":0.000007305056,"about_ca_topic_score_gemma":0.000027552845,"teacher_disagreement_score":0.2478678,"about_ca_system_score_codex":0.00022549045,"about_ca_system_score_gemma":0.00028217252,"threshold_uncertainty_score":0.99984574},"labels":[],"label_agreement":null},{"id":"W2898301962","doi":"10.1016/j.dam.2018.08.027","title":"Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constant (computer programming); Planar; Decomposition; Combinatorics; Approximation algorithm; Factor (programming language); Algorithm; Planar graph; Discrete mathematics; Graph; Computer science","score_opus":0.019614152468066852,"score_gpt":0.3005821580958938,"score_spread":0.2809680056278269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898301962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009071812,0.000014146882,0.98662364,0.000053513482,0.000057713474,0.00096741604,0.00012330858,0.00014993682,0.0029385125],"genre_scores_gemma":[0.063102454,0.0000037731184,0.93658036,0.00004046672,0.000049007685,0.00009127975,0.000049957587,0.00003061552,0.00005208622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983829,0.000025001988,0.00046380496,0.00035402967,0.00041176134,0.00036246743],"domain_scores_gemma":[0.99838066,0.00034231268,0.00028587054,0.0006762905,0.00021565937,0.00009919979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003893465,0.0002043798,0.0003443106,0.00013975886,0.00021048052,0.000079591795,0.0006875357,0.00009243034,0.000030003092],"category_scores_gemma":[0.00003577163,0.00018335317,0.000107387496,0.00043128867,0.0003877114,0.0002648901,0.000111837115,0.00010526923,0.00009341032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034792887,0.00012798236,0.0000022292134,0.00018907191,0.000058535083,6.878046e-7,0.0016839025,0.000013500532,0.064370565,0.8997318,0.00015290939,0.03363402],"study_design_scores_gemma":[0.0005728091,0.00016487054,0.0000073836845,0.000040240087,0.000012481841,0.0000061291676,0.000058144673,0.37499434,0.0649355,0.5588729,0.00013141993,0.00020382754],"about_ca_topic_score_codex":8.328031e-7,"about_ca_topic_score_gemma":4.441341e-7,"teacher_disagreement_score":0.37498084,"about_ca_system_score_codex":0.000026752632,"about_ca_system_score_gemma":0.000051272567,"threshold_uncertainty_score":0.7476925},"labels":[],"label_agreement":null},{"id":"W2898645613","doi":"10.1002/jgt.22668","title":"An optimal χ‐bound for (P6, diamond)‐free graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Perfect graph; Discrete mathematics; Chromatic scale; Graph; Clique number; Cograph; Vertex (graph theory); Line graph; Pathwidth","score_opus":0.021355985766179666,"score_gpt":0.31007581000829687,"score_spread":0.28871982424211723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898645613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14965309,0.0026604407,0.84546626,0.0005587514,0.0007948236,0.00016072331,0.000016324542,0.00004990687,0.0006397023],"genre_scores_gemma":[0.7379522,0.00034196366,0.26025084,0.00061882834,0.00034007579,0.000020664625,0.000003984971,0.000058349866,0.00041313047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971935,0.0006328221,0.00058421923,0.00037963997,0.00065759674,0.0005522254],"domain_scores_gemma":[0.99600244,0.0009979876,0.00038356904,0.00125923,0.0009766497,0.00038010368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033199124,0.00021857473,0.00040376416,0.00062173075,0.00029458193,0.00029483403,0.0026945083,0.00010310374,0.000058114012],"category_scores_gemma":[0.0006477661,0.00018829247,0.00054941396,0.0010756886,0.00029988654,0.0016370841,0.00027557943,0.00047782864,0.0000047300796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040321168,0.00028013284,0.00019302369,0.000024057277,0.00014737713,0.00027410616,0.0005255954,0.0003947033,0.011984839,0.96001977,0.0008337803,0.024919383],"study_design_scores_gemma":[0.0012222194,0.0007268524,0.00045677126,0.000037972757,0.000026551346,0.00046232285,0.0003159795,0.00046799754,0.02123562,0.9728508,0.0019699254,0.0002270025],"about_ca_topic_score_codex":4.1682674e-7,"about_ca_topic_score_gemma":0.0000027213123,"teacher_disagreement_score":0.5882991,"about_ca_system_score_codex":0.000038842725,"about_ca_system_score_gemma":0.00029616075,"threshold_uncertainty_score":0.76783437},"labels":[],"label_agreement":null},{"id":"W2899312866","doi":"10.1002/jgt.22678","title":"The structure of graphs with no K3,3 immersion","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Robertson–Seymour theorem; 1-planar graph; Planar graph; Minor (academic); Indifference graph; Discrete mathematics; Pathwidth; Chordal graph; Graph; Line graph","score_opus":0.0075832166638496725,"score_gpt":0.25330627347158774,"score_spread":0.24572305680773807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899312866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76698864,0.0078744935,0.21923527,0.0017719263,0.0014332859,0.0002292181,0.0000111156005,0.000034264216,0.002421792],"genre_scores_gemma":[0.9863692,0.0004977122,0.012685973,0.00010943341,0.000049564875,3.9711088e-7,3.8599788e-7,0.000013727842,0.0002736309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978488,0.00056625664,0.00039726312,0.00017730492,0.00071981153,0.00029054692],"domain_scores_gemma":[0.9968548,0.00081530906,0.00047800693,0.000648323,0.0010782214,0.00012536706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012661669,0.00013741509,0.00025577296,0.00025018535,0.00023814014,0.0000759977,0.0013131555,0.00005447072,0.000038075963],"category_scores_gemma":[0.00018889818,0.000074561045,0.00023217963,0.0011377728,0.0004046437,0.00045402645,0.000189029,0.00049362413,0.0000028745765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005495475,0.00006119817,0.0007252812,0.00002215317,0.00019886212,0.00015688027,0.00035176592,0.00012613108,0.08349347,0.8969028,0.0004208923,0.016991008],"study_design_scores_gemma":[0.0006363163,0.00045966497,0.0010507911,0.000092696326,0.00002055798,0.00055061677,0.00055647583,0.00003515919,0.0837964,0.91117966,0.001500058,0.0001216152],"about_ca_topic_score_codex":4.834137e-7,"about_ca_topic_score_gemma":0.0000021778433,"teacher_disagreement_score":0.21938054,"about_ca_system_score_codex":0.000017744873,"about_ca_system_score_gemma":0.00019826586,"threshold_uncertainty_score":0.30405113},"labels":[],"label_agreement":null},{"id":"W2899358912","doi":"10.1002/jgt.22677","title":"The structure of graphs with no W4 immersion","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Immersion (mathematics); Structured program theorem; Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.01012567712544459,"score_gpt":0.2656434143866309,"score_spread":0.2555177372611863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899358912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6321009,0.015452807,0.34678766,0.0006842922,0.003371556,0.00053016806,0.000027022317,0.00004235134,0.001003264],"genre_scores_gemma":[0.97601646,0.0018324485,0.021801421,0.00008024956,0.00011360873,0.000001860217,0.0000025025317,0.000034837572,0.00011660883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586684,0.0011493436,0.0008126087,0.000412607,0.0013189396,0.00043967454],"domain_scores_gemma":[0.99373883,0.0010938596,0.001652074,0.0015398387,0.00178121,0.00019417847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002482399,0.00035488064,0.0006691738,0.00063234364,0.00027560792,0.00024744176,0.0038554422,0.0002331984,0.00003787963],"category_scores_gemma":[0.00023720595,0.00019930734,0.00064656197,0.00093045074,0.0007225382,0.00042907769,0.00135113,0.0021795812,0.0000015206342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020936048,0.0002192007,0.0011404721,0.00037843996,0.001703646,0.00045726923,0.0021100498,0.0029401872,0.034184527,0.92102,0.00061836216,0.033134285],"study_design_scores_gemma":[0.000591503,0.00052071095,0.0008081687,0.00067495025,0.000070658025,0.00035404743,0.0007428653,0.00010912082,0.016003769,0.9795349,0.0002893391,0.00029997327],"about_ca_topic_score_codex":0.0000031012544,"about_ca_topic_score_gemma":0.0000048772936,"teacher_disagreement_score":0.34391558,"about_ca_system_score_codex":0.00004969474,"about_ca_system_score_gemma":0.00054155604,"threshold_uncertainty_score":0.9469317},"labels":[],"label_agreement":null},{"id":"W2899438014","doi":"","title":"Mixed k-rainbow domination numbers in graphs","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Mathematics; Domination analysis; Combinatorics; Graph","score_opus":0.03345431103223346,"score_gpt":0.3086433519217288,"score_spread":0.27518904088949536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899438014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35808116,0.00013503357,0.5494008,0.001712004,0.000501786,0.0010618863,0.0000061400156,0.00050551526,0.08859566],"genre_scores_gemma":[0.89294136,0.0000032764246,0.106545,0.00007029036,0.00001961968,0.000045225916,0.0000011083441,0.0000119752785,0.0003621683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983133,0.00016169099,0.0003024887,0.000391158,0.00040058588,0.00043076187],"domain_scores_gemma":[0.9985067,0.00035837945,0.00006568333,0.00084688887,0.00012084231,0.00010147525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011677139,0.0001414151,0.00019415934,0.00032808687,0.00010483739,0.00006905149,0.0009450015,0.000060766528,0.00014564671],"category_scores_gemma":[0.00051820604,0.00012799434,0.000068296395,0.0010396553,0.00030784577,0.000488773,0.00025294017,0.00014371672,0.0005474457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010984291,0.00010486755,0.00011537507,0.00003553745,0.000007984269,0.000008758404,0.0023201634,7.985644e-7,0.00043282477,0.97972924,0.0005600226,0.016673423],"study_design_scores_gemma":[0.00036372707,0.00008382144,0.0011498459,0.000053307864,0.0000020738405,0.000012754718,0.0002359256,0.020207759,0.0021158264,0.97489315,0.00072646816,0.00015535434],"about_ca_topic_score_codex":0.000005829181,"about_ca_topic_score_gemma":0.000025524187,"teacher_disagreement_score":0.5348602,"about_ca_system_score_codex":0.000054305077,"about_ca_system_score_gemma":0.000036867903,"threshold_uncertainty_score":0.703649},"labels":[],"label_agreement":null},{"id":"W2899926070","doi":"10.1017/s0963548320000127","title":"Finding independent transversals efficiently","year":2020,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dominating set; Vertex (graph theory); Partition (number theory); Graph; Independent set; Efficient algorithm; Set (abstract data type)","score_opus":0.05420302350043195,"score_gpt":0.2914215236149398,"score_spread":0.23721850011450785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899926070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27382398,0.00012129025,0.7215109,0.0017316111,0.00042696382,0.0005265049,0.0000014760637,0.0006052304,0.0012520816],"genre_scores_gemma":[0.98355615,0.0000025801323,0.016028164,0.0003198185,0.00005006111,0.0000066381763,0.0000018394254,0.000020666854,0.000014082523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648386,0.00035544872,0.0005154322,0.0010366512,0.0008493279,0.00075925264],"domain_scores_gemma":[0.9977818,0.0005539236,0.00015477029,0.0008174247,0.00026005288,0.0004320369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015104766,0.00027143446,0.00036051293,0.00012532769,0.0004320675,0.00024779575,0.0023326261,0.00010974798,0.000011067144],"category_scores_gemma":[0.00072577555,0.00028643015,0.00016705111,0.0019735638,0.00012931493,0.00045944127,0.0011647572,0.0006679073,0.00007656643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020315952,0.00026067696,0.0069607766,0.00016657478,0.000026543927,0.00003797543,0.004096345,0.0073088794,0.0012340647,0.9661727,0.000080780104,0.013634398],"study_design_scores_gemma":[0.00154731,0.0004404028,0.0026687293,0.00005130972,0.000009371306,0.000015521024,0.00011415637,0.41892418,0.0064227344,0.56802773,0.001073493,0.00070508005],"about_ca_topic_score_codex":0.0000032125579,"about_ca_topic_score_gemma":3.734241e-7,"teacher_disagreement_score":0.7097322,"about_ca_system_score_codex":0.00021835678,"about_ca_system_score_gemma":0.00014564744,"threshold_uncertainty_score":0.9999588},"labels":[],"label_agreement":null},{"id":"W2899943641","doi":"","title":"Planar k-NodeTrix Graphs: A New Family of Beyond Planar Graphs","year":2017,"lang":"en","type":"article","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Planar; Combinatorics; Planar graph; 1-planar graph; Planar straight-line graph; Chordal graph; Outerplanar graph; Mathematics; Pathwidth; Computer science; Discrete mathematics; Graph; Line graph; Computer graphics (images)","score_opus":0.023472459383375346,"score_gpt":0.25993526909825093,"score_spread":0.2364628097148756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899943641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1788595,0.0009801949,0.76610035,0.0011659586,0.001086296,0.0010776479,0.00017834804,0.0006053364,0.04994636],"genre_scores_gemma":[0.9010244,0.00063265406,0.09674455,0.00025796134,0.00008321836,0.000008885529,0.000036999798,0.00007900883,0.0011323475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99538285,0.00036389878,0.00056088704,0.0013515218,0.0010855778,0.0012552754],"domain_scores_gemma":[0.99435747,0.000691134,0.0006028696,0.0033973027,0.000224532,0.00072669296],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00083376747,0.0005980357,0.0007519141,0.0023244794,0.0016210094,0.00033938032,0.006744196,0.00017658627,0.000022550892],"category_scores_gemma":[0.0002514232,0.000633027,0.0007016786,0.0009461278,0.0012960774,0.0029983579,0.0014882985,0.0008562878,0.00006975537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003053395,0.00012565796,0.005667214,0.00006260548,0.00034201873,0.0005770233,0.0024584502,0.00013918732,0.014281499,0.9642798,0.0012747146,0.010486525],"study_design_scores_gemma":[0.0020349263,0.00035896833,0.030248083,0.00020212593,0.000061637125,0.000035387056,0.0006374178,0.00065836054,0.002532483,0.95763797,0.0048042512,0.0007883738],"about_ca_topic_score_codex":0.0009083221,"about_ca_topic_score_gemma":0.0002519936,"teacher_disagreement_score":0.72216487,"about_ca_system_score_codex":0.000080981605,"about_ca_system_score_gemma":0.00034531154,"threshold_uncertainty_score":0.99967873},"labels":[],"label_agreement":null},{"id":"W2900191601","doi":"10.48550/arxiv.1811.04338","title":"Constructing Geometric Graphs of Cop Number Three","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Computer science","score_opus":0.08510392450003246,"score_gpt":0.23075890539610663,"score_spread":0.14565498089607418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900191601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41168272,0.00003685296,0.5794773,0.000014440812,0.00041853133,0.00021759418,0.000018830426,0.00013881343,0.007994904],"genre_scores_gemma":[0.98731804,0.000069312686,0.012151582,0.000014627067,0.000040789502,7.548225e-7,0.0000060561606,0.000020932193,0.0003779289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975939,0.00017986527,0.00028879926,0.0011821524,0.0002223756,0.00053290353],"domain_scores_gemma":[0.99648106,0.0004105158,0.00044470362,0.001886554,0.000576185,0.00020096752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005778656,0.00031703408,0.00047322828,0.0009926965,0.00015573067,0.0000697284,0.0032874974,0.00028888602,0.00014085895],"category_scores_gemma":[0.00017438231,0.00036821628,0.00029526357,0.0035955985,0.0008096799,0.0004274647,0.004223528,0.0007340798,0.00015152596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003537248,0.00006258448,0.09215668,0.000112735754,0.00014010427,0.00011341592,0.00005930345,0.003284515,0.00002636642,0.9011282,0.0001265608,0.0027541707],"study_design_scores_gemma":[0.0005513039,0.00007541009,0.0023386723,0.00012629635,0.000041176918,0.000021870477,0.00009364177,0.05302978,0.0014396685,0.94166625,0.00008977215,0.0005261625],"about_ca_topic_score_codex":0.000092196795,"about_ca_topic_score_gemma":0.000033201646,"teacher_disagreement_score":0.5756353,"about_ca_system_score_codex":0.00016820362,"about_ca_system_score_gemma":0.00022662098,"threshold_uncertainty_score":0.999877},"labels":[],"label_agreement":null},{"id":"W2900469667","doi":"10.1007/978-3-030-04618-7_1","title":"Minimum Diameter k-Steiner Forest","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Steiner tree problem; Combinatorics; Approximation algorithm; Undirected graph; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Minimum spanning tree; Discrete mathematics; Computer science; Telecommunications","score_opus":0.02307190990746621,"score_gpt":0.2786902830341342,"score_spread":0.25561837312666796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900469667","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021256054,0.00034279324,0.98863643,0.0005698117,0.0019014683,0.0005030879,0.0000062815143,0.00022368871,0.0076038856],"genre_scores_gemma":[0.08242271,0.000056959136,0.90742236,0.002642659,0.001643589,0.00003584151,0.000008339318,0.00012910922,0.005638413],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941466,0.00006688019,0.00059059326,0.0023133093,0.0016157898,0.0012668647],"domain_scores_gemma":[0.99508697,0.0009026634,0.00026837827,0.002920309,0.00047881433,0.00034285913],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013496297,0.00070358353,0.0006380936,0.0015116795,0.0003216908,0.0006706229,0.0067945244,0.00040314638,0.00013497264],"category_scores_gemma":[0.0002298106,0.00060848537,0.00022087965,0.0010743594,0.0023975829,0.0010229407,0.0032797914,0.0010714981,0.00046529004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036555342,0.000081284394,0.00027465328,0.000090433285,0.00004291956,0.0004321337,0.001581547,0.009184616,0.0006112057,0.13239194,0.00039845574,0.85487425],"study_design_scores_gemma":[0.0003241007,0.00040854252,0.00008602908,0.00028592272,0.0000055196506,0.00008499116,1.2395847e-7,0.1778501,0.0014563522,0.81203306,0.006570823,0.00089444144],"about_ca_topic_score_codex":0.00000719391,"about_ca_topic_score_gemma":0.00010726265,"teacher_disagreement_score":0.8539798,"about_ca_system_score_codex":0.00029353108,"about_ca_system_score_gemma":0.000510888,"threshold_uncertainty_score":0.99963665},"labels":[],"label_agreement":null},{"id":"W2900649734","doi":"10.1016/j.jda.2018.11.013","title":"Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction","year":2018,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Compaction; Vertex (graph theory); Mathematical proof; Bipartite graph; Vertex cover; Mathematics; Computational complexity theory; Combinatorics; Computer science; Time complexity; Discrete mathematics; Graph; Algorithm; Geometry; Geology","score_opus":0.07855679433831916,"score_gpt":0.36484302836865035,"score_spread":0.28628623403033115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900649734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11765423,0.000104255814,0.87919044,0.0017336834,0.0006351074,0.00010722079,0.000011214008,0.0000482251,0.00051562884],"genre_scores_gemma":[0.8855678,0.000009535513,0.11382201,0.000057603535,0.0004697936,9.0743043e-7,0.0000064716523,0.000011460348,0.00005444541],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99784946,0.00027341518,0.0005867584,0.00024808812,0.00076696946,0.0002753173],"domain_scores_gemma":[0.99728197,0.00079247606,0.00052360876,0.00026812454,0.0008570186,0.00027678022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011280936,0.00016111242,0.00029530065,0.00041217342,0.0005100859,0.00020195723,0.00047092605,0.00009513235,0.000026245445],"category_scores_gemma":[0.0003188073,0.00014295238,0.00010379296,0.0006901513,0.00045050602,0.0020426968,0.00009731769,0.0006255083,0.000028778119],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043491067,0.0003446587,0.5392583,0.000088937224,0.0005903768,0.000067965615,0.0032760473,0.002609238,0.0005502099,0.35757074,0.011246719,0.08396193],"study_design_scores_gemma":[0.0006491966,0.0004488517,0.6083938,0.00003881334,0.000019299641,0.0003222918,0.000089072404,0.030266479,0.00019221017,0.35853252,0.0008920493,0.00015543356],"about_ca_topic_score_codex":0.000015506095,"about_ca_topic_score_gemma":0.000004432991,"teacher_disagreement_score":0.7679135,"about_ca_system_score_codex":0.00013786939,"about_ca_system_score_gemma":0.00011546899,"threshold_uncertainty_score":0.5829429},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2902878758","doi":"10.1145/3292048.3292050","title":"Constraint satisfaction problems","year":2018,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Constraint satisfaction problem; Constraint (computer-aided design); Constraint satisfaction dual problem; Complexity of constraint satisfaction; Constraint satisfaction; Backtracking; Mathematics; Combinatorics; Computer science; Mathematical economics; Local consistency; Mathematical optimization; Statistics; Geometry","score_opus":0.03928523442880928,"score_gpt":0.31140997275033805,"score_spread":0.2721247383215288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902878758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084311165,0.00006276434,0.8949433,0.0024074132,0.00071672135,0.00046030132,0.0000028634956,0.00046722952,0.016628264],"genre_scores_gemma":[0.9334118,0.000015573183,0.065623455,0.00043424597,0.00014594791,0.00002322839,8.7372655e-7,0.000008808219,0.0003361059],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879587,0.000092125076,0.00015789215,0.00036334057,0.00024277908,0.00034802427],"domain_scores_gemma":[0.9984637,0.00017686037,0.00005628331,0.0010768194,0.00011805773,0.00010831399],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027658802,0.000103945844,0.0001057197,0.000102479346,0.00016031267,0.00009105139,0.0009956501,0.0000545143,0.00018202442],"category_scores_gemma":[0.00031707025,0.000092088514,0.000040641964,0.00041942412,0.00029511037,0.0004673741,0.0004500354,0.00014978743,0.0010173853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011320794,0.000030470881,0.0126712965,0.000009951042,0.00001951879,0.000012412491,0.00071850704,0.000020679658,0.026729813,0.29677945,0.0038892683,0.6591073],"study_design_scores_gemma":[0.00065523176,0.00059533026,0.019212903,0.000028291017,0.000003863312,0.000089668494,0.00009684753,0.002309977,0.014909553,0.9072732,0.054429553,0.00039559108],"about_ca_topic_score_codex":0.00007495879,"about_ca_topic_score_gemma":0.00017074817,"teacher_disagreement_score":0.8491006,"about_ca_system_score_codex":0.00004029851,"about_ca_system_score_gemma":0.000059255348,"threshold_uncertainty_score":0.99976045},"labels":[],"label_agreement":null},{"id":"W2903198428","doi":"10.1002/jgt.22433","title":"On ‐connected graphs","year":2018,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"3v Geomatics (Canada)","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Connectivity; Discrete mathematics; Conjecture; Strongly connected component; 1-planar graph; Graph; Chordal graph","score_opus":0.01663824849721421,"score_gpt":0.29265974451295196,"score_spread":0.2760214960157378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903198428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37002552,0.0004552926,0.6150367,0.0006329631,0.0015307044,0.00014747046,0.0000021074966,0.00010856087,0.012060657],"genre_scores_gemma":[0.9901895,0.00004152957,0.008747321,0.00063429005,0.00016846164,0.0000017519814,1.4464351e-7,0.000016744547,0.00020024602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780035,0.0005454527,0.00042013562,0.00023122816,0.00061839796,0.0003844116],"domain_scores_gemma":[0.9972329,0.00093790743,0.00034782325,0.0006510378,0.000608815,0.000221513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025480762,0.00016373486,0.0002588844,0.0010360575,0.00020794748,0.00008828327,0.001768701,0.00006933526,0.00012079392],"category_scores_gemma":[0.0005913825,0.00012245389,0.00027191016,0.0013269315,0.0004608146,0.00061304343,0.00014285075,0.00045625956,0.00008989453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029615228,0.00009141518,0.00007219819,0.00000336047,0.00006473672,0.00006599722,0.00031159725,0.000009895034,0.0033805794,0.9786029,0.001041869,0.016059307],"study_design_scores_gemma":[0.00057121465,0.001417729,0.00069237244,0.00005057817,0.000007356893,0.00017411026,0.000050332972,0.00007471914,0.010497827,0.98542565,0.00089953805,0.00013859574],"about_ca_topic_score_codex":4.2063863e-7,"about_ca_topic_score_gemma":9.249147e-7,"teacher_disagreement_score":0.620164,"about_ca_system_score_codex":0.000028730266,"about_ca_system_score_gemma":0.00007921043,"threshold_uncertainty_score":0.49935248},"labels":[],"label_agreement":null},{"id":"W2903896173","doi":"10.1137/18m1214196","title":"Corrigendum: Orthogonal Tree Decompositions of Graphs","year":2018,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Fédération Wallonie-Bruxelles","keywords":"Mathematics; Combinatorics; Tree (set theory); Discrete mathematics","score_opus":0.03365558894771017,"score_gpt":0.31765133029219844,"score_spread":0.2839957413444883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903896173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004485221,0.0012289424,0.7787273,0.0007547859,0.029033167,0.0007457811,0.00024346811,0.00020294664,0.18861511],"genre_scores_gemma":[0.0056110304,0.0030995952,0.7416707,0.00055037776,0.0037900368,0.0000854193,0.00024152487,0.00050375075,0.24444754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952557,0.0002844084,0.0012851289,0.0005296249,0.0018742618,0.0007708724],"domain_scores_gemma":[0.9954578,0.00033695175,0.0014957876,0.0015688254,0.000688554,0.00045205778],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012117595,0.0005851696,0.0009667077,0.0010642232,0.0004663561,0.00034118176,0.0035141087,0.0004059235,0.00026667773],"category_scores_gemma":[0.00027544855,0.00046066547,0.0007617092,0.0009796907,0.00048998324,0.00044207674,0.000536781,0.002308937,0.00017467795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032004875,0.00035349268,0.000008162227,0.0003158271,0.00029998203,0.00017229792,0.00070324115,0.000018034181,0.000141959,0.50507474,0.49076316,0.002117087],"study_design_scores_gemma":[0.00054194574,0.0012664174,0.00005889067,0.002024385,0.00009139085,0.0010305159,0.00012893397,0.0061423425,0.00041290635,0.9436191,0.043940794,0.0007423952],"about_ca_topic_score_codex":6.34869e-7,"about_ca_topic_score_gemma":0.00000858768,"teacher_disagreement_score":0.44682235,"about_ca_system_score_codex":0.00012717587,"about_ca_system_score_gemma":0.00054966274,"threshold_uncertainty_score":0.9999928},"labels":[],"label_agreement":null},{"id":"W2907584067","doi":"10.4230/lipics.isaac.2018.67","title":"Succinct Data Structures for Chordal Graphs","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Chordal graph; Computer science; Interval graph; Theoretical computer science; Graph; 1-planar graph","score_opus":0.04590123781032047,"score_gpt":0.34013356367956615,"score_spread":0.2942323258692457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907584067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044144876,0.000066784174,0.9470496,0.00040256124,0.0014596283,0.0022738092,0.0020199618,0.0003966698,0.002186069],"genre_scores_gemma":[0.631029,0.000034961886,0.364508,0.0015495803,0.00063794595,0.00026396813,0.001484542,0.00009976924,0.0003922052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99611974,0.00006205912,0.0010261404,0.0006778766,0.00074256334,0.0013716446],"domain_scores_gemma":[0.9947093,0.000428997,0.0003958362,0.0034096316,0.00070376095,0.00035248155],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013679987,0.00048827747,0.0005046902,0.00050014164,0.00083654013,0.0006958632,0.0063028615,0.00022505187,0.000042819902],"category_scores_gemma":[0.00042579215,0.00042003402,0.00024484185,0.00072108663,0.00047534684,0.004124384,0.002236145,0.0004231177,0.000110286084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073357753,0.0003467774,0.0043910863,0.00083382614,0.0004962752,0.0000074034037,0.0062612426,0.0000540809,0.0003833162,0.84390324,0.043265697,0.099323496],"study_design_scores_gemma":[0.0077810828,0.0017880924,0.0019135796,0.00013353146,0.000065104614,0.00015091833,0.0008132577,0.21754622,0.006908959,0.31740987,0.44383082,0.0016585768],"about_ca_topic_score_codex":0.000010640536,"about_ca_topic_score_gemma":0.00003784627,"teacher_disagreement_score":0.58688414,"about_ca_system_score_codex":0.00008293794,"about_ca_system_score_gemma":0.00015280352,"threshold_uncertainty_score":0.9998251},"labels":[],"label_agreement":null},{"id":"W2908576804","doi":"10.1016/j.dam.2018.12.012","title":"On directed covering and domination problems","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Dominating set; Directed acyclic graph; Directed graph; Mathematics; Edge cover; Vertex cover; Vertex (graph theory); Feedback arc set; Time complexity; Maximal independent set; Feedback vertex set; Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.011021755888656545,"score_gpt":0.25314728609802806,"score_spread":0.2421255302093715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908576804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30046758,0.000022159898,0.6557286,0.00009155247,0.000060552586,0.0008501338,0.0000024526828,0.00031789823,0.042459093],"genre_scores_gemma":[0.89357936,0.00001129947,0.10593204,0.00004792015,0.000008261377,0.000055847864,0.0000029275573,0.000018589359,0.00034374793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903584,0.000012381856,0.00016210783,0.0002809906,0.000290676,0.00021799559],"domain_scores_gemma":[0.99906826,0.0002843828,0.00007929046,0.0004801292,0.000028938015,0.00005899377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027269174,0.00012249514,0.00015927825,0.000096579744,0.00006154977,0.00010696677,0.0003471426,0.000040125862,0.000014318309],"category_scores_gemma":[0.000036953694,0.00010218623,0.00002269121,0.00024957815,0.00003820525,0.00017167143,0.00020780561,0.0001195825,0.00013882291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005910094,0.00002616501,0.000010359066,0.000115052986,0.000008185109,6.9316127e-7,0.0010950378,0.0002695076,0.015075193,0.97987145,0.000016673323,0.0035057592],"study_design_scores_gemma":[0.0005741209,0.00007840692,0.000121872254,0.00007447782,0.000003755953,0.0000048609445,0.00011116642,0.13733003,0.00882548,0.85245854,0.00018437686,0.00023290825],"about_ca_topic_score_codex":3.9904128e-7,"about_ca_topic_score_gemma":4.6102173e-7,"teacher_disagreement_score":0.5931118,"about_ca_system_score_codex":0.000023763938,"about_ca_system_score_gemma":0.000010099554,"threshold_uncertainty_score":0.41670337},"labels":[],"label_agreement":null},{"id":"W2908748734","doi":"10.48550/arxiv.1901.05594","title":"Queue Layouts of Graphs with Bounded Degree and Bounded Genus","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Bounded function; Genus; Degree (music); Queue; Combinatorics; Mathematics; Discrete mathematics; Computer science; Physics; Computer network; Zoology; Mathematical analysis; Biology","score_opus":0.08479349942993968,"score_gpt":0.20993539323869792,"score_spread":0.12514189380875823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908748734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6834197,0.00022391007,0.31293324,0.000037509373,0.00016508717,0.00047740524,0.000019068304,0.00012584431,0.0025982088],"genre_scores_gemma":[0.99259794,0.00018434461,0.005991898,0.00003264942,0.000013809855,0.0000012898595,0.000007023219,0.000026347974,0.0011446964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758947,0.00021724269,0.00020545337,0.0012809902,0.000214309,0.0004925208],"domain_scores_gemma":[0.99707365,0.00020344173,0.00030855855,0.0018848319,0.00031258972,0.00021693118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028696825,0.00036645698,0.00050417456,0.0005531733,0.00014971421,0.00012898039,0.0020623805,0.00026292045,0.000011463844],"category_scores_gemma":[0.00003137796,0.00036897184,0.0001486096,0.0009125471,0.00061050156,0.00048579008,0.0023868608,0.00069236936,0.000021805045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023198502,0.00009675985,0.013210043,0.0002361762,0.00022313853,0.00032067054,0.00042816493,0.010798561,0.000106059146,0.9734243,0.000026806863,0.0008972893],"study_design_scores_gemma":[0.001953008,0.0004406131,0.0067403945,0.0002767094,0.00009696833,0.000037195587,0.00021866614,0.07394726,0.0010595607,0.9139101,0.0003516918,0.00096784456],"about_ca_topic_score_codex":0.00018231582,"about_ca_topic_score_gemma":0.000121436104,"teacher_disagreement_score":0.3091782,"about_ca_system_score_codex":0.00011223171,"about_ca_system_score_gemma":0.00037701923,"threshold_uncertainty_score":0.9998762},"labels":[],"label_agreement":null},{"id":"W2908903570","doi":"10.1007/s00236-021-00411-z","title":"On Huang and Wong’s algorithm for generalized binary split trees","year":2022,"lang":"en","type":"preprint","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Hong Kong University of Science and Technology; University of Waterloo; Research Grants Council, University Grants Committee; National Science Foundation","keywords":"Algorithm; Mathematics; Binary number; Dynamic programming; Property (philosophy); Time complexity; Optimal binary search tree; Binary tree; Computer science; Tree structure; Interval tree","score_opus":0.02943207565423358,"score_gpt":0.31377478604262427,"score_spread":0.2843427103883907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908903570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0388743,0.00043335086,0.9382555,0.002932037,0.0014795589,0.0037267252,0.00038516443,0.00066768617,0.013245687],"genre_scores_gemma":[0.026334902,0.00035424094,0.9666672,0.0017956417,0.0001400492,0.0019636254,0.00028505412,0.000067302455,0.0023919814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788314,0.00009762428,0.000483704,0.00043860154,0.00057207525,0.0005248668],"domain_scores_gemma":[0.9975522,0.0006168978,0.00023836775,0.0013311711,0.00008725964,0.00017407766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007593385,0.000320856,0.00041005155,0.00043521912,0.0003412148,0.00036337567,0.0019226084,0.0001484724,0.00010847311],"category_scores_gemma":[0.00015965373,0.0002950059,0.00016193937,0.00026388216,0.00011127202,0.0006938629,0.004229287,0.00071713753,0.000019048948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010967611,0.00013691507,0.000011122721,0.0006351577,0.00019918964,0.000024597293,0.003994562,0.0015444861,0.00006536029,0.41331008,0.011267944,0.5687009],"study_design_scores_gemma":[0.0009789303,0.0004866908,0.00018807873,0.00009213983,0.000020576927,0.000017246113,0.00015790734,0.70575744,0.00013706178,0.25460994,0.03696222,0.00059174007],"about_ca_topic_score_codex":0.000008644566,"about_ca_topic_score_gemma":0.0000011120135,"teacher_disagreement_score":0.70421296,"about_ca_system_score_codex":0.00011130717,"about_ca_system_score_gemma":0.0001483019,"threshold_uncertainty_score":0.99995023},"labels":[],"label_agreement":null},{"id":"W2911847656","doi":"10.1016/j.dam.2020.01.032","title":"Eternal domination on prisms of graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Université de Montréal; Dawson College; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Université de Montréal","keywords":"Combinatorics; Conjecture; Mathematics; Vertex (graph theory); Graph; Domination analysis; Guard (computer science); Dominating set; Clique; Discrete mathematics; Computer science","score_opus":0.03574876745790401,"score_gpt":0.30939730151531986,"score_spread":0.27364853405741585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911847656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010179969,0.000029614475,0.96918297,0.00032146336,0.00015739356,0.00092606863,0.000030673295,0.00017992129,0.018991949],"genre_scores_gemma":[0.57151794,0.00003413929,0.42805755,0.00008008674,0.00003999439,0.00015212696,0.000025322148,0.000044416876,0.000048440594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973523,0.000044670454,0.00063409907,0.0006716799,0.0009713674,0.00032587055],"domain_scores_gemma":[0.99729204,0.0003363048,0.00063296047,0.0014876205,0.00010847249,0.00014259279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049699686,0.00035999937,0.00059240137,0.0002766502,0.00006432313,0.000121111625,0.0023026378,0.00021339029,0.000012585344],"category_scores_gemma":[0.000102308135,0.0003196316,0.00022774257,0.00038215372,0.00015269131,0.00008688442,0.0019708236,0.0007832527,0.000060719754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024274259,0.000089199595,0.0000022675372,0.0006930405,0.00005942546,0.000006408474,0.0018300028,0.0004661593,0.005212545,0.9870651,0.000079234866,0.0044723395],"study_design_scores_gemma":[0.00027841754,0.00007448332,0.0000315671,0.00018331682,0.000018302242,0.0000019619783,0.00007874012,0.027212802,0.029663846,0.94212484,0.000043943088,0.00028778642],"about_ca_topic_score_codex":0.0000013135831,"about_ca_topic_score_gemma":3.6514157e-7,"teacher_disagreement_score":0.56133795,"about_ca_system_score_codex":0.00004761656,"about_ca_system_score_gemma":0.000082590755,"threshold_uncertainty_score":0.99992555},"labels":[],"label_agreement":null},{"id":"W2911859454","doi":"10.1002/net.21975","title":"The firebreak problem","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Memorial University of Newfoundland","funders":"Biotechnology and Biological Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Vertex (graph theory); Time complexity; Focus (optics); Class (philosophy); Graph; Metric dimension","score_opus":0.018747197674953257,"score_gpt":0.256820096351612,"score_spread":0.23807289867665876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911859454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018352477,0.0007632422,0.9781638,0.011976849,0.000118433265,0.00015896019,1.8365472e-7,0.00019522232,0.0084397765],"genre_scores_gemma":[0.97488475,0.0001811216,0.020680062,0.003090836,0.0004700075,0.000045732497,9.2151106e-7,0.000016977017,0.000629621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911004,0.0000777832,0.00009661053,0.00021677373,0.00018390699,0.00031489457],"domain_scores_gemma":[0.9992091,0.00023764266,0.00002826236,0.00036587258,0.000037993927,0.00012115105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024098251,0.00006597311,0.000060603044,0.000008393445,0.00026128147,0.00014924446,0.0012147351,0.00003122617,0.000006982306],"category_scores_gemma":[0.0000345428,0.000042839056,0.00003725741,0.00047808103,0.00007042225,0.00016729989,0.0003690921,0.0002429329,0.000073809104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001700326,0.000008315811,0.0002410599,0.0000033618433,0.0000122956935,0.0000133446465,0.00030136105,0.01513858,0.0000281846,0.5630807,0.020614173,0.4005416],"study_design_scores_gemma":[0.00013977209,0.00007454614,0.0002259386,0.000005336915,9.75499e-7,0.0000043046325,0.000012446891,0.7770358,0.000049978793,0.059570994,0.16277702,0.00010289115],"about_ca_topic_score_codex":0.0000010734357,"about_ca_topic_score_gemma":0.0000023699206,"teacher_disagreement_score":0.9747012,"about_ca_system_score_codex":0.0000088132665,"about_ca_system_score_gemma":0.000019637895,"threshold_uncertainty_score":0.22573002},"labels":[],"label_agreement":null},{"id":"W2913253550","doi":"10.1002/jgt.22452","title":"On the clique number of the square of a line graph and its relation to maximum degree of the line graph","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Line graph; Perfect graph; Discrete mathematics; Graph; Conjecture; Block graph; Clique number; Cubic graph; Split graph; Clique graph; Graph power; Voltage graph; Pathwidth","score_opus":0.025816731673697267,"score_gpt":0.2940536123934432,"score_spread":0.26823688071974594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913253550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9819903,0.000499392,0.01419345,0.0018021616,0.00030559488,0.0005708235,0.000016660284,0.000008200975,0.0006134253],"genre_scores_gemma":[0.99862367,0.0001307973,0.0008014441,0.00028838136,0.000031949,0.0000047926824,2.495302e-7,0.000014534177,0.00010418084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656147,0.0011969447,0.00080988865,0.00023366431,0.00092710555,0.00027090684],"domain_scores_gemma":[0.99527055,0.0018197233,0.0011176292,0.0009585673,0.00073433376,0.0000991746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003963013,0.00020521494,0.0004161052,0.00033315914,0.0001405999,0.000023212397,0.001992078,0.00011310471,0.0000437263],"category_scores_gemma":[0.0006807328,0.00009151513,0.000503124,0.001922663,0.00032666262,0.0003022864,0.00043459176,0.00072553253,0.000003357003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007945628,0.0002133822,0.010441961,0.0000873696,0.00016036925,0.0000030383244,0.0013540966,0.0014505212,0.021615854,0.9590884,0.000092315684,0.0046981405],"study_design_scores_gemma":[0.00062252703,0.00062722416,0.03106878,0.0004689719,0.000032885655,0.00006570856,0.0002034553,0.0002197821,0.028312331,0.93819976,0.000058027777,0.00012054501],"about_ca_topic_score_codex":0.0000038771045,"about_ca_topic_score_gemma":0.000008389451,"teacher_disagreement_score":0.020888627,"about_ca_system_score_codex":0.000019649475,"about_ca_system_score_gemma":0.000089684996,"threshold_uncertainty_score":0.37318787},"labels":[],"label_agreement":null},{"id":"W2913349045","doi":"10.1002/net.21873","title":"The Firefighter problem: Saving sets of vertices on cubic graphs","year":2019,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Saskatchewan","funders":"","keywords":"Combinatorics; Vertex (graph theory); Degree (music); Graph; Mathematics; Context (archaeology); Computer science; Independent set; Set (abstract data type); Discrete mathematics; Physics; Geography","score_opus":0.012337062270861938,"score_gpt":0.2658854493953632,"score_spread":0.25354838712450123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913349045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85109764,0.0039000125,0.0935903,0.0020157057,0.0021189216,0.0016895885,0.0000024498586,0.00037759313,0.04520778],"genre_scores_gemma":[0.99741256,0.000086128224,0.0019097677,0.00013857461,0.000025146708,0.000016052938,6.42248e-7,0.000009956705,0.00040117346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871373,0.00012719154,0.00017480015,0.00027345878,0.00032733096,0.00038346986],"domain_scores_gemma":[0.99840295,0.0006218353,0.000084038584,0.00077204884,0.00006378719,0.000055352994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051330216,0.00010263306,0.00012155898,0.000058345482,0.0001500987,0.00008268799,0.0011115907,0.000054574375,0.000016219272],"category_scores_gemma":[0.000017235767,0.00006499812,0.00006804811,0.0004690013,0.00008511321,0.00024692353,0.0002482249,0.00026233695,0.000061165505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011893287,0.000087795415,0.009959433,0.000040836032,0.000065161395,0.000007978793,0.00054986187,0.03465993,0.0007992477,0.69945306,0.00238839,0.2518694],"study_design_scores_gemma":[0.0010987447,0.0009402641,0.019737922,0.00040113446,0.000011648702,0.000011266527,0.00005644174,0.5325823,0.0023442572,0.42228943,0.019949805,0.0005768357],"about_ca_topic_score_codex":0.000004396834,"about_ca_topic_score_gemma":0.000009663016,"teacher_disagreement_score":0.49792233,"about_ca_system_score_codex":0.0000156224,"about_ca_system_score_gemma":0.000018858063,"threshold_uncertainty_score":0.26505467},"labels":[],"label_agreement":null},{"id":"W2913482449","doi":"10.1145/3568025","title":"Canonisation and Definability for Graphs of Bounded Rank Width","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bounded function; Mathematics; Rank (graph theory); Treewidth; Discrete mathematics; Combinatorics; Pathwidth; Graph; Mathematical analysis","score_opus":0.042091926921377934,"score_gpt":0.3101518114053621,"score_spread":0.26805988448398416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913482449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03861103,0.00004367337,0.9588314,0.001805165,0.00011325236,0.00041210023,0.000067843,0.00005819547,0.000057299254],"genre_scores_gemma":[0.7943814,0.0000035161954,0.20522252,0.00016786488,0.0000029272476,0.00017744805,0.00001418659,0.0000052100636,0.000024978086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987595,0.00016552981,0.00021362746,0.00033627363,0.00036122955,0.00016384502],"domain_scores_gemma":[0.9981872,0.00118783,0.00007717735,0.00034196812,0.00015665947,0.00004919691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048326823,0.00009354637,0.00013133402,0.00023039049,0.0006168976,0.00002887676,0.00047795012,0.000022905466,0.000034501783],"category_scores_gemma":[0.000057865454,0.00009875107,0.000085328924,0.00052431703,0.00013728917,0.00018963298,0.00003272498,0.00015113708,0.0000010796324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013775504,0.00023612838,0.00014547285,0.000027413704,0.000029016095,9.536757e-7,0.00026324776,0.3162593,0.00016468167,0.6445958,0.000015392596,0.03812485],"study_design_scores_gemma":[0.0005981163,0.00042675834,0.0027409443,0.0000019453812,0.0000060210355,0.000014534581,0.000042036532,0.046230704,0.00020895913,0.9494697,0.00016886099,0.000091453985],"about_ca_topic_score_codex":0.000015683107,"about_ca_topic_score_gemma":0.0000074206223,"teacher_disagreement_score":0.7557703,"about_ca_system_score_codex":0.000082298735,"about_ca_system_score_gemma":0.00014552544,"threshold_uncertainty_score":0.47447398},"labels":[],"label_agreement":null},{"id":"W2913508203","doi":"10.1016/j.jctb.2016.04.002","title":"Disjoint dijoins","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Digraph; Disjoint sets; Combinatorics; Conjecture; Pairwise comparison; Partition (number theory); Mathematics; Directed graph; Discrete mathematics","score_opus":0.012839882021510558,"score_gpt":0.26601016317363857,"score_spread":0.25317028115212803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913508203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07528315,0.00051828957,0.8942166,0.005867018,0.015777906,0.00022839733,0.0000053976964,0.00014152803,0.0079617435],"genre_scores_gemma":[0.9932199,0.00012181995,0.0048480933,0.00006549745,0.0005992406,0.0000029387027,7.287512e-8,0.000017676364,0.0011247246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978816,0.000476895,0.0004962085,0.00017973328,0.00061423244,0.00035133486],"domain_scores_gemma":[0.9976515,0.00074789673,0.0003793058,0.00055893546,0.00043801553,0.0002243273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021912884,0.00015690002,0.000317493,0.00021927869,0.00012993143,0.00010028991,0.0015508399,0.000065573055,0.000098311684],"category_scores_gemma":[0.00092637225,0.000091378446,0.00020036047,0.00036657182,0.00027650953,0.0022039078,0.0003429398,0.00023177011,0.00003624075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043610652,0.00007227324,0.00008368243,0.000004013163,0.000038465703,0.000070294576,0.00016837547,0.0000015935448,0.0078170225,0.97212243,0.00036428866,0.018821431],"study_design_scores_gemma":[0.0011586172,0.0007718283,0.00016995757,0.00005752492,0.0000052515215,0.00018948968,0.00004303788,0.0000020716623,0.022489255,0.94909245,0.025884874,0.00013566417],"about_ca_topic_score_codex":2.3154337e-7,"about_ca_topic_score_gemma":1.701962e-7,"teacher_disagreement_score":0.9179368,"about_ca_system_score_codex":0.00009545438,"about_ca_system_score_gemma":0.00016708317,"threshold_uncertainty_score":0.37263048},"labels":[],"label_agreement":null},{"id":"W2913787130","doi":"10.4230/lipics.ipec.2019.24","title":"Beating Treewidth for Average-Case Subgraph Isomorphism","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Omega; Hypercube; Exponential time hypothesis; Mathematics; Upper and lower bounds; Isomorphism (crystallography); Graph; Discrete mathematics; Physics; Crystallography; Quantum mechanics; Crystal structure","score_opus":0.09811442029294663,"score_gpt":0.22551002333335302,"score_spread":0.12739560304040637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913787130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13747334,0.000085500134,0.8590794,0.00008738678,0.0006127403,0.0010527063,0.00006949262,0.00029926308,0.0012401269],"genre_scores_gemma":[0.9794564,0.00007056792,0.015478494,0.00009949023,0.00008767599,0.0000075415496,0.000027429125,0.000046030564,0.004726352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967824,0.0002340204,0.00027719265,0.0017815621,0.00015368116,0.0007711021],"domain_scores_gemma":[0.9960862,0.00070758484,0.00032692353,0.0022716697,0.00033829882,0.00026937196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063841604,0.00045532105,0.00051025656,0.0006559038,0.00037211482,0.00019275473,0.002705004,0.00035099522,0.0000334169],"category_scores_gemma":[0.000117878495,0.00053343887,0.0004962792,0.0009091617,0.00018916189,0.0006222589,0.0027840068,0.00085660856,0.00010917709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013831584,0.00015456993,0.0021711641,0.00031316254,0.00021806815,0.004138709,0.00046783124,0.30635086,0.00014479754,0.68227935,0.00048540405,0.0031377645],"study_design_scores_gemma":[0.0011914612,0.00015813444,0.000086278524,0.000101295635,0.000048745656,0.00012308419,0.000086730026,0.6805933,0.0003465802,0.3156807,0.00085775496,0.00072591053],"about_ca_topic_score_codex":0.00006635289,"about_ca_topic_score_gemma":0.000023491899,"teacher_disagreement_score":0.8436009,"about_ca_system_score_codex":0.00021775444,"about_ca_system_score_gemma":0.00024303111,"threshold_uncertainty_score":0.9997117},"labels":[],"label_agreement":null},{"id":"W2913919914","doi":"10.1007/3-540-36478-1_5","title":"Connected Matchings","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Bipartite graph; Combinatorics; Chordal graph; Matching (statistics); Conjecture; Strong perfect graph theorem; Computer science; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Mathematics; 1-planar graph; Artificial intelligence","score_opus":0.018426466080599356,"score_gpt":0.2718294186126292,"score_spread":0.2534029525320299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913919914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060609007,0.0004609036,0.9860639,0.001031678,0.0013381895,0.00043961886,0.000004078117,0.00027296357,0.010328055],"genre_scores_gemma":[0.040757477,0.000094036295,0.9504874,0.0057037356,0.0003434285,0.000022836497,0.0000061905757,0.000107833985,0.0024770654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99483544,0.00008317207,0.0005236324,0.0020222398,0.0014480496,0.0010874445],"domain_scores_gemma":[0.99605334,0.00084560656,0.00025170448,0.0021877694,0.00036484346,0.0002967288],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013940576,0.0006208141,0.00060229277,0.0013175728,0.000353446,0.0006032265,0.005383205,0.00035061085,0.00006649008],"category_scores_gemma":[0.00024424033,0.0005795294,0.00016081723,0.0012150486,0.0011836976,0.0008627123,0.0016526264,0.0014209929,0.00015242562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009341768,0.00003381321,0.000031063013,0.000040931627,0.000016559188,0.0002692782,0.00058017095,0.0089050885,0.0004334283,0.5047911,0.00007243248,0.48481682],"study_design_scores_gemma":[0.00027987818,0.00014068952,0.000025108397,0.00020329434,0.0000033269005,0.00014755687,9.487751e-8,0.070973165,0.0019669454,0.9201951,0.005313026,0.00075180485],"about_ca_topic_score_codex":0.000007847268,"about_ca_topic_score_gemma":0.000022277245,"teacher_disagreement_score":0.48406503,"about_ca_system_score_codex":0.00034478426,"about_ca_system_score_gemma":0.00048756076,"threshold_uncertainty_score":0.99999815},"labels":[],"label_agreement":null},{"id":"W2914039150","doi":"10.1016/j.jcss.2011.09.006","title":"Enumerating homomorphisms","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Hungarian Scientific Research Fund; Fonds National de la Recherche Luxembourg","keywords":"Homomorphism; Decision problem; Constraint satisfaction problem; Mathematics; Enumeration; Characterization (materials science); Discrete mathematics; Constraint (computer-aided design); Graph; Time complexity; Computer science; Combinatorics; Algorithm","score_opus":0.055889408027295244,"score_gpt":0.27907293644530284,"score_spread":0.2231835284180076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914039150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071432814,0.0005440849,0.9232797,0.00006220134,0.0007068282,0.00004883662,1.8529721e-7,0.000024591869,0.003900758],"genre_scores_gemma":[0.79382473,0.000009858296,0.20601143,0.00003431453,0.0001056762,4.9332226e-7,7.884414e-9,0.0000018782008,0.000011609215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865067,0.0001543207,0.00035681567,0.00017109848,0.0004567784,0.00021029412],"domain_scores_gemma":[0.9991724,0.00012337124,0.00025490083,0.00015035001,0.00016865718,0.0001303084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017123794,0.00008300616,0.00020126159,0.00025022263,0.000258184,0.00021428365,0.0010605495,0.00002261655,0.0000030144467],"category_scores_gemma":[0.0000115052735,0.00005566722,0.000058835056,0.00041640495,0.00019865211,0.0010121316,0.00019582824,0.00011968951,0.0000043476566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010793413,0.00004313541,0.0024985564,0.0000462615,0.000026890108,0.00020186442,0.0036895766,0.00015404323,0.00030843032,0.9029696,0.0001290222,0.0899218],"study_design_scores_gemma":[0.003129162,0.009249443,0.036704678,0.001801994,0.000044210054,0.02691229,0.004686412,0.69670343,0.009539655,0.20778698,0.0018874625,0.0015542601],"about_ca_topic_score_codex":0.0000028539287,"about_ca_topic_score_gemma":2.45731e-7,"teacher_disagreement_score":0.7223919,"about_ca_system_score_codex":0.0000144863925,"about_ca_system_score_gemma":0.00007343997,"threshold_uncertainty_score":0.22700433},"labels":[],"label_agreement":null},{"id":"W2914225674","doi":"10.1007/978-3-662-59204-5_12","title":"Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization","year":2019,"lang":"en","type":"book-chapter","venue":"Bolyai Society mathematical studies","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Matroid; Time complexity; Combinatorics; Discrete mathematics","score_opus":0.05040942084495267,"score_gpt":0.3060948645624244,"score_spread":0.25568544371747176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914225674","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037989685,0.008454676,0.9571527,0.00089444814,0.00017279376,0.0011840904,0.000013652367,0.00022524613,0.03186439],"genre_scores_gemma":[0.001267197,0.0551133,0.74321663,0.00087192527,0.00030734844,0.00020997238,0.000060432732,0.00023333028,0.19871986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972653,0.00007637543,0.000511362,0.00085368974,0.000837753,0.00045552666],"domain_scores_gemma":[0.9976602,0.0007531203,0.00030617425,0.0008004429,0.00038229584,0.000097764816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007481554,0.00053353206,0.00097368826,0.000059132635,0.00044071992,0.00017365314,0.0005794169,0.00030266834,0.00006021412],"category_scores_gemma":[0.00019969416,0.00044753886,0.00040284227,0.0001503928,0.0005675401,0.0006034293,0.0008431044,0.0004187477,0.00007618918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019908051,0.00004479297,0.000006645015,0.0006908123,0.0007389162,0.0000038176404,0.0024725155,0.000885011,0.000011654648,0.9916258,0.0029258635,0.0005742555],"study_design_scores_gemma":[0.0014340178,0.00007455058,0.000004934189,0.00036002367,0.00012345966,0.000008698634,0.00021723544,0.017029684,0.0000427884,0.9764315,0.0036984629,0.000574674],"about_ca_topic_score_codex":9.059898e-7,"about_ca_topic_score_gemma":0.0000012824249,"teacher_disagreement_score":0.21393609,"about_ca_system_score_codex":0.00012381507,"about_ca_system_score_gemma":0.00005273092,"threshold_uncertainty_score":0.99979764},"labels":[],"label_agreement":null},{"id":"W2914264140","doi":"","title":"Tree decompositions and linear time algorithms","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tree decomposition; K-ary tree; Mathematics; Combinatorics; Tree (set theory); Tree-depth; Algorithm; Treewidth; Disjoint sets; Modular decomposition; Time complexity; Discrete mathematics; Pathwidth; Computer science; Graph; Chordal graph; Tree structure; 1-planar graph; Line graph; Binary tree","score_opus":0.020676154589276702,"score_gpt":0.3101919391587306,"score_spread":0.2895157845694539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914264140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006059847,0.00019502218,0.96930623,0.00062217907,0.00006256155,0.00008474591,0.0000013199802,0.00016809105,0.023500014],"genre_scores_gemma":[0.1190101,0.000014147414,0.87612,0.000250907,0.00010610873,0.000011426065,0.0000018246612,0.00000815891,0.0044773445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993562,0.000041798317,0.0000687332,0.00013671596,0.00012461406,0.0002719105],"domain_scores_gemma":[0.999411,0.00011507242,0.000011610384,0.00026638797,0.000029437393,0.00016648053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002167444,0.000059152306,0.0000629497,0.000075618336,0.000105391584,0.000035727488,0.0002787709,0.000022556245,0.00009676571],"category_scores_gemma":[0.000013636856,0.000049056333,0.000020612619,0.00021631092,0.000055630622,0.00064614345,0.00022737557,0.0000718349,0.00045422645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062130757,0.00019597715,0.00171915,0.0000059986373,0.000025635118,0.000006771315,0.0005687603,0.000012365274,0.014121973,0.7121509,0.0022312216,0.26895505],"study_design_scores_gemma":[0.0017405755,0.00048657774,0.020935737,0.000029248768,0.000017833912,0.00046689078,0.00011961763,0.6718854,0.062726505,0.20005754,0.04028044,0.0012536636],"about_ca_topic_score_codex":0.000002213205,"about_ca_topic_score_gemma":6.5962536e-7,"teacher_disagreement_score":0.67187303,"about_ca_system_score_codex":0.000007203025,"about_ca_system_score_gemma":0.000008339849,"threshold_uncertainty_score":0.58383137},"labels":[],"label_agreement":null},{"id":"W2914325802","doi":"10.2298/aadm190206002i","title":"Connected domination game: Predomination, Staller-start game, and lexicographic products","year":2022,"lang":"en","type":"preprint","venue":"Applicable Analysis and Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Lexicographical order; Vertex (graph theory); Mathematics; Combinatorics; Mathematical economics; Relation (database); Set (abstract data type); Product (mathematics); Discrete mathematics; Computer science; Graph","score_opus":0.01770118539843372,"score_gpt":0.2830918267864466,"score_spread":0.2653906413880129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914325802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120205685,0.0011674877,0.87509143,0.00071825244,0.00004086142,0.0013958559,0.00007610407,0.00019101628,0.001113302],"genre_scores_gemma":[0.9046842,0.0011716046,0.09192818,0.00005606645,0.000041741438,0.00084514957,0.00026796293,0.000046499616,0.0009586256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963599,0.00022592815,0.000725941,0.0013685146,0.0008610054,0.00045872238],"domain_scores_gemma":[0.9966563,0.00043796693,0.00059754116,0.0017401713,0.0003716348,0.00019636654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014803834,0.00045050634,0.00092760107,0.0011084715,0.00030489324,0.00067231373,0.0010100785,0.00017257524,0.00008227172],"category_scores_gemma":[0.00024336964,0.0004161139,0.00022691056,0.0030416877,0.00029253442,0.00034129922,0.002932241,0.0005924559,0.0000032023693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006719009,0.00069112965,0.0015439974,0.0026265099,0.0039347177,0.000030408084,0.007777607,0.00828806,0.0020144463,0.95876837,0.00037063862,0.013886907],"study_design_scores_gemma":[0.0005974305,0.00010234324,0.0013667187,0.000056851954,0.0009655055,0.000010157177,0.0007090559,0.4247141,0.0007919522,0.56830895,0.0016078977,0.0007690474],"about_ca_topic_score_codex":0.000041714833,"about_ca_topic_score_gemma":0.000030189005,"teacher_disagreement_score":0.7844785,"about_ca_system_score_codex":0.00006497241,"about_ca_system_score_gemma":0.00008913166,"threshold_uncertainty_score":0.99982905},"labels":[],"label_agreement":null},{"id":"W2914843939","doi":"10.1007/978-3-642-02927-1_64","title":"Elimination Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chordal graph; Combinatorics; Indifference graph; Split graph; Pathwidth; Discrete mathematics; Mathematics; Block graph; Clique-sum; 1-planar graph; Graph; Line graph","score_opus":0.019465804196152136,"score_gpt":0.28247516914168813,"score_spread":0.263009364945536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914843939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024848063,0.0004607465,0.9855943,0.0011880499,0.00080552784,0.00038763112,0.000002210506,0.00023519463,0.011301517],"genre_scores_gemma":[0.13973358,0.00019581521,0.85491985,0.0025280183,0.00041481253,0.00001663202,0.000008986742,0.00006381759,0.0021184552],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541134,0.000052350326,0.00045376547,0.0017025908,0.0015315999,0.0008483547],"domain_scores_gemma":[0.9968653,0.00048717807,0.00022729789,0.0018248017,0.000376525,0.0002189508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012695277,0.00050324376,0.00044655704,0.0018837964,0.0003036709,0.00049944996,0.004853226,0.0003067793,0.000021545397],"category_scores_gemma":[0.00014040331,0.00047565516,0.00015904798,0.0012869235,0.00086485915,0.0010143575,0.0011040587,0.0010498973,0.000085697895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033662102,0.000014252952,0.000004736836,0.000008356046,0.0000029378796,0.00005802229,0.00015170679,0.004499427,0.00010210579,0.29410133,0.0000077919585,0.70104593],"study_design_scores_gemma":[0.00016607245,0.00021019157,0.00014433205,0.00015540294,0.0000026609257,0.000052245425,4.5321798e-8,0.1086157,0.0013135463,0.8874951,0.0013488046,0.00049590756],"about_ca_topic_score_codex":0.0000037061775,"about_ca_topic_score_gemma":0.000021131544,"teacher_disagreement_score":0.70055,"about_ca_system_score_codex":0.00029869872,"about_ca_system_score_gemma":0.0003941001,"threshold_uncertainty_score":0.9997695},"labels":[],"label_agreement":null},{"id":"W2914939413","doi":"10.4230/lipics.icalp.2019.91","title":"Toward a Dichotomy for Approximation of $H$-coloring","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Digraph; Combinatorics; Homomorphism; Mathematics; Approximation algorithm; Discrete mathematics; Time complexity; Arc (geometry); Graph","score_opus":0.04762587225070952,"score_gpt":0.31523348949259755,"score_spread":0.26760761724188803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914939413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03807126,0.00008691051,0.95010775,0.00018416479,0.0015632734,0.006583131,0.0009698384,0.00025700993,0.0021766555],"genre_scores_gemma":[0.6375485,0.000078472505,0.35796747,0.00025749116,0.00021619696,0.0023964483,0.0010171789,0.000116262076,0.00040197198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953425,0.000073419375,0.0018594817,0.000667296,0.0009608775,0.0010964217],"domain_scores_gemma":[0.99455553,0.0005798378,0.0014493034,0.0021566595,0.0010326004,0.00022608665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016854659,0.00066664675,0.001093869,0.0008105783,0.00021038142,0.00047687208,0.0037819173,0.00059711235,0.000009044586],"category_scores_gemma":[0.00036102813,0.0006409404,0.00073654094,0.00044215436,0.00018771311,0.0018504557,0.0030650268,0.0010006855,0.000048415444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001908976,0.0018322668,0.005275615,0.067259565,0.002281389,0.000010073655,0.05997079,0.031031927,0.0009491727,0.7227638,0.0050321417,0.101684324],"study_design_scores_gemma":[0.005935453,0.00080677494,0.00028394553,0.001394668,0.000098088836,0.000029000497,0.0009657293,0.8307624,0.010849966,0.12204349,0.025259485,0.0015710068],"about_ca_topic_score_codex":0.0000085343045,"about_ca_topic_score_gemma":0.0000020436955,"teacher_disagreement_score":0.7997305,"about_ca_system_score_codex":0.00027845084,"about_ca_system_score_gemma":0.0003489321,"threshold_uncertainty_score":0.99960417},"labels":[],"label_agreement":null},{"id":"W2915110324","doi":"10.5539/jmr.v11n2p20","title":"Strong Geodetic Number in Some Networks","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Geodetic datum; Mathematics; Geodesic; Combinatorics; Vertex (graph theory); Upper and lower bounds; Graph; Cardinality (data modeling); Discrete mathematics; Geometry; Computer science; Geodesy; Mathematical analysis; Geography","score_opus":0.06925974995608906,"score_gpt":0.40523395817142205,"score_spread":0.33597420821533297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915110324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73130345,0.0006027445,0.26113367,0.0008658582,0.00034829052,0.00045705776,5.322291e-7,0.000020511245,0.005267878],"genre_scores_gemma":[0.9530974,0.00019076679,0.045536898,0.000020197145,0.00011341097,0.0000052603555,1.2361686e-7,0.000021757329,0.0010141614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962138,0.0004294069,0.0006325706,0.00020145735,0.0017911192,0.0007316246],"domain_scores_gemma":[0.9967508,0.0016136478,0.00019987869,0.0006967979,0.0005469433,0.00019195693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008442222,0.00011494193,0.00034672787,0.0006537826,0.00006511511,0.00019614851,0.0021296786,0.000087538574,0.00018070047],"category_scores_gemma":[0.00044783138,0.00009139334,0.00010855657,0.0010448269,0.000111975656,0.0009629254,0.00060150726,0.0014971234,0.00037253415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060344915,0.00084896735,0.012459884,0.0002735646,0.000066743494,0.00041538756,0.0017689703,0.016889082,0.0016248542,0.95606387,0.001274143,0.00825422],"study_design_scores_gemma":[0.00113501,0.00034769776,0.0016011422,0.00041232616,0.0000023076584,0.00030613042,0.0006787189,0.33462167,0.0005483582,0.65962714,0.0005206394,0.00019886842],"about_ca_topic_score_codex":0.000003328828,"about_ca_topic_score_gemma":0.0000025700504,"teacher_disagreement_score":0.31773257,"about_ca_system_score_codex":0.00017084087,"about_ca_system_score_gemma":0.00020250777,"threshold_uncertainty_score":0.6504339},"labels":[],"label_agreement":null},{"id":"W2916219982","doi":"10.1007/s10732-020-09453-x","title":"A tabu search for the design of capacitated rooted survivable planar networks","year":2020,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Tabu search; Combinatorics; Mathematics; Planar graph; Mathematical optimization; Shortest path problem; Graph; Path (computing); Integer programming; Computer science","score_opus":0.08577908369528642,"score_gpt":0.30450855670640997,"score_spread":0.21872947301112355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916219982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011768583,0.00071095076,0.9960947,0.0015736755,0.00016198057,0.00023593433,0.00000909173,0.000012590079,0.000024191055],"genre_scores_gemma":[0.8281026,0.000292439,0.17099889,0.00026562565,0.0002666984,0.000003839014,0.0000010270259,0.000022967164,0.000045917328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833065,0.0002816982,0.00045417107,0.00012827279,0.00049363944,0.00031159187],"domain_scores_gemma":[0.9956447,0.0028446775,0.00029413332,0.00026647202,0.0007856319,0.00016442596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017077089,0.000102539125,0.00026960592,0.00008844805,0.00012631656,0.000061577244,0.0013264329,0.000049520713,0.0000055888086],"category_scores_gemma":[0.00084814057,0.000068129775,0.000102718746,0.00065105094,0.000121887795,0.00017166519,0.00008908426,0.0004400712,0.0000018470383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011799834,0.00013862607,0.00067851465,0.00010610571,0.0003052258,0.00016319688,0.00157757,0.92228884,0.0055747377,0.044752873,0.015976325,0.007257978],"study_design_scores_gemma":[0.00071164937,0.000938028,0.00022451014,0.000033021737,0.000023179762,0.000049339298,0.00012999661,0.9860276,0.00247642,0.007780023,0.0015044513,0.0001017656],"about_ca_topic_score_codex":0.000003895628,"about_ca_topic_score_gemma":5.782919e-7,"teacher_disagreement_score":0.82692575,"about_ca_system_score_codex":0.000024346373,"about_ca_system_score_gemma":0.0001859142,"threshold_uncertainty_score":0.27782515},"labels":[],"label_agreement":null},{"id":"W2916766399","doi":"10.1016/j.tcs.2013.05.025","title":"The 2-surviving rate of planar graphs without 6-cycles","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Planar graph; Planar; Mathematics; Graph; Computer science; Discrete mathematics; Computer graphics (images)","score_opus":0.01347688049830958,"score_gpt":0.27745239259162785,"score_spread":0.26397551209331827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916766399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104302235,0.000058877744,0.89137894,0.001322682,0.0003438599,0.00030219276,7.370261e-7,0.00012985521,0.0021606034],"genre_scores_gemma":[0.9119085,0.000015928124,0.087791935,0.0002043051,0.000031251282,0.0000192547,1.4312614e-7,0.0000088125,0.000019872654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969363,0.00040651188,0.00036546332,0.0006370139,0.0007952311,0.00085946685],"domain_scores_gemma":[0.99614394,0.0016016003,0.00011840054,0.0014182539,0.00042530347,0.0002924947],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0038553246,0.00019029604,0.00023638997,0.00021196656,0.000878519,0.0005981405,0.005457862,0.00003987716,0.00002457998],"category_scores_gemma":[0.00030162997,0.000116987394,0.00008638547,0.0017619752,0.008051184,0.0010723617,0.0012410466,0.00027253648,0.00010375341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006235216,0.000021490594,0.00041526396,0.0000043508057,0.000005173425,0.0000018267374,0.00018640334,0.00004999052,0.0029696045,0.9592094,0.00003235336,0.03709795],"study_design_scores_gemma":[0.0001156778,0.00011670445,0.005783167,0.000021203405,0.0000014182007,0.000011893917,0.000015562619,0.17188309,0.006716038,0.81515026,0.000040679934,0.00014430235],"about_ca_topic_score_codex":0.00001409611,"about_ca_topic_score_gemma":0.0000015824394,"teacher_disagreement_score":0.8076063,"about_ca_system_score_codex":0.00002752363,"about_ca_system_score_gemma":0.000109228335,"threshold_uncertainty_score":0.9999231},"labels":[],"label_agreement":null},{"id":"W2918538746","doi":"","title":"The Domination Cover Pebbling Number For Some Cyclic Graphs And Path Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Path (computing); Indifference graph; Cover (algebra); Pathwidth; Chordal graph; Discrete mathematics; Graph; Computer science; Line graph; Computer network","score_opus":0.014403940922441131,"score_gpt":0.2921953203004329,"score_spread":0.27779137937799175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918538746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98299354,0.00036371642,0.011347408,0.0008158943,0.002492936,0.00070397736,0.000004635158,0.00018343033,0.0010944484],"genre_scores_gemma":[0.9971423,0.0001166754,0.0021932016,0.00014594036,0.000015247653,0.0000895512,0.0000019341724,0.000018385854,0.0002767326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984627,0.00011921933,0.00020384829,0.00041588678,0.00033944528,0.0004589227],"domain_scores_gemma":[0.9981923,0.00074099895,0.000099286364,0.00060641574,0.00024904366,0.00011193322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009997814,0.00015209887,0.00014402605,0.00010273391,0.00085769856,0.00028133768,0.00078741205,0.000057677684,0.000004433548],"category_scores_gemma":[0.00023190927,0.00011704242,0.000079148536,0.00056318205,0.0003816648,0.00080762035,0.00027759932,0.00015283075,0.00004689864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029556117,0.00002974984,0.0010991829,0.000007285937,0.000017358901,0.0000013487557,0.0002270733,5.509684e-7,0.0003910553,0.990075,0.00091995654,0.007201898],"study_design_scores_gemma":[0.00090721104,0.0001498432,0.001520303,0.0000125882825,0.0000049921755,0.000008242511,0.00002340723,0.0027813222,0.0022417116,0.987966,0.0042281984,0.00015615956],"about_ca_topic_score_codex":0.0000051376956,"about_ca_topic_score_gemma":0.000002304177,"teacher_disagreement_score":0.014148778,"about_ca_system_score_codex":0.000030992345,"about_ca_system_score_gemma":0.00003696013,"threshold_uncertainty_score":0.659681},"labels":[],"label_agreement":null},{"id":"W2918809886","doi":"","title":"On r-(k)-pancyclic Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.016269665712103143,"score_gpt":0.2883168699452045,"score_spread":0.27204720423310136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918809886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9393188,0.000099534576,0.009362819,0.00076243747,0.004258951,0.00030560046,0.0000015840395,0.0005905406,0.04529974],"genre_scores_gemma":[0.99690753,0.000008393561,0.0021502106,0.00042737508,0.000011099734,0.000019830502,7.1509953e-7,0.000015904112,0.00045892058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998349,0.0001179524,0.00015826046,0.00046883253,0.0004339736,0.00047199035],"domain_scores_gemma":[0.99828446,0.00023349641,0.000052668194,0.0011243155,0.00014408048,0.00016096474],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035207937,0.00015057389,0.00014552976,0.00022136082,0.00025110977,0.00009037679,0.0014264556,0.00006182757,0.000049099104],"category_scores_gemma":[0.0001462528,0.00014019062,0.00007176998,0.0010001928,0.00022555089,0.00037099392,0.0003058497,0.00021906069,0.0011985534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013083953,0.000075072705,0.00032726294,0.0000021987676,0.000009475632,0.000011865081,0.0001247943,7.6495456e-7,0.0003967021,0.99074477,0.0023612452,0.0059327683],"study_design_scores_gemma":[0.0004512304,0.0004661632,0.0015589908,0.000013322815,0.000001219727,0.0000050998797,0.000004717871,0.00046934807,0.0066281343,0.98767513,0.0025624142,0.00016425217],"about_ca_topic_score_codex":0.0000045843017,"about_ca_topic_score_gemma":0.0000018084148,"teacher_disagreement_score":0.057588756,"about_ca_system_score_codex":0.000040694515,"about_ca_system_score_gemma":0.000038577917,"threshold_uncertainty_score":0.99957913},"labels":[],"label_agreement":null},{"id":"W2918914696","doi":"","title":"On wy-Perfect Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.015544611197801513,"score_gpt":0.2865267648438405,"score_spread":0.27098215364603895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918914696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9493594,0.00008449697,0.007829705,0.00057677727,0.003979499,0.0002999889,0.0000015491783,0.000519875,0.037348684],"genre_scores_gemma":[0.99755514,0.000006527999,0.001645342,0.00035736704,0.000011570676,0.000018397082,7.213144e-7,0.000016116295,0.0003888027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832463,0.00014887184,0.00014609368,0.00047648742,0.00043697402,0.00046695396],"domain_scores_gemma":[0.998252,0.000285132,0.00004703174,0.0011001686,0.00015881493,0.00015686457],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047127396,0.00015499479,0.00014865311,0.00021704074,0.0002638598,0.00010215682,0.0014001175,0.00006210166,0.000058155914],"category_scores_gemma":[0.00017061133,0.00014124953,0.00007704609,0.00096477376,0.00022023496,0.00036194976,0.00031702837,0.0002305641,0.001088898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001759453,0.00007482258,0.0003689739,0.0000025752947,0.000010809398,0.000013860733,0.00013241117,0.0000013552745,0.0005182211,0.99092716,0.0028163106,0.0051159],"study_design_scores_gemma":[0.00048170294,0.00068885676,0.0009906979,0.000013380033,0.0000013925581,0.0000060727207,0.000004685347,0.00072913436,0.0096242875,0.98528165,0.0020092232,0.00016890251],"about_ca_topic_score_codex":0.000005547236,"about_ca_topic_score_gemma":0.0000017586384,"teacher_disagreement_score":0.04819573,"about_ca_system_score_codex":0.000044889235,"about_ca_system_score_gemma":0.00004379952,"threshold_uncertainty_score":0.99968886},"labels":[],"label_agreement":null},{"id":"W2919107023","doi":"","title":"Number of Spanning trees in Different Products of Complete and Complete Tripartite Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Discrete mathematics","score_opus":0.035141965112555865,"score_gpt":0.2987868566843932,"score_spread":0.26364489157183735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919107023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99783266,0.00011079987,0.0007151899,0.00017666403,0.00037855777,0.00024639492,0.000006022802,0.000032611842,0.00050108985],"genre_scores_gemma":[0.99663574,0.000014925136,0.0032691276,0.000016926324,0.0000063059783,0.000011110412,0.000001623712,0.000011572812,0.000032666685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982678,0.00019908538,0.00039885723,0.00041478543,0.00036418278,0.00035528038],"domain_scores_gemma":[0.9985927,0.00023315361,0.00017780495,0.0006654653,0.00024626302,0.00008461976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000446313,0.0001657291,0.0004125061,0.00022977337,0.000069162015,0.000025129026,0.0006783754,0.000043595974,0.000010024152],"category_scores_gemma":[0.00010986052,0.00014642067,0.00004720329,0.000951698,0.0005523242,0.00028079448,0.00043185006,0.000155961,0.000007309034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052139374,0.0001680948,0.058176804,0.00004746972,0.000021679112,0.000004782445,0.0010820315,0.0000026308312,0.02814566,0.910981,0.00006728523,0.0012504127],"study_design_scores_gemma":[0.0015136849,0.00032248077,0.1543778,0.000111915564,0.0000050505337,0.0000081722355,0.000046043137,0.002493052,0.022746323,0.8179491,0.00023725201,0.00018913481],"about_ca_topic_score_codex":0.000045714358,"about_ca_topic_score_gemma":0.000019471598,"teacher_disagreement_score":0.096200995,"about_ca_system_score_codex":0.000020015992,"about_ca_system_score_gemma":0.00002872146,"threshold_uncertainty_score":0.59708613},"labels":[],"label_agreement":null},{"id":"W2919239201","doi":"","title":"Well-Partitioned and Balanced Well-Partitioned Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012745691456855977,"score_gpt":0.2689667954612418,"score_spread":0.2562211040043858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919239201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9548693,0.00027771704,0.017045155,0.0020008744,0.0027634096,0.0005936491,0.00000574129,0.00069089694,0.021753259],"genre_scores_gemma":[0.9957504,0.000059439597,0.0032280972,0.000379648,0.000022923032,0.000055338674,0.0000057963075,0.00002133261,0.00047700954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978385,0.0001855421,0.00028583632,0.000643294,0.0004520744,0.00059475406],"domain_scores_gemma":[0.9982741,0.00017981946,0.000100673686,0.0009010241,0.0002717284,0.00027266884],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005097673,0.00021948824,0.00024420358,0.0002216093,0.0005097233,0.00019081595,0.0008063434,0.000097352095,0.00015623463],"category_scores_gemma":[0.00008563588,0.00022169731,0.000068662135,0.0009769832,0.00050318084,0.0008480711,0.00039345224,0.00022038411,0.0007822886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032412932,0.000090839356,0.0022241187,0.000010467047,0.0000226922,0.000014039568,0.00020873225,0.0000034279733,0.0021281643,0.991601,0.0030792784,0.00058482506],"study_design_scores_gemma":[0.0011913514,0.00033292305,0.0053779157,0.000024552017,0.0000060006555,0.00001718076,0.000025238161,0.0025254101,0.01472933,0.9705498,0.004941126,0.0002791694],"about_ca_topic_score_codex":0.000010105026,"about_ca_topic_score_gemma":0.0000073992455,"teacher_disagreement_score":0.040881116,"about_ca_system_score_codex":0.00004228835,"about_ca_system_score_gemma":0.000050273986,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W2919325040","doi":"","title":"Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Induced subgraph; Discrete mathematics; Graph","score_opus":0.016832516482014084,"score_gpt":0.2655245428264735,"score_spread":0.2486920263444594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919325040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9801018,0.00009587546,0.010732115,0.00019890518,0.0007801997,0.00043459635,0.000005313499,0.000267667,0.0073834965],"genre_scores_gemma":[0.98594856,0.000019228653,0.0136010805,0.00007321289,0.000008997035,0.00003038946,0.0000030500967,0.00003299633,0.00028248373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974478,0.00015385139,0.0003524581,0.000638297,0.0007459883,0.0006616441],"domain_scores_gemma":[0.99742347,0.00022191001,0.00020642519,0.0013120722,0.00059912686,0.00023700381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006283884,0.00027490134,0.0003724002,0.00038469612,0.0003084815,0.000103818165,0.0017584702,0.00010994111,0.000038144815],"category_scores_gemma":[0.00009617748,0.00024305738,0.0001181344,0.0021389928,0.0009524289,0.0006578212,0.0004546862,0.00032549657,0.000052170115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015480242,0.00016948748,0.0071417834,0.000024875679,0.000058127494,0.0000389015,0.0003539464,0.0000072633525,0.0015829261,0.9896658,0.00016462413,0.0006374726],"study_design_scores_gemma":[0.0017392169,0.0013781681,0.0030121885,0.000052380175,0.0000096180875,0.0000219367,0.000027476912,0.0012877979,0.027435495,0.9627562,0.0019355214,0.00034400146],"about_ca_topic_score_codex":0.00007961275,"about_ca_topic_score_gemma":0.000046756435,"teacher_disagreement_score":0.02690959,"about_ca_system_score_codex":0.000056259272,"about_ca_system_score_gemma":0.00015030293,"threshold_uncertainty_score":0.99115926},"labels":[],"label_agreement":null},{"id":"W2919759756","doi":"","title":"A note on the edge colorings of planar graphs without 7-cycles with three chords.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Edge coloring; Graph; Computer science; Artificial intelligence; Line graph; Computer graphics (images)","score_opus":0.02086344610799311,"score_gpt":0.27806442402816783,"score_spread":0.2572009779201747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919759756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9806069,0.00004606624,0.006970962,0.0010452475,0.00050630205,0.00049300445,0.0000036852202,0.00014433835,0.010183497],"genre_scores_gemma":[0.99680847,0.0000067755104,0.0028755853,0.00016381612,0.000008560187,0.000041195755,5.3680645e-7,0.000020167883,0.00007486599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982569,0.000117599324,0.00019389647,0.00041699773,0.0005951538,0.0004194236],"domain_scores_gemma":[0.99791175,0.00045836842,0.00013685305,0.0011570222,0.0002302219,0.00010579395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014271,0.00018990696,0.00023378688,0.00015761079,0.00027752187,0.00006483237,0.0017079124,0.00005947274,0.0000106626185],"category_scores_gemma":[0.00010132679,0.00012001497,0.00006003277,0.0009311852,0.0006932532,0.00027657274,0.00022204136,0.0002782832,0.000059409726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013528005,0.00008159167,0.007046685,0.0000070436654,0.000030022244,0.000006921963,0.00035855273,0.000002151836,0.00061275304,0.99022317,0.00024637618,0.001249436],"study_design_scores_gemma":[0.0006927524,0.0012076471,0.011809723,0.00006481456,0.0000060052957,0.0000069822977,0.000027306533,0.00047119922,0.0146280425,0.96998525,0.00092299364,0.00017729492],"about_ca_topic_score_codex":0.00003250454,"about_ca_topic_score_gemma":0.000053808915,"teacher_disagreement_score":0.020237947,"about_ca_system_score_codex":0.000035266406,"about_ca_system_score_gemma":0.00008501949,"threshold_uncertainty_score":0.48940685},"labels":[],"label_agreement":null},{"id":"W2920204422","doi":"","title":"Spanning 3-ended trees in quasi-claw-free graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Combinatorics; Spanning tree; Biology","score_opus":0.021387877771457828,"score_gpt":0.29092617063252935,"score_spread":0.2695382928610715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920204422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97510403,0.00025054347,0.006685135,0.00094159273,0.0023765704,0.00034574477,0.0000022142192,0.00041710286,0.0138770435],"genre_scores_gemma":[0.9950185,0.000012865113,0.00456053,0.00013255734,0.00001451021,0.00002892398,0.0000011935186,0.000020046045,0.00021091421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766076,0.00022589097,0.0002967875,0.00060096075,0.0005205977,0.0006949942],"domain_scores_gemma":[0.99772865,0.00026089494,0.000084121275,0.0015965095,0.00016307952,0.00016677505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079995487,0.00020548707,0.00025760106,0.00045819161,0.00020282557,0.00013466494,0.0026391644,0.00009754216,0.000022676017],"category_scores_gemma":[0.00033823703,0.00020738904,0.000082365026,0.0017850354,0.00031472658,0.00078491995,0.0008873194,0.0003478519,0.0001487327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021529251,0.00014672818,0.00603056,0.0000041243,0.00001076306,0.000060161678,0.0006665477,0.000005338868,0.00094223383,0.98767495,0.0010100903,0.0034269544],"study_design_scores_gemma":[0.0012751258,0.00035206802,0.008832761,0.000032888394,0.0000016645782,0.000011686884,0.000052011997,0.0035042737,0.0030623185,0.98182327,0.0008115109,0.00024042642],"about_ca_topic_score_codex":0.000047855876,"about_ca_topic_score_gemma":0.000094746785,"teacher_disagreement_score":0.019914405,"about_ca_system_score_codex":0.000079398495,"about_ca_system_score_gemma":0.00007757212,"threshold_uncertainty_score":0.84570795},"labels":[],"label_agreement":null},{"id":"W2920329972","doi":"","title":"A New Lower Bound on the Total Domination Number of a Tree.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Domination analysis; Combinatorics; Upper and lower bounds; Mathematical analysis; Graph","score_opus":0.015207045081257102,"score_gpt":0.2931586158511737,"score_spread":0.2779515707699166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920329972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9529224,0.000018696535,0.014029257,0.0014026244,0.0019656867,0.00027983673,8.438623e-7,0.000072192335,0.02930848],"genre_scores_gemma":[0.9957754,0.000001591837,0.0018675886,0.000083521336,0.000021522521,0.000009865883,3.4393534e-7,0.000009373302,0.0022307655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879754,0.0001224068,0.00015482942,0.00025174418,0.00043033407,0.00024312586],"domain_scores_gemma":[0.99858254,0.00036093913,0.00007846578,0.0007270897,0.00017302172,0.00007796236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044369686,0.00010341066,0.000116838986,0.000060826962,0.00013799888,0.00007087985,0.0008088671,0.000045469034,0.00012417487],"category_scores_gemma":[0.00017025988,0.000074698095,0.00006409777,0.00060244475,0.00017742395,0.0002826515,0.00021842688,0.00014204446,0.0002826721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003819549,0.00006914144,0.00011365365,0.0000017915063,0.000011354014,0.0000028936645,0.00036587237,0.0000011657892,0.0008062717,0.9880754,0.0025781407,0.00793617],"study_design_scores_gemma":[0.00054119516,0.00031201146,0.0019083588,0.000018271325,0.0000022694976,0.000008036605,0.000016394832,0.0011278836,0.010750233,0.9844219,0.0007992512,0.00009416561],"about_ca_topic_score_codex":0.000015163584,"about_ca_topic_score_gemma":0.0000030420872,"teacher_disagreement_score":0.042853046,"about_ca_system_score_codex":0.00004185613,"about_ca_system_score_gemma":0.000085847845,"threshold_uncertainty_score":0.3633272},"labels":[],"label_agreement":null},{"id":"W2920365169","doi":"","title":"First Reformulated Zagreb Index And Some Graph Operations.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Graph; Combinatorics; Computer science; World Wide Web","score_opus":0.013728541977211137,"score_gpt":0.27196476074937176,"score_spread":0.25823621877216063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920365169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987568,0.0002225113,0.008721953,0.00082853046,0.0011900357,0.00028529132,0.0000018195548,0.0002676448,0.00091417774],"genre_scores_gemma":[0.99720615,0.00004224241,0.0022956596,0.00019069023,0.000014935019,0.0000073415313,0.0000015906194,0.000012645091,0.00022873493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987159,0.000065474844,0.00018085289,0.00040002025,0.00028348266,0.00035431044],"domain_scores_gemma":[0.9988369,0.000077468365,0.00003219336,0.0006939753,0.00020428434,0.00015522848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003102181,0.00013841978,0.00014138955,0.00020600516,0.00048346972,0.00017608024,0.0007416068,0.00007834855,0.000017073138],"category_scores_gemma":[0.00008224442,0.00012385118,0.000032488166,0.00076140394,0.0002677161,0.0011234507,0.00045703782,0.0001823068,0.00009549624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010825179,0.000039192466,0.0009835366,0.000005027062,0.000013710587,0.000007303324,0.00042149716,0.00002076312,0.0003478026,0.99676096,0.00020477787,0.0011845973],"study_design_scores_gemma":[0.00072525756,0.00022052579,0.004538652,0.000015613045,0.0000019626152,0.0000132869945,0.000016024926,0.020717453,0.002140252,0.9705222,0.0009061663,0.00018259892],"about_ca_topic_score_codex":0.0000318366,"about_ca_topic_score_gemma":0.000027944427,"teacher_disagreement_score":0.02623876,"about_ca_system_score_codex":0.00003992893,"about_ca_system_score_gemma":0.000044548422,"threshold_uncertainty_score":0.5050504},"labels":[],"label_agreement":null},{"id":"W2920555783","doi":"","title":"On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Involution (esoterism); Mathematics; Combinatorics; Completeness (order theory); Discrete mathematics; Psychology","score_opus":0.043728775567516934,"score_gpt":0.2635209263663286,"score_spread":0.2197921507988117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920555783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5768284,0.0007052216,0.4105772,0.0066714305,0.00012373424,0.0009337028,0.000042918768,0.00007969018,0.004037684],"genre_scores_gemma":[0.9691175,0.00023646138,0.030325325,0.0000800698,0.0000057454304,0.000049201924,0.00002710065,0.000020792613,0.00013777088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98838,0.0091834115,0.00070780294,0.0006874041,0.0006932438,0.00034811403],"domain_scores_gemma":[0.9852155,0.009168505,0.0011389694,0.002517605,0.0018760713,0.00008335052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013226421,0.00027981828,0.00055540225,0.0002745349,0.00043839522,0.00024777954,0.0027315987,0.00014976916,0.0000141650235],"category_scores_gemma":[0.0029616265,0.00020002994,0.00024023834,0.00076763396,0.0018584947,0.00016742073,0.0032950619,0.00084157323,0.000002842438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059358394,0.00012947456,0.0014523258,0.00018423655,0.000070434544,6.0819383e-7,0.0047619366,0.00031552216,0.001400876,0.98448354,0.000021323971,0.007120376],"study_design_scores_gemma":[0.0011137446,0.0000022780287,0.010355845,0.0022626286,0.000032790813,0.000010970976,0.00035364673,0.12789331,0.027317112,0.8302674,0.00006329387,0.00032695936],"about_ca_topic_score_codex":0.00039232013,"about_ca_topic_score_gemma":0.00020254136,"teacher_disagreement_score":0.3922891,"about_ca_system_score_codex":0.00005688917,"about_ca_system_score_gemma":0.00024977015,"threshold_uncertainty_score":0.81569844},"labels":[],"label_agreement":null},{"id":"W2920588083","doi":"","title":"One class of primitive 2-arc transitive graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Arc (geometry); Class (philosophy); Combinatorics; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.02076743782908075,"score_gpt":0.27991681813936203,"score_spread":0.2591493803102813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920588083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91367346,0.00014155041,0.057809163,0.0007666782,0.0014037391,0.0005860609,0.000013573481,0.00024829415,0.02535749],"genre_scores_gemma":[0.9945299,0.000016053846,0.005221107,0.00010957936,0.0000075474745,0.000017495186,0.0000015898736,0.000015005867,0.00008174608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824226,0.00020964221,0.00024952483,0.0004393682,0.0004362958,0.00042289495],"domain_scores_gemma":[0.9981949,0.00027747537,0.00010472427,0.00072707847,0.0005561721,0.0001396574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048331646,0.00014737925,0.00026181617,0.00022897247,0.00013978568,0.00003305289,0.0010813233,0.00007906784,0.00002256267],"category_scores_gemma":[0.00009739541,0.00015797764,0.00010363696,0.0011014416,0.00065637333,0.00048736332,0.00023487567,0.00022247554,0.00006615044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004198108,0.00017067946,0.00023967751,0.000010389109,0.0000449834,0.000006179302,0.0012904482,6.206577e-7,0.010742756,0.9814058,0.00009526961,0.005951248],"study_design_scores_gemma":[0.0007253951,0.0005859309,0.004834593,0.00003369372,0.000006031117,0.000002840444,0.000055728455,0.00047090993,0.10418016,0.8887459,0.00020032276,0.00015846468],"about_ca_topic_score_codex":0.000012546007,"about_ca_topic_score_gemma":0.0000056579493,"teacher_disagreement_score":0.0934374,"about_ca_system_score_codex":0.000044081087,"about_ca_system_score_gemma":0.00009442773,"threshold_uncertainty_score":0.64421415},"labels":[],"label_agreement":null},{"id":"W2920676263","doi":"","title":"Plane graphs without homeomorphically irreducible spanning trees","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Plane (geometry); Geometry","score_opus":0.021787341638129926,"score_gpt":0.28831440027833233,"score_spread":0.26652705864020243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920676263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9649594,0.00020617724,0.01755603,0.0009800036,0.0031653729,0.00037106316,0.0000044692865,0.00071821024,0.012039291],"genre_scores_gemma":[0.98684305,0.000014560628,0.012327275,0.00016552136,0.000026203556,0.00002429707,0.0000036771921,0.000027005814,0.0005684225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975854,0.00015748569,0.00026812227,0.00068640127,0.00060224836,0.00070033],"domain_scores_gemma":[0.9979395,0.00020378164,0.00010176367,0.0012237852,0.00025902587,0.00027209835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006748231,0.00022978523,0.00027864065,0.00030425336,0.00036594336,0.00021328969,0.0018227616,0.00010178978,0.000056760655],"category_scores_gemma":[0.00016299699,0.00021780819,0.000083663304,0.0012486223,0.000451922,0.00066875963,0.0005315327,0.00033776142,0.00038836323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033035725,0.0000912883,0.0063577266,0.000005761843,0.000027158998,0.00002535854,0.00038172162,0.0000040576397,0.0032866702,0.984532,0.0013797462,0.0038754512],"study_design_scores_gemma":[0.00083024264,0.00050269725,0.006314359,0.000036684043,0.0000049479722,0.000029739656,0.000030798343,0.0015344035,0.009290726,0.9782966,0.0028160731,0.00031276591],"about_ca_topic_score_codex":0.000020979378,"about_ca_topic_score_gemma":0.000010604364,"teacher_disagreement_score":0.021883653,"about_ca_system_score_codex":0.00004489694,"about_ca_system_score_gemma":0.000102532,"threshold_uncertainty_score":0.888196},"labels":[],"label_agreement":null},{"id":"W2920684777","doi":"","title":"Twin signed total domination numbers in directed graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01073964492393636,"score_gpt":0.27440831720286907,"score_spread":0.2636686722789327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920684777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867877,0.00004664632,0.0036233412,0.00027468253,0.0016540732,0.00031857335,0.0000011576495,0.0003573958,0.0069364263],"genre_scores_gemma":[0.99593586,0.0000034818925,0.003671755,0.000058250553,0.000008656499,0.000033111843,0.00000269241,0.000014961677,0.00027123233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998168,0.00024654443,0.00024000315,0.00046745568,0.00041561582,0.0004623899],"domain_scores_gemma":[0.99875724,0.0002344102,0.00007130657,0.00061241514,0.00020598351,0.00011863359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263768,0.00015432405,0.00018167173,0.00035963586,0.0001369714,0.000092120055,0.00082317466,0.00008447695,0.000031057374],"category_scores_gemma":[0.00022447127,0.0001608196,0.00005821778,0.0019556738,0.00020056572,0.0007125133,0.00027041932,0.00020077992,0.0001515025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033916065,0.000118668424,0.0022706795,0.0000044177086,0.00000919635,0.000021297194,0.0007281597,0.0000034017705,0.0032883512,0.9875812,0.00045728177,0.005483407],"study_design_scores_gemma":[0.0012559947,0.00020427052,0.013333646,0.000019520143,0.000001661267,0.000007821468,0.00003111123,0.0049074288,0.009319293,0.9705196,0.00017910002,0.00022054267],"about_ca_topic_score_codex":0.000049286802,"about_ca_topic_score_gemma":0.00002903731,"teacher_disagreement_score":0.017061614,"about_ca_system_score_codex":0.0001082984,"about_ca_system_score_gemma":0.00005899216,"threshold_uncertainty_score":0.6558033},"labels":[],"label_agreement":null},{"id":"W2920730178","doi":"","title":"Dominating set and hamiltonicity in claw-heavy graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Combinatorics; Set (abstract data type); Biology; Computer science; Programming language","score_opus":0.019312237141795082,"score_gpt":0.29657290160451144,"score_spread":0.27726066446271636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920730178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945896,0.0001789576,0.0017916014,0.00027589276,0.0006450862,0.00019407671,0.0000012837135,0.000105239815,0.0022182423],"genre_scores_gemma":[0.9946387,0.000026376425,0.0051074964,0.00013220105,0.000006063326,0.000016281014,7.210868e-7,0.000011418387,0.000060755527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834573,0.00018784526,0.0002191367,0.00047985069,0.00029325698,0.00047419264],"domain_scores_gemma":[0.9988061,0.0002860044,0.00006256625,0.0005973288,0.0001203932,0.00012758035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009462344,0.00014478262,0.00019272938,0.00024325296,0.00020172262,0.00010812386,0.00078231166,0.00007746534,0.0000080673135],"category_scores_gemma":[0.00019550443,0.00014554107,0.00003437061,0.000992574,0.00033990105,0.0005708889,0.00058037427,0.0002891026,0.000032166685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001597507,0.00004156885,0.009309658,0.000007856091,0.0000051682237,0.00001737788,0.00089207647,8.936496e-7,0.00054931536,0.9826523,0.00013974217,0.0063680336],"study_design_scores_gemma":[0.00084781734,0.00018458118,0.013734697,0.000033068005,0.0000011388588,0.000011440904,0.000051860912,0.004187145,0.004422176,0.97608775,0.00026580453,0.00017249331],"about_ca_topic_score_codex":0.000044214656,"about_ca_topic_score_gemma":0.000035156078,"teacher_disagreement_score":0.0065645585,"about_ca_system_score_codex":0.000053599724,"about_ca_system_score_gemma":0.00004718951,"threshold_uncertainty_score":0.59349924},"labels":[],"label_agreement":null},{"id":"W2920782108","doi":"","title":"2-upper bound graphs of posets","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015371943110201996,"score_gpt":0.2894162301046144,"score_spread":0.2740442869944124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920782108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850334,0.0001536479,0.0029769768,0.00025185212,0.0017512522,0.0001695706,0.0000022951513,0.00012821531,0.009532825],"genre_scores_gemma":[0.99563855,0.000009458278,0.003990249,0.0000884581,0.0000064360893,0.000007357683,8.3666697e-7,0.0000117346935,0.00024694452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985902,0.000104125094,0.00020324595,0.0003309421,0.0004046249,0.00036689284],"domain_scores_gemma":[0.9984477,0.00013929706,0.00008005641,0.000923308,0.0002929668,0.00011665778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041960817,0.000118739736,0.00016954876,0.00019816542,0.00014514118,0.000053413256,0.0012829776,0.000058143116,0.0000417459],"category_scores_gemma":[0.00009881075,0.000112563255,0.00007811116,0.00088134396,0.00040127672,0.0004412431,0.0003977539,0.00013667805,0.00014820384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001147638,0.000071531365,0.002665299,0.000006212455,0.00001529776,0.000005277156,0.00027459214,2.5115614e-7,0.0032445733,0.9903019,0.0007535154,0.0026500833],"study_design_scores_gemma":[0.0004040096,0.00029702255,0.004477505,0.00001322387,0.0000020486,0.000006679506,0.000012602337,0.0002634309,0.027481353,0.96549976,0.0014200034,0.00012237985],"about_ca_topic_score_codex":0.000012239466,"about_ca_topic_score_gemma":0.0000023437708,"teacher_disagreement_score":0.02480215,"about_ca_system_score_codex":0.00002373152,"about_ca_system_score_gemma":0.00006495227,"threshold_uncertainty_score":0.45901963},"labels":[],"label_agreement":null},{"id":"W2921478501","doi":"10.1007/s00493-020-4177-y","title":"On the Density of C7-Critical Graphs","year":2022,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Homomorphism; Planar graph; Modulo; Girth (graph theory); Conjecture; Graph homomorphism; Graph; Discrete mathematics; Odd graph; 1-planar graph; Graph power; Line graph","score_opus":0.0345622702573892,"score_gpt":0.3188477609824474,"score_spread":0.28428549072505815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921478501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47303656,0.0032183414,0.38167027,0.033905834,0.020003643,0.0044359677,0.00012646017,0.0016064874,0.08199643],"genre_scores_gemma":[0.9982241,0.00004422348,0.0011979166,0.00021243923,0.000011698198,0.00011248787,0.0000028481857,0.000018858835,0.00017544594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968996,0.0006927889,0.0002934644,0.0006917223,0.0010181528,0.00040428928],"domain_scores_gemma":[0.9941962,0.0026822037,0.00013413222,0.0026295711,0.00023510517,0.00012282074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010442659,0.00023670941,0.00036141978,0.00023711415,0.0003429231,0.00008039627,0.00433714,0.00012271471,0.00014000574],"category_scores_gemma":[0.0011495445,0.00018489025,0.00025729116,0.0008359283,0.0003531658,0.000074188276,0.0069780797,0.0017629106,0.000026796912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014096755,0.00021820264,0.00026568826,0.00004555404,0.000023820765,0.00003207685,0.00014488617,0.000053563694,0.000032850814,0.9965244,0.0018974293,0.00074741483],"study_design_scores_gemma":[0.00010639124,0.0001731395,0.00073558517,0.000029072144,0.0000063190178,0.0000037129955,0.000018954834,0.0010491925,0.00089582126,0.9957578,0.0010418124,0.00018216099],"about_ca_topic_score_codex":0.000012040389,"about_ca_topic_score_gemma":3.118235e-7,"teacher_disagreement_score":0.52518755,"about_ca_system_score_codex":0.0001386149,"about_ca_system_score_gemma":0.0001806921,"threshold_uncertainty_score":0.8697677},"labels":[],"label_agreement":null},{"id":"W2922137268","doi":"10.37236/8584","title":"On Density-Critical Matroids","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Marsden Fund; National Science Foundation","keywords":"Matroid; Graphic matroid; Matroid partitioning; Rank (graph theory); Simple (philosophy)","score_opus":0.01426340436832554,"score_gpt":0.2810035618421438,"score_spread":0.2667401574738183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922137268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057666358,0.0012328116,0.9120791,0.02780209,0.00035645912,0.00008465869,2.0490326e-7,0.000043176937,0.00073514035],"genre_scores_gemma":[0.99853945,0.000120812554,0.00018687517,0.001008942,0.00008999044,8.2263216e-7,5.099124e-8,0.000011378127,0.000041688694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980005,0.00027690965,0.0002727783,0.00014538808,0.0007130281,0.00059141684],"domain_scores_gemma":[0.99820536,0.0008534782,0.00012510321,0.00034681082,0.00027896816,0.0001902848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010759083,0.00011820575,0.00020789522,0.00008020733,0.0001614829,0.0000832357,0.0019211941,0.000039308947,0.000007375142],"category_scores_gemma":[0.00079233805,0.00007909353,0.00012787916,0.0007178874,0.000104295956,0.0002888535,0.00019232025,0.0012817855,0.000045980454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000696718,0.000054253433,0.000018748353,0.0000045263896,0.000022870143,0.000038675837,0.0001733135,0.00007299973,0.00039477323,0.99787736,0.00056474446,0.00070807943],"study_design_scores_gemma":[0.00040391026,0.0016824164,0.000035183508,0.000008766354,0.000008683876,0.00017825939,0.00002510884,0.0017121837,0.0030124686,0.99140626,0.00144152,0.00008521145],"about_ca_topic_score_codex":2.7506127e-7,"about_ca_topic_score_gemma":1.4065485e-7,"teacher_disagreement_score":0.9408731,"about_ca_system_score_codex":0.00016014601,"about_ca_system_score_gemma":0.00033004128,"threshold_uncertainty_score":0.55687916},"labels":[],"label_agreement":null},{"id":"W2930774002","doi":"10.1017/s0004972719000352","title":"A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS","year":2019,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Unicode; Mathematics; Clique number; Vertex (graph theory); Graph; Chromatic scale; Discrete mathematics; Computer science","score_opus":0.025648063600059345,"score_gpt":0.30192473956816396,"score_spread":0.2762766759681046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2930774002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56463355,0.00016108471,0.31565455,0.09958696,0.00082181004,0.008144777,0.000106102125,0.00026205982,0.0106290765],"genre_scores_gemma":[0.7625541,0.000009457596,0.21797247,0.00046031186,0.000038557584,0.00013849762,7.6011156e-7,0.000038050533,0.018787775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981908,0.000098747914,0.0004435402,0.00026416106,0.0006059178,0.00039679804],"domain_scores_gemma":[0.9959269,0.0016774492,0.00025413334,0.0019306791,0.00014498203,0.000065868524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012382618,0.00016608475,0.0003337972,0.000012655356,0.00014919422,0.000056351037,0.0033987616,0.00009440128,0.00080547534],"category_scores_gemma":[0.00041409695,0.00009062185,0.00071080023,0.0003378883,0.00058925117,0.000056667228,0.0007596237,0.00021955871,0.00015903419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014043185,0.0001878853,0.00044337797,0.001046084,0.00016638503,1.7490362e-7,0.0010918488,0.00004747539,0.0016019872,0.9369625,0.05815075,0.00028750475],"study_design_scores_gemma":[0.00070992263,0.00006756345,0.0008999388,0.00015203224,0.000039994586,0.000015426009,0.00031970456,0.0024899286,0.0051049655,0.9824685,0.0075735026,0.000158509],"about_ca_topic_score_codex":0.000009039252,"about_ca_topic_score_gemma":2.5044756e-7,"teacher_disagreement_score":0.19792055,"about_ca_system_score_codex":0.000025839352,"about_ca_system_score_gemma":0.000038922743,"threshold_uncertainty_score":0.88193905},"labels":[],"label_agreement":null},{"id":"W2935502686","doi":"10.1007/s00453-023-01204-1","title":"Finding Optimal Solutions with Neighborly Help","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Japan Society for the Promotion of Science; Eidgenössische Technische Hochschule Zürich; Alexander von Humboldt-Stiftung; Heinrich-Heine-Universität Düsseldorf; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Edge cover; Theory of computation; Vertex cover; Combinatorics; Vertex (graph theory); Edge coloring; Graph; Computer science; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Algorithm; Line graph; Artificial intelligence; Graph power","score_opus":0.026548626414717717,"score_gpt":0.29098596922594716,"score_spread":0.26443734281122944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935502686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017254663,0.00060583366,0.991222,0.0013246756,0.0003117619,0.00013264237,0.0000075875864,0.0005100228,0.004159961],"genre_scores_gemma":[0.561355,0.000029757963,0.43346694,0.00010636782,0.0003121099,0.000076854514,0.0000066637813,0.000044485412,0.004601838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985089,0.000048334903,0.00012827398,0.00046063054,0.00033211763,0.0005217488],"domain_scores_gemma":[0.99911755,0.00020316982,0.000018191873,0.00047351452,0.0000624195,0.00012512962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027416646,0.00013037623,0.00010621744,0.00022551884,0.00023389643,0.0002603152,0.0007394806,0.000041386727,0.00005567016],"category_scores_gemma":[0.000021531472,0.000105255254,0.000057320518,0.0010940642,0.00011885672,0.0007821084,0.00029626998,0.00028769387,0.0003144756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008476521,0.000038232414,0.000022436341,0.000022065115,0.00006416608,0.00020912394,0.0004623448,0.0006240107,0.0010185761,0.86039597,0.0019076258,0.13522698],"study_design_scores_gemma":[0.00038062234,0.0004955886,0.0002815741,0.00016605988,0.000018220937,0.00030558932,0.00011306727,0.8672554,0.0050854394,0.070699245,0.05458998,0.0006092136],"about_ca_topic_score_codex":0.000007465528,"about_ca_topic_score_gemma":0.0000020282112,"teacher_disagreement_score":0.8666314,"about_ca_system_score_codex":0.00006153609,"about_ca_system_score_gemma":0.00013288487,"threshold_uncertainty_score":0.42921847},"labels":[],"label_agreement":null},{"id":"W2938191358","doi":"10.1145/3385731","title":"Planar Graphs Have Bounded Queue-Number","year":2020,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Planar graph; 1-planar graph; Bounded function; Pathwidth; Book embedding; Tree-depth; Indifference graph; Clique-sum; Graph product","score_opus":0.04225608643793,"score_gpt":0.310918355023021,"score_spread":0.268662268585091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938191358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4770671,0.0008543763,0.20655519,0.30496043,0.0021802608,0.00045380942,0.000007884128,0.00013078601,0.0077901375],"genre_scores_gemma":[0.94324803,0.00003688238,0.05237113,0.0037808092,0.00022347154,0.0000011048828,8.46091e-8,0.00001364031,0.0003248226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864906,0.00017610608,0.00026162143,0.00013016464,0.0005607199,0.00022235535],"domain_scores_gemma":[0.99821526,0.0001899978,0.00024586933,0.0010232489,0.00014718334,0.00017845597],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00048397054,0.00008848297,0.00016409738,0.00005183033,0.00013101724,0.00011390383,0.006112409,0.00003440814,0.00002931754],"category_scores_gemma":[0.0012385565,0.000054011947,0.00020382443,0.00042049115,0.00009030557,0.00045769656,0.00091862446,0.0004703138,0.000051122563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005920231,0.00024666902,0.045986824,0.00006840062,0.000506855,0.0007750353,0.008129219,0.0006934658,0.026214622,0.6948159,0.20314892,0.018822111],"study_design_scores_gemma":[0.00045791728,0.00011929017,0.0025875117,0.000025762525,0.000008323411,0.00028817687,0.000076758,0.00063053175,0.004249568,0.9772812,0.014173673,0.00010126433],"about_ca_topic_score_codex":0.000002516266,"about_ca_topic_score_gemma":0.0000022745498,"teacher_disagreement_score":0.46618092,"about_ca_system_score_codex":0.000030050282,"about_ca_system_score_gemma":0.00009341114,"threshold_uncertainty_score":0.999265},"labels":[],"label_agreement":null},{"id":"W2939719063","doi":"10.1007/s00373-019-02123-1","title":"The Intersection of Two Vertex Coloring Problems","year":2019,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Induced subgraph; Graph coloring; Complete coloring; Chordal graph; Greedy coloring; Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.02231037702462028,"score_gpt":0.2768498994107605,"score_spread":0.2545395223861402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939719063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74616593,0.0070588435,0.225105,0.00042156875,0.011254772,0.0019993247,0.000011244327,0.00033768066,0.0076456214],"genre_scores_gemma":[0.99852943,0.000765098,0.00039521462,0.000010606774,0.0000065931713,0.000056909073,0.000001697297,0.000013412939,0.0002210426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846125,0.00012188127,0.00028119638,0.000454088,0.00037924448,0.00030232075],"domain_scores_gemma":[0.9982413,0.00030185012,0.00022406998,0.0009347126,0.0002267673,0.00007130209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007045778,0.00019266135,0.0002597983,0.00014618738,0.0002124631,0.00018888916,0.0012619434,0.00011566711,6.902087e-7],"category_scores_gemma":[0.000043715543,0.00014675237,0.00011886246,0.0005126668,0.00016543642,0.00015212057,0.002024988,0.00066349504,0.0000028192835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008655558,0.00003485263,0.0018883516,0.00011717667,0.00004106288,0.0000013785052,0.00029266058,0.00030587305,0.00007631031,0.98823184,0.000064395565,0.008937464],"study_design_scores_gemma":[0.00033304663,0.00015207865,0.0008265028,0.000101874124,0.0000074858003,0.000004495338,0.00004827663,0.016027989,0.0003808712,0.98140144,0.0005558876,0.00016006807],"about_ca_topic_score_codex":0.000043307344,"about_ca_topic_score_gemma":0.000008595171,"teacher_disagreement_score":0.25236347,"about_ca_system_score_codex":0.000060389328,"about_ca_system_score_gemma":0.000093131785,"threshold_uncertainty_score":0.5984388},"labels":[],"label_agreement":null},{"id":"W2942927459","doi":"10.1142/s0219265919400048","title":"Search Numbers in Networks with Special Topologies","year":2019,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Vertex (graph theory); Chordal graph; Combinatorics; Mathematics; Indifference graph; Maximal independent set; Computer science; Time complexity; Discrete mathematics; Graph; 1-planar graph","score_opus":0.011921708208131324,"score_gpt":0.2694484824025898,"score_spread":0.25752677419445846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942927459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2867926,0.0001644425,0.70734555,0.0004341125,0.0019053422,0.00014473186,9.828679e-8,0.000026701988,0.0031864296],"genre_scores_gemma":[0.9936816,0.00013595197,0.004708892,0.0001364216,0.0010708002,0.0000022856598,2.6268796e-7,0.000012996687,0.0002507674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826384,0.00026056703,0.00044092975,0.00023918007,0.00036580933,0.0004296889],"domain_scores_gemma":[0.9986534,0.00042184148,0.00022301172,0.0003204827,0.000274181,0.00010708169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012031717,0.00014385194,0.0003008142,0.00041403627,0.00005549355,0.00013927028,0.00085415033,0.00011302548,0.00014815849],"category_scores_gemma":[0.00005397737,0.000108897235,0.000108954184,0.00090334675,0.00009434797,0.0010291942,0.0001815059,0.0010670053,0.000016874174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065637956,0.000081680606,0.03241557,0.000007673706,0.000060971364,0.00015419899,0.00052874873,0.9120323,0.000052200103,0.020682238,0.0010698218,0.03225822],"study_design_scores_gemma":[0.005062738,0.0049315467,0.019465102,0.0008272546,0.000015410782,0.0025398294,0.0037750937,0.9433067,0.00088238367,0.013644153,0.004710411,0.0008394042],"about_ca_topic_score_codex":0.000013933179,"about_ca_topic_score_gemma":0.00009823884,"teacher_disagreement_score":0.70688903,"about_ca_system_score_codex":0.00018310819,"about_ca_system_score_gemma":0.00006877593,"threshold_uncertainty_score":0.46356663},"labels":[],"label_agreement":null},{"id":"W2943721094","doi":"","title":"Total E¢ cient Dominating Sets in Cayley Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Discrete mathematics; Cayley graph; Combinatorics; Graph","score_opus":0.013314213253175125,"score_gpt":0.27855471568546386,"score_spread":0.26524050243228875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943721094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90164226,0.00016942847,0.0871209,0.00018043535,0.009466934,0.00027280697,6.253839e-7,0.00004860775,0.0010980259],"genre_scores_gemma":[0.9697524,0.000012220359,0.029829083,0.000023206445,0.00035077214,0.0000022892643,3.6315407e-7,0.00002571153,0.000003956563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630725,0.00036259,0.0013052884,0.00036398132,0.001063268,0.00059764093],"domain_scores_gemma":[0.9960483,0.0016905385,0.0009712064,0.00046822394,0.0005328437,0.00028892272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005111475,0.00031424625,0.0008156194,0.00061694015,0.00026921622,0.0003727304,0.0011514091,0.00014859824,0.0000031370591],"category_scores_gemma":[0.001390752,0.000286212,0.00019352784,0.0009618002,0.0001251516,0.00058664056,0.000706039,0.0007948887,0.0000029020746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003515531,0.00035455107,0.00042156078,0.000086042855,0.000026488633,0.000034567904,0.0014112999,0.00017833366,0.0006197744,0.98876107,0.000027474167,0.008043702],"study_design_scores_gemma":[0.0040372373,0.0007139799,0.00040971074,0.00031667695,0.000012574558,0.00019712785,0.00017061582,0.064599864,0.00073301577,0.9283836,0.00012117092,0.00030443128],"about_ca_topic_score_codex":0.000008689453,"about_ca_topic_score_gemma":6.4169564e-7,"teacher_disagreement_score":0.06811016,"about_ca_system_score_codex":0.00011546972,"about_ca_system_score_gemma":0.0001230032,"threshold_uncertainty_score":0.999959},"labels":[],"label_agreement":null},{"id":"W2944171269","doi":"10.1016/j.jctb.2020.07.001","title":"The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Graph; Tree (set theory); Degree (music); Component (thermodynamics); Connected component; Physics","score_opus":0.026241279213906985,"score_gpt":0.29976136910398044,"score_spread":0.2735200898900734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944171269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006168235,0.007819844,0.8862408,0.050274394,0.04509766,0.0026114692,0.00015522557,0.00016323545,0.0014691433],"genre_scores_gemma":[0.9874706,0.0012690814,0.0040392885,0.00054027286,0.005473693,0.00011957461,0.000010940917,0.00010918007,0.00096735806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956493,0.0009978861,0.0010625996,0.0005126447,0.0011024346,0.0006751819],"domain_scores_gemma":[0.99135894,0.004754299,0.0012859495,0.0013853371,0.00094457297,0.0002709313],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0044596298,0.000528253,0.0008511656,0.00017281396,0.0010151783,0.00096836506,0.006360789,0.00033968088,0.000026682526],"category_scores_gemma":[0.0018233261,0.00029044965,0.0008626478,0.000497485,0.0007968233,0.00063369574,0.0020226077,0.0025382326,0.000004288851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002233648,0.000040238487,0.000017086968,0.0000549616,0.0005312854,0.0000391213,0.0010165443,0.0010803911,0.00008623691,0.98038805,0.0044352086,0.010077205],"study_design_scores_gemma":[0.0014061796,0.0011846955,0.00006825786,0.00009095345,0.000099341574,0.00010253871,0.0003809361,0.0020373669,0.0019473704,0.9509273,0.041452356,0.0003026947],"about_ca_topic_score_codex":0.0000046974124,"about_ca_topic_score_gemma":0.000011082537,"teacher_disagreement_score":0.9813024,"about_ca_system_score_codex":0.00020380359,"about_ca_system_score_gemma":0.0010176888,"threshold_uncertainty_score":0.99995476},"labels":[],"label_agreement":null},{"id":"W2945020291","doi":"10.1007/978-3-319-62127-2_9","title":"Dynamic graph coloring","year":2017,"lang":"en","type":"book-chapter","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; List coloring; Vertex (graph theory); Graph; Fractional coloring; Complete coloring; Edge coloring; Upper and lower bounds; Wheel graph; Chromatic scale; Mathematics; Graph coloring; Brooks' theorem; Path graph; Graph power; Discrete mathematics; Computer science; Line graph","score_opus":0.014514479801589115,"score_gpt":0.22145743033225293,"score_spread":0.2069429505306638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945020291","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056290496,0.006252822,0.42919135,0.0027259535,0.0014036747,0.0017304829,0.00051241525,0.0023444397,0.5502098],"genre_scores_gemma":[0.1174638,0.017584693,0.054711897,0.0011316007,0.00071522477,0.000034812896,0.00056451774,0.0006524562,0.807141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99267185,0.00029905446,0.0007200926,0.0024613168,0.0013609817,0.0024866979],"domain_scores_gemma":[0.992612,0.00046595177,0.0010938459,0.0037387414,0.00053441845,0.0015550232],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.00086102355,0.001653997,0.0014238607,0.0024542087,0.0040875636,0.0009221513,0.009947282,0.0018810938,0.00056734245],"category_scores_gemma":[0.00011547657,0.0021239116,0.0013144562,0.00067406823,0.0017136621,0.004522428,0.004741631,0.0027681745,0.0007536448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010713572,0.00017449007,0.000217966,0.00030265545,0.00080202526,0.0085633155,0.003848599,0.0037261993,0.0006579287,0.9424846,0.011058633,0.02709222],"study_design_scores_gemma":[0.009963668,0.0006015137,0.0016032367,0.0019605681,0.000644128,0.0027283705,0.0024165811,0.032522026,0.0004988921,0.19047426,0.75188124,0.00470554],"about_ca_topic_score_codex":0.00025465165,"about_ca_topic_score_gemma":0.00047470906,"teacher_disagreement_score":0.75201035,"about_ca_system_score_codex":0.0029781288,"about_ca_system_score_gemma":0.0027778973,"threshold_uncertainty_score":0.99962074},"labels":[],"label_agreement":null},{"id":"W2946703759","doi":"10.4230/lipics.mfcs.2019.59","title":"Counting Homomorphisms Modulo a Prime Number","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Combinatorics; Modulo; Mathematics; Discrete mathematics; Graph homomorphism; Graph; Prime (order theory); Prime number; Graph power; Line graph","score_opus":0.022752544219782747,"score_gpt":0.29763978576484207,"score_spread":0.27488724154505934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946703759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06374885,0.0001245216,0.9101964,0.00033985576,0.003409973,0.0042552836,0.0011197707,0.00083063834,0.015974687],"genre_scores_gemma":[0.7949005,0.000151123,0.19727051,0.0014446331,0.00054056145,0.0008972446,0.0014003514,0.00027037607,0.0031247414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99291116,0.00014647536,0.0020695317,0.0011028068,0.0017477559,0.0020222866],"domain_scores_gemma":[0.99248445,0.0004585241,0.0014252601,0.004106826,0.0010762722,0.00044863884],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020209716,0.0011366532,0.001342409,0.00063235336,0.0005204119,0.0017263644,0.006259957,0.00094216835,0.000091062495],"category_scores_gemma":[0.00028228937,0.0011070276,0.0008212694,0.00066419144,0.00033217078,0.0027514715,0.0076777115,0.0027033864,0.0018565019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010081573,0.0030745652,0.03448425,0.018692572,0.003814015,0.00019031501,0.039952196,0.026827889,0.0004552224,0.7425524,0.031218989,0.09772943],"study_design_scores_gemma":[0.0061496706,0.00038610623,0.0008727072,0.0017941938,0.0001238817,0.0003330486,0.0007494602,0.7533111,0.0027800205,0.13045482,0.099103846,0.003941153],"about_ca_topic_score_codex":0.000025474235,"about_ca_topic_score_gemma":0.000004929562,"teacher_disagreement_score":0.7311516,"about_ca_system_score_codex":0.0004978997,"about_ca_system_score_gemma":0.000552514,"threshold_uncertainty_score":0.99959743},"labels":[],"label_agreement":null},{"id":"W294789553","doi":"","title":"Combinatorics and Graph Theory, by J. M. Harris, J. L. Hirst, M. J. Mossinghoff","year":2001,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph theory; Graph; Discrete mathematics","score_opus":0.01213149790422024,"score_gpt":0.2321512127070419,"score_spread":0.22001971480282165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W294789553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49853194,0.0012727965,0.4957392,0.0004206868,0.00014934072,0.00015863907,0.00001504156,0.00015471125,0.003557652],"genre_scores_gemma":[0.99087906,0.0004137201,0.004288108,0.000088114764,0.000018774788,5.3026804e-7,0.000009231565,0.000018939943,0.0042835083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787694,0.00027476577,0.00016479702,0.0006017369,0.00053405657,0.0005477072],"domain_scores_gemma":[0.99822474,0.00031543264,0.00017187424,0.0007797326,0.0002114384,0.00029676978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084148574,0.00023283539,0.0003242969,0.0003330869,0.0007896074,0.00016243575,0.0014322469,0.00013901817,0.000074143],"category_scores_gemma":[0.000083556595,0.00028163823,0.00013560364,0.0011390914,0.0008929415,0.0012922022,0.0006629263,0.00032171805,0.000038425194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055806468,0.00009968972,0.004690798,0.000020980877,0.00005391687,0.000046546418,0.0010613322,0.000014291991,0.00005141909,0.9909009,0.0025419965,0.00046236705],"study_design_scores_gemma":[0.0008770246,0.0001391327,0.0010598345,0.000014851372,0.000018240811,0.00003885249,0.00091611006,0.00062508305,0.000008100812,0.9908742,0.005137295,0.0002913291],"about_ca_topic_score_codex":0.000088856206,"about_ca_topic_score_gemma":0.000034329103,"teacher_disagreement_score":0.49234715,"about_ca_system_score_codex":0.00009253223,"about_ca_system_score_gemma":0.00007237409,"threshold_uncertainty_score":0.9999636},"labels":[],"label_agreement":null},{"id":"W2948073045","doi":"10.1142/s1793830920500391","title":"A separator-based method for generating weakly chordal graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Treewidth; Graph; Block graph; Outerplanar graph; Discrete mathematics; Computer science; Pathwidth; Algorithm; Line graph; 1-planar graph","score_opus":0.044234334651032416,"score_gpt":0.36754259478659695,"score_spread":0.3233082601355645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948073045","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006698206,0.0003199892,0.9947675,0.0014343432,0.000054410546,0.002475518,0.00034063778,0.00023723856,0.000303403],"genre_scores_gemma":[0.0013200999,0.000033255197,0.99252176,0.00021238267,0.00016859137,0.005492432,0.00013668348,0.000054545166,0.000060219994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759066,0.00007702743,0.00053432526,0.0010252062,0.000369673,0.00040313657],"domain_scores_gemma":[0.99737614,0.0005983178,0.0003427014,0.001179038,0.00023676001,0.00026704138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067805726,0.0003880115,0.0005154148,0.00017031624,0.0004376809,0.0005431741,0.0012975186,0.00018380884,0.0000037415534],"category_scores_gemma":[0.000081690276,0.00036404352,0.0002455902,0.00046853907,0.000107968204,0.00011374751,0.0009909375,0.00047262784,0.000007240645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029671394,0.000081243554,0.000001948016,0.000626647,0.000078500474,0.0000012237585,0.00048184668,0.0023515902,0.0018293723,0.9607817,0.00015855567,0.033604432],"study_design_scores_gemma":[0.00014202291,0.000026944743,0.0000015744507,0.00003326741,0.000024238752,0.0000022704824,0.000044417622,0.5684548,0.0008673503,0.428203,0.0019602191,0.0002399109],"about_ca_topic_score_codex":0.000005786742,"about_ca_topic_score_gemma":0.0000018646336,"teacher_disagreement_score":0.5661032,"about_ca_system_score_codex":0.000032289878,"about_ca_system_score_gemma":0.00018122,"threshold_uncertainty_score":0.99988115},"labels":[],"label_agreement":null},{"id":"W2948217655","doi":"","title":"Two Tallest Trees","year":2017,"lang":"en","type":"article","venue":"Dalhousie review","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geology","score_opus":0.05008914162275741,"score_gpt":0.36955627844989253,"score_spread":0.3194671368271351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948217655","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015571733,0.58245444,0.16753754,0.030759972,0.0010708675,0.0023018667,0.00001779431,0.0009755703,0.21332474],"genre_scores_gemma":[0.23123848,0.6480601,0.10195855,0.0069512813,0.00056069216,0.00035511312,0.000012712998,0.00011418269,0.010748902],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986705,0.00010469699,0.0002006074,0.00037478335,0.00030926877,0.0003401272],"domain_scores_gemma":[0.9969534,0.00007171432,0.00016029693,0.0026059926,0.00007565169,0.00013289409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073663064,0.00013491424,0.00029034994,0.00004331436,0.0004450008,0.00024057062,0.0028547996,0.000021430476,0.00006304547],"category_scores_gemma":[0.00036082475,0.000108192035,0.00012078747,0.00014343065,0.00014199356,0.0006971773,0.00091826555,0.00015423138,0.00068855775],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013289276,0.000035845704,0.00030049583,0.0004505319,0.000013996124,0.000078864956,0.00003319462,0.000001870637,0.00012470495,0.3535005,0.002234787,0.6432239],"study_design_scores_gemma":[0.0005993238,0.00008760481,0.004557805,0.0034544468,0.00002213501,0.000109903565,0.0000030806825,0.00067601644,0.00026765882,0.07527478,0.91439104,0.00055622734],"about_ca_topic_score_codex":0.000014609605,"about_ca_topic_score_gemma":0.00003639522,"teacher_disagreement_score":0.9121562,"about_ca_system_score_codex":0.000015423957,"about_ca_system_score_gemma":0.000051658775,"threshold_uncertainty_score":0.88502467},"labels":[],"label_agreement":null},{"id":"W2949180570","doi":"10.24963/ijcai.2019/180","title":"Local Search with Efficient Automatic Configuration for Minimum Vertex Cover","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Youth Innovation Promotion Association of the Chinese Academy of Sciences; Youth Innovation Promotion Association; Chinese Academy of Sciences","keywords":"Computer science; Vertex cover; Configurator; Solver; Cover (algebra); Local search (optimization); Vertex (graph theory); Parametric statistics; Theoretical computer science; Process (computing); Graph; Algorithm; Mathematics","score_opus":0.014976730716252074,"score_gpt":0.2824998663726041,"score_spread":0.26752313565635205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949180570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094637536,0.000009890763,0.89760464,0.00025021797,0.000085918975,0.0007747086,0.000001849653,0.00012601768,0.0065092025],"genre_scores_gemma":[0.97280324,3.6854468e-7,0.023159752,0.00015753515,0.000006407212,0.00004080574,0.000003325928,0.0000104403225,0.0038181294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986298,0.000058724214,0.00013410217,0.00035673333,0.00045616445,0.00036446555],"domain_scores_gemma":[0.99878395,0.00039677575,0.000027244678,0.00051922945,0.00017876258,0.00009402465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039200202,0.00010344804,0.00013138572,0.00011211662,0.00007925825,0.000102579754,0.00052945846,0.000037170917,0.00019796248],"category_scores_gemma":[0.000020264055,0.000073781004,0.000038653245,0.00035251118,0.00008911162,0.00023934977,0.00009585218,0.00009030363,0.00061081094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014294092,0.00015935801,0.00018900592,0.00014034478,0.00003720662,0.0000067266965,0.00052642636,0.057768922,0.00626048,0.89233,0.00093151105,0.04150706],"study_design_scores_gemma":[0.0008617465,0.00044611824,0.00033256732,0.000020424266,0.0000017488659,0.0000071971585,0.00007979523,0.98278695,0.012534807,0.0022948086,0.0005063952,0.00012745564],"about_ca_topic_score_codex":0.0000035566327,"about_ca_topic_score_gemma":0.00000192167,"teacher_disagreement_score":0.925018,"about_ca_system_score_codex":0.00005755917,"about_ca_system_score_gemma":0.00013142555,"threshold_uncertainty_score":0.78509426},"labels":[],"label_agreement":null},{"id":"W2949183653","doi":"10.1145/2493132.2462381","title":"Robust geometric spanners","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Robustness (evolution); Treewidth; Computer science; Mathematics; Dimension (graph theory); Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.07011186444677173,"score_gpt":0.30116297992944385,"score_spread":0.23105111548267213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949183653","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031037098,0.0003780914,0.9553819,0.00085731765,0.0007581037,0.0004340087,0.000002486759,0.00050153164,0.038582876],"genre_scores_gemma":[0.19411272,0.00026970435,0.77239394,0.0004939127,0.00022906002,0.0002616253,0.000014773223,0.000056145906,0.03216809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744827,0.00011313841,0.00025830435,0.0009527848,0.0006304253,0.0005970973],"domain_scores_gemma":[0.9970655,0.00022069218,0.00011140321,0.0021169204,0.00024715488,0.00023831996],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00050575624,0.00027574113,0.00029755756,0.0011910603,0.000085212094,0.00047839334,0.0041195094,0.00023474499,0.00041497342],"category_scores_gemma":[0.00018009273,0.00023498079,0.00016026622,0.0015157057,0.00010083855,0.00040509104,0.0067341356,0.00094355963,0.0015281748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000431235,0.000110765715,0.0003427121,0.00013653195,0.000098397555,0.000048091286,0.00014440964,0.050043862,0.000064513064,0.7814155,0.026697319,0.14089356],"study_design_scores_gemma":[0.00033989758,0.000091845264,0.0016013348,0.00006956743,0.000008243416,0.000020390424,0.000039970324,0.19981259,0.001926893,0.7851027,0.0098077,0.0011788228],"about_ca_topic_score_codex":0.00010012295,"about_ca_topic_score_gemma":0.0000035979776,"teacher_disagreement_score":0.19100901,"about_ca_system_score_codex":0.00010021764,"about_ca_system_score_gemma":0.0001514338,"threshold_uncertainty_score":0.9992493},"labels":[],"label_agreement":null},{"id":"W2949183888","doi":"10.48550/arxiv.0911.3803","title":"Twins of rayless graphs","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Genealogy; Combinatorics; Mathematics; Computer science; History","score_opus":0.06093305704776881,"score_gpt":0.3270812670996542,"score_spread":0.2661482100518854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949183888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82171726,0.00075975544,0.17228976,0.0005140934,0.00052268035,0.0004215959,0.000012557581,0.00025277605,0.0035094866],"genre_scores_gemma":[0.98436934,0.00021612112,0.014749316,0.00018887152,0.000070136324,0.000030222895,0.000008668698,0.000024330122,0.0003430008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997276,0.00023657511,0.00045672458,0.0009062381,0.0005826926,0.0005417669],"domain_scores_gemma":[0.9966629,0.0001727866,0.00028838695,0.002433299,0.00026798542,0.00017461716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067637896,0.0003248775,0.00051040767,0.00044230165,0.00009163419,0.000060712176,0.0036337413,0.00025942578,0.000023332734],"category_scores_gemma":[0.00012035626,0.0003154088,0.0003047661,0.0007138744,0.00023625544,0.0002577186,0.0024397406,0.0009651572,0.00009554754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094533665,0.00078206015,0.28376555,0.0005923975,0.0003191992,0.00026104675,0.0021039662,0.002926795,0.016327674,0.6215786,0.0011843118,0.0700639],"study_design_scores_gemma":[0.0005523103,0.00019918852,0.25741825,0.00031766196,0.000021340653,0.000013611871,0.000033688324,0.001467448,0.027898923,0.70978814,0.0015027745,0.0007866384],"about_ca_topic_score_codex":0.000027394726,"about_ca_topic_score_gemma":0.000007872084,"teacher_disagreement_score":0.16265205,"about_ca_system_score_codex":0.00005127907,"about_ca_system_score_gemma":0.0001928047,"threshold_uncertainty_score":0.9999298},"labels":[],"label_agreement":null},{"id":"W2949221968","doi":"10.1002/jgt.20343","title":"Contractors and connectors of graph algebras","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Hungarian Scientific Research Fund","keywords":"Mathematics; Homomorphism; Graph homomorphism; Combinatorics; Line graph; Discrete mathematics; Algebra homomorphism; Voltage graph; Graph","score_opus":0.019154664229650918,"score_gpt":0.26516413356009655,"score_spread":0.24600946933044562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949221968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89744085,0.002808691,0.09872049,0.00013253976,0.00031753717,0.00010238072,0.0000030202086,0.00002401544,0.0004504711],"genre_scores_gemma":[0.99414015,0.00075192115,0.0048907106,0.00010222081,0.000049735892,0.0000013276773,1.8409446e-7,0.000014558562,0.00004920883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780226,0.000464752,0.00061749114,0.00021115533,0.00057467615,0.0003296923],"domain_scores_gemma":[0.99709904,0.0012326988,0.00059628836,0.0004137574,0.0004042242,0.00025399734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019790845,0.00017953338,0.00046210707,0.0008550069,0.0001619182,0.000033451703,0.00097122183,0.00008241404,0.000027947468],"category_scores_gemma":[0.00042643625,0.00013972833,0.00027654905,0.0008062639,0.0008330418,0.0007867393,0.00014035436,0.00042657432,0.0000021607962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029521738,0.00015773294,0.018537644,0.000025028463,0.00020308424,0.00024015224,0.0014376865,0.000033487646,0.010164252,0.96278423,0.00024040909,0.0058811028],"study_design_scores_gemma":[0.0012106512,0.0006561922,0.0290483,0.000066698034,0.00002151994,0.0011574767,0.00023237751,0.000036374946,0.013808781,0.9531769,0.000372941,0.00021178571],"about_ca_topic_score_codex":0.0000030127756,"about_ca_topic_score_gemma":0.000001028251,"teacher_disagreement_score":0.096699275,"about_ca_system_score_codex":0.00001661712,"about_ca_system_score_gemma":0.0001083808,"threshold_uncertainty_score":0.5697956},"labels":[],"label_agreement":null},{"id":"W2949269876","doi":"10.48550/arxiv.1308.3385","title":"Meyniel's conjecture on the cop number: a survey","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjecture; Combinatorics; Graph; Mathematics; Order (exchange); Constant (computer programming); Collatz conjecture; Discrete mathematics; Computer science; Economics","score_opus":0.11521905486426176,"score_gpt":0.22613452526269748,"score_spread":0.11091547039843572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949269876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6094165,0.000051484774,0.37315816,0.0008898785,0.00084026245,0.001135486,0.00007121235,0.0004294272,0.014007618],"genre_scores_gemma":[0.9940862,0.000111718124,0.00036915578,0.00035289605,0.000051647246,0.000004266277,0.000015940415,0.000027012942,0.004981175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965168,0.0011744787,0.00017911544,0.0013180086,0.00022436828,0.00058717735],"domain_scores_gemma":[0.9949266,0.0015236691,0.00021606132,0.0028132235,0.00030159164,0.00021891123],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010075928,0.0004093657,0.00036551064,0.00018366902,0.0003178534,0.00026001362,0.0049265088,0.00033819128,0.00033134627],"category_scores_gemma":[0.00024316387,0.00032841935,0.00023020881,0.0010075686,0.0003473823,0.0002910218,0.0033809738,0.0015894702,0.0015241934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046717258,0.00006959912,0.0035991024,0.000021699549,0.00010588257,0.00015727163,0.00015840711,0.02632144,0.00001129014,0.9652124,0.0039245393,0.00037165632],"study_design_scores_gemma":[0.00060650555,0.00011830574,0.007732567,0.00011626098,0.000025687545,0.0000121788,0.00007038471,0.1331949,0.00037812756,0.85419816,0.0026436492,0.0009033139],"about_ca_topic_score_codex":0.0004575098,"about_ca_topic_score_gemma":0.00009647137,"teacher_disagreement_score":0.38466972,"about_ca_system_score_codex":0.00018454726,"about_ca_system_score_gemma":0.00023452242,"threshold_uncertainty_score":0.9999168},"labels":[],"label_agreement":null},{"id":"W2949415695","doi":"10.48550/arxiv.1308.0377","title":"Point determining digraphs, $\\{0,1\\}$-matrix partitions, and dualities in full homomorphisms","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Combinatorics; Diagonal; Mathematics; Diagonal matrix; Point (geometry); Vertex (graph theory); Matrix (chemical analysis); Homomorphism; Discrete mathematics; Graph; Geometry","score_opus":0.07283567837583571,"score_gpt":0.22538938786909732,"score_spread":0.1525537094932616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949415695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81749624,0.0003425323,0.18044844,0.00012750214,0.00020986097,0.00044552633,0.000025157115,0.00020726549,0.00069744873],"genre_scores_gemma":[0.9944443,0.00057378894,0.003996925,0.00004632919,0.00002793912,0.000009477387,0.000012175453,0.000021535354,0.0008675388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974323,0.0003478583,0.00030025112,0.001179993,0.00014032357,0.00059931126],"domain_scores_gemma":[0.99786085,0.00033953437,0.0002020712,0.0012164736,0.00013346208,0.00024760928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004729046,0.00035318808,0.00041990288,0.00083249004,0.00019150466,0.00026013658,0.0014279217,0.0002445785,0.00004087159],"category_scores_gemma":[0.000074392236,0.0004109662,0.00014285395,0.0007628755,0.00038979223,0.0009604326,0.0028248862,0.00078831863,0.00006216194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032012067,0.000084862775,0.0063295118,0.00013864835,0.00005089339,0.0007042868,0.0007453417,0.019499252,0.00009852295,0.9711968,0.00010912114,0.0010107888],"study_design_scores_gemma":[0.0005905824,0.00010046888,0.0024358046,0.00021968845,0.000018807526,0.000031978176,0.00043719413,0.12042926,0.00015577675,0.8747974,0.00017342441,0.0006096218],"about_ca_topic_score_codex":0.00013854538,"about_ca_topic_score_gemma":0.00007931993,"teacher_disagreement_score":0.17694803,"about_ca_system_score_codex":0.00013655308,"about_ca_system_score_gemma":0.00012772242,"threshold_uncertainty_score":0.99983424},"labels":[],"label_agreement":null},{"id":"W2949460568","doi":"10.14288/1.0043364","title":"The Complexity of the Comparator Circuit Value Problem","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Conjecture; Bipartite graph; Combinatorics; Class (philosophy); Discrete mathematics; Oracle; Complexity class; Comparator; P; Space (punctuation); Time complexity; Graph; Computer science","score_opus":0.19575173089292822,"score_gpt":0.2374048105381054,"score_spread":0.04165307964517717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949460568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17091835,0.00045653014,0.81157714,0.0006041606,0.0012752364,0.0015989675,0.00004913442,0.00023821698,0.013282235],"genre_scores_gemma":[0.99799234,0.00005388828,0.0008979846,0.00003960782,0.000046631347,0.000002183212,0.0000019298684,0.000014856079,0.0009505836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750555,0.00071505626,0.00025673732,0.0006985705,0.00025068593,0.0005734076],"domain_scores_gemma":[0.99593365,0.00036996108,0.00041521166,0.0028419571,0.0002738883,0.00016532127],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009055523,0.0002753162,0.00032730546,0.00010359662,0.0005883584,0.00009678512,0.006685546,0.00016238379,0.000012520681],"category_scores_gemma":[0.000047613794,0.00019326388,0.00031789232,0.0009240522,0.0017611797,0.00028594874,0.0058140913,0.0009674943,0.00005055933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015978689,0.00006679955,0.0025187065,0.000047593556,0.00006804703,0.0000057322063,0.00022016224,0.018582687,0.00009135489,0.97800344,0.0001485219,0.00023095995],"study_design_scores_gemma":[0.00024318494,0.000019734396,0.0056384974,0.000062221225,0.000029762048,0.0000047372378,0.00005742279,0.05045786,0.00072750286,0.94137263,0.0011238348,0.00026262423],"about_ca_topic_score_codex":0.0000747565,"about_ca_topic_score_gemma":0.00003258757,"teacher_disagreement_score":0.827074,"about_ca_system_score_codex":0.00017526974,"about_ca_system_score_gemma":0.0002796623,"threshold_uncertainty_score":0.99868876},"labels":[],"label_agreement":null},{"id":"W2949460886","doi":"10.48550/arxiv.1307.7621","title":"Packing Steiner Trees","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Conjecture; Disjoint sets; Graph; Spanning tree; Tree (set theory); Minimum degree spanning tree; Discrete mathematics","score_opus":0.0927021641227326,"score_gpt":0.21549238368014328,"score_spread":0.12279021955741068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949460886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25217804,0.00010527311,0.74031454,0.00012661977,0.00042803347,0.00034880728,0.00000684013,0.0004074276,0.0060844193],"genre_scores_gemma":[0.98885846,0.000120658675,0.0036509898,0.00006779666,0.00007707064,0.0000021133171,0.0000063896123,0.000025316613,0.007191214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975933,0.00023401059,0.00017372277,0.0012732293,0.00015574996,0.0005700329],"domain_scores_gemma":[0.9971247,0.00018528459,0.00018077946,0.002034446,0.00023131854,0.0002434719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002875172,0.00033363164,0.00032753806,0.00043171327,0.00017774093,0.00022434322,0.0033803824,0.00025576702,0.00009855539],"category_scores_gemma":[0.000052522002,0.00035862887,0.00022897571,0.00075931783,0.00019661042,0.0007435193,0.004449072,0.00084168115,0.000493505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014079479,0.000062531,0.001787402,0.0000443591,0.00008305693,0.00032893574,0.00018282885,0.08808111,0.00020296656,0.90525705,0.00047384467,0.003481865],"study_design_scores_gemma":[0.00040304987,0.000056788314,0.0012778398,0.00009612462,0.000021404532,0.0000052717983,0.00006819141,0.34931853,0.00043716596,0.6461223,0.0015595182,0.00063384214],"about_ca_topic_score_codex":0.00009051193,"about_ca_topic_score_gemma":0.000024779945,"teacher_disagreement_score":0.7366804,"about_ca_system_score_codex":0.0001726223,"about_ca_system_score_gemma":0.00014083096,"threshold_uncertainty_score":0.9998866},"labels":[],"label_agreement":null},{"id":"W2949599905","doi":"10.48550/arxiv.1206.4854","title":"Constraint satisfaction parameterized by solution size","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Parameterized complexity; Constraint satisfaction problem; Cardinality (data modeling); Mathematics; Complexity of constraint satisfaction; Constraint satisfaction dual problem; Constraint (computer-aided design); Constraint satisfaction; Combinatorics; Set (abstract data type); Vertex cover; Variable (mathematics); Mathematical optimization; Discrete mathematics; Local consistency; Time complexity; Computer science; Statistics","score_opus":0.07530897034138763,"score_gpt":0.22187996696642703,"score_spread":0.14657099662503942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949599905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24038464,0.000081534155,0.7573868,0.00008443847,0.000553097,0.00034541677,0.000032140048,0.00029277464,0.0008391702],"genre_scores_gemma":[0.9914644,0.00015653095,0.0074748173,0.000053999876,0.00004641904,0.0000029014118,0.00001547645,0.000019066181,0.00076638744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975766,0.00040161924,0.00021103756,0.0010267621,0.00015990788,0.00062405143],"domain_scores_gemma":[0.9976354,0.00039627522,0.0002544809,0.0012786846,0.00014794251,0.00028717052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049459294,0.00032680394,0.0003354626,0.00018238397,0.00021067074,0.00012271931,0.0012550447,0.0003438187,0.00009863689],"category_scores_gemma":[0.00012137884,0.00038895008,0.00021336404,0.0005019813,0.0003325007,0.0007356005,0.0016590696,0.00083193724,0.00016152195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031272986,0.00036337166,0.010411386,0.00022456783,0.00044185435,0.00024070853,0.0005601076,0.021548064,0.027509972,0.90377456,0.0018218044,0.032790888],"study_design_scores_gemma":[0.0025165693,0.0001927355,0.00861065,0.00017224702,0.0001484512,0.000042820746,0.00014846817,0.31271687,0.005064367,0.66620946,0.002033089,0.0021442655],"about_ca_topic_score_codex":0.00014218272,"about_ca_topic_score_gemma":0.000012637817,"teacher_disagreement_score":0.75107974,"about_ca_system_score_codex":0.00037208496,"about_ca_system_score_gemma":0.00014755527,"threshold_uncertainty_score":0.99985623},"labels":[],"label_agreement":null},{"id":"W2949684529","doi":"10.1137/1.9781611975482.144","title":"On the Spanning and Routing Ratio of Theta-Four","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Computer science; Mathematics; Euclidean distance; Routing (electronic design automation); Graph; Discrete mathematics; Computer network; Artificial intelligence","score_opus":0.10635308016882122,"score_gpt":0.2731127318756878,"score_spread":0.16675965170686657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949684529","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022279406,0.000110537956,0.1838292,0.000472382,0.00026112897,0.0051160264,0.00008745986,0.00012849021,0.8077668],"genre_scores_gemma":[0.13517891,0.000100698766,0.1377329,0.0008944752,0.0013219583,0.00042997138,0.000024842173,0.00040713346,0.72390914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986404,0.00000839951,0.00037715753,0.00037145874,0.00034713667,0.0002554388],"domain_scores_gemma":[0.99730927,0.0016609902,0.00041557025,0.00049458485,0.000062038474,0.00005757558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010600642,0.00028686252,0.000470749,0.000038037746,0.00027246596,0.00011607027,0.00048006442,0.000353875,0.0000051256693],"category_scores_gemma":[0.000053527234,0.0001925043,0.0002650284,0.000021966049,0.00028447897,0.000032851487,0.0003905709,0.0005978212,0.000003015531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012041243,0.0000053223725,8.9607305e-8,0.00009697547,0.00011518563,1.4927497e-7,0.0015716315,0.000007429618,0.0003292256,0.99006414,0.00032789152,0.0074698846],"study_design_scores_gemma":[0.0006406958,0.000100682344,6.3539524e-8,0.0002517449,0.00004945208,0.000003215456,0.0003219144,0.0027313628,0.0012900915,0.9922788,0.0020995163,0.00023241919],"about_ca_topic_score_codex":4.072436e-7,"about_ca_topic_score_gemma":1.9414753e-7,"teacher_disagreement_score":0.13295098,"about_ca_system_score_codex":0.000020701684,"about_ca_system_score_gemma":0.000101334685,"threshold_uncertainty_score":0.78500974},"labels":[],"label_agreement":null},{"id":"W2949778016","doi":"10.7151/dmgt.2230","title":"Block graphs with large paired domination multisubdivision number","year":2019,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Domination analysis; Mathematics; Block (permutation group theory); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence; Vertex (graph theory)","score_opus":0.009081031418182142,"score_gpt":0.26549238221620197,"score_spread":0.25641135079801985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949778016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46765643,0.00007371745,0.52133113,0.00044637854,0.0002652218,0.0013615058,0.000013453004,0.0006346267,0.008217546],"genre_scores_gemma":[0.96760005,0.000018058538,0.029773928,0.00010211724,0.000015961858,0.00012656118,0.000010971972,0.000058623733,0.0022937125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627686,0.0006040771,0.000470002,0.0008580573,0.0010145531,0.0007764825],"domain_scores_gemma":[0.99677205,0.0007758314,0.00025102936,0.0017592525,0.0001997485,0.00024206977],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021602006,0.00041359678,0.00048061064,0.00042324266,0.00035757496,0.00017468176,0.0014180414,0.00013300372,0.00040960117],"category_scores_gemma":[0.00015344193,0.0002384014,0.00024525693,0.0014166705,0.00020860365,0.0010940538,0.0005192574,0.00033263897,0.0011878957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015942464,0.000426509,0.002515572,0.00012829178,0.000058092304,0.00001786734,0.001756904,0.000018445187,0.0012992871,0.9890403,0.00008427568,0.0044949953],"study_design_scores_gemma":[0.0016355843,0.00015885138,0.0028647168,0.0003167359,0.000020249083,0.000066528984,0.0008576863,0.0038372818,0.002142558,0.98736376,0.00022321363,0.00051283377],"about_ca_topic_score_codex":8.483649e-7,"about_ca_topic_score_gemma":0.0000023930775,"teacher_disagreement_score":0.4999436,"about_ca_system_score_codex":0.00003245769,"about_ca_system_score_gemma":0.000042729116,"threshold_uncertainty_score":0.9995898},"labels":[],"label_agreement":null},{"id":"W2949844502","doi":"10.48550/arxiv.1312.5012","title":"The Highly Connected Matroids in Minor-closed Classes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Marsden Fund; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Minor (academic); Characterization (materials science); Class (philosophy); Mathematics; State (computer science); Combinatorics; Graphic matroid; Field (mathematics); Discrete mathematics; Computer science; Pure mathematics; Physics; Algorithm; Artificial intelligence","score_opus":0.06075827200381531,"score_gpt":0.21047176577669133,"score_spread":0.14971349377287602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949844502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8564753,0.0002337525,0.13743739,0.0005268888,0.0006168884,0.00078981754,0.000009937141,0.00034165074,0.0035683736],"genre_scores_gemma":[0.99408543,0.00034366967,0.0012419211,0.000060821898,0.00004376168,0.000006228352,0.0000069752427,0.000023599672,0.0041875974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706966,0.0005447188,0.00027334006,0.0011919814,0.00018113731,0.00073916244],"domain_scores_gemma":[0.9962416,0.0009297088,0.00022042061,0.0021426182,0.00027014886,0.00019549385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050259824,0.00035895823,0.0003535768,0.00044142752,0.0002872363,0.0003155105,0.0045586834,0.00029219815,0.000028334578],"category_scores_gemma":[0.0001523959,0.00032039307,0.0001888425,0.0012788798,0.00039316263,0.0005174288,0.0034325032,0.0011190635,0.00028685413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056811677,0.000076729164,0.0032109993,0.000039894905,0.000063303974,0.00032040858,0.0001382912,0.018369738,0.00025941737,0.9757296,0.00052611093,0.0012087268],"study_design_scores_gemma":[0.00091727736,0.00008629971,0.008482919,0.00009208887,0.000017623037,0.00000604474,0.0001802418,0.23758316,0.0005441704,0.74899364,0.002436142,0.0006604213],"about_ca_topic_score_codex":0.00024260754,"about_ca_topic_score_gemma":0.00020001282,"teacher_disagreement_score":0.22673595,"about_ca_system_score_codex":0.0002966025,"about_ca_system_score_gemma":0.0002748493,"threshold_uncertainty_score":0.99992484},"labels":[],"label_agreement":null},{"id":"W2949906226","doi":"10.1016/j.dam.2014.12.006","title":"The cost of perfection for matchings in graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Combinatorics; Mathematics; Bipartite graph; Matching (statistics); Strong perfect graph theorem; Triangulation; Minimum weight; Cubic graph; Upper and lower bounds; Polygon mesh; Chordal graph; Discrete mathematics; Line graph; 1-planar graph; Graph; Geometry","score_opus":0.015273570900178775,"score_gpt":0.28621066416236846,"score_spread":0.2709370932621897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949906226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015245007,0.000015155137,0.9791078,0.00013929016,0.00004676002,0.00070250675,0.0000018636533,0.00004211942,0.004699522],"genre_scores_gemma":[0.8514362,0.00001580887,0.14812732,0.00003060601,0.00001240684,0.00030024268,0.0000017813378,0.000016579661,0.000059061025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990242,0.000024997778,0.00027954645,0.00018550814,0.00022600008,0.0002597226],"domain_scores_gemma":[0.9982227,0.0010117162,0.00013309247,0.000547861,0.000047065372,0.000037578062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012116588,0.000100419296,0.0001684861,0.000090589245,0.00013948699,0.00005822685,0.0007013032,0.000037455437,0.0000010295535],"category_scores_gemma":[0.00013005888,0.000068676825,0.00006216194,0.00033540264,0.00010874105,0.000099428435,0.00013681984,0.00011005354,0.0000058826286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010678584,0.000024279223,0.000012610178,0.0000799417,0.0000050593508,5.825025e-8,0.0007494303,0.0001120161,0.0035530336,0.98124915,0.000026758176,0.014176993],"study_design_scores_gemma":[0.0002999348,0.00003840577,0.00006839298,0.000020600639,0.0000026714117,0.0000013205636,0.00022658176,0.063009545,0.0064791623,0.9291021,0.00066601933,0.00008525461],"about_ca_topic_score_codex":0.0000019584888,"about_ca_topic_score_gemma":0.000009105135,"teacher_disagreement_score":0.8361912,"about_ca_system_score_codex":0.000017136857,"about_ca_system_score_gemma":0.000012975329,"threshold_uncertainty_score":0.28005597},"labels":[],"label_agreement":null},{"id":"W2949986906","doi":"10.48550/arxiv.0907.3497","title":"A certifying algorithm for 3-colorability of P5-free graphs","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Natural Sciences and Engineering Research Council of Canada; University of Guelph","funders":"","keywords":"Computer science; Combinatorics; Algorithm; Mathematics","score_opus":0.09121376702777372,"score_gpt":0.3435038505590445,"score_spread":0.25229008353127075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949986906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24116348,0.0005467137,0.7551723,0.00072376954,0.00047640808,0.0013072841,0.00006797562,0.0002474183,0.00029462232],"genre_scores_gemma":[0.5286693,0.00010448594,0.47028518,0.00018513322,0.0001228678,0.00036441063,0.000023399896,0.00004576731,0.0001994715],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964756,0.00025829737,0.0006697587,0.0013021776,0.00057009654,0.0007241181],"domain_scores_gemma":[0.9946292,0.00058225717,0.00039002305,0.0036447428,0.000558196,0.00019556803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015757835,0.00039731353,0.00067969575,0.00037739633,0.00017519387,0.0000783833,0.0046469397,0.0003411659,0.000011659902],"category_scores_gemma":[0.0006552373,0.00039268675,0.00050722505,0.00066914933,0.00030128696,0.0003406108,0.003327029,0.0008442359,0.000013575731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020132028,0.0012135839,0.0693987,0.0014208622,0.00041697486,0.00005971416,0.0020849933,0.0012789986,0.0054646474,0.08667549,0.0011755709,0.83060914],"study_design_scores_gemma":[0.0007705583,0.00030220827,0.046128884,0.00016538375,0.000024506513,0.0000053461677,0.000029549576,0.021003896,0.010560165,0.9200009,0.00047071266,0.00053790427],"about_ca_topic_score_codex":0.00004957219,"about_ca_topic_score_gemma":0.000016781209,"teacher_disagreement_score":0.8333254,"about_ca_system_score_codex":0.00012244159,"about_ca_system_score_gemma":0.00026731304,"threshold_uncertainty_score":0.9998525},"labels":[],"label_agreement":null},{"id":"W2950016669","doi":"10.48550/arxiv.1405.3527","title":"On word-representability of polyomino triangulations","year":2014,"lang":"en","type":"preprint","venue":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyomino; Combinatorics; Alphabet; Graph; Mathematics; Word (group theory); Combinatorics on words; Transitive relation; Regular polygon; Discrete mathematics; Computer science; Geometry; Linguistics","score_opus":0.0217490484981604,"score_gpt":0.24008088421726628,"score_spread":0.2183318357191059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950016669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80110276,0.00015605193,0.17175893,0.0004991644,0.00058489287,0.0010842107,0.000363977,0.00013823336,0.024311779],"genre_scores_gemma":[0.9878925,0.0000952281,0.01100502,0.000009244135,0.00006412234,4.788207e-7,0.00003625207,0.000015622165,0.00088155136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950915,0.00076441135,0.00071371766,0.0013132371,0.0015771919,0.00053997344],"domain_scores_gemma":[0.9935506,0.0008410391,0.0014329266,0.0028222,0.0010424634,0.00031074387],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001157037,0.0005606979,0.0010202386,0.00052883127,0.0012560183,0.00005860212,0.005320306,0.0005958931,0.00012880302],"category_scores_gemma":[0.00015996875,0.000631166,0.00095333904,0.00079383515,0.0045500593,0.0007395255,0.002102268,0.0014035329,0.000019489964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011802281,0.0014188703,0.0012188773,0.00067307334,0.00082366716,0.00026910545,0.0031944234,0.05140145,0.013944331,0.9209069,0.00027156313,0.0046975305],"study_design_scores_gemma":[0.013247819,0.0035494596,0.3265456,0.004704669,0.0015263315,0.00038724137,0.027461994,0.05462733,0.046134975,0.51381457,0.0029355756,0.0050644777],"about_ca_topic_score_codex":0.0015376789,"about_ca_topic_score_gemma":0.0002356725,"teacher_disagreement_score":0.40709233,"about_ca_system_score_codex":0.0003804977,"about_ca_system_score_gemma":0.0021085562,"threshold_uncertainty_score":0.99961394},"labels":[],"label_agreement":null},{"id":"W2950068027","doi":"10.48550/arxiv.1310.0340","title":"Complexity of Coloring Graphs without Paths and Cycles","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Complement (music); Characterization (materials science); Induced subgraph; Discrete mathematics; Path (computing); Graph; Physics; Computer science; Chemistry","score_opus":0.13625949017910327,"score_gpt":0.23511716082380074,"score_spread":0.09885767064469747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950068027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7844077,0.00008408251,0.21384366,0.000034609853,0.00013223205,0.00032031268,0.000012776003,0.000120494515,0.0010441778],"genre_scores_gemma":[0.99190307,0.0002404047,0.007586217,0.000015380834,0.000012461113,0.0000016303221,0.0000033426743,0.000014309419,0.00022320113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817324,0.00020757188,0.00019527377,0.0009263196,0.00013006113,0.00036754773],"domain_scores_gemma":[0.9980137,0.00015689962,0.0002478056,0.0011598589,0.00022370499,0.00019805323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031009928,0.0002615064,0.00041501963,0.000381711,0.00014656379,0.00007510893,0.0017037935,0.00017450903,0.000016083606],"category_scores_gemma":[0.000039595052,0.00029026924,0.00013399012,0.0005308102,0.00088446547,0.00044849602,0.0036323732,0.0005396938,0.000015802794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026863394,0.000053352564,0.023677986,0.00012625824,0.00006329255,0.000047531114,0.00020684731,0.005665022,0.00029359764,0.9690662,0.000014124371,0.000758914],"study_design_scores_gemma":[0.00035594025,0.00006323112,0.013014844,0.000093754694,0.000018933739,0.000004022024,0.000080446946,0.12321366,0.00071777456,0.86209375,0.00003359952,0.0003100206],"about_ca_topic_score_codex":0.00017998404,"about_ca_topic_score_gemma":0.000028447712,"teacher_disagreement_score":0.2074954,"about_ca_system_score_codex":0.000061128565,"about_ca_system_score_gemma":0.0000870995,"threshold_uncertainty_score":0.99995494},"labels":[],"label_agreement":null},{"id":"W2950071671","doi":"10.82308/49985","title":"The least-used direction pivot rule on acyclic unique sink orientations","year":2011,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Vancouver Island University; Ministère du Développement Économique, de l’Innovation et de l’Exportation; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Combinatorics; Directed acyclic graph; Mathematics; Exponential function","score_opus":0.03935685852775888,"score_gpt":0.27431352374215706,"score_spread":0.23495666521439817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950071671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8535319,0.000098176315,0.0010566424,0.00035363386,0.0017092101,0.0011807377,0.00010516481,0.0012976308,0.14066689],"genre_scores_gemma":[0.99096966,0.00008322805,0.0057122195,0.00033893343,0.000029519128,0.00020137243,0.000007254169,0.000066437045,0.002591377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584115,0.0009374442,0.00051099365,0.00095178105,0.0008467158,0.00091189245],"domain_scores_gemma":[0.99652123,0.0008454576,0.00023396844,0.0016839107,0.00033520875,0.0003802016],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016430942,0.00038708132,0.00026832582,0.00034547603,0.0031523532,0.00019440155,0.0020886457,0.00017880133,0.00006041975],"category_scores_gemma":[0.00087338133,0.0003172901,0.00021160957,0.0016360132,0.00026414162,0.0017744708,0.0005465648,0.0010706937,0.0006800023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007037118,0.00017614399,0.00007726528,0.0000070357883,0.00003892159,0.000022414952,0.000028328157,0.000030016632,0.0119745275,0.82781565,0.0000035883256,0.1597557],"study_design_scores_gemma":[0.0009450806,0.00048709582,0.0050484673,0.000067633264,0.00002035354,0.00004975603,0.00013011383,0.00038248883,0.22164957,0.71398693,0.056526262,0.00070625055],"about_ca_topic_score_codex":0.00015467101,"about_ca_topic_score_gemma":0.00034834715,"teacher_disagreement_score":0.20967504,"about_ca_system_score_codex":0.00040008881,"about_ca_system_score_gemma":0.000046272315,"threshold_uncertainty_score":0.99992794},"labels":[],"label_agreement":null},{"id":"W2950074414","doi":"10.48550/arxiv.1310.1845","title":"On triangulating k-outerplanar graphs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Outerplanar graph; Mathematics; Graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.07838541225661151,"score_gpt":0.2205766183609507,"score_spread":0.14219120610433916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950074414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42735222,0.00004336264,0.5644846,0.00011471542,0.00059089274,0.00055195665,0.000013835879,0.0004582324,0.006390176],"genre_scores_gemma":[0.99346834,0.000045761066,0.0037370257,0.00014860492,0.00004578009,0.0000028773507,0.000011353885,0.000027911428,0.00251235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972171,0.00032138237,0.0002235051,0.0014438736,0.00019117072,0.00060294056],"domain_scores_gemma":[0.99677116,0.00042698593,0.0002462685,0.0021134804,0.00016696285,0.0002751749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003858555,0.0003880408,0.00038398907,0.00068801525,0.0002351657,0.00020326208,0.0031773718,0.00029724804,0.0000896546],"category_scores_gemma":[0.00010218677,0.00042188587,0.00030388866,0.0009316197,0.00016062167,0.0004863177,0.0023439561,0.0010415612,0.00049848034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003199011,0.00005426664,0.0003142807,0.00003170078,0.00005983488,0.0002721769,0.00011459609,0.07299456,0.00003646211,0.9239756,0.00037929337,0.0017352767],"study_design_scores_gemma":[0.00041885156,0.00007972698,0.0003041076,0.00008396527,0.000012134728,0.0000032264775,0.00002309195,0.22780475,0.000111244386,0.77062505,0.00014593062,0.00038790551],"about_ca_topic_score_codex":0.00007989117,"about_ca_topic_score_gemma":0.0000070653923,"teacher_disagreement_score":0.5661161,"about_ca_system_score_codex":0.00017303697,"about_ca_system_score_gemma":0.000117482865,"threshold_uncertainty_score":0.9998233},"labels":[],"label_agreement":null},{"id":"W2950178342","doi":"10.48550/arxiv.1309.0225","title":"Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Bounded function; Vertex (graph theory); Chromatic scale; Graph; Order (exchange); Discrete mathematics","score_opus":0.012488788454081549,"score_gpt":0.2677304958011391,"score_spread":0.2552417073470576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950178342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.537522,0.0008366527,0.4433841,0.001980965,0.00026106258,0.0019551667,0.000036785474,0.00034506412,0.01367819],"genre_scores_gemma":[0.7864435,0.000086540545,0.21270698,0.00015268438,0.000015951297,0.000094661744,0.000009948272,0.000022606711,0.0004671782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751747,0.00019309498,0.00032298712,0.0010182676,0.0005449812,0.00040322877],"domain_scores_gemma":[0.9969368,0.00027328005,0.00019814195,0.0019208782,0.0004754686,0.0001954479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005065984,0.00034225616,0.000526542,0.0002357007,0.000096401476,0.00021919467,0.001508606,0.00025216147,0.00010001224],"category_scores_gemma":[0.00008886471,0.00024018007,0.0000816854,0.0005441169,0.0008389487,0.00030444795,0.002374068,0.00081251556,0.000006717547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043449985,0.00011450403,0.004930131,0.00036874838,0.00012457774,0.0000072596563,0.0005438646,0.00012830198,0.0002125957,0.980343,0.0002857584,0.012897818],"study_design_scores_gemma":[0.00041840348,0.00020053555,0.0032240192,0.00004291108,0.000009502195,0.000019533456,0.00004139112,0.0020642844,0.0018915385,0.9914692,0.0002863648,0.00033231988],"about_ca_topic_score_codex":0.00020716523,"about_ca_topic_score_gemma":0.000110984314,"teacher_disagreement_score":0.24892144,"about_ca_system_score_codex":0.00003238528,"about_ca_system_score_gemma":0.0002869873,"threshold_uncertainty_score":0.97942597},"labels":[],"label_agreement":null},{"id":"W2950283919","doi":"10.48550/arxiv.1110.6668","title":"On minor-closed classes of matroids with exponential growth rate","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Exponential function; Mathematics; Rank (graph theory); Base (topology); Matroid; Prime power; Integer (computer science); Zero (linguistics); Minor (academic); Prime (order theory); Mathematical analysis","score_opus":0.06938279682279737,"score_gpt":0.19922687239338066,"score_spread":0.1298440755705833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950283919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5785742,0.000015704172,0.41665676,0.000018798135,0.00017510231,0.00027221206,0.000011575818,0.00012423753,0.0041514453],"genre_scores_gemma":[0.99553436,0.000056483066,0.0030493925,0.000026085674,0.000028335444,0.0000017448787,0.0000074079076,0.000027727738,0.0012684521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975886,0.00035819563,0.00020984672,0.0011895541,0.00018398179,0.00046986406],"domain_scores_gemma":[0.9972541,0.00024916072,0.00033202066,0.0016370434,0.00033377644,0.00019393777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033064606,0.0003694792,0.00043621327,0.0005865436,0.000111480804,0.000054697182,0.0027389766,0.00021595904,0.000055803826],"category_scores_gemma":[0.0000444055,0.00036111652,0.00020459766,0.0007633385,0.0003950735,0.0004000206,0.0017474203,0.0006654512,0.00007101201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000647863,0.00022231818,0.0013482783,0.00013152245,0.00015421117,0.0006241921,0.0001856334,0.0091994675,0.00083005463,0.9864356,0.000087818284,0.00013305095],"study_design_scores_gemma":[0.0017995541,0.0009103576,0.0046428894,0.0002915164,0.0000912822,0.000008995753,0.00008084732,0.018894844,0.022221608,0.95010245,0.00004116329,0.0009145112],"about_ca_topic_score_codex":0.00010384846,"about_ca_topic_score_gemma":0.000023300057,"teacher_disagreement_score":0.4169602,"about_ca_system_score_codex":0.00010524999,"about_ca_system_score_gemma":0.0002361547,"threshold_uncertainty_score":0.99988407},"labels":[],"label_agreement":null},{"id":"W2950286736","doi":"10.48550/arxiv.0708.2514","title":"Minimum Cost Homomorphisms to Reflexive Digraphs","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Reflexivity; Mathematics; Computer science; Combinatorics; Discrete mathematics; Business; Algebra over a field; Pure mathematics; Sociology","score_opus":0.09504498766400758,"score_gpt":0.3712476264208572,"score_spread":0.2762026387568496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950286736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49192175,0.0005605902,0.49111882,0.0017423348,0.0018566503,0.0017892016,0.000051245162,0.0006884499,0.010270954],"genre_scores_gemma":[0.9598603,0.00013874649,0.034377426,0.0019217841,0.00038123064,0.00032042345,0.000038625094,0.00009083413,0.0028706165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99502444,0.00023556045,0.0006277726,0.0018574517,0.0009556213,0.0012991697],"domain_scores_gemma":[0.99464655,0.00044778976,0.00026152912,0.0034751464,0.00044911794,0.0007198732],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013196658,0.0006044103,0.0006373243,0.0009672742,0.0002708199,0.00023774408,0.0049416465,0.00044762285,0.00006293202],"category_scores_gemma":[0.00030597954,0.00060932856,0.0003421166,0.0015199684,0.00032036667,0.0003618666,0.0059986967,0.0016566756,0.0015802453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010893203,0.0018570401,0.23749109,0.0008000821,0.0011877078,0.0047713146,0.01068225,0.0052005746,0.025605505,0.4826578,0.023997257,0.20466007],"study_design_scores_gemma":[0.0027805609,0.0014701312,0.2762671,0.0014228657,0.00010852682,0.0001672944,0.0004244049,0.0028858776,0.061882004,0.50321794,0.14281885,0.006554417],"about_ca_topic_score_codex":0.00004742663,"about_ca_topic_score_gemma":0.000036368478,"teacher_disagreement_score":0.46793857,"about_ca_system_score_codex":0.00023747554,"about_ca_system_score_gemma":0.00025983757,"threshold_uncertainty_score":0.9996358},"labels":[],"label_agreement":null},{"id":"W2950307179","doi":"10.48550/arxiv.1408.1461","title":"Ordering without forbidden patterns","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Substructure; Graph; Time complexity; Discrete mathematics","score_opus":0.07952086875495745,"score_gpt":0.2255192431905829,"score_spread":0.14599837443562544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950307179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2603359,0.000020339254,0.73674166,0.00005054422,0.00034054185,0.00023038972,0.000006641023,0.0003108692,0.0019631486],"genre_scores_gemma":[0.99397725,0.00007910928,0.003698833,0.0000774319,0.00009261511,0.0000019517531,0.000007800414,0.00003253489,0.0020324797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975114,0.00022131752,0.00018023088,0.0013386003,0.00015839694,0.0005900785],"domain_scores_gemma":[0.9971354,0.00013767777,0.00019158713,0.002117387,0.0001727521,0.00024517142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004066386,0.00034535356,0.00037144692,0.00037650426,0.00018363111,0.00016836186,0.0035735175,0.0002447315,0.000037874117],"category_scores_gemma":[0.000052755164,0.00039798763,0.00021009333,0.00047099474,0.000121827725,0.00043228417,0.0048763542,0.0008580014,0.00017788219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055668643,0.00009803366,0.041800193,0.00028570852,0.00017540282,0.00050451094,0.00035778648,0.23568565,0.00012815837,0.7159063,0.00015356683,0.0048490227],"study_design_scores_gemma":[0.0006007414,0.00007655165,0.002138707,0.00018358516,0.00002963113,0.000010328074,0.000049148148,0.6521639,0.00041047635,0.34231484,0.0012273311,0.000794755],"about_ca_topic_score_codex":0.0000831244,"about_ca_topic_score_gemma":0.000045099543,"teacher_disagreement_score":0.7336413,"about_ca_system_score_codex":0.00016122825,"about_ca_system_score_gemma":0.00012826388,"threshold_uncertainty_score":0.9998472},"labels":[],"label_agreement":null},{"id":"W2950371578","doi":"10.48550/arxiv.1507.07581","title":"Testing Consumer Rationality using Perfect Graphs and Oriented Discs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rationality; Axiom; Vertex (graph theory); Reduction (mathematics); Mathematics; Vertex cover; Revealed preference; Combinatorics; Binary number; Planar graph; Time complexity; Mathematical economics; Discrete mathematics; Graph; Arithmetic","score_opus":0.18619599099771478,"score_gpt":0.2585643161157203,"score_spread":0.0723683251180055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950371578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6394982,0.00010653137,0.35933557,0.000020875712,0.0001740512,0.0002326587,0.000016018192,0.00015074822,0.00046537738],"genre_scores_gemma":[0.987522,0.000023093342,0.012193241,0.000028593451,0.00001933943,7.809373e-7,0.0000104168685,0.000015336445,0.00018720105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777985,0.00037772494,0.00017966983,0.0011120524,0.00016985401,0.00038087158],"domain_scores_gemma":[0.9976162,0.00038315597,0.00019839482,0.0009616454,0.00056923897,0.0002713653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007490466,0.00027780788,0.00029262184,0.0003209616,0.00030021605,0.0001404633,0.0009521812,0.00016683969,0.000006805484],"category_scores_gemma":[0.00035992966,0.00030658217,0.00009096811,0.0010892896,0.00041668373,0.0005931883,0.0027771823,0.0005983546,0.000010150701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063830084,0.000101827376,0.11422565,0.000120102384,0.00012955445,0.00031070173,0.00033235966,0.08597704,0.00061257073,0.7971397,0.00007253649,0.0009141234],"study_design_scores_gemma":[0.00038958437,0.00003263565,0.003154762,0.000067549176,0.00003291836,0.000011846055,0.000051192423,0.52344155,0.00007400852,0.47234276,0.00005544452,0.0003457799],"about_ca_topic_score_codex":0.000124766,"about_ca_topic_score_gemma":0.000013101128,"teacher_disagreement_score":0.43746448,"about_ca_system_score_codex":0.00019089515,"about_ca_system_score_gemma":0.00040535379,"threshold_uncertainty_score":0.9999386},"labels":[],"label_agreement":null},{"id":"W2950389635","doi":"10.48550/arxiv.1104.3283","title":"Practical and Efficient Split Decomposition via Graph-Labelled Trees","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Lexicographical order; Decomposition; Graph; Modular decomposition; Mathematics; Combinatorics; Context (archaeology); Graph factorization; Inverse; Algorithm; Computer science; Discrete mathematics; Voltage graph; Line graph; Pathwidth","score_opus":0.08764214792040059,"score_gpt":0.25423231157142284,"score_spread":0.16659016365102225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950389635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2462576,0.00006610761,0.7513302,0.000112038426,0.00021143796,0.0003440135,0.000005003914,0.00018865864,0.0014849209],"genre_scores_gemma":[0.9763289,0.00016859596,0.023109894,0.000039344875,0.000028913746,0.0000022539805,0.00000794454,0.000020106638,0.00029403597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735993,0.0003645792,0.00020882823,0.0014038767,0.00016175516,0.0005010501],"domain_scores_gemma":[0.9976665,0.0003006199,0.00021056856,0.0013008394,0.00019528756,0.00032623444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004767265,0.00034456217,0.00035403878,0.00051807164,0.00026812314,0.00012388779,0.0012209141,0.0002798443,0.000044215274],"category_scores_gemma":[0.00004778333,0.00037999413,0.00017209923,0.0006871239,0.00036662983,0.00036625576,0.0029379171,0.0008183655,0.00008502085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017710209,0.00032947713,0.00068760896,0.00006153174,0.00011632777,0.0005986989,0.00028309796,0.026356544,0.00044049477,0.9695678,0.000058453956,0.001322885],"study_design_scores_gemma":[0.00074856647,0.00016435666,0.0020048597,0.00007544667,0.0000700581,0.000045535402,0.000039327642,0.5037726,0.00097448827,0.49147785,0.000057997637,0.0005688886],"about_ca_topic_score_codex":0.000061519735,"about_ca_topic_score_gemma":0.000023789094,"teacher_disagreement_score":0.7300713,"about_ca_system_score_codex":0.00012047271,"about_ca_system_score_gemma":0.00014844189,"threshold_uncertainty_score":0.9998652},"labels":[],"label_agreement":null},{"id":"W2950466444","doi":"10.48550/arxiv.1409.5295","title":"On the Minimum Edge-Density of 4-Critical Graphs of Girth Five","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Klein bottle; Corollary; Mathematics; Combinatorics; Girth (graph theory); Odd graph; Torus; Enhanced Data Rates for GSM Evolution; Graph; Chordal graph; Discrete mathematics; 1-planar graph; Computer science; Geometry","score_opus":0.0598087162081411,"score_gpt":0.22564373212861327,"score_spread":0.16583501592047217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950466444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63289016,0.000020760826,0.3641994,0.00020145554,0.00028700742,0.00025691857,0.000019979174,0.000057190384,0.002067105],"genre_scores_gemma":[0.9986825,0.000032028183,0.00078862585,0.00006504676,0.000019238401,7.6541284e-7,0.000002344737,0.0000132114355,0.00039625412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997682,0.0005755392,0.000252528,0.0008740604,0.0002405689,0.00037531028],"domain_scores_gemma":[0.9948331,0.002100858,0.00025556705,0.0021876472,0.00047599903,0.00014680286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007136034,0.00026811162,0.00045991232,0.00037062148,0.0001337099,0.000026857007,0.0031599405,0.00022094586,0.000028219958],"category_scores_gemma":[0.00054362,0.00023273716,0.0003480476,0.0007534423,0.0011963149,0.00014406667,0.0025982438,0.00079286937,0.000031247237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008116452,0.0001461855,0.00049371884,0.00011479162,0.00005452903,0.00004490916,0.00018956176,0.010511167,0.00016356527,0.9878602,0.00018201784,0.00015820758],"study_design_scores_gemma":[0.00025213635,0.00019260931,0.00092633563,0.00012767079,0.000031974807,0.000001912275,0.000075549324,0.07495771,0.0036566595,0.919517,0.000021358535,0.00023907267],"about_ca_topic_score_codex":0.000043416712,"about_ca_topic_score_gemma":0.000009655666,"teacher_disagreement_score":0.3657923,"about_ca_system_score_codex":0.000053736378,"about_ca_system_score_gemma":0.00014570184,"threshold_uncertainty_score":0.9490746},"labels":[],"label_agreement":null},{"id":"W2950539700","doi":"10.48550/arxiv.1407.6761","title":"Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Treewidth; Constant (computer programming); Minor (academic); Graph; Discrete mathematics; Physics; Pathwidth","score_opus":0.04802291551903676,"score_gpt":0.23271096964705235,"score_spread":0.1846880541280156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950539700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07287241,0.000027690423,0.9252961,0.0000368307,0.00021461563,0.0007978938,0.0002275206,0.00018176367,0.0003451676],"genre_scores_gemma":[0.8530241,0.00004146191,0.14631419,0.00003682607,0.0000509119,0.000005164878,0.00015912416,0.00003294083,0.00033527758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978976,0.00023730635,0.00031012757,0.00097071665,0.00017752258,0.00040670641],"domain_scores_gemma":[0.99746317,0.00040323878,0.00043047208,0.001121103,0.0004172279,0.0001647879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042020492,0.00031273384,0.00048403852,0.00039790414,0.00020406843,0.00007622794,0.0015586683,0.00029214736,0.000022193182],"category_scores_gemma":[0.000041870164,0.00036470318,0.00030824813,0.0005571014,0.0003309259,0.0004365479,0.00056957605,0.00040669224,0.0000488712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002598309,0.00031752526,0.00033974723,0.00051729754,0.00033855127,0.00004485035,0.00038369762,0.08001823,0.0033475203,0.88893986,0.00026369005,0.025229214],"study_design_scores_gemma":[0.00058811385,0.0001146871,0.00006435596,0.00007083666,0.000023616794,0.0000029306384,0.000006543683,0.680995,0.0016480498,0.31611672,0.0001065064,0.0002626453],"about_ca_topic_score_codex":0.000017359425,"about_ca_topic_score_gemma":0.0000019031423,"teacher_disagreement_score":0.7801517,"about_ca_system_score_codex":0.00011448977,"about_ca_system_score_gemma":0.00017461531,"threshold_uncertainty_score":0.9998805},"labels":[],"label_agreement":null},{"id":"W2950552832","doi":"10.48550/arxiv.math/0608672","title":"Factor-Critical Property in 3-Dominating-Critical Graphs","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Dominating set; Vertex (graph theory); Mathematics; Neighbourhood (mathematics); Conjecture; Graph; Discrete mathematics","score_opus":0.08527411829881888,"score_gpt":0.2498760844083057,"score_spread":0.1646019661094868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950552832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20536591,0.0001287483,0.7848876,0.00045078003,0.0007128021,0.0006438541,0.000042646185,0.00042906872,0.0073386002],"genre_scores_gemma":[0.991558,0.000029953408,0.007098537,0.00005815049,0.000046095574,0.000004227249,0.0000072846337,0.000031144187,0.0011665781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960349,0.00056868943,0.00035001407,0.0018077169,0.0002712077,0.0009674609],"domain_scores_gemma":[0.9966882,0.0010230803,0.00008295777,0.001570109,0.0003228812,0.00031277264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048409388,0.00044961588,0.0005135989,0.0008200888,0.00019585849,0.0002073375,0.0029945732,0.00042946963,0.00004397101],"category_scores_gemma":[0.0005890655,0.00042356548,0.00028014596,0.0013397187,0.00081930275,0.00075034157,0.0034273136,0.0017026708,0.00008558534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046818623,0.00030445313,0.00679523,0.00018834783,0.000017353144,0.0016831905,0.00012500888,0.007266866,0.00010406471,0.981597,0.00010049537,0.0017711575],"study_design_scores_gemma":[0.0005173413,0.00008716256,0.003751327,0.00023331762,0.000013839281,0.000011984288,0.000037612863,0.22748819,0.00023597163,0.76677567,0.00018269144,0.000664914],"about_ca_topic_score_codex":0.0002557268,"about_ca_topic_score_gemma":0.00008557089,"teacher_disagreement_score":0.7861921,"about_ca_system_score_codex":0.0003294207,"about_ca_system_score_gemma":0.0002718868,"threshold_uncertainty_score":0.9998216},"labels":[],"label_agreement":null},{"id":"W2950649163","doi":"10.48550/arxiv.1308.1068","title":"List H-Coloring a Graph by Removing Few Vertices","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Parameterized complexity; Discrete mathematics; Conjecture; Homomorphism; Graph homomorphism; Vertex (graph theory); Graph; Graph power; Line graph","score_opus":0.0736527274133749,"score_gpt":0.21130699010994505,"score_spread":0.13765426269657016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950649163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.526986,0.00034767366,0.46713477,0.00014138379,0.0005389195,0.0004504339,0.000011146042,0.00048579823,0.0039038628],"genre_scores_gemma":[0.9928705,0.0003906245,0.003149352,0.000089761634,0.000052397816,0.000004019558,0.000008700286,0.000031682826,0.0034029656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696046,0.00027364743,0.00023695943,0.0015799277,0.00020471877,0.00074429554],"domain_scores_gemma":[0.9969937,0.00029234219,0.00025020313,0.0018945572,0.00022809295,0.00034110894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042793748,0.00040404717,0.0003920543,0.0004948061,0.00034274432,0.0003783361,0.0040649273,0.0002911619,0.00006517026],"category_scores_gemma":[0.0000991134,0.00046910084,0.00025531132,0.0011856786,0.00026866153,0.001174118,0.0046370784,0.0010613773,0.0002046321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084993546,0.00024823687,0.0055567482,0.0003471914,0.000311419,0.0010725603,0.00071837055,0.047758788,0.0031352232,0.9336093,0.0031013684,0.004055783],"study_design_scores_gemma":[0.000840293,0.00013278602,0.0008205942,0.00033447563,0.000068298024,0.000015350415,0.00018707506,0.3118161,0.002152315,0.6787564,0.0034056492,0.001470631],"about_ca_topic_score_codex":0.0003685766,"about_ca_topic_score_gemma":0.000029358147,"teacher_disagreement_score":0.46588448,"about_ca_system_score_codex":0.00025402178,"about_ca_system_score_gemma":0.00014371397,"threshold_uncertainty_score":0.99977607},"labels":[],"label_agreement":null},{"id":"W2950818896","doi":"10.48550/arxiv.1107.4824","title":"Approximation Algorithms for Digraph Width Parameters","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Digraph; Pathwidth; Combinatorics; Mathematics; Bounded function; Discrete mathematics; Partial k-tree; Approximation algorithm; Directed graph; Graph","score_opus":0.1534640730755815,"score_gpt":0.23403806709388975,"score_spread":0.08057399401830825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950818896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026871758,0.000049388313,0.9700432,0.00003891022,0.0004692642,0.0009404218,0.00002849368,0.0003272452,0.001231332],"genre_scores_gemma":[0.85303694,0.00011177735,0.14572665,0.00005612042,0.00004083794,0.0000164489,0.0000362544,0.000033309894,0.00094163296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753684,0.0001667033,0.00021561151,0.0013900003,0.00012877144,0.00056204863],"domain_scores_gemma":[0.9973294,0.0002539456,0.00027145876,0.0016662378,0.0002615988,0.0002173283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004921745,0.00034489823,0.00035156426,0.0005414834,0.00020775587,0.00012605221,0.0027453736,0.00028623463,0.000008781298],"category_scores_gemma":[0.00007318715,0.00039250968,0.00036625293,0.00075668225,0.00023254633,0.00065759075,0.0015793185,0.0005202057,0.00003992574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009183636,0.00013136839,0.0003542842,0.00014467504,0.00014531145,0.00005752337,0.0003666029,0.035205368,0.00004554468,0.95341945,0.00014690789,0.009891162],"study_design_scores_gemma":[0.00036839454,0.0000811288,0.0001084467,0.000036967896,0.000026766462,0.0000019405575,0.000027939255,0.32334673,0.00071136304,0.674802,0.00014284653,0.00034548837],"about_ca_topic_score_codex":0.00004567226,"about_ca_topic_score_gemma":0.000007193227,"teacher_disagreement_score":0.8261652,"about_ca_system_score_codex":0.0001402227,"about_ca_system_score_gemma":0.00013426902,"threshold_uncertainty_score":0.99985266},"labels":[],"label_agreement":null},{"id":"W2950941451","doi":"10.48550/arxiv.1707.05252","title":"Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Hypergraph; Euler's formula; Vertex (graph theory); Mathematics; Traverse; Spanning tree; Euler characteristic; Graph; Discrete mathematics; Mathematical analysis; Geography","score_opus":0.0643260378107674,"score_gpt":0.2216052011505142,"score_spread":0.1572791633397468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950941451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86900324,0.0003208788,0.12775521,0.00011633105,0.00027722988,0.0003170848,0.000004509183,0.00015614204,0.0020493753],"genre_scores_gemma":[0.9959398,0.0003974221,0.002917698,0.000035728048,0.000026705304,0.000003486983,0.0000045652014,0.000033332755,0.0006412553],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970398,0.00022525307,0.0002037862,0.0015474998,0.00022143773,0.00076223526],"domain_scores_gemma":[0.9971919,0.00026584638,0.00024054058,0.0018493909,0.0001768683,0.00027546196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004919772,0.00044794436,0.00051573373,0.00072423497,0.00038299826,0.00031142458,0.0020789353,0.0002524298,0.000007884175],"category_scores_gemma":[0.00013372737,0.00045664114,0.00012557149,0.00063326536,0.00057203294,0.0009803615,0.002795641,0.0010164804,0.000021401069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038607477,0.0002455999,0.35822266,0.00031204725,0.0004287769,0.0074158767,0.0035022232,0.32793683,0.00053073966,0.29502836,0.0001888565,0.005801941],"study_design_scores_gemma":[0.004250075,0.00044492775,0.13365142,0.002220864,0.00018872383,0.00008449464,0.0016990794,0.5937786,0.0013115179,0.2576195,0.0016491294,0.0031016879],"about_ca_topic_score_codex":0.00022219034,"about_ca_topic_score_gemma":0.000116276395,"teacher_disagreement_score":0.26584175,"about_ca_system_score_codex":0.00012236042,"about_ca_system_score_gemma":0.00018063813,"threshold_uncertainty_score":0.9997885},"labels":[],"label_agreement":null},{"id":"W2951138970","doi":"10.48550/arxiv.1510.07744","title":"Colourings, Homomorphisms, and Partitions of Transitive Digraphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Transitive relation; Homomorphism; Combinatorics; Transitive reduction; Class (philosophy); Mathematics; Discrete mathematics; Computer science; Graph; Artificial intelligence; Voltage graph; Line graph","score_opus":0.09354078684527288,"score_gpt":0.21550231649353965,"score_spread":0.12196152964826677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951138970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48579443,0.00022748296,0.510638,0.00011337102,0.00013742082,0.0003711614,0.00010293024,0.0001362757,0.0024789353],"genre_scores_gemma":[0.9976772,0.0002683862,0.001665559,0.000021077754,0.000013498749,0.000001842387,0.0000102362665,0.0000119148,0.00033030505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984304,0.00019846186,0.00016751513,0.000772796,0.00012133117,0.00030953463],"domain_scores_gemma":[0.9982351,0.00015404768,0.00016646458,0.00084164814,0.0003539691,0.00024877035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035630708,0.0002186829,0.000337962,0.00037907882,0.000114583556,0.000044882512,0.0010753708,0.00017612604,0.000009707032],"category_scores_gemma":[0.000039156945,0.00025672404,0.00013141267,0.00068504765,0.0005468045,0.00035494647,0.0011811889,0.00047628133,0.000009680232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063165666,0.00013035435,0.0013522239,0.00009007234,0.0001168127,0.00027733133,0.00072886754,0.02357876,0.00016356705,0.9730058,0.00015852712,0.00033456663],"study_design_scores_gemma":[0.0006264337,0.0001448621,0.0014294288,0.000106750944,0.00005363319,0.000010273858,0.0001954341,0.043298855,0.0009048861,0.9526697,0.00019764605,0.0003621452],"about_ca_topic_score_codex":0.000045423163,"about_ca_topic_score_gemma":0.000022741278,"teacher_disagreement_score":0.5118827,"about_ca_system_score_codex":0.00007430301,"about_ca_system_score_gemma":0.00020741842,"threshold_uncertainty_score":0.9999885},"labels":[],"label_agreement":null},{"id":"W2951243173","doi":"","title":"Small Chvatal rank","year":2007,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Polytope; Mathematics; Facet (psychology); Polyhedron; Context (archaeology); Rank (graph theory); Graph; Set (abstract data type); Integer programming; Integer (computer science); Birkhoff polytope; Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.12973717833692952,"score_gpt":0.22246036547870088,"score_spread":0.09272318714177136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951243173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12218814,0.000107711814,0.86784506,0.000060123984,0.0005287972,0.0003108782,0.00001148099,0.00038754105,0.00856028],"genre_scores_gemma":[0.9868572,0.00015925495,0.008508754,0.00009507138,0.00010362959,8.6330056e-7,0.000014180708,0.000027963688,0.0042331163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729186,0.00017968102,0.00020719053,0.0014573042,0.00014704293,0.00071690395],"domain_scores_gemma":[0.9968887,0.00024044243,0.00017843129,0.0021483838,0.00022577171,0.0003182981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007071776,0.0003608064,0.00034494253,0.00062347803,0.00019099511,0.00013106925,0.0041881637,0.0003543468,0.00004549123],"category_scores_gemma":[0.00006746564,0.00042698145,0.00028276586,0.0011230103,0.00026382436,0.00038176833,0.004982156,0.0011870438,0.00030738654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008692662,0.00010630659,0.0016099585,0.000077609104,0.00009702005,0.0017457381,0.00016618008,0.047227077,0.00010588081,0.9444498,0.00013916635,0.0041883336],"study_design_scores_gemma":[0.0012471863,0.00011838812,0.0016598668,0.00013092236,0.000043951757,0.000027558315,0.000075302174,0.23445061,0.001684763,0.7560544,0.0032460433,0.0012610235],"about_ca_topic_score_codex":0.000060426075,"about_ca_topic_score_gemma":0.00003448419,"teacher_disagreement_score":0.864669,"about_ca_system_score_codex":0.00023088117,"about_ca_system_score_gemma":0.00022369073,"threshold_uncertainty_score":0.9998182},"labels":[],"label_agreement":null},{"id":"W2951293305","doi":"","title":"Elementary block of plane bipartite graphs","year":2003,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Bipartite graph; Block (permutation group theory); Combinatorics; Plane (geometry); Mathematics; Geometry; Graph","score_opus":0.012443945043523768,"score_gpt":0.21494113112251453,"score_spread":0.20249718607899075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951293305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7337612,0.00032432043,0.12972368,0.00010191251,0.0012556626,0.0004321431,0.000036940237,0.0002949665,0.1340692],"genre_scores_gemma":[0.9827514,0.000026330012,0.01419369,0.000028839067,0.000024998431,0.0000012380126,0.00000816106,0.000007649164,0.0029576544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981283,0.00020258113,0.0002552705,0.00048052447,0.00057684,0.00035648048],"domain_scores_gemma":[0.99876803,0.00012447966,0.00014209044,0.0005727056,0.0002004811,0.00019218319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002363279,0.0001793438,0.00019780768,0.0005548849,0.0006459967,0.00004627806,0.0008851889,0.00007784079,0.000022407394],"category_scores_gemma":[0.000048988677,0.00020438236,0.0001327384,0.0011326354,0.00059816544,0.000871117,0.00021108771,0.00022714805,0.00002437578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000392774,0.0001308186,0.01294739,0.000023469782,0.000068670495,0.0008042521,0.00005116318,0.0016823652,0.013420548,0.97045547,0.00012684705,0.00024972053],"study_design_scores_gemma":[0.007263583,0.0012109402,0.059075177,0.0006019048,0.00020269667,0.0033759198,0.000869182,0.0041666026,0.37344974,0.06524021,0.48163667,0.0029073728],"about_ca_topic_score_codex":0.000049186667,"about_ca_topic_score_gemma":0.000012301801,"teacher_disagreement_score":0.90521526,"about_ca_system_score_codex":0.00019530364,"about_ca_system_score_gemma":0.0003790929,"threshold_uncertainty_score":0.83344704},"labels":[],"label_agreement":null},{"id":"W2951395643","doi":"10.48550/arxiv.1109.3741","title":"Immersing complete digraphs","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Combinatorics; Eulerian path; Mathematics; Immersion (mathematics); Simple (philosophy); Graph; Degree (music); Discrete mathematics; Physics; Pure mathematics","score_opus":0.15978167917923303,"score_gpt":0.22007362580840445,"score_spread":0.06029194662917142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951395643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070806764,0.00013699866,0.91282076,0.000049972325,0.00059674936,0.00034042294,0.000018087649,0.00038257788,0.01484769],"genre_scores_gemma":[0.99319553,0.00015369293,0.0053900974,0.00006314297,0.000041925465,9.974643e-7,0.000010960916,0.000027418704,0.0011162484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971931,0.000274054,0.00020578789,0.0014964386,0.00014706883,0.0006835749],"domain_scores_gemma":[0.9968785,0.00015867602,0.00022457438,0.0022337623,0.00020221132,0.00030226124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036718865,0.00038281502,0.00039657686,0.00061485526,0.00028428674,0.00012731143,0.003997846,0.0002573803,0.00005678746],"category_scores_gemma":[0.000024285735,0.000454371,0.00035042886,0.0010430225,0.00036022215,0.0005852707,0.0043405984,0.0010037018,0.00024257484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044113243,0.00007919721,0.0009016642,0.00005619044,0.000108086984,0.00045766728,0.0003448069,0.01069735,0.0002105184,0.9853632,0.00013680042,0.0016004129],"study_design_scores_gemma":[0.0004505367,0.0000704839,0.0007601849,0.00010903039,0.000037310103,0.000015776934,0.00008422403,0.100673735,0.00048219648,0.8958232,0.00075511215,0.0007382551],"about_ca_topic_score_codex":0.00012565403,"about_ca_topic_score_gemma":0.000015271735,"teacher_disagreement_score":0.92238873,"about_ca_system_score_codex":0.00015918976,"about_ca_system_score_gemma":0.0001582576,"threshold_uncertainty_score":0.9997908},"labels":[],"label_agreement":null},{"id":"W2951514643","doi":"","title":"Game Brush Number","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Brush; Combinatorics; Mathematics; Vertex (graph theory); Graph; Complete graph; Discrete mathematics","score_opus":0.07064228950838786,"score_gpt":0.2223838940448167,"score_spread":0.15174160453642885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951514643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.137255,0.000022867713,0.8465026,0.00008198319,0.0004964253,0.00023887782,0.0000072618795,0.0003991317,0.014995864],"genre_scores_gemma":[0.9895313,0.000084781066,0.0032811207,0.00014475774,0.00009937657,0.0000012504963,0.000009027038,0.000027573486,0.006820808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972937,0.00032635534,0.00018152065,0.0014323145,0.00016868474,0.00059743813],"domain_scores_gemma":[0.99667126,0.0002201967,0.00018761613,0.0024129334,0.00021615704,0.0002918299],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045750744,0.00034314423,0.00036940796,0.00025123463,0.00013253973,0.00015472784,0.0038911786,0.00030999177,0.00011659382],"category_scores_gemma":[0.000056570552,0.00040143586,0.0002706548,0.00072415237,0.00024379198,0.00042208948,0.0045439345,0.0009855909,0.0014479861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002580978,0.000063888554,0.003066031,0.00007006097,0.000066155786,0.000323927,0.00011789297,0.068050966,0.00002575455,0.92634773,0.00049042364,0.0013513513],"study_design_scores_gemma":[0.00039980438,0.000030979125,0.00071191986,0.00007365911,0.00001912472,0.000011316748,0.000013664034,0.26700446,0.00018434685,0.72584856,0.0051506893,0.0005515037],"about_ca_topic_score_codex":0.000046234753,"about_ca_topic_score_gemma":0.000009949484,"teacher_disagreement_score":0.8522763,"about_ca_system_score_codex":0.00017768916,"about_ca_system_score_gemma":0.00017311108,"threshold_uncertainty_score":0.9998438},"labels":[],"label_agreement":null},{"id":"W2951550992","doi":"10.1002/jgt.20086","title":"Circular chromatic index of graphs of maximum degree 3","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Edge coloring; Bound graph; Graph power; Degree (music); Discrete mathematics; Line graph; Physics","score_opus":0.02337219878357789,"score_gpt":0.27783629775663776,"score_spread":0.2544640989730599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951550992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4869697,0.002981599,0.50809616,0.00020317714,0.00020873919,0.00014968334,0.0000031502316,0.000021611257,0.0013661945],"genre_scores_gemma":[0.9787955,0.0001609925,0.020882176,0.00006530682,0.00004606141,0.000001817448,1.772784e-7,0.000016800537,0.000031154374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704224,0.00049258047,0.0009864063,0.00019308421,0.00093726395,0.0003484478],"domain_scores_gemma":[0.99694455,0.00052507024,0.0010483839,0.00076009706,0.00054389046,0.00017803925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032872194,0.0001828673,0.0005466941,0.0012719389,0.00006712934,0.000024141915,0.0019792768,0.00009223527,0.00005989681],"category_scores_gemma":[0.00026414922,0.00014861973,0.00050740154,0.0013277245,0.00049079285,0.0008005518,0.00019655783,0.00041590203,0.000005371094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029010678,0.00051168137,0.004433069,0.00020971573,0.0004202195,0.00007950773,0.0014142941,0.0011381963,0.040255077,0.83280134,0.00014970529,0.11829708],"study_design_scores_gemma":[0.00086992356,0.00039233893,0.0068888785,0.00016213898,0.000026750118,0.0002349501,0.0001471519,0.00046244948,0.020648016,0.9698597,0.00015917465,0.00014850627],"about_ca_topic_score_codex":0.0000017617524,"about_ca_topic_score_gemma":0.0000015165939,"teacher_disagreement_score":0.49182582,"about_ca_system_score_codex":0.00003563712,"about_ca_system_score_gemma":0.0001447447,"threshold_uncertainty_score":0.6060537},"labels":[],"label_agreement":null},{"id":"W2951570929","doi":"10.48550/arxiv.0812.2734","title":"Asteroids in rooted and directed path graphs","year":2008,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.05878365691958065,"score_gpt":0.20272310439802835,"score_spread":0.1439394474784477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951570929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8611835,0.00020231093,0.13628422,0.000041684252,0.00018219769,0.00034173238,0.000010348041,0.0003543724,0.0013996126],"genre_scores_gemma":[0.99577403,0.001165445,0.0023667107,0.000031795844,0.00001242762,0.0000015783045,0.000008023648,0.000018814146,0.00062116317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997567,0.00033393348,0.00019299054,0.0012858056,0.00012852905,0.0004917529],"domain_scores_gemma":[0.99818236,0.00016636758,0.00013124448,0.0011859569,0.0001250453,0.00020903866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025908844,0.00031330396,0.00036769145,0.0008073446,0.00012780694,0.00007318476,0.0015954224,0.00026664056,0.0000065371455],"category_scores_gemma":[0.00005692552,0.00036704817,0.00011212875,0.0015271313,0.0002753137,0.0004237239,0.0027253067,0.0008949898,0.000018577848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002954343,0.00051763473,0.09739358,0.00024390843,0.00020332527,0.007758511,0.0019335416,0.08159569,0.0005695754,0.7998313,0.00031967767,0.009337876],"study_design_scores_gemma":[0.0013275854,0.00011373582,0.04021097,0.00018628465,0.000014511581,0.000030662446,0.000055202643,0.44606516,0.00017728253,0.51075476,0.0002476113,0.0008162555],"about_ca_topic_score_codex":0.000117217736,"about_ca_topic_score_gemma":0.00006762746,"teacher_disagreement_score":0.36446947,"about_ca_system_score_codex":0.00012850585,"about_ca_system_score_gemma":0.00012979754,"threshold_uncertainty_score":0.99987817},"labels":[],"label_agreement":null},{"id":"W2951573614","doi":"10.48550/arxiv.1704.05655","title":"Characterizations and algorithms for generalized Cops and Robbers games","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Algorithm; Computer science; Mathematics","score_opus":0.1143097118518677,"score_gpt":0.2499193171167826,"score_spread":0.13560960526491492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951573614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14629988,0.0001458568,0.8521307,0.00028597467,0.00024346772,0.00051932497,0.00006736716,0.000105647174,0.00020176375],"genre_scores_gemma":[0.9675654,0.0017429482,0.026611602,0.00007649297,0.000076120145,0.000009182347,0.000044597564,0.000026537951,0.0038471268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846953,0.00009568864,0.00011531444,0.00094707066,0.0000620089,0.00031040673],"domain_scores_gemma":[0.9982977,0.00015577168,0.00019498082,0.0010008056,0.00016258654,0.00018813908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026401386,0.00022333908,0.00029459695,0.00023137627,0.00044216504,0.00029407736,0.0011051395,0.00016671597,0.0000045432366],"category_scores_gemma":[0.000078127254,0.0002534982,0.000084455154,0.00013714799,0.0003216081,0.0005238099,0.0018885824,0.0002586335,0.0000030432677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008308295,0.00006177102,0.00242029,0.00024114098,0.00019043154,0.0001220598,0.0005079582,0.006228774,0.00065322383,0.9775923,0.00018068467,0.011718297],"study_design_scores_gemma":[0.0012325014,0.000074047144,0.003137599,0.000081953964,0.000062465195,0.000011427201,0.00003210618,0.6283151,0.00030037138,0.36376357,0.0024472768,0.0005415844],"about_ca_topic_score_codex":0.000027567374,"about_ca_topic_score_gemma":0.000008518892,"teacher_disagreement_score":0.82551914,"about_ca_system_score_codex":0.000046494486,"about_ca_system_score_gemma":0.00010003595,"threshold_uncertainty_score":0.9999917},"labels":[],"label_agreement":null},{"id":"W2951604368","doi":"10.48550/arxiv.0707.0226","title":"Star-uniform Graphs","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Star (game theory); Combinatorics; Mathematics; A* search algorithm; Discrete mathematics; Tree-depth; Matching (statistics); Graph; Line graph; Pathwidth; Statistics","score_opus":0.06557293404830593,"score_gpt":0.33126311057641655,"score_spread":0.2656901765281106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951604368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7038353,0.0006789605,0.28311533,0.0005408571,0.001199426,0.0005702951,0.000014864349,0.0006388942,0.009406088],"genre_scores_gemma":[0.95396435,0.00032362423,0.042824116,0.00059133716,0.00020217114,0.00007054446,0.00002721239,0.00006276721,0.0019338647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641305,0.00013027177,0.0004725338,0.0012003664,0.0007970487,0.0009867338],"domain_scores_gemma":[0.9960817,0.0002501447,0.00022595277,0.002822391,0.00028633635,0.0003334418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012711808,0.00043755784,0.0004259691,0.000659043,0.00022267316,0.00016780863,0.0040989653,0.0003747358,0.000074306336],"category_scores_gemma":[0.0001405821,0.00042323454,0.00029619108,0.0009042894,0.00026643364,0.00045649576,0.004704698,0.0017307597,0.00063456333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013976965,0.0005253581,0.26906964,0.00051004515,0.0004241098,0.0010004113,0.0023023786,0.0010516341,0.0031683638,0.65382475,0.0024816755,0.0655019],"study_design_scores_gemma":[0.0008195712,0.00020884397,0.17031942,0.00027437558,0.000026958907,0.00004409356,0.00010513846,0.0038410265,0.0099261645,0.789186,0.023423318,0.0018250743],"about_ca_topic_score_codex":0.000055467415,"about_ca_topic_score_gemma":0.00003334605,"teacher_disagreement_score":0.25012907,"about_ca_system_score_codex":0.00014521283,"about_ca_system_score_gemma":0.00023713766,"threshold_uncertainty_score":0.99982196},"labels":[],"label_agreement":null},{"id":"W2951675595","doi":"10.48550/arxiv.1110.4900","title":"Planar graphs have exponentially many 3-arboricities","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Planar; Combinatorics; Exponential growth; Projective test; Mathematics; Graph; Colored; Book embedding; Discrete mathematics; Class (philosophy); Outerplanar graph; 1-planar graph; Computer science; Pure mathematics; Pathwidth; Line graph; Artificial intelligence; Mathematical analysis; Computer graphics (images); Sociology","score_opus":0.09411833119335782,"score_gpt":0.20764326287073334,"score_spread":0.11352493167737553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951675595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104197584,0.0001761861,0.8772905,0.000045688786,0.0008161887,0.0004292916,0.000027560776,0.0005169672,0.016500052],"genre_scores_gemma":[0.990399,0.00037327706,0.0042170137,0.00007364579,0.000060080347,0.000003231732,0.000015288988,0.00003778819,0.004820682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968289,0.00030763284,0.00026544454,0.0016159285,0.00022316839,0.0007589291],"domain_scores_gemma":[0.9966663,0.00014806949,0.00027537503,0.0023525446,0.00024304164,0.00031467286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039795574,0.00048284314,0.00046354125,0.0008756632,0.00027272943,0.00016251899,0.004605356,0.0003675559,0.000082510596],"category_scores_gemma":[0.00003261767,0.0005642052,0.00037729245,0.0006646023,0.0004015132,0.00068111793,0.0030208032,0.001050343,0.00019577741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069291586,0.0000878533,0.0010902236,0.000060909537,0.00013200297,0.0009381178,0.00049133046,0.004463892,0.00009588587,0.99196416,0.00025721075,0.00034910752],"study_design_scores_gemma":[0.00040699472,0.00008927171,0.0008349891,0.00007567071,0.00004167229,0.000009069182,0.00016875079,0.025779217,0.00062413415,0.97087824,0.00041655128,0.00067546405],"about_ca_topic_score_codex":0.00023133,"about_ca_topic_score_gemma":0.000047175938,"teacher_disagreement_score":0.8862014,"about_ca_system_score_codex":0.00016308887,"about_ca_system_score_gemma":0.00021885944,"threshold_uncertainty_score":0.99968094},"labels":[],"label_agreement":null},{"id":"W2951693280","doi":"10.48550/arxiv.1302.2340","title":"On the extension complexity of combinatorial polytopes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Polytope; Extension (predicate logic); Combinatorics; Mathematics; Polyhedron; Matching (statistics); Exponential function; Discrete mathematics; Graph; Computational complexity theory; Computer science; Algorithm","score_opus":0.13837325063371858,"score_gpt":0.23009945500279433,"score_spread":0.09172620436907575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951693280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7688595,0.000035156958,0.22498055,0.00046172595,0.001091041,0.00065387704,0.000015724965,0.00014937474,0.003753027],"genre_scores_gemma":[0.99867773,0.000040151146,0.00072517537,0.00008251429,0.00004020185,0.0000012869408,0.000003645048,0.00001308468,0.00041621109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979798,0.00045339746,0.00018586795,0.0008320735,0.00020936203,0.000339476],"domain_scores_gemma":[0.9965307,0.0006103874,0.000258733,0.0021552655,0.00032286954,0.00012201115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047646413,0.00025325874,0.0003331148,0.00022640015,0.00020960362,0.00006992133,0.0032588055,0.00018272927,0.00008036504],"category_scores_gemma":[0.00014866925,0.00020552888,0.000209267,0.00057548453,0.0007201135,0.00022961816,0.0033997763,0.0007945042,0.00012666933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000503913,0.00010404257,0.00008843361,0.000022191904,0.000034956818,0.000031159114,0.0000715752,0.00812024,0.00017944208,0.9907549,0.0003639695,0.0001786672],"study_design_scores_gemma":[0.00029148383,0.00009786005,0.0007395284,0.00006628071,0.000009589233,0.0000010798506,0.000028357093,0.08888574,0.0011593862,0.9084476,0.00007811712,0.00019494841],"about_ca_topic_score_codex":0.0001506991,"about_ca_topic_score_gemma":0.00000400521,"teacher_disagreement_score":0.22981821,"about_ca_system_score_codex":0.000098677716,"about_ca_system_score_gemma":0.000118092175,"threshold_uncertainty_score":0.8381224},"labels":[],"label_agreement":null},{"id":"W2951732239","doi":"10.48550/arxiv.math/0406140","title":"The structure and labelled enumeration of K_{3,3}-subdivision-free projective-planar graphs","year":2004,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Subdivision; Combinatorics; Planar; Projective test; Mathematics; Projective plane; Discrete mathematics; Computer science; Pure mathematics; Geometry; Computer graphics (images); Geography","score_opus":0.03678046063136805,"score_gpt":0.20756060523045602,"score_spread":0.17078014459908797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951732239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6711133,0.000413626,0.32638946,0.00018939882,0.00033435205,0.00091282185,0.000073491654,0.00013140694,0.00044211818],"genre_scores_gemma":[0.997441,0.0004448603,0.0018167539,0.000017087126,0.000018859053,9.996444e-7,0.000009242359,0.000014354109,0.00023685246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807763,0.00028611283,0.00020568127,0.0008889055,0.0002046041,0.00033705417],"domain_scores_gemma":[0.99725163,0.00032780133,0.00027807066,0.0016933767,0.00033517432,0.00011392356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003831538,0.0002735648,0.00028754288,0.00031389267,0.00042571072,0.0001313514,0.002441278,0.0002254781,0.000005113075],"category_scores_gemma":[0.00015355367,0.0002302885,0.00011924323,0.0008340733,0.0004254106,0.0003921777,0.0019968406,0.00069235,0.0000029084376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008576721,0.000035203,0.0016344647,0.00006848066,0.000097309916,0.00004880336,0.00043217884,0.013867236,0.00047621917,0.98210263,0.000042807842,0.0011088859],"study_design_scores_gemma":[0.00071406574,0.00009943214,0.002092506,0.00007158448,0.000025378038,0.000005913258,0.00007281421,0.03048391,0.001711557,0.9643945,0.0000744798,0.000253861],"about_ca_topic_score_codex":0.00009788645,"about_ca_topic_score_gemma":0.00010169128,"teacher_disagreement_score":0.32632765,"about_ca_system_score_codex":0.000115061805,"about_ca_system_score_gemma":0.00027198112,"threshold_uncertainty_score":0.93908924},"labels":[],"label_agreement":null},{"id":"W2951736941","doi":"10.48550/arxiv.1503.03572","title":"Almost all 5-regular graphs have a 3-flow","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Conjecture; Discrete mathematics; Graph; Assertion; 1-planar graph; Chordal graph; Computer science","score_opus":0.11297934206482801,"score_gpt":0.23203906278413408,"score_spread":0.11905972071930607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951736941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1171862,0.0003713025,0.87246084,0.00029369496,0.0008423744,0.00079430843,0.00005907745,0.0007235264,0.007268682],"genre_scores_gemma":[0.9824385,0.00035898885,0.011258894,0.00018323096,0.00007527384,0.000003748942,0.000045770783,0.000052501313,0.005583087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624527,0.00041764945,0.0002562113,0.0019080077,0.0003158932,0.0008569937],"domain_scores_gemma":[0.9953515,0.00014007588,0.00025050069,0.0031083052,0.0005396436,0.00060996757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008132131,0.00052298565,0.00051497185,0.0005532353,0.00018170613,0.0002044619,0.0043841223,0.0004372276,0.00003872677],"category_scores_gemma":[0.00009042432,0.000602638,0.0003965159,0.0009809625,0.00039902295,0.0006874571,0.0058224453,0.0011917753,0.00028259086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011573355,0.00021572097,0.0026522817,0.000103506565,0.0003335369,0.0022785745,0.0006189461,0.26439613,0.00007957797,0.7231178,0.003960036,0.002128125],"study_design_scores_gemma":[0.0005126859,0.00007040432,0.00015891323,0.000057025685,0.00003868034,0.000011849364,0.00004075818,0.356073,0.00016208498,0.63812286,0.00418334,0.00056840805],"about_ca_topic_score_codex":0.00013835003,"about_ca_topic_score_gemma":0.00005949854,"teacher_disagreement_score":0.8652523,"about_ca_system_score_codex":0.00034285669,"about_ca_system_score_gemma":0.00041343292,"threshold_uncertainty_score":0.9996425},"labels":[],"label_agreement":null},{"id":"W2951748744","doi":"10.48550/arxiv.1105.4163","title":"The number of points in a matroid with no n-point line as a minor","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Minor (academic); Prime power; Mathematics; Rank (graph theory); Integer (computer science); Line (geometry); Prime (order theory); Point (geometry); Projective plane; Discrete mathematics; Geometry; Computer science; Humanities","score_opus":0.05439467276213062,"score_gpt":0.22114490710934628,"score_spread":0.16675023434721567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951748744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7715876,0.000059842452,0.20636907,0.00013731122,0.00022571888,0.00067482976,0.00000957416,0.00011017453,0.020825867],"genre_scores_gemma":[0.9892663,0.00015010504,0.0064402446,0.000036566395,0.000020685546,0.0000031436298,0.0000021092333,0.000021073754,0.004059813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979806,0.00026997196,0.00023905563,0.0008712312,0.00016590333,0.00047322887],"domain_scores_gemma":[0.9971759,0.00026930193,0.00027807444,0.0018047361,0.00032949084,0.00014249513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058604346,0.0002777868,0.0003416507,0.00023736102,0.00010358533,0.000051467217,0.0028876485,0.00015776331,0.00006301146],"category_scores_gemma":[0.000087468834,0.00022007915,0.00014786377,0.0008218787,0.00039853033,0.00030334629,0.0025930593,0.00074917666,0.00031999082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007593686,0.0002329376,0.009736078,0.00010444605,0.00011941973,0.00074395747,0.00061078084,0.0042475145,0.000067473266,0.9827898,0.00005531723,0.00053288235],"study_design_scores_gemma":[0.0012784861,0.00026806677,0.0020359377,0.0003002044,0.000029330393,0.000043112013,0.00016736123,0.034080148,0.0012894967,0.95967066,0.00028491978,0.00055229035],"about_ca_topic_score_codex":0.00031839567,"about_ca_topic_score_gemma":0.00014020297,"teacher_disagreement_score":0.21767865,"about_ca_system_score_codex":0.00012491252,"about_ca_system_score_gemma":0.00027496833,"threshold_uncertainty_score":0.89745677},"labels":[],"label_agreement":null},{"id":"W2951827106","doi":"","title":"On Infinite-finite Duality Pairs of Directed Graphs","year":2013,"lang":"en","type":"article","venue":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Royal Military College of Canada","funders":"","keywords":"Antichain; Mathematics; Combinatorics; Duality (order theory); Constraint satisfaction problem; Discrete mathematics; Partially ordered set","score_opus":0.02299426730019268,"score_gpt":0.25768131178639625,"score_spread":0.23468704448620356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951827106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94706804,0.0011819601,0.00024408766,0.027786769,0.0007169507,0.0018738018,0.00007251039,0.000424489,0.020631365],"genre_scores_gemma":[0.98810637,0.00011212149,0.008147018,0.0012219487,0.00007130843,0.000028117505,9.5211044e-7,0.000044312204,0.0022678645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99230206,0.001955187,0.0018160455,0.0009792367,0.0021693376,0.00077811314],"domain_scores_gemma":[0.99366564,0.002478041,0.0022992073,0.0012200772,0.000053342395,0.00028369096],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001361401,0.00048313907,0.0009017593,0.0007292997,0.0006590662,0.000123544,0.013592895,0.00048050174,0.00008957322],"category_scores_gemma":[0.00038983097,0.00030575218,0.0007782743,0.00512792,0.005683721,0.0075397864,0.0041521424,0.0014729964,0.000008896624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002045551,0.00045943892,0.06301137,0.00042813303,0.00021580429,0.0000011999193,0.0010889139,0.0025944314,0.09978465,0.82149065,0.008426142,0.0022947108],"study_design_scores_gemma":[0.00042262065,0.00020493373,0.14813673,0.000515704,0.000025008392,0.000013864581,0.00006519143,0.0037491997,0.49766746,0.3481887,0.00070008787,0.00031046238],"about_ca_topic_score_codex":0.0000202318,"about_ca_topic_score_gemma":4.787777e-8,"teacher_disagreement_score":0.47330195,"about_ca_system_score_codex":0.000016353644,"about_ca_system_score_gemma":0.00032207882,"threshold_uncertainty_score":0.99993944},"labels":[],"label_agreement":null},{"id":"W2951892290","doi":"10.1002/jgt.20302","title":"A Characterization of the degree sequences of 2‐trees","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Degree (music); Characterization (materials science); Vertex (graph theory); Tree (set theory); Graph; Discrete mathematics","score_opus":0.0482485410025316,"score_gpt":0.2735561371976695,"score_spread":0.22530759619513793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951892290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8803761,0.0003064785,0.1186053,0.00017141236,0.00020285058,0.00006865986,0.000003139453,0.0000065613594,0.00025949022],"genre_scores_gemma":[0.99651355,0.00020107105,0.0031275603,0.00004033901,0.000032051725,9.6235e-7,1.3496194e-7,0.000005757264,0.000078593555],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827355,0.00044236507,0.0004782596,0.00009881436,0.0005568548,0.00015013167],"domain_scores_gemma":[0.9980306,0.00028028293,0.00081617845,0.00040400206,0.0004145852,0.000054321303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012808443,0.000088079054,0.0002376719,0.00030029812,0.00010101234,0.000009372082,0.00146217,0.000040443178,0.0000145416325],"category_scores_gemma":[0.000180343,0.000053297437,0.00023732804,0.00078670727,0.00057526305,0.0005439072,0.00014254301,0.00020584694,9.2670257e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011579188,0.00010111457,0.008074481,0.000020341418,0.000056764537,0.00001999327,0.0014617855,0.00007213547,0.71535397,0.2674574,0.000015556547,0.007250706],"study_design_scores_gemma":[0.00040380686,0.0003345144,0.10546263,0.00014650609,0.000014064128,0.00040853932,0.000109866545,0.00007994434,0.41983366,0.47299954,0.000101713886,0.00010521462],"about_ca_topic_score_codex":0.0000011209153,"about_ca_topic_score_gemma":0.0000015039186,"teacher_disagreement_score":0.29552028,"about_ca_system_score_codex":0.000013016122,"about_ca_system_score_gemma":0.00014361538,"threshold_uncertainty_score":0.27171},"labels":[],"label_agreement":null},{"id":"W2952000975","doi":"10.48550/arxiv.1109.0562","title":"A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Logical matrix; Binary number; Graph; Mathematics; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Physics; Chemistry; Arithmetic; Quantum mechanics","score_opus":0.09947937265376473,"score_gpt":0.2435869787612181,"score_spread":0.14410760610745338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952000975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.930484,0.000049455924,0.064832,0.000094250674,0.00010488775,0.0006813237,0.00001854273,0.000029702329,0.0037058194],"genre_scores_gemma":[0.9991694,0.00014294236,0.0005521494,0.000031102696,0.000011932521,0.0000028795066,0.0000019996567,0.000010641375,0.00007696542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974103,0.00085242174,0.00033351168,0.0008088375,0.0002490234,0.0003459136],"domain_scores_gemma":[0.99555784,0.0009938338,0.0004075601,0.0027916513,0.00018457836,0.000064545384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016735819,0.00027103626,0.0004215965,0.000704989,0.00012723738,0.00003643954,0.0050395895,0.00017145682,0.000022377473],"category_scores_gemma":[0.00008580861,0.00018630754,0.0002874266,0.0019150802,0.0007677633,0.00021705758,0.0019252591,0.0009232623,0.00001349128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021865625,0.00052280084,0.016700177,0.00016468446,0.00009753253,0.00007416535,0.002795134,0.013838381,0.0001966155,0.96501005,0.00008309467,0.00029868388],"study_design_scores_gemma":[0.00045453693,0.00019435154,0.038447097,0.00018554904,0.000027296153,0.000001987659,0.00043390397,0.028457237,0.0020899426,0.929404,0.000025253823,0.00027883262],"about_ca_topic_score_codex":0.0005283086,"about_ca_topic_score_gemma":0.00018144691,"teacher_disagreement_score":0.06868537,"about_ca_system_score_codex":0.00006520072,"about_ca_system_score_gemma":0.00016499108,"threshold_uncertainty_score":0.9364895},"labels":[],"label_agreement":null},{"id":"W2952198500","doi":"10.48550/arxiv.1311.7064","title":"On the Relationships between Zero Forcing Numbers and Certain Graph Coverings","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Forcing (mathematics); Upper and lower bounds; Zero (linguistics); Cubic graph; Line graph; Voltage graph; Mathematical analysis","score_opus":0.11205783283402425,"score_gpt":0.21773127407193346,"score_spread":0.10567344123790921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952198500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.528142,0.000019175348,0.4686811,0.00027209905,0.000085102205,0.0003516207,0.000006221147,0.000116091745,0.0023266408],"genre_scores_gemma":[0.9976428,0.00006536763,0.00089868106,0.00006681856,0.000024770186,0.000003192849,0.000005734095,0.00002027683,0.0012723691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787456,0.00044105004,0.00016656757,0.0009444612,0.00015363202,0.00041975905],"domain_scores_gemma":[0.996504,0.0017039649,0.00018642965,0.0013189141,0.00008676509,0.00019991011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007328362,0.00028376307,0.00025236243,0.00032434746,0.00057123485,0.00021533223,0.0018018482,0.00023791853,0.000015083153],"category_scores_gemma":[0.00021195435,0.0002556687,0.00014059391,0.0007253359,0.00029547067,0.0004949502,0.0020233511,0.0014245198,0.00008795149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011134394,0.000011976948,0.011497138,0.000022242984,0.000062139596,0.000026420388,0.00034476115,0.023370085,0.000009643242,0.96408296,0.00029694688,0.0002645566],"study_design_scores_gemma":[0.00020144586,0.00003705969,0.0044419565,0.00008116807,0.00002139961,0.0000016942171,0.00010850254,0.034263726,0.000062450374,0.9603299,0.00015275896,0.00029792546],"about_ca_topic_score_codex":0.00017900392,"about_ca_topic_score_gemma":0.000016833283,"teacher_disagreement_score":0.46950084,"about_ca_system_score_codex":0.00013333076,"about_ca_system_score_gemma":0.00007097422,"threshold_uncertainty_score":0.99998957},"labels":[],"label_agreement":null},{"id":"W2952243533","doi":"10.48550/arxiv.1005.2642","title":"Pebbles and Branching Programs for Tree Evaluation","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Combinatorics; Branching (polymer chemistry); Upper and lower bounds; Tree (set theory); Mathematics; Binary decision diagram; Binary tree; Discrete mathematics; Simple (philosophy); Binary number; Algorithm; Arithmetic","score_opus":0.13205724166628377,"score_gpt":0.25744923355847604,"score_spread":0.12539199189219227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952243533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31775415,0.00007723885,0.6801436,0.00009283287,0.00025649194,0.0009807625,0.0000048673073,0.00013510547,0.00055492687],"genre_scores_gemma":[0.98211306,0.000041440388,0.017343016,0.000016871427,0.000058155376,0.000012446805,0.00002015444,0.000016842818,0.00037798384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981683,0.00016471595,0.00012966507,0.0010343125,0.00014874883,0.00035427097],"domain_scores_gemma":[0.9982127,0.00021499376,0.00015217483,0.00094490376,0.0003292359,0.00014597832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010413014,0.00022126267,0.00022297332,0.0002648856,0.00023168713,0.00020293193,0.0012678046,0.00024691704,0.0000062968193],"category_scores_gemma":[0.00012698027,0.00024673945,0.00012869961,0.00033927654,0.00017225574,0.00048235577,0.001342561,0.0006040929,0.0000049605223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008407655,0.0001123347,0.002264459,0.00019249055,0.000085428714,0.00002500658,0.000472806,0.018163359,0.0005764002,0.77456635,0.00004344784,0.20341384],"study_design_scores_gemma":[0.00047217612,0.000048660873,0.00047963156,0.00003374118,0.000030082698,0.0000022253664,0.000028070093,0.531388,0.00016954272,0.46679822,0.00034313748,0.00020650556],"about_ca_topic_score_codex":0.000018254761,"about_ca_topic_score_gemma":0.00011344387,"teacher_disagreement_score":0.6643589,"about_ca_system_score_codex":0.000083002444,"about_ca_system_score_gemma":0.00017863333,"threshold_uncertainty_score":0.9999985},"labels":[],"label_agreement":null},{"id":"W2952290346","doi":"10.4230/lipics.socg.2019.14","title":"Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Banff International Research Station for Mathematical Innovation and Discovery; Grantová Agentura České Republiky; Canada Research Chairs; Deutsche Forschungsgemeinschaft","keywords":"Conjecture; Bounded function; Degree (music); Combinatorics; Mathematics; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.11880124555955007,"score_gpt":0.24814766067678265,"score_spread":0.12934641511723258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952290346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115102455,0.00012290594,0.88082045,0.00018873962,0.00050252693,0.0013222253,0.00005572819,0.00031934516,0.0015656416],"genre_scores_gemma":[0.9691576,0.00003560109,0.02769144,0.00011171639,0.000053222022,0.000012899757,0.000021955191,0.000054437485,0.002861176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996352,0.00021573137,0.00024044175,0.0019766768,0.0002540458,0.00096110476],"domain_scores_gemma":[0.99577725,0.0009017791,0.00019427069,0.0022457147,0.0005186651,0.0003623284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039803705,0.00055187085,0.0005936604,0.00048658685,0.000526135,0.00086934364,0.003257324,0.00050473085,0.000029038694],"category_scores_gemma":[0.00015012424,0.00053587026,0.00035465756,0.00077354297,0.00109517,0.00085848256,0.0018984444,0.0010902077,0.00007163529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000286705,0.00013269554,0.0017849582,0.00029438073,0.00016619566,0.00018861145,0.00027360703,0.027292047,0.00007770472,0.96776485,0.00036918424,0.0013690281],"study_design_scores_gemma":[0.0015924056,0.0004900028,0.0009584574,0.0002239702,0.00008532545,0.000027002985,0.00006920134,0.1246596,0.0004763228,0.8689543,0.0015220339,0.00094140635],"about_ca_topic_score_codex":0.000031001688,"about_ca_topic_score_gemma":0.00004398412,"teacher_disagreement_score":0.8540551,"about_ca_system_score_codex":0.00021999325,"about_ca_system_score_gemma":0.00073321763,"threshold_uncertainty_score":0.9997093},"labels":[],"label_agreement":null},{"id":"W2952349276","doi":"10.48550/arxiv.1611.09536","title":"Restraints Permitting the Largest Number of Colourings","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Bipartite graph; Vertex (graph theory); Mathematics; Graph","score_opus":0.07266757873148916,"score_gpt":0.23625558711239217,"score_spread":0.163588008380903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952349276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70226705,0.000023258131,0.28320834,0.00040063477,0.00031950843,0.00035622783,0.000022698323,0.00015100419,0.0132513],"genre_scores_gemma":[0.99536765,0.000065787484,0.0011262284,0.000040097086,0.00005455538,0.0000013229757,0.000001360547,0.000017708291,0.0033252905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798614,0.00031813595,0.00020972709,0.00085065473,0.00017185637,0.00046348185],"domain_scores_gemma":[0.99704117,0.00052755105,0.0003156434,0.0017236168,0.00026443112,0.0001275742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007731331,0.00023755334,0.00027922064,0.00014341906,0.00021198118,0.000058003243,0.0036421875,0.00019620654,0.000062137544],"category_scores_gemma":[0.00016657572,0.000184853,0.00021815031,0.0005320636,0.00047591023,0.0003084733,0.0038891172,0.0006696416,0.000119551136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030947594,0.000052951746,0.016240075,0.0000599983,0.000073477604,0.00019930405,0.00026300506,0.002018244,0.00021158525,0.979603,0.000116196556,0.0011312056],"study_design_scores_gemma":[0.0006462537,0.00004264198,0.007119798,0.00030749862,0.00003294765,0.000024992438,0.0001352859,0.025177307,0.0016603759,0.9633933,0.0009453894,0.0005142264],"about_ca_topic_score_codex":0.0000370923,"about_ca_topic_score_gemma":0.000007241516,"teacher_disagreement_score":0.2931006,"about_ca_system_score_codex":0.000115607996,"about_ca_system_score_gemma":0.0001748415,"threshold_uncertainty_score":0.7538086},"labels":[],"label_agreement":null},{"id":"W2952355925","doi":"10.48550/arxiv.1406.0941","title":"Augmentative Message Passing for Traveling Salesman Problem and Graph\\n Partitioning","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Computer science; Cutting-plane method; 2-opt; Mathematical optimization; Message passing; Graph; Optimization problem; Combinatorial optimization; Context (archaeology); Graph partition; Domain (mathematical analysis); Benchmark (surveying); Theoretical computer science; Mathematics; Algorithm; Parallel computing; Integer programming","score_opus":0.08733762938479313,"score_gpt":0.23904274680149667,"score_spread":0.15170511741670356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952355925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094089545,0.000057730198,0.9039796,0.00009121754,0.00012986403,0.0005854967,0.000015100187,0.0001684829,0.000882969],"genre_scores_gemma":[0.9618964,0.000077160184,0.03752911,0.000049354097,0.000042774303,0.000010388658,0.000018190669,0.000024275232,0.0003523321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778444,0.0002452955,0.0002064136,0.0011743032,0.00010536474,0.00048417738],"domain_scores_gemma":[0.99835527,0.00039585604,0.00024439016,0.00063699204,0.00017832029,0.00018917795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066582666,0.0002908018,0.00032890108,0.0002792458,0.0004844289,0.00023110604,0.0009541397,0.0001705874,0.000004868178],"category_scores_gemma":[0.000041556188,0.00033898,0.00015881765,0.00041074908,0.00027309248,0.00050092355,0.0011294812,0.00048187785,0.0000054115476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055524015,0.000045599307,0.0009927672,0.00026503133,0.00012154308,0.00005261156,0.00088903063,0.09269515,0.0003441501,0.9018061,0.000047742105,0.0026847587],"study_design_scores_gemma":[0.00060478254,0.000076291246,0.00026437078,0.00020304523,0.000039635695,0.0000033463346,0.00015970974,0.27502596,0.0006380657,0.7225173,0.000103164464,0.00036431957],"about_ca_topic_score_codex":0.000017208888,"about_ca_topic_score_gemma":0.000018920635,"teacher_disagreement_score":0.86780685,"about_ca_system_score_codex":0.0001123168,"about_ca_system_score_gemma":0.00009972166,"threshold_uncertainty_score":0.99990624},"labels":[],"label_agreement":null},{"id":"W2952555057","doi":"10.26686/wgtn.12212528","title":"Certifying non-representability of matroids over prime fields","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund","keywords":"Matroid; Prime (order theory); Mathematics; Computer science; Combinatorics","score_opus":0.06243789805997328,"score_gpt":0.35538502633549324,"score_spread":0.29294712827551994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952555057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042197447,0.000072675786,0.9440792,0.0015732248,0.00039842844,0.0005757002,0.0000091966085,0.000215941,0.010878158],"genre_scores_gemma":[0.92737055,0.000015365367,0.071993224,0.00013941753,0.00007074549,0.000037936876,0.0000048812585,0.000017273935,0.0003505945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971568,0.00017645143,0.0005121014,0.0010679861,0.0006863848,0.0004002658],"domain_scores_gemma":[0.9966697,0.00031452827,0.00019486902,0.002461922,0.00016738263,0.00019160534],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00052201276,0.00027143085,0.00050513155,0.0001520861,0.000056670062,0.0001105263,0.0030184535,0.00026609012,0.00023628096],"category_scores_gemma":[0.00020713934,0.00024891345,0.0003060986,0.00041156515,0.00015852846,0.00026390882,0.008897392,0.0009772581,0.000041131632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006774994,0.0015967815,0.07108754,0.006688407,0.0012132251,0.00026078668,0.011397223,0.010732349,0.11693836,0.6042694,0.011246729,0.16389169],"study_design_scores_gemma":[0.00054413005,0.000169281,0.018383874,0.00014264943,0.000018074194,0.000005438071,0.000055884004,0.16219568,0.17339677,0.64385146,0.00046575294,0.0007709907],"about_ca_topic_score_codex":0.00023814834,"about_ca_topic_score_gemma":0.00001187271,"teacher_disagreement_score":0.88517314,"about_ca_system_score_codex":0.000071824434,"about_ca_system_score_gemma":0.00024351363,"threshold_uncertainty_score":0.9999963},"labels":[],"label_agreement":null},{"id":"W2952565476","doi":"10.55016/ojs/cdm.v5i2.62032","title":"The Cops and Robber game on graphs with forbidden (induced) subgraphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fédération Wallonie-Bruxelles; Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematical economics; Computer science; Mathematics","score_opus":0.012035481921575131,"score_gpt":0.2990309502276869,"score_spread":0.2869954683061118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952565476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34640738,0.00008682585,0.6408681,0.0072761984,0.0002553661,0.0014908437,0.000086778724,0.0002791337,0.0032493575],"genre_scores_gemma":[0.97910476,0.000016624876,0.020175092,0.00014819588,0.000031253985,0.00016833782,0.0000036454906,0.000021786997,0.0003303026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982656,0.00006764928,0.00026321842,0.00037946555,0.00044369287,0.0005803252],"domain_scores_gemma":[0.9970501,0.00093724206,0.00009849998,0.0012824473,0.00033707614,0.00029461517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008063306,0.00022012785,0.00022060935,0.00016714107,0.00068972167,0.00044503983,0.0010232542,0.00007844134,0.000007654773],"category_scores_gemma":[0.0006920805,0.00013086296,0.000072650895,0.0008176734,0.00029381723,0.00025833867,0.00031285625,0.00047919282,0.00006461663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016174747,0.00003915272,0.00007448087,0.000007694067,0.000028856686,0.0000053114777,0.00038691214,0.000008516524,0.0023161506,0.9949141,0.00020286381,0.001999792],"study_design_scores_gemma":[0.0008113131,0.0005248323,0.0011845013,0.00007996738,0.000026162636,0.000090019465,0.0002450492,0.0066726017,0.0061271577,0.9775484,0.006236429,0.0004535693],"about_ca_topic_score_codex":0.000003917024,"about_ca_topic_score_gemma":0.00008356959,"teacher_disagreement_score":0.63269734,"about_ca_system_score_codex":0.000027075315,"about_ca_system_score_gemma":0.00007229372,"threshold_uncertainty_score":0.53364366},"labels":[],"label_agreement":null},{"id":"W2952648278","doi":"10.48550/arxiv.1505.04235","title":"Triangulating planar graphs while keeping the pathwidth small","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pathwidth; Planar graph; Outerplanar graph; Combinatorics; Mathematics; Planar; Planar straight-line graph; 1-planar graph; Discrete mathematics; Graph; Line graph; Computer science","score_opus":0.1652076121399514,"score_gpt":0.22358768163761225,"score_spread":0.058380069497660864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952648278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19478686,0.0004044529,0.79432666,0.0002596383,0.00076369813,0.000775455,0.0000275415,0.0004998063,0.008155854],"genre_scores_gemma":[0.99454737,0.000105574414,0.004187166,0.00015883925,0.000096715296,0.000003205658,0.000015577167,0.000032636988,0.0008529281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969106,0.0006183428,0.00026876692,0.0013006207,0.0002158567,0.00068586686],"domain_scores_gemma":[0.9962338,0.00047583226,0.00033460345,0.0023489844,0.00032031187,0.0002864764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014660762,0.00038415834,0.00039865068,0.00041683853,0.00043904898,0.00023713855,0.0045223176,0.00026837454,0.0000114121385],"category_scores_gemma":[0.00017386951,0.00034977117,0.00029923345,0.0013170086,0.00026485074,0.00038107936,0.0030992748,0.0012458181,0.000075883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007554228,0.000065475426,0.0019047374,0.00006212389,0.0001393696,0.0005307202,0.0011025581,0.14167948,0.000052594176,0.8498868,0.00031525036,0.004185386],"study_design_scores_gemma":[0.00066345,0.000062291365,0.00042041883,0.000110311215,0.000034951503,0.000007714656,0.00028128448,0.22788185,0.00008293379,0.7689255,0.0010121195,0.0005172004],"about_ca_topic_score_codex":0.00012743236,"about_ca_topic_score_gemma":0.00007037727,"teacher_disagreement_score":0.7997605,"about_ca_system_score_codex":0.00022403024,"about_ca_system_score_gemma":0.00034598622,"threshold_uncertainty_score":0.99989545},"labels":[],"label_agreement":null},{"id":"W2952658105","doi":"10.48550/arxiv.1009.3502","title":"Simultaneous Interval Graphs","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interval graph; Combinatorics; Chordal graph; Indifference graph; Pathwidth; Split graph; Bipartite graph; Cograph; Mathematics; Maximal independent set; Discrete mathematics; Interval (graph theory); Vertex (graph theory); Graph; 1-planar graph; Line graph","score_opus":0.056219126773442096,"score_gpt":0.22186823967991592,"score_spread":0.16564911290647383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952658105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32171375,0.00004624981,0.673549,0.00008864034,0.0010149735,0.0003255491,0.00001676442,0.0004958996,0.0027491779],"genre_scores_gemma":[0.9919434,0.00009137135,0.0052863825,0.00008550583,0.000058331672,0.0000012351746,0.0000091180555,0.000029516013,0.0024951473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972388,0.00022186372,0.00021102051,0.0015314138,0.00017094807,0.0006259336],"domain_scores_gemma":[0.9962558,0.00046900037,0.00020069856,0.002455399,0.00029032637,0.00032878332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003772512,0.0003976158,0.0003838803,0.0005461518,0.00020515684,0.00018242757,0.004953809,0.0004776305,0.0000668683],"category_scores_gemma":[0.00018324459,0.0004538431,0.00035615105,0.0008933098,0.00036820356,0.00042398565,0.005357517,0.002195254,0.0002622415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053584976,0.000107306674,0.0004266557,0.000053105232,0.000082754144,0.0017575984,0.00018078009,0.10785118,0.00033369352,0.8853158,0.000092278955,0.0037453137],"study_design_scores_gemma":[0.00025795304,0.00005849128,0.000056122593,0.000039229806,0.000016621787,0.000013661375,0.000023179908,0.42117175,0.00038061244,0.5765563,0.0010022644,0.00042377756],"about_ca_topic_score_codex":0.000052914642,"about_ca_topic_score_gemma":0.000060567243,"teacher_disagreement_score":0.6702297,"about_ca_system_score_codex":0.00012283021,"about_ca_system_score_gemma":0.0001908494,"threshold_uncertainty_score":0.9997913},"labels":[],"label_agreement":null},{"id":"W2952697189","doi":"10.48550/arxiv.1101.2630","title":"Minimum degree condition forcing complete graph immersion","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets; Complement graph; Graph power; Line graph","score_opus":0.1731671707257376,"score_gpt":0.23352034678209177,"score_spread":0.06035317605635418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952697189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17765316,0.0000798818,0.81491196,0.00003987759,0.00056033937,0.00042382185,0.000028846192,0.00027498772,0.006027154],"genre_scores_gemma":[0.9947413,0.00015654703,0.00402427,0.000075895274,0.000047127432,0.0000022255379,0.00004993917,0.000029502835,0.00087317784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970956,0.00030478428,0.00025365734,0.0014968156,0.00018434059,0.00066481245],"domain_scores_gemma":[0.99707556,0.00019926675,0.00032421452,0.0018454561,0.00026542114,0.0002900918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043506047,0.0004094758,0.00041017108,0.0007537664,0.00035892994,0.000102693615,0.003020645,0.00032189148,0.00009182262],"category_scores_gemma":[0.000028871367,0.00048271727,0.00036012588,0.00091707916,0.00032402933,0.0007596241,0.0034096474,0.00090389006,0.0002795697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013537622,0.00012827766,0.0014334787,0.00012910459,0.00018196022,0.0006067089,0.00040844435,0.0155273825,0.0014857585,0.97776574,0.00050811423,0.0016896625],"study_design_scores_gemma":[0.0008860773,0.00015197409,0.0015663116,0.00016815722,0.000065146865,0.000015162161,0.00017292617,0.11947644,0.0014448054,0.87495613,0.00026171407,0.0008351633],"about_ca_topic_score_codex":0.00010958636,"about_ca_topic_score_gemma":0.000019085628,"teacher_disagreement_score":0.8170881,"about_ca_system_score_codex":0.00020198882,"about_ca_system_score_gemma":0.00013747047,"threshold_uncertainty_score":0.9997625},"labels":[],"label_agreement":null},{"id":"W2952726132","doi":"10.1016/j.ejc.2018.02.027","title":"Maximum colored trees in edge-colored graphs","year":2019,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College Saint-Jean","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministère de l'Éducation Nationale","keywords":"Colored; Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Materials science; Artificial intelligence","score_opus":0.01409644265845204,"score_gpt":0.24717553546455168,"score_spread":0.23307909280609965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952726132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95511997,0.0006125857,0.023770424,0.00050862867,0.0020151422,0.00024299695,9.566796e-7,0.000055146476,0.017674124],"genre_scores_gemma":[0.9969392,0.00009115837,0.0024155893,0.000089822024,0.000030736443,8.113202e-7,3.6302248e-7,0.000029066643,0.00040328712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970271,0.0009667119,0.0006419339,0.00025942342,0.0006691454,0.00043571135],"domain_scores_gemma":[0.9981867,0.0002676372,0.00040597748,0.00057414843,0.0003523429,0.00021319982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025969648,0.00018294707,0.00035704474,0.00069708476,0.00006252338,0.00013038807,0.0022936382,0.000033052755,0.000021565509],"category_scores_gemma":[0.00019770463,0.00016227913,0.0001614108,0.0015240563,0.00008393706,0.0007560327,0.0003801113,0.00065682747,0.00016902447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036702064,0.00077173044,0.039173145,0.00003717566,0.00008515473,0.0029058522,0.0016960388,0.0011712484,0.0065092216,0.9253271,0.0021545498,0.019801725],"study_design_scores_gemma":[0.008906089,0.004168324,0.15121561,0.00022187705,0.000013969418,0.00042291183,0.0002811745,0.0022072792,0.0027437762,0.8059308,0.023165548,0.000722669],"about_ca_topic_score_codex":5.8195303e-7,"about_ca_topic_score_gemma":8.0105735e-7,"teacher_disagreement_score":0.119396366,"about_ca_system_score_codex":0.00010294791,"about_ca_system_score_gemma":0.00010985651,"threshold_uncertainty_score":0.66175514},"labels":[],"label_agreement":null},{"id":"W2952752670","doi":"10.48550/arxiv.1605.03203","title":"Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Rounding; Combinatorics; Spanning tree; Degree (music); Approximation algorithm; Constant (computer programming); Mathematical optimization; Minimum spanning tree; Reduction (mathematics); Lagrangian relaxation; Discrete mathematics; Computer science","score_opus":0.06834909232928307,"score_gpt":0.2194286375278627,"score_spread":0.15107954519857963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952752670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15157957,0.00005286069,0.8426658,0.0003492509,0.0005615454,0.0014027266,0.00007763129,0.000611648,0.0026989572],"genre_scores_gemma":[0.9528558,0.00003405899,0.044868995,0.00004620284,0.00023798527,0.000023037557,0.000056391946,0.000058140355,0.0018193612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953341,0.00043389178,0.00050598214,0.0024550806,0.00028998955,0.0009809899],"domain_scores_gemma":[0.9960954,0.0003149382,0.00050969084,0.0021608272,0.00039221067,0.0005269411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066628796,0.00062341575,0.00064913527,0.0009717632,0.00039740663,0.00024197786,0.0030486712,0.00042391857,0.00006478767],"category_scores_gemma":[0.00012819808,0.00062456046,0.00029605263,0.0017681596,0.00028790327,0.0007787119,0.0029129703,0.00093590876,0.00017862367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005690579,0.00057090825,0.0016930584,0.0003348862,0.0010030747,0.0010461352,0.007757154,0.12459846,0.03142216,0.77609295,0.00054437335,0.054367803],"study_design_scores_gemma":[0.001312906,0.00012405745,0.00015973831,0.00094990793,0.000056902678,0.000015725438,0.00036429765,0.5248914,0.003759654,0.46660134,0.0006150112,0.0011490886],"about_ca_topic_score_codex":0.00013537702,"about_ca_topic_score_gemma":0.000026237316,"teacher_disagreement_score":0.80127627,"about_ca_system_score_codex":0.00054598285,"about_ca_system_score_gemma":0.00032825005,"threshold_uncertainty_score":0.99962056},"labels":[],"label_agreement":null},{"id":"W2952856253","doi":"","title":"Reconfiguration of Dominating Sets","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Graph; Control reconfiguration; Adjacency list; Domination analysis; Discrete mathematics; Connected dominating set; Computer science","score_opus":0.078056358029308,"score_gpt":0.22691487864325507,"score_spread":0.14885852061394705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952856253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23644303,0.000017745595,0.75830734,0.000041599673,0.00022046306,0.00018590679,0.000005055864,0.000091993505,0.004686852],"genre_scores_gemma":[0.9930157,0.000034745277,0.0062752664,0.000019159806,0.000024891919,6.9711945e-7,0.000007578433,0.000011192189,0.0006107673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983947,0.00028398892,0.00020486691,0.0007472895,0.00010829649,0.00026085737],"domain_scores_gemma":[0.9978224,0.0002710508,0.00034580464,0.001191307,0.0002707254,0.00009873069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005925042,0.00018453262,0.00028294057,0.00033030388,0.00009267307,0.000046985733,0.0017489172,0.00018561666,0.00002305025],"category_scores_gemma":[0.00012879948,0.00021768043,0.00014782973,0.00047855254,0.00013218014,0.0003381301,0.0013117935,0.00045596578,0.000038702994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034072345,0.000050653773,0.00065684837,0.00016542256,0.000052882646,0.00005681825,0.00028633777,0.14944956,0.0008744157,0.838131,0.00007312365,0.0101688625],"study_design_scores_gemma":[0.000295851,0.00005364061,0.00041260812,0.00010285735,0.000012705637,0.0000025356653,0.000034329943,0.59811616,0.0035493418,0.39706835,0.00010484333,0.00024679076],"about_ca_topic_score_codex":0.000025565467,"about_ca_topic_score_gemma":0.0000076005113,"teacher_disagreement_score":0.75657266,"about_ca_system_score_codex":0.00009424137,"about_ca_system_score_gemma":0.00011383938,"threshold_uncertainty_score":0.887675},"labels":[],"label_agreement":null},{"id":"W2952863668","doi":"10.48550/arxiv.1410.7676","title":"The densest matroids in minor-closed classes with exponential growth rate","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Matroid; Mathematics; Finite field; Prime power; Integer (computer science); Rank (graph theory); Constant (computer programming); Function (biology); Exponential function; Finite set; Prime (order theory); Minor (academic); Discrete mathematics; Mathematical analysis","score_opus":0.043225620052471304,"score_gpt":0.19808401154318214,"score_spread":0.15485839149071084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952863668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5906589,0.000044089364,0.407474,0.00017000704,0.00024165661,0.00034678561,0.0000036434076,0.00013048397,0.0009303934],"genre_scores_gemma":[0.9969854,0.00016024188,0.0012519012,0.00004680467,0.00006145514,0.0000044144367,0.0000053309736,0.000028162109,0.0014563422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969156,0.0007508363,0.00022715893,0.0012179946,0.00019107458,0.00069734483],"domain_scores_gemma":[0.99692714,0.0006970161,0.0002357085,0.0017069161,0.0002486178,0.00018458908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079259067,0.00037685715,0.00035069964,0.00039612944,0.0003294226,0.00029301606,0.0035542103,0.00020474156,0.0000083324985],"category_scores_gemma":[0.00009243287,0.00030954333,0.00014955508,0.0009603137,0.0004935991,0.00041292832,0.0022748457,0.0009632795,0.00007823063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005739495,0.00014237649,0.014208611,0.00010863976,0.00013245277,0.0017354075,0.00022344026,0.056423735,0.00038992867,0.92519814,0.0002044941,0.0006588438],"study_design_scores_gemma":[0.0031902432,0.00044480848,0.0288508,0.00031666688,0.00007806441,0.000037139653,0.00027399228,0.27243456,0.002229955,0.68930316,0.0011910591,0.0016495489],"about_ca_topic_score_codex":0.00013909535,"about_ca_topic_score_gemma":0.00044882754,"teacher_disagreement_score":0.4063264,"about_ca_system_score_codex":0.00020068699,"about_ca_system_score_gemma":0.00028010271,"threshold_uncertainty_score":0.9999357},"labels":[],"label_agreement":null},{"id":"W2952930798","doi":"10.48550/arxiv.1308.2843","title":"The robber strikes back","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University; St. Francis Xavier University","funders":"","keywords":"Bipartite graph; Combinatorics; Vertex (graph theory); Graph; Mathematics; Discrete mathematics; Computer science","score_opus":0.08252482297315175,"score_gpt":0.2111936004055462,"score_spread":0.12866877743239444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952930798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09852579,0.00035220565,0.8803364,0.0007157663,0.0010682041,0.0008428779,0.000011763021,0.00034478042,0.017802218],"genre_scores_gemma":[0.96997416,0.00064619235,0.0023323027,0.000073945164,0.00007849327,0.0000027487588,0.0000045736547,0.000023921242,0.026863676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772143,0.00030690464,0.00017187664,0.0010443192,0.00015298881,0.0006024648],"domain_scores_gemma":[0.99644417,0.00047297621,0.00017782007,0.0024367946,0.0002590087,0.00020924247],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041316292,0.00029423038,0.00023354635,0.00017160986,0.00041115785,0.00036771022,0.004927399,0.00021711041,0.00012682547],"category_scores_gemma":[0.00006119618,0.00024460876,0.00021683484,0.0006787006,0.0003612656,0.00051920867,0.0048550777,0.0009289006,0.001515406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015871157,0.000034397788,0.00043347906,0.000026122914,0.00007487188,0.00006107251,0.00007800193,0.057607252,0.00004096647,0.93700176,0.0025399725,0.0020862352],"study_design_scores_gemma":[0.00028157234,0.000040061415,0.00042308986,0.00004151421,0.000013956768,0.0000034688453,0.0000660031,0.19576769,0.00034665683,0.7893383,0.013239086,0.00043860124],"about_ca_topic_score_codex":0.00006630322,"about_ca_topic_score_gemma":0.000024402432,"teacher_disagreement_score":0.8780041,"about_ca_system_score_codex":0.00015371402,"about_ca_system_score_gemma":0.00018063556,"threshold_uncertainty_score":0.99926203},"labels":[],"label_agreement":null},{"id":"W2952959002","doi":"10.48550/arxiv.0709.3126","title":"Induced forests in regular graphs with large girth","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Girth (graph theory); Combinatorics; Mathematics","score_opus":0.05086317177513819,"score_gpt":0.3203814492806558,"score_spread":0.2695182775055176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952959002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89267814,0.00026354677,0.10456302,0.00025525028,0.00026472635,0.0006754389,0.0000063842444,0.00023826292,0.0010552148],"genre_scores_gemma":[0.99088347,0.000045325964,0.008317421,0.00020562633,0.00006648286,0.00010505135,0.000017107022,0.000055474768,0.0003040304],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9959209,0.0002447805,0.00046553047,0.0013860579,0.0008126879,0.0011700728],"domain_scores_gemma":[0.996529,0.00018722781,0.00023694034,0.0025647054,0.00021965533,0.00026251684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015995407,0.00047086095,0.0005195221,0.0010164254,0.00013950307,0.00011725977,0.0028991126,0.00041792457,0.000015781765],"category_scores_gemma":[0.00012460844,0.00041711985,0.00015125678,0.001617608,0.00015902235,0.00045335866,0.0027528133,0.001915597,0.00008766341],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093212155,0.00021314107,0.9167455,0.00010293144,0.00006240269,0.0006515872,0.000643065,0.0003288467,0.00065691303,0.07725106,0.000058937647,0.0031923943],"study_design_scores_gemma":[0.0012822222,0.0002315476,0.8415258,0.00037733396,0.000008749657,0.000025583315,0.000056115903,0.0013511106,0.0053547393,0.14817594,0.0007695431,0.0008412914],"about_ca_topic_score_codex":0.00007347276,"about_ca_topic_score_gemma":0.00108663,"teacher_disagreement_score":0.09820532,"about_ca_system_score_codex":0.00014379152,"about_ca_system_score_gemma":0.00029076412,"threshold_uncertainty_score":0.99982804},"labels":[],"label_agreement":null},{"id":"W2953051110","doi":"10.48550/arxiv.1504.06586","title":"A Lex-BFS-based recognition algorithm for Robinsonian matrices","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Changchun Institute of Applied Chemistry; Universitat Politècnica de Catalunya; Università degli Studi G. d'Annunzio Chieti - Pescara; Université Paris Diderot; Universitetet i Bergen; Università degli Studi di Firenze; Tel Aviv University; Technische Universität Berlin; Sapienza Università di Roma; Uniwersytet Warszawski; Albert-Ludwigs-Universität Freiburg; Weizmann Institute of Science; Eidgenössische Technische Hochschule Zürich; Technische Universiteit Eindhoven; Institut national de recherche en informatique et en automatique (INRIA); University of Leicester; Centre National de la Recherche Scientifique; University of Oxford; Université du Québec en Outaouais; Princeton University","keywords":"Combinatorics; Lexicographical order; Recursion (computer science); Adjacency matrix; Enumeration; Simple (philosophy); Mathematics; Matrix (chemical analysis); Adjacency list; Similarity (geometry); Interval (graph theory); Algorithm; Tree (set theory); Computer science; Discrete mathematics; Graph; Artificial intelligence","score_opus":0.13374642092011313,"score_gpt":0.24275036420840104,"score_spread":0.10900394328828791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953051110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012623915,0.000117242664,0.98430026,0.000113535556,0.00047260566,0.0008647175,0.00016865633,0.00054329296,0.00079579226],"genre_scores_gemma":[0.70257026,0.00015791909,0.29431853,0.00021425504,0.0002730032,0.000030637322,0.00023111574,0.00008424031,0.0021200292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742687,0.00023805539,0.00021322462,0.0013686324,0.00017339867,0.0005798306],"domain_scores_gemma":[0.9971305,0.00029273905,0.00028000242,0.0012607992,0.0007184507,0.00031751549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007634791,0.00035602247,0.00036847536,0.0006721923,0.00021597654,0.0001956277,0.0023501546,0.00032952955,0.000015671336],"category_scores_gemma":[0.00008328479,0.00042096345,0.00029143813,0.0009741976,0.00015448795,0.0005899893,0.0011917021,0.00059180625,0.00013368936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006542649,0.001123965,0.0005960204,0.0009300283,0.0005633803,0.001280268,0.00068161107,0.39888316,0.00017392616,0.17805691,0.0065650586,0.4104914],"study_design_scores_gemma":[0.0008541742,0.00013383031,0.000018162806,0.00007853639,0.00003497471,0.0000027069761,0.000031910764,0.7047998,0.0003477173,0.29202393,0.0012607403,0.00041353816],"about_ca_topic_score_codex":0.00005836006,"about_ca_topic_score_gemma":0.000021450745,"teacher_disagreement_score":0.6899817,"about_ca_system_score_codex":0.00037983517,"about_ca_system_score_gemma":0.0005600801,"threshold_uncertainty_score":0.9998242},"labels":[],"label_agreement":null},{"id":"W2953104796","doi":"10.48550/arxiv.math/0606469","title":"Semisymmetric Graphs from Polytopes","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of New Brunswick","funders":"","keywords":"Polytope; Business; Combinatorics; Computer science; Mathematics","score_opus":0.04428529211623256,"score_gpt":0.2971751022415443,"score_spread":0.25288981012531175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953104796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8547326,0.003274111,0.13348451,0.0005869691,0.0010607634,0.00043028337,0.00006776725,0.0006236299,0.0057394006],"genre_scores_gemma":[0.97431076,0.00019351972,0.023088941,0.00031666274,0.00029418932,0.00008292534,0.00008195874,0.000055624754,0.0015754264],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99617237,0.00026397334,0.00048524747,0.00153292,0.0007577819,0.0007877256],"domain_scores_gemma":[0.99602634,0.0004982876,0.0002663542,0.0027728195,0.00019775904,0.00023841592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046781154,0.0004877556,0.0005337671,0.00089511496,0.00020043668,0.0002614451,0.0042893183,0.00038832217,0.0000543734],"category_scores_gemma":[0.00019684983,0.00047743192,0.00034109587,0.0017322468,0.00019137112,0.00038206525,0.0044229184,0.0013961612,0.0004991289],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036553956,0.00038561193,0.89791787,0.00012079787,0.00030763773,0.00036463916,0.00041989857,0.0010449499,0.0045044543,0.036939602,0.0067877304,0.051170275],"study_design_scores_gemma":[0.00050241034,0.00006605824,0.60305744,0.00014986348,0.000029643736,0.000007129353,0.00001490634,0.0024687864,0.0089907525,0.37783864,0.005791913,0.0010824836],"about_ca_topic_score_codex":0.0009502247,"about_ca_topic_score_gemma":0.000042208805,"teacher_disagreement_score":0.34089902,"about_ca_system_score_codex":0.00011456636,"about_ca_system_score_gemma":0.00017504807,"threshold_uncertainty_score":0.9997677},"labels":[],"label_agreement":null},{"id":"W2953110844","doi":"10.48550/arxiv.math/0202052","title":"A classification of plane and planar 2-trees","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Planar; Plane (geometry); Computer science; Mathematics; Geometry; Computer graphics (images)","score_opus":0.08731393709567446,"score_gpt":0.3101359359801462,"score_spread":0.22282199888447174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953110844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9417781,0.0009029588,0.054458767,0.00068475434,0.00017135726,0.000285941,0.000026464162,0.00011897291,0.0015726837],"genre_scores_gemma":[0.9937687,0.00033776695,0.005226153,0.000034745295,0.000049487157,0.000028664172,0.000014541967,0.000013224756,0.0005267436],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984679,0.000114815455,0.00027265234,0.00059502275,0.00030093628,0.0002486512],"domain_scores_gemma":[0.9984726,0.000188413,0.00020498014,0.0009449258,0.00009161476,0.000097522665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002867808,0.00018069652,0.00026764852,0.00021956889,0.00006338606,0.000043235803,0.0009907081,0.00016938773,0.000019848232],"category_scores_gemma":[0.00008357828,0.00017254708,0.000055706572,0.00021190365,0.00018305994,0.00016341916,0.0007304218,0.00045860469,0.00004892902],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061762184,0.00026894853,0.848851,0.0005305072,0.00016682096,0.0000741407,0.0018684196,0.00018369308,0.02751156,0.08470529,0.0011723967,0.034605406],"study_design_scores_gemma":[0.00032127384,0.00011032464,0.94731414,0.00015790867,0.000011434512,0.000018284907,0.000049652575,0.010538347,0.0029033893,0.036454476,0.0017556788,0.000365088],"about_ca_topic_score_codex":0.000023334576,"about_ca_topic_score_gemma":0.000016229835,"teacher_disagreement_score":0.09846309,"about_ca_system_score_codex":0.00002852734,"about_ca_system_score_gemma":0.000041988806,"threshold_uncertainty_score":0.7036266},"labels":[],"label_agreement":null},{"id":"W2953175718","doi":"10.48550/arxiv.1409.6952","title":"A 0.821-ratio purely combinatorial algorithm for maximum $k$-vertex cover in bipartite graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Vertex cover; Bipartite graph; Combinatorics; Bounded function; Cover (algebra); Greedy algorithm; Vertex (graph theory); Mathematics; Approximation algorithm; Combinatorial algorithms; Discrete mathematics; Algorithm; Graph","score_opus":0.05102069242716498,"score_gpt":0.22248638255844194,"score_spread":0.17146569013127697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953175718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03117959,0.00005626422,0.9644633,0.00008691404,0.0020389822,0.0011073139,0.000051344385,0.0002239923,0.00079232163],"genre_scores_gemma":[0.9895716,0.000096168755,0.0092852,0.00011692454,0.00010318851,0.000020497391,0.00004075383,0.000046895035,0.00071877387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640507,0.00044701065,0.0003606508,0.0017043056,0.00024459677,0.00083838165],"domain_scores_gemma":[0.9968034,0.0005645508,0.0002892565,0.0017137693,0.00034453257,0.0002844601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010601529,0.0004764065,0.0006081776,0.0008357933,0.00021252294,0.00021709169,0.0030150928,0.0004799553,0.000027422102],"category_scores_gemma":[0.00014010654,0.00056803995,0.0003840613,0.0012939717,0.00026177554,0.0006768803,0.0021277433,0.0009434199,0.000114220595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011927178,0.00021326968,0.00065793627,0.00008554392,0.00008959436,0.00017338696,0.00015931354,0.026722692,0.00007645426,0.9663919,0.0005121058,0.004798484],"study_design_scores_gemma":[0.0012815242,0.000104453415,0.00009959822,0.000050224022,0.000016266422,0.0000018868599,0.000010734005,0.4694411,0.00026913537,0.52728784,0.0010682978,0.00036894862],"about_ca_topic_score_codex":0.00007300659,"about_ca_topic_score_gemma":0.000027887061,"teacher_disagreement_score":0.958392,"about_ca_system_score_codex":0.00030026882,"about_ca_system_score_gemma":0.00031531823,"threshold_uncertainty_score":0.9996771},"labels":[],"label_agreement":null},{"id":"W2953189329","doi":"10.48550/arxiv.1612.06473","title":"Sorting Networks On Restricted Topologies","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Sorting network; Sorting; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Line graph; Computer science; Sorting algorithm; Algorithm","score_opus":0.09646893039623879,"score_gpt":0.23207899575908034,"score_spread":0.13561006536284154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953189329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064639024,0.00006046746,0.92451304,0.00024616966,0.00062497583,0.0002744846,0.000005408357,0.0006033036,0.009033156],"genre_scores_gemma":[0.9960965,0.000233954,0.001124601,0.000084774896,0.00011503012,0.0000015502453,0.0000038934395,0.000020002555,0.0023196947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973817,0.00031606836,0.00020609616,0.0013004851,0.00013458867,0.0006610758],"domain_scores_gemma":[0.99687016,0.00060889724,0.00027473463,0.0019017094,0.0001691592,0.00017531363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029318468,0.00032004167,0.00031317704,0.00042134404,0.000249356,0.00011173854,0.0031412637,0.0003449693,0.0000211636],"category_scores_gemma":[0.0002240341,0.0002961041,0.0001967118,0.0007973593,0.00026130857,0.00033289267,0.003913374,0.0009409567,0.000096334574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005724137,0.000035955807,0.001124782,0.000013597961,0.000044744113,0.00038981234,0.000032459975,0.18535675,0.00003229091,0.8093269,0.00023747375,0.0033479896],"study_design_scores_gemma":[0.0003856529,0.00011401732,0.0011237339,0.00015364865,0.000012536803,0.0000029146497,0.000033867458,0.24525096,0.00024386431,0.7519233,0.0002725824,0.00048289608],"about_ca_topic_score_codex":0.000016481023,"about_ca_topic_score_gemma":0.000004901289,"teacher_disagreement_score":0.93145746,"about_ca_system_score_codex":0.00023419711,"about_ca_system_score_gemma":0.00013437244,"threshold_uncertainty_score":0.9999491},"labels":[],"label_agreement":null},{"id":"W2953233053","doi":"10.48550/arxiv.1009.0358","title":"Dichotomy for tree-structured trigraph list homomorphism problems","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Graph homomorphism; Combinatorics; Algebra homomorphism; Mathematics; Partition (number theory); Tree (set theory); Discrete mathematics; Time complexity; Class (philosophy); Computer science; Graph; Line graph; Voltage graph","score_opus":0.0667668106424947,"score_gpt":0.21711699562087675,"score_spread":0.15035018497838204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953233053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11484846,0.00010763983,0.87981343,0.00018944118,0.0011386577,0.001898828,0.00010771913,0.00050932256,0.0013864959],"genre_scores_gemma":[0.9820299,0.000114901464,0.014237253,0.000072932,0.0001466374,0.000025497393,0.00005860293,0.000053355518,0.0032608795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965243,0.00015500521,0.00031632607,0.0019573648,0.00020923279,0.0008377677],"domain_scores_gemma":[0.9958873,0.00030046716,0.00037959166,0.0025969052,0.0004316528,0.00040407808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054653257,0.00055097434,0.0005832936,0.0007833098,0.00040029685,0.00025938562,0.0048073353,0.00067360775,0.000044313594],"category_scores_gemma":[0.00009450249,0.00059837446,0.0005666126,0.0012034276,0.00050256035,0.00055230915,0.002201832,0.0017046032,0.00002787954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021284333,0.00021843493,0.0016709814,0.00035239608,0.00027100972,0.0003142846,0.00043619866,0.02456046,0.0026744267,0.96354985,0.0009395214,0.0047995746],"study_design_scores_gemma":[0.0015711872,0.00013327676,0.00050243025,0.000079314224,0.00006413443,0.000012913652,0.00002226836,0.16636479,0.0015688126,0.81962645,0.009219137,0.0008352543],"about_ca_topic_score_codex":0.00008413899,"about_ca_topic_score_gemma":0.00029123126,"teacher_disagreement_score":0.8671815,"about_ca_system_score_codex":0.00014311718,"about_ca_system_score_gemma":0.00029587225,"threshold_uncertainty_score":0.9996468},"labels":[],"label_agreement":null},{"id":"W2953294211","doi":"10.1002/jgt.22174","title":"Finding a subdivision of a prescribed digraph of order 4","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Digraph; Subdivision; Combinatorics; Mathematics; Mathematical proof; Vertex (graph theory); Discrete mathematics; Reduction (mathematics); Time complexity; Order (exchange); Graph","score_opus":0.032089115078952526,"score_gpt":0.3273542662692229,"score_spread":0.2952651511902704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953294211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62186193,0.00092823245,0.3746962,0.00016825327,0.00040958408,0.00015186868,0.0000054036736,0.000013964386,0.0017645787],"genre_scores_gemma":[0.98522925,0.00016007807,0.014452247,0.000016181237,0.000034691242,0.0000013870077,1.3992207e-7,0.000012306701,0.00009369382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774206,0.0003549213,0.0006845883,0.00018969385,0.00073436793,0.0002943733],"domain_scores_gemma":[0.9957251,0.0005856333,0.0016561432,0.0011330984,0.0007644814,0.0001355437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003535091,0.00014793161,0.00045723363,0.00080919545,0.00023441378,0.00008409597,0.0029683202,0.0000741571,0.000024516088],"category_scores_gemma":[0.0012588471,0.00011348163,0.00036115744,0.00048916583,0.00056171394,0.0011757734,0.00045655665,0.00035472718,0.000001511986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005989152,0.0002623222,0.010764068,0.00008982464,0.00020375231,0.00005946486,0.0013732755,0.00007710659,0.03650853,0.91750914,0.00014231555,0.032411307],"study_design_scores_gemma":[0.0011349196,0.0006230057,0.023978608,0.00034646443,0.000026408099,0.00007129041,0.00014011814,0.00029165612,0.04149365,0.93158835,0.00015148935,0.00015406797],"about_ca_topic_score_codex":0.0000051156867,"about_ca_topic_score_gemma":0.0000019545184,"teacher_disagreement_score":0.36336735,"about_ca_system_score_codex":0.000013790426,"about_ca_system_score_gemma":0.000111641806,"threshold_uncertainty_score":0.5515927},"labels":[],"label_agreement":null},{"id":"W2953303033","doi":"10.48550/arxiv.1401.1870","title":"Homological face-width condition forcing $K_6$-minors in graphs on surfaces","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Face (sociological concept); Projective plane; Combinatorics; Mathematics; Graph; Plane (geometry); Surface (topology); Minor (academic); Geometry; Discrete mathematics; Pure mathematics; Art; Humanities; Linguistics","score_opus":0.08058807267128272,"score_gpt":0.23182592583715972,"score_spread":0.151237853165877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953303033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7039028,0.000032342785,0.29342678,0.000065173765,0.0002646815,0.00035601703,0.000010587426,0.00019575653,0.0017458851],"genre_scores_gemma":[0.9981634,0.00011066721,0.00094886165,0.00009944163,0.00002103811,0.0000031399725,0.000021778324,0.000019013612,0.00061268307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966444,0.0007071675,0.00025728234,0.0015331147,0.00020468091,0.0006533827],"domain_scores_gemma":[0.99747044,0.0006449778,0.00023339567,0.0013350545,0.00011125203,0.00020488973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080770266,0.00039596696,0.00046341386,0.00084511825,0.00018810378,0.0001177505,0.0024303517,0.00040467453,0.000032200547],"category_scores_gemma":[0.00014164022,0.00042185598,0.00022978989,0.0010191543,0.00032129826,0.00041816762,0.0018264396,0.0012071059,0.00012897026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007922401,0.00009910169,0.0057131364,0.000038439764,0.000030415931,0.0003968354,0.00015084412,0.38369465,0.0000670025,0.6090484,0.000052567622,0.000629372],"study_design_scores_gemma":[0.0006668945,0.00022723306,0.007945247,0.00013678812,0.000013242069,0.000005326293,0.00009897583,0.2028293,0.00058868685,0.7868272,0.00009337115,0.00056773814],"about_ca_topic_score_codex":0.00007382435,"about_ca_topic_score_gemma":0.00005489955,"teacher_disagreement_score":0.2942606,"about_ca_system_score_codex":0.00025492595,"about_ca_system_score_gemma":0.00009723769,"threshold_uncertainty_score":0.99982333},"labels":[],"label_agreement":null},{"id":"W2953528653","doi":"10.3390/a12080153","title":"γ-Graphs of Trees","year":2019,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Vertex (graph theory); Graph; Dominating set; Product (mathematics); Cartesian coordinate system; Tree (set theory)","score_opus":0.014962383509411167,"score_gpt":0.2805596362697304,"score_spread":0.26559725276031926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953528653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2912763,0.0007055392,0.67849535,0.0004871563,0.00085905485,0.0005162423,0.0000079396395,0.0002882184,0.027364181],"genre_scores_gemma":[0.9076493,0.000020747868,0.09069658,0.000055131724,0.00001533245,0.000006663386,8.710516e-7,0.000008201805,0.0015471929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991257,0.00004130909,0.00012278344,0.00022595385,0.00027349207,0.00021071828],"domain_scores_gemma":[0.999098,0.00011574316,0.000043769673,0.00061949424,0.00006965848,0.000053353633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002189468,0.000068832815,0.00012877234,0.0001385501,0.000023200573,0.000018541807,0.00083502656,0.000029295104,0.000051953855],"category_scores_gemma":[0.00001705625,0.00005958415,0.00006327101,0.0005411051,0.00005926076,0.000298836,0.00019511297,0.00008620622,0.00019647833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009531147,0.0000880777,0.0073720957,0.000019208985,0.000035257686,0.000016896673,0.0004098347,0.00013965844,0.011128389,0.7250682,0.00023623537,0.25547662],"study_design_scores_gemma":[0.0015945091,0.00083906285,0.029633395,0.000059181017,0.000006316622,0.000054008782,0.00016104507,0.09043255,0.07511996,0.79071766,0.010785973,0.0005963581],"about_ca_topic_score_codex":0.000008592128,"about_ca_topic_score_gemma":0.0000020738005,"teacher_disagreement_score":0.616373,"about_ca_system_score_codex":0.0000075174216,"about_ca_system_score_gemma":0.00002416908,"threshold_uncertainty_score":0.2525397},"labels":[],"label_agreement":null},{"id":"W2955375576","doi":"10.48550/arxiv.1803.06216","title":"Approximating Dominating Set on Intersection Graphs of Rectangles and\\n L-frames","year":2018,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Diagonal; Combinatorics; Mathematics; Intersection (aeronautics); Approximation algorithm; Line segment; Dominating set; Logarithm; Line (geometry); Discrete mathematics; Geometry; Graph; Mathematical analysis","score_opus":0.07268630673581478,"score_gpt":0.22945216330501103,"score_spread":0.15676585656919625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955375576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70294,0.00004340563,0.29361314,0.00003201592,0.00028551812,0.00023885867,0.000006769971,0.00006835123,0.0027719452],"genre_scores_gemma":[0.9955154,0.000085845706,0.003911737,0.000038793238,0.00006329967,5.977928e-7,0.0000011667668,0.000021725558,0.00036144964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972907,0.00050314283,0.0003646398,0.0010919826,0.0001808467,0.0005686902],"domain_scores_gemma":[0.9974744,0.0006373118,0.0004563537,0.0008216492,0.00041342474,0.00019688446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001042155,0.00031204007,0.00037775116,0.00077282067,0.0005459627,0.000096643475,0.00096430787,0.00016791307,0.000042494754],"category_scores_gemma":[0.000417246,0.00035524074,0.00015891189,0.0023703123,0.0013551427,0.0009538316,0.00079389586,0.0004653824,0.000029613377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055130397,0.00017710903,0.0052291895,0.00018255635,0.00013307575,0.00007772724,0.0055347155,0.0018089606,0.0045152716,0.9373113,0.000030985804,0.04444782],"study_design_scores_gemma":[0.0011578323,0.0020275528,0.00084721256,0.0005796813,0.000047235153,0.000021447971,0.0035934374,0.7279849,0.01986054,0.24333751,0.000044062614,0.00049859105],"about_ca_topic_score_codex":0.000053209147,"about_ca_topic_score_gemma":0.000026971284,"teacher_disagreement_score":0.72617596,"about_ca_system_score_codex":0.0001329879,"about_ca_system_score_gemma":0.000065318076,"threshold_uncertainty_score":0.99988997},"labels":[],"label_agreement":null},{"id":"W2955563424","doi":"10.1016/j.tcs.2019.05.031","title":"On the complexity of the k-kernel problem on cyclically k-partite digraphs","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Digraph; Combinatorics; Mathematics; Kernel (algebra); Integer (computer science); Vertex (graph theory); Discrete mathematics; Bipartite graph; Graph; Computer science","score_opus":0.025252963076736835,"score_gpt":0.27816583279390467,"score_spread":0.2529128697171678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955563424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45671928,0.000009445047,0.5002633,0.011450039,0.0006112296,0.0011661408,0.0000054799393,0.00016476642,0.029610325],"genre_scores_gemma":[0.9842667,0.0000014315591,0.013783154,0.0018478369,0.000029078661,0.000014748798,1.6212643e-7,0.000010341638,0.00004657227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957562,0.0004916326,0.00035229832,0.0008615459,0.0017777353,0.0007605795],"domain_scores_gemma":[0.99521023,0.0015235621,0.00014196176,0.0026917872,0.00023424295,0.00019823304],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0027190705,0.00023839739,0.00026071034,0.00016070594,0.00054978643,0.0002595458,0.007800674,0.000051406238,0.000087677094],"category_scores_gemma":[0.00022646444,0.00011736415,0.00018006309,0.0023722162,0.012116394,0.0003235845,0.002193445,0.0005835198,0.00027702353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003466956,0.00011624435,0.00022995913,0.000007181892,0.0000052383234,0.0000011859656,0.00021346194,0.0006691875,0.0014702809,0.9942636,0.000049611856,0.0029394026],"study_design_scores_gemma":[0.00018366061,0.0004456802,0.004772833,0.000073846735,0.0000016816136,0.000006387584,0.0000037063169,0.114711754,0.0096341865,0.86994916,0.00006497928,0.00015209366],"about_ca_topic_score_codex":0.0000029276293,"about_ca_topic_score_gemma":8.927696e-7,"teacher_disagreement_score":0.5275474,"about_ca_system_score_codex":0.000051303254,"about_ca_system_score_gemma":0.0001223425,"threshold_uncertainty_score":0.9975676},"labels":[],"label_agreement":null},{"id":"W2956368669","doi":"","title":"On the domination number of 2-dimensional torus graphs","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Torus; Combinatorics; Geometry","score_opus":0.02505767166059,"score_gpt":0.31828497504855485,"score_spread":0.2932273033879649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956368669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7422171,0.000047710688,0.14848045,0.0026104415,0.0003192541,0.0007577724,0.0000107951755,0.00017642604,0.10538005],"genre_scores_gemma":[0.9709716,7.745944e-7,0.028476754,0.00014450566,0.000015390195,0.000022136426,4.745742e-7,0.000007582986,0.0003608048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868387,0.00013366377,0.00022080267,0.00022492681,0.00051816634,0.0002185881],"domain_scores_gemma":[0.99765176,0.0011650666,0.00008246939,0.0008469118,0.00020295946,0.000050808798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009054936,0.00010099054,0.00013390019,0.00007515538,0.00014462395,0.000025071606,0.0007702759,0.000034867804,0.00066395896],"category_scores_gemma":[0.00056161,0.00006225949,0.00007553974,0.000431195,0.00039383303,0.00015733865,0.00020805029,0.00010027515,0.0006507533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001429609,0.0000876066,0.0000122473175,0.000013148655,0.000012286942,9.3593644e-7,0.0005192373,7.0551584e-7,0.00045589276,0.99523556,0.0014266154,0.002221439],"study_design_scores_gemma":[0.00012279053,0.000091157955,0.00018445824,0.000042189877,0.0000027771277,0.000009863526,0.00004065078,0.008944732,0.006496626,0.98381096,0.00018704301,0.00006676267],"about_ca_topic_score_codex":0.0000014521707,"about_ca_topic_score_gemma":6.4173054e-7,"teacher_disagreement_score":0.22875446,"about_ca_system_score_codex":0.00001697514,"about_ca_system_score_gemma":0.000027477872,"threshold_uncertainty_score":0.8364334},"labels":[],"label_agreement":null},{"id":"W2956384121","doi":"10.48550/arxiv.1807.10988","title":"Naji's characterization of circle graphs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Characterization (materials science); Mathematics; Computer science; Materials science; Nanotechnology","score_opus":0.06077858300379991,"score_gpt":0.20919896489904224,"score_spread":0.14842038189524234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956384121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52275515,0.0000080463,0.47587103,0.000022549328,0.00028693554,0.00018233177,0.000017430551,0.00011180741,0.0007447233],"genre_scores_gemma":[0.99809253,0.00011577945,0.0011075124,0.000027331262,0.00003844137,8.952473e-7,0.000026494967,0.000016759373,0.000574224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982476,0.00018888085,0.00019706447,0.0009023733,0.000138161,0.00032587777],"domain_scores_gemma":[0.99757445,0.00006860146,0.00030827223,0.0015437461,0.00037237804,0.00013253314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003235578,0.00020323627,0.00028816273,0.0004936122,0.00010835702,0.000050593255,0.0023133133,0.00021382644,0.000036795776],"category_scores_gemma":[0.000038016206,0.00026223782,0.00018388593,0.0010725883,0.0003116514,0.0004901395,0.0022256728,0.00036914632,0.00007350423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008195798,0.00018885625,0.0045587854,0.00020931839,0.00014068988,0.00012943459,0.00038241118,0.0042910324,0.016237922,0.9699069,0.00004494412,0.0038277071],"study_design_scores_gemma":[0.00052310346,0.00016062723,0.01907103,0.00016646457,0.000033652606,0.000004227361,0.000022156717,0.10582093,0.013618632,0.8596285,0.0003562736,0.0005943884],"about_ca_topic_score_codex":0.000017423647,"about_ca_topic_score_gemma":0.0000034584655,"teacher_disagreement_score":0.47533742,"about_ca_system_score_codex":0.00007482051,"about_ca_system_score_gemma":0.00014206511,"threshold_uncertainty_score":0.999983},"labels":[],"label_agreement":null},{"id":"W2956649389","doi":"10.1145/3389390","title":"Approximate Counting CSP Seen from the Other Side","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Recursively enumerable language; Treewidth; Arity; Homomorphism; Bounded function; Constraint satisfaction problem; Class (philosophy); Time complexity; Polynomial","score_opus":0.03920015596666548,"score_gpt":0.2917818174662398,"score_spread":0.25258166149957434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956649389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003839887,0.00006456254,0.9854923,0.008966674,0.00017150627,0.0002876934,0.00002822237,0.00040939834,0.00073975086],"genre_scores_gemma":[0.9231229,0.000007984004,0.070789166,0.005795187,0.00010194415,0.000039885577,0.000006163732,0.000032556203,0.00010423264],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803,0.00054258056,0.00025294488,0.00047820256,0.00041362757,0.00028261985],"domain_scores_gemma":[0.99645066,0.0025608332,0.000097245116,0.00067739986,0.000100992795,0.000112848415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062414946,0.00017708728,0.00015475797,0.000070366776,0.00048330487,0.00019627591,0.0014796098,0.000056023895,0.00009818589],"category_scores_gemma":[0.00014272165,0.0001388407,0.00010973436,0.0006824517,0.00013771915,0.00048073818,0.000044623775,0.00040407255,0.00030208347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020753524,0.00013031972,0.000047749643,0.000018561226,0.00017216707,0.000011887753,0.0077834977,0.14620583,0.0019192569,0.21876879,0.00016358124,0.62457085],"study_design_scores_gemma":[0.00065530406,0.00010954775,0.00030141065,0.000027633194,0.00001986385,0.0000048482516,0.0005492303,0.23991574,0.005161627,0.75040936,0.0025576395,0.0002878082],"about_ca_topic_score_codex":0.000023098319,"about_ca_topic_score_gemma":0.0000052580867,"teacher_disagreement_score":0.919283,"about_ca_system_score_codex":0.00003442356,"about_ca_system_score_gemma":0.000051134055,"threshold_uncertainty_score":0.56617594},"labels":[],"label_agreement":null},{"id":"W2957704882","doi":"10.1007/978-3-030-25005-8_21","title":"A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modular design; Scheme (mathematics); Computer science; Theoretical computer science; Parallel computing; Hypergraph; Programming language; Mathematics; Discrete mathematics","score_opus":0.014524078078809427,"score_gpt":0.28097084279795725,"score_spread":0.26644676471914785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957704882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020470543,0.00077118765,0.9968193,0.0002217003,0.00022417211,0.0012376514,0.000034023284,0.000060167742,0.00042709868],"genre_scores_gemma":[0.014555516,0.000070060196,0.9846255,0.00021820309,0.00016796679,0.00009261775,0.000010360371,0.000029062676,0.00023067238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973846,0.000022613265,0.00038494277,0.0011858619,0.000538848,0.00048313546],"domain_scores_gemma":[0.99749434,0.0005295255,0.00019652832,0.0012738536,0.00036883482,0.00013691743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053618103,0.00032355502,0.00044144446,0.00094732025,0.00022528475,0.00014987456,0.0021491824,0.00019004126,0.0000032837072],"category_scores_gemma":[0.000028312834,0.00031455184,0.00013575854,0.00060837506,0.0008799929,0.00039217476,0.00090241747,0.00038775604,0.0000059979234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007739016,0.00003738877,0.000039790266,0.000102621285,0.000022514818,0.0000038525445,0.00012330581,0.018732013,0.0065872245,0.62216216,0.000003939148,0.35217744],"study_design_scores_gemma":[0.00023762562,0.00012925065,0.000036015135,0.0000834597,0.0000048329634,0.000028520992,7.58524e-8,0.5154938,0.001938855,0.4808867,0.0008878765,0.000273001],"about_ca_topic_score_codex":0.0000045282163,"about_ca_topic_score_gemma":0.0000075800413,"teacher_disagreement_score":0.49676177,"about_ca_system_score_codex":0.00008728703,"about_ca_system_score_gemma":0.00036398385,"threshold_uncertainty_score":0.9999307},"labels":[],"label_agreement":null},{"id":"W2962696666","doi":"10.1002/jgt.22121","title":"Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number<sup>*</sup>","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council","keywords":"Mathematics; Combinatorics; Chromatic scale; Corollary; Tree (set theory); Path (computing); Discrete mathematics; Graph; Critical graph; Computer science; Graph power","score_opus":0.027889476077178666,"score_gpt":0.3269516811109861,"score_spread":0.2990622050338074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962696666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5229443,0.00012608706,0.46335855,0.0020662965,0.0006886054,0.0004190723,0.000015051241,0.000096790114,0.010285241],"genre_scores_gemma":[0.9582718,0.000051468418,0.039260432,0.0011453851,0.00029434133,0.000014955387,4.779225e-7,0.000055063978,0.0009060732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950475,0.00082164013,0.0011223612,0.0005276525,0.0015604689,0.0009203601],"domain_scores_gemma":[0.9941688,0.0010981138,0.001115329,0.0023921363,0.0005083516,0.00071724755],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0046186103,0.00043782123,0.00082569936,0.0004780161,0.0008970682,0.00078272785,0.005492619,0.00016462957,0.0006254351],"category_scores_gemma":[0.0012601808,0.00035760863,0.0006465845,0.0006053022,0.0005013225,0.0022339146,0.00090949977,0.0008096384,0.0010526399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006529632,0.00064101693,0.0049729994,0.00022673864,0.00063948653,0.0011547916,0.013212019,0.0002297294,0.00399123,0.8442999,0.00894498,0.12103414],"study_design_scores_gemma":[0.0015577412,0.00045050142,0.0036744939,0.00046697183,0.00006037326,0.0010842019,0.0005349929,0.0030413093,0.0028928176,0.98466,0.0010054203,0.00057114096],"about_ca_topic_score_codex":0.000008166126,"about_ca_topic_score_gemma":0.0000026481155,"teacher_disagreement_score":0.4353275,"about_ca_system_score_codex":0.00010187278,"about_ca_system_score_gemma":0.00021617163,"threshold_uncertainty_score":0.9998881},"labels":[],"label_agreement":null},{"id":"W2962698493","doi":"10.1016/j.dam.2017.06.006","title":"A coloring algorithm for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-free line graphs","year":2017,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Claw; Algorithm; Discrete mathematics; Graph","score_opus":0.02548238459607097,"score_gpt":0.2721571614832467,"score_spread":0.24667477688717573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962698493","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23331349,0.0018755869,0.09844854,0.001427956,0.004813068,0.00033485665,0.002208869,0.0007858796,0.65679175],"genre_scores_gemma":[0.90442175,0.001605259,0.0824946,0.0011996399,0.0025550486,0.0039294497,0.0015881464,0.0014319976,0.0007741277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9853034,0.00037675913,0.0028981632,0.0030075833,0.004164725,0.004249343],"domain_scores_gemma":[0.9840834,0.0033204376,0.0037122185,0.006683631,0.00037281643,0.0018274627],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004072189,0.0015347671,0.00074995443,0.00088383444,0.003791586,0.0036310323,0.007379985,0.0026106115,0.12159589],"category_scores_gemma":[0.0028825707,0.0027420868,0.002548548,0.0016731616,0.0032754447,0.0025249897,0.0065784925,0.0025791845,0.0019478434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012661284,0.00055099843,0.0000039031083,0.002537781,0.0018711686,0.0011001568,0.0031907253,0.001149525,0.0030560624,0.83373976,0.14431588,0.0072179055],"study_design_scores_gemma":[0.0032662377,0.0016805929,0.000023453516,0.0016232352,0.0013237889,0.0008063793,0.0020598276,0.2544069,0.7235786,0.0054349904,0.0035103296,0.0022856807],"about_ca_topic_score_codex":0.00049034134,"about_ca_topic_score_gemma":0.00086285855,"teacher_disagreement_score":0.82830477,"about_ca_system_score_codex":0.000035036213,"about_ca_system_score_gemma":0.0017658789,"threshold_uncertainty_score":0.9997401},"labels":[],"label_agreement":null},{"id":"W2962753143","doi":"10.48550/arxiv.math/0609756","title":"Generalization of matching extensions in graphs (II)","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Generalization; Matching (statistics); Mathematics; Computer science; Combinatorics; Statistics; Mathematical analysis","score_opus":0.048386950840380465,"score_gpt":0.3138436146869711,"score_spread":0.2654566638465906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962753143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7565474,0.00029487227,0.241916,0.00023128893,0.0002596283,0.00024194874,0.0000056778536,0.000087727094,0.0004154802],"genre_scores_gemma":[0.9719459,0.0000997011,0.027472472,0.00008120599,0.000039179853,0.0000390179,0.000030052646,0.000023862769,0.00026862998],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785274,0.00021440066,0.0004865139,0.0006812105,0.0003909891,0.0003741303],"domain_scores_gemma":[0.9981556,0.0001022559,0.00023825323,0.0012516803,0.00018358938,0.00006862863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005397087,0.00022589535,0.00034338635,0.00061524176,0.00012264721,0.00003591099,0.0013543685,0.00019172714,0.000009118606],"category_scores_gemma":[0.00007350755,0.00023049577,0.00013804191,0.00082857464,0.00010476786,0.00026164055,0.0024221456,0.00059615396,0.000012542087],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024504629,0.00046838733,0.5312214,0.0002840394,0.0000554727,0.000114793416,0.0020929468,0.14470413,0.034439202,0.27941608,0.0005904817,0.0065885824],"study_design_scores_gemma":[0.00033219927,0.000046426325,0.38788304,0.00030810147,0.000007758598,0.0000063578486,0.000018699517,0.0146004325,0.0053814803,0.5908122,0.00017319954,0.00043011026],"about_ca_topic_score_codex":0.00044295902,"about_ca_topic_score_gemma":0.00015245135,"teacher_disagreement_score":0.3113961,"about_ca_system_score_codex":0.000059744645,"about_ca_system_score_gemma":0.00010990599,"threshold_uncertainty_score":0.9399345},"labels":[],"label_agreement":null},{"id":"W2962756164","doi":"10.1016/j.ejc.2020.103210","title":"Distance-two colourings of Barnette graphs","year":2020,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Planar graph; 1-planar graph; Discrete mathematics; Cograph; Chordal graph; Graph","score_opus":0.022800464512898265,"score_gpt":0.256425006666158,"score_spread":0.2336245421532597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962756164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17423797,0.0011139116,0.80899495,0.0026425042,0.00075590797,0.00012976513,0.0000021265391,0.000065346256,0.012057534],"genre_scores_gemma":[0.99442255,0.00007696878,0.005132008,0.00023486381,0.00005355825,2.1008722e-7,1.503785e-7,0.000021469572,0.00005821393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775857,0.00056175666,0.0005835461,0.00018073517,0.0006599266,0.0002554593],"domain_scores_gemma":[0.9981547,0.00015942234,0.000570922,0.00033075767,0.00046562462,0.00031856145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012612676,0.00013416538,0.00029476944,0.00015809033,0.00006949536,0.0000611509,0.0020100847,0.000012643565,0.000008689074],"category_scores_gemma":[0.00029797285,0.00011992631,0.00016644406,0.0010652079,0.00012253155,0.00046884784,0.00034666766,0.00046474385,0.000020182206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009326585,0.000115105926,0.0020166833,0.00004242186,0.00005129346,0.0008009835,0.0010345072,0.0003452785,0.0021268635,0.98617405,0.002107465,0.0050920607],"study_design_scores_gemma":[0.01163698,0.008257945,0.012028602,0.00038924324,0.00007235715,0.00054913055,0.00030746774,0.0056447336,0.031740796,0.7942617,0.13390395,0.0012070854],"about_ca_topic_score_codex":2.0646665e-7,"about_ca_topic_score_gemma":4.338183e-8,"teacher_disagreement_score":0.8201846,"about_ca_system_score_codex":0.000027200205,"about_ca_system_score_gemma":0.00006627778,"threshold_uncertainty_score":0.4890453},"labels":[],"label_agreement":null},{"id":"W2962798202","doi":"10.1016/j.ejc.2014.08.032","title":"Beyond Ohba’s Conjecture: A bound on the choice number of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-chromatic graphs with<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math>vertices","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University; McGill University","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Conjecture; Mathematics; Upper and lower bounds; Graph; Mathematical analysis","score_opus":0.01633513048850506,"score_gpt":0.2519756485367961,"score_spread":0.23564051804829106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962798202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98214465,0.000995422,0.0067352257,0.0008635826,0.002767367,0.00021738035,0.00010651693,0.0002892178,0.005880659],"genre_scores_gemma":[0.9917226,0.00064231764,0.00413071,0.0015436918,0.0009847953,0.00012862691,0.00008808215,0.00057186454,0.0001873564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9879317,0.0013847052,0.002682868,0.0016990713,0.0040680584,0.0022335588],"domain_scores_gemma":[0.98764545,0.0035195488,0.0036351557,0.0034471552,0.00060816965,0.0011445003],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.005457116,0.0013811724,0.0010161027,0.0005826704,0.0019192337,0.0017524374,0.004939283,0.0007422722,0.000081805505],"category_scores_gemma":[0.0022923646,0.0013573881,0.0015876065,0.0019328935,0.001678448,0.0024232187,0.0021716931,0.00307834,0.0014723944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010510272,0.00087290554,0.00009158176,0.00072134775,0.0010785293,0.0016041764,0.001966154,0.0023669302,0.0012585262,0.986557,0.0013003158,0.0011314806],"study_design_scores_gemma":[0.0044505806,0.0042283833,0.0005518569,0.0018452579,0.0008706053,0.0029531866,0.0006520213,0.95334566,0.0068269335,0.01498053,0.007703519,0.0015914479],"about_ca_topic_score_codex":0.00011986152,"about_ca_topic_score_gemma":0.00007941208,"teacher_disagreement_score":0.9715765,"about_ca_system_score_codex":0.00008560108,"about_ca_system_score_gemma":0.0011154413,"threshold_uncertainty_score":0.9998939},"labels":[],"label_agreement":null},{"id":"W2962803950","doi":"10.1016/j.disc.2018.09.025","title":"DP-3-coloring of some planar graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Sanitarium Association","keywords":"Mathematics; Combinatorics; Planar graph; Planar; List coloring; Edge coloring; Discrete mathematics; Graph coloring; Graph; Computer science; Line graph; Graph power","score_opus":0.03146660688058853,"score_gpt":0.3079936122252469,"score_spread":0.27652700534465835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962803950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15996172,0.000111090834,0.82435143,0.0002269286,0.0002536491,0.0003196922,0.000010443665,0.00020760456,0.014557438],"genre_scores_gemma":[0.7568049,0.000013171465,0.24276535,0.00005478466,0.000060715647,0.000015869218,0.0000013712166,0.000020173085,0.00026365655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987042,0.000037522244,0.0002984477,0.00023506748,0.00039563427,0.00032914788],"domain_scores_gemma":[0.99864316,0.00019150037,0.00013779287,0.0008271897,0.0001106064,0.00008975816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000439743,0.00012755292,0.00021942152,0.00017926146,0.000105048195,0.000047193113,0.0011189586,0.00004447565,0.000019752075],"category_scores_gemma":[0.00012476716,0.00010593182,0.00008392702,0.000479984,0.00028128817,0.00042656707,0.00025499746,0.00010904323,0.000088935936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040770906,0.00003410072,0.0000667764,0.00006745028,0.000018797367,0.000004239568,0.0015917942,0.000003920973,0.003510334,0.9937249,0.00006984774,0.00090377044],"study_design_scores_gemma":[0.0001642826,0.00015159647,0.00010618907,0.00005963454,0.0000049553564,0.000008509214,0.00016348912,0.01095348,0.02915484,0.95886284,0.00022877265,0.00014141372],"about_ca_topic_score_codex":0.0000022143422,"about_ca_topic_score_gemma":0.0000017265501,"teacher_disagreement_score":0.5968432,"about_ca_system_score_codex":0.000015085101,"about_ca_system_score_gemma":0.00002668996,"threshold_uncertainty_score":0.4319774},"labels":[],"label_agreement":null},{"id":"W2962836387","doi":"10.20382/jocg.v4i1a8","title":"Network farthest-point diagrams","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Point (geometry); Combinatorics; Geometry","score_opus":0.012509513563585475,"score_gpt":0.22090020614609818,"score_spread":0.2083906925825127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962836387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10057445,0.00012793679,0.8945165,0.0015637656,0.00032479974,0.00012961224,0.0000012735564,0.00004133288,0.0027203027],"genre_scores_gemma":[0.8810544,0.000026925623,0.11733043,0.00039465292,0.000218296,2.3968778e-7,0.0000019848565,0.0000113904725,0.00096167094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822533,0.00020021986,0.0003201003,0.00020703263,0.00069088524,0.00035645074],"domain_scores_gemma":[0.99747723,0.00066983467,0.00036914131,0.0002361305,0.0009724533,0.000275222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046412268,0.00014557148,0.00025627945,0.0009543239,0.00016786135,0.00015169372,0.0012875773,0.00006345377,0.00012029891],"category_scores_gemma":[0.000091337606,0.00014056398,0.00019381668,0.0023027223,0.000115732946,0.0017566138,0.00030005473,0.00037261532,0.00012351334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056965553,0.00016437242,0.004815128,0.000014861379,0.00016263808,0.00034121072,0.00020548495,0.5422246,0.00012654449,0.40993932,0.006435083,0.035513803],"study_design_scores_gemma":[0.0021483675,0.0008598766,0.042669043,0.000096914475,0.0000311811,0.0004971048,0.00035515588,0.045860916,0.00014984465,0.8690964,0.037658725,0.00057644874],"about_ca_topic_score_codex":0.0000065578515,"about_ca_topic_score_gemma":7.492534e-7,"teacher_disagreement_score":0.78047997,"about_ca_system_score_codex":0.00015219674,"about_ca_system_score_gemma":0.00017908223,"threshold_uncertainty_score":0.57320327},"labels":[],"label_agreement":null},{"id":"W2962878651","doi":"10.1002/jgt.22178","title":"Packing odd<i>T</i>‐joins with at most two terminals","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research Global; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Joins; Mathematics; Bipartite graph; Cardinality (data modeling); Conjecture; Eulerian path; Disjoint sets; Graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.02431626381934828,"score_gpt":0.3199633436365374,"score_spread":0.29564707981718913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962878651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59585816,0.0009404892,0.3895082,0.0011630089,0.00071259664,0.00024709603,0.0000057415614,0.00006745981,0.011497243],"genre_scores_gemma":[0.98387784,0.00009607301,0.014564877,0.00022636063,0.0001776575,0.0000034625198,2.2727872e-7,0.000027170114,0.0010263076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763346,0.00034311748,0.00043689623,0.0002949418,0.0007798874,0.00051170425],"domain_scores_gemma":[0.99630183,0.00044472102,0.0010724874,0.0014713805,0.00041786346,0.00029170595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029815985,0.00022388398,0.00038977808,0.00044715812,0.0010898258,0.00044191582,0.0032052472,0.000054303466,0.000047025245],"category_scores_gemma":[0.00032889706,0.00015506975,0.00021557315,0.0002955861,0.0006212936,0.0018258238,0.0006362885,0.0005141857,0.000022288856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009842898,0.00019133648,0.023313617,0.000037039285,0.00027105966,0.0019872165,0.0012525796,0.00018649896,0.015491526,0.8765359,0.00078993716,0.07895902],"study_design_scores_gemma":[0.0026288074,0.000966351,0.0155611755,0.00038585954,0.000047485286,0.0028625727,0.00016666656,0.0002510843,0.022205004,0.9514586,0.0029778432,0.00048856717],"about_ca_topic_score_codex":0.0000034559014,"about_ca_topic_score_gemma":0.000019728894,"teacher_disagreement_score":0.38801968,"about_ca_system_score_codex":0.00007006035,"about_ca_system_score_gemma":0.00013733607,"threshold_uncertainty_score":0.8382169},"labels":[],"label_agreement":null},{"id":"W2962975014","doi":"","title":"The bondage number of $(n-3)$-regular graphs of order $n$","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Domination analysis; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.018970910859867244,"score_gpt":0.2758323996745476,"score_spread":0.25686148881468035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962975014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96725774,0.00037794863,0.006988775,0.00012046054,0.0013198768,0.000344589,0.000003230944,0.00009616662,0.023491215],"genre_scores_gemma":[0.99151796,0.000035707013,0.008089669,0.00001440603,0.0000012166228,0.000011563169,3.5914732e-7,0.000012096405,0.00031699447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856734,0.00015873385,0.00029597673,0.0002371456,0.00042532498,0.00031548232],"domain_scores_gemma":[0.9979962,0.0002586584,0.00016273362,0.0011490909,0.00035831713,0.000074979434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006979882,0.0001170595,0.00019111575,0.00007127151,0.00012724598,0.000017154718,0.0016670212,0.00005426199,0.000033796838],"category_scores_gemma":[0.00012580006,0.00008563873,0.00009575698,0.0009951177,0.00042019013,0.00027233653,0.00041000868,0.00015620377,0.00002727715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001911695,0.00009566226,0.004915414,0.000010355327,0.000029131681,0.0000041653466,0.000564458,5.834255e-7,0.0009236178,0.9908567,0.00021505984,0.0023657354],"study_design_scores_gemma":[0.00035688217,0.000079366146,0.0036858504,0.000011934394,0.0000037272655,0.0000045362426,0.000050465795,0.00012350993,0.034567174,0.96041685,0.00060884556,0.0000908756],"about_ca_topic_score_codex":0.000032728127,"about_ca_topic_score_gemma":0.0000025180348,"teacher_disagreement_score":0.03364356,"about_ca_system_score_codex":0.0000115830835,"about_ca_system_score_gemma":0.000055799872,"threshold_uncertainty_score":0.3492246},"labels":[],"label_agreement":null},{"id":"W2962977310","doi":"","title":"Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Indecomposable module; Combinatorics; Cardinality (data modeling); Mathematics; Vertex (graph theory); Discrete mathematics; Interval (graph theory); Graph; Computer science","score_opus":0.013287051937384477,"score_gpt":0.2556531109342326,"score_spread":0.24236605899684813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962977310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99503905,0.00032609003,0.0005112433,0.0007199364,0.0005758632,0.00040018192,0.0000014905085,0.00009391576,0.0023322552],"genre_scores_gemma":[0.997667,0.00011356961,0.0014762288,0.00038525296,0.000006102851,0.00004133609,0.0000012945426,0.000020484757,0.00028870424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814683,0.00015231036,0.00025577683,0.00052807265,0.00034219195,0.0005747961],"domain_scores_gemma":[0.99852604,0.0002891971,0.00010411118,0.00061500084,0.00011079165,0.00035488978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040672184,0.00025091803,0.0002668257,0.00020877154,0.00031867082,0.00052312866,0.00078330503,0.000086796616,0.000045969005],"category_scores_gemma":[0.00005753583,0.00020694982,0.000036958692,0.0003647935,0.00013271798,0.0013145397,0.000648071,0.00036582476,0.00012350889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054712604,0.00055859657,0.057638384,0.00004802612,0.00014793914,0.000028571296,0.0014165827,0.00003344067,0.005293949,0.88275474,0.003059641,0.04896543],"study_design_scores_gemma":[0.001636235,0.0004156672,0.019518135,0.00005744102,0.0000030097053,0.000024847837,0.00009204621,0.0070124627,0.004713493,0.9653414,0.00088290224,0.00030235297],"about_ca_topic_score_codex":0.000045245848,"about_ca_topic_score_gemma":0.0000018807121,"teacher_disagreement_score":0.08258668,"about_ca_system_score_codex":0.00008013948,"about_ca_system_score_gemma":0.00003719528,"threshold_uncertainty_score":0.84391683},"labels":[],"label_agreement":null},{"id":"W2963022083","doi":"10.1017/apr.2016.31","title":"","year":2016,"lang":"en","type":"article","venue":"RECERCAT (Consorci de Serveis Universitaris de Catalunya)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Random geometric graph; Mathematics; Euclidean geometry; Random graph; Upper and lower bounds; Graph; Euclidean distance; Geometric graph theory; Spatial network; Discrete mathematics; Random regular graph; Geometric networks; Graph theory; Line graph; Graph power; Geometry; Voltage graph; 1-planar graph; Mathematical analysis","score_opus":0.016188268506788322,"score_gpt":0.24610032284153385,"score_spread":0.22991205433474554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963022083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51555836,0.0003429352,0.46805945,0.013279634,0.00016640674,0.00047380195,0.00005209179,0.00081773533,0.0012495725],"genre_scores_gemma":[0.9499765,0.00071960175,0.04569798,0.00079926837,0.00009284056,0.00003154128,0.0000136078,0.00007491707,0.0025937448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926272,0.0011429603,0.0005889472,0.0018851891,0.00095753215,0.0027981692],"domain_scores_gemma":[0.9924494,0.0017393912,0.00030178495,0.0033270197,0.00063755456,0.0015448624],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023951093,0.00071048253,0.0006857766,0.001580393,0.0009462893,0.00030419213,0.006925036,0.00046211164,0.000100263394],"category_scores_gemma":[0.00068596564,0.00062199804,0.0004800733,0.0035233374,0.0007836708,0.005684535,0.0024445907,0.0007111776,0.00019402067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078954746,0.0005140445,0.14505918,0.00012432385,0.0005108748,0.0019109496,0.005350911,0.00067162083,0.12698905,0.59202516,0.0021052258,0.12394908],"study_design_scores_gemma":[0.01898992,0.002321809,0.15280627,0.000967705,0.0002707106,0.0029896,0.005097125,0.0111265555,0.36019525,0.3737315,0.06508328,0.0064202747],"about_ca_topic_score_codex":0.00053676876,"about_ca_topic_score_gemma":0.0002979219,"teacher_disagreement_score":0.4344181,"about_ca_system_score_codex":0.0030187012,"about_ca_system_score_gemma":0.0010725991,"threshold_uncertainty_score":0.9996231},"labels":[],"label_agreement":null},{"id":"W2963103124","doi":"","title":"A Novel Branching Strategy for Parameterized Graph Modification Problems","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Parameterized complexity; Bounded function; Combinatorics; Branching (polymer chemistry); Vertex (graph theory); Mathematics; Discrete mathematics; Computer science; Graph; Theoretical computer science","score_opus":0.11452514852917399,"score_gpt":0.35951069664494845,"score_spread":0.24498554811577444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963103124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006862771,0.000068531575,0.9885053,0.0004213683,0.0005194123,0.0022039998,0.000035041474,0.00043926583,0.00094428594],"genre_scores_gemma":[0.352799,0.000022051878,0.64533687,0.00008977028,0.00007290455,0.0012295931,0.000050064846,0.00003483762,0.00036489576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973036,0.000077058394,0.00045674015,0.0011932604,0.00040671276,0.0005626213],"domain_scores_gemma":[0.9970096,0.00035456318,0.00027831926,0.0018801548,0.00031715052,0.00016022657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010638207,0.00034128124,0.00038544563,0.00037633727,0.00018925058,0.00064529787,0.0026660985,0.00040167748,0.00001169847],"category_scores_gemma":[0.00014741566,0.0003075376,0.00026641652,0.00034530275,0.00011834577,0.00045392028,0.0010867218,0.001154984,0.000010865826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000395586,0.00020495568,0.0000074719346,0.0003063153,0.00006970723,8.364171e-7,0.00039375047,0.030721704,0.19147818,0.7220048,0.00007345254,0.0546993],"study_design_scores_gemma":[0.0005530436,0.00006851367,0.00008097536,0.000037739566,0.000006347388,0.0000060958423,0.000007115029,0.2672645,0.0047238613,0.726498,0.000381801,0.0003719872],"about_ca_topic_score_codex":0.000073296535,"about_ca_topic_score_gemma":0.00003095103,"teacher_disagreement_score":0.3459362,"about_ca_system_score_codex":0.000035246896,"about_ca_system_score_gemma":0.00017923788,"threshold_uncertainty_score":0.99993765},"labels":[],"label_agreement":null},{"id":"W2963127852","doi":"10.1002/jgt.22157","title":"Completing orientations of partially oriented graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Danmarks Frie Forskningsfond; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.033180651212065586,"score_gpt":0.3333721953777207,"score_spread":0.30019154416565513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963127852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2563466,0.00025805217,0.73959184,0.00041977072,0.0007861626,0.00012272579,0.0000055874198,0.00002486849,0.002444361],"genre_scores_gemma":[0.97014254,0.00005699541,0.029611986,0.00005019052,0.000052199113,0.0000022618044,4.0208266e-7,0.0000113027945,0.00007210184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978672,0.00038344105,0.00064379233,0.00018279628,0.00061760563,0.00030513664],"domain_scores_gemma":[0.99616647,0.0005399762,0.0013781539,0.0009594948,0.0007839891,0.00017191932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002967456,0.00013232359,0.00032637033,0.0005177802,0.00057608,0.00012613412,0.002289536,0.000046232293,0.000029917135],"category_scores_gemma":[0.0010339448,0.00010917975,0.00030206313,0.00040027485,0.0005907413,0.0010869979,0.00030960346,0.00033440904,0.0000049481077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001238832,0.000098914024,0.0066613564,0.000013020761,0.00008636508,0.000042037573,0.0005878382,0.00010399481,0.0049817734,0.97938174,0.00008722381,0.007831828],"study_design_scores_gemma":[0.00086296466,0.00031532848,0.01781965,0.00009593873,0.000021990041,0.00008757507,0.0002585957,0.0002339257,0.0073956945,0.9720987,0.00067501015,0.00013461732],"about_ca_topic_score_codex":0.000003571894,"about_ca_topic_score_gemma":0.0000044553904,"teacher_disagreement_score":0.71379596,"about_ca_system_score_codex":0.000017636843,"about_ca_system_score_gemma":0.00011302391,"threshold_uncertainty_score":0.4452221},"labels":[],"label_agreement":null},{"id":"W2963179392","doi":"10.23638/lmcs-13(1:1)2017","title":"Logical compactness and constraint satisfaction problems","year":2017,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compact space; Constraint satisfaction problem; Computer science; Constraint satisfaction; Constraint (computer-aided design); Constraint satisfaction dual problem; Constraint logic programming; Local consistency; Theoretical computer science; Arithmetic; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.3609906485317839,"score_gpt":0.5772651838492405,"score_spread":0.2162745353174566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963179392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87468815,0.0042224852,0.11156213,0.0007931614,0.0006503083,0.00086442835,0.000021737724,0.00009058813,0.007107029],"genre_scores_gemma":[0.9949695,0.0022947094,0.0024434307,0.000090947404,0.000063248815,0.00002599956,0.0000011346169,0.00001851996,0.00009252008],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9973363,0.0003192706,0.00054276135,0.0005818229,0.00074679404,0.00047302878],"domain_scores_gemma":[0.99692714,0.00040330822,0.00082232215,0.0011374244,0.00032089907,0.00038888512],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018934251,0.000262603,0.00059131003,0.00045958796,0.0009792213,0.0050923484,0.005457711,0.0001004098,0.0010499908],"category_scores_gemma":[0.00049502944,0.0002194415,0.00010501447,0.00035146397,0.00079645455,0.0063668457,0.0029298982,0.0005312863,0.000012804299],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009197572,0.00014291372,0.73328865,0.0000705706,0.0001103054,0.00008320565,0.00020408627,0.00026965316,0.05324648,0.025532952,0.0016582379,0.18530095],"study_design_scores_gemma":[0.00046702105,0.000016206648,0.8304887,0.00018380038,0.000009271949,0.00006898538,0.000021241054,0.001022439,0.00467316,0.16189961,0.000871707,0.00027790037],"about_ca_topic_score_codex":0.00042112518,"about_ca_topic_score_gemma":0.000061737155,"teacher_disagreement_score":0.18502304,"about_ca_system_score_codex":0.000065121385,"about_ca_system_score_gemma":0.00011260751,"threshold_uncertainty_score":0.9999232},"labels":[],"label_agreement":null},{"id":"W2963191201","doi":"10.1016/j.dam.2017.02.027","title":"End-vertices of LBFS of (AT-free) bigraphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02677701066082994,"score_gpt":0.30300987381633354,"score_spread":0.2762328631555036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963191201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2494672,0.00024080234,0.62059957,0.00035722484,0.00014597327,0.00081126386,0.000059931845,0.00014557678,0.12817246],"genre_scores_gemma":[0.79403704,0.000033715223,0.2056082,0.000011087245,0.000012335385,0.000024503463,0.0000015258026,0.000016794136,0.00025480866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998335,0.000016917289,0.0004499827,0.0002916758,0.00059224543,0.0003141996],"domain_scores_gemma":[0.9954354,0.00028147112,0.0006368825,0.003454752,0.00009714315,0.00009434731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005111265,0.00016872554,0.00038561315,0.00014095451,0.00025182663,0.00006678039,0.0038730402,0.00006467247,0.000036139707],"category_scores_gemma":[0.00023477622,0.0001395066,0.00012286525,0.00017987496,0.00054737565,0.0002733632,0.001836472,0.000112376874,0.000021571921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011220842,0.000077501536,0.00009755932,0.00027955763,0.000039869858,0.000002236642,0.0013031104,0.000013042621,0.05102704,0.9442997,0.00006288441,0.0027862864],"study_design_scores_gemma":[0.00049628416,0.000055935012,0.0004509087,0.00006250469,0.000016469661,0.0000032379971,0.00015639896,0.0031313584,0.23834439,0.75696,0.0001451536,0.000177376],"about_ca_topic_score_codex":0.0000067508863,"about_ca_topic_score_gemma":0.000008283649,"teacher_disagreement_score":0.54456985,"about_ca_system_score_codex":0.00001519607,"about_ca_system_score_gemma":0.00003248976,"threshold_uncertainty_score":0.7197137},"labels":[],"label_agreement":null},{"id":"W2963231024","doi":"10.1007/978-3-030-26176-4_18","title":"Imbalance, Cutwidth, and the Structure of Optimal Orderings","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Chordal graph; Interval (graph theory); Interval graph; Combinatorics; Computer science; Pathwidth; Graph; Time complexity; Mathematics; Discrete mathematics; 1-planar graph; Line graph","score_opus":0.008855433772985706,"score_gpt":0.2493822870509093,"score_spread":0.2405268532779236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963231024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012308621,0.00088986766,0.9948867,0.0005230543,0.00065928657,0.000559884,0.000009160294,0.000053117044,0.0011880758],"genre_scores_gemma":[0.6891348,0.00018048467,0.30905303,0.0007768484,0.00019491374,0.0000031324998,0.0000023523517,0.000044987988,0.0006094731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966804,0.00006195724,0.00042874337,0.0012025743,0.0010343587,0.0005920132],"domain_scores_gemma":[0.99675316,0.00088942674,0.0003077419,0.0016678026,0.0002745646,0.00010727895],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008390818,0.00043174913,0.00065450673,0.0005704654,0.00018279743,0.00027318075,0.004097953,0.00023189846,0.000017172011],"category_scores_gemma":[0.00013454187,0.0002900315,0.00011095861,0.0006771187,0.0031138435,0.0004995218,0.0025383453,0.0010139917,0.0000073879773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008864811,0.000013959249,0.000146072,0.00013727124,0.000033876,0.000031291227,0.0015532513,0.064068325,0.0016424971,0.60381144,0.0000093477565,0.328464],"study_design_scores_gemma":[0.0011116964,0.00019417026,0.00017981256,0.00028762943,0.00000832366,0.00013795069,4.463218e-7,0.3140476,0.0043968833,0.6783215,0.0007479872,0.0005660206],"about_ca_topic_score_codex":0.00001284407,"about_ca_topic_score_gemma":0.000017319835,"teacher_disagreement_score":0.6879039,"about_ca_system_score_codex":0.00007395571,"about_ca_system_score_gemma":0.0004140073,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W2963269633","doi":"10.1002/jgt.22929","title":"A new graph parameter to measure linearity","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Discrete mathematics; Interval graph; Pathwidth; Lexicographical order; Cograph; Split graph; Vertex (graph theory); Conjecture; Maximal independent set; Graph; 1-planar graph; Line graph","score_opus":0.0419654132220377,"score_gpt":0.3163577701094336,"score_spread":0.27439235688739594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963269633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0507373,0.00044881325,0.9447865,0.0020790123,0.0009942009,0.0001986372,0.0000027495157,0.00015972588,0.0005930442],"genre_scores_gemma":[0.78762394,0.00024197911,0.2065655,0.0019127047,0.0007057622,0.000014877612,0.0000011459201,0.00008054392,0.0028535728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970373,0.0005687485,0.0005212511,0.0003115148,0.0009923874,0.00056880485],"domain_scores_gemma":[0.9969821,0.0009957748,0.00024114357,0.000744571,0.00041650145,0.000619901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047656754,0.00020192961,0.00036775062,0.0015902865,0.00016203517,0.00016892266,0.0021160727,0.00009403322,0.000043290987],"category_scores_gemma":[0.0011299053,0.00016046896,0.00043434647,0.0038791597,0.000099662815,0.0007057018,0.000364511,0.0006544008,0.00017693276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006592315,0.000119620636,0.0012443241,0.000026301288,0.00028451756,0.0005258242,0.002165152,0.0010298599,0.0067705554,0.73089886,0.023675393,0.23260035],"study_design_scores_gemma":[0.0005406317,0.00041453727,0.0027075878,0.00006913074,0.000013618547,0.00013933632,0.00009125128,0.00014127741,0.0023128511,0.9895991,0.0037651411,0.00020550132],"about_ca_topic_score_codex":0.0000034786572,"about_ca_topic_score_gemma":0.0000035382088,"teacher_disagreement_score":0.73822105,"about_ca_system_score_codex":0.000034223787,"about_ca_system_score_gemma":0.00020398841,"threshold_uncertainty_score":0.65437347},"labels":[],"label_agreement":null},{"id":"W2963276582","doi":"10.5539/jmr.v1n1p3","title":"Nathanson Heights and the CSS Conjecture for Cayley Graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chulalongkorn University","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Cayley graph; Directed graph; Graph; Undirected graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics","score_opus":0.06833315361679113,"score_gpt":0.3993732351629574,"score_spread":0.33104008154616626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963276582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13357015,0.004719493,0.83275783,0.024761504,0.00023904121,0.0015929275,0.0000047648464,0.00003908821,0.0023152195],"genre_scores_gemma":[0.87455213,0.0005513451,0.12412927,0.00014554049,0.00013572234,0.00001612534,2.088596e-7,0.00001622863,0.00045342196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971936,0.00039375373,0.00044279743,0.00017930545,0.0013131958,0.0004773697],"domain_scores_gemma":[0.9946256,0.0035536336,0.00020765711,0.0005098377,0.0009272143,0.00017600569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009549537,0.00012116669,0.00033859606,0.00047302502,0.0003685037,0.0002978784,0.0016422209,0.00007486944,0.000005340573],"category_scores_gemma":[0.0012767486,0.000064735046,0.00015987888,0.0006310224,0.0003980625,0.00036414264,0.00016798596,0.0007967132,0.000003837921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011381229,0.000113186565,0.000005846449,0.000059742873,0.000036171845,0.000028725342,0.0025764252,0.000020510211,0.0009977473,0.9870219,0.0011389335,0.007886963],"study_design_scores_gemma":[0.0016168233,0.00055792375,0.000044536824,0.00008328294,0.0000057749735,0.00026405946,0.00031881657,0.00762063,0.002630925,0.9854671,0.0013140354,0.000076125085],"about_ca_topic_score_codex":0.0000013605645,"about_ca_topic_score_gemma":0.000002545455,"teacher_disagreement_score":0.740982,"about_ca_system_score_codex":0.000041623993,"about_ca_system_score_gemma":0.00013660928,"threshold_uncertainty_score":0.3461367},"labels":[],"label_agreement":null},{"id":"W2963285256","doi":"10.1016/j.disc.2018.09.006","title":"Connected <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e220\" altimg=\"si33.gif\"><mml:mi>k</mml:mi></mml:math>-dominating graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Integer (computer science); Dominating set; Cardinality (data modeling); Discrete mathematics; Database; Computer science","score_opus":0.020859113087897004,"score_gpt":0.276190103456706,"score_spread":0.255330990368809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963285256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9001754,0.00013990415,0.093395784,0.00025995777,0.0005724365,0.0001768569,0.00008198223,0.0003946285,0.0048030317],"genre_scores_gemma":[0.9190722,0.00006473314,0.07951251,0.00036067012,0.0003322817,0.00020236007,0.00007748162,0.00016968351,0.00020807903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529904,0.00017629149,0.000974117,0.0009649747,0.0013550352,0.0012305407],"domain_scores_gemma":[0.99525905,0.0012899007,0.00075102143,0.0020596941,0.0002429487,0.00039738973],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014904055,0.00054248597,0.0004343824,0.00028188125,0.000906387,0.00067003805,0.0021334165,0.0003986363,0.00006503583],"category_scores_gemma":[0.0014222,0.0005721317,0.0004738703,0.0010262071,0.00086221425,0.0010127828,0.0015127274,0.00068703794,0.0012567671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007471704,0.00015324014,0.000012736885,0.00036401232,0.00017545107,0.000135123,0.0030467906,0.00009575889,0.0024237495,0.9920943,0.00026315614,0.0011609832],"study_design_scores_gemma":[0.00075388764,0.0004678741,0.00002784998,0.00043515174,0.00008507914,0.00019637201,0.0008230976,0.9220824,0.0113688465,0.06251595,0.00067840243,0.00056507165],"about_ca_topic_score_codex":0.000042161522,"about_ca_topic_score_gemma":0.000056596436,"teacher_disagreement_score":0.9295783,"about_ca_system_score_codex":0.000029493764,"about_ca_system_score_gemma":0.00023224285,"threshold_uncertainty_score":0.999673},"labels":[],"label_agreement":null},{"id":"W2963324144","doi":"10.23638/dmtcs-21-3-1","title":"Binding Number, Toughness and General Matching Extendability in Graphs","year":2019,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matching (statistics); Mathematics; Combinatorics; Toughness; Computer science; Materials science; Composite material; Statistics","score_opus":0.15719541194761466,"score_gpt":0.538923214151161,"score_spread":0.3817278022035463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963324144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98685235,0.002389313,0.0072334358,0.00011286276,0.0005252054,0.0005669993,0.0000099814815,0.000049264643,0.002260589],"genre_scores_gemma":[0.9925726,0.0017744574,0.005169194,0.000103797414,0.00003937722,0.000029824147,0.000002057369,0.000033108732,0.00027560003],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99625427,0.00062947214,0.0007737345,0.0008428511,0.00083693594,0.0006627616],"domain_scores_gemma":[0.9974585,0.0006506988,0.00044166954,0.0009642962,0.00019567346,0.000289135],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034439801,0.00031194746,0.00071996247,0.0010135521,0.00022690059,0.0017278837,0.0050629303,0.00010251969,0.0015109571],"category_scores_gemma":[0.00018968378,0.00028885863,0.00013914135,0.0022474586,0.00018186013,0.006530996,0.0032559633,0.00067192805,0.000032319833],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000904282,0.00015205125,0.8933327,0.00010145631,0.000041211686,0.00005017299,0.00039195013,0.00037282094,0.06351482,0.015156509,0.00025194834,0.026543926],"study_design_scores_gemma":[0.00065627135,0.000009458235,0.62065923,0.00026901806,0.0000059729127,0.00004162096,0.00007473633,0.0010863956,0.009385025,0.36696053,0.000408234,0.0004435041],"about_ca_topic_score_codex":0.0005606353,"about_ca_topic_score_gemma":0.00005023519,"teacher_disagreement_score":0.35180402,"about_ca_system_score_codex":0.00011570373,"about_ca_system_score_gemma":0.000116942836,"threshold_uncertainty_score":0.99995637},"labels":[],"label_agreement":null},{"id":"W2963356118","doi":"10.2298/fil1601169a","title":"On the domination polynomials of friendship graphs","year":2016,"lang":"en","type":"article","venue":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Limiting; Friendship graph; Voltage graph; Line graph","score_opus":0.014640895675848038,"score_gpt":0.24170945655783918,"score_spread":0.22706856088199115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963356118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86691344,0.00021786122,0.0065222583,0.0025130252,0.0010087297,0.00077873166,0.000196378,0.00026965956,0.12157989],"genre_scores_gemma":[0.99289,0.000012318371,0.0005624884,0.00015429906,0.00010398024,0.000041375697,0.000020760359,0.000037181217,0.006177619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960738,0.0002824404,0.0008639103,0.00067815336,0.001704162,0.00039752523],"domain_scores_gemma":[0.99544764,0.002552168,0.00059873395,0.0008217976,0.0004275973,0.00015208608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006210102,0.00029093103,0.00036098776,0.00060632906,0.00024408556,0.00045732426,0.0019750574,0.0001319835,0.0000850483],"category_scores_gemma":[0.00051943713,0.00020259232,0.0003433444,0.0010722594,0.00050291687,0.0069945618,0.0005117785,0.00020714886,0.00006499234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021904612,0.00028608847,0.0041091796,0.000061942636,0.00013745562,0.000022054273,0.00023099527,0.000047293826,0.054248482,0.93312705,0.0030358916,0.0044745356],"study_design_scores_gemma":[0.0006274932,0.0002403678,0.029332567,0.00024625025,0.000009304962,0.00003055194,0.000059029786,0.00016013211,0.41661304,0.5515205,0.0008223003,0.00033843244],"about_ca_topic_score_codex":0.0000042526585,"about_ca_topic_score_gemma":7.444478e-7,"teacher_disagreement_score":0.3816065,"about_ca_system_score_codex":0.00006310719,"about_ca_system_score_gemma":0.00031001127,"threshold_uncertainty_score":0.8261475},"labels":[],"label_agreement":null},{"id":"W2963436343","doi":"10.2298/aadm151109021k","title":"Protecting a graph with mobile guards","year":2016,"lang":"en","type":"article","venue":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Dominating set; Theoretical computer science; Discrete mathematics; Computer science; Computer security","score_opus":0.009525591607780442,"score_gpt":0.2344880124442836,"score_spread":0.22496242083650317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963436343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84480804,0.00048970984,0.05949846,0.00070876,0.00082830625,0.0020635074,0.00014989967,0.0012563481,0.09019697],"genre_scores_gemma":[0.97968274,0.000009580501,0.0054512075,0.00007256574,0.00019183208,0.00021479947,0.000019708354,0.000069746115,0.014287821],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9955165,0.00020448538,0.00074207754,0.0010399785,0.0018797088,0.0006172903],"domain_scores_gemma":[0.99726695,0.00067689165,0.00045350735,0.00081641326,0.00052012625,0.00026612537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004393994,0.0003887338,0.00040978286,0.0006349625,0.00041145438,0.0009742227,0.001762732,0.0001412428,0.000052272793],"category_scores_gemma":[0.0001602256,0.00029910967,0.00026984527,0.001447887,0.00043190105,0.0132057825,0.00069592416,0.00034994903,0.000072124036],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027516624,0.0035658677,0.13753653,0.0016997155,0.0025079823,0.0023414462,0.0043197908,0.0027006818,0.39846516,0.30686483,0.009635773,0.12761056],"study_design_scores_gemma":[0.0033951781,0.0019356245,0.04327162,0.0015344087,0.000040189232,0.0012195875,0.00044336147,0.0008503542,0.6941209,0.24181047,0.009097726,0.0022805731],"about_ca_topic_score_codex":0.0000065418794,"about_ca_topic_score_gemma":0.0000016285941,"teacher_disagreement_score":0.29565576,"about_ca_system_score_codex":0.00008709639,"about_ca_system_score_gemma":0.0005368089,"threshold_uncertainty_score":0.9999461},"labels":[],"label_agreement":null},{"id":"W2963481734","doi":"10.1016/j.laa.2015.03.011","title":"On the complexity of the positive semidefinite zero forcing number","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chordal graph; Combinatorics; Positive-definite matrix; Forcing (mathematics); Zero (linguistics); Discrete mathematics; Graph; Clique problem; 1-planar graph; Mathematical analysis","score_opus":0.06431228310804556,"score_gpt":0.3106601391448648,"score_spread":0.24634785603681925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963481734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16066559,0.00018637638,0.8048579,0.012269631,0.00006792395,0.0013033218,0.000057740115,0.0000898815,0.020501612],"genre_scores_gemma":[0.99588203,0.000007857985,0.0032409139,0.0005087904,0.000021570775,0.00007248601,0.0000021157557,0.000005755315,0.00025848256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992822,0.00008355812,0.00011764254,0.0001794537,0.00020361655,0.00013357293],"domain_scores_gemma":[0.9988314,0.00037947786,0.000063463594,0.00051184214,0.00014929986,0.00006454611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027491245,0.000069649475,0.000077016724,0.000020555723,0.00023869917,0.0000292385,0.0006019773,0.000024959838,0.000006415031],"category_scores_gemma":[0.00009403718,0.000039613842,0.000035165773,0.0004451368,0.00024221314,0.00010355612,0.00029075405,0.00015019272,0.00005702389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032142482,0.000022058553,0.00009675633,0.0000024188676,0.0000059615877,6.746114e-8,0.0003132209,0.00003570075,0.00027369725,0.99830985,0.00019895672,0.0007380923],"study_design_scores_gemma":[0.00012835591,0.000024315124,0.001088791,0.000012556251,0.0000037848383,0.0000054778466,0.000052845302,0.0125046335,0.007258953,0.97724444,0.0016098411,0.000065985354],"about_ca_topic_score_codex":0.0000068647714,"about_ca_topic_score_gemma":0.000002462363,"teacher_disagreement_score":0.83521646,"about_ca_system_score_codex":0.0000113002025,"about_ca_system_score_gemma":0.000035236015,"threshold_uncertainty_score":0.18359052},"labels":[],"label_agreement":null},{"id":"W2963555739","doi":"10.1016/j.jctb.2019.07.001","title":"On Frank's conjecture on k-connected orientations","year":2020,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Graph; Orientation (vector space); Vertex connectivity; Connectivity; Strongly connected component; Discrete mathematics; Geometry","score_opus":0.016952943701112562,"score_gpt":0.2524984490910995,"score_spread":0.23554550538998692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963555739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05200221,0.00009681083,0.85947454,0.0460842,0.00011646257,0.00036643457,0.000021408576,0.00053260167,0.041305315],"genre_scores_gemma":[0.95704347,0.00003379697,0.03977831,0.0017360565,0.000018379846,0.00003888665,0.00004755799,0.000026758009,0.0012767826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99514127,0.0029627127,0.00026863033,0.0007239279,0.0005371078,0.00036637692],"domain_scores_gemma":[0.9942324,0.0029340165,0.00014677463,0.001525526,0.00085669017,0.00030460136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014383111,0.00021175767,0.0002001783,0.00016343391,0.00046153035,0.00028634275,0.0017233714,0.00009219276,0.00017830468],"category_scores_gemma":[0.0028195945,0.00020675274,0.00011455675,0.0013322395,0.00017783836,0.0002897044,0.00038226793,0.00046335126,0.00033790633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017951827,0.0001740058,0.00011196709,0.000010428266,0.00001893585,0.00000881814,0.0047199875,0.00019952665,0.002534762,0.97304606,0.0012984106,0.017859124],"study_design_scores_gemma":[0.0051020356,0.000029325143,0.0057953545,0.000956901,0.000032964817,0.00003161199,0.00045407124,0.17777741,0.4871515,0.25364035,0.06724992,0.0017785277],"about_ca_topic_score_codex":0.000033818018,"about_ca_topic_score_gemma":0.000052003255,"teacher_disagreement_score":0.9050413,"about_ca_system_score_codex":0.000052756153,"about_ca_system_score_gemma":0.00011270984,"threshold_uncertainty_score":0.8431132},"labels":[],"label_agreement":null},{"id":"W2963559342","doi":"10.1016/j.jctb.2018.03.004","title":"Explicit bounds for graph minors","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Homeomorphism (graph theory); Graph; Discrete mathematics","score_opus":0.017899772074264998,"score_gpt":0.2954854718971994,"score_spread":0.2775856998229344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963559342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11803021,0.00046885747,0.85368514,0.0010408118,0.021088481,0.0004628826,0.000006514404,0.00010883631,0.005108238],"genre_scores_gemma":[0.9735824,0.000039721108,0.023013262,0.0001700473,0.0022325898,0.000016265763,5.560074e-7,0.000030825806,0.0009143556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980032,0.0002863728,0.0005237479,0.00022197797,0.0005246932,0.00044003085],"domain_scores_gemma":[0.99707544,0.00065158075,0.0004218187,0.00054029346,0.001101588,0.00020927246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636008,0.0001846355,0.00035797822,0.0003366626,0.00034354342,0.00020777695,0.0017908713,0.000093701696,0.000044115484],"category_scores_gemma":[0.0006662904,0.00015414991,0.00026907644,0.00061267253,0.00040255144,0.0016722985,0.00021882175,0.0002563013,0.000010801595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012024809,0.000078432524,0.000032666732,0.000010530027,0.000063192274,0.000012271751,0.00062384905,0.0000018552053,0.0021233507,0.98977304,0.0013302618,0.004748082],"study_design_scores_gemma":[0.0012576209,0.0025719865,0.00003604656,0.000024942412,0.000011128151,0.000105240884,0.00016457676,0.000021073649,0.027348125,0.92141896,0.046878804,0.00016150957],"about_ca_topic_score_codex":5.6382726e-7,"about_ca_topic_score_gemma":5.964417e-7,"teacher_disagreement_score":0.85555214,"about_ca_system_score_codex":0.000059022324,"about_ca_system_score_gemma":0.00018046789,"threshold_uncertainty_score":0.62860507},"labels":[],"label_agreement":null},{"id":"W2963579132","doi":"","title":"Cycles are determined by their domination polynomials.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph; Dominating set; Simple graph; Polynomial; Order (exchange); Discrete mathematics; Mathematical analysis","score_opus":0.011349914316980255,"score_gpt":0.257201414940366,"score_spread":0.24585150062338576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963579132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9485091,0.0001902551,0.044697523,0.0011885014,0.0016316655,0.00031887944,0.000008469683,0.00037825247,0.0030773745],"genre_scores_gemma":[0.997952,0.000011359871,0.0015640903,0.00016501217,0.000012705422,0.000030717314,0.0000047153344,0.00001804546,0.00024134383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998416,0.00026581527,0.00020766315,0.00042202332,0.00029975083,0.00038873532],"domain_scores_gemma":[0.9983821,0.00043689585,0.00013440604,0.0007914506,0.00011476376,0.00014038481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066177023,0.00017217925,0.0002114876,0.00013326421,0.00019396235,0.00014738385,0.0012230884,0.00007904536,0.000009291043],"category_scores_gemma":[0.0002461926,0.00015559503,0.000070147944,0.00039619554,0.00009578976,0.00057020126,0.00030577896,0.00016613897,0.000067018744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016015305,0.00009107565,0.0013433963,0.000009450489,0.000011749317,0.000003301621,0.0001945503,0.0000049961404,0.008902789,0.9430843,0.0034667766,0.042871602],"study_design_scores_gemma":[0.00095004606,0.00011874638,0.0030042075,0.000018576842,0.0000023227917,0.0000054448833,0.000024398363,0.0058431947,0.047512364,0.93686885,0.0053985254,0.00025332114],"about_ca_topic_score_codex":0.000007289437,"about_ca_topic_score_gemma":0.0000026849723,"teacher_disagreement_score":0.049442932,"about_ca_system_score_codex":0.00005909236,"about_ca_system_score_gemma":0.000029517794,"threshold_uncertainty_score":0.6344981},"labels":[],"label_agreement":null},{"id":"W2963622109","doi":"10.1002/jgt.22230","title":"Star chromatic index of subcubic multigraphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Tianjin City; Simon Fraser University; National Natural Science Foundation of China","keywords":"Multigraph; Mathematics; Edge coloring; Combinatorics; Star (game theory); Graph; Conjecture; Discrete mathematics; Graph power; Line graph","score_opus":0.021040488398955014,"score_gpt":0.3052251601930699,"score_spread":0.2841846717941149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963622109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76103884,0.0012520598,0.23527625,0.00027326072,0.0005953757,0.00016501559,0.0000035747537,0.000026727284,0.0013688954],"genre_scores_gemma":[0.9870769,0.00016207255,0.012551736,0.000043625245,0.000057108722,0.0000020257214,1.1455003e-7,0.000015053101,0.00009139357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976122,0.00039702927,0.00066568976,0.00020258073,0.0007616081,0.00036093476],"domain_scores_gemma":[0.9959053,0.0005370395,0.0014460218,0.0014467486,0.00046116038,0.00020377737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003442812,0.0001772612,0.00045853047,0.00079649827,0.0003401915,0.0001460656,0.003800836,0.0000809759,0.000036260397],"category_scores_gemma":[0.00073336455,0.00013839098,0.00040451376,0.00034912486,0.0007025644,0.0013885563,0.00035239142,0.00045944052,0.000007382302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051101454,0.00037760148,0.019022863,0.00014067031,0.00040451394,0.0002673259,0.0016452996,0.00013019485,0.023714937,0.9052457,0.00024327738,0.04829658],"study_design_scores_gemma":[0.001071781,0.00041676263,0.052675772,0.0001694372,0.00001859829,0.00012724713,0.00014298767,0.00058140024,0.007962479,0.93652123,0.00014269102,0.00016962536],"about_ca_topic_score_codex":0.0000057821208,"about_ca_topic_score_gemma":0.000004131763,"teacher_disagreement_score":0.22603802,"about_ca_system_score_codex":0.000024724446,"about_ca_system_score_gemma":0.0001294341,"threshold_uncertainty_score":0.7062962},"labels":[],"label_agreement":null},{"id":"W2963622148","doi":"10.1007/s00454-022-00414-8","title":"Combinatorial Properties and Recognition of Unit Square Visibility Graphs","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Lorentz Center; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Unit square; Combinatorics; Visibility; Algorithm; Graph; Mathematics; Unit (ring theory); Square (algebra); Computer science; Geometry; Physics","score_opus":0.05925306103931311,"score_gpt":0.30829910793677706,"score_spread":0.24904604689746396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963622148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94287384,0.000113894166,0.055810135,0.00018511391,0.00024453088,0.00025734765,0.000046008317,0.00019056536,0.000278543],"genre_scores_gemma":[0.99572015,0.00001372325,0.004065872,0.0000293131,0.000023600638,0.00001960756,0.000090625654,0.000010470116,0.000026656553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982944,0.00017214095,0.00028717815,0.00040051056,0.00059086975,0.0002548981],"domain_scores_gemma":[0.9987305,0.00042274842,0.00009775617,0.0002729008,0.00037822075,0.00009790098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006554015,0.00013040012,0.00018916851,0.0006013294,0.00015986148,0.000074941956,0.0003917029,0.000054597323,0.000014742092],"category_scores_gemma":[0.0002454072,0.00011956133,0.000069774374,0.002467848,0.00025339526,0.0005077616,0.0003587707,0.00015617086,0.000039231898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000276288,0.0002457786,0.03434844,0.0005427263,0.00014938296,0.000026937189,0.0019439411,0.013709859,0.001713168,0.8623866,0.0001760864,0.08448083],"study_design_scores_gemma":[0.00055534777,0.00016888003,0.074169636,0.000048989114,0.000004261499,0.000005315251,0.00015971066,0.046957225,0.00075267453,0.8769742,0.000037581096,0.0001661397],"about_ca_topic_score_codex":0.0000149509115,"about_ca_topic_score_gemma":0.0000010344346,"teacher_disagreement_score":0.0843147,"about_ca_system_score_codex":0.000016169586,"about_ca_system_score_gemma":0.0000664312,"threshold_uncertainty_score":0.48755696},"labels":[],"label_agreement":null},{"id":"W2963649630","doi":"10.1007/s00373-017-1807-2","title":"Analogues of Cliques for (m, n)-Colored Mixed Graphs","year":2017,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Colored; Graph; Vertex (graph theory); Discrete mathematics; Clique number","score_opus":0.03279238096370085,"score_gpt":0.3089552431641388,"score_spread":0.27616286220043795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963649630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92314756,0.0014041471,0.071327455,0.00057865423,0.00088755455,0.0006905233,0.00003147488,0.00018113779,0.0017515043],"genre_scores_gemma":[0.99414045,0.00039950848,0.005280912,0.000027265793,0.0000053511067,0.000048615155,0.00000307008,0.000010558201,0.0000842786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881417,0.000052386175,0.00022211003,0.00035510096,0.00023357083,0.0003226504],"domain_scores_gemma":[0.99820507,0.00020535917,0.00022152672,0.0009658423,0.0002801402,0.000122041034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052124273,0.00014532244,0.00027254203,0.00022551401,0.00055438,0.00017873706,0.0013235171,0.000082205705,7.453941e-7],"category_scores_gemma":[0.0001772002,0.00013115485,0.00013453426,0.00026345646,0.00035087578,0.00048564997,0.000372303,0.00011328211,6.389528e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002393227,0.00006806865,0.009380737,0.000040329043,0.000026977144,0.0000030398674,0.000104926665,4.904089e-7,0.0003801217,0.980631,0.00023306036,0.009107327],"study_design_scores_gemma":[0.0006674276,0.00038764076,0.023219347,0.000016784727,0.000007807779,0.0000025769548,0.000029051636,0.00070897816,0.005732173,0.96829575,0.0007808352,0.00015162809],"about_ca_topic_score_codex":0.00002268926,"about_ca_topic_score_gemma":0.000010288177,"teacher_disagreement_score":0.070992894,"about_ca_system_score_codex":0.000008855251,"about_ca_system_score_gemma":0.000032859505,"threshold_uncertainty_score":0.53483397},"labels":[],"label_agreement":null},{"id":"W2963663369","doi":"10.1137/16m108080x","title":"Planar Digraphs of Digirth Four are 2-Colorable","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Digraph; Combinatorics; Mathematics; Conjecture; Monochromatic color; Planar; Planar graph; Colored; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.04470984151357586,"score_gpt":0.31633142321947133,"score_spread":0.27162158170589545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963663369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16750135,0.00025891513,0.7882039,0.0029633448,0.0007040572,0.00054669275,0.00003715618,0.00013102031,0.03965359],"genre_scores_gemma":[0.92893404,0.000119960154,0.069825664,0.000060733415,0.00007129371,0.000006596702,4.5254134e-7,0.00002859201,0.00095267297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997882,0.00008211973,0.0004972437,0.00024342665,0.0008343865,0.00046084338],"domain_scores_gemma":[0.99658763,0.00028120397,0.0011307534,0.0015586773,0.00019566699,0.00024608526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000954762,0.00021355633,0.00042024846,0.00024397846,0.0007159033,0.0006161128,0.0029859599,0.00007050423,0.000022998021],"category_scores_gemma":[0.0006267631,0.00015690533,0.00022734568,0.00017406972,0.00023189533,0.0009195517,0.00028455825,0.0004956326,0.000047572077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006901875,0.00029833434,0.00276619,0.00022956386,0.00015890907,0.00040723593,0.0011281031,0.0002993888,0.0009887258,0.98787093,0.0010675833,0.0047160117],"study_design_scores_gemma":[0.0007416376,0.000447555,0.0030665658,0.00058586587,0.000014511802,0.00028627375,0.00027809135,0.006274972,0.002944613,0.9842118,0.00084204413,0.0003060853],"about_ca_topic_score_codex":0.0000013003179,"about_ca_topic_score_gemma":0.000003754732,"teacher_disagreement_score":0.7614327,"about_ca_system_score_codex":0.000036624806,"about_ca_system_score_gemma":0.00006625632,"threshold_uncertainty_score":0.6398413},"labels":[],"label_agreement":null},{"id":"W2963704621","doi":"","title":"Equivalence between Extendability and Factor-Criticality.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Criticality; Mathematics; Equivalence (formal languages); Pure mathematics; Factor (programming language); Nuclear physics; Physics; Computer science; Programming language","score_opus":0.0344585319924574,"score_gpt":0.33757427598177286,"score_spread":0.30311574398931546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963704621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8875575,0.00018664477,0.109511785,0.00038443948,0.00043757347,0.00019736783,0.000005228158,0.00020674607,0.0015127185],"genre_scores_gemma":[0.99334365,0.000009839935,0.0064974506,0.000064071864,0.00001010328,0.0000042491565,8.145435e-7,0.00000992946,0.000059880203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979038,0.00014843541,0.000278998,0.0005626175,0.00047479884,0.0006313014],"domain_scores_gemma":[0.99739075,0.0012213839,0.000041548563,0.000848787,0.00015166141,0.0003458506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015711299,0.00015680294,0.0002131252,0.00011098009,0.00018855801,0.0001048657,0.0009351987,0.00008512637,0.000015648115],"category_scores_gemma":[0.0004888203,0.00015233393,0.000049179216,0.0005168745,0.00036433284,0.0006238883,0.0006642688,0.0003170078,0.000033701563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058892015,0.000041100782,0.06569966,0.000018794097,0.000006938463,0.000016506465,0.00013155931,9.1161915e-8,0.0004878349,0.89931345,0.000014457877,0.034263708],"study_design_scores_gemma":[0.00024907832,0.00008847596,0.18400064,0.000009651775,0.0000019832617,0.0000047303324,0.000015898535,0.00007760268,0.0038909898,0.81114167,0.0003658617,0.0001534],"about_ca_topic_score_codex":0.000013332795,"about_ca_topic_score_gemma":0.000001668346,"teacher_disagreement_score":0.11830098,"about_ca_system_score_codex":0.00006704509,"about_ca_system_score_gemma":0.000040132145,"threshold_uncertainty_score":0.6211998},"labels":[],"label_agreement":null},{"id":"W2963762723","doi":"10.1016/j.comgeo.2019.04.004","title":"Approximating dominating set on intersection graphs of rectangles and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:mi mathvariant=\"sans-serif\">L</mml:mi></mml:math>-frames","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Diagonal; Combinatorics; Intersection (aeronautics); Mathematics; Approximation algorithm; Line (geometry); Logarithm; Line segment; Dominating set; Discrete mathematics; Geometry; Graph; Mathematical analysis","score_opus":0.01817942780823386,"score_gpt":0.2655638147394427,"score_spread":0.24738438693120882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963762723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90079975,0.00011430628,0.09707361,0.00009945204,0.00036120642,0.000077839446,0.000024707777,0.00010460212,0.0013445002],"genre_scores_gemma":[0.93607634,0.000015721096,0.06351019,0.00016976877,0.00007081705,0.00004363862,0.00004963029,0.00003884153,0.000025067986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976881,0.0001257833,0.00047888295,0.00057263,0.0007333372,0.00040124138],"domain_scores_gemma":[0.9975835,0.0012773741,0.0004384961,0.00044977522,0.0001322085,0.00011862967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010315627,0.00021079954,0.00019267871,0.00045087535,0.0002916791,0.00022520083,0.00058038527,0.0001818256,0.00002466124],"category_scores_gemma":[0.00044568963,0.0002493987,0.00016591015,0.0008816138,0.00021922155,0.00062352454,0.00053800346,0.0004021888,0.0001288632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008063077,0.00006351874,0.00010289954,0.0002400981,0.00008329355,0.00002037383,0.0010186093,0.01039008,0.0010785006,0.977034,0.000040921543,0.009847087],"study_design_scores_gemma":[0.00043718392,0.00038635728,0.0006307562,0.00028295023,0.000014542389,0.00013030198,0.00070187426,0.9597592,0.0028545735,0.03453287,0.00005352938,0.00021588957],"about_ca_topic_score_codex":0.00002701476,"about_ca_topic_score_gemma":0.0000039161373,"teacher_disagreement_score":0.9493691,"about_ca_system_score_codex":0.000019537014,"about_ca_system_score_gemma":0.000109484514,"threshold_uncertainty_score":0.9999958},"labels":[],"label_agreement":null},{"id":"W2963801174","doi":"10.23638/dmtcs-20-2-4","title":"Complexity of locally-injective homomorphisms to tournaments","year":2018,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Injective function; Homomorphism; Monomorphism; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.34966476415136444,"score_gpt":0.5757027221290926,"score_spread":0.22603795797772813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963801174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57383764,0.001897591,0.40965414,0.00048174348,0.0010153061,0.0012359752,0.00006303255,0.0000897151,0.0117248865],"genre_scores_gemma":[0.98234034,0.00037943333,0.016361358,0.00044943008,0.00015116732,0.000034804616,0.0000019307743,0.000039753482,0.00024179209],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550176,0.0005643472,0.0009867013,0.00075238186,0.0014799467,0.0007148632],"domain_scores_gemma":[0.99528205,0.00042450315,0.00084904145,0.0013515016,0.0015013115,0.0005915908],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022601492,0.00035584677,0.0009017155,0.0013907884,0.00038898762,0.00096039375,0.010756396,0.00009584027,0.0031353594],"category_scores_gemma":[0.0005508474,0.00032802398,0.00021587108,0.0031145338,0.0010146459,0.0035631668,0.005065143,0.00048121944,0.000086806656],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021209521,0.0023869385,0.20863965,0.00021724458,0.0011064454,0.00026040472,0.0034747876,0.00083038694,0.45105764,0.10405853,0.050670255,0.17517675],"study_design_scores_gemma":[0.00095561636,0.00020278523,0.29436487,0.00051235885,0.000026035092,0.000041892657,0.00010144411,0.0010131717,0.24460423,0.4547232,0.002787598,0.0006667978],"about_ca_topic_score_codex":0.00041799367,"about_ca_topic_score_gemma":0.00006716723,"teacher_disagreement_score":0.4085027,"about_ca_system_score_codex":0.00019168474,"about_ca_system_score_gemma":0.0002485518,"threshold_uncertainty_score":0.9999172},"labels":[],"label_agreement":null},{"id":"W2963873020","doi":"10.1007/s00493-017-3538-5","title":"Treewidth of Grid Subsets","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Treewidth; Combinatorics; Grid; Graph; Pathwidth; Geometry","score_opus":0.029705580329058148,"score_gpt":0.31315980002095173,"score_spread":0.2834542196918936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963873020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42104033,0.0021459167,0.30998343,0.006812993,0.008912611,0.0011938455,0.000023982297,0.0008326451,0.24905425],"genre_scores_gemma":[0.99655724,0.000026548667,0.0028198475,0.000017358052,0.000021602455,0.000008005256,4.6165584e-7,0.000007140907,0.00054182275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899346,0.000049623064,0.00013997873,0.0002521349,0.0003049147,0.0002598735],"domain_scores_gemma":[0.99762094,0.000096065414,0.00015199617,0.0019032827,0.00012421823,0.00010347722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002775462,0.000087789136,0.00016481262,0.000085923784,0.0003111909,0.00009722468,0.0029142275,0.0000378663,0.000012272216],"category_scores_gemma":[0.00023423483,0.000080431375,0.000063902786,0.0001674106,0.00016965542,0.0005098183,0.0007167356,0.00012669127,0.000059655904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066647626,0.00009517346,0.0054050223,0.000011531611,0.000009594097,0.000019992389,0.00008921866,0.0000014297678,0.0007136402,0.97022647,0.0013879436,0.022033311],"study_design_scores_gemma":[0.0008960275,0.00020426238,0.05041871,0.000023154991,0.0000034910533,0.000008415389,0.000007230268,0.0011708839,0.02522496,0.90787524,0.013937965,0.00022965968],"about_ca_topic_score_codex":0.00001116111,"about_ca_topic_score_gemma":9.924498e-7,"teacher_disagreement_score":0.5755169,"about_ca_system_score_codex":0.000027033619,"about_ca_system_score_gemma":0.000044185545,"threshold_uncertainty_score":0.54154086},"labels":[],"label_agreement":null},{"id":"W2963899823","doi":"10.7151/dmgt.1799","title":"Domination, Eternal Domination, and Clique Covering","year":2015,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Goddard Space Flight Center","keywords":"Mathematics; Clique; Combinatorics; Domination analysis; Clique number; Graph; Vertex (graph theory)","score_opus":0.28178989398822973,"score_gpt":0.5788230662058917,"score_spread":0.297033172217662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963899823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.597888,0.008327286,0.3853066,0.00069430406,0.00076987833,0.0006701489,0.000013593735,0.00009153828,0.0062386882],"genre_scores_gemma":[0.98870873,0.0022052007,0.008200007,0.00023701056,0.00012575615,0.000040328392,0.0000025466659,0.000031431748,0.0004489581],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968964,0.00045216884,0.00066226383,0.00053275726,0.0010444948,0.00041192523],"domain_scores_gemma":[0.9968127,0.0005349048,0.00057655835,0.0006300662,0.0009775194,0.0004682639],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0036397022,0.00024755616,0.0004748808,0.000972525,0.00025445456,0.0022184826,0.0044136364,0.00008796323,0.00033558754],"category_scores_gemma":[0.0010228467,0.00023268792,0.000087462606,0.0012648317,0.00020877042,0.007333863,0.002430888,0.00040133344,0.0000150452215],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007606456,0.0005668023,0.5040775,0.00020224167,0.00034104998,0.00028056605,0.00297368,0.0021620218,0.11001395,0.08555696,0.030920004,0.2621446],"study_design_scores_gemma":[0.0025571624,0.00005421491,0.34622988,0.0003803705,0.000027569255,0.00016627638,0.00013174514,0.0061306036,0.06642924,0.56269634,0.014332538,0.0008640586],"about_ca_topic_score_codex":0.00014329147,"about_ca_topic_score_gemma":0.00001987296,"teacher_disagreement_score":0.47713938,"about_ca_system_score_codex":0.00014442384,"about_ca_system_score_gemma":0.00022972545,"threshold_uncertainty_score":0.9988173},"labels":[],"label_agreement":null},{"id":"W2963906609","doi":"","title":"On the hypercompetition numbers of hypergraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Digraph; Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.02624788001298216,"score_gpt":0.25014753469931567,"score_spread":0.2238996546863335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963906609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.942078,0.000042779546,0.0020940974,0.00029852433,0.00084252073,0.00020634464,0.0000014197693,0.00010210969,0.054334212],"genre_scores_gemma":[0.9978311,0.000011889189,0.0019109597,0.00013809043,0.0000017278019,0.000017629913,4.561885e-7,0.0000088058705,0.000079364356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890935,0.00015545421,0.00015301991,0.00022898248,0.0003273439,0.00022587352],"domain_scores_gemma":[0.99863803,0.00032195827,0.00006743531,0.0008108039,0.00010200861,0.000059781443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042717886,0.00010099535,0.0001179728,0.000102953316,0.00011294201,0.000017712706,0.0011461315,0.000039515595,0.000074247364],"category_scores_gemma":[0.00009953929,0.0000718292,0.00007786855,0.0005802913,0.00017507716,0.00022568893,0.00016773674,0.00017182092,0.000100792386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013319756,0.000104721235,0.00052992423,0.0000033478016,0.000011765462,0.0000041846115,0.00040897698,0.0000019101442,0.000724893,0.9972666,0.00025801655,0.00067236327],"study_design_scores_gemma":[0.00021217317,0.00016463199,0.002111477,0.000015150143,0.0000019673357,0.000003793888,0.000046350273,0.00019048186,0.013020288,0.9839936,0.00015704973,0.00008304218],"about_ca_topic_score_codex":0.000022970073,"about_ca_topic_score_gemma":0.0000015844034,"teacher_disagreement_score":0.055753086,"about_ca_system_score_codex":0.000018407896,"about_ca_system_score_gemma":0.000025883524,"threshold_uncertainty_score":0.292911},"labels":[],"label_agreement":null},{"id":"W2963938510","doi":"","title":"Nonmedian Direct Products of Graphs with Loops.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.021286525295279517,"score_gpt":0.26126204148081067,"score_spread":0.23997551618553115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963938510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9733255,0.0005864485,0.0022352745,0.0010094086,0.0019917572,0.0006567916,0.0000039704296,0.00031953512,0.019871298],"genre_scores_gemma":[0.9913587,0.000008025614,0.008319685,0.000028944973,0.0000047929943,0.000019812453,0.0000015543169,0.000015543,0.00024294837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983324,0.00012161668,0.00017024958,0.0004049284,0.000617331,0.00035349783],"domain_scores_gemma":[0.99814343,0.00010506124,0.000094220406,0.0009917943,0.00043815927,0.00022731858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063879794,0.00013950508,0.00022123472,0.00018583544,0.000051690276,0.000036803332,0.0010517895,0.000041650714,0.0000024073674],"category_scores_gemma":[0.0002400594,0.000112927846,0.00003179356,0.0014686942,0.00021933441,0.0004889254,0.00024389474,0.00015991202,0.000031800188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003965226,0.0001415328,0.0058158697,0.000018516743,0.000024571336,0.000032992844,0.0006824266,0.000020941108,0.00047237249,0.98970366,0.00095230114,0.0020951559],"study_design_scores_gemma":[0.0011840339,0.0006505503,0.0016027293,0.000030939304,0.000005286035,0.000016023265,0.000053717766,0.00024468199,0.031986542,0.962486,0.001512328,0.00022715697],"about_ca_topic_score_codex":0.000019535448,"about_ca_topic_score_gemma":0.000004471589,"teacher_disagreement_score":0.031514168,"about_ca_system_score_codex":0.000035814475,"about_ca_system_score_gemma":0.00021433254,"threshold_uncertainty_score":0.46050638},"labels":[],"label_agreement":null},{"id":"W2963996369","doi":"10.1016/j.tcs.2017.08.018","title":"Compressed cliques graphs, clique coverings and positive zero forcing","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Clique problem; Clique graph; Clique-sum; Clique; Uniqueness; Discrete mathematics; Split graph; Vertex (graph theory); Forcing (mathematics); Chordal graph; Graph; Line graph; 1-planar graph; Voltage graph; Mathematical analysis","score_opus":0.014143678941328121,"score_gpt":0.30547091327431436,"score_spread":0.29132723433298624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963996369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10786908,0.000042126034,0.88652194,0.0011324995,0.00027731538,0.0002551418,0.0000038856633,0.00018887901,0.0037091507],"genre_scores_gemma":[0.8776349,0.00002655373,0.12180118,0.00046436637,0.000041219908,0.000008256954,4.6288716e-7,0.0000116846995,0.000011416418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968785,0.00016333364,0.00027137063,0.0010709071,0.00075331074,0.0008625988],"domain_scores_gemma":[0.996726,0.0005186308,0.00015642837,0.0018163183,0.000320763,0.00046190707],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0020681755,0.0002579756,0.00030902927,0.00024671428,0.0022658457,0.0020903505,0.0049067605,0.0000722085,0.000007224949],"category_scores_gemma":[0.0002969541,0.00022114464,0.00007580281,0.00038857223,0.009195416,0.0025194383,0.004309311,0.00037994716,0.000016788525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024281428,0.000027538767,0.00039648844,0.0000080115615,0.0000057480524,0.00003075555,0.00032943554,0.000032374806,0.0022454394,0.97341275,0.000013227489,0.023473924],"study_design_scores_gemma":[0.0003012589,0.00026278934,0.008888208,0.00006724676,0.0000028888946,0.000053457756,0.000002894768,0.1827513,0.017785067,0.78957564,0.00003552465,0.00027373145],"about_ca_topic_score_codex":0.000017756744,"about_ca_topic_score_gemma":0.0000013560395,"teacher_disagreement_score":0.7697658,"about_ca_system_score_codex":0.000048913455,"about_ca_system_score_gemma":0.00009844611,"threshold_uncertainty_score":0.9990331},"labels":[],"label_agreement":null},{"id":"W2964047879","doi":"10.1002/jgt.22362","title":"Optimal-size clique transversals in chordal graphs&#13;\\n","year":2018,"lang":"en","type":"article","venue":"Warwick Research Archive Portal (University of Warwick)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Treewidth; Clique-sum; Split graph; Vertex (graph theory); Clique graph; Discrete mathematics; Clique; Block graph; Graph; Pathwidth; 1-planar graph; Line graph; Graph power","score_opus":0.027251470751161484,"score_gpt":0.2977006788881615,"score_spread":0.270449208137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964047879","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7433416,0.00015691751,0.21575052,0.0019436275,0.00019227562,0.0012540158,0.00011034741,0.00022691021,0.03702377],"genre_scores_gemma":[0.9332999,0.00029620598,0.065158784,0.00004425715,0.00006333293,0.0000043518376,0.000016863078,0.000033602904,0.0010826873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99339837,0.0012999756,0.0004446193,0.0012785995,0.0018155013,0.0017629109],"domain_scores_gemma":[0.995517,0.0014166521,0.0001705759,0.0014854528,0.0007178878,0.00069241924],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0036495684,0.00034358163,0.0006057876,0.001823932,0.00070502603,0.00007699946,0.004260351,0.00018468573,0.0007209547],"category_scores_gemma":[0.0005179116,0.00040319056,0.00033157493,0.0034399086,0.0039586835,0.0014480007,0.0016769421,0.0014272815,0.00028209898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004767457,0.0028326865,0.035929892,0.000530394,0.00062528544,0.006459048,0.07155748,0.0007545929,0.07539575,0.72482276,0.017977603,0.058347035],"study_design_scores_gemma":[0.011507689,0.008422807,0.17988718,0.000781678,0.000046217276,0.00028498535,0.022911852,0.044584617,0.0169626,0.6941082,0.017652333,0.0028498496],"about_ca_topic_score_codex":0.0023550873,"about_ca_topic_score_gemma":0.005445834,"teacher_disagreement_score":0.1899583,"about_ca_system_score_codex":0.00009868321,"about_ca_system_score_gemma":0.0006958559,"threshold_uncertainty_score":0.999842},"labels":[],"label_agreement":null},{"id":"W2964092672","doi":"10.37236/7280","title":"On the Stability of Independence Polynomials","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Independence (probability theory); Combinatorics; Discrete mathematics; Independence number; Polynomial; Graph; Tutte polynomial; Line graph; Voltage graph; Mathematical analysis; Statistics","score_opus":0.019542479260622428,"score_gpt":0.2822583539937257,"score_spread":0.26271587473310326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964092672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79928017,0.0008393197,0.19439386,0.0033112126,0.0004775872,0.00020355376,6.0245003e-7,0.000014545476,0.0014791692],"genre_scores_gemma":[0.9996316,0.000099518955,0.000038964707,0.000115410745,0.000058196114,0.0000016713897,2.1340437e-8,0.0000072406474,0.000047385325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974364,0.00060130446,0.00040220097,0.00013348278,0.00092178665,0.00050481415],"domain_scores_gemma":[0.9962896,0.0016045283,0.00047814543,0.0008678844,0.0006992652,0.000060574323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062265308,0.00011198788,0.00021328173,0.000099373035,0.00021245646,0.000042253305,0.0031585419,0.00004787172,0.000026800697],"category_scores_gemma":[0.000801285,0.00005722556,0.00011597664,0.0008212461,0.00040960385,0.0002570954,0.00024054205,0.0009550333,0.000011338473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080775215,0.00008467062,0.00010566965,0.000002425503,0.000031059408,0.0000012855397,0.0003569261,0.0000074199243,0.0018134805,0.996609,0.0001434298,0.00076386984],"study_design_scores_gemma":[0.00026377858,0.0014335198,0.00023033388,0.0000135811315,0.0000057898806,0.00004010551,0.000060573384,0.00022489087,0.07012683,0.92723393,0.000309435,0.000057227207],"about_ca_topic_score_codex":0.0000037221766,"about_ca_topic_score_gemma":0.0000033763552,"teacher_disagreement_score":0.20035143,"about_ca_system_score_codex":0.00021195791,"about_ca_system_score_gemma":0.00069693016,"threshold_uncertainty_score":0.5869409},"labels":[],"label_agreement":null},{"id":"W2964198119","doi":"","title":"Some results on incidence coloring, star arboricity and domination number","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Arboricity; Mathematics; Combinatorics; Chromatic scale; Cartesian product; Upper and lower bounds; Incidence (geometry); Graph; Star (game theory); Discrete mathematics; Planar graph; Geometry","score_opus":0.02777843236157208,"score_gpt":0.3201904935998652,"score_spread":0.2924120612382931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964198119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9354007,0.00007838272,0.05246225,0.0006522762,0.0002982187,0.0002265017,0.0000025092495,0.0001624496,0.010716712],"genre_scores_gemma":[0.9788657,0.000036051963,0.019835632,0.0001835918,0.000096174015,0.0000124280805,5.5583973e-7,0.000004597439,0.00096528215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998847,0.000093761024,0.0001330793,0.0002565696,0.000335749,0.0003338438],"domain_scores_gemma":[0.99902385,0.00034532402,0.00004772064,0.0003717098,0.000065132175,0.00014626244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000927635,0.000086408705,0.0000839417,0.000076278455,0.00011512661,0.000058316353,0.00035016797,0.000037798105,0.000010701085],"category_scores_gemma":[0.00025754754,0.00007225446,0.000016308566,0.00028211274,0.00006822856,0.0015590203,0.0002632028,0.00013950086,0.00014892897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057660436,0.00006250941,0.003277476,0.000004632154,0.0000034759366,0.000003058354,0.00043685458,0.0000094837005,0.0006676379,0.98934424,0.00029736912,0.005835632],"study_design_scores_gemma":[0.00321467,0.0006994629,0.34771168,0.00007550554,0.000008112199,0.000054664055,0.0001843588,0.02191674,0.09652803,0.5134719,0.015077982,0.0010568795],"about_ca_topic_score_codex":0.0000217079,"about_ca_topic_score_gemma":0.000004444033,"teacher_disagreement_score":0.4758723,"about_ca_system_score_codex":0.000057989924,"about_ca_system_score_gemma":0.000016985692,"threshold_uncertainty_score":0.29464513},"labels":[],"label_agreement":null},{"id":"W2964203300","doi":"10.2140/involve.2019.12.1423","title":"Total Roman domination edge-critical graphs","year":2019,"lang":"en","type":"article","venue":"Involve a Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Dominating set; Graph; Domination analysis; Minimum weight; Induced subgraph","score_opus":0.022744303336145095,"score_gpt":0.30568937959170345,"score_spread":0.28294507625555837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964203300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4034051,0.00043714597,0.5929909,0.00058134244,0.00057417137,0.00016230954,0.0000011120336,0.000030576077,0.0018173549],"genre_scores_gemma":[0.7948999,0.00002286239,0.20474009,0.00006480179,0.000060775907,0.0000019723564,2.1758231e-7,0.000013809112,0.00019558868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982257,0.00009314732,0.00053004094,0.00014270097,0.00073555915,0.0002728905],"domain_scores_gemma":[0.9976498,0.0010050116,0.00027556095,0.00043985792,0.00047763292,0.00015216062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012314543,0.0001244123,0.00028355644,0.00032293506,0.000057991354,0.00013329973,0.0009331599,0.000061694685,0.000052849064],"category_scores_gemma":[0.0007135563,0.00009941051,0.00018008344,0.0004047399,0.00009894836,0.0009327509,0.00018747634,0.000330763,0.00013001077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014309703,0.00031064276,0.00017738229,0.00012738415,0.00004114863,0.000066460205,0.0019031581,0.00009671246,0.0062497994,0.98685074,0.0003999111,0.0037623672],"study_design_scores_gemma":[0.0006053186,0.00053651974,0.00019594486,0.00020857542,0.000014013583,0.00072371867,0.0004680091,0.018656723,0.0043135476,0.9738347,0.00027102767,0.00017193038],"about_ca_topic_score_codex":3.4973814e-7,"about_ca_topic_score_gemma":3.3989227e-7,"teacher_disagreement_score":0.39149478,"about_ca_system_score_codex":0.000046427307,"about_ca_system_score_gemma":0.000081414844,"threshold_uncertainty_score":0.40538427},"labels":[],"label_agreement":null},{"id":"W2964239655","doi":"","title":"Constructing regular graphs with smallest defining number.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Graph; Chromatic scale; Brooks' theorem; Discrete mathematics; Chordal graph; 1-planar graph; Computer science","score_opus":0.011710156329296069,"score_gpt":0.2598272596101379,"score_spread":0.24811710328084186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964239655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94611835,0.00016756296,0.014432015,0.0008221138,0.0006464268,0.00027528452,0.0000015867313,0.0005112123,0.037025418],"genre_scores_gemma":[0.9500166,0.000006969251,0.04972138,0.00014014958,0.0000031515576,0.000008000362,0.0000023885577,0.00001338444,0.00008796866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981391,0.00011247857,0.00021630734,0.0005094837,0.0004625246,0.000560131],"domain_scores_gemma":[0.9985099,0.00019895448,0.00011158662,0.00084003806,0.00016205448,0.00017749945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043664526,0.00019992076,0.00022836847,0.00012390973,0.00028140255,0.00017167647,0.0010607841,0.0000680983,0.0000153793],"category_scores_gemma":[0.000084044535,0.00018297278,0.00006134666,0.0010807674,0.0001708379,0.00046813404,0.00016297393,0.0003301285,0.000070621616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015097309,0.000033974582,0.013959635,0.000003310043,0.000013554798,0.00007418993,0.00012621556,0.00000953969,0.00012993932,0.97282994,0.00008942206,0.0127151925],"study_design_scores_gemma":[0.00080924854,0.00021140806,0.0018905309,0.000046148496,0.000004113414,0.00016294845,0.0001228404,0.00041709866,0.0021109595,0.99383265,0.0001314766,0.00026057148],"about_ca_topic_score_codex":0.000006490026,"about_ca_topic_score_gemma":0.00000345813,"teacher_disagreement_score":0.03693745,"about_ca_system_score_codex":0.000060191578,"about_ca_system_score_gemma":0.00008385662,"threshold_uncertainty_score":0.7461414},"labels":[],"label_agreement":null},{"id":"W2964291259","doi":"","title":"More on total monochromatic connection of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Monochromatic color; Graph; Connectivity; Path graph; Discrete mathematics; Complete graph; Graph power; Line graph; Physics","score_opus":0.016327045608882398,"score_gpt":0.2884815805784785,"score_spread":0.27215453496959613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964291259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99183494,0.000027413264,0.0038481026,0.00017206106,0.0011779902,0.00017370966,0.0000011251907,0.00011907319,0.0026455752],"genre_scores_gemma":[0.99802816,0.0000028649047,0.0017971318,0.000053463333,0.0000069341445,0.000013063795,8.579616e-7,0.000010187562,0.0000873297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880815,0.00009261414,0.00019177311,0.00029291873,0.00035967675,0.00025487473],"domain_scores_gemma":[0.9987549,0.00017983223,0.0000913687,0.00070664333,0.00018385121,0.000083366096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028882906,0.00011411534,0.00016342298,0.00020519308,0.00012018943,0.000030872754,0.00060186203,0.000052341962,0.000021294942],"category_scores_gemma":[0.00012258416,0.00010756224,0.00006598604,0.00076073274,0.000238646,0.00029545385,0.00016678337,0.00012534337,0.00009067184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001927771,0.00009668958,0.0003171437,0.000010614567,0.000015647971,0.000003929823,0.00039399395,0.000009005505,0.0029864325,0.99330044,0.0002634985,0.0025833107],"study_design_scores_gemma":[0.000501517,0.00081007736,0.0044658836,0.00003117686,0.0000025746272,0.00000979409,0.00004014612,0.0045025605,0.044193223,0.9452783,0.000044792054,0.00011998734],"about_ca_topic_score_codex":0.000010194298,"about_ca_topic_score_gemma":8.719301e-7,"teacher_disagreement_score":0.04802219,"about_ca_system_score_codex":0.000034733566,"about_ca_system_score_gemma":0.000032957076,"threshold_uncertainty_score":0.4386261},"labels":[],"label_agreement":null},{"id":"W2964757429","doi":"10.1137/1.9781611976465.45","title":"A Fast Minimum Degree Algorithm and Matching Lower Bound","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Heuristics; Combinatorics; Time complexity; Mathematics; Running time; Binary logarithm; Simple (philosophy); Reduction (mathematics); Algorithm; Graph; Upper and lower bounds; Discrete mathematics; Mathematical optimization","score_opus":0.07690993821574797,"score_gpt":0.2769575518587669,"score_spread":0.20004761364301893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964757429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003617226,0.00050260744,0.70872265,0.00017251806,0.00049402483,0.0025139893,0.00020904378,0.00022309177,0.28680032],"genre_scores_gemma":[0.00014974452,0.00010683042,0.6950324,0.0002438311,0.00092525495,0.00023027188,0.000038059417,0.00017129643,0.3031023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775106,0.000007390908,0.0004948626,0.000777916,0.00046912,0.00049967907],"domain_scores_gemma":[0.9982441,0.0005424376,0.00029807017,0.00058887555,0.00010487417,0.0002216523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006244628,0.00050777796,0.00071840937,0.00006629841,0.0004733236,0.00047559847,0.00053306884,0.00074383523,0.000012247378],"category_scores_gemma":[0.000016932348,0.00047412375,0.0004108412,0.000037194866,0.00041743187,0.00007985856,0.0008808695,0.000856173,0.0000042279603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009697039,0.00001877434,1.624608e-8,0.00018121231,0.00020276984,0.000005178469,0.0013197173,6.704349e-7,0.00021402843,0.82714766,0.0006564651,0.17024383],"study_design_scores_gemma":[0.0013413973,0.00009718106,3.1486792e-8,0.00029522143,0.00009493801,0.000036464684,0.00047583392,0.00109139,0.0003592979,0.9743912,0.021216985,0.0006000135],"about_ca_topic_score_codex":0.0000010030559,"about_ca_topic_score_gemma":0.0000012360878,"teacher_disagreement_score":0.16964382,"about_ca_system_score_codex":0.000054968415,"about_ca_system_score_gemma":0.0001921484,"threshold_uncertainty_score":0.99977106},"labels":[],"label_agreement":null},{"id":"W2966560041","doi":"10.1007/978-3-030-25027-0_17","title":"On the Tractability of Covering a Graph with 2-Clubs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Treewidth; Bipartite graph; Combinatorics; Planar graph; Vertex cover; Computer science; Graph; Discrete mathematics; Pathwidth; Bounded function; Mathematics; Line graph","score_opus":0.01847064711104523,"score_gpt":0.2587484430426983,"score_spread":0.24027779593165305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966560041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021220348,0.00010795047,0.9911219,0.0005409157,0.00038517555,0.0006696192,0.0000056483354,0.000062186155,0.004984582],"genre_scores_gemma":[0.9116016,0.00001861192,0.087263435,0.000751992,0.000069413516,0.000012276837,9.897711e-7,0.000037073718,0.0002445847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960838,0.0000790788,0.0003873676,0.0013179459,0.0015316406,0.000600189],"domain_scores_gemma":[0.99394596,0.00279331,0.00029211922,0.0025682275,0.00029501232,0.00010538048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001643146,0.00042827372,0.0004978405,0.0006401254,0.00018865286,0.0002049543,0.0046900148,0.00016838255,0.00002870468],"category_scores_gemma":[0.0001918624,0.00026403446,0.00014070519,0.0009943008,0.0016744547,0.00044792183,0.0010126047,0.0011375007,0.00002457446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008045721,0.00006832835,0.0001482643,0.00008628115,0.000026871601,0.000041303552,0.00083622144,0.11141734,0.000399163,0.73140156,0.0000063904877,0.15548779],"study_design_scores_gemma":[0.00030747804,0.00079762074,0.00037165952,0.00057191506,0.0000050556782,0.0000391896,3.5762667e-7,0.09493389,0.004831522,0.8974185,0.00018923804,0.0005336046],"about_ca_topic_score_codex":0.000010109735,"about_ca_topic_score_gemma":0.000037277947,"teacher_disagreement_score":0.9094796,"about_ca_system_score_codex":0.00015957761,"about_ca_system_score_gemma":0.00059972523,"threshold_uncertainty_score":0.99998116},"labels":[],"label_agreement":null},{"id":"W2967773100","doi":"10.1016/j.ic.2019.104437","title":"Constraint Satisfaction Problems over semilattice block Mal'tsev algebras","year":2019,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semilattice; Constraint satisfaction problem; Mathematics; Conjecture; Mathematical proof; Block (permutation group theory); Class (philosophy); Quotient; Universal algebra; Algebraic structure; Algebra over a field; Discrete mathematics; Combinatorics; Computer science; Pure mathematics; Artificial intelligence","score_opus":0.011934858479193766,"score_gpt":0.26601027037520286,"score_spread":0.2540754118960091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967773100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42388493,0.000022029762,0.5717287,0.00025323645,0.00018675489,0.0003873691,0.0000024637068,0.00015397849,0.0033805375],"genre_scores_gemma":[0.9901097,0.000014838726,0.009361736,0.0004264463,0.000011573034,0.000011864891,0.000014860951,0.0000036325669,0.00004535666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905425,0.000049831146,0.0002771295,0.00014435472,0.00030348165,0.00017093097],"domain_scores_gemma":[0.9993858,0.00009759344,0.00014357199,0.00015916605,0.00014348372,0.00007038694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029006097,0.00010008388,0.000094741474,0.00019571882,0.00010360212,0.00026318038,0.0001318788,0.000054161563,0.000028149203],"category_scores_gemma":[0.00002009427,0.00009791937,0.000025414754,0.00030611962,0.000039877646,0.0031213553,0.00008557224,0.00012992103,0.00028199787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025466261,0.000023060167,0.01306507,0.00015428652,0.00003103499,0.0000010576841,0.004359804,0.043096744,0.0008018491,0.36316702,0.0003657462,0.57490885],"study_design_scores_gemma":[0.0011606546,0.00015563816,0.12005191,0.000048528647,0.000004235085,0.000073709096,0.00026455484,0.824671,0.00033918585,0.048544366,0.004398162,0.0002880794],"about_ca_topic_score_codex":0.000015336656,"about_ca_topic_score_gemma":0.000003086663,"teacher_disagreement_score":0.78157425,"about_ca_system_score_codex":0.000041515043,"about_ca_system_score_gemma":0.00004267799,"threshold_uncertainty_score":0.39930362},"labels":[],"label_agreement":null},{"id":"W2967821251","doi":"10.1016/j.tcs.2019.08.017","title":"Perfect Roman domination in graphs","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Science and Engineering Research Board","keywords":"Combinatorics; Mathematics; Chordal graph; Interval graph; Bipartite graph; Vertex (graph theory); Minimum weight; Discrete mathematics; Dominating set; Strong perfect graph theorem; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.007997550992975874,"score_gpt":0.27476650948472203,"score_spread":0.26676895849174614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967821251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41806746,0.00001580817,0.5737574,0.0003664832,0.0003491738,0.00026152312,2.884813e-7,0.000114830895,0.0070670075],"genre_scores_gemma":[0.93963456,0.0000030098538,0.060095124,0.00020385023,0.0000220018,0.000009480695,3.5513997e-7,0.000007513973,0.000024089039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969654,0.00021979162,0.00024934046,0.0008931429,0.0009234337,0.0007488791],"domain_scores_gemma":[0.99811316,0.00041197168,0.000046805417,0.0010766732,0.00014287714,0.00020852612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028987662,0.00016763565,0.00020857998,0.0006847938,0.00017504078,0.0003139021,0.0032721916,0.00004984172,0.000083476276],"category_scores_gemma":[0.00010001137,0.00014240177,0.00006467288,0.0031113727,0.0017169957,0.0013317426,0.0011936148,0.00031046645,0.00036817836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010690021,0.000046188252,0.0010414515,0.0000057187235,0.0000010371464,0.000011243305,0.0002787478,0.0002464002,0.0022491822,0.97057563,0.000004553765,0.02552917],"study_design_scores_gemma":[0.00032952844,0.00021311291,0.0073293834,0.000022601616,5.1062204e-7,0.000018886354,0.0000055327628,0.38037905,0.0034101005,0.6080825,0.000035000343,0.00017383533],"about_ca_topic_score_codex":0.0000026573919,"about_ca_topic_score_gemma":0.0000011111582,"teacher_disagreement_score":0.5215671,"about_ca_system_score_codex":0.00009998499,"about_ca_system_score_gemma":0.00010138659,"threshold_uncertainty_score":0.6326342},"labels":[],"label_agreement":null},{"id":"W2970565780","doi":"10.1016/j.jctb.2019.08.001","title":"A local epsilon version of Reed's Conjecture","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Conjecture; Clique number; Degree (music); Perfect graph; Graph; Vertex (graph theory); Upper and lower bounds; Chromatic scale","score_opus":0.006527394455921615,"score_gpt":0.24898183700530913,"score_spread":0.2424544425493875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970565780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7558259,0.0008945249,0.2184164,0.0008484612,0.015621488,0.00042913793,0.0000064042624,0.00006529019,0.007892401],"genre_scores_gemma":[0.99627346,0.000035897567,0.0032078354,0.000035348152,0.000103080856,6.7708476e-7,4.13919e-7,0.000012766781,0.00033052792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979141,0.00044543087,0.00048519764,0.00017364601,0.00071895815,0.00026271315],"domain_scores_gemma":[0.9977976,0.0005238299,0.0005244975,0.00052391365,0.0004965459,0.00013359869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018926648,0.000152599,0.00043424955,0.0002417473,0.00006562637,0.000046180423,0.0013464664,0.000116274,0.00014660743],"category_scores_gemma":[0.00023367516,0.00012153816,0.00020378736,0.0004787238,0.00025992104,0.0011820969,0.00029796798,0.0004623286,0.000028512166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018285854,0.00008494212,0.0001562164,0.000030856707,0.00005362417,0.00003632916,0.00036519882,0.00025592925,0.0057077035,0.988671,0.00020452282,0.0026050685],"study_design_scores_gemma":[0.0019754174,0.0025408869,0.0001495967,0.00009142513,0.000010285318,0.00015977013,0.0003021344,0.000102346115,0.03310083,0.95234334,0.0090847,0.00013925435],"about_ca_topic_score_codex":0.0000011743793,"about_ca_topic_score_gemma":1.513404e-7,"teacher_disagreement_score":0.24044755,"about_ca_system_score_codex":0.00007465566,"about_ca_system_score_gemma":0.00019689275,"threshold_uncertainty_score":0.49561825},"labels":[],"label_agreement":null},{"id":"W2970633507","doi":"10.4230/lipics.swat.2020.12","title":"A Simple Algorithm for Minimum Cuts in Near-Linear Time","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minimum cut; Combinatorics; Simple (philosophy); Subroutine; Vertex (graph theory); Time complexity; Undirected graph; Minimum spanning tree; Spanning tree; Mathematics; Running time; Algorithm; Matching (statistics); Graph; Enhanced Data Rates for GSM Evolution; Computer science","score_opus":0.021239953373996097,"score_gpt":0.30963520775811404,"score_spread":0.28839525438411795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970633507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022614207,0.00013763017,0.96335655,0.00026857358,0.0014304067,0.007121,0.00325086,0.00039051415,0.001430259],"genre_scores_gemma":[0.043406416,0.00013513358,0.9409443,0.0018627753,0.0006614087,0.0029504278,0.0053996616,0.00038676834,0.0042531043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99373364,0.00012584051,0.0020724323,0.0010411533,0.0010490674,0.0019778674],"domain_scores_gemma":[0.9942572,0.0008061425,0.0009138348,0.0028877442,0.00074025884,0.0003947992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019451281,0.0009764981,0.0013785942,0.000836234,0.00035044062,0.0009771282,0.004877477,0.0008674651,0.000039079492],"category_scores_gemma":[0.00026471278,0.0009678542,0.0007792048,0.00067138014,0.00027219337,0.0018270444,0.0046115676,0.0016919959,0.0006271013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002060578,0.0048072427,0.008899266,0.019048871,0.0027057193,0.00015457816,0.050148185,0.06025014,0.00030315702,0.03607946,0.068141595,0.7474012],"study_design_scores_gemma":[0.0036706682,0.00037189072,0.000089158304,0.00032305223,0.000023915747,0.000023634297,0.00014179628,0.90576845,0.0003511384,0.022318669,0.06590252,0.0010150949],"about_ca_topic_score_codex":0.000020450432,"about_ca_topic_score_gemma":0.000010548169,"teacher_disagreement_score":0.8455183,"about_ca_system_score_codex":0.00041494108,"about_ca_system_score_gemma":0.00066116883,"threshold_uncertainty_score":0.9992772},"labels":[],"label_agreement":null},{"id":"W2971946515","doi":"10.20382/jocg.v6i1a1","title":"On a Conjecture of Lovász on Circle-Representations of Simple 4-Regular Planar Graphs","year":2012,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund","keywords":"Combinatorics; Planar graph; Mathematics; Conjecture; Simple (philosophy); Discrete mathematics; Realization (probability); Intersection (aeronautics); Graph","score_opus":0.018798535108596904,"score_gpt":0.2717825177839632,"score_spread":0.25298398267536626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971946515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41189817,0.00019730722,0.5848677,0.00041675335,0.00052454555,0.00030931798,0.00017475487,0.000026909083,0.001584529],"genre_scores_gemma":[0.98238075,0.00003676972,0.017285649,0.00006567258,0.000074497926,3.3651176e-7,0.000035286404,0.000018629089,0.00010242761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660116,0.00041294235,0.0006983305,0.00039057358,0.0015703839,0.00032661343],"domain_scores_gemma":[0.9944587,0.0016850532,0.0017149172,0.0006231694,0.0012538723,0.00026434145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062407146,0.00029040413,0.0007296922,0.004324762,0.00011438491,0.00004146443,0.0019849136,0.00024373307,0.000049309725],"category_scores_gemma":[0.00019249938,0.00031362218,0.0006019459,0.0020501537,0.00028753164,0.00042832608,0.0005202235,0.0010551898,0.000005872372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029944116,0.0003988921,0.0008616615,0.00013133339,0.00046868753,0.00010859616,0.00029344246,0.6005833,0.00028779943,0.39377806,0.0004387791,0.0023499804],"study_design_scores_gemma":[0.0032300495,0.00154474,0.026319403,0.0006759231,0.00020165855,0.00013239506,0.0003819074,0.00617147,0.0034689624,0.9557507,0.0014378406,0.0006849626],"about_ca_topic_score_codex":0.000017353139,"about_ca_topic_score_gemma":0.0000014200308,"teacher_disagreement_score":0.59441185,"about_ca_system_score_codex":0.0001959809,"about_ca_system_score_gemma":0.00053695665,"threshold_uncertainty_score":0.9999316},"labels":[],"label_agreement":null},{"id":"W2972155844","doi":"10.1109/focs.2019.00056","title":"Planar Graphs have Bounded Queue-Number","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Treewidth; Combinatorics; 1-planar graph; Mathematics; Planar graph; Discrete mathematics; Graph minor; Pathwidth; Book embedding; Bounded function; Partial k-tree; Line graph; Graph; Graph power","score_opus":0.017161195111059804,"score_gpt":0.29364552239270053,"score_spread":0.27648432728164074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972155844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.153037,0.000052468786,0.42806888,0.0011597443,0.0004962958,0.0004980992,0.0000027269193,0.00057960796,0.41610518],"genre_scores_gemma":[0.9206935,0.000008492441,0.04856104,0.00075501075,0.000019800058,0.000014230973,0.0000021837275,0.000015091641,0.029930614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998552,0.00007621041,0.0001388686,0.00042197946,0.0003866686,0.0004242667],"domain_scores_gemma":[0.9987142,0.00014349096,0.00003268244,0.00090942805,0.00007188353,0.00012831746],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030474897,0.00011980712,0.00013704493,0.00011136392,0.00008213273,0.00014083205,0.0011029716,0.00005309198,0.00059975305],"category_scores_gemma":[0.000020359574,0.000099773446,0.00007480771,0.00038643586,0.00007027057,0.0005938611,0.00020876636,0.00017914204,0.0037358734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008239919,0.00002214425,0.011097745,0.000005040732,0.000010957085,0.00001107862,0.00010604456,0.0000064955857,0.0006811675,0.9846136,0.0013778163,0.0020596536],"study_design_scores_gemma":[0.0004244948,0.000065171196,0.0022466786,0.000007718905,0.0000010960156,0.00003060911,0.000060540096,0.0038618026,0.0029596984,0.97603166,0.014073306,0.00023721303],"about_ca_topic_score_codex":0.000043514385,"about_ca_topic_score_gemma":0.000031460244,"teacher_disagreement_score":0.76765656,"about_ca_system_score_codex":0.000026936852,"about_ca_system_score_gemma":0.000046202007,"threshold_uncertainty_score":0.99703985},"labels":[],"label_agreement":null},{"id":"W2972279619","doi":"10.48550/arxiv.1909.03597","title":"Strongly chordal digraphs and $\\Gamma$-free matrices.","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Bipartite graph; Mathematics; Indifference graph; Discrete mathematics; Time complexity; Treewidth; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.04969575684285609,"score_gpt":0.203784953386401,"score_spread":0.15408919654354492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972279619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37848198,0.0006126531,0.6137963,0.0001368547,0.0005758394,0.0006258936,0.00005098761,0.0003649643,0.0053545637],"genre_scores_gemma":[0.9925998,0.00072225666,0.0034718541,0.00003480542,0.0000587413,0.0000015040797,0.0000091397515,0.000029093258,0.0030727999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970821,0.00020434218,0.00020471001,0.0016469582,0.00021168469,0.0006502174],"domain_scores_gemma":[0.9960813,0.0002452624,0.00022571885,0.002964104,0.00018016662,0.0003034409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003936901,0.00041249607,0.00042714766,0.0006697966,0.00017998999,0.00024593587,0.0044901143,0.00031404675,0.000026309624],"category_scores_gemma":[0.000065337335,0.00046734978,0.0002179019,0.0009734152,0.0002945207,0.0007504623,0.0079563875,0.0010396863,0.00010377215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099878256,0.00010439684,0.017327722,0.00022370282,0.00017943235,0.00047637444,0.00021563617,0.07189904,0.000057630743,0.90630174,0.0006522275,0.0024622423],"study_design_scores_gemma":[0.0019053504,0.00020995321,0.007960019,0.00015161575,0.000079742844,0.000021671896,0.00013365273,0.28246352,0.00016150597,0.7031992,0.0024427674,0.001271],"about_ca_topic_score_codex":0.00007942679,"about_ca_topic_score_gemma":0.000025440331,"teacher_disagreement_score":0.61411786,"about_ca_system_score_codex":0.00013563108,"about_ca_system_score_gemma":0.00019883056,"threshold_uncertainty_score":0.9997778},"labels":[],"label_agreement":null},{"id":"W2972297693","doi":"10.37236/8992","title":"The Smallest Matroids with no Large Independent Flat","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Mathematics; Rank (graph theory); Element (criminal law); Simple (philosophy); Pairwise comparison; Binary number; Discrete mathematics; Statistics; Arithmetic","score_opus":0.008361064287272681,"score_gpt":0.25411332881074344,"score_spread":0.24575226452347076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972297693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12790008,0.035126608,0.8264515,0.004830922,0.003134859,0.0006873179,0.0000026576986,0.000072605784,0.0017934635],"genre_scores_gemma":[0.99278486,0.005563559,0.00027390436,0.000085212996,0.00018752327,0.000016855198,0.0000015103682,0.000042734147,0.0010438616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948521,0.0007852123,0.0006759306,0.0003969813,0.0018576776,0.001432092],"domain_scores_gemma":[0.99463737,0.00076831045,0.0009989475,0.0018801832,0.0015385413,0.00017663985],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0052374164,0.00039534323,0.0005394213,0.00016762293,0.00067044725,0.0007971647,0.0068229465,0.00019657335,0.000010393318],"category_scores_gemma":[0.00021710228,0.00020696562,0.00033698286,0.0007454347,0.00018115375,0.00026430242,0.0026528463,0.005964436,0.000014116562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012811269,0.00010037423,0.00017439474,0.000024986739,0.0003789212,0.00012592386,0.00035393375,0.0004907466,0.00006597575,0.9973286,0.00024112464,0.00058694475],"study_design_scores_gemma":[0.0011720966,0.0009604974,0.00021415605,0.0001537361,0.00006427254,0.0009047893,0.00025639022,0.001510232,0.0007253451,0.98626024,0.0074284915,0.00034974617],"about_ca_topic_score_codex":0.000004919535,"about_ca_topic_score_gemma":0.000044980374,"teacher_disagreement_score":0.86488473,"about_ca_system_score_codex":0.0008243613,"about_ca_system_score_gemma":0.0034376543,"threshold_uncertainty_score":0.9985506},"labels":[],"label_agreement":null},{"id":"W2973098730","doi":"10.4230/lipics.mfcs.2020.20","title":"Homomorphisms of signed graphs: An update","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Grantová Agentura, Univerzita Karlova; European Commission; Univerzita Karlova v Praze","keywords":"Signed graph; Combinatorics; Homomorphism; Graph homomorphism; Mathematics; Discrete mathematics; Adjacency list; Graph; Line graph; Graph power","score_opus":0.024735935971948956,"score_gpt":0.2980308278716488,"score_spread":0.27329489189969985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973098730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12814486,0.00019595091,0.8595405,0.00020604214,0.0021853363,0.0039434014,0.0022172816,0.00050851254,0.0030580573],"genre_scores_gemma":[0.8563431,0.00019110375,0.13981827,0.00071049936,0.00013506536,0.00040186083,0.0019155054,0.00015297277,0.00033165773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99382406,0.00020775529,0.0022042063,0.00091041514,0.0014288994,0.0014246706],"domain_scores_gemma":[0.9919629,0.0003023687,0.0016000231,0.0045744693,0.0010825089,0.0004777124],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001817307,0.00094697054,0.001409711,0.0012344994,0.00028271857,0.0006532608,0.007038863,0.00078254624,0.00005022876],"category_scores_gemma":[0.00014608011,0.00089786964,0.0007905806,0.00076424313,0.00047443167,0.002906528,0.004757823,0.0016279061,0.00022569424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087203644,0.0021386936,0.0031574434,0.008727442,0.0014955271,0.00004210215,0.015850237,0.011604701,0.0008563139,0.90857995,0.004473557,0.042201996],"study_design_scores_gemma":[0.008398527,0.0022792493,0.00084082596,0.0015168049,0.00018413863,0.00012505517,0.0014015295,0.38533217,0.011563999,0.56021655,0.024167266,0.003973871],"about_ca_topic_score_codex":0.00001799024,"about_ca_topic_score_gemma":0.000007535707,"teacher_disagreement_score":0.7281982,"about_ca_system_score_codex":0.00017282047,"about_ca_system_score_gemma":0.00040688674,"threshold_uncertainty_score":0.9993472},"labels":[],"label_agreement":null},{"id":"W2978207776","doi":"10.1016/j.entcs.2019.08.033","title":"On Coloring a Class of Claw-free Graphs","year":2019,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cograph; Chordal graph; Split graph; Graph coloring; 1-planar graph; Discrete mathematics; Line graph; Pathwidth; Vertex (graph theory); Edge coloring; Indifference graph; Graph; Graph power","score_opus":0.007934784732203454,"score_gpt":0.27098712578760303,"score_spread":0.2630523410553996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978207776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38406417,0.000054172644,0.6124892,0.00046847298,0.00029226695,0.00032127846,7.9275424e-7,0.00008326439,0.0022263525],"genre_scores_gemma":[0.9696909,0.000010773406,0.029992353,0.00025315714,0.000019650977,0.000013775358,2.4849987e-7,0.000012434689,0.0000067038945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957421,0.00023274196,0.00039469934,0.0010333087,0.0011765361,0.0014206426],"domain_scores_gemma":[0.9956101,0.0019436905,0.00010165722,0.0020035682,0.00016581774,0.00017515948],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0030329106,0.00023156193,0.00034944463,0.0007105001,0.0001385903,0.00012982824,0.0059187664,0.000078518206,0.00004475909],"category_scores_gemma":[0.00054205867,0.0002018151,0.00010476271,0.003441275,0.0023496414,0.0006318927,0.0017928624,0.00072046265,0.00006518716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052449857,0.00009915306,0.000452522,0.0000114856375,0.0000044534017,0.0000064842134,0.00014001201,0.0018935574,0.0026587637,0.9824999,0.0000026270052,0.012178577],"study_design_scores_gemma":[0.0005198424,0.0010210298,0.00044337878,0.00005073629,9.3075033e-7,0.00001057483,0.0000020132186,0.19296768,0.021748777,0.7830309,0.00001910405,0.0001849791],"about_ca_topic_score_codex":0.0000031846719,"about_ca_topic_score_gemma":0.0000037642976,"teacher_disagreement_score":0.5856267,"about_ca_system_score_codex":0.00025566813,"about_ca_system_score_gemma":0.00036891553,"threshold_uncertainty_score":0.9994597},"labels":[],"label_agreement":null},{"id":"W2978231573","doi":"10.1017/9781316105450.008","title":"Mutualism, Parasitism and Bipartite Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Bipartite graph; Mutualism (biology); Parasitism; Computer science; Combinatorics; Mathematics; Theoretical computer science; Biology; Graph; Ecology","score_opus":0.03334736885314788,"score_gpt":0.2484087533612401,"score_spread":0.21506138450809223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978231573","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013844104,0.0004153113,0.012107412,0.000041397157,0.00023150351,0.0003740352,0.00011407526,0.00023320725,0.98634464],"genre_scores_gemma":[0.0018867046,0.00041043703,0.0010585239,0.000055328685,0.00005032747,0.0000011625765,0.000010951622,0.000037091682,0.99648947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980062,0.0000702123,0.00016072244,0.000897254,0.00040634608,0.00045925073],"domain_scores_gemma":[0.9973122,0.00012731044,0.0002618754,0.0017814868,0.00017065753,0.00034650814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020980163,0.00039965953,0.00042803632,0.00036925962,0.00061753066,0.0002609198,0.0021684023,0.00032090215,0.0000017848446],"category_scores_gemma":[0.00001819347,0.00047148665,0.00018358366,0.000008883043,0.00085321633,0.00048181877,0.0017634281,0.00060935924,0.000021025551],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002552751,0.000004156302,0.0000033406493,0.000038328257,0.000078469064,0.00081088766,0.0000663359,6.030588e-7,0.00003967794,0.9882144,0.0039635226,0.0067547685],"study_design_scores_gemma":[0.00059661485,0.00007777559,0.000064118074,0.00017045025,0.00005412346,0.00007705712,0.0000063672546,0.00020862966,0.0002821596,0.0053748246,0.9924436,0.0006442709],"about_ca_topic_score_codex":0.000056706645,"about_ca_topic_score_gemma":0.0000033647555,"teacher_disagreement_score":0.9884801,"about_ca_system_score_codex":0.00007171327,"about_ca_system_score_gemma":0.000096203556,"threshold_uncertainty_score":0.9997737},"labels":[],"label_agreement":null},{"id":"W2978598014","doi":"10.1002/jgt.22499","title":"The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"FP7 Ideas: European Research Council; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Split graph; Chordal graph; Induced path; Discrete mathematics; Cograph; Induced subgraph; Independent set; Indifference graph; Pathwidth; Block graph; Perfect graph; Modular decomposition; 1-planar graph; Graph; Longest path problem; Line graph; Vertex (graph theory)","score_opus":0.010213124396099182,"score_gpt":0.2832368930464169,"score_spread":0.27302376865031774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978598014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7129414,0.008484902,0.27244565,0.0017536494,0.0018312688,0.0004750712,0.00001083124,0.000053643616,0.0020035862],"genre_scores_gemma":[0.9872806,0.0009959408,0.011259581,0.00016163393,0.00006629687,0.0000043251744,4.6508814e-7,0.000023034638,0.0002081133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728745,0.00066743785,0.0006562179,0.0002495788,0.0007527268,0.00038658333],"domain_scores_gemma":[0.9959543,0.0016020107,0.0006364158,0.00095695123,0.0006707632,0.00017958567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039789546,0.00018971697,0.0003731655,0.0005210926,0.00029120324,0.00016609202,0.002360195,0.000083225044,0.000013496695],"category_scores_gemma":[0.00021113949,0.0001246186,0.0002659114,0.00086370826,0.00067252584,0.0008468077,0.00041885578,0.00049689156,0.0000058141854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024505955,0.00007551679,0.0016641438,0.00002463743,0.00014106631,0.000020108639,0.00036171783,0.000041137664,0.003303888,0.97656214,0.0002716937,0.017288873],"study_design_scores_gemma":[0.0009887,0.00046461922,0.003476475,0.00008426204,0.000018017417,0.00031130546,0.0003142858,0.00033976795,0.0027606795,0.98973346,0.0013579398,0.00015050254],"about_ca_topic_score_codex":0.0000018972061,"about_ca_topic_score_gemma":0.0000034621385,"teacher_disagreement_score":0.27433923,"about_ca_system_score_codex":0.000030355055,"about_ca_system_score_gemma":0.000118446835,"threshold_uncertainty_score":0.5081799},"labels":[],"label_agreement":null},{"id":"W2979763194","doi":"10.48550/arxiv.1910.05478","title":"Transversal polynomial of r-fold covers","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Transversal (combinatorics); Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.0657120579449282,"score_gpt":0.20741107247876622,"score_spread":0.14169901453383804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979763194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28906986,0.00005586438,0.7042886,0.000063527004,0.0007333045,0.00038907217,0.000050089402,0.00013951364,0.0052101766],"genre_scores_gemma":[0.996391,0.00010297265,0.0012631351,0.000035183482,0.000038535465,4.6767994e-7,0.000008228356,0.000020890302,0.0021395602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785805,0.00019932039,0.00022003202,0.0010748266,0.0001862566,0.00046151452],"domain_scores_gemma":[0.9974496,0.00022449714,0.00023848435,0.0017435863,0.00016643167,0.0001774042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031659473,0.00030056894,0.00045191924,0.00045491598,0.000072091505,0.000047209778,0.0031848894,0.00030941417,0.000051587507],"category_scores_gemma":[0.000030500849,0.00036087297,0.0003733639,0.0007020082,0.0002691743,0.0004632643,0.0017738469,0.0007249277,0.000096355674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039038152,0.00018647642,0.004649227,0.0002217579,0.00028716403,0.0002969146,0.00053657667,0.5025027,0.001704036,0.48755494,0.0008221887,0.0008476383],"study_design_scores_gemma":[0.0044622086,0.0005676937,0.0019065888,0.0003162532,0.00017366301,0.000012851241,0.00031500746,0.81432056,0.012785084,0.15937907,0.0038211907,0.0019398493],"about_ca_topic_score_codex":0.000103901606,"about_ca_topic_score_gemma":0.0000108662125,"teacher_disagreement_score":0.70732117,"about_ca_system_score_codex":0.00018956045,"about_ca_system_score_gemma":0.00040707728,"threshold_uncertainty_score":0.9998843},"labels":[],"label_agreement":null},{"id":"W2980714832","doi":"10.5614/ejgta.2019.7.2.10","title":"Exponent-critical primitive graphs and the Kronecker product","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Exponent; Mathematics; Combinatorics; Critical exponent; Kronecker product; Kronecker delta; Graph; Discrete mathematics; Product (mathematics); Physics; Geometry","score_opus":0.00595558774374082,"score_gpt":0.267807855989703,"score_spread":0.2618522682459622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980714832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21300757,0.02523292,0.75354046,0.0051397863,0.00009867045,0.0011922357,0.0000031713903,0.000040198553,0.0017450122],"genre_scores_gemma":[0.9968751,0.0017103005,0.0010388263,0.00014420437,0.00003589487,0.000051203413,3.6376596e-7,0.000008532608,0.00013555422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831486,0.00048966514,0.00027216517,0.00026851625,0.0002437839,0.00041102662],"domain_scores_gemma":[0.9977789,0.0013848954,0.00014196677,0.00041920485,0.00017390914,0.00010112928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032147765,0.00012424789,0.0002117367,0.00018080464,0.00026873188,0.0000849462,0.0006103104,0.00003108082,0.000011600816],"category_scores_gemma":[0.00013152201,0.00007934408,0.00009820832,0.00048656366,0.0007843368,0.00042621486,0.00013065887,0.00057606894,0.0000076825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017694672,0.000045325116,0.00010455397,0.000007649921,0.000053179436,7.348039e-7,0.0003197435,0.0000035962796,0.0013443452,0.97955346,0.000008243831,0.01838225],"study_design_scores_gemma":[0.0007835881,0.0001537414,0.00041864027,0.000013624746,0.000022711398,0.00023872519,0.00024987114,0.000041141542,0.0009254249,0.9950133,0.0020427448,0.00009649386],"about_ca_topic_score_codex":5.1351356e-7,"about_ca_topic_score_gemma":6.588891e-7,"teacher_disagreement_score":0.78386754,"about_ca_system_score_codex":0.00001994277,"about_ca_system_score_gemma":0.000110934205,"threshold_uncertainty_score":0.32355574},"labels":[],"label_agreement":null},{"id":"W2981501323","doi":"10.1002/net.21916","title":"A strong formulation for the graph partition problem","year":2019,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Mathematics; Graph; Partition (number theory); Graph partition; Polynomial; Arc (geometry); Combinatorics; Discrete mathematics; Applied mathematics; Mathematical analysis","score_opus":0.021722439373429485,"score_gpt":0.28571800753224563,"score_spread":0.26399556815881614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981501323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022079078,0.0001570492,0.99538445,0.00035942846,0.00020066199,0.0007810206,6.1926346e-7,0.00007337547,0.00083545933],"genre_scores_gemma":[0.98620844,0.000014493894,0.013165066,0.00009291939,0.000096555894,0.00014294931,0.000004768278,0.000007399912,0.0002673964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992463,0.00003517756,0.00010314834,0.00019207782,0.00014865298,0.00027464668],"domain_scores_gemma":[0.99914265,0.00032208127,0.000047507037,0.00038981732,0.000066530614,0.000031430147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042661908,0.00006316731,0.00006183014,0.000036499372,0.00014789333,0.00008400534,0.00042472323,0.000040158044,0.000010752114],"category_scores_gemma":[0.000008834444,0.00004357126,0.00005760224,0.00029335072,0.000014686348,0.00040286608,0.00008199357,0.00011570903,0.000017361428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019076533,0.000009539561,0.0007827341,0.0000060477396,0.00000943756,1.3334488e-7,0.0000650118,0.1463214,0.00004254255,0.80133533,0.00044589443,0.050962847],"study_design_scores_gemma":[0.0002348571,0.000074109674,0.0010632285,0.000009884436,0.0000022142506,9.888672e-7,0.0000095075475,0.84579295,0.000048176822,0.14958112,0.0031226578,0.00006028796],"about_ca_topic_score_codex":0.0000018323349,"about_ca_topic_score_gemma":0.000007009901,"teacher_disagreement_score":0.98400056,"about_ca_system_score_codex":0.000016866514,"about_ca_system_score_gemma":0.000012295508,"threshold_uncertainty_score":0.17767845},"labels":[],"label_agreement":null},{"id":"W2981502292","doi":"","title":"Clustered colouring in minor-closed classes","year":2019,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Monochromatic color; Friendship graph; Graph; Minor (academic); Chromatic scale; Windmill graph; Discrete mathematics; Petersen graph; Graph power; Line graph; Botany","score_opus":0.02853874918420808,"score_gpt":0.2674424312945282,"score_spread":0.23890368211032015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981502292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8583686,0.00004463078,0.06476098,0.0011654949,0.00011120973,0.0011678386,0.00006961243,0.00014680033,0.07416487],"genre_scores_gemma":[0.955899,0.00055758416,0.03314215,0.000023735938,0.00001822321,3.7241185e-7,0.000024721028,0.000024514962,0.0103096925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99489903,0.0011418979,0.00021950253,0.0010612388,0.001287893,0.0013904196],"domain_scores_gemma":[0.9963148,0.0012346682,0.00017289072,0.0013612584,0.00045656666,0.00045979908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015587193,0.00028578957,0.0005437052,0.0026407267,0.0006246812,0.00007476322,0.004948133,0.00017468054,0.00023691813],"category_scores_gemma":[0.00012908579,0.0003798456,0.00025445243,0.0030864954,0.0009767863,0.0019713042,0.0042074732,0.0012421608,0.00008231246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006098829,0.0016558634,0.26488376,0.00085572735,0.00044590016,0.0036189249,0.014866256,0.0025983804,0.025985949,0.62729585,0.003505143,0.04818941],"study_design_scores_gemma":[0.019304758,0.0041103824,0.2692777,0.0008430013,0.00004672213,0.00007750738,0.051052764,0.11135729,0.0018422445,0.09635444,0.44329426,0.0024389399],"about_ca_topic_score_codex":0.00056934723,"about_ca_topic_score_gemma":0.0019364015,"teacher_disagreement_score":0.5309414,"about_ca_system_score_codex":0.0005072092,"about_ca_system_score_gemma":0.0005889233,"threshold_uncertainty_score":0.99986535},"labels":[],"label_agreement":null},{"id":"W2981554314","doi":"10.19086/aic.10256","title":"The Structure of Binary Matroids with no Induced Claw or Fano Plane Restriction","year":2019,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Conjecture; Discrete mathematics; Binary tree; Vector space; Natural number; Integer (computer science); Computer science","score_opus":0.009253713542886184,"score_gpt":0.2763743689459909,"score_spread":0.2671206554031047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981554314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871199,0.0013804317,0.005936641,0.00017562885,0.0019932045,0.00073911704,0.000008429771,0.000114416456,0.0025322244],"genre_scores_gemma":[0.99598753,0.0008810884,0.002762006,0.00002225609,0.000018195306,0.000008266073,0.0000027355386,0.000015928748,0.00030199863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822277,0.00014143143,0.0002919033,0.0003797881,0.00057534344,0.00038875575],"domain_scores_gemma":[0.9979123,0.0007365666,0.0001954442,0.0009009924,0.00019471886,0.000059981252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025633667,0.00017270743,0.00023297411,0.00017732337,0.00013470027,0.00004940775,0.0012856124,0.00008691594,0.000007716694],"category_scores_gemma":[0.00010862349,0.00010456876,0.000029501267,0.0017574969,0.00011634894,0.0010173644,0.0002629199,0.00045267644,0.000015637084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005778807,0.00010676458,0.018518616,0.000099428355,0.000016098393,0.00003816003,0.00016346532,0.0015297848,0.011326336,0.9618569,0.000049154605,0.0057174],"study_design_scores_gemma":[0.0043864218,0.00666295,0.012893805,0.00027844447,0.000010061816,0.00008001071,0.00039494195,0.0060820607,0.02896107,0.91001976,0.029341936,0.0008885663],"about_ca_topic_score_codex":0.000008974241,"about_ca_topic_score_gemma":0.000030462954,"teacher_disagreement_score":0.05183718,"about_ca_system_score_codex":0.0001010318,"about_ca_system_score_gemma":0.00011827151,"threshold_uncertainty_score":0.42641902},"labels":[],"label_agreement":null},{"id":"W2982592349","doi":"","title":"Guarding isometric subgraphs and Lazy Cops and Robbers","year":2019,"lang":"en","type":"article","venue":"Acta Mathematica Universitatis Comenianae","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Isometric exercise; Computer science; Computer security; Mathematics; Medicine; Physical therapy","score_opus":0.00905875634261839,"score_gpt":0.22721290579544057,"score_spread":0.2181541494528222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982592349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92336917,0.00032703183,0.059023123,0.0016233815,0.00009933625,0.00055447785,0.000007919756,0.00018425898,0.014811294],"genre_scores_gemma":[0.93172634,0.00012790342,0.06693803,0.00006687532,0.0000039381503,0.0000024067806,0.0000011303881,0.000014294832,0.0011190836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860835,0.00009184095,0.000161494,0.00043824027,0.00032397246,0.00037610033],"domain_scores_gemma":[0.9981719,0.0009151011,0.000091410075,0.00056100276,0.00006855725,0.00019197783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037396958,0.00017577884,0.00028812003,0.0008066213,0.00017597672,0.00015557052,0.00065240107,0.000055217773,0.00007501276],"category_scores_gemma":[0.00008795279,0.00017372958,0.000045192308,0.001396204,0.00015195648,0.0011260737,0.00058204425,0.00016766172,0.00006119669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013448771,0.000049119666,0.0060816496,0.00019404432,0.000121515215,0.0000413284,0.0038364846,0.0000055904693,0.0014606735,0.97789395,0.0006877856,0.009614396],"study_design_scores_gemma":[0.007615671,0.0016654999,0.039101403,0.00051601825,0.00015437527,0.00041474166,0.015432455,0.06042713,0.001022725,0.86142313,0.00959445,0.0026324168],"about_ca_topic_score_codex":0.000007387113,"about_ca_topic_score_gemma":0.0000027058372,"teacher_disagreement_score":0.11647085,"about_ca_system_score_codex":0.000053164476,"about_ca_system_score_gemma":0.000026443928,"threshold_uncertainty_score":0.70844865},"labels":[],"label_agreement":null},{"id":"W2983894478","doi":"10.1002/jgt.22705","title":"Edge‐maximal graphs on orientable and some nonorientable surfaces","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Klein bottle; Combinatorics; Mathematics; Torus; Graph; Triangulation; Surface (topology); Projective plane; Discrete mathematics; Geometry","score_opus":0.019268193896181503,"score_gpt":0.2821031157012648,"score_spread":0.2628349218050833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983894478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8866154,0.018969132,0.08555374,0.00050588,0.0057499083,0.00045251095,0.000027823824,0.000099401346,0.0020261952],"genre_scores_gemma":[0.9661826,0.0047969874,0.027445719,0.00042277493,0.00034494,0.00002081467,0.000008119532,0.00007955149,0.00069847517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526674,0.0010126313,0.00092570175,0.0008425896,0.0011985387,0.0007538093],"domain_scores_gemma":[0.99549985,0.0010130587,0.0009996814,0.0013159422,0.000702283,0.00046916492],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004226746,0.0005300181,0.0009817707,0.0013142163,0.0003347662,0.0007399625,0.0024528839,0.0003160575,0.0000612754],"category_scores_gemma":[0.00034711265,0.00045298156,0.00057831395,0.0009172142,0.000495683,0.001522236,0.0021940074,0.0023208812,0.0000072285943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048683275,0.00044534655,0.0014461804,0.00019283652,0.00049021386,0.0005380661,0.0013208139,0.0026721365,0.0013643021,0.9821289,0.0006152694,0.008299113],"study_design_scores_gemma":[0.00082322536,0.0005755994,0.0010208981,0.0005503601,0.000056029687,0.00027091123,0.0005608777,0.00030297032,0.00477975,0.9897216,0.0008389372,0.0004988162],"about_ca_topic_score_codex":0.000008823136,"about_ca_topic_score_gemma":0.000003034557,"teacher_disagreement_score":0.07956721,"about_ca_system_score_codex":0.000113426024,"about_ca_system_score_gemma":0.00048596822,"threshold_uncertainty_score":0.9999808},"labels":[],"label_agreement":null},{"id":"W2985832939","doi":"10.1002/jgt.22736","title":"Matchings in 1‐planar graphs with large minimum degree","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Degree (music); Mathematics; Planar graph; Planar; Matching (statistics); 1-planar graph; Discrete mathematics; Graph; Chordal graph; Computer science; Physics; Statistics","score_opus":0.02410745607518017,"score_gpt":0.28479148291433015,"score_spread":0.26068402683915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985832939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49643245,0.005203693,0.49506906,0.0006201398,0.00092349894,0.00033021386,0.000015550324,0.000059954884,0.0013454616],"genre_scores_gemma":[0.932191,0.0008748334,0.06614899,0.00042098077,0.000112195165,0.000018854795,0.0000063129296,0.00006934565,0.0001574476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994844,0.0013065708,0.0010428514,0.0006985324,0.0012877802,0.00082021824],"domain_scores_gemma":[0.9957478,0.00077861996,0.0011304104,0.0013920869,0.0006230668,0.00032799243],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0057139685,0.00050583127,0.0010258128,0.0022351835,0.00013806904,0.00036978212,0.0037465068,0.00033032117,0.000040819108],"category_scores_gemma":[0.00023064256,0.00039610433,0.0005995567,0.0015135647,0.00027055995,0.0008651686,0.0011524179,0.0032613582,0.0000049076575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001188808,0.00087081344,0.009865828,0.00040512937,0.00076098874,0.008247628,0.0063560847,0.00084606215,0.0012951179,0.9571098,0.0004099268,0.012643818],"study_design_scores_gemma":[0.001380094,0.0003291348,0.005567689,0.0012010542,0.000039955314,0.00085166737,0.0009424733,0.0001302401,0.00059472024,0.9882372,0.00021363594,0.00051212194],"about_ca_topic_score_codex":0.000008830713,"about_ca_topic_score_gemma":0.00007199944,"teacher_disagreement_score":0.4357586,"about_ca_system_score_codex":0.000113367845,"about_ca_system_score_gemma":0.0006481761,"threshold_uncertainty_score":0.9998491},"labels":[],"label_agreement":null},{"id":"W2988018498","doi":"10.1016/j.dam.2019.10.002","title":"A class of spectral bounds for Max <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e5114\" altimg=\"si111.svg\"><mml:mi>k</mml:mi></mml:math>-Cut","year":2019,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Adjacency matrix; Eigenvalues and eigenvectors; Class (philosophy); Combinatorics; Enhanced Data Rates for GSM Evolution; Adjacency list; Simple (philosophy); Mathematics; Matrix (chemical analysis); Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Graph; Physics","score_opus":0.020254356451401678,"score_gpt":0.27078287879754376,"score_spread":0.2505285223461421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988018498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88299644,0.0002238763,0.10489367,0.00029001734,0.0006957654,0.0006302254,0.000355468,0.00020986272,0.009704686],"genre_scores_gemma":[0.9057494,0.00016557542,0.091663666,0.00027870495,0.00043867133,0.0006158655,0.00020816711,0.00031500275,0.0005649435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935432,0.000080963546,0.0015449291,0.0013393513,0.0017334757,0.0017580483],"domain_scores_gemma":[0.9938443,0.0013779061,0.0013308765,0.0027878631,0.000177021,0.00048203513],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017245425,0.0008036765,0.00080046395,0.00029557987,0.000564778,0.0006586444,0.0026447207,0.00070266693,0.00007831464],"category_scores_gemma":[0.00029315645,0.0008890329,0.00084755744,0.0008074866,0.00093895855,0.0006885716,0.0015978541,0.0009485243,0.001646679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038560177,0.00038559255,0.0000041600456,0.0027918539,0.00042541424,0.00005601344,0.0034852508,0.0005567504,0.008786489,0.98178595,0.00027334705,0.0010635455],"study_design_scores_gemma":[0.0013944329,0.00079391757,0.000010398672,0.00055530516,0.00025885072,0.000121178775,0.0016889266,0.87276447,0.018276015,0.10141934,0.001925675,0.00079149846],"about_ca_topic_score_codex":0.000027360687,"about_ca_topic_score_gemma":0.00003788123,"teacher_disagreement_score":0.8803666,"about_ca_system_score_codex":0.000057535166,"about_ca_system_score_gemma":0.0005600361,"threshold_uncertainty_score":0.99935603},"labels":[],"label_agreement":null},{"id":"W2989790471","doi":"10.1145/3470867","title":"The Complexity of Promise SAT on Non-Boolean Domains","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Unary operation; Constraint satisfaction problem; Cover (algebra); Algebraic number; Constraint satisfaction; Fragment (logic); Theory of computation; Benchmark (surveying)","score_opus":0.04378162892982987,"score_gpt":0.31766652297091275,"score_spread":0.27388489404108285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989790471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016395494,0.00003886478,0.9794679,0.0021010512,0.00031347873,0.00029015372,0.000014806932,0.00011484532,0.0012633974],"genre_scores_gemma":[0.95958555,0.000026630543,0.03944494,0.00026560115,0.000020002186,0.000035419445,0.000006494564,0.000017654966,0.00059770053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977918,0.0006747392,0.00032242274,0.00042022858,0.0004960952,0.0002947067],"domain_scores_gemma":[0.9959033,0.0023706986,0.000119054006,0.0012143361,0.00029098132,0.00010162744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819313,0.00016719224,0.00018673306,0.00015913713,0.00069525174,0.00009686829,0.0010723236,0.00005526237,0.00003614458],"category_scores_gemma":[0.00015072744,0.0001342295,0.00016206542,0.0007961213,0.0005851983,0.00022835522,0.00004227322,0.0003569853,0.00009161579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022643745,0.0003517567,0.0000060690663,0.000020185838,0.00007796696,0.000014107031,0.000780782,0.029258873,0.0013995672,0.7008773,0.000039122348,0.2669478],"study_design_scores_gemma":[0.0006974584,0.00023965212,0.00084204186,0.000040772895,0.000009809805,0.00001578556,0.00026529605,0.017563492,0.0338545,0.94605845,0.0002527987,0.00015995835],"about_ca_topic_score_codex":0.000002608762,"about_ca_topic_score_gemma":0.000013723243,"teacher_disagreement_score":0.94319004,"about_ca_system_score_codex":0.00006940599,"about_ca_system_score_gemma":0.00014624499,"threshold_uncertainty_score":0.547372},"labels":[],"label_agreement":null},{"id":"W2990687474","doi":"10.1016/j.dam.2019.11.005","title":"Complexity of correspondence <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e421\" altimg=\"si177.svg\"><mml:mi>H</mml:mi></mml:math>-colourings","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scalable Vector Graphics; Combinatorics; Algorithm; Discrete mathematics; Computer science; World Wide Web","score_opus":0.02671753300352836,"score_gpt":0.27295696963847255,"score_spread":0.2462394366349442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990687474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90554243,0.00006437732,0.08700949,0.0001367064,0.00028145203,0.00023689761,0.00006548925,0.00020915896,0.006454026],"genre_scores_gemma":[0.9091181,0.000042571282,0.08998042,0.00020993673,0.000092876864,0.00020216644,0.00005180171,0.000105946325,0.0001961496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960538,0.0000655981,0.0008577102,0.000810051,0.0013180277,0.0008947821],"domain_scores_gemma":[0.9959396,0.00087855395,0.00077849935,0.002011102,0.00010877571,0.00028343924],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011992531,0.00042468656,0.00043738904,0.0001874815,0.00033345362,0.00026751694,0.0022865834,0.00031572834,0.00006337569],"category_scores_gemma":[0.00024248629,0.00045633857,0.0003228326,0.00062294526,0.0007545024,0.000538105,0.0017040182,0.00061960326,0.0016412828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001409868,0.00017101338,0.000008022697,0.0006896768,0.000099894234,0.000042343814,0.0019463479,0.00038625725,0.010121641,0.9857584,0.00010116376,0.0005342535],"study_design_scores_gemma":[0.00064039114,0.00027746137,0.000052474865,0.00027654332,0.00005935234,0.00008829546,0.00075307157,0.873514,0.022481294,0.10082701,0.00055504043,0.00047505053],"about_ca_topic_score_codex":0.000028069939,"about_ca_topic_score_gemma":0.000016371923,"teacher_disagreement_score":0.8849314,"about_ca_system_score_codex":0.000026131673,"about_ca_system_score_gemma":0.00022507895,"threshold_uncertainty_score":0.9997888},"labels":[],"label_agreement":null},{"id":"W2990814010","doi":"10.4230/lipics.isaac.2019.46","title":"A 21/16-Approximation for the Minimum 3-Path Partition Problem","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Approximation algorithm; Combinatorics; Partition (number theory); Partition problem; Mathematics; Graph partition; Greedy algorithm; Discrete mathematics; Graph; Algorithm","score_opus":0.017539987755028318,"score_gpt":0.27483009011971604,"score_spread":0.25729010236468774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990814010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035805125,0.000056482946,0.9536964,0.0009559255,0.00062645087,0.005117531,0.00020871735,0.0002450986,0.0032882283],"genre_scores_gemma":[0.8507239,0.00005075777,0.14250576,0.0014360588,0.00022508625,0.002320796,0.0004884135,0.00008299801,0.0021662249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997104,0.0000603924,0.0008933801,0.00037248014,0.0006466478,0.0009230862],"domain_scores_gemma":[0.9970558,0.0006107218,0.00044550712,0.0012610592,0.00047086008,0.00015603851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014972632,0.00033852473,0.00034605933,0.0002324873,0.0005025902,0.00056376366,0.0017390762,0.00016511357,0.000029868339],"category_scores_gemma":[0.00013411941,0.00024732316,0.0002907196,0.0005122035,0.00012807707,0.0027229947,0.0004429733,0.00035050345,0.00028077618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066464674,0.0006418076,0.0032188436,0.0024143523,0.0003640109,0.0000017302592,0.014524281,0.0017527625,0.0009222183,0.8730126,0.013166091,0.08931664],"study_design_scores_gemma":[0.0053387377,0.0009615559,0.00039236146,0.00023386533,0.000042131993,0.000045374534,0.0017064824,0.7372451,0.0035405247,0.10255857,0.14712974,0.00080555904],"about_ca_topic_score_codex":0.000004409331,"about_ca_topic_score_gemma":0.000006296981,"teacher_disagreement_score":0.81491876,"about_ca_system_score_codex":0.00016525772,"about_ca_system_score_gemma":0.00010212605,"threshold_uncertainty_score":0.9999979},"labels":[],"label_agreement":null},{"id":"W2990922105","doi":"10.1016/j.dam.2019.11.011","title":"On the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e20\" altimg=\"si30.svg\"> <mml:msub> <mml:mrow> <mml:mi>P</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>3</mml:mn> </mml:mrow> </mml:msub> </mml:math> -hull number of Hamming graphs","year":2019,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; Javna Agencija za Raziskovalno Dejavnost RS; Consejo Nacional de Investigaciones Científicas y Técnicas; Providence Health Care","keywords":"Convex hull; Cartesian product; Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Graph; Regular polygon; Discrete mathematics; Computer science; Geometry; Database","score_opus":0.01917206347645122,"score_gpt":0.2609959298693984,"score_spread":0.24182386639294717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990922105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5679777,0.00047026586,0.013174028,0.0006458683,0.0015476057,0.0001663774,0.00035445724,0.0002821007,0.41538155],"genre_scores_gemma":[0.97761166,0.0006292308,0.016574582,0.0011780091,0.0007719589,0.0012847948,0.00054268434,0.00082661747,0.00058043754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9878776,0.0004451998,0.0024512324,0.0022555871,0.003909814,0.0030605593],"domain_scores_gemma":[0.987151,0.0040060105,0.0027177809,0.00481196,0.00025080453,0.001062415],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.0035768955,0.0012244266,0.00063411775,0.0005947471,0.0015518549,0.0015381047,0.0047947266,0.001815743,0.10618314],"category_scores_gemma":[0.0013349156,0.0018121424,0.0018666545,0.0020354262,0.00238372,0.0014585817,0.0036635785,0.002392259,0.0051931185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080672046,0.0004709757,0.000009863808,0.0021963848,0.0011776265,0.00041810112,0.0047181677,0.0013632734,0.0050688866,0.94165295,0.040317863,0.0017991805],"study_design_scores_gemma":[0.001848431,0.0010811848,0.00003123325,0.0017847795,0.0008785373,0.0006713788,0.004084283,0.18674603,0.78921497,0.010133387,0.0016144417,0.0019113299],"about_ca_topic_score_codex":0.0002904137,"about_ca_topic_score_gemma":0.00026147388,"teacher_disagreement_score":0.93151957,"about_ca_system_score_codex":0.000027088838,"about_ca_system_score_gemma":0.001107057,"threshold_uncertainty_score":0.9999093},"labels":[],"label_agreement":null},{"id":"W2991049057","doi":"10.1007/978-3-030-45771-6_1","title":"Idealness of k-wise Intersecting Families","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; European Research Council; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Australian Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Element (criminal law); Ideal (ethics); Matroid; Integer (computer science); Discrete mathematics; Class (philosophy); Field (mathematics); Pure mathematics; Computer science; Law","score_opus":0.0318072301925753,"score_gpt":0.3155950046054573,"score_spread":0.283787774412882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991049057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04117156,0.00024205478,0.95481884,0.0011652064,0.001931976,0.00041983312,0.0000050757667,0.00019564694,0.000049826544],"genre_scores_gemma":[0.6379907,0.000015352445,0.36156332,0.0002826754,0.00011756623,0.000015507434,0.0000011860797,0.000013395774,2.538551e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951816,0.00023915534,0.00066447526,0.0018944924,0.0012080942,0.000812157],"domain_scores_gemma":[0.9960756,0.0010098651,0.00037419467,0.0019346589,0.00038866885,0.00021701818],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00160342,0.00043900762,0.00067743583,0.0011297357,0.00017421467,0.00041424594,0.008032224,0.0002090412,0.0000039471356],"category_scores_gemma":[0.0009170718,0.0004120542,0.00017743446,0.0037638715,0.0011638135,0.00061655336,0.012501799,0.0016161305,0.000008865108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022278988,0.00006756197,0.0015743388,0.0003312936,0.00001730329,0.000089634115,0.008005346,0.28310966,0.005131216,0.00612833,0.0000038603525,0.69551915],"study_design_scores_gemma":[0.00016963958,0.000104654704,0.0007334117,0.00034692595,0.0000024716387,0.000015190877,0.0000044750295,0.63917005,0.03807091,0.32101136,0.000007992994,0.00036288673],"about_ca_topic_score_codex":0.00009816621,"about_ca_topic_score_gemma":0.000050018578,"teacher_disagreement_score":0.6951563,"about_ca_system_score_codex":0.00020676292,"about_ca_system_score_gemma":0.00076660246,"threshold_uncertainty_score":0.9998331},"labels":[],"label_agreement":null},{"id":"W2991601398","doi":"10.5539/jmr.v11n6p84","title":"Perception of Polynomial for Weighted Directed Graph","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Directed graph; Graph; Combinatorics; Discrete mathematics; Contraction (grammar)","score_opus":0.06359058688912131,"score_gpt":0.38972845831169595,"score_spread":0.32613787142257467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991601398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6721508,0.00011661922,0.32538426,0.00047162976,0.00022908738,0.00060581684,0.000004878399,0.000024303146,0.0010125996],"genre_scores_gemma":[0.59997743,0.00008863258,0.39893875,0.000009826249,0.00010793361,0.000010823006,7.282486e-7,0.00002332951,0.0008425712],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970483,0.000272501,0.000629708,0.00017048672,0.0014585444,0.00042042506],"domain_scores_gemma":[0.99530417,0.001743503,0.00034084724,0.00053620443,0.0019321988,0.00014306583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055739596,0.00010047127,0.00036573355,0.001065799,0.000089223955,0.00007717733,0.0014974874,0.00008150427,0.00007724985],"category_scores_gemma":[0.00063173525,0.00007679687,0.00021738857,0.00096755306,0.00014247831,0.00046572965,0.00023733561,0.0004867247,0.000035191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008763351,0.0024356565,0.0020070958,0.002038753,0.00042402995,0.00003645165,0.011037653,0.000198414,0.698003,0.2141562,0.014868557,0.05391785],"study_design_scores_gemma":[0.003988956,0.0036131984,0.0017191268,0.00063596736,0.00002070515,0.0001586691,0.0036667008,0.09815389,0.040281873,0.84547406,0.0019097674,0.00037707866],"about_ca_topic_score_codex":0.00000255705,"about_ca_topic_score_gemma":6.7659175e-7,"teacher_disagreement_score":0.6577211,"about_ca_system_score_codex":0.00008662042,"about_ca_system_score_gemma":0.00021893263,"threshold_uncertainty_score":0.31316853},"labels":[],"label_agreement":null},{"id":"W2991631715","doi":"10.1016/j.tcs.2022.01.005","title":"The weighted k-center problem in trees for fixed k","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Center (category theory); Combinatorics; Mathematics; Computer science; Discrete mathematics; Crystallography; Chemistry","score_opus":0.014145522927294412,"score_gpt":0.28492772715649867,"score_spread":0.27078220422920424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991631715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011000423,0.000051370185,0.98201764,0.0041398387,0.00045763495,0.00071794854,0.000005466664,0.00012760932,0.0014820809],"genre_scores_gemma":[0.85454744,0.0000038869753,0.14467673,0.000397622,0.00004383717,0.00026520685,0.0000010606692,0.000010132903,0.000054099713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966484,0.00034897725,0.00030678094,0.00076403894,0.00096901756,0.00096278585],"domain_scores_gemma":[0.99746037,0.0012067851,0.00006240845,0.000963942,0.00013936228,0.00016715727],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.004405307,0.00015568994,0.00016498179,0.00026276545,0.0018549161,0.00040496278,0.0055911965,0.000020267878,0.000024924448],"category_scores_gemma":[0.00008758009,0.00010798088,0.00008062272,0.0022634526,0.002512155,0.00046671493,0.0031532673,0.0003668919,0.000011187927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046050172,0.000084157386,0.000099058445,0.000002432713,0.0000021781527,0.0000063889056,0.00032593313,0.0003334162,0.0002261546,0.9513416,0.00008430896,0.04744829],"study_design_scores_gemma":[0.00041790394,0.0002650724,0.00019450553,0.000004670813,5.465318e-7,0.00001848826,0.000015331429,0.40568566,0.00048937456,0.5898095,0.002977696,0.000121246645],"about_ca_topic_score_codex":0.0000013678069,"about_ca_topic_score_gemma":0.0000028044342,"teacher_disagreement_score":0.843547,"about_ca_system_score_codex":0.00015224698,"about_ca_system_score_gemma":0.00016372514,"threshold_uncertainty_score":0.99978906},"labels":[],"label_agreement":null},{"id":"W2995137628","doi":"10.1137/19m1240964","title":"A Structured Condition Number for Kemeny's Constant","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Mathematics; Markov chain; Constant (computer programming); Combinatorics; Discrete mathematics; Upper and lower bounds; Expected value; Perturbation (astronomy); Markov process; Applied mathematics; Statistics; Mathematical analysis; Computer science","score_opus":0.009487592498764835,"score_gpt":0.33369245791553903,"score_spread":0.3242048654167742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995137628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0234746,0.00008213897,0.9744053,0.0005725276,0.000026826528,0.0003944976,0.000032116197,0.000026008649,0.0009860238],"genre_scores_gemma":[0.9716929,0.000087628585,0.027272724,0.00013224078,0.00006931813,0.00008137262,0.000016426982,0.000007039374,0.00064034475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999014,0.00005097056,0.00023831303,0.00026605724,0.00023442914,0.00019622828],"domain_scores_gemma":[0.9989677,0.00018782417,0.00017110548,0.00036191352,0.0001812729,0.00013018015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036864757,0.00009679761,0.00020400264,0.00028064984,0.00029010783,0.00022162918,0.0003398914,0.00003768403,0.00015986661],"category_scores_gemma":[0.000012007178,0.0000777633,0.00017983366,0.0010003261,0.000045301374,0.00020748237,0.000043957858,0.00016290063,0.000058222387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016240814,0.000037010985,0.0028056768,0.000009192815,0.0003000269,9.71787e-7,0.000032275882,0.0009873242,0.001883299,0.9843957,0.00016567104,0.009366603],"study_design_scores_gemma":[0.0014192509,0.00018930504,0.004833825,0.000016036418,0.0003512662,0.00009066869,0.00020115901,0.03521685,0.0012423338,0.9037775,0.05227611,0.00038569028],"about_ca_topic_score_codex":8.797297e-7,"about_ca_topic_score_gemma":0.000002224604,"teacher_disagreement_score":0.9482183,"about_ca_system_score_codex":0.000032129068,"about_ca_system_score_gemma":0.00003726745,"threshold_uncertainty_score":0.31710956},"labels":[],"label_agreement":null},{"id":"W2995405989","doi":"10.26493/1855-3974.1813.7ae","title":"Reconfiguring vertex colourings of 2-trees","year":2019,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02250036835189753,"score_gpt":0.266323145948113,"score_spread":0.24382277759621548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995405989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8513985,0.00018931701,0.057732847,0.00069419754,0.00026184428,0.0009523171,0.00000421839,0.00026883555,0.08849789],"genre_scores_gemma":[0.9819563,0.000007029419,0.015691984,0.000054210213,0.0000047736607,0.000020031823,7.6004363e-7,0.000017885443,0.0022470406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984031,0.00008405259,0.0004236063,0.000359191,0.0004031459,0.0003269113],"domain_scores_gemma":[0.99795014,0.0005892352,0.000204939,0.0010282405,0.00012735523,0.00010009141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007391285,0.0001583507,0.00039094553,0.00017194806,0.000047553614,0.000050644412,0.0011925849,0.000056071513,0.00014913325],"category_scores_gemma":[0.00016222733,0.00014175344,0.000115791074,0.00034196436,0.0000994883,0.0004847408,0.00024266998,0.00015017434,0.00048438506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034681874,0.00014346786,0.0016059794,0.0003333,0.00006766077,0.000020482574,0.001813914,0.00002189535,0.035244085,0.9570064,0.00026365946,0.003444452],"study_design_scores_gemma":[0.0019311968,0.00045960423,0.0012195015,0.0006374445,0.000011999266,0.00006400825,0.00044408598,0.018038746,0.10087712,0.87348515,0.002221101,0.0006100167],"about_ca_topic_score_codex":0.000006423927,"about_ca_topic_score_gemma":0.0000035530948,"teacher_disagreement_score":0.13055776,"about_ca_system_score_codex":0.000023388664,"about_ca_system_score_gemma":0.000057352372,"threshold_uncertainty_score":0.62259513},"labels":[],"label_agreement":null},{"id":"W2996084168","doi":"10.1002/jgt.22530","title":"Graph homomorphism reconfiguration and frozen H‐colorings","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; National Research Foundation of Korea; Kyungpook National University","keywords":"Combinatorics; Mathematics; Graph coloring; Homomorphism; Discrete mathematics; Edge coloring; Vertex (graph theory); Nondeterministic algorithm; Graph; Fractional coloring; Graph power; Line graph","score_opus":0.012260161328930238,"score_gpt":0.2509191087115379,"score_spread":0.23865894738260765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996084168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82082343,0.0016341527,0.1699344,0.0008418745,0.0008397986,0.00026145575,0.0000021202027,0.000051619474,0.0056111347],"genre_scores_gemma":[0.9908562,0.00035115873,0.007932459,0.00021456389,0.00006557351,0.0000032678197,3.7770283e-7,0.00001549516,0.0005609096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982999,0.00033211883,0.0004183503,0.0002394355,0.00042546305,0.00028475147],"domain_scores_gemma":[0.9982598,0.0004895617,0.0003938501,0.0004163239,0.00026588267,0.00017462637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00242947,0.00014898603,0.00029203593,0.00069935934,0.000111578964,0.00012983722,0.0008417282,0.00007722776,0.00007586267],"category_scores_gemma":[0.0001221584,0.00012139792,0.00016525779,0.0005831197,0.00016350303,0.0013099893,0.00012682771,0.00043368782,0.00003398491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001876244,0.00004903503,0.0018959381,0.000019848207,0.00007836605,0.00004624727,0.000628702,0.00003894924,0.016019244,0.9576519,0.00020281698,0.023181299],"study_design_scores_gemma":[0.00077356416,0.0005026411,0.004883034,0.000060047867,0.000011417997,0.00034382642,0.00017845238,0.0001010155,0.004287489,0.9871918,0.0015006418,0.00016609556],"about_ca_topic_score_codex":0.000001294692,"about_ca_topic_score_gemma":7.1778436e-7,"teacher_disagreement_score":0.17003275,"about_ca_system_score_codex":0.00002623432,"about_ca_system_score_gemma":0.00005999649,"threshold_uncertainty_score":0.49504635},"labels":[],"label_agreement":null},{"id":"W2996115425","doi":"10.1016/j.comgeo.2023.102020","title":"Colouring bottomless rectangles and arborescences","year":2023,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Corollary; Vertex (graph theory); Monochromatic color; Point (geometry); Order (exchange); Line (geometry); Plane (geometry); Discrete mathematics; Geometry; Graph; Optics; Physics","score_opus":0.024630486044784995,"score_gpt":0.3022855409761604,"score_spread":0.2776550549313754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996115425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6876874,0.0003815424,0.30933636,0.0010150899,0.00021579128,0.00012859372,0.0000053796034,0.00049037905,0.00073946826],"genre_scores_gemma":[0.9614574,0.000033081018,0.038150605,0.00009600157,0.00004357397,0.000012328052,0.0000073517526,0.00000775447,0.0001919523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883014,0.00006205462,0.00013169383,0.00032400282,0.0003850782,0.000267035],"domain_scores_gemma":[0.998852,0.0007516135,0.000039585357,0.00016961733,0.000090441645,0.00009673822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042996192,0.00008802082,0.00010405034,0.0005139055,0.0002017062,0.00013001519,0.0004693686,0.000032370604,0.0000073103843],"category_scores_gemma":[0.00014717468,0.00008638729,0.000027255252,0.002097493,0.000119606164,0.00031292287,0.00039851456,0.000118625154,0.00010317098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019701429,0.000052280393,0.027942447,0.00007060133,0.000048177968,0.00012979454,0.0005851777,0.043270405,0.0004943073,0.8182119,0.0016860534,0.107489124],"study_design_scores_gemma":[0.00028931847,0.00006099426,0.16425933,0.000031427924,0.0000017241659,0.000029867566,0.00010583177,0.2818934,0.00029089302,0.55206406,0.000756348,0.00021679359],"about_ca_topic_score_codex":0.0000021255673,"about_ca_topic_score_gemma":7.542559e-7,"teacher_disagreement_score":0.27376997,"about_ca_system_score_codex":0.000019008625,"about_ca_system_score_gemma":0.000043540007,"threshold_uncertainty_score":0.35227716},"labels":[],"label_agreement":null},{"id":"W2996952245","doi":"10.61091/jcmcc124-48","title":"Generalized domination structure in cubic graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cubic graph; Combinatorics; Graph; Line graph","score_opus":0.011518185236568031,"score_gpt":0.28901297877206544,"score_spread":0.2774947935354974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996952245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90485835,0.00064896094,0.08133665,0.00035920425,0.011797383,0.00034059558,9.627663e-7,0.00004253041,0.0006153542],"genre_scores_gemma":[0.97366506,0.000048034228,0.026024511,0.00003659445,0.00019971275,0.000001691856,5.190058e-7,0.000013980063,0.000009885118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732584,0.00025170803,0.0010979556,0.00028289622,0.0006540858,0.00038751072],"domain_scores_gemma":[0.9974243,0.00083543255,0.0006691559,0.00038276552,0.0005618929,0.00012646674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001915066,0.0002560617,0.00069564255,0.00089970767,0.00020736533,0.00031333455,0.0010983325,0.0001676741,0.0000029976725],"category_scores_gemma":[0.00063087407,0.00023044496,0.00014815647,0.0014127039,0.00009721655,0.0005161412,0.00047239123,0.0006531811,6.055007e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059717815,0.00021256585,0.0003035255,0.00009841297,0.00004450592,0.000025764959,0.0005651132,0.000102516926,0.0019167727,0.9925139,0.000066485576,0.0040907343],"study_design_scores_gemma":[0.0048296493,0.00022194776,0.00029377633,0.00028621117,0.000017854294,0.00003921358,0.000085086875,0.015707338,0.0023700262,0.97571266,0.00024321392,0.00019305438],"about_ca_topic_score_codex":0.000005623354,"about_ca_topic_score_gemma":9.856105e-7,"teacher_disagreement_score":0.068806715,"about_ca_system_score_codex":0.00013025354,"about_ca_system_score_gemma":0.00021103151,"threshold_uncertainty_score":0.93972725},"labels":[],"label_agreement":null},{"id":"W2998876001","doi":"10.37236/7879","title":"Maximum Number of Colourings: 5-Chromatic Case","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Conjecture; Chromatic scale; Graph; Discrete mathematics","score_opus":0.00709010829855287,"score_gpt":0.27021139719077947,"score_spread":0.2631212888922266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998876001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9257202,0.00088443415,0.07084988,0.00041137493,0.00038254634,0.00018712619,2.9593681e-7,0.000016728154,0.0015474142],"genre_scores_gemma":[0.99917555,0.00012394246,0.0002836991,0.00003197255,0.000020624788,0.0000016165317,5.306364e-8,0.000013011314,0.0003495482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802494,0.00024514468,0.0004497482,0.00012234875,0.0006039157,0.00055392657],"domain_scores_gemma":[0.9979208,0.0004998764,0.00052009604,0.00061019225,0.00036899225,0.000080043086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019939202,0.00012481726,0.00030506283,0.00012326901,0.0000842674,0.000039072595,0.0015906862,0.000047743026,0.000034702927],"category_scores_gemma":[0.00010324347,0.0000852739,0.00014345153,0.0007810605,0.00008290571,0.00039702453,0.00021769026,0.0007215611,0.00004713302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030367195,0.000105195446,0.0006399753,0.000027780283,0.00007147508,0.0001603077,0.0003174973,0.00009485448,0.00044358493,0.99737096,0.00007406343,0.0006639604],"study_design_scores_gemma":[0.0007951999,0.0005964732,0.00007382175,0.00003253315,0.000015332836,0.010132276,0.00011708048,0.00096832117,0.0032022588,0.98343396,0.00053507107,0.000097658936],"about_ca_topic_score_codex":0.0000044100557,"about_ca_topic_score_gemma":0.0000011544901,"teacher_disagreement_score":0.073455326,"about_ca_system_score_codex":0.00022222902,"about_ca_system_score_gemma":0.00037739807,"threshold_uncertainty_score":0.34773687},"labels":[],"label_agreement":null},{"id":"W2998968188","doi":"","title":"Maximum linear arrangement of directed graphs","year":2019,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.014556788667066186,"score_gpt":0.2466469829840335,"score_spread":0.2320901943169673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998968188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79013413,0.0013406505,0.06058433,0.00022752227,0.0046628444,0.0031049885,0.0002803566,0.0015529282,0.13811223],"genre_scores_gemma":[0.7944254,0.0013878737,0.02195648,0.00011237009,0.00011801618,0.000009776653,0.0016630793,0.0002026678,0.18012428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99769384,0.0001823238,0.00025919097,0.00075337203,0.00065956026,0.0004517181],"domain_scores_gemma":[0.99778247,0.0001402805,0.00031458182,0.0011486858,0.00045842814,0.00015555917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019043413,0.00034203485,0.00047478508,0.0014817199,0.00012742887,0.000032942426,0.002272535,0.0002931791,0.00010211784],"category_scores_gemma":[0.00003837917,0.0003905231,0.00029136165,0.002310756,0.00008542229,0.00050561986,0.00025169662,0.0004950358,0.0001248123],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040332023,0.0022980438,0.23434125,0.0039918604,0.0028692826,0.0017996505,0.0014516332,0.0017415866,0.0022805291,0.59778684,0.035978973,0.11142712],"study_design_scores_gemma":[0.011704436,0.0023615963,0.008742419,0.0022515005,0.0007336224,4.3936524e-8,0.058746483,0.011962433,0.12522388,0.09404629,0.6777861,0.006441204],"about_ca_topic_score_codex":0.00007030058,"about_ca_topic_score_gemma":0.003642315,"teacher_disagreement_score":0.64180714,"about_ca_system_score_codex":0.00011674222,"about_ca_system_score_gemma":0.00021422203,"threshold_uncertainty_score":0.9998547},"labels":[],"label_agreement":null},{"id":"W2999048296","doi":"10.37236/9286","title":"Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Embedding; Vertex (graph theory); Graph; Multiple edges; Discrete mathematics; Computer science","score_opus":0.015869783863050754,"score_gpt":0.26760887986465953,"score_spread":0.25173909600160876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999048296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89560544,0.0131859835,0.082076654,0.0065905508,0.0010589131,0.00073599775,0.0000133732265,0.000086194756,0.0006468939],"genre_scores_gemma":[0.9958059,0.0030103396,0.00090839545,0.00013186721,0.000028519255,0.0000037030718,5.6204925e-7,0.000041309246,0.00006940089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955432,0.0006525676,0.00091712945,0.0005104597,0.0014211269,0.0009555235],"domain_scores_gemma":[0.99553007,0.0012796219,0.0012423283,0.0010329448,0.00063803745,0.00027699233],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025651318,0.0004594535,0.0009074288,0.00028284464,0.00016993543,0.00014482484,0.004017235,0.00023894783,0.000004201746],"category_scores_gemma":[0.00042347686,0.00034367928,0.00043769745,0.0011220017,0.0004304701,0.00022676295,0.0015040878,0.0040400815,0.0000028379047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044114233,0.00019580568,0.0002223279,0.00009947139,0.00029920734,0.00006373492,0.0005482012,0.0008648696,0.00087081426,0.9952156,0.00013184796,0.0010470029],"study_design_scores_gemma":[0.0010594147,0.0028325482,0.0008310678,0.0001619082,0.000059399612,0.00018014158,0.000046748333,0.0017240541,0.0022441535,0.9903267,0.00023790638,0.0002959322],"about_ca_topic_score_codex":0.000008272764,"about_ca_topic_score_gemma":0.000003203981,"teacher_disagreement_score":0.10020046,"about_ca_system_score_codex":0.00024944486,"about_ca_system_score_gemma":0.0015399023,"threshold_uncertainty_score":0.99990153},"labels":[],"label_agreement":null},{"id":"W2999464824","doi":"10.37236/742","title":"Maximal Nontraceable Graphs with Toughness less than One","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of South Africa; National Research Foundation","keywords":"Combinatorics; Mathematics; Hamiltonian path; Vertex (graph theory); Graph; Pancyclic graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.019663318482678476,"score_gpt":0.24054955255475927,"score_spread":0.2208862340720808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999464824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5504813,0.0029754012,0.4442638,0.0010808745,0.0002075908,0.00015640302,3.203375e-7,0.000039222792,0.000795079],"genre_scores_gemma":[0.99806005,0.0008310092,0.000520411,0.000043704058,0.000049078844,0.000004657463,1.8308529e-7,0.000021870057,0.00046906408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971634,0.00024682487,0.00035163664,0.00020207094,0.0010624802,0.0009735722],"domain_scores_gemma":[0.99803317,0.0002752821,0.00036117737,0.00065638486,0.0005264095,0.00014757551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001437776,0.00019254201,0.00034021607,0.00021676946,0.00044201082,0.000070616385,0.0024667839,0.00005689091,0.0000041933836],"category_scores_gemma":[0.000047349753,0.00012289753,0.00012745647,0.0014484875,0.00024977498,0.00076088106,0.0001644987,0.0012011213,0.000006843674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001782932,0.00023890665,0.00079104066,0.000006241768,0.00010199872,0.00013069496,0.00035850596,0.00023325314,0.0002249459,0.9969169,0.000072126626,0.0007471278],"study_design_scores_gemma":[0.0014237995,0.001687678,0.0013998705,0.000031140196,0.000021718355,0.0031542548,0.00009366485,0.00041944493,0.0043714345,0.98642933,0.0007555545,0.00021209777],"about_ca_topic_score_codex":0.000007969609,"about_ca_topic_score_gemma":0.0000076754295,"teacher_disagreement_score":0.4475787,"about_ca_system_score_codex":0.00023560366,"about_ca_system_score_gemma":0.0008531327,"threshold_uncertainty_score":0.5218341},"labels":[],"label_agreement":null},{"id":"W2999689452","doi":"10.1016/j.tcs.2019.12.007","title":"Corrigendum to “The orthogonal colouring game” [Theor. Comput. Sci. 795 (2019) 312–325]","year":2020,"lang":"en","type":"erratum","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Involution (esoterism); Upper and lower bounds; Isomorphism (crystallography); Discrete mathematics; Mathematical analysis","score_opus":0.02459413783598354,"score_gpt":0.28905575378499726,"score_spread":0.26446161594901374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999689452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010184464,0.00040280572,0.91744626,0.012177405,0.055703048,0.0013674624,0.000046702506,0.0007749412,0.011979527],"genre_scores_gemma":[0.2520447,0.00046903832,0.6045351,0.048408367,0.02672622,0.00059752923,0.00020071235,0.0008315732,0.06618677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98570144,0.0010424245,0.0011589781,0.0040045925,0.004879511,0.0032130545],"domain_scores_gemma":[0.99102986,0.00090913253,0.0004177885,0.0044174735,0.000990979,0.0022347819],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","open_science"],"category_scores_codex":[0.0057739853,0.0012216948,0.0013051184,0.0010209861,0.0020372958,0.002641888,0.024389466,0.00050492695,0.00023299166],"category_scores_gemma":[0.0008670141,0.00092602643,0.0004876441,0.0072410735,0.009504127,0.0010395697,0.014910863,0.0042703133,0.0026004305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004466427,0.00007256377,0.0000049041146,0.000039196602,0.000026670132,0.00016353517,0.0006178795,0.00042637324,0.000040566345,0.72008836,0.25722244,0.021252854],"study_design_scores_gemma":[0.0004072125,0.00096583704,0.00021990192,0.00032258144,0.000028108265,0.00024392943,0.000017527855,0.38984808,0.0002974982,0.27548456,0.33064184,0.0015229081],"about_ca_topic_score_codex":0.0000069781568,"about_ca_topic_score_gemma":0.0000072206817,"teacher_disagreement_score":0.44460377,"about_ca_system_score_codex":0.0004468536,"about_ca_system_score_gemma":0.001890136,"threshold_uncertainty_score":0.999319},"labels":[],"label_agreement":null},{"id":"W3000454462","doi":"10.37236/284","title":"The Planarity Theorems of MacLane and Whitney for Graph-like Continua","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Planarity testing; Disjoint sets; Combinatorics; Compactification (mathematics); Discrete mathematics; Graph; Pure mathematics","score_opus":0.006040515383384084,"score_gpt":0.2553896335600363,"score_spread":0.24934911817665223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000454462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5113861,0.007726049,0.47081366,0.006664893,0.0019693004,0.00070192467,0.0000050319654,0.00003507227,0.0006979787],"genre_scores_gemma":[0.99873656,0.00080682395,0.00019384653,0.00004397969,0.00004788189,0.0000049103387,2.1513198e-7,0.000010524388,0.0001552339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983398,0.00018027067,0.00036174577,0.00012642836,0.0004316668,0.0005601199],"domain_scores_gemma":[0.9968428,0.0016651349,0.00042651064,0.0005254302,0.00045244474,0.000087699875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043154256,0.00012289999,0.000234911,0.00009324431,0.00034252065,0.000085730535,0.0018942201,0.00006103768,0.0000012873893],"category_scores_gemma":[0.00030742685,0.00006593671,0.000119654374,0.00040237626,0.0003879684,0.0002149063,0.00014912218,0.0010548937,4.315733e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011389444,0.000041430805,0.00020995802,0.000006451133,0.000056575067,0.0000013917772,0.00017407558,0.0000041637395,0.001900843,0.9941102,0.00023309323,0.0031479232],"study_design_scores_gemma":[0.0007738706,0.00065235596,0.00026119244,0.0000074447557,0.00001576706,0.00017212048,0.000058337635,0.0005238566,0.0033579431,0.98626155,0.00783915,0.000076396536],"about_ca_topic_score_codex":0.0000032894188,"about_ca_topic_score_gemma":0.0000258106,"teacher_disagreement_score":0.4873505,"about_ca_system_score_codex":0.000032376673,"about_ca_system_score_gemma":0.00029150513,"threshold_uncertainty_score":0.4583047},"labels":[],"label_agreement":null},{"id":"W3000817392","doi":"10.1007/978-3-030-39219-2_5","title":"Approximating Modular Decomposition Is Hard","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Modular design; Computer science; Modular decomposition; Decomposition; Algebraic number; Graph; Time complexity; Data structure; Neighbourhood (mathematics); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Line graph; Pathwidth","score_opus":0.02567637745108079,"score_gpt":0.2885644326627407,"score_spread":0.26288805521165987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000817392","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065055174,0.00033861722,0.9929659,0.0021940935,0.0006715955,0.0004981135,0.000007577446,0.00028158684,0.0029774578],"genre_scores_gemma":[0.056444675,0.00002794996,0.93946475,0.003406239,0.00038703645,0.00001608478,0.0000070422284,0.00005533818,0.00019088858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479795,0.00006398843,0.0006051451,0.002188963,0.0015329809,0.0008109887],"domain_scores_gemma":[0.99698085,0.00041783502,0.00030705184,0.0016997489,0.00028338848,0.00031112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009954972,0.00057005376,0.00060043857,0.000841452,0.00039243887,0.0007097639,0.0047588595,0.00028104495,0.000030829822],"category_scores_gemma":[0.000131499,0.0005595598,0.00019104219,0.0010417727,0.0007268594,0.001014689,0.0023952825,0.0012918866,0.0001568217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013808325,0.000031300355,0.000028298284,0.00010954004,0.00002391711,0.00021606461,0.0014515802,0.030726464,0.0030097547,0.1710898,0.00003561832,0.79326385],"study_design_scores_gemma":[0.0001357425,0.00010583061,0.000016630565,0.00018154239,0.0000029907314,0.000041260268,9.478151e-8,0.5329179,0.0044148494,0.46132466,0.00044517964,0.00041332346],"about_ca_topic_score_codex":0.00000431787,"about_ca_topic_score_gemma":0.000003340124,"teacher_disagreement_score":0.79285055,"about_ca_system_score_codex":0.0003110171,"about_ca_system_score_gemma":0.0003611947,"threshold_uncertainty_score":0.9996856},"labels":[],"label_agreement":null},{"id":"W3002002006","doi":"10.1007/978-3-030-39881-1_27","title":"Parameterized Algorithms for the Happy Set Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parameterized complexity; Combinatorics; Undirected graph; Vertex (graph theory); Mathematics; Graph; Vertex cover; Discrete mathematics; Clique; Set (abstract data type); Integer (computer science); Computer science; Algorithm","score_opus":0.051121854598218316,"score_gpt":0.31060824585989527,"score_spread":0.25948639126167694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002002006","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023541875,0.0005399878,0.9905806,0.0051557845,0.0010149623,0.0017465051,0.000027736625,0.00021923064,0.0007127955],"genre_scores_gemma":[0.006769638,0.00006627032,0.9892376,0.002745822,0.0005278894,0.0001513216,0.0000073083697,0.0000636352,0.0004305093],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99518645,0.00006575336,0.00054768345,0.0019884296,0.0012517535,0.0009599397],"domain_scores_gemma":[0.99380326,0.003393941,0.00028523,0.0019286588,0.00033884216,0.00025007591],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015979832,0.0005991702,0.00061500625,0.00047126485,0.0005655517,0.00085413805,0.0075746933,0.00026008388,0.0000139781105],"category_scores_gemma":[0.00032358177,0.00042444994,0.00026570327,0.00097485527,0.0013989155,0.00057716743,0.0023262168,0.0011396038,0.00004681693],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033826564,0.000015065436,0.0000032748387,0.00006091263,0.00003265257,0.000047809684,0.0007383597,0.014806293,0.00022983452,0.13674669,0.00009000483,0.84719527],"study_design_scores_gemma":[0.00025672073,0.00022733262,0.0000039982206,0.0001060672,0.000006368148,0.000030714786,1.8308968e-7,0.4928971,0.00062706467,0.49797398,0.0074841734,0.0003862823],"about_ca_topic_score_codex":0.0000064376864,"about_ca_topic_score_gemma":0.000013256514,"teacher_disagreement_score":0.84680897,"about_ca_system_score_codex":0.00018662051,"about_ca_system_score_gemma":0.00057950045,"threshold_uncertainty_score":0.9998207},"labels":[],"label_agreement":null},{"id":"W3002049452","doi":"10.37236/8594","title":"On essentially 4-edge-connected cubic bricks","year":2018,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universidade Federal de Mato Grosso do Sul; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Fundação de Amparo à Pesquisa do Estado de São Paulo; Universität Wien; Massey University","keywords":"Combinatorics; Mathematics; Bipartite graph; Cubic graph; Conjecture; Invariant (physics); Graph; Complete bipartite graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.04156593562185266,"score_gpt":0.3132276082930295,"score_spread":0.2716616726711768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002049452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8143353,0.00034543182,0.17050543,0.0012366682,0.0029201908,0.0006354142,0.00000974523,0.00036015053,0.009651677],"genre_scores_gemma":[0.98950756,0.00009269749,0.0015799062,0.0013277665,0.0012067064,0.000036019195,0.0000061774076,0.00009771865,0.0061454773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99291664,0.0007876,0.0008429812,0.0021648686,0.0012408161,0.002047061],"domain_scores_gemma":[0.9936318,0.0009322041,0.00036497484,0.003252926,0.0010997312,0.0007183848],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012177723,0.00072587194,0.0006474034,0.0006662431,0.0011715816,0.00042314484,0.003886952,0.0003562191,0.0019119413],"category_scores_gemma":[0.0012675707,0.0007432503,0.00034790635,0.003373964,0.0017424225,0.0011953356,0.001620972,0.0011397746,0.016035406],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021302535,0.0036937403,0.13110693,0.00030829918,0.0010575387,0.0014535189,0.008878759,0.0002304261,0.23640954,0.422766,0.012353952,0.17961103],"study_design_scores_gemma":[0.0070288843,0.00924113,0.3394819,0.0010142246,0.0001691261,0.00021676911,0.00025537284,0.037175804,0.4049941,0.17092225,0.025003329,0.004497085],"about_ca_topic_score_codex":0.000046405214,"about_ca_topic_score_gemma":0.000054994176,"teacher_disagreement_score":0.25184375,"about_ca_system_score_codex":0.00019169616,"about_ca_system_score_gemma":0.00049635797,"threshold_uncertainty_score":0.9995018},"labels":[],"label_agreement":null},{"id":"W3003210829","doi":"10.1016/j.amc.2020.125032","title":"On the vertex partition of planar graphs into forests with bounded degree","year":2020,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Frequency partition of a graph; Combinatorics; Partition (number theory); Mathematics; Bounded function; Planar graph; Vertex (graph theory); Discrete mathematics; Degree (music); Graph; Graph power; Line graph; Physics; Mathematical analysis","score_opus":0.0406424360618284,"score_gpt":0.2698146439078508,"score_spread":0.2291722078460224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003210829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16924809,0.0000097578895,0.8289495,0.0006618922,0.000007214747,0.00024190091,6.275715e-7,0.000035389243,0.0008456156],"genre_scores_gemma":[0.8887446,0.0000031281345,0.111028075,0.00018574519,0.0000036310585,0.000024883368,0.000002617659,0.000006396709,9.390445e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930996,0.000014655387,0.00014403234,0.00016850626,0.0002576905,0.00010517559],"domain_scores_gemma":[0.9992806,0.00036363036,0.00009850503,0.00016084009,0.00004524912,0.000051191124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015639616,0.00008566846,0.00011516945,0.000041905452,0.000111341855,0.00005533692,0.00021837972,0.000021566095,0.000001594245],"category_scores_gemma":[0.000020777741,0.000054875334,0.000017343094,0.0002896931,0.00008911251,0.000074141724,0.000048328322,0.00007749296,0.0000069294315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002416782,0.000031393614,0.000009168692,0.000056525238,0.000012240842,9.599971e-7,0.0017872438,0.0004545919,0.0005063911,0.9871034,0.00006118405,0.009952749],"study_design_scores_gemma":[0.00022144469,0.00017776071,0.00016195043,0.000020666439,0.000004236872,0.0000017360617,0.00013153075,0.1384504,0.001296424,0.8594668,0.0000068464997,0.000060199716],"about_ca_topic_score_codex":0.0000014140642,"about_ca_topic_score_gemma":0.000005598198,"teacher_disagreement_score":0.7194965,"about_ca_system_score_codex":0.000006381559,"about_ca_system_score_gemma":0.000016365748,"threshold_uncertainty_score":0.22377512},"labels":[],"label_agreement":null},{"id":"W3003586411","doi":"10.1016/j.jctb.2023.12.006","title":"Excluded minors for the Klein bottle II. Cascades","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Klein bottle; Genus; Embedding; Combinatorics; Euler's formula; Euler characteristic; Mathematics; Surface (topology); Discrete mathematics; Computer science; Biology; Geometry; Zoology; Mathematical analysis; Artificial intelligence","score_opus":0.019614385251058644,"score_gpt":0.3024421195788242,"score_spread":0.2828277343277656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003586411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059373636,0.020453252,0.84069115,0.014644798,0.059560306,0.0012238971,0.000023014009,0.00033917537,0.003690793],"genre_scores_gemma":[0.98783344,0.00026551483,0.0061615007,0.000120811994,0.0018147634,0.00002982282,5.4914346e-7,0.00003915473,0.0037344452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818426,0.00028293484,0.0004437486,0.00020554157,0.0005258834,0.0003576218],"domain_scores_gemma":[0.9964905,0.0024301813,0.00017086658,0.00045410488,0.00033164778,0.00012273464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033130448,0.00017387488,0.00027543618,0.0002060256,0.00044150607,0.00037535143,0.0017560322,0.0000815897,0.000045447592],"category_scores_gemma":[0.0006768019,0.00010775713,0.00030710088,0.00056483404,0.00027583272,0.0013500379,0.00032733302,0.00045200193,0.000008475207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041654884,0.00004122233,0.0000030109961,0.0000287366,0.00012478442,0.000046347053,0.0010084421,0.000040491977,0.0012326229,0.97992414,0.0041130097,0.013020637],"study_design_scores_gemma":[0.0004617543,0.0007440417,0.000012509058,0.00005313303,0.00002307615,0.00018135303,0.00022791045,0.0003243967,0.010152926,0.82613724,0.1615662,0.000115444105],"about_ca_topic_score_codex":0.0000010012434,"about_ca_topic_score_gemma":6.7681265e-7,"teacher_disagreement_score":0.9284598,"about_ca_system_score_codex":0.00007598883,"about_ca_system_score_gemma":0.0002370805,"threshold_uncertainty_score":0.43942082},"labels":[],"label_agreement":null},{"id":"W3003878869","doi":"10.1016/j.jctb.2023.10.002","title":"Excluded minors for the Klein bottle I. Low connectivity case","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Klein bottle; Combinatorics; Embedding; Mathematics; Robertson–Seymour theorem; Vertex (graph theory); Genus; Euler characteristic; Euler's formula; Discrete mathematics; Graph; 1-planar graph; Computer science; Chordal graph; Artificial intelligence; Geometry; Torus; Biology; Mathematical analysis","score_opus":0.025210782009681694,"score_gpt":0.30544620852283433,"score_spread":0.28023542651315264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003878869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58299035,0.00065997476,0.38381562,0.0047050687,0.025491009,0.0011913296,0.000026298709,0.00028722687,0.00083311734],"genre_scores_gemma":[0.997005,0.000059542937,0.0014130647,0.000068772824,0.0006979635,0.000029115088,5.649043e-7,0.00002494404,0.0007010284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978183,0.000570325,0.00044255596,0.00021668167,0.000499265,0.00045287918],"domain_scores_gemma":[0.9934084,0.004934695,0.0003597312,0.00061292085,0.00052611355,0.00015815788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005330225,0.00018123644,0.00034214027,0.00023496899,0.0005427394,0.00020251791,0.001429387,0.00008396942,0.000026125119],"category_scores_gemma":[0.0020394595,0.00012357566,0.0002794242,0.00095623394,0.00030088736,0.0011077452,0.00033996766,0.00039084567,0.00001596163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081780535,0.00007242241,0.000022239747,0.000022410808,0.0000996216,0.00074566476,0.000727824,0.00019839927,0.00088356814,0.98568165,0.0022117998,0.008516562],"study_design_scores_gemma":[0.0014829863,0.0007144504,0.00007406102,0.000023555769,0.000018685081,0.0014549413,0.0006976835,0.0007651247,0.009637103,0.9737541,0.011214622,0.00016265837],"about_ca_topic_score_codex":0.0000026641412,"about_ca_topic_score_gemma":0.0000033043104,"teacher_disagreement_score":0.41401464,"about_ca_system_score_codex":0.00006929588,"about_ca_system_score_gemma":0.0001845076,"threshold_uncertainty_score":0.50392693},"labels":[],"label_agreement":null},{"id":"W3004859185","doi":"","title":"Minimal Tetrahedralizations of a Class of Polyhedra.","year":2000,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Regina","funders":"","keywords":"Polyhedron; Tetrahedron; Combinatorics; Class (philosophy); Euclidean space; Mathematics; Graph; Simple (philosophy); Computer science; Artificial intelligence; Geometry","score_opus":0.018836993820149462,"score_gpt":0.29725188787131623,"score_spread":0.27841489405116676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004859185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22871894,0.00013779446,0.6118778,0.00068971806,0.000053129028,0.00021723854,0.000009950942,0.00012362984,0.15817179],"genre_scores_gemma":[0.9345269,0.000014452995,0.061402045,0.000041805746,0.000006055732,0.0000031751474,6.4271757e-7,0.0000041611534,0.0040007215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992084,0.000045973815,0.00019921594,0.00015199666,0.00023287568,0.00016151763],"domain_scores_gemma":[0.99928933,0.00010236314,0.000036614194,0.0004354223,0.00008526891,0.0000510087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012763316,0.000054807686,0.000113128735,0.0001258742,0.000028312952,0.000009131133,0.00064196327,0.000026696089,0.00074338884],"category_scores_gemma":[0.000028534443,0.000047413574,0.000050409835,0.0007577019,0.00013758834,0.0002504704,0.000070810886,0.000046096957,0.000028010401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016200835,0.000120469456,0.0013557357,0.000014823965,0.000012611756,0.0000020812088,0.00033985678,0.00033358944,0.009466215,0.945696,0.00024002121,0.042402424],"study_design_scores_gemma":[0.0023162584,0.0013694847,0.026709791,0.000100953504,0.0000176883,0.000054276978,0.00030807147,0.1147092,0.48362306,0.34006068,0.02993567,0.0007948701],"about_ca_topic_score_codex":0.000016225134,"about_ca_topic_score_gemma":0.0000049472164,"teacher_disagreement_score":0.705808,"about_ca_system_score_codex":0.000006241929,"about_ca_system_score_gemma":0.000047165115,"threshold_uncertainty_score":0.81395864},"labels":[],"label_agreement":null},{"id":"W3006001508","doi":"10.1142/s179383092150049x","title":"Semi-dynamic algorithms for strongly chordal graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Chordal graph; Interval graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Dynamic problem; Shortest path problem; Mathematics; Pathwidth; Graph; Computer science; Treewidth; Algorithm; Discrete mathematics; Line graph; 1-planar graph","score_opus":0.03345199863854946,"score_gpt":0.33286946492678504,"score_spread":0.29941746628823557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006001508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015809193,0.0006642891,0.9925875,0.0015928753,0.000109484274,0.0032064083,0.0008190708,0.00033578888,0.00052648695],"genre_scores_gemma":[0.008769057,0.00043651072,0.9838546,0.00007989123,0.00018812547,0.0058753965,0.0003848057,0.00010056538,0.00031107533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968832,0.00004582119,0.0006487759,0.0013090719,0.0005122508,0.0006008691],"domain_scores_gemma":[0.9969756,0.00040541205,0.00038340752,0.0015915969,0.00026869256,0.00037530673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004640619,0.0005254957,0.00064275897,0.00023109416,0.00043946735,0.00058317865,0.0020446926,0.00025855575,0.0000062648305],"category_scores_gemma":[0.00006179031,0.00050187,0.00030449446,0.00052969105,0.0002533065,0.00021169284,0.0020565873,0.0007178838,0.000018875335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004254602,0.0001461393,0.0000034628474,0.00078913587,0.0001651257,0.0000027011279,0.0008603835,0.00050466007,0.00025797772,0.93687826,0.00017005827,0.060217846],"study_design_scores_gemma":[0.00020972143,0.00004259488,0.000012208001,0.00004787492,0.00003408545,0.000006545038,0.0001269721,0.46971455,0.00008557456,0.52690446,0.002477861,0.0003375483],"about_ca_topic_score_codex":0.000006574005,"about_ca_topic_score_gemma":0.0000031528643,"teacher_disagreement_score":0.4692099,"about_ca_system_score_codex":0.000060791095,"about_ca_system_score_gemma":0.00015005085,"threshold_uncertainty_score":0.9997433},"labels":[],"label_agreement":null},{"id":"W3007271564","doi":"10.1017/s0963548321000213","title":"Clustered 3-colouring graphs of bounded degree","year":2021,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Wilfrid Laurier University; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Bounded function; Planar graph; Degree (music); Vertex (graph theory); 1-planar graph; Discrete mathematics; Cluster analysis; Graph; Chordal graph; Statistics; Physics","score_opus":0.0581101267166381,"score_gpt":0.2964187187545243,"score_spread":0.2383085920378862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007271564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6560835,0.00038646915,0.33972263,0.0002531668,0.0006601726,0.0003299217,0.0000012937935,0.00025205227,0.0023107876],"genre_scores_gemma":[0.9302079,0.000007303989,0.06964932,0.00004178203,0.000015430009,0.000006134804,0.0000023361863,0.000016936792,0.000052868832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966402,0.00051977,0.0006663555,0.000849268,0.0006697716,0.0006546428],"domain_scores_gemma":[0.9961007,0.00081254647,0.00026416767,0.0016495107,0.0009857339,0.00018731778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017431788,0.00023674121,0.00045192565,0.00018795265,0.000344405,0.00014855021,0.0016277452,0.00011720881,0.000006844771],"category_scores_gemma":[0.00109199,0.00026119562,0.00020983462,0.0023524256,0.00023096312,0.0004016124,0.0021944556,0.00046459006,0.00000774131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009402508,0.0003679863,0.014939749,0.0002095403,0.000032014832,0.00003598083,0.00052734837,0.00039320215,0.0013473633,0.9695171,0.000016412274,0.012603899],"study_design_scores_gemma":[0.0006799645,0.00009557339,0.007409776,0.000066899556,0.000005560305,0.000032347874,0.000038948834,0.022487039,0.017228309,0.95160264,0.000097935794,0.00025502988],"about_ca_topic_score_codex":0.000007700619,"about_ca_topic_score_gemma":0.000007068993,"teacher_disagreement_score":0.27412438,"about_ca_system_score_codex":0.00019960606,"about_ca_system_score_gemma":0.00035095427,"threshold_uncertainty_score":0.999984},"labels":[],"label_agreement":null},{"id":"W3007681597","doi":"10.19086/aic.12043","title":"A rainbow version of Mantel's Theorem","year":2020,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Commission; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; United States-Israel Binational Science Foundation; Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Multiple edges; Simple graph; Rainbow; Discrete mathematics; Physics","score_opus":0.015320966051770737,"score_gpt":0.287461488534128,"score_spread":0.27214052248235726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007681597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058267757,0.01258826,0.8910355,0.0037338,0.0015892085,0.0008324995,0.0000119205315,0.00042819034,0.03151289],"genre_scores_gemma":[0.991088,0.00087558513,0.007794507,0.00017586746,0.000013936645,0.000008011831,0.0000010463,0.000010305748,0.00003275848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857765,0.0001162687,0.00024541182,0.00035531272,0.00041419716,0.00029117515],"domain_scores_gemma":[0.99888086,0.00037583054,0.00010215773,0.00043172293,0.00010000723,0.00010943508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031880086,0.00012256727,0.00021825943,0.00012805252,0.000048906222,0.000018113471,0.0013248258,0.000046726316,0.000011290921],"category_scores_gemma":[0.00031503092,0.00011808095,0.000056285564,0.0015954609,0.00012919134,0.00093592814,0.00047365585,0.00024299693,0.000025672669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004394901,0.000069934256,0.0029514055,0.000054502816,0.000003226041,0.000031504514,0.00050319877,0.00041763062,0.0003619041,0.97697705,0.000056777866,0.018528901],"study_design_scores_gemma":[0.000998498,0.00034294,0.00026785722,0.00003994925,0.0000015757577,0.0000034328752,0.00012493566,0.012216317,0.009312589,0.95667297,0.019826053,0.00019289387],"about_ca_topic_score_codex":0.000001148556,"about_ca_topic_score_gemma":6.298987e-7,"teacher_disagreement_score":0.9328202,"about_ca_system_score_codex":0.000046878802,"about_ca_system_score_gemma":0.000040534596,"threshold_uncertainty_score":0.48152012},"labels":[],"label_agreement":null},{"id":"W3009569366","doi":"10.1007/978-3-030-83823-2_45","title":"Building a Larger Class of Graphs for Efficient Reconfiguration of Vertex Colouring","year":2021,"lang":"en","type":"book-chapter","venue":"Trends in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Chordal graph; Combinatorics; Bipartite graph; Mistake; Mathematics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.05015080039206227,"score_gpt":0.32728623567235404,"score_spread":0.2771354352802918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009569366","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003463641,0.00065043406,0.8295017,0.00012039149,0.00041852743,0.00071879243,0.000085562526,0.00007794599,0.16496299],"genre_scores_gemma":[0.06093018,0.000112102854,0.845789,0.000020867385,0.000040438656,0.00010240531,0.000038954324,0.00013410333,0.09283191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818206,0.000029118142,0.0007551485,0.00035504147,0.00042747342,0.00025117229],"domain_scores_gemma":[0.99774635,0.0006998772,0.00054136576,0.0007331167,0.00023574482,0.00004356647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007778449,0.00021924965,0.0006113391,0.0008430067,0.00003633961,0.000025087893,0.00067217316,0.00018626357,0.000056558678],"category_scores_gemma":[0.00013610047,0.0002165931,0.00024377627,0.00029165673,0.00010093575,0.00006993091,0.00018774724,0.00023864242,0.000001550622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008689134,0.00008136724,0.0000012409931,0.0004929138,0.000041688854,0.0000052274468,0.00049155654,0.000643106,0.0012514362,0.98426706,0.000051218463,0.012664521],"study_design_scores_gemma":[0.00049392367,0.00012046625,0.0000075116886,0.0012003151,0.000026740116,0.00000825418,0.000034230296,0.08506269,0.008210242,0.9037777,0.0007957304,0.0002621813],"about_ca_topic_score_codex":6.672245e-7,"about_ca_topic_score_gemma":0.000006600799,"teacher_disagreement_score":0.084419586,"about_ca_system_score_codex":0.000066017004,"about_ca_system_score_gemma":0.00006387983,"threshold_uncertainty_score":0.883241},"labels":[],"label_agreement":null},{"id":"W3009875838","doi":"10.1016/j.tcs.2021.05.014","title":"The game of Cops and Eternal Robbers","year":2021,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Geology","score_opus":0.014841140689940763,"score_gpt":0.295436918663482,"score_spread":0.28059577797354124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009875838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08080437,0.0005569607,0.91553473,0.0010188634,0.00089103007,0.00025129094,0.0000026657683,0.00007885467,0.00086121325],"genre_scores_gemma":[0.87800825,0.00014847601,0.12160288,0.00013197535,0.00007151633,0.000012041148,6.2110297e-7,0.000010820254,0.000013445856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574935,0.00040316925,0.00045554322,0.0012050903,0.0014085148,0.0007783038],"domain_scores_gemma":[0.995537,0.0012402778,0.00019638205,0.00212413,0.0005539373,0.00034831444],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0035139336,0.00029107108,0.000400769,0.00020107006,0.0004642705,0.0012855149,0.0065010777,0.00011970191,0.000010905389],"category_scores_gemma":[0.0003129381,0.00020119942,0.0001341544,0.00096133363,0.012540093,0.0003998097,0.014926503,0.0009478083,0.0000047765698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109602215,0.000023769304,0.000045957946,0.00002936002,0.000012653237,0.000020728228,0.0005480233,0.00051928323,0.00039906596,0.951264,0.0000063992393,0.04711978],"study_design_scores_gemma":[0.00013648928,0.000114971146,0.0006979843,0.00012884504,0.000005262591,0.000058787424,0.00001780529,0.36412215,0.004422106,0.63001525,0.00004474608,0.00023557333],"about_ca_topic_score_codex":0.0000057222487,"about_ca_topic_score_gemma":0.0000015104952,"teacher_disagreement_score":0.79720384,"about_ca_system_score_codex":0.000063391366,"about_ca_system_score_gemma":0.00049924554,"threshold_uncertainty_score":0.99975127},"labels":[],"label_agreement":null},{"id":"W3010722852","doi":"10.37236/9448","title":"Cooperative Conditions for the Existence of Rainbow Matchings","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Basic Science; Israel Science Foundation; National Research Foundation of Korea; National Research Foundation; Ministry of Science and ICT, South Korea; European Commission","keywords":"Rainbow; Combinatorics; Mathematics; Bipartite graph; Matching (statistics); Simple (philosophy); Graph; Discrete mathematics; Physics","score_opus":0.015961273720455953,"score_gpt":0.29370876417904584,"score_spread":0.2777474904585899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010722852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050138526,0.005129469,0.9334713,0.00959394,0.0007013155,0.0006257259,0.000011894888,0.00002053511,0.00030728793],"genre_scores_gemma":[0.9990423,0.00017687757,0.0001362956,0.0001606915,0.000024755025,0.000037880614,4.465746e-7,0.000009155058,0.0004116246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823284,0.0003474178,0.00032234305,0.000104224586,0.0005901972,0.00040297068],"domain_scores_gemma":[0.99680376,0.0018797234,0.000413524,0.00040348424,0.000460334,0.000039189046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030059463,0.000091034206,0.00018570639,0.00009731125,0.0008329567,0.000039321403,0.0025585599,0.000014521196,0.000013528596],"category_scores_gemma":[0.00020920721,0.00005395859,0.00014655452,0.0008263916,0.00017248547,0.00023833127,0.00031157676,0.000826085,7.0984476e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005053569,0.00007234121,0.000008808836,0.00000378968,0.000067515335,0.0000019093209,0.0009812118,0.0021761546,0.0006792202,0.9951344,0.00048121216,0.00034287205],"study_design_scores_gemma":[0.00059871294,0.0011050777,0.000036486712,0.000005327309,0.000017806064,0.00019014318,0.00067722815,0.0038880573,0.001643803,0.98596936,0.0058034984,0.0000644711],"about_ca_topic_score_codex":0.0000022297477,"about_ca_topic_score_gemma":8.7003326e-7,"teacher_disagreement_score":0.94890374,"about_ca_system_score_codex":0.00023458553,"about_ca_system_score_gemma":0.00067068374,"threshold_uncertainty_score":0.64065135},"labels":[],"label_agreement":null},{"id":"W3011591568","doi":"10.48550/arxiv.2003.05956","title":"Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Control reconfiguration; Graph; Dominating set; Discrete mathematics; Computer science","score_opus":0.11901032930840853,"score_gpt":0.23529406353023383,"score_spread":0.1162837342218253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011591568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87819606,0.000038535076,0.12080266,0.000066083594,0.000076197386,0.00029160644,0.000016394613,0.000048256992,0.00046420103],"genre_scores_gemma":[0.99793,0.00011805475,0.0018582864,0.000016763968,0.0000039694282,9.751651e-7,0.000009140055,0.000008862183,0.000053975942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823475,0.00046111707,0.00021185316,0.0007841348,0.000085395404,0.00022273028],"domain_scores_gemma":[0.99856675,0.00043502875,0.0002439006,0.0004921547,0.00015800381,0.000104193976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008305811,0.00016902441,0.0003088023,0.00042057526,0.00005488925,0.00004716027,0.00092821085,0.00014878038,0.0000046183086],"category_scores_gemma":[0.00025856085,0.00021025326,0.00006368231,0.0010055413,0.00014524107,0.00033605902,0.0013085994,0.0005036114,0.000003339316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038957677,0.0001666351,0.18336925,0.000616701,0.00012294104,0.0005785002,0.0027479972,0.03879098,0.0017467825,0.7647756,0.00005634194,0.006638736],"study_design_scores_gemma":[0.00082617154,0.00011770798,0.11099397,0.00019535003,0.000010282952,0.0000035035068,0.0001234555,0.36371577,0.0013873721,0.5222371,0.00000925277,0.00038007047],"about_ca_topic_score_codex":0.00034410795,"about_ca_topic_score_gemma":0.00031517615,"teacher_disagreement_score":0.32492477,"about_ca_system_score_codex":0.00007087506,"about_ca_system_score_gemma":0.00009675607,"threshold_uncertainty_score":0.8573879},"labels":[],"label_agreement":null},{"id":"W3013871422","doi":"10.4230/dagrep.9.9.135","title":"Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401)","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Birkbeck, University of London; Royal Holloway, University of London; National Research University Higher School of Economics; Universität des Saarlandes; Centre National de la Recherche Scientifique; University of Waterloo; Université de Bordeaux; Universiteit van Amsterdam; Monash University; Louisiana State University; Deakin University; U.S. Naval Academy; Durham University; Universiteit Leiden; University of North Texas; University of North Florida; Queen Mary University of London; Seoul National University; University of South Florida; York University; Aix-Marseille Université; Université de Montpellier; Univerzita Karlova v Praze","keywords":"Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.04844326896163092,"score_gpt":0.32058332757919805,"score_spread":0.2721400586175671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013871422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034954686,0.0002361824,0.9532499,0.0015217178,0.0006473974,0.0038093335,0.0011344808,0.0005790379,0.0038672942],"genre_scores_gemma":[0.86352414,0.00006838112,0.12756903,0.006046808,0.0004915372,0.0010483173,0.0004852552,0.00012701876,0.00063952385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952461,0.00019894446,0.0014948952,0.00072134234,0.0008033441,0.0015353395],"domain_scores_gemma":[0.9953964,0.0013495024,0.00065218704,0.0012713755,0.00062429823,0.00070626463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015976763,0.00071512215,0.0010735058,0.00043382533,0.0007966676,0.00062087877,0.0033184616,0.00027943007,0.00003884193],"category_scores_gemma":[0.000420335,0.0006496554,0.00064890727,0.0010276146,0.00045615438,0.0028737085,0.0010205164,0.0006657724,0.00025408738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021508294,0.0008014465,0.0012119833,0.001770714,0.001151128,0.000018936858,0.06749488,0.0010937005,0.0028127974,0.8459861,0.047564954,0.027942492],"study_design_scores_gemma":[0.022348793,0.005832507,0.00079883623,0.000542614,0.00025495718,0.00017032724,0.016608603,0.2552432,0.05516608,0.25215507,0.3860003,0.004878699],"about_ca_topic_score_codex":0.0000026870878,"about_ca_topic_score_gemma":0.0000034633185,"teacher_disagreement_score":0.8285694,"about_ca_system_score_codex":0.00013104209,"about_ca_system_score_gemma":0.00018387083,"threshold_uncertainty_score":0.99959546},"labels":[],"label_agreement":null},{"id":"W3014386945","doi":"10.1007/978-3-662-66491-9_4","title":"Generating Weakly Chordal Graphs from Arbitrary Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University; University of Windsor","funders":"","keywords":"Chordal graph; Combinatorics; Treewidth; Interval graph; Split graph; Mathematics; Pathwidth; Indifference graph; Outerplanar graph; Discrete mathematics; Graph; Computer science; 1-planar graph; Line graph","score_opus":0.019875321825239625,"score_gpt":0.2652933343195548,"score_spread":0.2454180124943152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014386945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001039237,0.0017229607,0.9885312,0.0005543531,0.0025947236,0.00057768053,0.000043524713,0.0003752987,0.0045610364],"genre_scores_gemma":[0.052569464,0.00023015734,0.9425833,0.0033661562,0.0006156138,0.000072200404,0.00005055425,0.00013110292,0.00038140925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99214065,0.00018824532,0.0007946327,0.0030740753,0.0024623754,0.0013400123],"domain_scores_gemma":[0.99493235,0.0012672162,0.00039462748,0.0027931936,0.00022881731,0.00038381756],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015646816,0.0008629287,0.0007932228,0.002037294,0.0010089251,0.0008303762,0.008221413,0.0003287394,0.00029025867],"category_scores_gemma":[0.00013998787,0.0008607968,0.00035700327,0.0020421627,0.0013460097,0.0014235026,0.004572558,0.0027861984,0.000047456717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020319589,0.00005796786,0.0001396317,0.000024523446,0.000044963494,0.0005147911,0.0009352213,0.041153837,0.002135402,0.44153497,0.000042596213,0.5133958],"study_design_scores_gemma":[0.00024605633,0.00019320149,0.00006239025,0.0001099598,0.00000663947,0.00005483498,3.6631502e-7,0.19468243,0.0012384133,0.8003822,0.002160802,0.00086271553],"about_ca_topic_score_codex":0.00009773803,"about_ca_topic_score_gemma":0.0000983237,"teacher_disagreement_score":0.51253307,"about_ca_system_score_codex":0.0003687198,"about_ca_system_score_gemma":0.0008106661,"threshold_uncertainty_score":0.9995144},"labels":[],"label_agreement":null},{"id":"W3014452398","doi":"10.1016/j.jctb.2023.03.004","title":"Graph product structure for non-minor-closed classes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Treewidth; 1-planar graph; Mathematics; Planar graph; Pathwidth; Discrete mathematics; Indifference graph; Partial k-tree; Graph product; Adjacency list; Clique-sum; Chordal graph; Graph; Line graph","score_opus":0.015486756748058885,"score_gpt":0.2911500817685745,"score_spread":0.2756633250205156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014452398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81255347,0.00054996903,0.13413496,0.004088317,0.04470081,0.00189025,0.00006425779,0.00051122316,0.0015067316],"genre_scores_gemma":[0.9902881,0.00007277757,0.007554167,0.000058951744,0.0012944962,0.000015110202,0.0000034860761,0.000037516533,0.0006753921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997606,0.00031799785,0.0005569237,0.00031197807,0.0006773367,0.00052977994],"domain_scores_gemma":[0.9969603,0.0009217114,0.0004546437,0.0006388983,0.0008332141,0.0001912332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022434327,0.00023575898,0.00045756847,0.0005527009,0.00029372875,0.00019768407,0.0018205487,0.00009728798,0.000022406008],"category_scores_gemma":[0.00117616,0.00018986371,0.00027599433,0.0014805824,0.00023558667,0.0015548215,0.00027387904,0.0004344703,0.000008298206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010856662,0.000058355992,0.0001320224,0.000056293364,0.00011047949,0.000055553704,0.00052827614,0.00009822312,0.013777125,0.97545385,0.0032912008,0.0053529716],"study_design_scores_gemma":[0.0013885901,0.00093838613,0.00056009577,0.000035621793,0.000014915786,0.00008660986,0.00017704854,0.000047040987,0.037782148,0.94544727,0.013318591,0.00020368947],"about_ca_topic_score_codex":3.7268154e-7,"about_ca_topic_score_gemma":5.1838737e-7,"teacher_disagreement_score":0.17773461,"about_ca_system_score_codex":0.000054713873,"about_ca_system_score_gemma":0.00027634192,"threshold_uncertainty_score":0.77424175},"labels":[],"label_agreement":null},{"id":"W3015825817","doi":"10.1016/j.jcta.2020.105253","title":"Lower bounds for graph bootstrap percolation via properties of polynomials","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Hypercube; Simple (philosophy); Mathematics; Combinatorics; Torus; Graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.036241503016032364,"score_gpt":0.2793446789304078,"score_spread":0.24310317591437547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015825817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3979064,0.0013917217,0.5895771,0.0034584126,0.00633528,0.00083909696,0.000009902573,0.00007526888,0.00040685618],"genre_scores_gemma":[0.99498606,0.000035060544,0.0042914203,0.0001089934,0.0005032352,0.000008994768,3.4690626e-7,0.000018730141,0.00004718715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980229,0.00031605977,0.0006942395,0.0001883572,0.0005038952,0.0002745247],"domain_scores_gemma":[0.9979519,0.00026092547,0.000578828,0.0002750743,0.0007509023,0.00018235954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015654424,0.0001679855,0.0004586523,0.00017638951,0.0001514753,0.00011672963,0.0010432607,0.000087655775,0.00001861106],"category_scores_gemma":[0.000656986,0.00013476772,0.00030259867,0.00045930254,0.0002697019,0.0016189666,0.00014636548,0.00024426563,0.0000014668387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005105482,0.00012557584,0.000036349775,0.000083879095,0.0001100346,0.000008719519,0.0017272537,0.00009067288,0.14079957,0.84936416,0.00020805356,0.0023402546],"study_design_scores_gemma":[0.0016084729,0.003189972,0.000037032467,0.000060543905,0.000022307637,0.00003523096,0.00025051847,0.00022495424,0.1230446,0.8671668,0.004188378,0.00017118252],"about_ca_topic_score_codex":9.0295146e-7,"about_ca_topic_score_gemma":2.1175863e-7,"teacher_disagreement_score":0.59707963,"about_ca_system_score_codex":0.00003874785,"about_ca_system_score_gemma":0.00021889644,"threshold_uncertainty_score":0.5495668},"labels":[],"label_agreement":null},{"id":"W3016468461","doi":"10.1016/j.disc.2021.112309","title":"Reflexive coloring complexes for 3-edge-colorings of cubic graphs","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canada Excellence Research Chairs, Government of Canada","keywords":"Combinatorics; Graph coloring; Edge coloring; Mathematics; Cubic graph; Complete coloring; Discrete mathematics; Graph; 1-planar graph; Line graph; Graph power; Voltage graph","score_opus":0.07047065590626489,"score_gpt":0.3604143091718357,"score_spread":0.2899436532655708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016468461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102537625,0.00046311197,0.8913427,0.00018011496,0.00039443534,0.0015225424,0.000096932825,0.00021223028,0.0032503328],"genre_scores_gemma":[0.3743522,0.00009893643,0.62450504,0.000031047977,0.000040229093,0.00050812954,0.000060576018,0.000071384726,0.00033246385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968649,0.00011151098,0.0008818586,0.00085201534,0.00067216315,0.00061755255],"domain_scores_gemma":[0.99558246,0.0010166633,0.0007137696,0.001960939,0.00056899566,0.00015715207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092771224,0.00044804552,0.0010167832,0.0003527755,0.00016894311,0.0002799201,0.002639692,0.00024840608,0.000015035899],"category_scores_gemma":[0.00046678795,0.00043004454,0.00055035757,0.0005555519,0.00039523744,0.0002901808,0.0035405266,0.0005937233,0.0000055635273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020345255,0.0001288203,0.000029603514,0.0032326214,0.00019628897,0.000012410398,0.0045139585,0.00066361396,0.0045604096,0.98602396,0.00005438742,0.00056359486],"study_design_scores_gemma":[0.00040235667,0.00016303331,0.000044468376,0.0010079152,0.00005997875,0.000010632129,0.0010401736,0.030562017,0.039663505,0.9262362,0.0002572693,0.00055240834],"about_ca_topic_score_codex":0.0000069197363,"about_ca_topic_score_gemma":0.0000063154657,"teacher_disagreement_score":0.27181455,"about_ca_system_score_codex":0.000093768685,"about_ca_system_score_gemma":0.00021035926,"threshold_uncertainty_score":0.9998151},"labels":[],"label_agreement":null},{"id":"W3017097095","doi":"10.1016/j.dam.2020.04.001","title":"Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Graph; Property (philosophy); Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.020516455690896142,"score_gpt":0.24476587544284775,"score_spread":0.22424941975195162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017097095","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00442855,0.000110655295,0.9862281,0.00087356113,0.000065911954,0.0005657248,0.00001568862,0.00013174878,0.0075800237],"genre_scores_gemma":[0.18339437,0.00007796288,0.814631,0.0014847914,0.000033141383,0.00009087748,0.000023953118,0.000046775804,0.00021715045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980782,0.000024507433,0.00034690055,0.0005381036,0.0005669364,0.00044533948],"domain_scores_gemma":[0.9984545,0.00034664446,0.00014801194,0.0006587384,0.00005250286,0.00033959342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015775244,0.0002806007,0.00032879485,0.00003704705,0.00018225807,0.0001442751,0.0008105954,0.00007430456,0.00007641701],"category_scores_gemma":[0.00006293987,0.00024223933,0.000048399514,0.00033308193,0.000090233734,0.0002739862,0.00030991176,0.0002605426,0.000005058846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039827457,0.000055697255,0.000059751183,0.00010971275,0.00007725515,0.000019588055,0.0035296488,0.017813297,0.00006492694,0.97086334,0.0032605815,0.0041063433],"study_design_scores_gemma":[0.0021347336,0.00038486626,0.00028078427,0.00020592802,0.00008093918,0.000023075485,0.002951569,0.57205445,0.001829404,0.41141382,0.0066854344,0.001955024],"about_ca_topic_score_codex":0.02658291,"about_ca_topic_score_gemma":0.3761815,"teacher_disagreement_score":0.55944955,"about_ca_system_score_codex":0.00021541386,"about_ca_system_score_gemma":0.0002676394,"threshold_uncertainty_score":0.9878233},"labels":[],"label_agreement":null},{"id":"W3018965338","doi":"10.1016/j.dam.2021.09.021","title":"Flexibility of planar graphs—Sharpening the tools to get lists of size four","year":2021,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; List coloring; Vertex (graph theory); Mathematics; Graph; Mathematical proof; Discrete mathematics; Computer science; Graph power; Line graph; Geometry","score_opus":0.06250255365461961,"score_gpt":0.32508935840767045,"score_spread":0.26258680475305085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018965338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13639383,0.00012808369,0.85515463,0.00031790236,0.00015610502,0.0018269505,0.00014988316,0.00011185299,0.0057607396],"genre_scores_gemma":[0.5135759,0.000022273929,0.48600277,0.00006914054,0.000022986802,0.00019317106,0.000020488094,0.00003595551,0.00005731323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963423,0.00012798113,0.0010755953,0.00084134354,0.0011115154,0.0005012668],"domain_scores_gemma":[0.99283385,0.0022159836,0.0007424091,0.0037300999,0.00031487553,0.00016277531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018690475,0.0004221529,0.000988959,0.00015909808,0.00011254042,0.00022644311,0.0038943836,0.00021679551,0.00003702783],"category_scores_gemma":[0.0009218094,0.00031790495,0.00036025656,0.00077409926,0.00028655617,0.00014312023,0.003907067,0.0007566905,0.000008828846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045229495,0.00016276537,0.000024885714,0.0024327235,0.00021030603,0.000013295457,0.01025439,0.0029760322,0.014224983,0.9650747,0.00012299395,0.0044576926],"study_design_scores_gemma":[0.0002610274,0.000057755635,0.00026358478,0.000557576,0.000049910872,0.000008921018,0.0013066891,0.006350959,0.032017007,0.9585683,0.00007548759,0.00048278354],"about_ca_topic_score_codex":0.000012489377,"about_ca_topic_score_gemma":0.000012813765,"teacher_disagreement_score":0.37718207,"about_ca_system_score_codex":0.000050585986,"about_ca_system_score_gemma":0.00022436827,"threshold_uncertainty_score":0.9999273},"labels":[],"label_agreement":null},{"id":"W3020957989","doi":"10.1145/3357713.3384316","title":"Catalytic approaches to the tree evaluation problem","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Branching (polymer chemistry); Mathematics; Combinatorics; Binary decision diagram; Tree (set theory); Binary number; Algorithm; Binary tree; Parameterized complexity; Discrete mathematics; Chemistry; Arithmetic","score_opus":0.27328486343272657,"score_gpt":0.32320736811164585,"score_spread":0.04992250467891929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020957989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073531416,0.000042567823,0.8957541,0.06447039,0.000025192872,0.00073381345,4.211728e-7,0.00011449608,0.038123686],"genre_scores_gemma":[0.93838084,6.705896e-7,0.059431694,0.0015604969,0.00005166346,0.00013044689,0.000001507546,0.0000059394633,0.00043671462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988101,0.000120114666,0.00009492825,0.0003001156,0.0004854209,0.00018930838],"domain_scores_gemma":[0.99929065,0.00008106741,0.000017672275,0.00044124757,0.00005224941,0.00011713121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078962697,0.000064803724,0.000059551832,0.00003525764,0.00009302237,0.000099380464,0.0011186922,0.000014464543,0.000016502372],"category_scores_gemma":[0.00012864413,0.00003903123,0.000028004235,0.0007677531,0.00002640042,0.00025578795,0.0003589849,0.00008915905,0.00043673383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008514428,0.00001795047,0.000059046306,0.000007740093,0.000009691674,0.000001019781,0.0031509416,0.0056786784,0.00020258369,0.5159914,0.0026313716,0.47224104],"study_design_scores_gemma":[0.00022710348,0.00014537206,0.00048562005,0.0000033942918,0.0000051021616,0.0000031801087,0.00018749296,0.9008168,0.0044061206,0.08705239,0.006527005,0.00014039506],"about_ca_topic_score_codex":0.0000038702915,"about_ca_topic_score_gemma":0.000018472527,"teacher_disagreement_score":0.93764555,"about_ca_system_score_codex":0.000024317096,"about_ca_system_score_gemma":0.00006203859,"threshold_uncertainty_score":0.56134754},"labels":[],"label_agreement":null},{"id":"W3021119914","doi":"10.1007/s10107-020-01587-x","title":"Idealness of <i>k</i>-wise intersecting families.","year":2022,"lang":"en","type":"article","venue":"PubMed","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; European Research Council; Institute for Basic Science; Australian Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Conjecture; Element (criminal law); Ideal (ethics); Integer (computer science); Matroid; Discrete mathematics; Field (mathematics); Binary number; Pure mathematics; Arithmetic; Computer science; Law","score_opus":0.026415396896748242,"score_gpt":0.24974928427572118,"score_spread":0.22333388737897295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021119914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6094934,0.0005422558,0.3530556,0.001176561,0.0019623702,0.0016608658,0.000020876887,0.0004917378,0.031596392],"genre_scores_gemma":[0.99713755,0.000003538898,0.0012407742,0.00012647144,0.000016736345,0.0011365721,7.2964116e-7,0.000008218686,0.00032941194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986259,0.00016816783,0.00017806108,0.0002602618,0.0003982306,0.000369395],"domain_scores_gemma":[0.99913204,0.00017757759,0.00008266517,0.00048326098,0.00004737064,0.00007711655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001007149,0.00006985854,0.00012136905,0.00021063491,0.0001632432,0.000023594956,0.0012386192,0.00001143496,0.000016086056],"category_scores_gemma":[0.00013391882,0.00007298115,0.0000596423,0.00090505794,0.00006515453,0.00024254316,0.0013343261,0.00021534471,0.0000024640224],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040203216,0.00008896814,0.002524459,0.00002674505,0.000024222547,0.000027583721,0.0014483103,0.0013181185,0.00028917653,0.10591434,0.00037639067,0.8879215],"study_design_scores_gemma":[0.005530368,0.00057186466,0.21459715,0.000031072508,0.000031338364,0.0003387119,0.0109182745,0.03337535,0.061954193,0.5806084,0.08976793,0.0022753098],"about_ca_topic_score_codex":0.000020185187,"about_ca_topic_score_gemma":0.000003224331,"teacher_disagreement_score":0.88564616,"about_ca_system_score_codex":0.00006960731,"about_ca_system_score_gemma":0.00002478822,"threshold_uncertainty_score":0.2976085},"labels":[],"label_agreement":null},{"id":"W3021331763","doi":"10.1137/20m1343099","title":"The Structure of $I_4$-Free and Triangle-Free Binary Matroids","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Ontario Research Foundation","keywords":"Matroid; Mathematics; Combinatorics; Graphic matroid; Rank (graph theory); Simple (philosophy); Binary number; Discrete mathematics","score_opus":0.015763332282154097,"score_gpt":0.27661869244182685,"score_spread":0.26085536015967276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021331763","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72896624,0.0067475107,0.22969234,0.02308634,0.0020959396,0.0018108248,0.00041053057,0.00025764952,0.006932656],"genre_scores_gemma":[0.89109796,0.00030572465,0.1069313,0.00020316083,0.00014512325,0.000013654291,0.000002007072,0.00006358219,0.0012374896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974605,0.0003318237,0.00053188973,0.0002084134,0.0010895596,0.00037784938],"domain_scores_gemma":[0.9969967,0.0008356621,0.00044602153,0.001482832,0.0000895941,0.00014919773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013814392,0.00018090455,0.00030795016,0.00021009982,0.00095669815,0.00021647061,0.0034996315,0.000034380973,0.000060601917],"category_scores_gemma":[0.0006136114,0.0001138724,0.00015144917,0.0005171168,0.00020966634,0.0002540911,0.0020682735,0.00080303504,0.0000019440422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001374499,0.00009852641,0.00004633637,0.00009065253,0.00010025188,0.0000994704,0.0020725352,0.0008161251,0.004778906,0.98278284,0.0035396526,0.0054372484],"study_design_scores_gemma":[0.0010412572,0.0007651074,0.00008591737,0.00004465418,0.000012422408,0.0007050876,0.001077601,0.00838092,0.0010016744,0.98500144,0.0017253408,0.00015860144],"about_ca_topic_score_codex":5.3447087e-7,"about_ca_topic_score_gemma":0.0000013679094,"teacher_disagreement_score":0.16213176,"about_ca_system_score_codex":0.000065311295,"about_ca_system_score_gemma":0.00008450467,"threshold_uncertainty_score":0.7358245},"labels":[],"label_agreement":null},{"id":"W3022128000","doi":"10.1093/qmath/haab020","title":"Defining Bicircular Matroids in Monadic Logic","year":2021,"lang":"en","type":"preprint","venue":"The Quarterly Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Douglas College","funders":"Royal Society Te Apārangi","keywords":"Matroid; Class (philosophy); Conjecture; Graphic matroid; Frame (networking); Minor (academic); Computer science; Sentence; Order (exchange); Mathematics; Combinatorics; Discrete mathematics; Philosophy; Natural language processing; Artificial intelligence; Economics; Humanities","score_opus":0.02945989302064086,"score_gpt":0.3064348639715244,"score_spread":0.2769749709508836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022128000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2455906,0.0072525577,0.7451863,0.0009474026,0.00046861425,0.00022969856,0.0000020337498,0.00002938237,0.00029340267],"genre_scores_gemma":[0.7571756,0.00023219745,0.24230248,0.00011146365,0.00009266819,0.000012115642,0.0000012568203,0.000036964957,0.000035217177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652433,0.0005321586,0.0012211227,0.0002847866,0.0009799569,0.0004576462],"domain_scores_gemma":[0.9962149,0.000808968,0.0011076226,0.0013867387,0.00035469647,0.00012706406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037987165,0.00030372522,0.00075188687,0.00048888125,0.00009108061,0.00046790842,0.003692228,0.00018219206,0.000018550987],"category_scores_gemma":[0.00020784626,0.0002073668,0.0003813452,0.00053677,0.00013584466,0.0003334856,0.0005410286,0.0019582096,0.000025213065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025792826,0.0010527684,0.0002525611,0.0014183369,0.00049397984,0.003167793,0.07963427,0.020315167,0.0014012187,0.8437441,0.00019020401,0.04830381],"study_design_scores_gemma":[0.00034485784,0.00030227224,0.000118546275,0.0010314119,0.000033209555,0.0011930953,0.0044260737,0.028402895,0.00016040148,0.9637284,0.000022634005,0.00023617873],"about_ca_topic_score_codex":0.000006862448,"about_ca_topic_score_gemma":0.000008494593,"teacher_disagreement_score":0.51158506,"about_ca_system_score_codex":0.00014493983,"about_ca_system_score_gemma":0.00040231456,"threshold_uncertainty_score":0.8507555},"labels":[],"label_agreement":null},{"id":"W30224642","doi":"10.1038/s41598-018-32298-1","title":"On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cyclomatic complexity; Combinatorics; Discrete mathematics; Computer science; Programming language; Software","score_opus":0.02159831771197511,"score_gpt":0.28798031761858794,"score_spread":0.2663819999066128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30224642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880079,0.000078447716,0.0030418646,0.0005617631,0.0014021461,0.00046445514,0.000007591369,0.00041447917,0.006021321],"genre_scores_gemma":[0.9968105,0.00008006245,0.0022709093,0.0004208203,0.000011236957,0.00007493193,0.000003846088,0.00005799732,0.00026967688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963376,0.00018422832,0.00044351406,0.00090973714,0.0011360733,0.0009888762],"domain_scores_gemma":[0.9974142,0.00035240146,0.00017979497,0.0014973267,0.00017689637,0.00037938613],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051218853,0.00042326213,0.00045686358,0.00024008524,0.00044128738,0.00029034796,0.002092248,0.00016701569,0.00008616206],"category_scores_gemma":[0.00014286414,0.00044648323,0.00024719266,0.001859618,0.0001811436,0.0011164694,0.0005879773,0.0006204873,0.0014290129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033951965,0.0004576774,0.0037379048,0.00004389769,0.00006826623,0.00006665834,0.00080656545,0.00009875501,0.001100302,0.9922997,0.00017430981,0.0011120175],"study_design_scores_gemma":[0.0020251917,0.00015176019,0.0043442254,0.00017469638,0.000009932037,0.000039240735,0.000045461315,0.00024502756,0.02083041,0.9715254,0.00011039989,0.0004982891],"about_ca_topic_score_codex":0.00006848611,"about_ca_topic_score_gemma":0.000010899858,"teacher_disagreement_score":0.020774327,"about_ca_system_score_codex":0.00019240304,"about_ca_system_score_gemma":0.000112556096,"threshold_uncertainty_score":0.9997987},"labels":[],"label_agreement":null},{"id":"W3022534016","doi":"","title":"On Pitfalls in Computing the Geodetic Number of a Graph","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Geodetic datum; Combinatorics; Mathematics; Graph; Shortest path problem; Geodesic; Discrete mathematics; Connectivity; Geodesy; Geography","score_opus":0.01666711046111486,"score_gpt":0.31680160010200253,"score_spread":0.3001344896408877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022534016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5608537,0.000033792167,0.4111809,0.001614631,0.000048785172,0.00018215005,3.082712e-7,0.0000618044,0.026023917],"genre_scores_gemma":[0.97401094,0.0000038405587,0.02530778,0.00040909712,0.000013251628,0.0000027006424,8.665062e-8,0.0000042590777,0.0002480364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989789,0.00011613645,0.00017660474,0.00020245193,0.00027155798,0.0002543549],"domain_scores_gemma":[0.9988483,0.0005417098,0.000039321592,0.0004978611,0.000038431386,0.000034342433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057809404,0.00007132287,0.00009871035,0.00009912727,0.000049542832,0.000026042737,0.00090781273,0.000022303588,0.00004999174],"category_scores_gemma":[0.0000537568,0.000045717923,0.000044238273,0.0006654009,0.000092231225,0.00014361503,0.000230115,0.00016943384,0.00010958861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062951235,0.00006805614,0.0018389061,0.0000030918802,0.0000034513373,0.0000025677791,0.0004539583,0.0043787807,0.00016553738,0.96345365,0.000100618316,0.029525084],"study_design_scores_gemma":[0.0008332955,0.00010710062,0.016436843,0.00006533804,0.0000014980751,0.00002481415,0.000110526395,0.2181567,0.0057132794,0.7575959,0.0006981677,0.00025655405],"about_ca_topic_score_codex":0.000021922451,"about_ca_topic_score_gemma":0.00003796722,"teacher_disagreement_score":0.41315722,"about_ca_system_score_codex":0.00001809837,"about_ca_system_score_gemma":0.000018183888,"threshold_uncertainty_score":0.18643229},"labels":[],"label_agreement":null},{"id":"W3022937793","doi":"10.2140/involve.2023.16.249","title":"Pairs of disjoint matchings and related classes of graphs","year":2023,"lang":"en","type":"article","venue":"Involve a Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Graph; Matching (statistics); Induced subgraph; Discrete mathematics","score_opus":0.03364547344454044,"score_gpt":0.2960918141248234,"score_spread":0.26244634068028294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022937793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93721473,0.00060293777,0.061257504,0.00037694987,0.00011155207,0.00010879336,0.0000031788327,0.000031534808,0.00029281297],"genre_scores_gemma":[0.92734057,0.0004941844,0.07206734,0.0000113821125,0.000006914298,0.0000011365795,2.4725475e-7,0.000013304022,0.00006493458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983068,0.00008045792,0.0007913776,0.00010081158,0.00054018793,0.00018033538],"domain_scores_gemma":[0.997569,0.000912631,0.0007968321,0.0003119164,0.00031867018,0.00009091033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016346861,0.00010170902,0.00037803204,0.00047464113,0.0000368533,0.000024552224,0.00063121534,0.00005006102,0.000006565487],"category_scores_gemma":[0.00054019847,0.00007700744,0.00014485273,0.00089669577,0.00020506047,0.00035828154,0.00025302073,0.00022435558,0.0000037553127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000432915,0.0004973976,0.0023745056,0.0014897445,0.0003942856,0.00019850199,0.026612068,0.00061486004,0.041992005,0.91736156,0.0009733207,0.0074484656],"study_design_scores_gemma":[0.0003460926,0.00030446827,0.00069024623,0.00045412235,0.000017380917,0.00016466054,0.0014925757,0.007058471,0.008693321,0.9806652,0.000031334795,0.00008213731],"about_ca_topic_score_codex":0.0000014966865,"about_ca_topic_score_gemma":7.6398925e-7,"teacher_disagreement_score":0.063303635,"about_ca_system_score_codex":0.000011450435,"about_ca_system_score_gemma":0.00006103622,"threshold_uncertainty_score":0.31402722},"labels":[],"label_agreement":null},{"id":"W3023069363","doi":"10.55016/ojs/cdm.v19i3.75096","title":"note on total co-independent domination in trees","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Junta de Andalucía","keywords":"Mathematics; Combinatorics","score_opus":0.015496870354148162,"score_gpt":0.3529796377747737,"score_spread":0.33748276742062555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023069363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01377313,0.00008983337,0.9784585,0.0033987053,0.00018779913,0.0005717541,0.00012293113,0.00021990253,0.0031774472],"genre_scores_gemma":[0.9836233,0.000005944388,0.015349314,0.00005628101,0.00004899489,0.00013022577,0.000015651965,0.000015436703,0.0007548359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834013,0.00008407029,0.0003288017,0.00037860614,0.00046940884,0.0003990103],"domain_scores_gemma":[0.9985866,0.00055450515,0.00003535362,0.0005765749,0.000108770604,0.00013818465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008174633,0.00016037936,0.00020121304,0.0004985198,0.000120125274,0.0003315489,0.00055549026,0.00007091531,0.000029685301],"category_scores_gemma":[0.00065333734,0.00013780137,0.00009018124,0.0009576983,0.00005034887,0.0003725839,0.00018641757,0.0002684942,0.0005328507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008358721,0.00008176541,0.0000061364462,0.000030119816,0.000010758827,0.00004861194,0.0014209945,0.0008866149,0.0021009028,0.987972,0.00027783582,0.007155902],"study_design_scores_gemma":[0.0007577944,0.0003120024,0.00077980175,0.00052403763,0.0000133220465,0.000053863034,0.00020876943,0.45371816,0.013478427,0.5264587,0.0032094915,0.0004856364],"about_ca_topic_score_codex":0.0000023595776,"about_ca_topic_score_gemma":0.000017155544,"teacher_disagreement_score":0.9698502,"about_ca_system_score_codex":0.0003494688,"about_ca_system_score_gemma":0.00009293205,"threshold_uncertainty_score":0.68488955},"labels":[],"label_agreement":null},{"id":"W3025859122","doi":"10.48550/arxiv.2005.05547","title":"List homomorphism problems for signed trees","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Homomorphism; Signed graph; Combinatorics; Computer science; Mathematics; Discrete mathematics; Graph","score_opus":0.13146786052517617,"score_gpt":0.2234620014538894,"score_spread":0.09199414092871322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025859122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012827688,0.00009747379,0.9829228,0.0007218163,0.00036791028,0.0011544382,0.000060531293,0.0004975309,0.0013498423],"genre_scores_gemma":[0.98811805,0.00007687897,0.008731058,0.00013277405,0.00010585562,0.000012545117,0.000035213758,0.000038941,0.002748656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972732,0.00014284022,0.00022314444,0.0016398364,0.00014677653,0.0005741994],"domain_scores_gemma":[0.997398,0.00028639613,0.00023207918,0.0014876017,0.0002686962,0.0003271873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032052552,0.00038135395,0.00044834462,0.00031195633,0.00025918914,0.00019181143,0.0037084108,0.0002676715,0.000025790623],"category_scores_gemma":[0.0000950659,0.00044199897,0.00036451867,0.00088503584,0.00024384745,0.0004419714,0.0030250174,0.00064745505,0.000074934855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010541664,0.000119425626,0.0003027455,0.00023510339,0.0001383439,0.0002770029,0.0003939571,0.057046,0.0011876972,0.9381416,0.0010970582,0.0009556615],"study_design_scores_gemma":[0.00071376027,0.00018681485,0.00010026113,0.00007051406,0.000034757904,0.0000029223181,0.000035243207,0.30799663,0.0005143618,0.68681484,0.0030126602,0.00051724893],"about_ca_topic_score_codex":0.00004322253,"about_ca_topic_score_gemma":0.000043805623,"teacher_disagreement_score":0.9752904,"about_ca_system_score_codex":0.00017197111,"about_ca_system_score_gemma":0.0002428771,"threshold_uncertainty_score":0.9998032},"labels":[],"label_agreement":null},{"id":"W3026418435","doi":"10.1002/jgt.22579","title":"Generating simple near-bipartite bricks","year":2017,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Apoio ao Desenvolvimento do Ensino, Ciência e Tecnologia do Estado de Mato Grosso do Sul; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Bipartite graph; Combinatorics; Mathematics; Brick; Complete bipartite graph; Matching (statistics); Vertex (graph theory); Simple (philosophy); Class (philosophy); Discrete mathematics; Graph; Computer science","score_opus":0.08692357924479878,"score_gpt":0.35217860214297997,"score_spread":0.2652550228981812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026418435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89995736,0.0008313354,0.09282636,0.0016631099,0.0011700895,0.0004626383,0.000012952729,0.00015776139,0.002918368],"genre_scores_gemma":[0.9855455,0.00013947951,0.008666938,0.0006192455,0.0008313225,0.000040670817,0.0000042832753,0.000071307106,0.00408123],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99445623,0.00039284083,0.0007524283,0.0016041257,0.00090060843,0.0018937405],"domain_scores_gemma":[0.99259007,0.0002946411,0.0006704634,0.0053249775,0.00044596678,0.00067385694],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016020031,0.0005487626,0.0005697655,0.00014167349,0.006346974,0.0030303465,0.00540695,0.00023712547,0.00040607774],"category_scores_gemma":[0.001544269,0.0005782102,0.00031397588,0.00048827447,0.0013545789,0.003037861,0.0038169168,0.000996392,0.0024753287],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057066114,0.0002121187,0.8187441,0.00006890929,0.00012565778,0.0003564217,0.0018001061,0.0020616252,0.026607482,0.008951256,0.0011111904,0.13990405],"study_design_scores_gemma":[0.0019090399,0.000568368,0.47477227,0.00019293689,0.000046875837,0.000069505535,0.000108316395,0.44930145,0.022833884,0.012785228,0.03573081,0.0016813104],"about_ca_topic_score_codex":0.00023855857,"about_ca_topic_score_gemma":0.00009600368,"teacher_disagreement_score":0.44723982,"about_ca_system_score_codex":0.00011805644,"about_ca_system_score_gemma":0.00041655544,"threshold_uncertainty_score":0.99997425},"labels":[],"label_agreement":null},{"id":"W3027490412","doi":"10.1016/j.tcs.2020.05.010","title":"Local search is a PTAS for feedback vertex set in minor-free graphs","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Vertex (graph theory); Minor (academic); Robertson–Seymour theorem; Local search (optimization); Mathematics; Feedback vertex set; Set (abstract data type); Combinatorics; Discrete mathematics; Mathematical optimization; Computer science; Graph; 1-planar graph; Chordal graph","score_opus":0.03530793057521974,"score_gpt":0.30885142335840005,"score_spread":0.2735434927831803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027490412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02567782,0.000049560353,0.9630397,0.009525991,0.0002133829,0.0005928382,0.000018227272,0.00017390626,0.00070859154],"genre_scores_gemma":[0.85061604,0.0000049657892,0.14605984,0.0032164995,0.000047229667,0.000029041626,0.0000013443425,0.000016766126,0.000008255058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507713,0.00024550938,0.00041427018,0.0015104767,0.0013410973,0.0014114897],"domain_scores_gemma":[0.9964742,0.00087992265,0.00004767931,0.0014773727,0.00031974757,0.0008010822],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023541371,0.000295031,0.00037764572,0.00039889736,0.00036661793,0.0004340378,0.007831434,0.000100543315,0.00006254457],"category_scores_gemma":[0.00036355856,0.0002615173,0.00015098907,0.004049372,0.0052928855,0.0009527629,0.0034414527,0.00054416247,0.00013607655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090573405,0.000054021264,0.00010058765,0.00003047059,0.000005039231,0.000028940358,0.0019782898,0.00046262826,0.00046799093,0.9624081,0.00051006087,0.03386325],"study_design_scores_gemma":[0.0006984916,0.00045541496,0.00026737398,0.00002085876,0.000001656152,0.000012141877,0.000035554374,0.5570766,0.0048941053,0.43615812,0.00015021408,0.000229519],"about_ca_topic_score_codex":0.0000057163506,"about_ca_topic_score_gemma":0.0000017439272,"teacher_disagreement_score":0.82493824,"about_ca_system_score_codex":0.000096308046,"about_ca_system_score_gemma":0.0002900135,"threshold_uncertainty_score":0.9999837},"labels":[],"label_agreement":null},{"id":"W3028209208","doi":"10.1007/s10107-020-01513-1","title":"Maximum edge-disjoint paths in planar graphs with congestion 2","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Cegep Edouard Montpetit","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Constant (computer programming); Discrete mathematics; Omega; Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Path (computing); Graph; Computer science","score_opus":0.033529464418315336,"score_gpt":0.27690856794063273,"score_spread":0.2433791035223174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028209208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018476635,0.00006674868,0.9772338,0.0023042567,0.000023029286,0.0006107511,7.977387e-7,0.00033250684,0.00095143105],"genre_scores_gemma":[0.6133837,0.0000026322798,0.38622874,0.00020881661,0.000021668795,0.00011319345,0.0000022028235,0.000022153583,0.00001687733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981723,0.00010198045,0.00029715747,0.00046256985,0.00044981425,0.000516196],"domain_scores_gemma":[0.9990202,0.00022359141,0.00006434351,0.00037632853,0.00005415705,0.00026134742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045709877,0.00017751458,0.0002655085,0.00011872198,0.0000775386,0.00016294868,0.0006358014,0.000060445218,0.000018941608],"category_scores_gemma":[0.00025498963,0.0001368194,0.00005450002,0.00093974295,0.00015810326,0.00036074797,0.00016491476,0.00034508793,0.000115330346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058951347,0.00022023304,0.00079173746,0.00025877918,0.000017714936,0.00029384723,0.0023284683,0.00007397134,0.00032620938,0.775732,0.000031645108,0.21986648],"study_design_scores_gemma":[0.0010930427,0.000830141,0.0003802928,0.0002546994,0.000009523955,0.00007872465,0.00047718396,0.06301403,0.0007908098,0.93101233,0.0015511981,0.0005080138],"about_ca_topic_score_codex":0.0000021689962,"about_ca_topic_score_gemma":0.000003825936,"teacher_disagreement_score":0.5949071,"about_ca_system_score_codex":0.00003173836,"about_ca_system_score_gemma":0.000034190933,"threshold_uncertainty_score":0.55793333},"labels":[],"label_agreement":null},{"id":"W3033173111","doi":"10.1016/j.dam.2023.02.017","title":"A note on the connected game coloring number","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; List coloring; Degeneracy (biology); Fractional coloring; Complete coloring; Discrete mathematics; Graph coloring; Graph; Game tree; Edge coloring; Greedy coloring; Bounded function; Graph power; Sequential game; Game theory; Line graph; Mathematical economics","score_opus":0.03692038711881336,"score_gpt":0.3151873344760995,"score_spread":0.27826694735728613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033173111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1362916,0.00000523129,0.7497714,0.0027045736,0.00019270524,0.0012767991,0.000011790763,0.0015178315,0.10822808],"genre_scores_gemma":[0.9630505,0.000011659325,0.035448603,0.00034266664,0.000051564493,0.0003136529,0.000005321373,0.000044206834,0.0007318703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833095,0.0000369929,0.00024811906,0.00034240546,0.0005394732,0.0005020733],"domain_scores_gemma":[0.9970459,0.001633083,0.000097679316,0.0010862552,0.00004721872,0.00008990492],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006988159,0.0001850765,0.00020408245,0.000092245464,0.0002090499,0.00015933448,0.0012715327,0.000057308822,0.00005611215],"category_scores_gemma":[0.00022279953,0.00012229588,0.00007246829,0.0012852208,0.00012261054,0.00010343446,0.00051599223,0.00028373857,0.0030517257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071372597,0.000022018063,0.0000030114365,0.000028111166,0.000014847489,0.000010132998,0.0018634276,0.00017102581,0.0036380084,0.9927033,0.00050833466,0.0010306204],"study_design_scores_gemma":[0.0002999472,0.000031017153,0.000076787066,0.000044595876,0.0000061887004,0.0000072882503,0.00053462357,0.07841515,0.011515899,0.9068706,0.0019334989,0.0002643869],"about_ca_topic_score_codex":7.450696e-7,"about_ca_topic_score_gemma":0.0000010544079,"teacher_disagreement_score":0.82675886,"about_ca_system_score_codex":0.000035298177,"about_ca_system_score_gemma":0.000030318617,"threshold_uncertainty_score":0.99772453},"labels":[],"label_agreement":null},{"id":"W3034049481","doi":"10.1002/jgt.23000","title":"Clique‐width: Harnessing the power of atoms","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Grantová Agentura České Republiky; Leverhulme Trust; Univerzita Karlova v Praze","keywords":"Combinatorics; Mathematics; Split graph; Induced subgraph; Bounded function; Discrete mathematics; Clique graph; Block graph; Graph; Cograph; Chordal graph; Line graph; Graph power; 1-planar graph","score_opus":0.024456856401062845,"score_gpt":0.3125402169419337,"score_spread":0.28808336054087086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034049481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57530546,0.0015790418,0.41649786,0.0024816764,0.0012674606,0.0001881916,0.000003847031,0.000108093656,0.0025683658],"genre_scores_gemma":[0.99633455,0.00013672138,0.0030112588,0.00018393682,0.00006153872,0.0000021555563,2.0424785e-7,0.000016709893,0.00025294657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752134,0.00071338203,0.0005440127,0.00016736845,0.00069966237,0.00035423826],"domain_scores_gemma":[0.99695253,0.0014099205,0.00052228966,0.00064715056,0.00035555285,0.0001125524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064053945,0.00013047918,0.00027675318,0.0006665094,0.00018975945,0.00007899258,0.0020035217,0.000058814938,0.000031249238],"category_scores_gemma":[0.00044935924,0.000079329715,0.00033558812,0.0019943374,0.00042985892,0.00062545517,0.00032194564,0.00049472036,0.000025418729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011443041,0.000049221144,0.000770813,0.0000138383,0.00009106016,0.000097403165,0.0021782096,0.000150584,0.0033810001,0.9717853,0.0009381778,0.020429952],"study_design_scores_gemma":[0.000310488,0.00017915833,0.0053053224,0.00008041571,0.000009182461,0.00012243867,0.00045920393,0.00021335839,0.004588426,0.9873974,0.0012378653,0.00009676896],"about_ca_topic_score_codex":5.479299e-7,"about_ca_topic_score_gemma":4.600929e-7,"teacher_disagreement_score":0.42102906,"about_ca_system_score_codex":0.00002074325,"about_ca_system_score_gemma":0.00011804231,"threshold_uncertainty_score":0.3723075},"labels":[],"label_agreement":null},{"id":"W3034503485","doi":"10.1016/j.dam.2020.05.005","title":"A short note on the existence of infinite sequences of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e92\" altimg=\"si14.svg\"><mml:mi>γ</mml:mi></mml:math>-graphs of graphs","year":2020,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Sequence (biology)","score_opus":0.03701922180791595,"score_gpt":0.2808667488443835,"score_spread":0.24384752703646756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034503485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96795654,0.0002739847,0.02593564,0.00037849334,0.00018112303,0.00035179133,0.00030550762,0.000093622206,0.004523271],"genre_scores_gemma":[0.9640478,0.00038946257,0.034755424,0.00032866417,0.000077508295,0.00022284893,0.000045281096,0.00011848525,0.000014562657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942058,0.0001445072,0.0017186076,0.00094974204,0.0020584718,0.0009228757],"domain_scores_gemma":[0.99369043,0.0020796398,0.0015304083,0.0021308814,0.00021345292,0.0003551929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015883787,0.00063064933,0.0007452563,0.00025031884,0.0003828242,0.00018999756,0.0029521643,0.00043035744,0.000028643737],"category_scores_gemma":[0.00058936665,0.00057294883,0.00071457966,0.0015554854,0.0021640223,0.00039651236,0.0014314258,0.00089884404,0.00017220719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026504396,0.0002498994,0.000008876495,0.0021009918,0.00029368748,0.000048858692,0.008055741,0.0008581005,0.021335382,0.9655567,0.000034714696,0.0011920123],"study_design_scores_gemma":[0.0004928381,0.00095151964,0.000028300416,0.0010960955,0.00026590656,0.000038939183,0.0032536872,0.78653324,0.087764375,0.11889682,0.000104595805,0.00057365495],"about_ca_topic_score_codex":0.000036913923,"about_ca_topic_score_gemma":0.000015965417,"teacher_disagreement_score":0.8466599,"about_ca_system_score_codex":0.000013808813,"about_ca_system_score_gemma":0.00035684198,"threshold_uncertainty_score":0.9996722},"labels":[],"label_agreement":null},{"id":"W3035268094","doi":"10.55016/ojs/cdm.v18i1.71282","title":"Confining the robber on cographs","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Sociology; Computer science","score_opus":0.027986143969503535,"score_gpt":0.34651970039259955,"score_spread":0.318533556423096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035268094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060071726,0.000031814412,0.97332495,0.012280765,0.00019860711,0.00068383454,0.000104624036,0.0006217475,0.0067464975],"genre_scores_gemma":[0.97999805,0.000021553527,0.016180906,0.00089380244,0.00008436044,0.00037248773,0.00002468814,0.000033138538,0.0023909935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982935,0.00011045681,0.00027482986,0.00030312393,0.00045139896,0.00056669774],"domain_scores_gemma":[0.9971029,0.0012843738,0.000070558046,0.001147835,0.0002280815,0.00016626027],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001133375,0.00015923256,0.00019024784,0.00027363474,0.0005956905,0.0002482029,0.0013116605,0.00004866733,0.00002545367],"category_scores_gemma":[0.0013456228,0.00010585582,0.00012060851,0.0023725128,0.00013664507,0.00014895883,0.00048267393,0.00024354158,0.0017324571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003235941,0.000022228822,0.0000105239515,0.000006806576,0.000022694669,0.000008216109,0.0007833515,0.00079930096,0.00028048028,0.99273163,0.0039293985,0.001402144],"study_design_scores_gemma":[0.00057209376,0.00022061054,0.00065715925,0.00014115465,0.000019840885,0.00001971873,0.0007058844,0.09088482,0.003011286,0.86952287,0.03380365,0.00044093805],"about_ca_topic_score_codex":0.0000014861891,"about_ca_topic_score_gemma":0.0000027893082,"teacher_disagreement_score":0.9739909,"about_ca_system_score_codex":0.000046463872,"about_ca_system_score_gemma":0.000051542353,"threshold_uncertainty_score":0.99904484},"labels":[],"label_agreement":null},{"id":"W3036465104","doi":"10.48550/arxiv.2006.11713","title":"Graphs of relational structures: restricted types","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semilattice; Mathematics; Bounded function; Algebraic structure; Constraint satisfaction problem; Discrete mathematics; Affine transformation; Type (biology); Combinatorics; Pure mathematics","score_opus":0.10009595993754256,"score_gpt":0.22177759011177114,"score_spread":0.12168163017422859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036465104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15436143,0.00013218554,0.8417538,0.00023365484,0.00033574575,0.00034151578,0.00006433913,0.0002564383,0.0025208832],"genre_scores_gemma":[0.98858935,0.00012195194,0.01089922,0.00003122326,0.000026002877,4.5738346e-7,0.000025531475,0.00001366767,0.00029256928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982999,0.00020063265,0.0002034178,0.00086224516,0.0001824402,0.00025135526],"domain_scores_gemma":[0.9980578,0.00024340041,0.00025749934,0.0010124679,0.0002662831,0.00016257072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111300134,0.00021695973,0.0002895897,0.00042398952,0.000094220624,0.00003063704,0.002004855,0.00022664989,0.000037622758],"category_scores_gemma":[0.00014447718,0.00024449613,0.00019426899,0.0014889005,0.00021604556,0.00027279957,0.002026225,0.0007235306,0.000026173464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052112577,0.000020944979,0.0015924292,0.00004690533,0.000078833626,0.00010134767,0.00009383575,0.06412838,0.00021373104,0.93339074,0.000101688725,0.00017906602],"study_design_scores_gemma":[0.00025351715,0.000048464186,0.0035256452,0.00002834411,0.000020060641,0.0000018354717,0.000014172756,0.11329608,0.00035835907,0.882055,0.00019095578,0.00020756143],"about_ca_topic_score_codex":0.000032145508,"about_ca_topic_score_gemma":0.0000051195575,"teacher_disagreement_score":0.8342279,"about_ca_system_score_codex":0.00007188323,"about_ca_system_score_gemma":0.0002789418,"threshold_uncertainty_score":0.99702626},"labels":[],"label_agreement":null},{"id":"W3036472213","doi":"10.48550/arxiv.2006.12929","title":"Approximation algorithms for general cluster routing problem","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Vertex (graph theory); Triangle inequality; Combinatorics; Approximation algorithm; Undirected graph; Graph; Routing (electronic design automation); Mathematics; Weight function; Cluster (spacecraft); Graph algorithms; Computer science; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Artificial intelligence","score_opus":0.11950083996847681,"score_gpt":0.24259059314852227,"score_spread":0.12308975318004546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036472213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010776855,0.000017828066,0.9859668,0.00045901324,0.000265934,0.0011528187,0.00002289975,0.00034038868,0.0009974508],"genre_scores_gemma":[0.7085198,0.00002328706,0.28941327,0.00018681528,0.0002179994,0.000013975011,0.00005406983,0.0000374185,0.0015333386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758625,0.00018079286,0.00023059669,0.0013628192,0.00013587569,0.00050368626],"domain_scores_gemma":[0.9982199,0.00016620588,0.0002503786,0.0009123368,0.00025226554,0.00019889875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046899743,0.00029924844,0.00031675637,0.00022877281,0.00023129408,0.00018782826,0.0020919363,0.00023146103,0.000005455122],"category_scores_gemma":[0.000066983266,0.00034691612,0.00025048121,0.0006249801,0.00009220733,0.0005597198,0.0027999072,0.00058937445,0.000036935373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054694,0.00004426616,0.00011122994,0.00017878921,0.00007037813,0.000040028124,0.000362448,0.1700177,0.00017006598,0.8244345,0.00019688086,0.0043189945],"study_design_scores_gemma":[0.00038204694,0.00004238531,0.000029667439,0.000029333545,0.000014135804,0.0000016383057,0.000020686011,0.61929005,0.00029581034,0.37943375,0.00022264695,0.00023781286],"about_ca_topic_score_codex":0.000017837368,"about_ca_topic_score_gemma":0.0000036350928,"teacher_disagreement_score":0.69774294,"about_ca_system_score_codex":0.00021080389,"about_ca_system_score_gemma":0.00017636419,"threshold_uncertainty_score":0.99989825},"labels":[],"label_agreement":null},{"id":"W3036487380","doi":"10.1145/3470869","title":"On the Parameterized Approximability of Contraction to Classes of Chordal Graphs","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Department of Science and Technology, Ministry of Science and Technology, India; European Commission","keywords":"Parameterized complexity; Combinatorics; Chordal graph; Mathematics; Bounded function; Contraction (grammar); Treewidth; Time complexity; Discrete mathematics; Graph; Pathwidth; Line graph; Mathematical analysis","score_opus":0.0400114360570754,"score_gpt":0.3237282170312386,"score_spread":0.2837167809741632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036487380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22059958,0.00002938455,0.7768423,0.0007826886,0.0005457511,0.00092689914,0.000044277396,0.00009493029,0.00013417513],"genre_scores_gemma":[0.9236124,0.000026098387,0.07586382,0.0001995711,0.000010630297,0.00022141672,0.000014207725,0.000023523238,0.000028284543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954554,0.0019426714,0.0007292805,0.0008250651,0.000763055,0.00028453273],"domain_scores_gemma":[0.98852426,0.008115385,0.0004437087,0.0021557305,0.00065186183,0.000109059554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020129348,0.00032981887,0.0005708598,0.00055391976,0.00019813601,0.00011168363,0.0017422141,0.00021175496,0.00006590761],"category_scores_gemma":[0.0008896879,0.00027276963,0.000444034,0.0010314955,0.0003350536,0.0002237981,0.00013709305,0.0009995409,0.00000836236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012253424,0.0014325497,0.000009493684,0.0002828304,0.00041918832,0.0000045136107,0.0022535105,0.41383725,0.0066218423,0.36362743,0.000016864065,0.21026917],"study_design_scores_gemma":[0.00046904056,0.00042490373,0.0005466683,0.00020984495,0.00003923522,0.0000045035167,0.00036122548,0.016040867,0.047657166,0.93397313,0.0000108047025,0.00026258835],"about_ca_topic_score_codex":0.000020453455,"about_ca_topic_score_gemma":0.0000072023727,"teacher_disagreement_score":0.7030129,"about_ca_system_score_codex":0.00010213887,"about_ca_system_score_gemma":0.0002501735,"threshold_uncertainty_score":0.99997246},"labels":[],"label_agreement":null},{"id":"W3037156551","doi":"","title":"Rayleigh Matroids","year":2003,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Combinatorics; Matroid partitioning; Binary number; Minor (academic); Mathematics; Class (philosophy); Property (philosophy); Discrete mathematics; Computer science; Arithmetic","score_opus":0.059385771858763904,"score_gpt":0.1953893082144644,"score_spread":0.1360035363557005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037156551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15497425,0.00003390811,0.8199074,0.000038253933,0.00012469968,0.00009300643,8.488457e-7,0.00018379264,0.024643809],"genre_scores_gemma":[0.98998296,0.00002827675,0.004919628,0.0000758143,0.000010435189,2.8581934e-7,4.0331915e-7,0.00000849957,0.0049736802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998796,0.00016974875,0.00007833887,0.0004980699,0.00007755305,0.00038029524],"domain_scores_gemma":[0.9988322,0.00010714926,0.00003949151,0.00077985565,0.000076913224,0.00016436886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002706644,0.00011813379,0.000111632966,0.00017584181,0.00016836895,0.000046615205,0.0010064382,0.00005124374,0.00009568133],"category_scores_gemma":[0.00005634445,0.00012965883,0.00008179362,0.0011586138,0.00011196646,0.00065084756,0.00018455763,0.00016525043,0.00041682308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007463555,0.000031111816,0.0019850289,0.0000031027441,0.000010163251,0.00015468439,0.00003496355,0.003186859,0.00037782706,0.99381524,0.0001269146,0.00026662982],"study_design_scores_gemma":[0.0010088827,0.00013027061,0.0009256732,0.00001013317,0.000009555967,0.00003347032,0.00011130948,0.039526783,0.006391428,0.9362396,0.015166994,0.00044588622],"about_ca_topic_score_codex":0.0000043991545,"about_ca_topic_score_gemma":0.0000023954206,"teacher_disagreement_score":0.83500874,"about_ca_system_score_codex":0.000067680536,"about_ca_system_score_gemma":0.00005818594,"threshold_uncertainty_score":0.53575563},"labels":[],"label_agreement":null},{"id":"W3037312983","doi":"10.1002/jgt.22849","title":"Flexible list colorings in graphs with special degeneracy conditions","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; European Commission; Univerzita Karlova v Praze","keywords":"Degeneracy (biology); Combinatorics; Treewidth; Mathematics; List coloring; Planar graph; Graph; Discrete mathematics; 1-planar graph; Chordal graph; Degree (music); Indifference graph; Pathwidth; Graph power; Line graph","score_opus":0.015585480340653685,"score_gpt":0.27887344906230044,"score_spread":0.2632879687216467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037312983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9208137,0.0006627328,0.0664089,0.0009609335,0.0009869699,0.00032407956,0.000020669167,0.00006647951,0.009755571],"genre_scores_gemma":[0.9934018,0.000049688875,0.005552005,0.00029916162,0.00017144118,0.00003030517,0.0000015573393,0.000019686478,0.00047434695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747896,0.00064842094,0.00045162372,0.00024231077,0.00078327983,0.0003954096],"domain_scores_gemma":[0.998444,0.0004506091,0.00036271955,0.00039088793,0.00018920776,0.00016253618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024429394,0.00015213696,0.00028473837,0.0014442196,0.00044259278,0.00008769787,0.0015020903,0.000028423494,0.00035397496],"category_scores_gemma":[0.00007672849,0.00013060324,0.00017602045,0.0023835904,0.00027268357,0.00084930105,0.00032520897,0.00085008336,0.0000043544674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047196168,0.00022117909,0.002354102,0.000005480991,0.000046369114,0.00043770994,0.00065129047,0.002611669,0.0012495054,0.9895513,0.0007149824,0.001684471],"study_design_scores_gemma":[0.0012354582,0.0009022611,0.0036371981,0.00002468361,0.000009993067,0.00068927044,0.00063093763,0.00005162282,0.0017936203,0.9854829,0.005352069,0.00019002878],"about_ca_topic_score_codex":0.000004403765,"about_ca_topic_score_gemma":0.000011624302,"teacher_disagreement_score":0.072588146,"about_ca_system_score_codex":0.00012605495,"about_ca_system_score_gemma":0.00023195108,"threshold_uncertainty_score":0.53258455},"labels":[],"label_agreement":null},{"id":"W3039600647","doi":"10.48550/arxiv.2007.00688","title":"Typical structure of hereditary graph families. II. Exotic examples","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Cograph; Indifference graph; Split graph; Induced subgraph; Bipartite graph; Discrete mathematics; Conjecture; Pathwidth; Rothschild; 1-planar graph; Graph; Line graph; Vertex (graph theory)","score_opus":0.09766176624833148,"score_gpt":0.21185343449372313,"score_spread":0.11419166824539165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039600647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5746264,0.00014959305,0.4235865,0.00011838071,0.0004549057,0.0003060801,0.000088194785,0.00021761328,0.0004523626],"genre_scores_gemma":[0.9930416,0.00014831284,0.0064241863,0.000066547196,0.00008138411,4.1287018e-7,0.00002605447,0.000023963497,0.00018754737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753475,0.00024108459,0.00026135307,0.0012971257,0.00022085205,0.00044481587],"domain_scores_gemma":[0.99747825,0.00021650395,0.00022056779,0.0015918424,0.00021223995,0.0002805713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012627643,0.00036482266,0.00051677873,0.0004238879,0.00017154509,0.000038361795,0.0033878514,0.00033200489,0.00006051373],"category_scores_gemma":[0.000096472235,0.000399216,0.0002936321,0.001270389,0.0004521917,0.0003396604,0.0053309835,0.0010896793,0.000017943425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020056352,0.00011636918,0.0018005798,0.000323007,0.00024298254,0.0011509373,0.00059440575,0.078534536,0.0018184279,0.9135457,0.00055380183,0.0011186844],"study_design_scores_gemma":[0.0005143431,0.0001866254,0.003638666,0.00009590883,0.000051832536,0.000016790125,0.00018675727,0.049162462,0.0013395033,0.9439603,0.00030187474,0.0005449275],"about_ca_topic_score_codex":0.000055969587,"about_ca_topic_score_gemma":0.000030435247,"teacher_disagreement_score":0.41841522,"about_ca_system_score_codex":0.00009192943,"about_ca_system_score_gemma":0.0002503764,"threshold_uncertainty_score":0.999846},"labels":[],"label_agreement":null},{"id":"W3042919926","doi":"10.46298/dmtcs.6700","title":"Further results on Hendry's Conjecture","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Dawson College; Université de Montréal; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal; Sharif University of Technology","keywords":"Conjecture; Mathematics; Chordal graph; Combinatorics; Intersection (aeronautics); Collatz conjecture; Graph; Hamiltonian (control theory); Hamiltonian path; Point (geometry); Interval graph; Discrete mathematics; Geometry; 1-planar graph; Mathematical optimization","score_opus":0.017748012630023367,"score_gpt":0.2910877435517327,"score_spread":0.2733397309217094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042919926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007088707,0.000023891254,0.9694947,0.0043101194,0.00059944624,0.00048917666,0.000033610744,0.00036114012,0.01759918],"genre_scores_gemma":[0.80342996,0.0000018033656,0.1955104,0.0008174187,0.00007245621,0.000054228356,0.0000034640002,0.000026074877,0.00008416962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942195,0.00036586268,0.00054482225,0.0013023482,0.0024800287,0.0010874592],"domain_scores_gemma":[0.99585515,0.0010324913,0.00018655213,0.0023633037,0.0001550025,0.00040749196],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003910468,0.00035722464,0.00037134724,0.0004597657,0.0014221242,0.00057033385,0.006231075,0.000048304682,0.00021932849],"category_scores_gemma":[0.0003127615,0.00028542755,0.00016764287,0.0024307407,0.002669332,0.0004855083,0.004315979,0.0008078548,0.00014854436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003869497,0.000160126,0.0000022354945,0.0000114156255,0.000009102642,0.000054750813,0.0028523365,0.0017793754,0.00031192933,0.9899018,0.00016098795,0.0047172387],"study_design_scores_gemma":[0.00040726198,0.00062843825,0.000014086388,0.000019907948,0.0000034716084,0.00008742347,0.000118661235,0.3590143,0.0011056479,0.6377069,0.00058504986,0.00030883515],"about_ca_topic_score_codex":9.1312336e-7,"about_ca_topic_score_gemma":2.2083758e-7,"teacher_disagreement_score":0.7963413,"about_ca_system_score_codex":0.0001476023,"about_ca_system_score_gemma":0.000176003,"threshold_uncertainty_score":0.99995977},"labels":[],"label_agreement":null},{"id":"W3043877875","doi":"10.1016/j.dam.2020.07.010","title":"2-limited broadcast domination in subcubic graphs","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Johannesburg","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Domination analysis; Graph; Induced subgraph; Connectivity; Discrete mathematics","score_opus":0.02702497115867646,"score_gpt":0.2769321981802712,"score_spread":0.24990722702159474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043877875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049738586,0.00005939004,0.9340894,0.0012283982,0.00004096305,0.00067364506,0.0000048011666,0.00027172847,0.013893066],"genre_scores_gemma":[0.834309,0.000020719373,0.16517949,0.00032789097,0.00001938268,0.00008149439,0.000008816286,0.000025514351,0.000027729762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834085,0.00003336405,0.00037768393,0.0004202476,0.00043964767,0.000388222],"domain_scores_gemma":[0.99891055,0.0002224016,0.0001206041,0.0005428968,0.000045514087,0.00015803162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003436535,0.00019028233,0.0002692232,0.00020066576,0.00007148917,0.00011324615,0.0010058951,0.00006946182,0.000020266154],"category_scores_gemma":[0.000113955044,0.00017594063,0.00006701036,0.0014450521,0.00008490154,0.00028524332,0.00033745408,0.00025549522,0.00015382963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017375862,0.000056570643,0.000030192445,0.000097416414,0.000009106227,0.000013558406,0.003944255,0.00015734999,0.013436161,0.9727857,0.000076959026,0.0093753375],"study_design_scores_gemma":[0.0013241506,0.00009612587,0.00025754547,0.000043896816,0.000008754431,0.000007832917,0.0009305929,0.16476098,0.014666903,0.81680405,0.00060314743,0.00049602246],"about_ca_topic_score_codex":0.0000011945529,"about_ca_topic_score_gemma":0.0000017626969,"teacher_disagreement_score":0.7845704,"about_ca_system_score_codex":0.00003286282,"about_ca_system_score_gemma":0.000028243176,"threshold_uncertainty_score":0.71746504},"labels":[],"label_agreement":null},{"id":"W3044049558","doi":"10.37236/9785","title":"Chromatic Polynomials of 2-Edge-Coloured Graphs","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mount Saint Vincent University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic polynomial; Combinatorics; Mathematics; Chromatic scale; Vertex (graph theory); Friendship graph; Windmill graph; Discrete mathematics; Homomorphism; 1-planar graph; Graph; Chordal graph; Line graph; Voltage graph","score_opus":0.013926403745023656,"score_gpt":0.2787152718307317,"score_spread":0.26478886808570806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044049558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9118166,0.0039820164,0.079528324,0.002723743,0.0009579594,0.00031696042,0.0000010639686,0.000099807774,0.000573533],"genre_scores_gemma":[0.99880284,0.00076146954,0.00008590319,0.000032151496,0.000030535786,0.000003702666,2.3663397e-7,0.000015449652,0.00026771004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974284,0.000367651,0.0005731937,0.00013464867,0.0007646215,0.0007314876],"domain_scores_gemma":[0.9975834,0.00078395597,0.0005808529,0.0006092628,0.00034632412,0.000096197255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003622113,0.00013980918,0.0003686064,0.0004748717,0.000149079,0.00004355372,0.0025597075,0.000057085133,0.0000060025022],"category_scores_gemma":[0.00033991667,0.00009575112,0.00021236735,0.0028332004,0.00014746781,0.00033359925,0.0002519313,0.00065331545,0.00002226874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029620553,0.00006615629,0.00009781209,0.000016480293,0.00009043849,0.000013422959,0.00038625888,0.00013516625,0.0040345644,0.99333024,0.00061383145,0.0011860227],"study_design_scores_gemma":[0.0006627013,0.00071757537,0.00067480246,0.000027554692,0.000017128292,0.00010503882,0.0000698706,0.0007929302,0.010925373,0.9854069,0.0005056059,0.00009455571],"about_ca_topic_score_codex":0.0000020539728,"about_ca_topic_score_gemma":0.0000010525168,"teacher_disagreement_score":0.08698625,"about_ca_system_score_codex":0.00016835188,"about_ca_system_score_gemma":0.0006235402,"threshold_uncertainty_score":0.4756616},"labels":[],"label_agreement":null},{"id":"W3046024813","doi":"10.1016/j.jctb.2023.10.010","title":"Edge-colouring graphs with local list sizes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Generalization; Hypergraph; Edge coloring; Chromatic scale; Degree (music); Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.012261408479186386,"score_gpt":0.26337507367268187,"score_spread":0.2511136651934955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046024813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6970888,0.00069308915,0.2741758,0.0025704254,0.016295014,0.00055233407,0.0000059828662,0.0006929722,0.007925622],"genre_scores_gemma":[0.9963099,0.00008957725,0.0024967347,0.000052819807,0.00034089517,0.000006831181,5.469891e-7,0.000029874322,0.0006728652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974789,0.00045787316,0.00046319142,0.0002424186,0.0008479913,0.0005096106],"domain_scores_gemma":[0.99753803,0.00084180915,0.0003537579,0.0005082675,0.000512075,0.00024603837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025911098,0.00021459247,0.00040771518,0.0004978125,0.00029585412,0.00021872073,0.0016301933,0.00008568762,0.000038111953],"category_scores_gemma":[0.0003578445,0.00016111898,0.0001701984,0.0017517079,0.00052217045,0.0016781482,0.0003728751,0.0005585054,0.000025791906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011505517,0.00006494701,0.00021034454,0.00001866462,0.000085888394,0.00042173098,0.00054913067,0.00041324142,0.0005871095,0.99095213,0.0005260024,0.005020235],"study_design_scores_gemma":[0.0013565883,0.0014279871,0.00030873428,0.00007588071,0.000012159702,0.0002816862,0.0004976795,0.00009918112,0.0077436473,0.98182535,0.006161707,0.00020941353],"about_ca_topic_score_codex":0.0000013257612,"about_ca_topic_score_gemma":0.000001656417,"teacher_disagreement_score":0.29922107,"about_ca_system_score_codex":0.00007436161,"about_ca_system_score_gemma":0.0002282932,"threshold_uncertainty_score":0.65702415},"labels":[],"label_agreement":null},{"id":"W3047829504","doi":"10.1007/978-3-030-57602-8_37","title":"Computing the One-Visibility Copnumber of Trees","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Visibility; Computer science; Tree (set theory); Algorithm; Mathematics; Combinatorics; Geography; Meteorology","score_opus":0.03476839228761736,"score_gpt":0.29968621143235363,"score_spread":0.2649178191447363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047829504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027045273,0.0003968706,0.9925114,0.0017081914,0.00059437694,0.00056312344,0.000007077128,0.00013329735,0.0038152062],"genre_scores_gemma":[0.72006875,0.00002277524,0.2783627,0.0010774706,0.0003106501,0.0000042200622,0.000002323211,0.000036606027,0.00011453668],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949428,0.00014625664,0.0007491547,0.001735074,0.0017095493,0.00071720785],"domain_scores_gemma":[0.9944683,0.0020654171,0.00044006543,0.0024040074,0.00041983998,0.00020242273],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020355475,0.0004948766,0.00072781945,0.0004397735,0.0003417958,0.000306714,0.007129594,0.00022523676,0.000022979846],"category_scores_gemma":[0.00035695944,0.0003747299,0.00022900329,0.0013174731,0.0024302993,0.00047420096,0.0038007018,0.001404567,0.00003885443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002549887,0.00006449209,0.00040612367,0.00010445637,0.000036989335,0.000053962693,0.0019813855,0.032230724,0.00062232564,0.28278863,0.000022065393,0.68166333],"study_design_scores_gemma":[0.00025588553,0.00021668851,0.00067524274,0.00030489592,0.000007887047,0.000027218812,5.1842034e-7,0.36419418,0.0032727758,0.6300825,0.00045955536,0.00050262245],"about_ca_topic_score_codex":0.000018296378,"about_ca_topic_score_gemma":0.00009502939,"teacher_disagreement_score":0.71979827,"about_ca_system_score_codex":0.00018772898,"about_ca_system_score_gemma":0.00058622874,"threshold_uncertainty_score":0.9998705},"labels":[],"label_agreement":null},{"id":"W3048005910","doi":"10.48550/arxiv.2008.03579","title":"(k; l)-Colourings and Ferrers Diagram Representations of Cographs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Lambda; Partition (number theory); Vertex (graph theory); Graph; Discrete mathematics; Physics","score_opus":0.09360776056746983,"score_gpt":0.23903608853845104,"score_spread":0.1454283279709812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048005910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36772364,0.000109922745,0.6290698,0.00035105846,0.00020064884,0.00045040922,0.000021994625,0.00020571281,0.0018667968],"genre_scores_gemma":[0.9955138,0.00034031575,0.0037484784,0.000042614156,0.000015591175,0.0000020116736,0.0000068715003,0.000014002377,0.00031632272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981595,0.00018065856,0.00019148235,0.0010476236,0.00012886911,0.00029185365],"domain_scores_gemma":[0.9981207,0.0002169554,0.00022195815,0.0010255023,0.00016974192,0.00024513534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020593817,0.00021963849,0.00032365104,0.000404034,0.00012649159,0.000068710324,0.0015510744,0.0001555844,0.000010005236],"category_scores_gemma":[0.00011730222,0.00026371342,0.0001807549,0.0011380884,0.0004229836,0.00033222235,0.0030211394,0.0005701293,0.000010663861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000689444,0.00009563209,0.016115846,0.00018631833,0.00018761438,0.00032206086,0.0009055612,0.021966908,0.00041589676,0.9576786,0.00022940266,0.0018272124],"study_design_scores_gemma":[0.0006907912,0.00013989721,0.010834683,0.00008674533,0.000067467954,0.00000651591,0.0002714806,0.18066917,0.0011424957,0.80539787,0.00020001357,0.00049285806],"about_ca_topic_score_codex":0.00008938609,"about_ca_topic_score_gemma":0.000012474601,"teacher_disagreement_score":0.62779015,"about_ca_system_score_codex":0.00004426697,"about_ca_system_score_gemma":0.000114246286,"threshold_uncertainty_score":0.9999815},"labels":[],"label_agreement":null},{"id":"W3048214410","doi":"10.1016/j.akcej.2019.12.016","title":"The <i>k</i>-conversion number of regular graphs","year":2020,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Maximal independent set; Vertex (graph theory); Dominating set; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science","score_opus":0.013337443425529777,"score_gpt":0.275077607849234,"score_spread":0.26174016442370424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048214410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92578816,0.002064441,0.05434156,0.0136581585,0.0024715683,0.00015008525,0.000005388339,0.000037732843,0.0014828906],"genre_scores_gemma":[0.9967528,0.001661402,0.0012606104,0.0002597582,0.000022369277,8.2296395e-7,3.4003963e-7,0.000006195385,0.000035676443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844563,0.00009008809,0.00036976102,0.00013421748,0.00081781833,0.0001425104],"domain_scores_gemma":[0.9981463,0.00031635215,0.00036224883,0.00016886395,0.0008644905,0.00014173792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005072589,0.0000942502,0.00015487285,0.00010583575,0.00010890082,0.00010024779,0.0015348716,0.000038360653,0.0000050733],"category_scores_gemma":[0.00015181709,0.0000666044,0.00014888163,0.00047624763,0.00016664951,0.0004617874,0.0002930552,0.00025759608,0.0000024220376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083209794,0.000044515244,0.009979792,0.000006518029,0.000084496874,0.000041976236,0.00021715238,0.00000595859,0.00040796257,0.982585,0.0008289846,0.005714422],"study_design_scores_gemma":[0.0007845544,0.00026973212,0.0016593874,0.000028160766,0.0000088651295,0.00012998111,0.00013044552,0.0008480226,0.0035079943,0.98398805,0.008553584,0.00009123864],"about_ca_topic_score_codex":0.0000024898886,"about_ca_topic_score_gemma":1.7299543e-7,"teacher_disagreement_score":0.07096465,"about_ca_system_score_codex":0.000016930668,"about_ca_system_score_gemma":0.000046552486,"threshold_uncertainty_score":0.2852199},"labels":[],"label_agreement":null},{"id":"W3048336591","doi":"10.48550/arxiv.2008.03568","title":"Chordality of locally semicomplete and weakly quasi-transitive digraphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Transitive relation; Chordal graph; Mathematics; Combinatorics; Strongly connected component; Class (philosophy); Discrete mathematics; Directed graph; Graph; Computer science; Artificial intelligence","score_opus":0.08189300030275225,"score_gpt":0.2186261948534977,"score_spread":0.13673319455074545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048336591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1979691,0.000121622084,0.7998283,0.000251811,0.00011030587,0.00036120284,0.00007238162,0.00015565277,0.001129647],"genre_scores_gemma":[0.996392,0.00030390217,0.0030500973,0.000088496294,0.000024602083,0.0000010299369,0.000010746079,0.000018873687,0.00011022545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972997,0.00038446707,0.0002765681,0.0014366392,0.00018640172,0.0004162233],"domain_scores_gemma":[0.9976606,0.00028318595,0.00025512185,0.0011998937,0.000279788,0.00032144555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038333895,0.0003549869,0.0005666228,0.00031059,0.00012519155,0.00006579477,0.002018292,0.00022741499,0.000010675823],"category_scores_gemma":[0.00006143356,0.00041280634,0.00025146134,0.0009841087,0.00061154657,0.00039474573,0.0025679767,0.00088657375,0.000012949315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002544486,0.0001692124,0.0038438623,0.00041492304,0.00027613307,0.00043153396,0.0010812721,0.008544476,0.0033506283,0.9794628,0.000047931888,0.0021228],"study_design_scores_gemma":[0.000808297,0.00031305585,0.0061452715,0.00020947312,0.000069586116,0.000009471165,0.00021506166,0.22598611,0.00204884,0.7632261,0.00023557333,0.0007331577],"about_ca_topic_score_codex":0.00012782113,"about_ca_topic_score_gemma":0.00003258669,"teacher_disagreement_score":0.79842293,"about_ca_system_score_codex":0.00007876528,"about_ca_system_score_gemma":0.00020306004,"threshold_uncertainty_score":0.9998324},"labels":[],"label_agreement":null},{"id":"W3048509133","doi":"10.1007/978-3-030-92931-2_7","title":"A Short Proof of the Non-biplanarity of $$K_9$$","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Simplicity; Graph; Combinatorics; Battle; Mathematics; Philosophy; Geography; Epistemology","score_opus":0.022983876769389528,"score_gpt":0.30482644945765736,"score_spread":0.28184257268826785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048509133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13129024,0.00024074275,0.8662041,0.00046772667,0.0011788468,0.0005555296,0.0000060213224,0.000025513678,0.00003128461],"genre_scores_gemma":[0.7590708,0.00000623084,0.24074249,0.00010437423,0.000048264203,0.00001727391,0.0000011314163,0.000008587971,8.0637e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563456,0.00025018226,0.0006130954,0.0013467396,0.0015411534,0.00061430293],"domain_scores_gemma":[0.99514025,0.00054529635,0.00029535798,0.0032892139,0.0006213041,0.000108600776],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001875084,0.00032704612,0.00061115646,0.00049176294,0.00014379021,0.00020751037,0.008894666,0.00022598906,0.0000031557713],"category_scores_gemma":[0.00043720807,0.00024127447,0.00024038975,0.0037333022,0.0016320916,0.00037799933,0.012098632,0.0013075916,3.8866472e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014285074,0.00039154373,0.013309471,0.00048360616,0.000030804473,0.000038754242,0.0038001828,0.50671554,0.008853812,0.0014687723,0.0000041028775,0.46488914],"study_design_scores_gemma":[0.00012063467,0.00008863033,0.012775342,0.00057318027,0.0000047305703,0.000024645564,0.000001399888,0.60108566,0.30987543,0.075165555,0.0000029999546,0.00028179344],"about_ca_topic_score_codex":0.00007285767,"about_ca_topic_score_gemma":0.00011087516,"teacher_disagreement_score":0.6277806,"about_ca_system_score_codex":0.0001382729,"about_ca_system_score_gemma":0.0013331535,"threshold_uncertainty_score":0.9964677},"labels":[],"label_agreement":null},{"id":"W3048740887","doi":"10.48550/arxiv.2008.05069","title":"Vertex-minor-closed classes are $\\chi$-bounded","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minor (academic); Bounded function; Vertex (graph theory); Combinatorics; Mathematics; Discrete mathematics; Computer science; Graph; Humanities; Art; Mathematical analysis","score_opus":0.12523467681475106,"score_gpt":0.22633180401776462,"score_spread":0.10109712720301356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048740887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19557208,0.00017533405,0.7896659,0.00084131386,0.0011571007,0.00078412116,0.000054882497,0.0011435123,0.010605785],"genre_scores_gemma":[0.9925562,0.00017453714,0.0040622856,0.00029602536,0.000084838364,0.0000024423248,0.000020561394,0.000042570115,0.00276054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625236,0.00039013612,0.0002704161,0.0020768025,0.00027501103,0.00073527376],"domain_scores_gemma":[0.9963128,0.00029252723,0.00035056757,0.0022778194,0.0002757085,0.0004905521],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002629244,0.0005271224,0.000594971,0.00044250823,0.00031054195,0.00029883374,0.0049227197,0.00038626895,0.000090568836],"category_scores_gemma":[0.00018029427,0.0006234888,0.00037924817,0.0013957217,0.00033439082,0.0006446955,0.0054200944,0.0014499769,0.0007020046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013212075,0.0001533694,0.0036592097,0.0001938234,0.00022232183,0.0020951163,0.00026011578,0.0108554615,0.00025306246,0.97968954,0.0015088286,0.0009770456],"study_design_scores_gemma":[0.0009800572,0.00012296332,0.0032808632,0.00015436085,0.000060164584,0.000010222626,0.00013370103,0.22070841,0.00076914,0.76929295,0.0034541173,0.0010330628],"about_ca_topic_score_codex":0.00004997067,"about_ca_topic_score_gemma":0.00003911415,"teacher_disagreement_score":0.79698414,"about_ca_system_score_codex":0.00032742883,"about_ca_system_score_gemma":0.00044381665,"threshold_uncertainty_score":0.9996216},"labels":[],"label_agreement":null},{"id":"W3049700057","doi":"10.1002/net.21977","title":"Network reliability: Heading out on the highway","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variety (cybernetics); Reliability (semiconductor); Computer science; Graph theory; Probabilistic logic; Network analysis; Commutative property; Theoretical computer science; Enumeration; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence; Engineering","score_opus":0.04651461942591406,"score_gpt":0.28036012648991504,"score_spread":0.23384550706400098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049700057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015433193,0.00027379388,0.9516501,0.036579117,0.000658873,0.00033037603,5.337482e-7,0.00039249848,0.008571384],"genre_scores_gemma":[0.9791683,0.000025459232,0.0052733603,0.014064493,0.0011592906,0.000034035496,0.0000011457703,0.000020443425,0.0002534619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980366,0.00031578165,0.00019149412,0.00050708966,0.0003544822,0.00059450854],"domain_scores_gemma":[0.99770874,0.0010978684,0.00005699258,0.0008914799,0.000054999826,0.00018994593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008587265,0.0001516002,0.0001658075,0.000019481038,0.0003305811,0.00015633747,0.0015327391,0.00007580815,0.000036972106],"category_scores_gemma":[0.00020999303,0.000102341095,0.00008229099,0.0007402795,0.00011101439,0.00019429474,0.00048480785,0.00066978,0.00022029913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004871841,0.000019170295,0.00059901294,0.000004837018,0.000013181601,0.00001785955,0.00047561768,0.3150227,0.000018237723,0.5996983,0.061784424,0.022297943],"study_design_scores_gemma":[0.0001825163,0.00019396571,0.00028315044,0.000035711204,0.0000029555565,0.0000018418076,0.000018189075,0.8260808,0.000074084404,0.104917176,0.06798605,0.0002235431],"about_ca_topic_score_codex":0.0000012273777,"about_ca_topic_score_gemma":0.0000019106976,"teacher_disagreement_score":0.977625,"about_ca_system_score_codex":0.000035480916,"about_ca_system_score_gemma":0.000026393362,"threshold_uncertainty_score":0.41733485},"labels":[],"label_agreement":null},{"id":"W3052291153","doi":"10.1214/21-aop1532","title":"Universality of cutoff for graphs with an added random matching","year":2022,"lang":"en","type":"article","venue":"The Annals of Probability","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Randomness; Cutoff; Random walk; Random graph; Random regular graph; Universality (dynamical systems); Discrete mathematics; Bounded function; Simple random sample; Graph; Line graph; Statistics; Pathwidth; Mathematical analysis","score_opus":0.09876534836839923,"score_gpt":0.35101235035007594,"score_spread":0.2522470019816767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3052291153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81856513,0.00004782675,0.17860661,0.001471905,0.000030587667,0.000978137,0.000057614783,0.00004797835,0.00019420689],"genre_scores_gemma":[0.9798605,0.0000030245683,0.019950232,0.000073306146,0.000004805357,0.00007238696,0.0000031756435,0.000006488751,0.00002608817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978806,0.00085072394,0.0002526827,0.00031953462,0.00044109908,0.00025536207],"domain_scores_gemma":[0.9976008,0.000606096,0.00020393557,0.0011978765,0.00033202124,0.000059247635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00466512,0.000096872434,0.00024634492,0.00007183251,0.00027494354,0.000014265591,0.0016175087,0.000015929347,0.000019757197],"category_scores_gemma":[0.00011611489,0.00006598638,0.00012476787,0.00059829024,0.0003702483,0.00036266088,0.0004673415,0.0001671635,1.9332663e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037626952,0.00051032536,0.00079513324,0.0001422415,0.00007315099,0.0000011655303,0.003473467,0.008213308,0.001888898,0.9739503,0.000060122,0.0071291793],"study_design_scores_gemma":[0.0008382835,0.00080836704,0.0011034397,0.0000064472324,0.000005626051,0.0000023415648,0.00031886695,0.002367218,0.0071327053,0.9872106,0.00012213991,0.00008399],"about_ca_topic_score_codex":0.00008116935,"about_ca_topic_score_gemma":0.000024325467,"teacher_disagreement_score":0.16129535,"about_ca_system_score_codex":0.000015426192,"about_ca_system_score_gemma":0.000120609904,"threshold_uncertainty_score":0.30057603},"labels":[],"label_agreement":null},{"id":"W3065743396","doi":"","title":"Matchings, hypergraphs, association schemes, and semidefinite optimization.","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"","keywords":"Semidefinite programming; Mathematics; Association scheme; Regular polygon; Combinatorics; Context (archaeology); Polyhedron; Hierarchy; Commutative property; Discrete mathematics; Mathematical optimization","score_opus":0.05756878891317799,"score_gpt":0.19849247382762275,"score_spread":0.14092368491444476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3065743396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02611603,0.00021202542,0.97100836,0.000606438,0.00020522405,0.00025406113,0.000023425499,0.00036795266,0.0012065095],"genre_scores_gemma":[0.95782334,0.0012820753,0.0394344,0.00026880717,0.000052464766,0.0000017501854,0.000036031353,0.000029388844,0.0010717446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790376,0.00022561457,0.00018499479,0.0011363024,0.00017966465,0.00036963617],"domain_scores_gemma":[0.99823695,0.00025700583,0.00029498662,0.00075458235,0.0002196076,0.00023684638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038593577,0.0002786709,0.00031282505,0.0003065623,0.0002181217,0.00022503364,0.0013136376,0.0002913648,0.000017253988],"category_scores_gemma":[0.00020931773,0.00034576043,0.0001313092,0.000972942,0.00008058054,0.0005896895,0.00270497,0.00083085085,0.00003804828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022976597,0.000035262296,0.0072605973,0.00007824316,0.00012850326,0.00011557722,0.00016844479,0.522493,0.00008556197,0.46894416,0.00034973002,0.0003179475],"study_design_scores_gemma":[0.0004115275,0.00003289335,0.00033287046,0.00005706561,0.000036862544,0.0000031374684,0.000033174274,0.76050407,0.00013013933,0.2369792,0.0010445473,0.00043449347],"about_ca_topic_score_codex":0.00002694953,"about_ca_topic_score_gemma":0.0000029145124,"teacher_disagreement_score":0.9317073,"about_ca_system_score_codex":0.00024203703,"about_ca_system_score_gemma":0.00014519616,"threshold_uncertainty_score":0.99989945},"labels":[],"label_agreement":null},{"id":"W30750922","doi":"","title":"King's Total Domination Number on the Square of Side n","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Domination analysis; Vertex (graph theory); Combinatorics; Mathematics; Graph; Square (algebra); Connectivity; Discrete mathematics; Geometry","score_opus":0.013299274648357817,"score_gpt":0.2736437662253444,"score_spread":0.2603444915769866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30750922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96626234,0.000010040464,0.00961594,0.0013230774,0.00081325934,0.00022969196,0.0000010126553,0.000081552935,0.021663072],"genre_scores_gemma":[0.9988961,0.0000013430936,0.0007649473,0.00009802239,0.000007705679,0.000017500439,9.044811e-7,0.000009265359,0.00020416339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986904,0.0002525479,0.00016019825,0.0002358428,0.00043880547,0.00022219736],"domain_scores_gemma":[0.9981529,0.00082780834,0.00009174176,0.00073397637,0.0001427285,0.00005081792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078355824,0.000099067096,0.00012379127,0.000059434555,0.00012475159,0.000048265603,0.00078715343,0.000043378812,0.000025700447],"category_scores_gemma":[0.00040476554,0.00007234057,0.00006299646,0.00042829168,0.0000958619,0.00022367162,0.00020990892,0.00017543268,0.00013222612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009541764,0.000053256357,0.0005900339,0.000005621097,0.000006004249,0.0000012093342,0.00019465025,0.000038072092,0.0006569609,0.99166524,0.00026530583,0.006514076],"study_design_scores_gemma":[0.0003699987,0.00013060296,0.0052268906,0.000020145042,0.0000016834267,0.0000039673155,0.000022889952,0.004240704,0.014706626,0.97460777,0.00057545194,0.00009329692],"about_ca_topic_score_codex":0.000009490278,"about_ca_topic_score_gemma":0.0000011673648,"teacher_disagreement_score":0.032633796,"about_ca_system_score_codex":0.000032637497,"about_ca_system_score_gemma":0.000021095779,"threshold_uncertainty_score":0.29499626},"labels":[],"label_agreement":null},{"id":"W3079396048","doi":"","title":"Distance-Two Coloring of Barnette Graphs.","year":2018,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.03704036719867936,"score_gpt":0.3021818451341628,"score_spread":0.2651414779354834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3079396048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14473775,0.000075409676,0.8146031,0.00163643,0.00064312207,0.00031140624,0.000071186616,0.00010662416,0.03781501],"genre_scores_gemma":[0.98213804,0.0000029782782,0.016996687,0.0005445799,0.00006265212,0.0000116055235,0.000012891493,0.000011113095,0.00021944962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981883,0.00008173865,0.00026358222,0.00045806137,0.0005034757,0.00050481106],"domain_scores_gemma":[0.99799955,0.00028103645,0.00010112276,0.000450282,0.00069030834,0.00047768443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003305754,0.00016235487,0.00020008175,0.0010051187,0.00023447187,0.00010355985,0.001089026,0.000053052678,0.00021299222],"category_scores_gemma":[0.00012422152,0.00017463822,0.000063576415,0.0017434312,0.00043484903,0.00029510108,0.00009653731,0.00020567336,0.0001624125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010810494,0.000015438865,0.0014167513,0.000007708517,0.000017969825,0.000015262387,0.00010249075,0.0019845003,0.000056870038,0.9797767,0.000380741,0.016214801],"study_design_scores_gemma":[0.00073419104,0.00045023803,0.018013654,0.00009844533,0.000004436855,0.000020794898,0.00006313935,0.13635467,0.0011852356,0.8374321,0.0051775817,0.00046555308],"about_ca_topic_score_codex":0.0019629293,"about_ca_topic_score_gemma":0.007376385,"teacher_disagreement_score":0.8374003,"about_ca_system_score_codex":0.00014252662,"about_ca_system_score_gemma":0.00095389166,"threshold_uncertainty_score":0.71215403},"labels":[],"label_agreement":null},{"id":"W3081802541","doi":"10.46298/dmtcs.6773","title":"On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Convexity; Chromatic scale; Planar graph; Reflexivity; Graph; Indifference graph; Graph homomorphism","score_opus":0.018729579448650727,"score_gpt":0.29148177294934074,"score_spread":0.27275219350069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081802541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29727986,0.00006782843,0.6997408,0.000866397,0.000116192656,0.00042592775,0.00001000461,0.000029858287,0.0014631205],"genre_scores_gemma":[0.69828606,0.000013644541,0.301439,0.00021300181,0.000007547727,0.000016748076,4.84065e-7,0.000010085198,0.000013464654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966676,0.00018945115,0.00053671555,0.00089439645,0.0011261207,0.00058568746],"domain_scores_gemma":[0.9958903,0.0013373841,0.00020199027,0.0014616842,0.0007569411,0.00035165282],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021652523,0.00027757365,0.00048538388,0.00023640112,0.00037177635,0.00018682769,0.001989907,0.000061532905,0.000018774226],"category_scores_gemma":[0.00092194957,0.00017673588,0.00008896154,0.0020981259,0.0060594436,0.00033328493,0.002390825,0.00028060313,0.000006184756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024530433,0.00009560342,0.000018791368,0.000074744385,0.000012798826,0.000021540545,0.0028780336,0.000014704904,0.01131501,0.98418653,0.0000071600625,0.0013505706],"study_design_scores_gemma":[0.00022688934,0.0006166189,0.00031855603,0.0002542525,0.000010052613,0.000056562138,0.0002358876,0.10737086,0.05073889,0.8399435,0.0000056032377,0.00022228555],"about_ca_topic_score_codex":0.0000015458022,"about_ca_topic_score_gemma":6.98675e-7,"teacher_disagreement_score":0.4010062,"about_ca_system_score_codex":0.000023256089,"about_ca_system_score_gemma":0.00014443677,"threshold_uncertainty_score":0.9966455},"labels":[],"label_agreement":null},{"id":"W3081802581","doi":"10.48550/arxiv.2006.10364","title":"On the Parameterized Approximability of Contraction to Classes of\\n Chordal Graphs","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Parameterized complexity; Combinatorics; Mathematics; Contraction (grammar); Discrete mathematics; Time complexity; Treewidth; Interval graph; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.09589895400895976,"score_gpt":0.2187945524125631,"score_spread":0.12289559840360334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081802581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64365554,0.0000024657224,0.35528368,0.00040091822,0.000029683939,0.00020996295,0.0000036653837,0.000032625223,0.00038145136],"genre_scores_gemma":[0.99832976,0.00000642312,0.0014465998,0.00018401437,0.0000050627523,8.5635645e-7,3.8924364e-7,0.000004408487,0.000022467333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989363,0.00024318516,0.00013700094,0.00039287316,0.00011222501,0.00017843941],"domain_scores_gemma":[0.9982925,0.0007797781,0.0001070647,0.00056762516,0.00013429642,0.00011871594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003011971,0.00009648046,0.00018012668,0.00009614326,0.00006719424,0.000014028524,0.0009355783,0.00003807987,0.00001913834],"category_scores_gemma":[0.0004083259,0.00007957865,0.00011034931,0.0013379226,0.00019261932,0.0002567296,0.0002061817,0.0001628364,0.000014836142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000388666,0.00009066275,0.0011065,0.000016575877,0.000025351233,0.000008379751,0.00019917896,0.006388303,0.013591658,0.97753865,0.00003461257,0.0006114816],"study_design_scores_gemma":[0.0014704609,0.001479279,0.007039117,0.00003341397,0.000025953956,0.0000017803925,0.00042055716,0.17502889,0.0786576,0.7351727,0.00032380375,0.00034642185],"about_ca_topic_score_codex":0.0000134477605,"about_ca_topic_score_gemma":0.0000023379262,"teacher_disagreement_score":0.35467422,"about_ca_system_score_codex":0.000025103831,"about_ca_system_score_gemma":0.000039218412,"threshold_uncertainty_score":0.3245123},"labels":[],"label_agreement":null},{"id":"W3081847610","doi":"10.1002/jgt.22827","title":"Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Greedy coloring; Treewidth; Edge coloring; Discrete mathematics; Graph; Complete coloring; Planar graph; List coloring; Graph power; Pathwidth; Line graph","score_opus":0.014007296998877249,"score_gpt":0.24655203865994169,"score_spread":0.23254474166106442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081847610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785784,0.0016716308,0.017032132,0.0009053297,0.00030888923,0.00043156,0.0000139374915,0.0001226871,0.00093542464],"genre_scores_gemma":[0.98906654,0.000492176,0.009645277,0.00033295687,0.000041618958,0.00006374221,0.0000016563644,0.00004706118,0.00030899933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956083,0.0010507238,0.00071486767,0.0005377579,0.0013541759,0.0007341733],"domain_scores_gemma":[0.99658656,0.0010536629,0.0008383971,0.00069404684,0.00039167207,0.00043565483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028489912,0.00034816927,0.0005916024,0.002175521,0.0008445078,0.00019672493,0.00210311,0.00007527397,0.000056462366],"category_scores_gemma":[0.00018753555,0.00028262573,0.0002623696,0.0040019015,0.0006486767,0.0011872415,0.00075549196,0.001284336,0.0000018985701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005370405,0.00061636424,0.011394714,0.000048675618,0.00062332064,0.0012645037,0.0022311965,0.00038934444,0.013177336,0.95595795,0.00085004425,0.008076167],"study_design_scores_gemma":[0.004898251,0.0069243335,0.03516745,0.00007463222,0.00010337516,0.001825353,0.0021091828,0.00012481012,0.0025483884,0.93602306,0.009486512,0.0007146841],"about_ca_topic_score_codex":0.000011713741,"about_ca_topic_score_gemma":0.000008728184,"teacher_disagreement_score":0.023772735,"about_ca_system_score_codex":0.00012336181,"about_ca_system_score_gemma":0.00024445017,"threshold_uncertainty_score":0.99996257},"labels":[],"label_agreement":null},{"id":"W3081951976","doi":"10.26493/2590-9770.1382.2ad","title":"On generalised Petersen graphs of girth 7 that have cop number 4","year":2021,"lang":"en","type":"preprint","venue":"The Art of Discrete and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Churchill Northern Studies Centre","funders":"","keywords":"Combinatorics; Preprint; Petersen graph; Mathematics; Odd graph; Girth (graph theory); Graph; Discrete mathematics; Computer science; Chordal graph; 1-planar graph; Line graph; Graph power","score_opus":0.03302042111927762,"score_gpt":0.2909532030587902,"score_spread":0.2579327819395126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081951976","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7228189,0.00014408311,0.23173113,0.0004943763,0.00010588283,0.0010802739,0.000049690556,0.00007259955,0.043503072],"genre_scores_gemma":[0.9073399,0.00017680597,0.09206217,0.00007858529,0.000012735982,0.000048893522,0.000016176682,0.000026232821,0.00023852673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824375,0.00006648432,0.000406985,0.0004077642,0.0006067502,0.00026826034],"domain_scores_gemma":[0.997401,0.00043571502,0.00042373262,0.0015856784,0.000075516386,0.000078388155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054263585,0.00028054378,0.00058856694,0.000083622974,0.00008494536,0.00009231539,0.0011633107,0.00011089984,0.000024201165],"category_scores_gemma":[0.000026819556,0.00018903703,0.00018005667,0.00015221945,0.00036522423,0.000067377216,0.001760116,0.00038619558,0.0000055794753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028439616,0.00011560882,0.000020529063,0.0006870999,0.00014423931,0.0000039487113,0.0048348997,0.000598018,0.0040639965,0.98870695,0.00020404127,0.0005922198],"study_design_scores_gemma":[0.00041252983,0.000050666444,0.00005746248,0.00035346166,0.0000501319,0.000009286814,0.0011556909,0.005341868,0.05328654,0.9389385,0.000042503532,0.00030136041],"about_ca_topic_score_codex":0.000002824874,"about_ca_topic_score_gemma":0.000003278058,"teacher_disagreement_score":0.18452099,"about_ca_system_score_codex":0.000010155909,"about_ca_system_score_gemma":0.00004399024,"threshold_uncertainty_score":0.7708707},"labels":[],"label_agreement":null},{"id":"W3082032630","doi":"","title":"Pure pairs. I. Trees and linear anticomplete pairs","year":2020,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Laboratory; Army Research Office; Air Force Office of Scientific Research; Leverhulme Trust; Office of Naval Research; Princeton University; National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Induced subgraph; Disjoint sets; Graph; Vertex (graph theory); Graph factorization; Existential quantification; Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.04194121276914904,"score_gpt":0.26384201151043835,"score_spread":0.22190079874128932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082032630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3507528,0.00017753866,0.60818845,0.016700089,0.00007427942,0.0012128566,0.0003507411,0.00048154598,0.022061711],"genre_scores_gemma":[0.9255671,0.0020532217,0.07074713,0.000116061645,0.00006154606,2.865554e-7,0.0000430954,0.0000338506,0.0013776994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953771,0.00096961035,0.0001862742,0.0011157084,0.00122129,0.0011299853],"domain_scores_gemma":[0.9966344,0.0008024536,0.00014952556,0.00091273023,0.00048754635,0.0010133],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009650823,0.00031275905,0.0005359842,0.0009904945,0.0013468167,0.00008050711,0.0037919893,0.00014210286,0.0001264944],"category_scores_gemma":[0.00023576595,0.00038728587,0.00025510837,0.0023584343,0.0020450149,0.0016023855,0.004606114,0.0011610518,0.000027112803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004351669,0.0008090993,0.04302946,0.00091869687,0.0008150262,0.0056533823,0.031511866,0.00080205826,0.017427007,0.77006024,0.013551745,0.11106975],"study_design_scores_gemma":[0.007666849,0.0045638224,0.03601639,0.0002737179,0.00008024156,0.0000831878,0.0390849,0.17438143,0.0007499836,0.059561774,0.6758002,0.001737485],"about_ca_topic_score_codex":0.00014897872,"about_ca_topic_score_gemma":0.000337267,"teacher_disagreement_score":0.71049845,"about_ca_system_score_codex":0.000118748656,"about_ca_system_score_gemma":0.000333245,"threshold_uncertainty_score":0.99995327},"labels":[],"label_agreement":null},{"id":"W3082111916","doi":"10.1007/s10878-020-00630-z","title":"Incremental optimization of independent sets under the reconfiguration framework","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Combinatorics; Treewidth; Chordal graph; Pathwidth; Independent set; Vertex cover; Maximal independent set; Discrete mathematics; Bounded function; Degeneracy (biology); Vertex (graph theory); Dominating set; Planar graph; Clique-sum; Upper and lower bounds; Time complexity; Graph; 1-planar graph; Line graph","score_opus":0.02336265583839775,"score_gpt":0.288456861819923,"score_spread":0.2650942059815253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082111916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025139991,0.00008028384,0.9921265,0.0034333267,0.0014086004,0.00021108991,0.0000012936176,0.00001997932,0.00020491173],"genre_scores_gemma":[0.7668264,0.00009026148,0.2325869,0.0002515413,0.00022417503,0.0000024953304,0.0000030880713,0.000012714993,0.0000024280548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787134,0.0003474219,0.0006513649,0.0001562203,0.0008220077,0.00015162007],"domain_scores_gemma":[0.99778056,0.00027460392,0.0008505928,0.00023518008,0.0007446835,0.0001143661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082959695,0.00011830245,0.000226103,0.00013455714,0.00012550109,0.0001246126,0.0008251876,0.000108105996,0.00006220971],"category_scores_gemma":[0.0004671361,0.00009086356,0.00010095966,0.0008012728,0.00006198536,0.0011323863,0.00012628685,0.0003760377,0.0000020617167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012508054,0.000057445708,0.000046728004,0.000007444853,0.000032844207,0.0000022629893,0.00046466474,0.86754054,0.00029562626,0.13073598,0.00008908878,0.0006023043],"study_design_scores_gemma":[0.0014910827,0.00076429226,0.000112775924,0.0000592449,0.000025649744,0.000022428902,0.00027437817,0.9198388,0.005813179,0.0713811,0.00006670712,0.00015040056],"about_ca_topic_score_codex":0.0000015530915,"about_ca_topic_score_gemma":7.0146115e-8,"teacher_disagreement_score":0.7643124,"about_ca_system_score_codex":0.00008550086,"about_ca_system_score_gemma":0.00017140305,"threshold_uncertainty_score":0.37053084},"labels":[],"label_agreement":null},{"id":"W3086607644","doi":"10.1007/s00373-022-02564-1","title":"On Weak Flexibility in Planar Graphs","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation of Sri Lanka; European Commission; National Science Foundation; Iowa State University; H2020 European Research Council; Simon Fraser University","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Graph; List coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.021900158038334727,"score_gpt":0.2719491916626957,"score_spread":0.250049033624361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086607644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98813766,0.0007720568,0.0031963468,0.00059737725,0.0006872909,0.00038619462,0.000014179738,0.00021005995,0.0059988257],"genre_scores_gemma":[0.99917334,0.00006275648,0.00031370137,0.000197248,0.0000017574112,0.00007586353,0.000002846847,0.000009522282,0.00016296202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981026,0.00024506464,0.00019779721,0.00053691905,0.0005210667,0.0003965362],"domain_scores_gemma":[0.99888337,0.00024142908,0.00005138342,0.00066454255,0.000034172685,0.00012511712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081770966,0.00014767847,0.00018217324,0.00048513652,0.0003949332,0.00005937464,0.0008643418,0.000036744517,0.000016590728],"category_scores_gemma":[0.000041289797,0.00015009807,0.000065816945,0.002063015,0.000092319504,0.00018763049,0.00043856245,0.00052140496,0.000004011489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003124952,0.00021956938,0.0069193277,0.00000776573,0.000005179561,0.000032197873,0.0001783895,0.00007390815,0.000027214981,0.9890053,0.00031263227,0.0031872573],"study_design_scores_gemma":[0.0005962808,0.0004338578,0.007015789,0.0000039840575,0.0000010793989,0.0000109495895,0.00010940632,0.0015084681,0.000053609354,0.9884584,0.001636517,0.00017164645],"about_ca_topic_score_codex":0.000027454296,"about_ca_topic_score_gemma":0.0000064869387,"teacher_disagreement_score":0.011035673,"about_ca_system_score_codex":0.00007034475,"about_ca_system_score_gemma":0.000039384024,"threshold_uncertainty_score":0.6120822},"labels":[],"label_agreement":null},{"id":"W3088461072","doi":"10.48550/arxiv.2009.12189","title":"Fractional vertex-arboricity of planar graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Outerplanar graph; Degeneracy (biology); Graph; Discrete mathematics; Pathwidth; Line graph; Biology","score_opus":0.09228926834201523,"score_gpt":0.22167512805600031,"score_spread":0.12938585971398509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088461072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08358272,0.000063329986,0.91230774,0.00022433253,0.0005016912,0.000254721,0.000053204963,0.00021394032,0.002798339],"genre_scores_gemma":[0.99577546,0.00014039762,0.0037280906,0.00008096052,0.000028008646,7.803053e-7,0.000014149524,0.000015068445,0.00021706901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979535,0.00020139798,0.00021184662,0.0010685332,0.00022670173,0.0003380416],"domain_scores_gemma":[0.99784595,0.0002818741,0.0002668889,0.0011365814,0.00022903479,0.00023967029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022320797,0.000265943,0.00038040636,0.00039417678,0.000119685974,0.000038730406,0.002600906,0.00022958219,0.000040997907],"category_scores_gemma":[0.00008764068,0.0003174761,0.00028413266,0.0011963167,0.00022860545,0.00039740722,0.0016526199,0.0009399367,0.000069803245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080642676,0.00008424142,0.0021917874,0.00007054509,0.000112250964,0.00023735942,0.000082134335,0.021509008,0.00023960049,0.9748099,0.00031737104,0.0002651988],"study_design_scores_gemma":[0.00032964177,0.000074069874,0.0025035765,0.00004008257,0.000024284993,0.0000031570937,0.000026642523,0.11185669,0.00049556437,0.8839541,0.00039335026,0.0002988453],"about_ca_topic_score_codex":0.00008282096,"about_ca_topic_score_gemma":0.000008281008,"teacher_disagreement_score":0.91219276,"about_ca_system_score_codex":0.00012409422,"about_ca_system_score_gemma":0.0002740377,"threshold_uncertainty_score":0.99992776},"labels":[],"label_agreement":null},{"id":"W3088613651","doi":"10.55016/ojs/cdm.v16i1.71194","title":"A survey of graph burning","year":2021,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Conjecture; Combinatorics; Computer science; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.04110074314837459,"score_gpt":0.35548392388664524,"score_spread":0.31438318073827065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088613651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016959326,0.0007507601,0.9793805,0.00036616778,0.00026192915,0.0007262146,0.00085467024,0.00013948741,0.0005609724],"genre_scores_gemma":[0.8091154,0.00005675521,0.19015533,0.000039593888,0.000028691702,0.0001637001,0.00024982207,0.000032482327,0.00015819712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677664,0.00046580646,0.0008372392,0.0006757662,0.00067910424,0.0005654313],"domain_scores_gemma":[0.9936331,0.0010880379,0.00042776894,0.002426808,0.002147767,0.00027651136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002315444,0.00034012605,0.00084020593,0.0004356835,0.00017633065,0.00034297595,0.0023613975,0.00023430743,0.000028080087],"category_scores_gemma":[0.005609651,0.00032925067,0.00029166113,0.0015738597,0.00015213068,0.0001852405,0.0045617814,0.00071445067,0.00002608579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021028143,0.0005571348,0.00079160393,0.0011712322,0.000584998,0.00007143668,0.005494094,0.010905764,0.0026085004,0.9735563,0.00071257656,0.003525359],"study_design_scores_gemma":[0.0009914131,0.00023275927,0.009727581,0.0028821153,0.00013489678,0.000039571558,0.0005344877,0.1604033,0.012830037,0.8100673,0.00029632085,0.0018602412],"about_ca_topic_score_codex":0.000069692695,"about_ca_topic_score_gemma":0.00006632196,"teacher_disagreement_score":0.7921561,"about_ca_system_score_codex":0.00013305942,"about_ca_system_score_gemma":0.0005145166,"threshold_uncertainty_score":0.99991596},"labels":[],"label_agreement":null},{"id":"W3089292598","doi":"10.37236/10055","title":"Planar Lattice Subsets with Minimal Vertex Boundary","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Azrieli Foundation; Israel Science Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Discrete mathematics; Planar graph; Graph","score_opus":0.012933440177614941,"score_gpt":0.2646560003340228,"score_spread":0.25172256015640787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089292598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36850065,0.03801856,0.58453083,0.0050026868,0.0021503256,0.00046287765,0.0000039260935,0.000088112596,0.0012420132],"genre_scores_gemma":[0.9964082,0.0020167888,0.0010123969,0.00016389233,0.0001026823,0.0000076094166,0.0000033119384,0.000043120926,0.00024196981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995659,0.0006624086,0.00060407096,0.00042497154,0.0015278107,0.0011217705],"domain_scores_gemma":[0.9959564,0.0006881136,0.00084710337,0.0013793953,0.0009294131,0.00019954437],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025226402,0.00038763002,0.00065495004,0.00027580382,0.00029857032,0.00052163936,0.004762479,0.00020077324,0.000009706438],"category_scores_gemma":[0.00016645934,0.00026177804,0.0002700932,0.00089801726,0.00023822256,0.00050263753,0.0009577552,0.0047640833,0.000007829559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023393643,0.00024027149,0.00017374828,0.000068289184,0.00052370963,0.0005077854,0.0008940876,0.0003262056,0.00009172233,0.99479926,0.0005302701,0.001610712],"study_design_scores_gemma":[0.0009579967,0.0010181508,0.00038750505,0.0002458811,0.00009397615,0.0015830998,0.00016352528,0.00093086367,0.00069593923,0.99100584,0.0025578013,0.0003594105],"about_ca_topic_score_codex":0.000006472746,"about_ca_topic_score_gemma":0.000014036538,"teacher_disagreement_score":0.6279076,"about_ca_system_score_codex":0.0007173613,"about_ca_system_score_gemma":0.005183657,"threshold_uncertainty_score":0.99998343},"labels":[],"label_agreement":null},{"id":"W3092025494","doi":"10.1112/jlms.12781","title":"Sparse universal graphs for planarity","year":2023,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Planarity testing; Planar graph; Wheel graph; Vertex (graph theory); Hypercube graph; Discrete mathematics; Graph; Book embedding; Graph power; Line graph; Pathwidth","score_opus":0.03894361354742376,"score_gpt":0.30649944476187585,"score_spread":0.2675558312144521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092025494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07049406,0.000053962245,0.9178084,0.010430441,0.0004117826,0.0003417938,0.000007585849,0.00008743119,0.00036453758],"genre_scores_gemma":[0.43355754,0.00024386727,0.5595059,0.001687894,0.00042897515,0.000024647425,0.0000015174419,0.000071642105,0.004478027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985732,0.00009554305,0.00031307008,0.00013028752,0.00056186516,0.00032606497],"domain_scores_gemma":[0.9981174,0.00093838014,0.00022171748,0.00040611083,0.00019100984,0.00012540986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017448742,0.00010134944,0.00023072872,0.000054311637,0.00022398522,0.00007777298,0.0016086528,0.000067691486,0.000012899379],"category_scores_gemma":[0.0003990596,0.00006071395,0.00070134725,0.00080467365,0.00016039831,0.0003457091,0.0003583983,0.0003472032,0.000025052772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003593209,0.000113001246,0.00021123476,0.00011144114,0.0001282833,0.000012754565,0.0012479621,0.00036882274,0.001198403,0.9584334,0.036402497,0.0017362491],"study_design_scores_gemma":[0.00054105296,0.00008179147,0.00024838172,0.000045482862,0.000015530664,0.000052083564,0.00017363424,0.032297272,0.0009084048,0.9624388,0.0031174861,0.000080080725],"about_ca_topic_score_codex":3.6039393e-7,"about_ca_topic_score_gemma":2.8446792e-7,"teacher_disagreement_score":0.36306348,"about_ca_system_score_codex":0.000060168175,"about_ca_system_score_gemma":0.00007686326,"threshold_uncertainty_score":0.29893038},"labels":[],"label_agreement":null},{"id":"W3093489371","doi":"10.1016/j.jctb.2020.10.001","title":"Dismantlability, connectedness, and mixing in relational structures","year":2021,"lang":"en","type":"article","venue":"Repositori digital de la UPF (Universitat Pompeu Fabra)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Social connectedness; Constraint satisfaction problem; Mixing (physics); Uniqueness; Mathematics; Partition (number theory); Theoretical computer science; Computer science; Discrete mathematics; Combinatorics; Probabilistic logic","score_opus":0.008532611873337289,"score_gpt":0.24120353527116375,"score_spread":0.23267092339782647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093489371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9105449,0.000538869,0.07022177,0.00084189227,0.00030273694,0.00012968396,0.000017522787,0.0001494818,0.017253155],"genre_scores_gemma":[0.9879267,0.000014219589,0.011467255,0.00003007388,0.000044357057,0.0000014608496,0.00001414391,0.000010665588,0.00049109344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984547,0.00019076584,0.00015438366,0.0005309988,0.00033800848,0.0003311587],"domain_scores_gemma":[0.99843884,0.00082138536,0.00005685903,0.0003975771,0.00013186272,0.0001534543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017993229,0.00014658112,0.00017483701,0.00018380073,0.00019226906,0.00048741102,0.0004024936,0.00010954205,0.0000071677055],"category_scores_gemma":[0.00023563478,0.0001674361,0.00006321537,0.000792137,0.00020995631,0.0022110585,0.00064355164,0.00027892785,0.000004089244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024324061,0.00006428012,0.07557846,0.000028347471,0.00003136709,0.0013434009,0.0010811167,0.00017797826,0.003138873,0.9146694,0.00006870734,0.003793766],"study_design_scores_gemma":[0.0015849823,0.0001110383,0.27173927,0.000105460305,0.000014780443,0.0014618594,0.0019804977,0.013409079,0.0051732277,0.6979224,0.005774646,0.0007227287],"about_ca_topic_score_codex":0.000016084241,"about_ca_topic_score_gemma":0.000008079076,"teacher_disagreement_score":0.21674697,"about_ca_system_score_codex":0.00017701126,"about_ca_system_score_gemma":0.00017538293,"threshold_uncertainty_score":0.6827846},"labels":[],"label_agreement":null},{"id":"W3094347955","doi":"10.1002/jgt.22633","title":"Good orientations of unions of edge‐disjoint spanning trees","year":2020,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Centre National de la Recherche Scientifique; Danmarks Frie Forskningsfond; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Disjoint sets; Spanning tree; Enhanced Data Rates for GSM Evolution; Minimum degree spanning tree; Computer science","score_opus":0.03150365119484021,"score_gpt":0.30037943294383507,"score_spread":0.26887578174899485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094347955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11991533,0.00078121794,0.8760013,0.0012661227,0.00023222785,0.00010480223,0.000010411551,0.000021646008,0.0016669533],"genre_scores_gemma":[0.96879417,0.000073295705,0.03092352,0.000102135076,0.000058052177,0.0000013116719,4.7620833e-7,0.000010822094,0.000036246627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807847,0.00038975346,0.0006664185,0.00015391405,0.0005043195,0.00020714357],"domain_scores_gemma":[0.9976849,0.000609539,0.0006869761,0.00032778797,0.0004893832,0.00020142278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012470783,0.00011448592,0.0003465392,0.0004675375,0.00008519297,0.000021406258,0.0011016628,0.00004065709,0.000033506734],"category_scores_gemma":[0.00047692246,0.00009442228,0.00030125803,0.0013886538,0.0003134776,0.00056094484,0.00019228371,0.00032506278,0.000002635621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012164475,0.00012063152,0.0014452019,0.000030448551,0.000112614434,0.00002059389,0.0036001764,0.0011829596,0.026140928,0.9598421,0.0001289144,0.0072538177],"study_design_scores_gemma":[0.0010592355,0.0012204696,0.0066929893,0.00016750267,0.000049880244,0.000068924724,0.0025707867,0.0007828578,0.048191056,0.93847257,0.00054190936,0.00018180437],"about_ca_topic_score_codex":0.0000013262269,"about_ca_topic_score_gemma":0.0000010245416,"teacher_disagreement_score":0.8488788,"about_ca_system_score_codex":0.000015109413,"about_ca_system_score_gemma":0.00014778253,"threshold_uncertainty_score":0.38504288},"labels":[],"label_agreement":null},{"id":"W3094398332","doi":"10.1007/978-3-030-51117-3_13","title":"Eternal and Secure Domination in Graphs","year":2020,"lang":"en","type":"book-chapter","venue":"Developments in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dominating set; Sequence (biology); Computer science; Graph; Computer security; Combinatorics; Set (abstract data type); Mathematics; Theoretical computer science; Discrete mathematics; Vertex (graph theory); Programming language","score_opus":0.027297770491220338,"score_gpt":0.27646707256717135,"score_spread":0.249169302075951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094398332","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023125205,0.00064599334,0.2644796,0.0005515383,0.0004935332,0.002068571,0.000020663154,0.00022056013,0.72920704],"genre_scores_gemma":[0.018981474,0.00074014335,0.9187098,0.0002867656,0.000031561915,0.00007517557,0.00002268664,0.00010964804,0.061042704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834424,0.000023739083,0.00049062236,0.00042391516,0.00048543152,0.00023205394],"domain_scores_gemma":[0.9992435,0.00016900529,0.00017426659,0.00028761209,0.00004817665,0.000077468416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004735424,0.00025448247,0.00034795102,0.0005601734,0.000034917855,0.00008140439,0.0007168712,0.00017916918,0.0000140090415],"category_scores_gemma":[0.00008307403,0.00025535302,0.000032646654,0.00017849664,0.00006886531,0.00021499071,0.0005492073,0.0005052366,0.000045704706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035967441,0.000017507831,0.00011896744,0.00016805674,0.0000141823775,0.00013268074,0.0024681878,0.000002349355,0.000012382839,0.9850318,0.000031094594,0.011999205],"study_design_scores_gemma":[0.00034908627,0.000016686889,0.0002871515,0.00043157424,0.0000019004253,0.000023005181,0.000018413954,0.0016708967,0.000039062248,0.99480414,0.0020805285,0.00027754647],"about_ca_topic_score_codex":4.2921224e-7,"about_ca_topic_score_gemma":0.0000103189595,"teacher_disagreement_score":0.6681643,"about_ca_system_score_codex":0.000107631255,"about_ca_system_score_gemma":0.000090108435,"threshold_uncertainty_score":0.99998987},"labels":[],"label_agreement":null},{"id":"W3096569464","doi":"10.1002/jgt.22939","title":"Strong 3‐Flow Conjecture for projective planar graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Planar graph; Conjecture; Discrete mathematics; Graph","score_opus":0.028590567937119078,"score_gpt":0.31561184669941855,"score_spread":0.2870212787622995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096569464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033563547,0.00061487337,0.9625175,0.00085024146,0.0009635395,0.00057728356,0.000035075907,0.00017135673,0.0007065812],"genre_scores_gemma":[0.92368275,0.0002696639,0.07431705,0.00037154974,0.0004048366,0.00007526963,0.000007724262,0.00008035501,0.00079080876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978337,0.00037653392,0.00042754755,0.00028504108,0.0005399375,0.0005372286],"domain_scores_gemma":[0.99725336,0.0013738318,0.0003627092,0.0004366613,0.00039430545,0.00017913205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032948328,0.00019593629,0.00034935793,0.0012803905,0.0002450164,0.00009871727,0.0014167773,0.00009608501,0.000009735336],"category_scores_gemma":[0.00039851633,0.00015025694,0.00043133856,0.0017350251,0.00020867054,0.000676617,0.000109733504,0.00048358654,0.000012133362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038664736,0.000051129362,0.0002473909,0.00003119878,0.00019923024,0.00010433224,0.0011008945,0.0007070097,0.001132512,0.9703829,0.0026941826,0.022962531],"study_design_scores_gemma":[0.00096170825,0.00071416807,0.0006894136,0.000051770814,0.000018262333,0.00014102556,0.00048118056,0.0014065198,0.0015744041,0.9922836,0.001502054,0.00017591174],"about_ca_topic_score_codex":6.17608e-7,"about_ca_topic_score_gemma":0.0000017555521,"teacher_disagreement_score":0.8901192,"about_ca_system_score_codex":0.000041232448,"about_ca_system_score_gemma":0.00016490862,"threshold_uncertainty_score":0.61273},"labels":[],"label_agreement":null},{"id":"W3098440765","doi":"10.1145/3690821","title":"Efficient polynomial-time approximation scheme for the genus of dense graphs","year":2024,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Genus; Scheme (mathematics); Mathematics; Polynomial-time approximation scheme; Polynomial; Time complexity; Computer science; Combinatorics; Biology; Zoology; Mathematical analysis","score_opus":0.023569144577436082,"score_gpt":0.29851744322742635,"score_spread":0.27494829864999026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098440765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5589879,0.0053432896,0.41810694,0.015283549,0.0015448956,0.00057645945,0.000007123864,0.00003277585,0.00011708053],"genre_scores_gemma":[0.92125916,0.00003379813,0.07809833,0.00009616578,0.00016084148,0.000008138197,8.236246e-8,0.000013836154,0.00032963435],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989293,0.000094687544,0.0002962744,0.00010395719,0.00041185375,0.00016392622],"domain_scores_gemma":[0.9976965,0.00089574873,0.00020626851,0.00097154255,0.00018994685,0.000039993534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016498961,0.000070883034,0.00012741088,0.00015121169,0.00012193607,0.00008865543,0.0031647186,0.000027559603,0.000005560695],"category_scores_gemma":[0.001051458,0.000034711116,0.00027741166,0.0005324807,0.00009954483,0.00012787904,0.0005847013,0.00020950669,0.000007445074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072936283,0.00040599518,0.00024496025,0.00042429354,0.00097118807,0.00004603759,0.006168453,0.050420824,0.44849542,0.1949753,0.046049926,0.25106823],"study_design_scores_gemma":[0.00073988806,0.00033283414,0.0008748113,0.00031755533,0.000068827234,0.00037047302,0.000106423184,0.68225425,0.06357845,0.24362849,0.007552125,0.00017590672],"about_ca_topic_score_codex":9.734966e-7,"about_ca_topic_score_gemma":2.0557286e-7,"teacher_disagreement_score":0.6318334,"about_ca_system_score_codex":0.000038048598,"about_ca_system_score_gemma":0.0001067859,"threshold_uncertainty_score":0.58808875},"labels":[],"label_agreement":null},{"id":"W3099168587","doi":"10.1145/3519935.3520063","title":"On the complexity of CSP-based ideal membership problems","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ideal (ethics); Variety (cybernetics); Mathematics; Polynomial; Computer science; Task (project management); Combinatorial algorithms; Algebra over a field; Discrete mathematics; Algorithm; Pure mathematics; Artificial intelligence","score_opus":0.16474698805970076,"score_gpt":0.34221846811909284,"score_spread":0.1774714800593921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099168587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091477195,0.0001369933,0.8365699,0.022210145,0.00080528203,0.002608764,0.00008006409,0.00053581846,0.12790531],"genre_scores_gemma":[0.9655392,0.000004613616,0.031853534,0.0012097327,0.000026052749,0.00032235603,0.00002015079,0.00002608751,0.0009982721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654883,0.0008249613,0.00035684544,0.000721768,0.0011475445,0.0004000489],"domain_scores_gemma":[0.99582183,0.0012287364,0.00024728652,0.002466343,0.00014431709,0.00009149875],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021034575,0.00024903513,0.0003271553,0.00022202129,0.00022155933,0.000097207456,0.0048181545,0.00009082617,0.002018132],"category_scores_gemma":[0.00019017937,0.00016904387,0.00023108456,0.0005463257,0.0006639751,0.0000661995,0.0040305955,0.0013723205,0.00002696739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023631868,0.00009310563,0.000042895637,0.000096114156,0.000024861434,0.000004123419,0.0001719957,0.029487753,0.000051847754,0.96853375,0.0010623324,0.00040760514],"study_design_scores_gemma":[0.00015256809,0.00012751989,0.00013948398,0.00003481693,0.0000028955162,8.601838e-7,0.000025795407,0.053830784,0.0014940702,0.9430134,0.00099085,0.00018693543],"about_ca_topic_score_codex":0.00014979846,"about_ca_topic_score_gemma":0.00004735397,"teacher_disagreement_score":0.95639145,"about_ca_system_score_codex":0.000115883064,"about_ca_system_score_gemma":0.00032180242,"threshold_uncertainty_score":0.99889416},"labels":[],"label_agreement":null},{"id":"W3100051117","doi":"","title":"Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)","year":2022,"lang":"en","type":"preprint","venue":"tub.dok (Hamburg University of Technology)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Mathematics; Constraint satisfaction problem; Bounded function; Combinatorics; Complexity of constraint satisfaction; Discrete mathematics; Algebraic number; Local consistency","score_opus":0.016055232548989027,"score_gpt":0.2580699319846549,"score_spread":0.24201469943566586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100051117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5351407,0.00046509068,0.44176474,0.015048786,0.0006086847,0.00414217,0.0003417929,0.0009043745,0.0015836464],"genre_scores_gemma":[0.82053095,0.0003949328,0.17705809,0.0001647343,0.000027692286,0.00008546812,0.000065844644,0.00004832622,0.001623962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710643,0.00017998436,0.00042502483,0.0012292081,0.00037745255,0.0006819153],"domain_scores_gemma":[0.9973628,0.00024661518,0.000514739,0.0015715775,0.00020758147,0.00009667467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007417341,0.00038935913,0.0008016867,0.0021537878,0.00029455678,0.000024869216,0.0025597152,0.00089964754,0.00038772548],"category_scores_gemma":[0.00009534097,0.00048624643,0.00028516477,0.0011174781,0.0012602726,0.00020047266,0.0040082536,0.0022248146,0.000010366806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006544558,0.00054884504,0.05010051,0.0012452181,0.0007267289,0.0010936479,0.010713919,0.0049640266,0.0047765253,0.86413705,0.0035812932,0.057457805],"study_design_scores_gemma":[0.002464468,0.0006883222,0.0028123946,0.00022617422,0.00004274461,0.00010776138,0.0019824086,0.0017492656,0.0007745803,0.8998625,0.08851857,0.00077077426],"about_ca_topic_score_codex":0.0014597606,"about_ca_topic_score_gemma":0.00179775,"teacher_disagreement_score":0.28539026,"about_ca_system_score_codex":0.0008030887,"about_ca_system_score_gemma":0.0007567377,"threshold_uncertainty_score":0.9997589},"labels":[],"label_agreement":null},{"id":"W3100883497","doi":"","title":"CATERPILLAR DUALITIES AND REGULAR LANGUAGES","year":2013,"lang":"en","type":"article","venue":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Dual polyhedron; Mathematics; Combinatorics; Dual (grammatical number); Discrete mathematics; Datalog; Constraint (computer-aided design); Caterpillar; Programming language; Computer science; Linguistics","score_opus":0.014476143709301883,"score_gpt":0.24940266103330855,"score_spread":0.23492651732400666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100883497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9120427,0.0065064663,0.00013267653,0.068796925,0.0004047381,0.0011977276,0.000028016091,0.00023256148,0.010658198],"genre_scores_gemma":[0.9794778,0.00024923502,0.0103552025,0.0014488323,0.00015631328,0.000020559655,4.4138312e-7,0.000036606256,0.008254976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99571943,0.0008995341,0.0009115222,0.00069595757,0.0011986654,0.0005749088],"domain_scores_gemma":[0.9976383,0.0005101101,0.0009286702,0.0007076409,0.000020821644,0.00019447389],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.000718541,0.00032405223,0.0005353079,0.0003187457,0.0006536316,0.00019886837,0.0083822245,0.00030350196,0.000038315353],"category_scores_gemma":[0.00008776955,0.00019682785,0.00030263377,0.0016407078,0.004756594,0.008108309,0.0044876826,0.00075684494,0.0000043796654],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053949272,0.000119850105,0.051870678,0.0004991937,0.00015431018,0.0000019840315,0.0024195986,0.00033199426,0.20657122,0.7217894,0.012821462,0.003366349],"study_design_scores_gemma":[0.0002771874,0.000087597226,0.09613572,0.00033442542,0.000020475682,0.00008076587,0.0003619597,0.0012742355,0.7243484,0.1733685,0.0034233653,0.00028731476],"about_ca_topic_score_codex":0.000016999305,"about_ca_topic_score_gemma":2.6821837e-8,"teacher_disagreement_score":0.5484209,"about_ca_system_score_codex":0.000009870057,"about_ca_system_score_gemma":0.00016514068,"threshold_uncertainty_score":0.99795187},"labels":[],"label_agreement":null},{"id":"W3101417881","doi":"10.1007/978-3-030-38919-2_10","title":"Burning Two Worlds","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.02539464190771653,"score_gpt":0.29514440310651924,"score_spread":0.26974976119880273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101417881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016461418,0.00054553786,0.9826673,0.0017499094,0.0011326759,0.0003613986,0.0000029856683,0.0003263843,0.013197332],"genre_scores_gemma":[0.13606676,0.00004846288,0.8580738,0.003526209,0.0009700332,0.000016717731,0.0000049266805,0.00008681602,0.0012062651],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99464196,0.000068858084,0.0005188032,0.0021943836,0.001597086,0.00097889],"domain_scores_gemma":[0.9965017,0.00076869346,0.0002493664,0.0018210822,0.00026180863,0.0003973741],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010953547,0.00060636114,0.0006157499,0.0011496618,0.00035649203,0.0007115585,0.0066403593,0.00020548912,0.00004540474],"category_scores_gemma":[0.00021079542,0.00057137717,0.00017997745,0.0015711588,0.001103105,0.000881128,0.0035499893,0.0018156676,0.0002316762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086231175,0.000012133686,0.00003500722,0.000025814026,0.000010848589,0.00033655312,0.00051555736,0.027888345,0.00032074447,0.29114583,0.000018245728,0.67968225],"study_design_scores_gemma":[0.00026996015,0.00014027208,0.000018054887,0.0002275577,0.0000033512388,0.000064890235,9.17589e-8,0.31522605,0.0012126825,0.6786699,0.0035302655,0.0006368813],"about_ca_topic_score_codex":0.000007002565,"about_ca_topic_score_gemma":0.000027903887,"teacher_disagreement_score":0.6790454,"about_ca_system_score_codex":0.00030451486,"about_ca_system_score_gemma":0.00067125884,"threshold_uncertainty_score":0.9996738},"labels":[],"label_agreement":null},{"id":"W3102629258","doi":"","title":"On the stretch factor of randomly embedded random graphs","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Upper and lower bounds; Cardinality (data modeling); Random regular graph; Graph; Euclidean geometry; Random graph; Unit square; Discrete mathematics; Euclidean distance; Chordal graph; 1-planar graph; Geometry; Computer science; Mathematical analysis","score_opus":0.023443965262916793,"score_gpt":0.283113615424143,"score_spread":0.2596696501612262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102629258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4907666,0.00003368443,0.49915895,0.0030560174,0.00013631902,0.00046038162,0.000007634839,0.000115763585,0.0062646456],"genre_scores_gemma":[0.9974519,0.000016317656,0.001258034,0.00014383571,0.000008103737,0.000021569891,1.02488954e-7,0.0000065991617,0.0010935527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985938,0.0002506932,0.00019223275,0.00026015067,0.0004322881,0.0002708259],"domain_scores_gemma":[0.9956727,0.0032126755,0.00006594717,0.00087345013,0.00010584118,0.00006935828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000523811,0.00011092022,0.00018217595,0.000116950396,0.000073521034,0.00003018166,0.0012289757,0.000033319557,0.0007718506],"category_scores_gemma":[0.00040848594,0.000043608976,0.00013115154,0.00038443136,0.00020203558,0.00023311055,0.00016664747,0.00008686459,0.00008739603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003557706,0.000033767104,0.00010671478,0.000002466941,0.00002350517,0.000001935267,0.00018267518,0.0000017648063,0.012107432,0.95769656,0.0006367373,0.028850662],"study_design_scores_gemma":[0.0076670675,0.00018912482,0.00037194556,0.000034464254,0.0000021127241,0.0000022287031,0.00003565541,0.00097446505,0.1497237,0.8406028,0.00024839997,0.000148002],"about_ca_topic_score_codex":0.0000030043434,"about_ca_topic_score_gemma":0.000002981463,"teacher_disagreement_score":0.50668526,"about_ca_system_score_codex":0.000010711909,"about_ca_system_score_gemma":0.000031561285,"threshold_uncertainty_score":0.8451223},"labels":[],"label_agreement":null},{"id":"W3105851171","doi":"","title":"5-List-Coloring Planar Graphs with Distant Precolored Vertices","year":2017,"lang":"en","type":"article","venue":"Iowa State University Digital Repository (Iowa State University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Planar graph; Graph; List coloring; Colored; Discrete mathematics; Graph power; Line graph","score_opus":0.012278873435854458,"score_gpt":0.20413255774611988,"score_spread":0.19185368431026542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105851171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88497096,0.000027060181,0.043200713,0.00015468847,0.00046475805,0.0006170373,0.0001684362,0.00058955944,0.06980677],"genre_scores_gemma":[0.962077,0.00008499934,0.0016852096,0.000016267892,0.000017471244,4.977194e-7,0.00001354588,0.000035342433,0.036069617],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99651873,0.00017239098,0.0002512205,0.0012399836,0.0007814016,0.0010362937],"domain_scores_gemma":[0.9962999,0.00026010818,0.0004999451,0.0018417041,0.00042867925,0.00066964654],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001394996,0.00048556438,0.0004493694,0.0008229709,0.0026799028,0.0014731112,0.0041804267,0.0001063892,0.0000047645735],"category_scores_gemma":[0.00006430809,0.000520944,0.00021810192,0.0008163152,0.0011312917,0.008922074,0.0013491767,0.00047409104,0.000031127347],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02005973,0.0026282028,0.3771501,0.0007291582,0.0038492815,0.124730565,0.016524095,0.006202794,0.017834526,0.3762861,0.0026438364,0.05136163],"study_design_scores_gemma":[0.031865258,0.009827731,0.23995367,0.0015853074,0.0007432082,0.0009663321,0.023966243,0.010393842,0.051449735,0.07822251,0.53833985,0.012686308],"about_ca_topic_score_codex":0.0003318798,"about_ca_topic_score_gemma":0.00040972713,"teacher_disagreement_score":0.535696,"about_ca_system_score_codex":0.000687691,"about_ca_system_score_gemma":0.00038031524,"threshold_uncertainty_score":0.9997242},"labels":[],"label_agreement":null},{"id":"W3107865975","doi":"10.1002/jgt.22904","title":"A density bound for triangle‐free 4‐critical graphs","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Klein bottle; Mathematics; Combinatorics; Planar graph; Vertex (graph theory); Disjoint sets; Torus; Chordal graph; Projective plane; Discrete mathematics; Graph","score_opus":0.027147221033866072,"score_gpt":0.31440465452162353,"score_spread":0.28725743348775745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107865975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08386403,0.0018940982,0.9088265,0.0026593104,0.0017019018,0.000357129,0.000030540796,0.00006595289,0.00060055143],"genre_scores_gemma":[0.9608771,0.00003776185,0.037857484,0.0007648237,0.00015534366,0.00004543877,9.1694494e-7,0.000030752988,0.00023038412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663377,0.0010611671,0.00057433354,0.0002953314,0.0009183677,0.0005170333],"domain_scores_gemma":[0.9952052,0.0029537773,0.0003098758,0.0008217428,0.00044889393,0.00026048027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072956164,0.0001700521,0.0004129949,0.00086409855,0.00078754255,0.00012961387,0.0028633338,0.000047209065,0.00007697392],"category_scores_gemma":[0.002112957,0.0001525632,0.0006645375,0.0010681156,0.00035351928,0.00066270016,0.0007509216,0.00071524223,0.0000023497448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000867184,0.00020127547,0.00010967466,0.000017114402,0.000084508094,0.00015526106,0.00036626132,0.000049063463,0.0016209469,0.9869627,0.0023728341,0.0071931924],"study_design_scores_gemma":[0.0015278398,0.0010765699,0.00020587945,0.000012148206,0.000027412843,0.0007349076,0.00030645766,0.00018546186,0.0010137978,0.9908265,0.00391226,0.000170792],"about_ca_topic_score_codex":8.689886e-7,"about_ca_topic_score_gemma":0.0000013008193,"teacher_disagreement_score":0.8770131,"about_ca_system_score_codex":0.00009220521,"about_ca_system_score_gemma":0.00021581403,"threshold_uncertainty_score":0.6221346},"labels":[],"label_agreement":null},{"id":"W3108105039","doi":"10.37236/10585","title":"Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids","year":2022,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Probabilistic logic; Zero (linguistics); Forcing (mathematics); Combinatorics; Mathematics; Graph; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.016887275113576482,"score_gpt":0.2793944889790109,"score_spread":0.26250721386543446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108105039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75276035,0.016052322,0.21162757,0.007094043,0.005314553,0.0015305221,0.000008590193,0.00017634837,0.0054356996],"genre_scores_gemma":[0.997652,0.0014430019,0.00009300639,0.00015808105,0.00010426011,0.000023885885,0.0000012176016,0.00003812412,0.0004864427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961561,0.00066617085,0.00054101343,0.0004409881,0.0013295254,0.0008662229],"domain_scores_gemma":[0.9967551,0.001153985,0.00057011907,0.0011110652,0.00026455033,0.0001451313],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0034634923,0.00035415828,0.00052038115,0.000420318,0.00052518636,0.00027532675,0.003237927,0.00012650312,0.000010759264],"category_scores_gemma":[0.00036557426,0.0002483841,0.00022492617,0.0005864474,0.00016630901,0.00019571689,0.0015424616,0.0049836985,0.0000037732225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011641216,0.00016533273,0.000036914673,0.00004713611,0.000099151504,0.000033609234,0.00034996105,0.005062053,0.000037631366,0.99177253,0.00022737616,0.0020518904],"study_design_scores_gemma":[0.0005028446,0.0025486941,0.000104785526,0.00010723367,0.000033223845,0.00019691074,0.00003085667,0.002159176,0.00024367655,0.99034667,0.003481608,0.00024432395],"about_ca_topic_score_codex":0.0000032255623,"about_ca_topic_score_gemma":0.0000011994649,"teacher_disagreement_score":0.24489163,"about_ca_system_score_codex":0.0012671839,"about_ca_system_score_gemma":0.001161314,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W3108309801","doi":"","title":"Stability for UMAP","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Metric space; Metric (unit); Iterated function; Mathematics; Neighbourhood (mathematics); Combinatorics; Path (computing); Set (abstract data type); Stability (learning theory); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.19324992373138244,"score_gpt":0.24024718119055,"score_spread":0.04699725745916755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108309801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037434876,0.000038125898,0.95928407,0.0004569276,0.00034857137,0.00073692657,0.000053830307,0.00035985408,0.0012868313],"genre_scores_gemma":[0.9870896,0.000034605826,0.012217436,0.00010763188,0.00006697536,0.0000045275515,0.000014907732,0.000020192467,0.0004441486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752563,0.00018720949,0.00017299126,0.0015438149,0.000110879824,0.00045946552],"domain_scores_gemma":[0.9972149,0.00036782186,0.00014834605,0.0017236477,0.00026531445,0.00027995498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041700367,0.0002732738,0.0003403931,0.00015290843,0.00017469551,0.00010516335,0.0032205854,0.0002082762,0.000030478572],"category_scores_gemma":[0.0001935709,0.00032390203,0.00031352616,0.0006224437,0.00018918661,0.0003659713,0.003667621,0.00064064655,0.00007262241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010342098,0.00006995055,0.00061495777,0.00019236971,0.000064462445,0.00008667958,0.00021268889,0.013035491,0.00021042784,0.9841392,0.0002941822,0.0009761819],"study_design_scores_gemma":[0.0003579202,0.000076697615,0.00016750705,0.000019355744,0.000015621641,7.4065395e-7,0.000039558592,0.28495562,0.0009417486,0.71171385,0.0014027688,0.0003085766],"about_ca_topic_score_codex":0.000016484684,"about_ca_topic_score_gemma":0.000010253985,"teacher_disagreement_score":0.9496547,"about_ca_system_score_codex":0.00020955234,"about_ca_system_score_gemma":0.0002811762,"threshold_uncertainty_score":0.9999213},"labels":[],"label_agreement":null},{"id":"W3109000230","doi":"10.1007/s10114-020-9488-9","title":"An Improved Upper Bound on the Linear 2-arboricity of 1-planar Graphs","year":2020,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Arboricity; Combinatorics; Planar graph; Mathematics; Graph; Disjoint sets; Planar; Upper and lower bounds; Computer science; Mathematical analysis","score_opus":0.02933394371888223,"score_gpt":0.28286217039348727,"score_spread":0.25352822667460506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109000230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89231974,0.00014618157,0.05183543,0.030193707,0.0006703856,0.0023026553,0.00010718182,0.0015281899,0.02089653],"genre_scores_gemma":[0.96528554,0.000035934543,0.033648614,0.00080641406,0.00010211381,0.000038298855,0.0000032396472,0.00003141978,0.000048418962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977985,0.0002722273,0.0004811581,0.00051131303,0.00052032364,0.0004164907],"domain_scores_gemma":[0.99642116,0.0012426478,0.00021554217,0.0015899404,0.0003078052,0.00022289812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075642817,0.00025074498,0.000407599,0.00008027099,0.00022412304,0.00017544476,0.002429507,0.00009243453,0.00006593169],"category_scores_gemma":[0.0023963545,0.00016868926,0.00014807454,0.0007997863,0.00046683606,0.0011522284,0.0002640645,0.00040713686,0.00002018772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001230395,0.00024093088,0.000045191315,0.00010929633,0.000064560816,0.0000058402466,0.0098512685,0.0000057833754,0.011863376,0.9766336,0.0006733995,0.00038371218],"study_design_scores_gemma":[0.0010709408,0.004129897,0.0005313469,0.00017009319,0.000055389955,0.0000147249475,0.004858221,0.025328882,0.09557453,0.85422915,0.012985352,0.0010514797],"about_ca_topic_score_codex":0.0000025782153,"about_ca_topic_score_gemma":0.0000017957785,"teacher_disagreement_score":0.12240446,"about_ca_system_score_codex":0.000014342439,"about_ca_system_score_gemma":0.00008498267,"threshold_uncertainty_score":0.6878949},"labels":[],"label_agreement":null},{"id":"W3111722804","doi":"10.1017/s0963548322000165","title":"Clustered colouring of graph classes with bounded treedepth or pathwidth","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Bounded function; Friendship graph; Graph; Discrete mathematics; Class (philosophy); Upper and lower bounds; Pathwidth; Integer (computer science); Graph power; Computer science; Line graph","score_opus":0.03701321584223581,"score_gpt":0.2773013662615847,"score_spread":0.24028815041934887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111722804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7549986,0.00010644385,0.24223551,0.00020921836,0.00040942142,0.0008857388,0.000005496263,0.00035090206,0.0007986342],"genre_scores_gemma":[0.96765155,0.0000027703948,0.03212298,0.000050067727,0.000014472316,0.000047783185,0.00000355208,0.00002808753,0.00007875087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958736,0.00076385,0.00062619516,0.0008983186,0.001112816,0.0007252531],"domain_scores_gemma":[0.9966277,0.0009986145,0.00042462227,0.0013704709,0.00040185134,0.0001767286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022027383,0.00029079238,0.0005077856,0.000329161,0.0010031883,0.0001291381,0.002338827,0.000055651042,0.000016107157],"category_scores_gemma":[0.00029776525,0.00025437816,0.00013062872,0.0031982444,0.0003087695,0.00037900265,0.0029137717,0.00068730215,0.0000014971857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005061374,0.001647409,0.03999922,0.0004310505,0.00010681606,0.0001053336,0.0027264773,0.015626904,0.00044295177,0.9269603,0.00006788844,0.011379497],"study_design_scores_gemma":[0.0028843158,0.002690921,0.005304653,0.00006945715,0.000016363176,0.000117927586,0.0004884337,0.07462389,0.00198208,0.9107177,0.00046924155,0.0006350014],"about_ca_topic_score_codex":0.000023098944,"about_ca_topic_score_gemma":0.000017815059,"teacher_disagreement_score":0.21265289,"about_ca_system_score_codex":0.00042931997,"about_ca_system_score_gemma":0.00049275515,"threshold_uncertainty_score":0.9999908},"labels":[],"label_agreement":null},{"id":"W3114660220","doi":"10.4230/lipics.icalp.2016.27","title":"The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems","year":2016,"lang":"en","type":"article","venue":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Hungarian Scientific Research Fund; Grantová Agentura České Republiky","keywords":"Steiner tree problem; Combinatorics; Parameterized complexity; Mathematics; Bounded function; Discrete mathematics; Path (computing); Directed graph; Computer science","score_opus":0.0437889203206143,"score_gpt":0.29414249494610195,"score_spread":0.25035357462548763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114660220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14057861,0.0042432644,0.573638,0.1704297,0.0026030727,0.006051,0.000064317406,0.002359194,0.10003285],"genre_scores_gemma":[0.97638685,0.000041773914,0.020884452,0.00019036108,0.0001378509,0.00008388974,0.0000010144946,0.000012654,0.0022611711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619937,0.00052730844,0.00082183606,0.0007142447,0.001113753,0.00062349165],"domain_scores_gemma":[0.99664605,0.0012387668,0.0008562195,0.00064122485,0.00043308717,0.0001846697],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0032381807,0.00018850068,0.00027979913,0.00024616875,0.00083256,0.00023785385,0.0036560337,0.00014256316,0.000018608556],"category_scores_gemma":[0.00062640366,0.00010657114,0.00012243677,0.0023623267,0.0028761243,0.0014223665,0.000525086,0.00026263454,0.000015402778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028716935,0.000078613964,0.012884264,0.000022612103,0.00004183001,3.079833e-7,0.00015077897,0.00014418842,0.03157325,0.9291208,0.005859404,0.020095265],"study_design_scores_gemma":[0.0019210855,0.0006737209,0.25102034,0.0003707095,0.000034230372,0.00010506092,0.00010573061,0.05525798,0.09016403,0.52299184,0.07628509,0.0010701664],"about_ca_topic_score_codex":0.000009287293,"about_ca_topic_score_gemma":0.0000027384174,"teacher_disagreement_score":0.8358082,"about_ca_system_score_codex":0.000044490567,"about_ca_system_score_gemma":0.00017494893,"threshold_uncertainty_score":0.99983746},"labels":[],"label_agreement":null},{"id":"W3114956369","doi":"10.55016/ojs/cdm.v16i3.72075","title":"On the real roots of domination polynomials","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Closure (psychology); Cardinality (data modeling); Graph; Domination analysis; Order (exchange); Discrete mathematics","score_opus":0.019161338421442364,"score_gpt":0.3299928174266208,"score_spread":0.31083147900517843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114956369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037718117,0.00003912935,0.9493649,0.006685999,0.00009979719,0.00038680632,0.00010808852,0.00005394469,0.005543233],"genre_scores_gemma":[0.9746316,0.00001412027,0.024468144,0.00013708687,0.000032187687,0.00006560995,0.000009207659,0.000009430726,0.00063259306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867415,0.00017255396,0.0003191825,0.0002136221,0.00036381054,0.00025666782],"domain_scores_gemma":[0.9968015,0.001488501,0.00011647816,0.0009684969,0.000535439,0.00008957427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084401795,0.000105452564,0.00020265418,0.00009644876,0.00019905774,0.00009070773,0.0006898917,0.000043626176,0.00004294753],"category_scores_gemma":[0.003194045,0.00007400691,0.000095899304,0.0007756103,0.000081343176,0.00013545029,0.00031803985,0.000118992575,0.0000853962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004667977,0.00006292908,0.0000044247786,0.000010376478,0.000016267717,0.0000037499915,0.00029225662,0.00011555667,0.012286637,0.98595923,0.00052056916,0.0007233236],"study_design_scores_gemma":[0.000346224,0.000096645854,0.00041452964,0.000101448204,0.000013359615,0.000009124705,0.00021523375,0.01176219,0.12660186,0.8597077,0.0005724753,0.0001591654],"about_ca_topic_score_codex":0.000002195792,"about_ca_topic_score_gemma":0.000005527066,"teacher_disagreement_score":0.9369135,"about_ca_system_score_codex":0.00008115144,"about_ca_system_score_gemma":0.00012293555,"threshold_uncertainty_score":0.3823801},"labels":[],"label_agreement":null},{"id":"W3115154750","doi":"10.48550/arxiv.1907.12119","title":"A Fast Minimum Degree Algorithm and Matching Lower Bound","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Heuristics; Time complexity; Combinatorics; Algorithm; Mathematics; Running time; Binary logarithm; Reduction (mathematics); Graph; Simple (philosophy); Upper and lower bounds; Combinatorial algorithms; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.047551259976895,"score_gpt":0.20329682537760113,"score_spread":0.15574556540070614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115154750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49609736,0.00002682186,0.50080496,0.00003427172,0.00012992969,0.00011428067,0.000001911622,0.000075095784,0.0027153823],"genre_scores_gemma":[0.9863659,0.000026489015,0.008459289,0.00007862497,0.000019238221,2.516913e-7,7.4104844e-7,0.000011091824,0.0050383615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987525,0.00007722953,0.00008425723,0.0006166052,0.00009472251,0.00037473955],"domain_scores_gemma":[0.9989353,0.00014296369,0.000050437542,0.000642266,0.00006713322,0.00016191218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021312166,0.00014181857,0.00014774544,0.00018658383,0.00015094709,0.00010659667,0.0008238858,0.00006097987,0.00004386834],"category_scores_gemma":[0.000009946714,0.0001531443,0.000059311056,0.00062518957,0.00012564284,0.0009405838,0.00062275084,0.00020211398,0.00027150055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008983128,0.0001503722,0.007427507,0.000042845157,0.0000846991,0.00090416765,0.00080617156,0.005472436,0.0021886919,0.9379196,0.00011282936,0.04480086],"study_design_scores_gemma":[0.001975791,0.00037198403,0.005218645,0.00006025588,0.00001785918,0.00006389715,0.00054722844,0.5583003,0.00056947826,0.43029955,0.0018186305,0.000756395],"about_ca_topic_score_codex":0.000021466183,"about_ca_topic_score_gemma":0.000006372459,"teacher_disagreement_score":0.55282784,"about_ca_system_score_codex":0.000053749627,"about_ca_system_score_gemma":0.000043555723,"threshold_uncertainty_score":0.6245043},"labels":[],"label_agreement":null},{"id":"W3115176827","doi":"10.4230/lipics.isaac.2020.31","title":"Flexible List Colorings in Graphs with Special Degeneracy Conditions","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Combinatorics; Degeneracy (biology); Treewidth; Mathematics; List coloring; Graph; Degree (music); Discrete mathematics; Pathwidth; Physics; Line graph; Graph power","score_opus":0.03325270291963795,"score_gpt":0.3085065180223265,"score_spread":0.27525381510268854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115176827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27790555,0.00013663297,0.66883993,0.0028932649,0.0031264191,0.008306619,0.0037618014,0.0013233791,0.03370641],"genre_scores_gemma":[0.8385564,0.00020086815,0.15150267,0.0023315812,0.0011333309,0.0022208386,0.0029142848,0.00022732378,0.0009127068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949833,0.00011081822,0.0015463039,0.000892349,0.0011020723,0.0013651525],"domain_scores_gemma":[0.9961259,0.00030562637,0.00077216973,0.0017523847,0.00053088786,0.0005130725],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00071303674,0.00083724613,0.0010172243,0.0010946817,0.00046037862,0.0010906705,0.003791787,0.00047362232,0.00006920733],"category_scores_gemma":[0.00016517103,0.000790377,0.0004094896,0.0013645679,0.00045076557,0.002223875,0.0032648987,0.0022383973,0.00015317864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082915626,0.0008640971,0.008902376,0.0026100285,0.0005392218,0.00017282901,0.014892703,0.006833262,0.00012907587,0.94891393,0.010171385,0.0051419497],"study_design_scores_gemma":[0.016580751,0.002351091,0.005893119,0.0026350217,0.0001770445,0.00030705772,0.0028209905,0.12491043,0.008707221,0.64828444,0.18149412,0.0058387173],"about_ca_topic_score_codex":0.000042729764,"about_ca_topic_score_gemma":0.000112626585,"teacher_disagreement_score":0.5606508,"about_ca_system_score_codex":0.00037779904,"about_ca_system_score_gemma":0.00055197714,"threshold_uncertainty_score":0.9999463},"labels":[],"label_agreement":null},{"id":"W3115384833","doi":"10.55016/ojs/cdm.v15i1.62630","title":"Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Upper and lower bounds; Domination analysis; Type (biology); Discrete mathematics","score_opus":0.0494903473845529,"score_gpt":0.33917181318300416,"score_spread":0.2896814657984513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115384833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09813225,0.000078143516,0.89738965,0.0032917815,0.000050727223,0.00081951724,0.00010715585,0.000080038066,0.0000507505],"genre_scores_gemma":[0.86763173,0.000010881071,0.13194926,0.0002162035,0.000013822457,0.00012924685,0.000017227203,0.000011276327,0.000020345045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998805,0.00007083454,0.0003190531,0.00028789492,0.00018138158,0.00033587238],"domain_scores_gemma":[0.9981879,0.0010341369,0.000079831516,0.00028467248,0.00024906464,0.00016438028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005175965,0.00013370096,0.0002391439,0.00017051546,0.0001448626,0.00014838371,0.0003713117,0.000050329527,0.0000017987418],"category_scores_gemma":[0.004078943,0.00012539538,0.00005115637,0.00076978956,0.000070314876,0.0003276106,0.00022216397,0.000112843896,0.000010181282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043774755,0.00004062684,0.0004963802,0.00012579019,0.000021140037,0.0000029797104,0.005815108,0.00045955332,0.0014456317,0.9888055,0.00014480676,0.0025987646],"study_design_scores_gemma":[0.0017402695,0.00039941247,0.00062580075,0.00012900982,0.000017462695,0.000004669176,0.0014448852,0.3556331,0.0061630933,0.63236225,0.0010492502,0.00043079414],"about_ca_topic_score_codex":0.000004530174,"about_ca_topic_score_gemma":0.00001584604,"teacher_disagreement_score":0.7694995,"about_ca_system_score_codex":0.000053534157,"about_ca_system_score_gemma":0.000038058326,"threshold_uncertainty_score":0.5113475},"labels":[],"label_agreement":null},{"id":"W3117062007","doi":"10.1145/3474057","title":"Algorithms for Weighted Independent Transversals and Strong Colouring","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Chromatic scale; Mathematical proof; Partition (number theory); Mathematics; Graph partition; Combinatorics; Discrete mathematics; Graph; Computer science; Algorithm","score_opus":0.04069205520459028,"score_gpt":0.31724421791541285,"score_spread":0.27655216271082256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117062007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032812897,0.00025596816,0.9931882,0.0020063191,0.00041428886,0.00044082018,0.00006845423,0.0002097218,0.00013490648],"genre_scores_gemma":[0.18279834,0.00028818008,0.8149157,0.0002807121,0.000081593906,0.00029016053,0.000010396429,0.000051084644,0.0012838376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781567,0.00012327859,0.0002844321,0.0007616003,0.00045859715,0.0005564258],"domain_scores_gemma":[0.9979749,0.0005793076,0.000051587733,0.0009321025,0.00022155531,0.00024057478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037846412,0.00023566134,0.00026897184,0.00024432683,0.0004867187,0.00019301473,0.00079599564,0.00012862228,0.000059477636],"category_scores_gemma":[0.00003950006,0.0002451428,0.00015664587,0.000641551,0.000104527535,0.00059559353,0.000036103684,0.00039564568,0.000014296308],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005834571,0.00033603597,0.000014110414,0.000045957262,0.00018641373,0.00009373252,0.00072085694,0.0009177349,0.0027440544,0.013918944,0.000028758632,0.98093504],"study_design_scores_gemma":[0.010048569,0.0015643053,0.0011752875,0.00019161763,0.00015890972,0.00040080055,0.0016336977,0.3802839,0.34955826,0.24231018,0.01080386,0.0018706362],"about_ca_topic_score_codex":0.000010611645,"about_ca_topic_score_gemma":0.000023365974,"teacher_disagreement_score":0.9790644,"about_ca_system_score_codex":0.00008946986,"about_ca_system_score_gemma":0.00013272204,"threshold_uncertainty_score":0.9996633},"labels":[],"label_agreement":null},{"id":"W3117130829","doi":"10.1007/s00373-022-02487-x","title":"On the Unimodality of Domination Polynomials","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unimodality; Mathematics; Combinatorics; Multipartite; Domination analysis; Graph; Polynomial; Cardinality (data modeling); Discrete mathematics; Vertex (graph theory)","score_opus":0.017295990982832958,"score_gpt":0.2514579524417743,"score_spread":0.23416196145894136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117130829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9862027,0.0002680683,0.008485091,0.0017536085,0.0003825986,0.00025547022,0.0000090137,0.000048205853,0.0025952337],"genre_scores_gemma":[0.9996226,0.00002353805,0.000089900386,0.0001287607,0.0000017977688,0.000032888285,6.976835e-7,0.000003657393,0.000096204494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895024,0.0002548117,0.00012288585,0.00017542808,0.0003595471,0.00013709179],"domain_scores_gemma":[0.99897754,0.00044187455,0.00007626592,0.00041382422,0.000054732078,0.000035771503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000941966,0.000064059794,0.000094683826,0.00012168063,0.0003758142,0.000027376382,0.0006214493,0.000014831433,0.000013787945],"category_scores_gemma":[0.00006177818,0.000048291575,0.00004251051,0.0008426493,0.000087364686,0.00008824573,0.0004090662,0.00017196056,7.1579285e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011587076,0.000068099565,0.00034215805,0.0000035232933,0.000005601219,0.0000012884692,0.00017224748,0.000023263072,0.0002000734,0.9964663,0.00022336535,0.0024825316],"study_design_scores_gemma":[0.00021895189,0.00020715973,0.0017908181,0.0000016226398,0.0000015016526,0.0000024020937,0.00009027645,0.0009862707,0.0012091243,0.99483776,0.000596919,0.00005718834],"about_ca_topic_score_codex":0.0000105605,"about_ca_topic_score_gemma":3.171463e-7,"teacher_disagreement_score":0.013419845,"about_ca_system_score_codex":0.00002422221,"about_ca_system_score_gemma":0.000025898269,"threshold_uncertainty_score":0.2890497},"labels":[],"label_agreement":null},{"id":"W3119325883","doi":"10.4310/joc.2021.v12.n1.a4","title":"Zero-forcing in random regular graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Mathematics; Zero (linguistics); Forcing (mathematics); Combinatorics; Random graph; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.015088871495038923,"score_gpt":0.2742597223041571,"score_spread":0.2591708508091182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119325883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31781828,0.004451291,0.6720901,0.0013405576,0.0018289556,0.000112407986,4.0104896e-7,0.000030880907,0.0023271102],"genre_scores_gemma":[0.9922314,0.0003100072,0.007111156,0.000077966346,0.000021109981,0.0000011784009,1.6379974e-7,0.0000095774785,0.00023739939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981455,0.00026838193,0.0004783542,0.00015925316,0.0006564299,0.00029205205],"domain_scores_gemma":[0.9983037,0.00034920944,0.00024283773,0.00040571063,0.00055929384,0.00013923399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014977743,0.00010229566,0.000311683,0.00040330656,0.000068138565,0.00010302818,0.0008587758,0.000059074544,0.000005822451],"category_scores_gemma":[0.00046131216,0.00009331008,0.0001586865,0.0017521831,0.000039692495,0.0007133702,0.00021028354,0.0005106025,0.0000039166343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045711204,0.00015280655,0.0031093047,0.000016677637,0.000022057076,0.0012765554,0.00026882457,0.00044864783,0.0025559352,0.9884312,0.00034179224,0.0033304668],"study_design_scores_gemma":[0.0028117548,0.00011376215,0.0012623399,0.000071911665,0.000004037342,0.00032754836,0.00004837183,0.00071014627,0.010380358,0.982019,0.0021419409,0.00010882754],"about_ca_topic_score_codex":9.2938706e-7,"about_ca_topic_score_gemma":0.0000010494177,"teacher_disagreement_score":0.67441314,"about_ca_system_score_codex":0.00010110331,"about_ca_system_score_gemma":0.0002930379,"threshold_uncertainty_score":0.38050747},"labels":[],"label_agreement":null},{"id":"W3122003030","doi":"","title":"On the Equivalence between some Local and Global Chinese Postman and Traveling Salesman Graphs","year":2000,"lang":"en","type":"preprint","venue":"Data Archiving and Networked Services (DANS)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Travelling salesman problem; Combinatorics; Mathematics; Vertex (graph theory); Equivalence (formal languages); Graph; Undirected graph; Discrete mathematics; Mathematical optimization","score_opus":0.025924298784476368,"score_gpt":0.29539410305197644,"score_spread":0.26946980426750006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122003030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9441472,0.0025542823,0.050825078,0.00052049843,0.00014460218,0.0004673011,0.0008070465,0.00016852764,0.0003654569],"genre_scores_gemma":[0.9932296,0.0029611452,0.002694733,0.00038875322,0.00020891649,0.000018939278,0.00045112596,0.000032133077,0.000014651347],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957903,0.00061134924,0.00043182835,0.00181782,0.0005489586,0.0007997257],"domain_scores_gemma":[0.99523294,0.001501476,0.00018807732,0.0026909744,0.000027518543,0.00035902477],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014159301,0.00060486357,0.000553211,0.00012814772,0.0007553648,0.0007078524,0.0050490196,0.00017513856,0.0000028729035],"category_scores_gemma":[0.000025852398,0.00042696644,0.00006219398,0.00041653842,0.00071332435,0.0006482013,0.009788384,0.0011927321,0.0000043183663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006642254,0.00020531451,0.23773207,0.0027107848,0.0008368714,0.00023934206,0.012603533,0.01137379,0.00009405008,0.16550216,0.00015685952,0.567881],"study_design_scores_gemma":[0.0002873415,0.000105003455,0.18697965,0.0009620387,0.00004331158,0.00004764677,0.000113298214,0.349068,0.0000030305514,0.4617587,0.0000838143,0.00054817874],"about_ca_topic_score_codex":0.00030656136,"about_ca_topic_score_gemma":0.00034757936,"teacher_disagreement_score":0.5673328,"about_ca_system_score_codex":0.000023870503,"about_ca_system_score_gemma":0.000055211673,"threshold_uncertainty_score":0.9998182},"labels":[],"label_agreement":null},{"id":"W312445613","doi":"10.1016/j.dam.2005.05.004","title":"The resolution complexity of random graph k-colorability","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Mathematical proof; Upper and lower bounds; Discrete mathematics; Random graph; Graph; Exponential function","score_opus":0.03941499046506563,"score_gpt":0.3009212942072034,"score_spread":0.2615063037421378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W312445613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01610676,0.00010482287,0.9690558,0.0008490546,0.000039298353,0.00065880123,0.0000063519333,0.000118489676,0.013060621],"genre_scores_gemma":[0.7141351,0.000026834723,0.2856564,0.00002888898,0.000024119692,0.000070315335,0.0000021193428,0.000010515253,0.00004570196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983244,0.00007226803,0.00047409357,0.00027013416,0.0005010048,0.00035809152],"domain_scores_gemma":[0.997604,0.000773826,0.00021778994,0.0012226877,0.00010331728,0.00007837446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016304188,0.00014633163,0.00026592525,0.000062758525,0.00032973502,0.000070338654,0.0012652477,0.00005115693,0.000008451779],"category_scores_gemma":[0.00015129814,0.000096525815,0.00011850156,0.00048031125,0.000830609,0.00017675776,0.000380397,0.00018822793,0.00003222345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047594192,0.00006944863,0.0000052610785,0.00003976205,0.00001696081,2.0360972e-7,0.0006619921,0.00028945343,0.0022595495,0.9910005,0.00008913181,0.005520143],"study_design_scores_gemma":[0.0006265769,0.00002696225,0.00011982786,0.000010288492,0.000006711996,0.0000023864402,0.00018320298,0.04455197,0.00865703,0.9449202,0.00077384117,0.000121022655],"about_ca_topic_score_codex":0.0000021257172,"about_ca_topic_score_gemma":0.000015647549,"teacher_disagreement_score":0.6980283,"about_ca_system_score_codex":0.000040176903,"about_ca_system_score_gemma":0.00003425008,"threshold_uncertainty_score":0.39362085},"labels":[],"label_agreement":null},{"id":"W3124632410","doi":"10.1016/j.jctb.2021.01.005","title":"Obstructions for bounded shrub-depth and rank-depth","year":2021,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Basic Science; National Research Foundation of Korea; Ministry of Education","keywords":"Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Path (computing); Graph; Rank (graph theory); Planar graph; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.05923293731809692,"score_gpt":0.32990333426136076,"score_spread":0.27067039694326384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124632410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5419227,0.005610781,0.42679638,0.0132623315,0.0007108994,0.0034769014,0.00032061152,0.00051136455,0.0073880735],"genre_scores_gemma":[0.85800636,0.00077687827,0.13011242,0.000037411675,0.00013951183,0.000010357585,0.00010193596,0.00004139962,0.010773716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963311,0.000486173,0.0002109413,0.0011424263,0.0009404604,0.00088890287],"domain_scores_gemma":[0.99568444,0.000643352,0.00009072154,0.0014631868,0.0017821493,0.0003361589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018476044,0.00018536806,0.0003550832,0.0006592845,0.0010898265,0.00014423736,0.0015681811,0.00009859321,0.000043807122],"category_scores_gemma":[0.0011250072,0.00021608932,0.00013485856,0.002031262,0.0013662628,0.0011392552,0.0016024718,0.0005896417,0.000037744507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010861609,0.001498187,0.008134273,0.0013781857,0.0007661735,0.0009396077,0.01749013,0.00019828833,0.099469095,0.5024973,0.038440954,0.32810163],"study_design_scores_gemma":[0.009288676,0.0017345939,0.0547573,0.0002761325,0.00007198768,0.00066680834,0.012319957,0.0038065678,0.09570462,0.3619895,0.45754611,0.0018377543],"about_ca_topic_score_codex":0.00021769061,"about_ca_topic_score_gemma":0.00041361054,"teacher_disagreement_score":0.41910517,"about_ca_system_score_codex":0.00017647044,"about_ca_system_score_gemma":0.0007066969,"threshold_uncertainty_score":0.88118666},"labels":[],"label_agreement":null},{"id":"W3125582982","doi":"","title":"Conflict Resolution in the Scheduling of Television Commercials","year":2009,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"","keywords":"Weighting; Combinatorics; Scheduling (production processes); Partition (number theory); Mathematics; Upper and lower bounds; Extension (predicate logic); Generalization; Computer science; Algorithm; Mathematical optimization","score_opus":0.025765488557012415,"score_gpt":0.3239979941457003,"score_spread":0.29823250558868786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125582982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2255661,0.004980091,0.76317346,0.00521816,0.000062740175,0.00019968,3.575205e-7,0.00002267131,0.0007767279],"genre_scores_gemma":[0.99541473,0.0016942217,0.0025944815,0.00019950152,0.00006184737,0.000001250916,3.6752505e-7,0.0000036478043,0.000029962055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974029,0.00042895452,0.00030056472,0.00015027859,0.00043477374,0.0012825286],"domain_scores_gemma":[0.99921846,0.00018592745,0.00014210476,0.00032821324,0.000090675254,0.00003459319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064690253,0.00008599734,0.0001450693,0.0002194063,0.000165291,0.000056708537,0.0012546771,0.00004438372,0.000001958153],"category_scores_gemma":[0.00018036443,0.000059878425,0.00007275596,0.0006716794,0.00005131015,0.00039111444,0.0000490285,0.0015166613,0.0000050191115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028427803,0.000053259148,0.00015447818,0.0000011706393,0.000005978526,0.0000032465564,0.0003696584,0.00056866236,0.0026910135,0.8750077,0.0000083520235,0.12110808],"study_design_scores_gemma":[0.0005192608,0.00061001914,0.0028352782,0.000037719772,0.0000027425015,0.00025667693,0.00052826054,0.0048780222,0.0006360547,0.9891009,0.00050008396,0.00009501896],"about_ca_topic_score_codex":0.0000102146005,"about_ca_topic_score_gemma":0.00004025744,"teacher_disagreement_score":0.76984864,"about_ca_system_score_codex":0.00022595267,"about_ca_system_score_gemma":0.00047405786,"threshold_uncertainty_score":0.65892226},"labels":[],"label_agreement":null},{"id":"W3128824031","doi":"10.1007/s40065-021-00311-7","title":"The complexity of frugal colouring","year":2021,"lang":"en","type":"article","venue":"Arabian Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Combinatorics; Neighbourhood (mathematics); Mathematics; Vertex (graph theory); Discrete mathematics","score_opus":0.07437948393906975,"score_gpt":0.3162392872467088,"score_spread":0.24185980330763907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128824031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23539607,0.0008279628,0.7575897,0.003566941,0.00031234726,0.00008677837,0.0000016691093,0.000014585304,0.0022039565],"genre_scores_gemma":[0.7217982,0.00007190698,0.2779002,0.000030553092,0.00003882028,5.8901423e-7,6.0041344e-8,0.00000699662,0.00015268268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998602,0.000138633,0.0005133642,0.000075688935,0.00047966195,0.0001906865],"domain_scores_gemma":[0.9978196,0.0006712537,0.00044871648,0.00044850545,0.00052770256,0.00008421861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013531273,0.00007005096,0.0002166799,0.000054920612,0.00013807887,0.00007747532,0.0010446997,0.00002249122,0.000012020062],"category_scores_gemma":[0.0006528376,0.00004661955,0.00012858979,0.00031787605,0.00031260305,0.00021756187,0.00022042905,0.00024018048,0.000006142064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007052923,0.00015244227,0.00020842793,0.000057993635,0.0000651536,0.000105783474,0.0015336988,0.00014949607,0.0030263935,0.9898065,0.00018695704,0.004700134],"study_design_scores_gemma":[0.00029180624,0.000104950894,0.00053335464,0.00012039485,0.000008373163,0.00064279535,0.00079466944,0.004377451,0.02764807,0.9647928,0.0006139731,0.00007135826],"about_ca_topic_score_codex":2.3647725e-7,"about_ca_topic_score_gemma":0.0000032499177,"teacher_disagreement_score":0.48640212,"about_ca_system_score_codex":0.000022550981,"about_ca_system_score_gemma":0.0001514866,"threshold_uncertainty_score":0.19413292},"labels":[],"label_agreement":null},{"id":"W3129089473","doi":"10.46298/dmtcs.7158","title":"Domination in Kn\\\"odel Graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Dominating set; Graph; Upper and lower bounds; Discrete mathematics; Domination analysis; Vertex (graph theory)","score_opus":0.016350692049110136,"score_gpt":0.29461141545501224,"score_spread":0.2782607234059021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129089473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03282952,0.00003032099,0.96024024,0.0009199096,0.00031264676,0.00042669228,0.0000049772448,0.00016455645,0.005071149],"genre_scores_gemma":[0.7383382,0.0000028984482,0.26132202,0.00020535193,0.000015888174,0.00008029357,0.0000016137916,0.000013955446,0.00001982438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954167,0.00031409267,0.00051876856,0.0009438193,0.0018919325,0.00091469166],"domain_scores_gemma":[0.99751127,0.00059388473,0.00013519304,0.0013534555,0.00015394289,0.00025227526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047570406,0.00024950926,0.0003150709,0.00086260954,0.00087926287,0.00041129076,0.004960365,0.0000358295,0.00013052729],"category_scores_gemma":[0.00020172636,0.00022541355,0.000115854695,0.0040941495,0.0020702763,0.0009247632,0.0041095545,0.00056136464,0.000038027116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008154749,0.00015393876,0.00003710501,0.000015522168,0.0000028706586,0.000029735225,0.002088754,0.0013416635,0.0005552004,0.9897216,0.000016011152,0.006029427],"study_design_scores_gemma":[0.00019094955,0.00009059598,0.0000651363,0.000011250827,0.0000013272512,0.00003301528,0.00008315293,0.47571185,0.00033336546,0.5232888,0.000028314253,0.00016224026],"about_ca_topic_score_codex":0.0000020646605,"about_ca_topic_score_gemma":8.7612216e-7,"teacher_disagreement_score":0.70550865,"about_ca_system_score_codex":0.00017402311,"about_ca_system_score_gemma":0.00015645238,"threshold_uncertainty_score":0.92176753},"labels":[],"label_agreement":null},{"id":"W31298921","doi":"10.1164/rccm.201906-1275ed","title":"Braodcast Chromatic Numbers of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.019290742424289572,"score_gpt":0.2675628570168777,"score_spread":0.24827211459258813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31298921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891099,0.00016015969,0.0034473478,0.000121353216,0.0007317617,0.00018139306,0.0000013411599,0.00015156175,0.006095207],"genre_scores_gemma":[0.99415934,0.000035211324,0.0055373637,0.000044243883,0.0000020874486,0.000011815104,9.544385e-7,0.000012706225,0.00019626171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985143,0.00011027254,0.00025725627,0.0002973369,0.0004779842,0.00034283623],"domain_scores_gemma":[0.99859643,0.00019732528,0.00010594823,0.00084457884,0.00012718317,0.00012852292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027040963,0.00013149383,0.0002276862,0.0001842045,0.00015175166,0.000017827639,0.0011810599,0.00005182177,0.000024141384],"category_scores_gemma":[0.00009192481,0.00012968083,0.00010045916,0.0010772857,0.00028327171,0.00046229735,0.00027556345,0.0001628785,0.00008492772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053615713,0.00010348707,0.0041917423,0.000018319975,0.000018972041,0.000043026008,0.0005249781,0.00000831518,0.001254085,0.99234325,0.00072566204,0.00076282275],"study_design_scores_gemma":[0.00061009976,0.00013417349,0.006883877,0.000021040214,0.0000023201653,0.00007100368,0.000019955343,0.00068893214,0.008728703,0.98245686,0.0002251615,0.00015789089],"about_ca_topic_score_codex":0.000018696264,"about_ca_topic_score_gemma":0.0000011990388,"teacher_disagreement_score":0.009886384,"about_ca_system_score_codex":0.00003068449,"about_ca_system_score_gemma":0.00007943057,"threshold_uncertainty_score":0.52882314},"labels":[],"label_agreement":null},{"id":"W3130492185","doi":"10.1142/s1793830921500890","title":"Star chromatic number of some graphs","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Iran National Science Foundation","keywords":"Mathematics; Combinatorics; Star (game theory); Cartesian product; Chromatic scale; Vertex (graph theory); Graph; Brooks' theorem; Edge coloring; Star product; Discrete mathematics; 1-planar graph; Chordal graph; Graph power; Line graph","score_opus":0.017198585531656225,"score_gpt":0.30707402447920484,"score_spread":0.28987543894754864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130492185","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01258414,0.00038131012,0.98441285,0.00032240667,0.000017815932,0.00031309863,0.00003239393,0.00006597718,0.0018700197],"genre_scores_gemma":[0.07489776,0.0002944163,0.9239158,0.000065060645,0.000035471232,0.00030120963,0.000019313278,0.000022923392,0.0004480713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989445,0.000027164126,0.00028946108,0.00027836394,0.00026270375,0.00019781345],"domain_scores_gemma":[0.9987302,0.00017911315,0.00011172992,0.00073597074,0.00014331841,0.00009966885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019338544,0.00011375103,0.00020756933,0.00005648724,0.00013448096,0.00007674337,0.0004076709,0.00003706571,0.000027954184],"category_scores_gemma":[0.000027666452,0.000102326296,0.00006652981,0.0005602622,0.00013837052,0.0002422597,0.0002729587,0.00009163193,0.000026068928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.2127492e-7,0.0000866849,0.000023223176,0.000114241775,0.000021555912,0.000001951044,0.00031548992,0.0000045362713,0.0011756043,0.99156624,0.000015096195,0.006675134],"study_design_scores_gemma":[0.00014885099,0.000010585651,0.00010929989,0.00003056755,0.000010434767,0.00003462597,0.00024145523,0.032075033,0.0039623748,0.96250814,0.0007386177,0.00013000694],"about_ca_topic_score_codex":0.0000020994205,"about_ca_topic_score_gemma":6.192844e-7,"teacher_disagreement_score":0.06231362,"about_ca_system_score_codex":0.0000088031675,"about_ca_system_score_gemma":0.000045027533,"threshold_uncertainty_score":0.41727453},"labels":[],"label_agreement":null},{"id":"W3132307481","doi":"10.1016/j.jctb.2021.02.001","title":"Connectivity and choosability of graphs with no K minor","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Minor (academic); Mathematics; Graph; Conjecture; Graph minor; Upper and lower bounds; Discrete mathematics; Graph power; Line graph","score_opus":0.00907079580733079,"score_gpt":0.2509396275268328,"score_spread":0.24186883171950202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132307481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98103637,0.00051320466,0.014649578,0.0002920036,0.0017447867,0.00011252804,0.000003615603,0.000018644665,0.0016292826],"genre_scores_gemma":[0.99305356,0.00006173347,0.00665165,0.000022911609,0.00008920258,0.0000017639632,2.0538407e-7,0.000008734384,0.00011025603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800116,0.00070761924,0.00038175925,0.00021206756,0.00048172203,0.00021566763],"domain_scores_gemma":[0.9967729,0.00093152694,0.00036718047,0.00047464436,0.0013001289,0.0001536439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019643353,0.00013957321,0.00042996512,0.00011458126,0.000100430516,0.000069453876,0.0005304418,0.00006084661,0.0000344761],"category_scores_gemma":[0.0011103798,0.000106728454,0.00010779698,0.0005272009,0.00051092677,0.001111247,0.00023848681,0.00032346713,9.62933e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013313849,0.00019716655,0.0028697941,0.00004589551,0.000083901,0.00007595482,0.00030373575,0.0000063650364,0.0060865106,0.98708975,0.00002503281,0.0018845274],"study_design_scores_gemma":[0.0013535318,0.0012560694,0.0034499085,0.00004864175,0.00001391164,0.0003281397,0.00016970566,0.000009034408,0.04757929,0.94485575,0.0008157837,0.00012022848],"about_ca_topic_score_codex":0.0000013362663,"about_ca_topic_score_gemma":0.0000013191238,"teacher_disagreement_score":0.042233974,"about_ca_system_score_codex":0.000030423558,"about_ca_system_score_gemma":0.00028036788,"threshold_uncertainty_score":0.435226},"labels":[],"label_agreement":null},{"id":"W3135193972","doi":"10.1016/j.disc.2021.112362","title":"Chordality of locally semicomplete and weakly quasi-transitive digraphs","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Transitive relation; Digraph; Mathematics; Combinatorics; Strongly connected component; Discrete mathematics; Graph","score_opus":0.020454960617849585,"score_gpt":0.28865346542544035,"score_spread":0.2681985048075908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135193972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07576432,0.00031333385,0.919957,0.00038809804,0.00003857622,0.00016342793,0.000030833122,0.000063222484,0.003281217],"genre_scores_gemma":[0.8376867,0.00008207706,0.16195853,0.00007461769,0.000012081406,0.000010536481,0.000005913579,0.000016063219,0.00015346955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984568,0.00013146899,0.0003588837,0.00035795078,0.0004029646,0.00029194253],"domain_scores_gemma":[0.99840343,0.00037714248,0.0001188672,0.00075266004,0.00022623011,0.00012164597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046456084,0.0001598423,0.00033397513,0.00008176143,0.00008509598,0.00007719602,0.000495534,0.000052723142,0.00001493553],"category_scores_gemma":[0.00016511086,0.00014155876,0.00010405276,0.0005340579,0.00026365035,0.0002734277,0.0003302029,0.00017021579,0.0000065392737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009449015,0.00015186208,0.00026426715,0.00035666281,0.00006561753,0.000041324744,0.0040875087,0.000014148457,0.024371514,0.9662943,0.000022121041,0.004321243],"study_design_scores_gemma":[0.000518758,0.0001666105,0.0013187039,0.00025285815,0.000024503586,0.000098793775,0.0014166968,0.041584294,0.049561124,0.9043906,0.0002782079,0.0003888686],"about_ca_topic_score_codex":0.0000043410796,"about_ca_topic_score_gemma":0.000010047541,"teacher_disagreement_score":0.7619224,"about_ca_system_score_codex":0.0000136142135,"about_ca_system_score_gemma":0.000066475586,"threshold_uncertainty_score":0.5772599},"labels":[],"label_agreement":null},{"id":"W3136082331","doi":"10.55016/ojs/cdm.v15i2.62672","title":"Equality Perfect Graphs and Digraphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Graph; Chromatic scale; Alice and Bob; Discrete mathematics; Alice (programming language); Computer science","score_opus":0.030712067699897636,"score_gpt":0.3319881593684025,"score_spread":0.30127609166850483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136082331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019665772,0.00019954612,0.9693465,0.008532583,0.000039087106,0.0005185224,0.00013042646,0.0003191596,0.0012483583],"genre_scores_gemma":[0.94416195,0.000024935742,0.054927018,0.0007048172,0.000022523778,0.00006575655,0.000007390263,0.000014279314,0.00007133675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834424,0.00012445688,0.00032116135,0.00042931078,0.00033557953,0.00044522414],"domain_scores_gemma":[0.9981771,0.00038599866,0.00007415554,0.00062602625,0.00021283158,0.0005238607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056915655,0.00018595175,0.000293438,0.00011944559,0.00030542864,0.00023413645,0.00077744253,0.000056375702,0.000016541471],"category_scores_gemma":[0.0013783481,0.0001612908,0.00010834295,0.0011070146,0.00014724859,0.00034790943,0.00061906123,0.0002072157,0.00009775398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063220036,0.000029715904,0.00014122154,0.000044605706,0.000023493074,0.000004725784,0.0015895168,0.000019420093,0.0015373041,0.99501514,0.0003415816,0.0012469671],"study_design_scores_gemma":[0.0007158113,0.00034169247,0.0007111371,0.0000587859,0.000028678673,0.000021966482,0.00031622397,0.047077913,0.0038979906,0.94141865,0.00488006,0.000531067],"about_ca_topic_score_codex":0.0000025915606,"about_ca_topic_score_gemma":0.0000022836118,"teacher_disagreement_score":0.9244962,"about_ca_system_score_codex":0.00003066053,"about_ca_system_score_gemma":0.000045466157,"threshold_uncertainty_score":0.6577248},"labels":[],"label_agreement":null},{"id":"W3140032042","doi":"10.55016/ojs/cdm.v20i1.73743","title":"Saved by the rook: a case of matchings and Hamiltonian cycles","year":2025,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Cartesian product; Hamiltonian path; Graph; Vertex (graph theory); Mathematics; Complete graph; Hamiltonian (control theory); Complement graph; Discrete mathematics; Line graph; Graph power","score_opus":0.015544680755604775,"score_gpt":0.3371160409681031,"score_spread":0.3215713602124983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140032042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021211924,0.00085068704,0.96882886,0.0043215207,0.00011130736,0.0013092685,0.0021539822,0.00009569397,0.0011167873],"genre_scores_gemma":[0.83251554,0.00014626549,0.16383901,0.0003032931,0.000047376634,0.0005368641,0.000063684456,0.0000362447,0.0025117348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979652,0.00019360725,0.00059030065,0.00051831425,0.00030527008,0.00042726658],"domain_scores_gemma":[0.99638045,0.0009963998,0.00027701535,0.0017768015,0.00039296248,0.00017639407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010204437,0.00031377297,0.0005427715,0.00021102489,0.0003967295,0.00029138714,0.0015951706,0.00017548582,0.000008074868],"category_scores_gemma":[0.0009131595,0.00023009755,0.0001599596,0.0004744099,0.00030014777,0.000121875215,0.003950286,0.00058943057,0.000009689202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009066433,0.000092721864,0.00001541212,0.00048758657,0.00015468671,0.00005051391,0.0045216503,0.0003026918,0.00054509577,0.98826796,0.0016298988,0.003922696],"study_design_scores_gemma":[0.0004297956,0.00005985506,0.000034599416,0.00076898036,0.00010147221,0.0003279152,0.0006109322,0.06807298,0.002902712,0.92452306,0.001697177,0.00047054063],"about_ca_topic_score_codex":0.00007292452,"about_ca_topic_score_gemma":0.00004429592,"teacher_disagreement_score":0.8113036,"about_ca_system_score_codex":0.00010704106,"about_ca_system_score_gemma":0.0001933533,"threshold_uncertainty_score":0.93831056},"labels":[],"label_agreement":null},{"id":"W3140312363","doi":"10.1007/s00285-021-01601-6","title":"Corrigendum to “Best match graphs”","year":2021,"lang":"en","type":"erratum","venue":"Journal of Mathematical Biology","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Universität Leipzig","keywords":"Lemma (botany); Precondition; Mathematics; Discrete mathematics; Combinatorics; Algorithm; Computer science; Biology","score_opus":0.0515386356139553,"score_gpt":0.3448042626324283,"score_spread":0.29326562701847303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140312363","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020614498,0.0032320449,0.91828454,0.004981217,0.041199375,0.00033161344,0.000023674067,0.000051718995,0.031689685],"genre_scores_gemma":[0.0011412911,0.002184809,0.59878117,0.003000647,0.004272547,0.000052387168,0.000039578063,0.00018494928,0.3903426],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658906,0.00045355654,0.0011362187,0.0004701488,0.00062784675,0.0007231352],"domain_scores_gemma":[0.9965343,0.00046838168,0.0006501463,0.0009949716,0.0008108504,0.00054137746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014748198,0.0003646344,0.0012590985,0.000698101,0.0000902535,0.0001337775,0.003115097,0.0006227127,0.00043735112],"category_scores_gemma":[0.0016075028,0.00026648582,0.0005033262,0.000884559,0.00020524568,0.00018036214,0.0009581767,0.0020079124,0.00052056496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019295385,0.0002261881,0.000007275913,0.00015357052,0.0001384777,0.00045041757,0.0001587047,0.0000012576788,0.0005403985,0.4250799,0.56777436,0.005450153],"study_design_scores_gemma":[0.00018678224,0.0007548858,0.000007023424,0.00043948786,0.000026827684,0.0011912169,0.000052479427,0.00013398686,0.00020917594,0.68386364,0.3128552,0.00027926045],"about_ca_topic_score_codex":9.666311e-7,"about_ca_topic_score_gemma":0.0000019849426,"teacher_disagreement_score":0.35865292,"about_ca_system_score_codex":0.00009814347,"about_ca_system_score_gemma":0.00053907366,"threshold_uncertainty_score":0.9999787},"labels":[],"label_agreement":null},{"id":"W3140694014","doi":"","title":"Eternal k-domination on graphs.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Dominating set; Domination analysis; Mathematics; Graph; Sequence (biology); Discrete mathematics","score_opus":0.08171175207183747,"score_gpt":0.22036936872399412,"score_spread":0.13865761665215665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140694014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41286653,0.0000409401,0.5827695,0.00008844384,0.0005022828,0.00018815084,0.0000055532596,0.00016531826,0.0033733037],"genre_scores_gemma":[0.9955927,0.00015545939,0.0024750724,0.00010815844,0.000039077986,0.0000013890123,0.00001455085,0.000017494302,0.0015960751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767655,0.0003059168,0.00015512311,0.001266077,0.00020313475,0.00039318265],"domain_scores_gemma":[0.9976539,0.00019304341,0.00016830626,0.0015433818,0.00025893943,0.00018240749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003518381,0.00027638298,0.00026703192,0.00053984986,0.00016612101,0.00021051601,0.002290513,0.00022689685,0.00004638833],"category_scores_gemma":[0.00007191983,0.0003282117,0.00027567867,0.0009175926,0.00013409264,0.00048347982,0.0022386678,0.0009069299,0.000085498585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044979435,0.00011440834,0.00073055533,0.000038688562,0.00006615018,0.00095102424,0.0001503006,0.06987415,0.00018600533,0.9248527,0.00007387913,0.0029171158],"study_design_scores_gemma":[0.00078835496,0.00014505541,0.002769122,0.00020158367,0.000027798302,0.000012835164,0.00009441342,0.26689976,0.0027523516,0.7253069,0.00030590198,0.00069590926],"about_ca_topic_score_codex":0.000028857461,"about_ca_topic_score_gemma":0.000014536321,"teacher_disagreement_score":0.5827262,"about_ca_system_score_codex":0.00020387056,"about_ca_system_score_gemma":0.00016908937,"threshold_uncertainty_score":0.999917},"labels":[],"label_agreement":null},{"id":"W3140783139","doi":"10.1007/s00373-022-02478-y","title":"Predominating a Vertex in the Connected Domination Game","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Vertex connectivity; Discrete mathematics","score_opus":0.01243350273283779,"score_gpt":0.24614587311416752,"score_spread":0.23371237038132975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140783139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98535895,0.00072709227,0.010141638,0.0010248476,0.00035721625,0.00047573968,0.0000034951656,0.00009642027,0.0018145768],"genre_scores_gemma":[0.9993802,0.0000295999,0.000216581,0.00015934177,0.0000021148703,0.00014637584,0.0000022616996,0.0000057018397,0.000057844678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985067,0.00038968294,0.00015112407,0.00026803932,0.00043464074,0.00024978875],"domain_scores_gemma":[0.9990366,0.00046633033,0.000058897796,0.0003491695,0.00005215719,0.0000368561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011111456,0.00009027205,0.00010628591,0.0002445218,0.0003561973,0.000099080295,0.0008437887,0.00002161497,0.000007913285],"category_scores_gemma":[0.00010721846,0.00007546958,0.000034964407,0.0018513778,0.000057247238,0.00022762995,0.00041254697,0.00033368715,0.0000012807874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009097024,0.00009238757,0.0010473279,0.0000057570555,0.0000033154254,0.00002259398,0.00211017,0.000030314677,0.00009144461,0.9870176,0.00008076698,0.009489235],"study_design_scores_gemma":[0.00084887154,0.00020269121,0.0068493537,0.0000040035825,0.0000019969882,0.000035647932,0.000858435,0.022024207,0.00005969205,0.9680596,0.00094055117,0.00011497436],"about_ca_topic_score_codex":0.000009594462,"about_ca_topic_score_gemma":0.000002203464,"teacher_disagreement_score":0.021993892,"about_ca_system_score_codex":0.000043256296,"about_ca_system_score_gemma":0.000027483002,"threshold_uncertainty_score":0.307756},"labels":[],"label_agreement":null},{"id":"W3141724913","doi":"","title":"Paired-Domination in Claw-Free Graphs with Minimum Degree at Least Four.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Degree (music); Combinatorics; Biology; Physics","score_opus":0.03066532496089894,"score_gpt":0.2654474907939363,"score_spread":0.23478216583303738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141724913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98470193,0.000083113104,0.005824257,0.0009325474,0.0009803445,0.00044951367,0.000002830065,0.00020138649,0.0068240603],"genre_scores_gemma":[0.9930912,0.000008004831,0.0061591812,0.000104060746,0.000012747529,0.00005313293,0.0000025657407,0.000026194066,0.00054286164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757946,0.00023031581,0.00026867972,0.0006367309,0.00065823336,0.00062656484],"domain_scores_gemma":[0.9977032,0.00026759392,0.00011601798,0.0014547665,0.00028766386,0.00017075155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074462197,0.0002272446,0.00024079136,0.00038809047,0.00025813066,0.000093192,0.0018870804,0.00010160815,0.000024814664],"category_scores_gemma":[0.00020009922,0.00020548308,0.000060952403,0.0015722977,0.00042510492,0.0007677916,0.0008207951,0.00025317978,0.00014009436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015126275,0.000131765,0.017196633,0.000011840901,0.000016874656,0.00007794566,0.0005304562,0.000004283653,0.00075657666,0.9722551,0.0014943647,0.007372899],"study_design_scores_gemma":[0.0029233247,0.0007092251,0.026637318,0.0000529783,0.000004055426,0.00003851574,0.000040458483,0.0027736,0.0039478964,0.9618202,0.0007339101,0.00031853572],"about_ca_topic_score_codex":0.000024708832,"about_ca_topic_score_gemma":0.00032835102,"teacher_disagreement_score":0.010434915,"about_ca_system_score_codex":0.00019502926,"about_ca_system_score_gemma":0.000086819484,"threshold_uncertainty_score":0.8379357},"labels":[],"label_agreement":null},{"id":"W31460525","doi":"10.1039/c9cc05103a","title":"Powers of Asteroidal Triple-free Graphs with Applications.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Emil Aaltosen Säätiö; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.010637802496877196,"score_gpt":0.2542648206693099,"score_spread":0.24362701817243268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31460525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46987322,0.0017833733,0.4703427,0.0006763548,0.0016965071,0.0026946578,0.000016603719,0.0005984587,0.052318133],"genre_scores_gemma":[0.97664726,0.00000955342,0.022940507,0.00003307206,0.0000011308833,0.000088106244,9.3274656e-7,0.0000150408505,0.0002643899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985328,0.0001328718,0.00020884928,0.00036015018,0.00044511395,0.00032025442],"domain_scores_gemma":[0.99801433,0.000145834,0.000111166686,0.0014150371,0.00018948625,0.00012414718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004142165,0.00013674158,0.00018625215,0.00019831018,0.0001008203,0.000039455037,0.0014024428,0.000047560345,0.00001154503],"category_scores_gemma":[0.00008242817,0.000120819685,0.000056606023,0.0012772308,0.00018757873,0.00034168686,0.00015917525,0.0001677942,0.000019302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016214444,0.00010414775,0.0017540295,0.000010476394,0.00001948073,0.0000038115875,0.00010293277,0.000009353904,0.0005054251,0.99615544,0.00020837063,0.0011103048],"study_design_scores_gemma":[0.0013368035,0.00024375442,0.0004521998,0.000009409219,0.0000037782868,0.0000130432345,0.000044798428,0.000057289428,0.00710183,0.9880316,0.0025587508,0.00014668758],"about_ca_topic_score_codex":0.0000036036913,"about_ca_topic_score_gemma":0.0000017565296,"teacher_disagreement_score":0.50677407,"about_ca_system_score_codex":0.0000281921,"about_ca_system_score_gemma":0.00009226772,"threshold_uncertainty_score":0.4926884},"labels":[],"label_agreement":null},{"id":"W3147818285","doi":"","title":"Toughness and [a,b]-factors with inclusion/exclusion properties","year":2011,"lang":"en","type":"article","venue":"中国科学:数学(英文版)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Graph; Inclusion (mineral); Mathematics; Combinatorics; Physics","score_opus":0.04861995598887572,"score_gpt":0.254511906562886,"score_spread":0.2058919505740103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147818285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94736856,0.000646027,0.046264708,0.00029119494,0.00019495275,0.00043369233,0.0000029184203,0.00030262693,0.0044953222],"genre_scores_gemma":[0.98885435,0.000054559456,0.009918569,0.00014606256,0.000040235293,0.000028733424,0.0000017713427,0.000029461698,0.000926239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978332,0.00014464774,0.00022042687,0.00063485955,0.00061144604,0.00055543473],"domain_scores_gemma":[0.99858105,0.00008449474,0.000088788634,0.0008429526,0.00016661645,0.00023607622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041529356,0.00026748647,0.0002553933,0.00021689913,0.0008058762,0.00010328788,0.0011963495,0.000092821116,0.000057688776],"category_scores_gemma":[0.000069539,0.0001752175,0.000044795415,0.00060298573,0.00034438647,0.0010327158,0.0038033784,0.0002813125,0.000035784607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019044686,0.0016236067,0.09605222,0.0006436818,0.0003042262,0.00073948764,0.3054618,0.00022947123,0.053390212,0.35115677,0.0014965588,0.18699749],"study_design_scores_gemma":[0.007928857,0.0066079223,0.15960054,0.0014546082,0.00010961638,0.0005477147,0.009766781,0.03682353,0.46077695,0.26820746,0.04249598,0.005680038],"about_ca_topic_score_codex":0.00022672486,"about_ca_topic_score_gemma":0.000111281835,"teacher_disagreement_score":0.40738675,"about_ca_system_score_codex":0.00005336311,"about_ca_system_score_gemma":0.00010000454,"threshold_uncertainty_score":0.7145162},"labels":[],"label_agreement":null},{"id":"W31481056","doi":"10.1186/s12913-019-4391-8","title":"Computing Minimal Triangulations in Time","year":2005,"lang":"en","type":"article","venue":"BMC Health Services Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research; Ministry of Health, British Columbia","keywords":"Combinatorics; Time complexity; Upper and lower bounds; Triangulation; Vertex (graph theory); Graph; Mathematics; Matrix multiplication; Discrete mathematics; Running time; Computer science; Algorithm","score_opus":0.06898875246700287,"score_gpt":0.44776358983563525,"score_spread":0.3787748373686324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31481056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8944434,0.0022799904,0.08807847,0.006376139,0.0001412749,0.0025625457,0.000009626641,0.0004879751,0.0056205904],"genre_scores_gemma":[0.8760166,0.000036707952,0.12204263,0.00066434254,0.00025469044,0.000042969405,0.000009146642,0.000024502617,0.00090837706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99434793,0.0015487906,0.0005606941,0.0006523107,0.0014317913,0.001458467],"domain_scores_gemma":[0.9969211,0.0014171366,0.00008523162,0.00089225883,0.0002654878,0.00041877074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0076746545,0.00013918742,0.00026862393,0.0010853722,0.0005252592,0.00025039283,0.0024334618,0.000083586645,0.00007797326],"category_scores_gemma":[0.00006205864,0.00014001135,0.000053460444,0.003236401,0.00010055679,0.00074923347,0.0010682839,0.00068818056,0.0011629342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005610899,0.0018962253,0.15097262,0.0023342764,0.00003521015,0.00007254099,0.042562366,0.01763387,0.0016649071,0.16802694,0.0007163085,0.61352366],"study_design_scores_gemma":[0.001381344,0.00024122036,0.13454345,0.00023615437,3.3768336e-7,0.0000125848155,0.0004800498,0.8461156,0.00018593784,0.0067013027,0.00986789,0.00023413294],"about_ca_topic_score_codex":0.00022032794,"about_ca_topic_score_gemma":0.00064422155,"teacher_disagreement_score":0.82848173,"about_ca_system_score_codex":0.000366096,"about_ca_system_score_gemma":0.00071910414,"threshold_uncertainty_score":0.9996148},"labels":[],"label_agreement":null},{"id":"W3151244505","doi":"","title":"Trees with the second and third largest number of maximum independent sets.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.017541912431659378,"score_gpt":0.2757287504529915,"score_spread":0.25818683802133213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151244505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914397,0.00015668845,0.0006329073,0.0006709699,0.00025421882,0.00017377916,0.0000035434814,0.000046538124,0.0066216844],"genre_scores_gemma":[0.99796844,0.0000051332045,0.001283954,0.00008441211,0.0000021608714,0.000013814873,7.2050966e-7,0.000010273841,0.00063107844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987301,0.0001405054,0.00012746465,0.0002678326,0.00047355084,0.00026053443],"domain_scores_gemma":[0.9988146,0.0001713561,0.00008088065,0.00061834726,0.00017369603,0.0001411511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006824776,0.00012064947,0.00016120191,0.00004790738,0.00008642989,0.00007254292,0.0007856385,0.000048651324,0.000016049591],"category_scores_gemma":[0.00003478927,0.00007682264,0.000024616682,0.00036527257,0.00021065709,0.00037514564,0.00040857977,0.00022210737,0.000024527777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034789377,0.00006890053,0.023151282,0.000010285796,0.000028809249,0.000020568064,0.0013126864,0.0000050019703,0.000110402034,0.972917,0.0014042428,0.00093601935],"study_design_scores_gemma":[0.0011391063,0.00018508552,0.010088993,0.000011240831,0.0000040178866,0.000057137528,0.00028071494,0.00023303549,0.0017855335,0.98364085,0.0024413904,0.00013290868],"about_ca_topic_score_codex":0.000013900346,"about_ca_topic_score_gemma":0.000054866734,"teacher_disagreement_score":0.013062288,"about_ca_system_score_codex":0.000023699951,"about_ca_system_score_gemma":0.000086086926,"threshold_uncertainty_score":0.31327364},"labels":[],"label_agreement":null},{"id":"W3152744231","doi":"10.1007/s00373-023-02638-8","title":"The Explorer–Director Game on Graphs","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Security token; Vertex (graph theory); Graph; Mathematics; Computer science; Square lattice; Wheel graph; Discrete mathematics; Graph power; Line graph","score_opus":0.029609282595315527,"score_gpt":0.277482437763077,"score_spread":0.24787315516776148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152744231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9757474,0.0025246819,0.0043601533,0.0044430364,0.0035056425,0.0007755596,0.000009430531,0.0021832103,0.0064509003],"genre_scores_gemma":[0.9967966,0.0021074144,0.000085512016,0.0001415374,0.000010262104,0.00008516492,0.0000017649118,0.000019289519,0.00075245777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820423,0.00012447612,0.00017210486,0.00043060756,0.0005109468,0.0005576318],"domain_scores_gemma":[0.9982223,0.0006518308,0.000053833508,0.00080322794,0.000094439994,0.00017438926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065781234,0.00017428302,0.00015042606,0.0003054124,0.0006056016,0.0002581796,0.0010365716,0.000057971723,0.0000018252099],"category_scores_gemma":[0.000102595244,0.00012122583,0.0000973841,0.0027899775,0.00019434033,0.0002243617,0.0003684714,0.00027961904,0.00007978096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010325328,0.00002832821,0.0007135101,0.0000053939843,0.000014115435,0.000020624511,0.00025218987,0.000004864382,0.000054895987,0.9764112,0.0018709466,0.020613583],"study_design_scores_gemma":[0.00029574096,0.00020098806,0.0051326915,0.000010307162,0.0000021114865,0.0000043227224,0.00008973597,0.0013601908,0.00041002475,0.97582805,0.016499689,0.00016616352],"about_ca_topic_score_codex":0.0000040355853,"about_ca_topic_score_gemma":0.0000015944923,"teacher_disagreement_score":0.021049213,"about_ca_system_score_codex":0.000020258964,"about_ca_system_score_gemma":0.000027076812,"threshold_uncertainty_score":0.4943446},"labels":[],"label_agreement":null},{"id":"W3152988225","doi":"10.1142/s0129054111009148","title":"APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Euclidean geometry; Geometric networks; Approximation algorithm; Time complexity; Network planning and design; Computer science; Polynomial; Geometric design; Euclidean space; Algorithm; Mathematical optimization; Polynomial-time approximation scheme; Discrete mathematics; Theoretical computer science; Mathematics; Graph theory; Combinatorics; Geometry","score_opus":0.09136408144728773,"score_gpt":0.34830072277790397,"score_spread":0.2569366413306162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152988225","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028814594,0.00006507061,0.99412847,0.00028143497,0.0021832704,0.00022526129,0.0000030206904,0.000021957416,0.0002100331],"genre_scores_gemma":[0.24031377,0.000016669213,0.7593308,0.000060206472,0.00023529107,0.000007925274,0.0000011377825,0.000005597767,0.000028562163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972969,0.000079035584,0.0006862341,0.0002898329,0.0013322941,0.00031568875],"domain_scores_gemma":[0.99448824,0.0005615578,0.00079270155,0.0003815213,0.0036354444,0.00014051396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030832987,0.00012245897,0.0002002885,0.0014235266,0.0002557469,0.00021327741,0.0042800508,0.000034810906,0.000022053548],"category_scores_gemma":[0.00036781654,0.00011090425,0.00014204402,0.0019438594,0.00043219118,0.0026011427,0.00056467653,0.00012833891,0.000009291066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021754953,0.0005001686,0.00060093566,0.000015899928,0.0001934111,0.00002136182,0.0015266276,0.083152816,0.002315436,0.40801486,0.0009590283,0.5024819],"study_design_scores_gemma":[0.0011599254,0.0009196166,0.0044854633,0.00008706725,0.000014132822,0.00034204338,0.000012525129,0.6906188,0.022084871,0.2787917,0.0012227903,0.00026107012],"about_ca_topic_score_codex":0.0000034750065,"about_ca_topic_score_gemma":6.827626e-7,"teacher_disagreement_score":0.607466,"about_ca_system_score_codex":0.00021758792,"about_ca_system_score_gemma":0.0004507694,"threshold_uncertainty_score":0.7953471},"labels":[],"label_agreement":null},{"id":"W3153914952","doi":"10.1002/jgt.22906","title":"Triangle‐free graphs with large chromatic number and no induced wheel","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Windmill graph; Wheel graph; Vertex (graph theory); Graph; Petersen graph; Discrete mathematics; Line graph; Graph power","score_opus":0.012954920009154278,"score_gpt":0.26245799401051345,"score_spread":0.24950307400135918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153914952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91566724,0.0010958795,0.07414457,0.0006732773,0.0007104509,0.00041687957,0.000018420455,0.000089327856,0.0071839825],"genre_scores_gemma":[0.98977923,0.00005112324,0.009451052,0.00036286464,0.000055734203,0.000019237108,5.3933496e-7,0.000028130538,0.0002520899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674106,0.0010525681,0.00047688928,0.00027751256,0.0009919455,0.00046004387],"domain_scores_gemma":[0.99764377,0.0006242393,0.0004975893,0.00074540364,0.00025175427,0.00023722423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044048657,0.00020248836,0.000418503,0.00062521157,0.0004968252,0.00011326714,0.0018174258,0.00004299007,0.0002179086],"category_scores_gemma":[0.00026882894,0.00015353052,0.00019621689,0.0013097434,0.00016666221,0.0008245018,0.0007270905,0.00083951856,0.0000098930805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088630687,0.0003505774,0.0018548818,0.0000404007,0.00026161052,0.00037450003,0.0015700819,0.00002457668,0.0034930455,0.98465663,0.0017108702,0.004776533],"study_design_scores_gemma":[0.003465052,0.0012991746,0.0016408872,0.000049604278,0.000030470774,0.0017155549,0.0006015802,0.00015971306,0.00043088183,0.98873794,0.0016136047,0.000255558],"about_ca_topic_score_codex":0.0000014425784,"about_ca_topic_score_gemma":0.00000195927,"teacher_disagreement_score":0.07411202,"about_ca_system_score_codex":0.000054217347,"about_ca_system_score_gemma":0.0001480373,"threshold_uncertainty_score":0.62607926},"labels":[],"label_agreement":null},{"id":"W3155570673","doi":"10.1145/3508069","title":"QCSP on Reflexive Tournaments","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; European Commission","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Tournament; Constraint satisfaction problem; Reflexivity; Discrete mathematics; Graph; Statistics","score_opus":0.05988162739378244,"score_gpt":0.34701124063691474,"score_spread":0.2871296132431323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155570673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038063321,0.000019212435,0.988611,0.0047472822,0.00039706734,0.00021528912,0.00003535861,0.00018730697,0.001981142],"genre_scores_gemma":[0.90334487,0.0000038231497,0.09323709,0.0025292153,0.000021041562,0.00013125835,0.000013873286,0.000012361146,0.0007064992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792874,0.00026971177,0.00019914686,0.00045626517,0.00086565234,0.000280464],"domain_scores_gemma":[0.9984458,0.0007245285,0.00006701723,0.00057684944,0.000086701744,0.00009910756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031040868,0.00014104866,0.0001209114,0.00035593248,0.0009939062,0.00006517825,0.0013633008,0.000025340105,0.0005008598],"category_scores_gemma":[0.000028763938,0.00014236911,0.00010678523,0.00078638096,0.000058510144,0.00022486065,0.000067189176,0.000525559,0.00022434411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065755965,0.00030491006,0.0000059041795,0.0000017958491,0.000025476142,0.000029112221,0.0001255837,0.7933474,0.000034358953,0.16657975,0.00016347773,0.039316468],"study_design_scores_gemma":[0.000598492,0.0010347534,0.0005685734,0.0000058390146,0.0000038952094,0.00005646385,0.00007326092,0.049065217,0.00017472693,0.94523954,0.0029718021,0.00020740164],"about_ca_topic_score_codex":0.0000030390136,"about_ca_topic_score_gemma":8.3064964e-7,"teacher_disagreement_score":0.8995385,"about_ca_system_score_codex":0.00024421365,"about_ca_system_score_gemma":0.000087233995,"threshold_uncertainty_score":0.7644423},"labels":[],"label_agreement":null},{"id":"W3156797889","doi":"10.1016/j.disc.2022.113079","title":"Irredundance trees of diameter 3","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Cardinality (data modeling); Discrete mathematics; Computer science","score_opus":0.02566232620976708,"score_gpt":0.29545894767569775,"score_spread":0.26979662146593064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156797889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04981197,0.0001669718,0.9428415,0.00030829714,0.00013182555,0.00022657025,0.000026351472,0.000101006895,0.0063855476],"genre_scores_gemma":[0.78452855,0.0000053499125,0.21433,0.000051682222,0.000010692849,0.00006499944,0.0000023855382,0.000015875732,0.0009904285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987221,0.00008514115,0.00025058704,0.00020483366,0.00050873373,0.00022860969],"domain_scores_gemma":[0.9987581,0.00023961136,0.00013343885,0.00077898946,0.00003899337,0.000050867562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044425583,0.00009521938,0.00018326036,0.00011645238,0.00015985903,0.00003240663,0.0012704767,0.000012888843,0.00010858963],"category_scores_gemma":[0.000086074375,0.00008501685,0.000090787034,0.0005174355,0.00009885742,0.0001901879,0.0008552222,0.00014849364,0.000014289333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068165173,0.00014692674,0.00018452665,0.00007570915,0.000026167161,0.000011006494,0.0042163124,0.0007509841,0.004719377,0.98424375,0.00031346185,0.0053049363],"study_design_scores_gemma":[0.00035281698,0.00025871306,0.00025085994,0.000026373895,0.000007890855,0.00003368275,0.0012158992,0.08004764,0.010427288,0.9038745,0.0032121667,0.00029212513],"about_ca_topic_score_codex":0.0000015583051,"about_ca_topic_score_gemma":0.0000010394839,"teacher_disagreement_score":0.7347166,"about_ca_system_score_codex":0.000027386755,"about_ca_system_score_gemma":0.000029194129,"threshold_uncertainty_score":0.34668866},"labels":[],"label_agreement":null},{"id":"W3157297330","doi":"10.1016/j.jctb.2024.03.001","title":"Typical structure of hereditary properties of binary matroids","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Matroid; Mathematics; Binary number; Graph; Combinatorics; Graphic matroid; Discrete mathematics; Arithmetic","score_opus":0.012493392506069081,"score_gpt":0.258757780643422,"score_spread":0.2462643881373529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157297330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97669166,0.007064924,0.006095807,0.0004160193,0.009264687,0.00015410631,0.000012858298,0.00005017687,0.00024974326],"genre_scores_gemma":[0.99658674,0.0000710304,0.0027539788,0.000010031515,0.00044105866,8.113148e-7,3.5716943e-7,0.000017749677,0.00011825814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783695,0.0004077336,0.0006880321,0.00016678245,0.0006726432,0.00022786843],"domain_scores_gemma":[0.99848366,0.00027261407,0.0002760432,0.0003908717,0.00047272712,0.00010411514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009975747,0.00016245856,0.00046269307,0.00034239516,0.000054890475,0.00005955316,0.0011976992,0.00010764391,0.000053795786],"category_scores_gemma":[0.0002785655,0.00011457027,0.00022609043,0.0006183001,0.00046928425,0.001293546,0.0003085803,0.0005009009,0.0000019515699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016074217,0.00007105275,0.000027597209,0.00022948839,0.0001231595,0.00010875785,0.00069878367,0.00006605195,0.14715807,0.84811234,0.00026907676,0.0015282214],"study_design_scores_gemma":[0.00039142053,0.0013529973,0.000086244414,0.00031008045,0.000018636722,0.00030043325,0.00023986814,0.00009114249,0.16608004,0.82977265,0.0012491688,0.000107310865],"about_ca_topic_score_codex":8.250372e-7,"about_ca_topic_score_gemma":1.3868505e-7,"teacher_disagreement_score":0.019895047,"about_ca_system_score_codex":0.000043921133,"about_ca_system_score_gemma":0.0003262505,"threshold_uncertainty_score":0.46720397},"labels":[],"label_agreement":null},{"id":"W3157628167","doi":"10.46298/dmtcs.7437","title":"On the Boolean dimension of a graph and other related parameters","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Université de Lyon; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Université Claude Bernard Lyon 1; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph; Dimension (graph theory); Two-element Boolean algebra; Boolean expression; Boolean algebras canonically defined; Boolean function; Algebra over a field; Pure mathematics","score_opus":0.017964657912783323,"score_gpt":0.2741195652994549,"score_spread":0.25615490738667157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157628167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24993506,0.000030214518,0.7458303,0.0012757708,0.00015231485,0.00042556695,0.0000066672724,0.000087855835,0.002256254],"genre_scores_gemma":[0.90928525,0.0000018278772,0.090121426,0.0005340631,0.0000040799578,0.00002749533,2.9446775e-7,0.000014458737,0.000011134967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679524,0.00036222689,0.00039099657,0.00062327227,0.00132619,0.0005020835],"domain_scores_gemma":[0.9965579,0.0017213882,0.00017132897,0.0012988405,0.00008398039,0.00016656815],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035720433,0.00020222265,0.00025830386,0.0002888877,0.0008770905,0.00017602392,0.0026856582,0.000027429753,0.000074271455],"category_scores_gemma":[0.00025039655,0.00012902165,0.00010144933,0.001707781,0.004202985,0.0002083565,0.0025898647,0.00042202248,0.000009426863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120719305,0.00007773899,0.000011556784,0.000011024054,0.0000103743005,0.000005465068,0.0021857778,0.00061727344,0.0007679205,0.99513805,0.000020887197,0.0011418342],"study_design_scores_gemma":[0.000118517164,0.0003111458,0.000015191665,0.000025367526,0.0000038570465,0.000030680414,0.000118316915,0.33801112,0.001257749,0.65998065,0.0000112135285,0.000116195704],"about_ca_topic_score_codex":0.0000013975883,"about_ca_topic_score_gemma":9.702389e-8,"teacher_disagreement_score":0.65935016,"about_ca_system_score_codex":0.000032244992,"about_ca_system_score_gemma":0.000049427388,"threshold_uncertainty_score":0.998507},"labels":[],"label_agreement":null},{"id":"W3159348138","doi":"10.46298/dmtcs.7458","title":"Separating layered treewidth and row treewidth","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Partial k-tree; Combinatorics; Mathematics; Tree-depth; 1-planar graph; Bounded function; Clique-sum; Tree decomposition; Pathwidth; Discrete mathematics; Graph; Chordal graph; Line graph","score_opus":0.019348290710912194,"score_gpt":0.29801633726400634,"score_spread":0.27866804655309413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159348138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029592365,0.00007993883,0.96157277,0.0009821446,0.00024329207,0.00039835286,0.000010220603,0.00026918802,0.006851702],"genre_scores_gemma":[0.6776737,0.0000034916745,0.32189396,0.00026564274,0.000038564103,0.000049670853,0.0000014740657,0.000018868705,0.00005462014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520683,0.00032515175,0.0005070316,0.0011503294,0.0017670733,0.0010435646],"domain_scores_gemma":[0.9969697,0.0007971253,0.00017471598,0.0014506188,0.00014922494,0.00045860378],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0034504952,0.00033522793,0.00041299048,0.00039015833,0.0019173827,0.0008056661,0.0039482974,0.000039681014,0.00014965606],"category_scores_gemma":[0.00021566222,0.0002879916,0.00011308837,0.002181513,0.0027362315,0.00088429527,0.0058315643,0.00055240234,0.000023846167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008780686,0.000089046574,0.000038283342,0.000022236904,0.000009696861,0.000029631648,0.0028313375,0.0005957239,0.0010716005,0.98589325,0.000038838698,0.009371583],"study_design_scores_gemma":[0.00022009927,0.00024179593,0.000042213545,0.000014156331,0.000003508432,0.00011200221,0.00016356689,0.53142244,0.0005570716,0.46686843,0.0001072732,0.00024744202],"about_ca_topic_score_codex":0.0000018422236,"about_ca_topic_score_gemma":7.046898e-7,"teacher_disagreement_score":0.64808136,"about_ca_system_score_codex":0.00010012912,"about_ca_system_score_gemma":0.0001553652,"threshold_uncertainty_score":0.99997777},"labels":[],"label_agreement":null},{"id":"W3159453235","doi":"10.1007/978-3-662-63170-6_4","title":"Algorithms for Generating Strongly Chordal Graphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Chordal graph; Interval graph; Split graph; Pathwidth; Indifference graph; Combinatorics; Treewidth; Computer science; Outerplanar graph; Mathematics; Graph; Discrete mathematics; 1-planar graph; Line graph","score_opus":0.03295453966932661,"score_gpt":0.30288861939613304,"score_spread":0.26993407972680644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159453235","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008194999,0.0010239834,0.9950669,0.00037342025,0.0018241871,0.0006798468,0.00001801912,0.00016614888,0.0007655555],"genre_scores_gemma":[0.004910566,0.00005689826,0.9929279,0.00055750395,0.0006544186,0.00005122087,0.00001634844,0.000059395185,0.0007657492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99455035,0.000064207685,0.0005851083,0.0023180651,0.0012937102,0.0011885341],"domain_scores_gemma":[0.9959862,0.0009999836,0.0002577501,0.0018338636,0.0006489691,0.00027320097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014781511,0.0006161492,0.0006419034,0.0010113883,0.0005528116,0.0009110195,0.0043735085,0.00032181508,0.000021024623],"category_scores_gemma":[0.00024423082,0.00059753796,0.00028672046,0.001021008,0.00084544823,0.0007743638,0.0019180146,0.0010428061,0.000011548276],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006090478,0.000023913844,0.00002081589,0.00004101261,0.000019299401,0.00009142033,0.00024560478,0.04828983,0.00073056325,0.21398866,0.000015843303,0.73652697],"study_design_scores_gemma":[0.0003171503,0.00020482841,0.000012836496,0.00017493386,0.000004955428,0.00006081511,2.298975e-7,0.6288813,0.0029150217,0.36565498,0.0011499806,0.00062300666],"about_ca_topic_score_codex":0.000008795587,"about_ca_topic_score_gemma":0.00005844755,"teacher_disagreement_score":0.7359039,"about_ca_system_score_codex":0.00028149356,"about_ca_system_score_gemma":0.00087612483,"threshold_uncertainty_score":0.9996476},"labels":[],"label_agreement":null},{"id":"W31595256","doi":"10.1016/j.pbj.0000000000000030","title":"Clique graphs of Helly circular arc graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Clique-sum; Combinatorics; Indifference graph; Mathematics; Split graph; Block graph; Cograph; Treewidth; Trapezoid graph; Interval graph; Pathwidth; Discrete mathematics; Clique graph; Clique problem; 1-planar graph; Graph; Line graph","score_opus":0.016661615856261584,"score_gpt":0.27487472912401456,"score_spread":0.258213113267753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31595256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9670735,0.00069278356,0.023181366,0.0004446104,0.0013578224,0.00042565606,0.0000034572429,0.0002895584,0.006531275],"genre_scores_gemma":[0.996655,0.00018291696,0.0028460629,0.00012099806,0.0000033399003,0.000026051805,0.0000028161842,0.000022120006,0.00014073083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976726,0.00024544963,0.00036754165,0.00052784465,0.0006205403,0.0005660356],"domain_scores_gemma":[0.99782187,0.00022782867,0.00014373596,0.0013150742,0.00027377985,0.00021772356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007780805,0.00020810816,0.00031108852,0.00041445252,0.00014069874,0.000056769197,0.0017878674,0.00011131842,0.00002682257],"category_scores_gemma":[0.00012256284,0.00021114587,0.00020166181,0.001979772,0.00024737703,0.0005182594,0.00037753378,0.00032918018,0.000053087922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018093224,0.000159225,0.008470819,0.000019490748,0.000032986452,0.00007657882,0.00017954528,0.000020587004,0.0033045395,0.9848485,0.00019331116,0.002676318],"study_design_scores_gemma":[0.0006796885,0.0001969929,0.0039071986,0.000025210495,0.0000047091244,0.00003534147,0.000019774394,0.0005726935,0.008045267,0.98496395,0.0013283237,0.00022084589],"about_ca_topic_score_codex":0.000025393649,"about_ca_topic_score_gemma":0.0000028643558,"teacher_disagreement_score":0.02958149,"about_ca_system_score_codex":0.000036429075,"about_ca_system_score_gemma":0.00008674965,"threshold_uncertainty_score":0.8610279},"labels":[],"label_agreement":null},{"id":"W3159778435","doi":"10.1016/j.ic.2022.104954","title":"Beyond PCSP(1-in-3,NAE)","year":2022,"lang":"en","type":"preprint","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Horizon 2020; European Research Council; Natural Sciences and Engineering Research Council of Canada; European Commission; Royal Society","keywords":"Constraint satisfaction problem; Tuple; Backtracking; Constraint satisfaction; Template; Combinatorics; Mathematics; Constraint (computer-aided design); Computer science; Boolean function; Relaxation (psychology); Discrete mathematics; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.019636919936389,"score_gpt":0.3090241625789866,"score_spread":0.28938724264259763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159778435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025767842,0.00015310521,0.9600124,0.00073844823,0.00057652325,0.00046473098,0.000011531617,0.00017687296,0.012098598],"genre_scores_gemma":[0.9586927,0.00012567584,0.0397212,0.0008786339,0.000032056585,0.00015775822,0.00029594335,0.000009166708,0.00008686525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998673,0.000114680486,0.00040116912,0.00021240613,0.00041442143,0.0001842798],"domain_scores_gemma":[0.9992657,0.00009513508,0.0002093932,0.00027140017,0.00009786046,0.000060541133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053536607,0.00013857693,0.0001524931,0.0005892758,0.00013066905,0.00034595054,0.00047856025,0.000082953346,0.000027411968],"category_scores_gemma":[0.000035219568,0.00015443741,0.000039591047,0.00039846858,0.00003339781,0.001516104,0.001347553,0.0005164007,0.000031317228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018328134,0.000028974768,0.00048335895,0.00015984035,0.000011267091,0.0000055051914,0.0051773717,0.18274596,0.0000034785323,0.29545897,0.00039741976,0.51550955],"study_design_scores_gemma":[0.00037079805,0.000041264015,0.0053319745,0.000020656968,0.0000015433804,0.000008093246,0.00020523461,0.6136641,0.0000139520325,0.3758167,0.004318576,0.00020708477],"about_ca_topic_score_codex":0.000023508026,"about_ca_topic_score_gemma":0.0000041069366,"teacher_disagreement_score":0.93292487,"about_ca_system_score_codex":0.00010850201,"about_ca_system_score_gemma":0.00012015314,"threshold_uncertainty_score":0.62977743},"labels":[],"label_agreement":null},{"id":"W3160192199","doi":"10.7151/dmgt.2494","title":"An analogue of quasi-transitivity for edge-coloured graphs","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Mathematics; Combinatorics; Transitive relation; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.02918938736880279,"score_gpt":0.3245934464297203,"score_spread":0.29540405906091755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160192199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11697406,0.00006565224,0.88012123,0.000549193,0.000210498,0.00096812187,0.00008605529,0.0006262369,0.00039894335],"genre_scores_gemma":[0.9721767,0.000027725931,0.027086796,0.000051698717,0.000025457959,0.00032646608,0.000041526946,0.00005046588,0.00021318531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967275,0.000709246,0.0005725732,0.00070039846,0.00058546144,0.00070480845],"domain_scores_gemma":[0.995921,0.0017081725,0.00022412084,0.0016577822,0.00022392182,0.00026497807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003971965,0.00031844497,0.000593085,0.0009402556,0.00035989727,0.0000730493,0.0017823913,0.00013632195,0.000029687611],"category_scores_gemma":[0.00043462115,0.00021528946,0.00045168833,0.002639021,0.0005063049,0.0007365536,0.00021709006,0.00019816434,0.0000448018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112839945,0.00050010154,0.00008020983,0.00027687754,0.00006708948,0.000009069646,0.0034509606,0.000050433166,0.011324999,0.9736475,0.00014190335,0.01033803],"study_design_scores_gemma":[0.0005234551,0.00033541667,0.001248492,0.000109955094,0.00002471858,0.000007760846,0.0011913318,0.007538959,0.006913561,0.9817556,0.000045206507,0.00030555652],"about_ca_topic_score_codex":0.0000014289393,"about_ca_topic_score_gemma":0.00000526566,"teacher_disagreement_score":0.8552026,"about_ca_system_score_codex":0.000013993798,"about_ca_system_score_gemma":0.00006253025,"threshold_uncertainty_score":0.8779249},"labels":[],"label_agreement":null},{"id":"W3160395046","doi":"10.1016/j.disc.2021.112441","title":"Reconfiguration of homomorphisms to reflexive digraph cycles","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Algebraic number; Discrete mathematics; Graph; Path (computing); Computer science","score_opus":0.03565127811538304,"score_gpt":0.3294347344413274,"score_spread":0.2937834563259444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160395046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05351469,0.000087033004,0.93312114,0.00072591123,0.000089491936,0.00020739205,0.000015545711,0.00008022188,0.012158599],"genre_scores_gemma":[0.56607765,0.00002534889,0.4330427,0.00010988333,0.00002212115,0.000028375382,0.000009528576,0.000017675531,0.0006667083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987236,0.000073099895,0.00033289785,0.00027902512,0.00036031232,0.00023106507],"domain_scores_gemma":[0.99845344,0.00021546723,0.00011903692,0.0008579182,0.0002451853,0.00010895534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031775018,0.00011679595,0.00022662595,0.00013371764,0.00008207598,0.00007777051,0.00059468334,0.000041958832,0.00004016456],"category_scores_gemma":[0.00029204824,0.00010508893,0.00009230987,0.00077303126,0.000067122885,0.00026570918,0.00023324885,0.00009505201,0.000058342925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045229403,0.000060850016,0.00002489008,0.00007287272,0.000021695527,0.000019095112,0.0026494404,0.000091305636,0.02183014,0.9694547,0.00010613263,0.005664353],"study_design_scores_gemma":[0.00016610339,0.00009396997,0.00022048905,0.00012148858,0.0000075497314,0.000027049691,0.0007628066,0.0053633493,0.2260255,0.76662385,0.00038614214,0.00020169411],"about_ca_topic_score_codex":0.0000015261049,"about_ca_topic_score_gemma":0.0000054255584,"teacher_disagreement_score":0.51256293,"about_ca_system_score_codex":0.000018817747,"about_ca_system_score_gemma":0.00005436127,"threshold_uncertainty_score":0.42854023},"labels":[],"label_agreement":null},{"id":"W3161061639","doi":"","title":"Price of Connectivity for the vertex cover problem and the dominating set problem: Conjectures and investigation of critical graphs","year":2017,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vertex cover; Combinatorics; Mathematics; Dominating set; Bipartite graph; Vertex (graph theory); Bounded function; Discrete mathematics; Maximal independent set; Feedback vertex set; Edge cover; Connected component; Chordal graph; Graph; 1-planar graph","score_opus":0.01896815255539841,"score_gpt":0.2868417533792701,"score_spread":0.2678736008238717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161061639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68762493,0.0006117135,0.30284882,0.00708848,0.00007469739,0.0012884774,0.000019863954,0.000023052087,0.00041995704],"genre_scores_gemma":[0.9757875,0.00003425688,0.023970895,0.000106953004,0.000010222045,0.00006532229,5.1252084e-7,0.0000061408305,0.000018198254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989952,0.00021398562,0.00017492368,0.0002349045,0.00019928832,0.00018173784],"domain_scores_gemma":[0.99455243,0.004587837,0.00018734904,0.00043783418,0.00018706247,0.000047467576],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015427157,0.00009916221,0.00019246004,0.000048421556,0.00080629747,0.00013370521,0.00054277224,0.00006200999,8.3291644e-7],"category_scores_gemma":[0.0016849709,0.00005742011,0.000046034937,0.00009485252,0.003939321,0.00035817944,0.00020231963,0.0001896204,9.291425e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008763708,0.000008767773,0.0021370654,0.00017543066,0.000027068338,5.625161e-7,0.005082358,0.000015980844,0.0018084086,0.9857447,0.000043376873,0.004868641],"study_design_scores_gemma":[0.0012313081,0.00010297985,0.0087530445,0.00003707438,0.000018570938,0.000013519918,0.00018893082,0.013333751,0.005825638,0.97036785,0.00004437148,0.00008294941],"about_ca_topic_score_codex":0.000053914355,"about_ca_topic_score_gemma":0.000012751562,"teacher_disagreement_score":0.28816256,"about_ca_system_score_codex":0.000011677271,"about_ca_system_score_gemma":0.000039340826,"threshold_uncertainty_score":0.99877137},"labels":[],"label_agreement":null},{"id":"W3163332497","doi":"10.1007/978-3-030-86838-3_30","title":"On 3-Coloring of $$(2P_4,C_5)$$-Free Graphs","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Grantová Agentura, Univerzita Karlova; Grantová Agentura České Republiky; European Commission; Univerzita Karlova v Praze","keywords":"Combinatorics; Mathematics; Graph coloring; Graph; Class (philosophy); Discrete mathematics; Time complexity; Computer science; Artificial intelligence","score_opus":0.02491208453577773,"score_gpt":0.30208095628936305,"score_spread":0.2771688717535853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163332497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12449667,0.000363839,0.87153405,0.0005840893,0.0023609707,0.00041931588,0.0000051841366,0.00014293997,0.000092947696],"genre_scores_gemma":[0.62053585,0.000028024348,0.37902808,0.0002969917,0.000065550084,0.000026652087,0.0000018755554,0.00001600646,9.796169e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99369204,0.00029437713,0.0006606597,0.0023727447,0.0019096168,0.0010705759],"domain_scores_gemma":[0.9924205,0.0015498201,0.00034333082,0.0049014445,0.0005495158,0.00023536631],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020798934,0.000527354,0.00073655084,0.0016954298,0.0002309194,0.0006343971,0.011603005,0.00030547564,0.000010881067],"category_scores_gemma":[0.0013003973,0.0004996822,0.00025960797,0.004831138,0.0011297965,0.00064901076,0.01397708,0.0018761716,0.0000056218587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002745114,0.0002413404,0.0008705984,0.00020504088,0.000025775393,0.00020849732,0.0023515595,0.62359065,0.0033707612,0.047636885,0.000008270341,0.3214632],"study_design_scores_gemma":[0.00032343384,0.00019661877,0.0013817762,0.0005521656,0.0000030796882,0.000021022714,0.0000011029712,0.30933416,0.052198824,0.63552827,0.00000440614,0.00045512943],"about_ca_topic_score_codex":0.00006504084,"about_ca_topic_score_gemma":0.000074012925,"teacher_disagreement_score":0.5878914,"about_ca_system_score_codex":0.00027085622,"about_ca_system_score_gemma":0.0011109919,"threshold_uncertainty_score":0.9997455},"labels":[],"label_agreement":null},{"id":"W3163840932","doi":"10.48550/arxiv.2105.04611","title":"Lower Boundary Independent Broadcasts in Trees","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Boundary (topology); Graph; Upper and lower bounds; Prime (order theory); Physics; Mathematical analysis","score_opus":0.061392257983663566,"score_gpt":0.22171630801829792,"score_spread":0.16032405003463435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163840932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65563154,0.00029714464,0.34025702,0.00008096901,0.0006886681,0.0002734557,0.0000067828205,0.00015543365,0.0026089775],"genre_scores_gemma":[0.99579495,0.00025779995,0.0016574721,0.000074254756,0.000041893727,0.0000019137876,0.000011775274,0.000023295543,0.002136651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968758,0.00037972353,0.00024313416,0.001640684,0.00023566585,0.00062497926],"domain_scores_gemma":[0.99732494,0.00015824503,0.0001508865,0.0019514723,0.00018661836,0.00022784698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046499263,0.00035349317,0.00041538605,0.0006795254,0.00013186407,0.00031506174,0.0029638393,0.00034323536,0.00009555878],"category_scores_gemma":[0.00006500612,0.00043603868,0.00025298682,0.0013640891,0.00022028158,0.0007688739,0.0056601977,0.001397959,0.0000780828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030772205,0.001256211,0.034834072,0.00024287954,0.00029751786,0.031663757,0.0020056416,0.4703029,0.0006751794,0.44471762,0.0002693356,0.013427149],"study_design_scores_gemma":[0.0031228755,0.00027923347,0.04309981,0.0007725011,0.00005334413,0.000077218916,0.00084049173,0.37845376,0.0012688847,0.56659085,0.002848954,0.002592108],"about_ca_topic_score_codex":0.0001435607,"about_ca_topic_score_gemma":0.0005818545,"teacher_disagreement_score":0.34016338,"about_ca_system_score_codex":0.00044173546,"about_ca_system_score_gemma":0.0005845434,"threshold_uncertainty_score":0.99980915},"labels":[],"label_agreement":null},{"id":"W3165244533","doi":"10.1002/jgt.22685","title":"The list linear arboricity of graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Foundation of Korea; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Arboricity; Mathematics; Combinatorics; Conjecture; Degeneracy (biology); Dense graph; Graph; Discrete mathematics; Pathwidth; Planar graph; Line graph; Biology","score_opus":0.01652637430472045,"score_gpt":0.2920695333689219,"score_spread":0.27554315906420146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165244533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23510496,0.014458458,0.74105185,0.0023897043,0.0018827375,0.00017160998,0.0000070606898,0.000050559738,0.004883064],"genre_scores_gemma":[0.97976553,0.0018626595,0.017653784,0.00018133725,0.00011432683,0.0000020975635,2.5895585e-7,0.000016156811,0.00040387333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974101,0.0008168849,0.00059480243,0.00017483465,0.0006904421,0.00031289505],"domain_scores_gemma":[0.9955105,0.002068804,0.0005285279,0.0007482575,0.0009982615,0.00014561694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037197468,0.000128509,0.0002873016,0.00027449016,0.00025105022,0.00007258436,0.0016997894,0.000055811444,0.000019142464],"category_scores_gemma":[0.0010900297,0.000082554885,0.00041993317,0.0014982425,0.0004479785,0.00041389233,0.00027809266,0.0005188414,0.0000032115104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010929312,0.00010126996,0.00052994274,0.000013865539,0.000104581115,0.00011531821,0.00023040539,0.000067110384,0.0065694535,0.98052514,0.00028474163,0.01134888],"study_design_scores_gemma":[0.000339165,0.00017218453,0.0011067679,0.00004842176,0.00001367091,0.00020298208,0.0001996631,0.00011679087,0.03043209,0.96442276,0.0028516464,0.000093843526],"about_ca_topic_score_codex":0.0000011506112,"about_ca_topic_score_gemma":0.0000050306917,"teacher_disagreement_score":0.74466056,"about_ca_system_score_codex":0.00002086135,"about_ca_system_score_gemma":0.00026976902,"threshold_uncertainty_score":0.33664903},"labels":[],"label_agreement":null},{"id":"W3170248899","doi":"10.1145/3519935.3520075","title":"Complexity classification of counting graph homomorphisms modulo a prime number","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Modulo; Conjecture; Counting problem; Mathematics; Prime (order theory); Combinatorics; Discrete mathematics; Constraint satisfaction problem; Graph homomorphism; Graph; Prime number; Computer science; Line graph; Voltage graph; Statistics","score_opus":0.09513486052490078,"score_gpt":0.3465210272567365,"score_spread":0.2513861667318357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170248899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046382736,0.00007782952,0.9227673,0.00044294086,0.0005148202,0.00073842873,0.000055671233,0.00036156664,0.028658709],"genre_scores_gemma":[0.84810674,0.000030149777,0.15065114,0.00006246485,0.000036540783,0.00017566506,0.00007209476,0.00002908499,0.0008361172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963656,0.00041185235,0.00060033094,0.0010282715,0.0011461563,0.00044779375],"domain_scores_gemma":[0.9963625,0.00023657457,0.0005459332,0.0023511744,0.00039006956,0.00011374323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014245169,0.00029367954,0.00048174468,0.0003235979,0.00024319677,0.00013558293,0.003357575,0.00015600966,0.00082919555],"category_scores_gemma":[0.000096076255,0.000304038,0.00025347705,0.0009308691,0.00041364168,0.00030400068,0.0054963497,0.0011098867,0.00004666142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015401989,0.00016692985,0.0025379432,0.000110868576,0.000053775933,0.00000644334,0.00025250437,0.00073581765,0.0014446118,0.99086356,0.0002450698,0.0035670544],"study_design_scores_gemma":[0.00023901544,0.000036803554,0.014201878,0.000039433155,0.000009631261,0.000012284034,0.000089506175,0.080433175,0.001689084,0.90205956,0.00078241655,0.00040719443],"about_ca_topic_score_codex":0.00015435604,"about_ca_topic_score_gemma":0.000013704173,"teacher_disagreement_score":0.801724,"about_ca_system_score_codex":0.00016667189,"about_ca_system_score_gemma":0.0002706062,"threshold_uncertainty_score":0.9999412},"labels":[],"label_agreement":null},{"id":"W3171062666","doi":"10.1016/j.tcs.2022.11.020","title":"Colouring graphs with no induced six-vertex path or diamond","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Tianjin City; Nankai University; KU Leuven; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Diamond; Perfect graph; Vertex (graph theory); Perfect graph theorem; Discrete mathematics; Graph; Line graph; Pathwidth; Chemistry","score_opus":0.01722655445675764,"score_gpt":0.27155464520713374,"score_spread":0.2543280907503761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171062666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31206688,0.000019016332,0.6822845,0.0005115857,0.00071778,0.00048259855,0.000004841234,0.00039714196,0.0035156612],"genre_scores_gemma":[0.9131063,0.0000022720765,0.08615375,0.0005485926,0.000040161263,0.0000733603,7.574934e-7,0.000019841085,0.000054936692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947259,0.0004095895,0.00030414938,0.001283111,0.002072853,0.0012044115],"domain_scores_gemma":[0.9969262,0.0006884448,0.00010273838,0.001480779,0.00029814395,0.0005037302],"candidate_categories":["sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0024893624,0.0002921355,0.0003089166,0.00047305407,0.001844874,0.00047154952,0.0058445456,0.00003697693,0.00026564617],"category_scores_gemma":[0.00014921947,0.00021027001,0.00007637914,0.0044451947,0.0028565656,0.0009900132,0.0048510144,0.0007352374,0.00007967327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014289406,0.00012894686,0.00022157347,0.0000073906317,0.0000078961075,0.00015195369,0.00047082274,0.00042031906,0.0019239916,0.9840581,0.000044472457,0.012421667],"study_design_scores_gemma":[0.0012969733,0.0049174074,0.0021475768,0.00004808035,0.000008494659,0.00045284734,0.00006982514,0.47076768,0.00547138,0.51328766,0.00058665255,0.00094543485],"about_ca_topic_score_codex":0.00000428712,"about_ca_topic_score_gemma":0.0000019574436,"teacher_disagreement_score":0.6010394,"about_ca_system_score_codex":0.0001701707,"about_ca_system_score_gemma":0.0004356294,"threshold_uncertainty_score":0.99985707},"labels":[],"label_agreement":null},{"id":"W3172200572","doi":"10.1109/iccsmt51754.2020.00008","title":"On Star Coloring of Mycielski's Graphs for Special Graphs","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Combinatorics; Vertex (graph theory); Simple graph; Graph; Star (game theory); Mathematics; Computer science; Discrete mathematics","score_opus":0.04483796058432124,"score_gpt":0.3003046990643692,"score_spread":0.255466738480048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172200572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15697692,0.00003953916,0.8166375,0.002227835,0.0004924334,0.0009263385,0.000020685502,0.00026195994,0.022416769],"genre_scores_gemma":[0.9245947,0.000013881379,0.07410373,0.00085543585,0.00016238375,0.000039342915,0.0000016982242,0.000016572247,0.00021224457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986876,0.000043724725,0.00020634526,0.00038414198,0.00035488833,0.00032328043],"domain_scores_gemma":[0.9988926,0.00042181974,0.00006069365,0.0003489989,0.00011525949,0.0001606456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002444729,0.000115445415,0.00018834828,0.00015500224,0.000090568676,0.000037112495,0.0009569882,0.000038150512,0.000068056695],"category_scores_gemma":[0.00017762189,0.000101942926,0.00014356228,0.0008297276,0.00009367433,0.00026844276,0.00020264738,0.0001256741,0.000020295487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116738076,0.00003624273,0.00007803171,0.000021671653,0.000014319113,0.0000037577288,0.00029725884,0.000109944674,0.0026474844,0.99037147,0.0015816136,0.0047214543],"study_design_scores_gemma":[0.0008642808,0.0013576954,0.0002941686,0.000012781793,0.0000034182704,0.0000010311522,0.00008445332,0.008411507,0.047697857,0.93597984,0.005086695,0.00020625665],"about_ca_topic_score_codex":0.0000025593847,"about_ca_topic_score_gemma":0.0000037050982,"teacher_disagreement_score":0.76761776,"about_ca_system_score_codex":0.000012705881,"about_ca_system_score_gemma":0.00004050452,"threshold_uncertainty_score":0.41571116},"labels":[],"label_agreement":null},{"id":"W3175012788","doi":"","title":"Massively winning configurations in the convex grabbing game on the plane","year":2021,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convex hull; Combinatorics; Regular polygon; Convex body; Cutting-plane method; Mathematics; Point (geometry); Set (abstract data type); Hull; Plane (geometry); Convex combination; Discrete mathematics; Computer science; Mathematical optimization; Convex optimization; Geometry; Engineering; Integer programming","score_opus":0.05902740392706114,"score_gpt":0.28885181292854883,"score_spread":0.2298244090014877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175012788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20867077,0.0002645581,0.47489613,0.21045339,0.0009959945,0.0013555769,0.00023350384,0.0001662773,0.10296378],"genre_scores_gemma":[0.9900699,0.000004914068,0.001028022,0.008510801,0.000045084675,0.00003979026,0.000054571796,0.000008855374,0.00023803016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978565,0.00039482868,0.0002351212,0.00043761038,0.0006031607,0.0004727655],"domain_scores_gemma":[0.9966395,0.002246019,0.00007263165,0.00050539256,0.00033386904,0.00020259997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060537376,0.00016638415,0.00015292218,0.00051176595,0.00041512033,0.00047846552,0.0011678003,0.000062074934,0.00026784607],"category_scores_gemma":[0.0004967102,0.00012265013,0.00005261499,0.001750761,0.00017160267,0.00019435339,0.000059051603,0.00059287203,0.00019919277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003634004,0.000020046034,0.00025348744,0.0000030888436,0.000011552497,0.0002016968,0.0005216834,0.014221408,0.00005089877,0.9804083,0.00068572134,0.0036184692],"study_design_scores_gemma":[0.000813774,0.00021362606,0.066521406,0.00019219324,0.000006289449,0.00017926612,0.0027827295,0.23472592,0.00041935957,0.68166584,0.011840884,0.00063872687],"about_ca_topic_score_codex":0.00066125655,"about_ca_topic_score_gemma":0.003757378,"teacher_disagreement_score":0.7813992,"about_ca_system_score_codex":0.00015470241,"about_ca_system_score_gemma":0.001614381,"threshold_uncertainty_score":0.50015277},"labels":[],"label_agreement":null},{"id":"W317728043","doi":"10.1016/j.disc.2015.03.021","title":"Every 3-colorable graph has a faithful representation in the odd-distance graph","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital; Simon Fraser University","funders":"Vietnam Institute for Advanced Study in Mathematics","keywords":"Mathematics; Combinatorics; Graph; Wheel graph; Discrete mathematics; Faithful representation; Enhanced Data Rates for GSM Evolution; Plane (geometry); Geometric graph theory; Graph power; Line graph; Computer science; Geometry; Artificial intelligence","score_opus":0.08234569812872485,"score_gpt":0.33084921438935466,"score_spread":0.24850351626062983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W317728043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043735087,0.00029229766,0.944111,0.0017782198,0.00014883897,0.0007275717,0.0000071866234,0.0001455105,0.009054327],"genre_scores_gemma":[0.9173206,0.000029145594,0.08164262,0.00025734818,0.00003902195,0.00019972106,0.000009896389,0.000028580147,0.00047303055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974607,0.00030132642,0.00042489468,0.00042612763,0.0009020322,0.0004849023],"domain_scores_gemma":[0.99769396,0.00048637958,0.00017349307,0.0013705634,0.00015106869,0.00012456621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018130572,0.00020281841,0.00026095187,0.0002599053,0.00017646278,0.00042309012,0.0018160593,0.00006609967,0.000006407045],"category_scores_gemma":[0.00048130075,0.00014256104,0.00011038569,0.0020041526,0.00025953486,0.000891636,0.0002622887,0.0002991448,0.00006660639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037156286,0.00023594996,0.0010783663,0.00009218126,0.000027224462,0.000092236136,0.027733857,0.0014215237,0.0001494859,0.96470696,0.0034146437,0.0010104048],"study_design_scores_gemma":[0.00049410155,0.000083321625,0.00034343358,0.000055785138,0.00000646899,0.00003034921,0.0042956183,0.02941526,0.0004516986,0.96374273,0.0008589893,0.00022221777],"about_ca_topic_score_codex":0.000032172444,"about_ca_topic_score_gemma":0.00006966037,"teacher_disagreement_score":0.8735855,"about_ca_system_score_codex":0.000054900585,"about_ca_system_score_gemma":0.00009371825,"threshold_uncertainty_score":0.581347},"labels":[],"label_agreement":null},{"id":"W3179074173","doi":"10.1090/proc/16044","title":"Improved bounds for colouring circle graphs","year":2022,"lang":"en","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Omega; Combinatorics; Clique number; Bounding overwatch; Mathematics; Clique; Chromatic scale; Constant (computer programming); Graph; Function (biology); Discrete mathematics; Computer science; Physics","score_opus":0.020775671777796007,"score_gpt":0.3039574474717729,"score_spread":0.2831817756939769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179074173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64646447,0.00019509367,0.3374596,0.0058718603,0.00049994705,0.0048351176,0.00010493521,0.00067634066,0.0038926504],"genre_scores_gemma":[0.54787946,0.000058343605,0.4494606,0.0005414848,0.000075749515,0.0014387548,0.0000020608154,0.00008539208,0.00045815506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971472,0.000025144955,0.0005542149,0.0008105793,0.0007961678,0.0006666681],"domain_scores_gemma":[0.99707615,0.00052832154,0.001102766,0.0007151816,0.00043415755,0.00014340265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001559555,0.00032243936,0.0007816933,0.00006916219,0.00049056223,0.00024810596,0.0049508237,0.00009454617,0.000016883574],"category_scores_gemma":[0.00060303655,0.0002685108,0.0012686495,0.0009942575,0.0010700605,0.00021720046,0.007941027,0.0010312521,0.0000012846348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010473609,0.0006924861,0.00059248623,0.004814069,0.00073920103,3.6097978e-7,0.006992316,0.00010471786,0.031052874,0.940795,0.004194617,0.009917139],"study_design_scores_gemma":[0.00022657662,0.00018273572,0.00024978298,0.00009469366,0.000043636064,0.000004645077,0.00095046166,0.040267352,0.004167252,0.9532094,0.00027554823,0.00032789246],"about_ca_topic_score_codex":0.000009823447,"about_ca_topic_score_gemma":1.4221719e-7,"teacher_disagreement_score":0.11200102,"about_ca_system_score_codex":0.0002171422,"about_ca_system_score_gemma":0.00015262915,"threshold_uncertainty_score":0.9999767},"labels":[],"label_agreement":null},{"id":"W3180039493","doi":"10.1016/j.disc.2021.112708","title":"Recolouring weakly chordal graphs and the complement of triangle-free graphs","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Chordal graph; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Complement graph; Complement (music); Graph power; Line graph; Biology","score_opus":0.03833882838192034,"score_gpt":0.30540646669135735,"score_spread":0.267067638309437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180039493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20200324,0.004062885,0.7773231,0.0038215814,0.0010045765,0.0040222746,0.00018286424,0.00033219057,0.007247281],"genre_scores_gemma":[0.47424352,0.0011144697,0.5236494,0.0001127419,0.00004590555,0.00042058766,0.000041747375,0.00008721037,0.0002843775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964537,0.0004841521,0.0009695771,0.0006934527,0.0009002563,0.0004988557],"domain_scores_gemma":[0.9944837,0.0013268682,0.0006959159,0.003105996,0.00024978258,0.00013775004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026743615,0.00041419626,0.0010270309,0.00030066923,0.0002190938,0.0004013522,0.0034375086,0.00015346252,0.000030619318],"category_scores_gemma":[0.00072137016,0.00028908384,0.00047694548,0.0005635577,0.0006766317,0.00018025309,0.0074771084,0.0007956371,0.0000021189428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036058584,0.000090148314,0.00006228739,0.0009263693,0.00025898812,0.00001678409,0.0060384385,0.00011670099,0.00012363323,0.990029,0.0001321953,0.0021693974],"study_design_scores_gemma":[0.0014969232,0.000054192948,0.00012898119,0.0004920926,0.00006376841,0.000020487621,0.0012166656,0.022224959,0.0009916123,0.97292733,0.00006200718,0.00032098792],"about_ca_topic_score_codex":0.000026270554,"about_ca_topic_score_gemma":0.000039017687,"teacher_disagreement_score":0.27224028,"about_ca_system_score_codex":0.00003853158,"about_ca_system_score_gemma":0.00012785531,"threshold_uncertainty_score":0.99995613},"labels":[],"label_agreement":null},{"id":"W3181262263","doi":"","title":"18. Uncrossed Chords of Cycles in Chordal Graphs","year":2020,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Indifference graph; Interval graph; Pathwidth; Maximal independent set; Treewidth; Discrete mathematics; Graph; 1-planar graph; Line graph","score_opus":0.052886635506897595,"score_gpt":0.3239464415025009,"score_spread":0.2710598059956033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181262263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59503376,0.0006599057,0.37433815,0.0033307015,0.00011560067,0.0010958505,0.000028980172,0.00041545997,0.024981584],"genre_scores_gemma":[0.94284093,0.000010663732,0.05694324,0.00012142708,0.000010489636,0.000025806812,0.000001074506,0.000013724374,0.000032659354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819666,0.0001209743,0.00044540572,0.00039629248,0.00045607972,0.00038457836],"domain_scores_gemma":[0.9986498,0.00033989517,0.00009178317,0.00068359723,0.00006948172,0.00016545688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057612924,0.00015801202,0.00034443126,0.00017156795,0.000047000103,0.00004233808,0.0012774515,0.00005543264,0.00015391364],"category_scores_gemma":[0.00059444684,0.00014092661,0.00011106395,0.0011909149,0.00023870738,0.00032510306,0.0003831042,0.00020883825,0.00007415681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004815546,0.00022186554,0.0011444846,0.00035502214,0.000025878346,0.000026440543,0.005304584,0.00003744251,0.005891919,0.9780025,0.00040561482,0.00853612],"study_design_scores_gemma":[0.00071012194,0.00020614888,0.0028683548,0.00009532827,0.0000048063644,0.0000067110054,0.00036573803,0.040888276,0.009013656,0.9451866,0.00040727825,0.0002469869],"about_ca_topic_score_codex":0.000005127015,"about_ca_topic_score_gemma":0.0000025569366,"teacher_disagreement_score":0.34780714,"about_ca_system_score_codex":0.000018676315,"about_ca_system_score_gemma":0.000056524066,"threshold_uncertainty_score":0.57468206},"labels":[],"label_agreement":null},{"id":"W3181935061","doi":"10.1002/jgt.22956","title":"Adaptable and conflict colouring multigraphs with no cycles of length three or four","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigraph; Combinatorics; Integer (computer science); Mathematics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Graph; Artificial intelligence","score_opus":0.047709428510804466,"score_gpt":0.2921879343224165,"score_spread":0.24447850581161207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181935061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89616466,0.00092549284,0.10153453,0.00016959866,0.00020911967,0.00023244055,0.000005890036,0.000081865765,0.0006764109],"genre_scores_gemma":[0.9766656,0.0007029501,0.02221052,0.000043614204,0.000050553812,0.0000055179567,2.0713067e-7,0.000024402943,0.0002966419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806714,0.00024855076,0.00044803854,0.00023479758,0.00059615506,0.0004053096],"domain_scores_gemma":[0.99727744,0.001226665,0.00044431433,0.0004172162,0.00044125298,0.0001930924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002612514,0.00018028675,0.0004122178,0.0008891538,0.00016550484,0.000067539775,0.0009367769,0.000062677806,0.000018404106],"category_scores_gemma":[0.00028309834,0.00011698113,0.00013755722,0.0013235343,0.00041921143,0.00070279173,0.00022763119,0.00037644533,0.0000062387494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0070787584,0.0003599214,0.04207063,0.00037396603,0.0012141165,0.0016961196,0.0038648744,0.002595964,0.026780806,0.84405017,0.0007826913,0.06913201],"study_design_scores_gemma":[0.0069433725,0.005466376,0.08905209,0.0010554732,0.00011483295,0.0015668647,0.0019068908,0.008325829,0.015017418,0.86711764,0.002542779,0.00089042494],"about_ca_topic_score_codex":0.0000063365524,"about_ca_topic_score_gemma":0.000025731342,"teacher_disagreement_score":0.080500945,"about_ca_system_score_codex":0.00001411869,"about_ca_system_score_gemma":0.00012069574,"threshold_uncertainty_score":0.4770352},"labels":[],"label_agreement":null},{"id":"W3183008868","doi":"10.1007/s00373-021-02367-w","title":"Characterizing Bipartite Graphs Which Admit a k-NU Polymorphism via Absolute Retracts","year":2021,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Combinatorics; Unanimity; Homomorphism; Discrete mathematics; Graph","score_opus":0.017797393203278264,"score_gpt":0.2520450839134008,"score_spread":0.23424769071012252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183008868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9404018,0.0073135765,0.040616203,0.003555548,0.0019722865,0.00046372972,0.00001923254,0.00084056315,0.004817043],"genre_scores_gemma":[0.9954745,0.0011576986,0.0021643955,0.0004971481,0.000021764841,0.000033616714,0.000011098722,0.00003289104,0.0006068896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714965,0.00017602796,0.0003790101,0.0008482407,0.0006292252,0.0008178338],"domain_scores_gemma":[0.99770814,0.0001761607,0.00014969386,0.0010746337,0.00044410396,0.00044724144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005517244,0.00031130298,0.00036734674,0.0004002502,0.00051599246,0.00038168608,0.00081350363,0.00016973226,0.000021557742],"category_scores_gemma":[0.00012533633,0.00032122538,0.0001450754,0.0036623417,0.00011861262,0.00091160444,0.0006362738,0.0005602772,0.000031288055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015822214,0.00019063862,0.0023266915,0.000043653865,0.000056742112,0.0002519347,0.00040349428,0.0000014741606,0.015333102,0.97249794,0.00023701538,0.008641494],"study_design_scores_gemma":[0.00081327464,0.00019085033,0.018332107,0.00006359049,0.000017884031,0.00022153958,0.000039425395,0.0019035871,0.013182255,0.95863575,0.0060324054,0.0005673568],"about_ca_topic_score_codex":0.0000166217,"about_ca_topic_score_gemma":0.000008491081,"teacher_disagreement_score":0.05507268,"about_ca_system_score_codex":0.000035705096,"about_ca_system_score_gemma":0.00013335008,"threshold_uncertainty_score":0.999924},"labels":[],"label_agreement":null},{"id":"W3183334394","doi":"10.1016/j.dam.2023.05.031","title":"2-limited broadcast domination on grid graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Cartesian product; Upper and lower bounds; Grid; Combinatorics; Domination analysis; Path (computing); Duality (order theory); Product (mathematics); Chordal graph; Discrete mathematics; Graph; Computer science","score_opus":0.027219764993651266,"score_gpt":0.29709562731315275,"score_spread":0.2698758623195015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183334394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06887625,0.00002473432,0.85493,0.0010092327,0.00044520298,0.0013633393,0.0000325656,0.002129624,0.07118905],"genre_scores_gemma":[0.8021551,0.0001061187,0.19509508,0.00041093654,0.00014700115,0.0004990167,0.00011535386,0.00011874641,0.0013526916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804515,0.000030471938,0.00031362902,0.00044266164,0.00067213917,0.0004959793],"domain_scores_gemma":[0.99819744,0.0004739289,0.0001266657,0.0010111821,0.00006444341,0.00012633401],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202481,0.00021675993,0.00023392813,0.0004764916,0.00020467001,0.0001517818,0.0010347224,0.00007592715,0.000017705423],"category_scores_gemma":[0.00010469263,0.00018661983,0.00009346644,0.0019319281,0.00010207568,0.00020680846,0.00035377388,0.00022322893,0.0012257497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010848767,0.000053107568,0.0000028350826,0.00005616866,0.000016430888,0.000011311598,0.0010102199,0.00023781095,0.005561821,0.9770859,0.0010902379,0.014863336],"study_design_scores_gemma":[0.0005799414,0.0000838191,0.00016561519,0.00004623976,0.000007944154,0.0000065267163,0.0004173527,0.051976517,0.012843575,0.93188286,0.0016346722,0.00035493722],"about_ca_topic_score_codex":5.801484e-7,"about_ca_topic_score_gemma":5.35101e-7,"teacher_disagreement_score":0.7332788,"about_ca_system_score_codex":0.000036842077,"about_ca_system_score_gemma":0.0000220489,"threshold_uncertainty_score":0.9995519},"labels":[],"label_agreement":null},{"id":"W3183510330","doi":"10.19086/aic.2022.5","title":"Extremal functions for sparse minors","year":2022,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Monash University; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; McGill University","keywords":"Combinatorics; Robertson–Seymour theorem; Mathematics; Graph minor; 1-planar graph; Discrete mathematics; Outerplanar graph; Planar graph; Pathwidth; Line graph; Block graph; Extremal graph theory; Voltage graph; Graph","score_opus":0.026082689526224213,"score_gpt":0.3059711866708144,"score_spread":0.2798884971445902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183510330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012001572,0.0054362826,0.97073406,0.0005766368,0.004083325,0.0008051026,0.000027505173,0.00024150587,0.0060939915],"genre_scores_gemma":[0.9798484,0.00016632443,0.016209783,0.00014933692,0.000037104415,0.00094367046,0.000010111235,0.000024440698,0.002610839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983084,0.000121682184,0.00023300115,0.00045966575,0.00041806625,0.00045913592],"domain_scores_gemma":[0.9985927,0.0005703435,0.000079350604,0.0005990901,0.00007950055,0.00007902428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005812834,0.00012905443,0.00016137872,0.00028733772,0.0004541208,0.00003726403,0.0012158056,0.000025126705,0.000028668052],"category_scores_gemma":[0.00014729564,0.00014638925,0.00007299319,0.0015970548,0.00006646017,0.0008704111,0.00063589745,0.00031479605,0.000009980297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003208622,0.00022729998,0.0026438052,0.000016393089,0.0000039374845,0.000019760138,0.00015594815,0.006263199,0.00004321403,0.9572588,0.00043438977,0.032901123],"study_design_scores_gemma":[0.00075068366,0.00029544183,0.00015875438,0.000003464374,0.0000018269551,0.000013774818,0.00018232103,0.011041672,0.00016005732,0.7203178,0.2668814,0.00019280655],"about_ca_topic_score_codex":0.0000026955809,"about_ca_topic_score_gemma":0.000009062801,"teacher_disagreement_score":0.9678468,"about_ca_system_score_codex":0.00022814667,"about_ca_system_score_gemma":0.0000754687,"threshold_uncertainty_score":0.59695804},"labels":[],"label_agreement":null},{"id":"W3185054184","doi":"10.1007/978-3-030-79987-8_6","title":"All Subgraphs of a Wheel Are 5-Coupled-Choosable","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wheel graph; Computer science; Combinatorics; Planar graph; Treewidth; Vertex (graph theory); Graph; Discrete mathematics; Mathematics; Graph power; Pathwidth; Line graph","score_opus":0.024440167776545955,"score_gpt":0.27814393798431986,"score_spread":0.2537037702077739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185054184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023117532,0.0020307808,0.99268484,0.00064236333,0.0012137131,0.0003953522,0.000009808143,0.00012678586,0.0026651872],"genre_scores_gemma":[0.21545805,0.0006856879,0.778256,0.002676978,0.0006552495,0.000038673636,0.000017754885,0.00014014471,0.0020714395],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942281,0.00007849368,0.00071785547,0.0020760824,0.0018452534,0.0010541712],"domain_scores_gemma":[0.99471855,0.00087894226,0.0005269082,0.0027932257,0.00079004734,0.0002923176],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013968236,0.0006165697,0.00091121893,0.001458028,0.00019577002,0.00038781075,0.0055795955,0.000371998,0.000058267942],"category_scores_gemma":[0.00022932314,0.00058952306,0.00029636212,0.0016934964,0.0013949014,0.0008304133,0.0027535353,0.0012613526,0.000033046294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055957407,0.00028411555,0.0009789389,0.00049564976,0.00014587118,0.0013784616,0.0017610595,0.04568362,0.004287956,0.3966157,0.00011958416,0.5481931],"study_design_scores_gemma":[0.000499382,0.00021536105,0.00024320987,0.001007485,0.000013155669,0.00013293172,9.3875957e-7,0.23533444,0.007061465,0.75209737,0.0023440996,0.0010501693],"about_ca_topic_score_codex":0.000030226147,"about_ca_topic_score_gemma":0.00011884944,"teacher_disagreement_score":0.5471429,"about_ca_system_score_codex":0.00022612822,"about_ca_system_score_gemma":0.000793429,"threshold_uncertainty_score":0.9998007},"labels":[],"label_agreement":null},{"id":"W3185146491","doi":"10.55016/ojs/cdm.v17i2.72680","title":"simplicity index of tournaments","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Simplicity; Combinatorics; Mathematics; Vertex (graph theory); Simple (philosophy); Index (typography); Class (philosophy); Discrete mathematics; Physics; Computer science; Graph; Philosophy","score_opus":0.017368946544547556,"score_gpt":0.3296349611501178,"score_spread":0.31226601460557024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185146491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034417175,0.000033794768,0.96275806,0.0010382696,0.00007914281,0.0004174399,0.00025106402,0.000072257644,0.0009327691],"genre_scores_gemma":[0.9767244,0.0000013352277,0.022726677,0.00011400948,0.000012193269,0.0001325684,0.000006473355,0.0000089585965,0.00027340214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984105,0.00011420462,0.00035056102,0.00021945342,0.000563404,0.00034186593],"domain_scores_gemma":[0.9984495,0.00023507826,0.00014235238,0.0008031492,0.00022059245,0.00014933612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000723105,0.0001071078,0.00022358348,0.00020595141,0.00039202516,0.000046777845,0.0013068836,0.000021338976,0.00009930789],"category_scores_gemma":[0.0004857518,0.000104122344,0.00009259038,0.0010224496,0.000056409626,0.00016766948,0.0014938767,0.00021354531,0.000024197552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010662282,0.00020596824,0.00024060221,0.000020840125,0.000035298668,0.0000065899044,0.00089323387,0.003281765,0.002561779,0.9896074,0.00070447515,0.0024314015],"study_design_scores_gemma":[0.0008733424,0.0003726332,0.0009865451,0.000031654123,0.000015817759,0.000059042646,0.00058407884,0.09435756,0.006630395,0.8886975,0.0070187985,0.000372644],"about_ca_topic_score_codex":0.0000044052745,"about_ca_topic_score_gemma":0.0000012716567,"teacher_disagreement_score":0.94230723,"about_ca_system_score_codex":0.00018573167,"about_ca_system_score_gemma":0.00008608885,"threshold_uncertainty_score":0.4245986},"labels":[],"label_agreement":null},{"id":"W3185570678","doi":"10.1007/s00453-022-01010-1","title":"On the Kernel and Related Problems in Interval Digraphs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Interval (graph theory); Discrete mathematics; Cardinality (data modeling); Dominating set; Kernel (algebra); Graph; Theory of computation; Algorithm; Computer science","score_opus":0.014542216118628522,"score_gpt":0.25060119586709395,"score_spread":0.23605897974846543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185570678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86645645,0.0014026125,0.08243046,0.026685875,0.0011544648,0.0023948562,0.000029699242,0.00059831445,0.018847257],"genre_scores_gemma":[0.9980257,0.000010584311,0.0010643621,0.00028389678,0.0000057854027,0.00011868996,0.0000012002733,0.000009282123,0.00048051128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986971,0.00027476499,0.0001476316,0.0003248986,0.0002944166,0.00026121325],"domain_scores_gemma":[0.9990958,0.0003739571,0.00003817271,0.00043106187,0.000016030148,0.000044995624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071660685,0.000087374,0.00009249162,0.00016662646,0.00021691588,0.000052816482,0.000888881,0.000019128129,0.0000629654],"category_scores_gemma":[0.000055456232,0.00006497298,0.000035601628,0.00083545165,0.00010322727,0.0001395986,0.0008079118,0.00050548406,0.00001600394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013247546,0.00014774896,0.0004883332,0.0000057484353,0.0000253482,0.000060122846,0.0027132235,0.0009118358,0.00030923664,0.9221855,0.00062386674,0.07251581],"study_design_scores_gemma":[0.00045135093,0.00032631546,0.0022780641,0.000015138685,0.0000013007526,0.00006415151,0.00018414737,0.08788432,0.000177811,0.9064227,0.0020326495,0.00016208079],"about_ca_topic_score_codex":0.000017685366,"about_ca_topic_score_gemma":0.000003407324,"teacher_disagreement_score":0.13156922,"about_ca_system_score_codex":0.00004081768,"about_ca_system_score_gemma":0.000020922545,"threshold_uncertainty_score":0.2649521},"labels":[],"label_agreement":null},{"id":"W3186740737","doi":"10.1002/jgt.22829","title":"Polynomial bounds for chromatic number II: Excluding a star‐forest","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Star (game theory); Vertex (graph theory); Clique number; Chromatic scale; Statement (logic); Graph; Clique; Discrete mathematics","score_opus":0.02395129843768923,"score_gpt":0.3024701847071215,"score_spread":0.2785188862694323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186740737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65663403,0.00082212535,0.33890453,0.00071843056,0.0014813408,0.000378238,0.0000197889,0.00006519804,0.000976329],"genre_scores_gemma":[0.9740757,0.000028120054,0.024680875,0.00029070678,0.0002362015,0.000045401062,0.0000013134219,0.000031441676,0.00061025063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973644,0.0005079078,0.0005873622,0.00024862733,0.00077472813,0.0005169618],"domain_scores_gemma":[0.9977045,0.0008746756,0.0005328085,0.00048377068,0.00021281275,0.00019144808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004512319,0.00017963111,0.00035563458,0.00053191674,0.0011622086,0.00012661934,0.0019267455,0.00003907051,0.00017458147],"category_scores_gemma":[0.0002750119,0.00016086383,0.00039803932,0.0009559134,0.00018860969,0.0007703078,0.0007424694,0.00057689747,0.0000045390784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016716034,0.00063611596,0.0019008663,0.00010307942,0.0004620961,0.0002368707,0.004971266,0.002230114,0.0082278885,0.938533,0.024840096,0.016187001],"study_design_scores_gemma":[0.0019338535,0.0014508328,0.0006329241,0.00004478036,0.00003365055,0.0010216879,0.0007796903,0.0020939629,0.0006528466,0.96353596,0.027499598,0.00032022543],"about_ca_topic_score_codex":0.0000017602965,"about_ca_topic_score_gemma":0.0000018270804,"teacher_disagreement_score":0.31744167,"about_ca_system_score_codex":0.0001738169,"about_ca_system_score_gemma":0.00026681,"threshold_uncertainty_score":0.8938886},"labels":[],"label_agreement":null},{"id":"W3187594655","doi":"10.1016/j.disc.2022.113108","title":"Mixing colourings in 2K2-free graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Chromatic scale; Social connectedness; Discrete mathematics","score_opus":0.021336088618649843,"score_gpt":0.28297028056507156,"score_spread":0.26163419194642173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187594655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45930767,0.00035594913,0.51144725,0.0024654572,0.00042379892,0.0011310597,0.000035947898,0.0005403828,0.02429247],"genre_scores_gemma":[0.8147229,0.000010242841,0.1839126,0.00019739347,0.000013897908,0.00022838976,0.0000037695543,0.000035790603,0.0008750025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998201,0.00012469728,0.0003035607,0.0003205842,0.00061472744,0.0004354304],"domain_scores_gemma":[0.99841803,0.00027363197,0.00010299509,0.0010973486,0.000028646331,0.00007936444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000975595,0.00013641722,0.00020229889,0.00031815225,0.0002569256,0.00009027089,0.0023734835,0.000023634242,0.00007059457],"category_scores_gemma":[0.00019451031,0.0001355158,0.00008251911,0.0011113611,0.000070412854,0.0002773199,0.00224377,0.00036542054,0.000018997402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056487347,0.00009383186,0.00035663345,0.000050949497,0.000008972549,0.00007118075,0.0039731846,0.0005912156,0.0005010184,0.99331135,0.00029721975,0.0007388064],"study_design_scores_gemma":[0.00041221484,0.00007791361,0.00016873555,0.000020689136,0.0000021697306,0.000033909793,0.0008969296,0.041248348,0.0005538359,0.9554969,0.0008877687,0.00020059966],"about_ca_topic_score_codex":0.000006834128,"about_ca_topic_score_gemma":0.000007488597,"teacher_disagreement_score":0.35541525,"about_ca_system_score_codex":0.00008840798,"about_ca_system_score_gemma":0.00003946134,"threshold_uncertainty_score":0.55261743},"labels":[],"label_agreement":null},{"id":"W3187953129","doi":"10.19086/aic.2022.8","title":"Local Girth Choosability of Planar Graphs","year":2022,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Planar graph; Conjecture; Vertex (graph theory); Graph; Girth (graph theory); Discrete mathematics; Planar; Computer science","score_opus":0.012289818736853081,"score_gpt":0.2865556997259913,"score_spread":0.27426588098913823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187953129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119204625,0.011916128,0.85467243,0.00052009174,0.002775863,0.00097603863,0.00004318759,0.00031006415,0.009581541],"genre_scores_gemma":[0.9952893,0.00023062399,0.0042731366,0.00005239662,0.0000035811008,0.00008546525,0.0000028668667,0.00001038238,0.00005222975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771976,0.00032124505,0.00035268304,0.00046718988,0.00073997147,0.00039912842],"domain_scores_gemma":[0.99832773,0.00050215813,0.00013082738,0.00087220507,0.000083094135,0.0000839835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009330219,0.00013886289,0.0002562491,0.00029431784,0.00017785766,0.000012763028,0.0018294117,0.000030906707,0.000023072846],"category_scores_gemma":[0.00011768426,0.00015038603,0.00007421652,0.0025107865,0.00025643175,0.0007261179,0.0006982126,0.0004998161,0.000003256146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029107638,0.00029857317,0.020892723,0.00003291008,0.0000037344978,0.00002538132,0.00019347998,0.003626792,0.000030931613,0.9579518,0.000029644296,0.016884936],"study_design_scores_gemma":[0.0005343678,0.00029202973,0.0017932801,0.000005632055,0.0000010105778,0.000009161459,0.00017888573,0.0027689184,0.00077567925,0.9822969,0.011181677,0.00016247437],"about_ca_topic_score_codex":0.000016215145,"about_ca_topic_score_gemma":0.0000118490525,"teacher_disagreement_score":0.8760847,"about_ca_system_score_codex":0.00020919919,"about_ca_system_score_gemma":0.00009476746,"threshold_uncertainty_score":0.61325645},"labels":[],"label_agreement":null},{"id":"W3190183031","doi":"10.1090/jams/1047","title":"Reducing linear Hadwiger’s conjecture to coloring small graphs","year":2024,"lang":"lv","type":"article","venue":"Journal of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics; Graph coloring; Discrete mathematics; Graph","score_opus":0.033742551943043014,"score_gpt":0.32666548164259224,"score_spread":0.29292292969954925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190183031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4227087,0.001458262,0.54887366,0.024034217,0.0016905078,0.0005774525,0.00001337619,0.00010555436,0.00053827657],"genre_scores_gemma":[0.6411523,0.0003903351,0.35223952,0.0028582928,0.0011029096,0.0000148287545,2.0220995e-7,0.00011723259,0.002124356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958006,0.00045192268,0.0010658611,0.00051493733,0.0012857794,0.0008809146],"domain_scores_gemma":[0.9955545,0.0018731141,0.00067148724,0.0009473792,0.0003735413,0.00057995296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031149623,0.00040115687,0.00092965167,0.00016736971,0.0003998722,0.00061558676,0.0029066312,0.000105267776,0.000060043807],"category_scores_gemma":[0.0010218449,0.00024932937,0.0017623507,0.0032841568,0.0010084666,0.00038541044,0.0011762901,0.0020617486,0.00012264132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005223894,0.0012705107,0.00037827773,0.003274113,0.004541689,0.0008221665,0.08641549,0.019799553,0.046238452,0.68027747,0.035793245,0.12066663],"study_design_scores_gemma":[0.0008644967,0.0030072555,0.0007269197,0.0073449044,0.0005927507,0.002687199,0.005952155,0.21304202,0.010200804,0.73209995,0.022009598,0.0014719431],"about_ca_topic_score_codex":0.00001291717,"about_ca_topic_score_gemma":9.8721e-7,"teacher_disagreement_score":0.21844362,"about_ca_system_score_codex":0.00037250982,"about_ca_system_score_gemma":0.00051216636,"threshold_uncertainty_score":0.9999959},"labels":[],"label_agreement":null},{"id":"W3193424040","doi":"10.1002/jgt.22862","title":"Polynomial bounds for chromatic number. III. Excluding a double star","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Division of Mathematical Sciences; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Star (game theory); Conjecture; Chromatic scale; Clique; Stars; Tree (set theory); Polynomial; Function (biology); Chromatic polynomial; Discrete mathematics; Physics; Astrophysics","score_opus":0.03039541251985209,"score_gpt":0.3161732757768858,"score_spread":0.2857778632570337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193424040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52158093,0.0010901344,0.47145212,0.0007553369,0.0020128,0.0005718739,0.000014608188,0.00009254105,0.0024296253],"genre_scores_gemma":[0.97491497,0.000025550444,0.023755884,0.00023910735,0.00023240033,0.000053924025,0.0000011044934,0.00003115059,0.00074592273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745,0.00041584275,0.00059914176,0.00025321537,0.0007707141,0.0005111072],"domain_scores_gemma":[0.9978052,0.00076616596,0.0005468376,0.0004889556,0.0002023042,0.0001905587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004985401,0.00017436003,0.00037450204,0.0005275013,0.0008009619,0.00015122662,0.0020032707,0.000037941143,0.00019783921],"category_scores_gemma":[0.00009877735,0.00015890332,0.00042836028,0.0008950432,0.00016250477,0.00081638317,0.0005249198,0.00055723893,0.000005874285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038599642,0.00045347988,0.000291705,0.000091750546,0.00042076525,0.00019113542,0.004598226,0.0010925482,0.011730014,0.9492121,0.0140536055,0.014004723],"study_design_scores_gemma":[0.005214273,0.0010877621,0.0001279131,0.000047141344,0.000039146835,0.0010107828,0.0012858609,0.001447541,0.002613373,0.9674505,0.01932133,0.00035438777],"about_ca_topic_score_codex":0.0000034407055,"about_ca_topic_score_gemma":0.0000013043751,"teacher_disagreement_score":0.453334,"about_ca_system_score_codex":0.00018603323,"about_ca_system_score_gemma":0.00025258985,"threshold_uncertainty_score":0.6479889},"labels":[],"label_agreement":null},{"id":"W3193864805","doi":"10.4230/lipics.esa.2021.58","title":"QCSP on Reflexive Tournaments","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Tournament; Mathematics; Constraint satisfaction problem; Graph; Statistics","score_opus":0.030196304247193714,"score_gpt":0.3282804791982487,"score_spread":0.298084174951055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193864805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1360386,0.00015714395,0.79414076,0.0022615418,0.002401933,0.0018166183,0.00047072262,0.0006794649,0.062033195],"genre_scores_gemma":[0.80236626,0.00017836082,0.18061376,0.008632027,0.0004168332,0.00033995748,0.00046890328,0.00013508927,0.0068487963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965304,0.00010119258,0.00089321163,0.00045273712,0.0009473846,0.0010750865],"domain_scores_gemma":[0.99688786,0.00029689516,0.00031732093,0.0015739558,0.0005633475,0.00036060656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007006098,0.00039485306,0.0004329518,0.00033218123,0.00047461016,0.00059834996,0.0018261835,0.00018405887,0.00007697072],"category_scores_gemma":[0.00027144648,0.00036253352,0.00030207192,0.00074954575,0.00013509773,0.0019879707,0.00093853346,0.0006628053,0.0005899089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005143791,0.0016067951,0.0030116881,0.0006959393,0.00062333257,0.0002788254,0.012426399,0.0009846407,0.001106528,0.8237344,0.018653395,0.13636366],"study_design_scores_gemma":[0.014365579,0.0024689832,0.0019285122,0.0009703058,0.000066147,0.0006405184,0.0039152233,0.08810472,0.06430718,0.1626364,0.65756226,0.0030341628],"about_ca_topic_score_codex":0.000002100585,"about_ca_topic_score_gemma":0.0000048277957,"teacher_disagreement_score":0.66632766,"about_ca_system_score_codex":0.00023477794,"about_ca_system_score_gemma":0.00017377414,"threshold_uncertainty_score":0.99988264},"labels":[],"label_agreement":null},{"id":"W3195612562","doi":"10.1002/jgt.22890","title":"Orientation‐based edge‐colorings and linear arboricity of multigraphs","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Edge coloring; Combinatorics; Mathematics; Arboricity; Multigraph; Conjecture; Simple (philosophy); Upper and lower bounds; Vertex (graph theory); List coloring; Chromatic scale; Discrete mathematics; Graph; Planar graph","score_opus":0.017925671157843062,"score_gpt":0.28816652436230056,"score_spread":0.2702408532044575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195612562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.672607,0.0008764892,0.3253095,0.000263402,0.00043232334,0.00015783348,0.000008281196,0.00002647737,0.00031868575],"genre_scores_gemma":[0.9729142,0.000044063436,0.0268042,0.00014169147,0.000030390735,0.000008275777,4.1938426e-7,0.000010511315,0.00004622308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978245,0.0005919167,0.00046907144,0.0001978282,0.00068873574,0.00022793593],"domain_scores_gemma":[0.99792325,0.00073963095,0.000544298,0.0003386763,0.00031515304,0.00013901116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029715202,0.000119348995,0.00026717453,0.00090347574,0.0002563586,0.000023233124,0.0009421231,0.000028160825,0.000040463663],"category_scores_gemma":[0.00022983016,0.00010651685,0.00018993202,0.0013771537,0.0002611638,0.00042466584,0.0002783003,0.00048600265,6.0286976e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008893045,0.00045384045,0.008919497,0.00005462272,0.00013356801,0.00010111632,0.0018419438,0.0040563513,0.015354882,0.9541409,0.00012452493,0.013929434],"study_design_scores_gemma":[0.0025374594,0.0017975916,0.010526412,0.00003924226,0.000039313793,0.00015511298,0.0009885753,0.0038730819,0.021868827,0.9561237,0.0017639003,0.0002867525],"about_ca_topic_score_codex":0.0000026983446,"about_ca_topic_score_gemma":4.844931e-7,"teacher_disagreement_score":0.30030718,"about_ca_system_score_codex":0.000036238373,"about_ca_system_score_gemma":0.00012338569,"threshold_uncertainty_score":0.4343631},"labels":[],"label_agreement":null},{"id":"W3196344216","doi":"10.1016/j.jctb.2023.10.005","title":"Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Bounded function; Disjoint sets; Discrete mathematics; Degree (music); Conjecture; Vertex (graph theory); Clique-sum; 1-planar graph; Induced subgraph; Graph; Pathwidth; Chordal graph; Line graph","score_opus":0.035810595052561615,"score_gpt":0.2923976960918472,"score_spread":0.25658710103928556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196344216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99523866,0.0006299497,0.0015940528,0.00068613497,0.0012687235,0.00021861802,0.000007851892,0.00005188767,0.000304132],"genre_scores_gemma":[0.9974128,0.00084830733,0.0016043696,0.000029846928,0.000050839702,0.0000076420265,0.0000015614461,0.000019534215,0.000025093455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975788,0.00056408567,0.0007422016,0.00028302983,0.00042222528,0.00040968176],"domain_scores_gemma":[0.9976694,0.000934274,0.00041350213,0.00040209186,0.0003603831,0.00022036897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021884108,0.0002529358,0.00060739846,0.0013376625,0.00023979163,0.000111721565,0.00087367854,0.00013689585,0.000006009141],"category_scores_gemma":[0.00032275208,0.00020489182,0.0001772396,0.0020992022,0.00048730214,0.0012076632,0.00052052253,0.00052660936,6.6306905e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007092551,0.00014644547,0.0008443472,0.000033572953,0.00009254517,0.000052650223,0.0027594161,0.000006814401,0.019891517,0.9666224,0.000027154136,0.008813864],"study_design_scores_gemma":[0.001996434,0.0016616789,0.004744335,0.00010201828,0.0000117356185,0.00012656735,0.00065556244,0.00006705389,0.018770523,0.9715521,0.000121564,0.00019044845],"about_ca_topic_score_codex":0.0000070514775,"about_ca_topic_score_gemma":0.000016292252,"teacher_disagreement_score":0.008623415,"about_ca_system_score_codex":0.000031889587,"about_ca_system_score_gemma":0.00013239955,"threshold_uncertainty_score":0.83552456},"labels":[],"label_agreement":null},{"id":"W3196808644","doi":"10.1016/j.dam.2023.05.030","title":"A linear-time algorithm for semitotal domination in strongly chordal graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Chordal graph; Mathematics; Dominating set; Combinatorics; Time complexity; Vertex (graph theory); Maximal independent set; Bipartite graph; Interval graph; Discrete mathematics; Graph; 1-planar graph","score_opus":0.01700210038948882,"score_gpt":0.29841595928583475,"score_spread":0.28141385889634596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196808644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016250929,0.00000962647,0.9803703,0.00012399472,0.00006687929,0.0010416735,0.000034079836,0.00033058441,0.0017719539],"genre_scores_gemma":[0.038248476,0.000010916655,0.96026313,0.000019205429,0.00006607373,0.00070791563,0.00007383922,0.000052426032,0.00055802043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981925,0.000022932258,0.00037387857,0.0004249125,0.00043178018,0.00055402605],"domain_scores_gemma":[0.99862957,0.0005250821,0.00011299453,0.00056990125,0.000066518725,0.00009591995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008788413,0.00019984205,0.0002854009,0.00040051466,0.00011291747,0.000090164685,0.0007947833,0.00008783279,0.0000078471485],"category_scores_gemma":[0.00008445254,0.00018702776,0.00010151492,0.001344676,0.00008158692,0.00025256773,0.00030841984,0.00018227201,0.00018126768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019221661,0.00013585998,0.000007053762,0.00014696881,0.00003472666,0.000013590628,0.0022714536,0.0010810804,0.010716279,0.8994156,0.00038000752,0.08577812],"study_design_scores_gemma":[0.0006528036,0.000042954784,0.000034674904,0.000020657735,0.0000039566594,0.0000027588728,0.00020626602,0.66323346,0.0026375125,0.3328745,0.00010959524,0.0001808296],"about_ca_topic_score_codex":0.0000010254721,"about_ca_topic_score_gemma":0.0000015284162,"teacher_disagreement_score":0.6621524,"about_ca_system_score_codex":0.000047741094,"about_ca_system_score_gemma":0.00004165284,"threshold_uncertainty_score":0.76267713},"labels":[],"label_agreement":null},{"id":"W3197412015","doi":"","title":"A quadratic lower bound for homogeneous algebraic branching programs.","year":2017,"lang":"en","type":"article","venue":"Electron. Colloquium Comput. Complex.","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Branching (polymer chemistry); Homogeneous; Algebraic number; Quadratic equation; Mathematics; Upper and lower bounds; Combinatorics; Mathematical analysis; Geometry","score_opus":0.03957557006918323,"score_gpt":0.3268838666114183,"score_spread":0.28730829654223505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197412015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1382399,0.0007206804,0.8524703,0.0018523602,0.0011330124,0.0027817816,0.000012566707,0.00075318315,0.0020362022],"genre_scores_gemma":[0.91760725,0.0000126810855,0.079749875,0.00042684528,0.00041248137,0.00039432262,0.000024889201,0.00008915791,0.0012825283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948212,0.0002532825,0.000625916,0.0014045709,0.00084934686,0.0020457113],"domain_scores_gemma":[0.9949978,0.00050237053,0.00047380826,0.00317974,0.0004324598,0.00041383845],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010810669,0.00059093535,0.0007521688,0.0003292905,0.0033789526,0.0026780104,0.005787166,0.00015286557,0.000030879073],"category_scores_gemma":[0.00026643864,0.0006063002,0.00042563933,0.0005518389,0.0005086248,0.0011516131,0.0012711225,0.00054748973,0.00009700929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007455624,0.0016545247,0.0013519116,0.0003270934,0.0006201964,0.00028449867,0.0010985924,0.0013892993,0.034239892,0.76816213,0.012812823,0.17731346],"study_design_scores_gemma":[0.005426941,0.004812165,0.0044316035,0.00017269693,0.00006631665,0.00042876345,0.000027587968,0.3242155,0.0071713584,0.5520952,0.09872776,0.002424148],"about_ca_topic_score_codex":0.00004693863,"about_ca_topic_score_gemma":0.00024368371,"teacher_disagreement_score":0.7793673,"about_ca_system_score_codex":0.00026325454,"about_ca_system_score_gemma":0.00047407817,"threshold_uncertainty_score":0.99963886},"labels":[],"label_agreement":null},{"id":"W3197431324","doi":"10.48550/arxiv.2108.12880","title":"Five-List-Coloring Graphs on Surfaces: The Many Faces Far-Apart Generalization of Thomassen's Theorem","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Generalization; Vertex (graph theory); Graph; Mathematical analysis","score_opus":0.06828174157408821,"score_gpt":0.2251705384891648,"score_spread":0.15688879691507657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197431324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68730634,0.0001583478,0.30954018,0.0001134265,0.00042256885,0.00039691696,0.000014983817,0.00013282086,0.0019143837],"genre_scores_gemma":[0.99650896,0.00072397076,0.001306675,0.0000834276,0.000027404569,0.0000034832312,0.000019923844,0.000026370813,0.0012998164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969154,0.000776678,0.00028614918,0.0012382894,0.00030468428,0.00047877678],"domain_scores_gemma":[0.9965557,0.00047856098,0.00038522005,0.0020589754,0.0003949463,0.0001265944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007655,0.00037016429,0.00043626278,0.0003682904,0.0003371659,0.00020701959,0.0032238637,0.00024329333,0.000029352559],"category_scores_gemma":[0.00008854486,0.0003371401,0.00032827252,0.0015069996,0.00041770865,0.00047404104,0.0024855433,0.0007205468,0.000012189967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032356933,0.00006010557,0.0017539054,0.000052492676,0.00008600306,0.00008411296,0.00045584337,0.3613412,0.0004850844,0.63544387,0.000025631658,0.0001793971],"study_design_scores_gemma":[0.0006202857,0.00016855661,0.0042260606,0.00028583815,0.000079098325,0.0000063476386,0.0012390178,0.5096831,0.012241195,0.47020608,0.00044476055,0.0007996739],"about_ca_topic_score_codex":0.00011344198,"about_ca_topic_score_gemma":0.00007716509,"teacher_disagreement_score":0.30920255,"about_ca_system_score_codex":0.00013971204,"about_ca_system_score_gemma":0.00018818682,"threshold_uncertainty_score":0.9999081},"labels":[],"label_agreement":null},{"id":"W3197468490","doi":"10.48550/arxiv.2109.00327","title":"Universality in minor-closed graph classes","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; European Commission","keywords":"Mathematics; Combinatorics; Countable set; Discrete mathematics; Planar graph; Cubic graph; Graph; Line graph; Voltage graph","score_opus":0.08924809177513338,"score_gpt":0.22465256734945893,"score_spread":0.13540447557432556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197468490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6385938,0.00013163591,0.3572031,0.00011073641,0.00034811953,0.00029317677,0.000010206223,0.00021017424,0.0030990448],"genre_scores_gemma":[0.99525046,0.00029743343,0.003093931,0.000066790315,0.000026801452,0.0000012283037,0.00001884222,0.000021358244,0.0012231321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637914,0.00068691606,0.00025935468,0.0018024043,0.00020038651,0.0006717881],"domain_scores_gemma":[0.99670714,0.00031550237,0.00020070809,0.0022418268,0.00027625088,0.0002585669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052050187,0.0003975423,0.0005007872,0.0008558522,0.00013516042,0.00022810961,0.0033322528,0.00038395572,0.000057286496],"category_scores_gemma":[0.000091162394,0.0005063568,0.00032517372,0.0024895852,0.00030785467,0.00083800807,0.004207754,0.0012586826,0.00003719714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009736072,0.000394934,0.030913418,0.00019391846,0.00014789966,0.005760524,0.00062120875,0.109391145,0.00034216035,0.8507457,0.00011152262,0.0012802212],"study_design_scores_gemma":[0.002552759,0.00013422122,0.037199948,0.00043921985,0.00007121117,0.000020290605,0.0016201684,0.1831735,0.001467413,0.770278,0.0009875027,0.0020557751],"about_ca_topic_score_codex":0.000443107,"about_ca_topic_score_gemma":0.000459632,"teacher_disagreement_score":0.35665667,"about_ca_system_score_codex":0.0004333012,"about_ca_system_score_gemma":0.00054787187,"threshold_uncertainty_score":0.9997388},"labels":[],"label_agreement":null},{"id":"W3197941146","doi":"10.19086/aic.2022.6","title":"Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth","year":2022,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Treewidth; Mathematics; Discrete mathematics; Logarithm; Pathwidth; Tree-depth; Conjecture; Induced subgraph; Cograph; Clique-sum; Distance-hereditary graph; Induced path; Chordal graph; Partial k-tree; Graph; 1-planar graph; Vertex (graph theory); Line graph; Graph power","score_opus":0.013977358339436596,"score_gpt":0.2812867664249737,"score_spread":0.2673094080855371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197941146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66961825,0.019654451,0.2942267,0.0022768572,0.0017691819,0.0016796342,0.000046634766,0.00048551068,0.010242783],"genre_scores_gemma":[0.9929847,0.00082046585,0.0058000586,0.000096811506,0.000010033888,0.00021787363,0.00000732874,0.000014723435,0.000048015958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982322,0.00017288928,0.0002758564,0.0005512589,0.00037997114,0.00038783893],"domain_scores_gemma":[0.99872285,0.00047738277,0.000096166965,0.0005056184,0.00006839048,0.00012956193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003384339,0.00018136151,0.00022771326,0.0004484096,0.00070947665,0.000098460696,0.00069604017,0.00004460637,0.0000103797465],"category_scores_gemma":[0.000050361752,0.00020138902,0.000036583377,0.0016002897,0.00015860221,0.0011440866,0.00066768617,0.00051819807,0.0000014934271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016643102,0.00016030403,0.007496666,0.000011445168,0.000007693198,0.000043409324,0.0003983733,0.00016767666,0.0007827128,0.94711214,0.000016528007,0.043786407],"study_design_scores_gemma":[0.001417431,0.00040308086,0.007509543,0.000012530068,0.000005498681,0.00008059425,0.00020447712,0.011079323,0.00035878073,0.97588885,0.0027304601,0.00030945332],"about_ca_topic_score_codex":0.000024707568,"about_ca_topic_score_gemma":0.00019276598,"teacher_disagreement_score":0.32336646,"about_ca_system_score_codex":0.00011497825,"about_ca_system_score_gemma":0.00006641098,"threshold_uncertainty_score":0.82124054},"labels":[],"label_agreement":null},{"id":"W3198239652","doi":"10.1016/j.disc.2022.112869","title":"Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Induced subgraph; Hamiltonian path; Distance-hereditary graph; Indifference graph; Pancyclic graph; Induced path; Cograph; Discrete mathematics; Chordal graph; Hamiltonian path problem; Pathwidth; Induced subgraph isomorphism problem; Vertex (graph theory); Longest path problem; Line graph; Graph; Graph power; Voltage graph","score_opus":0.02732548057777925,"score_gpt":0.3102251781203765,"score_spread":0.28289969754259725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198239652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93418366,0.000051614206,0.062354952,0.00010511266,0.00012116679,0.00040957893,0.000048771155,0.00007994345,0.0026451885],"genre_scores_gemma":[0.9304326,0.0000069065436,0.069371894,0.00002315354,0.000006601399,0.000059382754,0.000006656852,0.000025649759,0.000067153065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749845,0.00019043013,0.00065911125,0.00036641356,0.00087340263,0.00041218364],"domain_scores_gemma":[0.99756414,0.0005294318,0.00045426885,0.0011587827,0.00018702685,0.0001063641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079853396,0.00021161594,0.00047970243,0.00052479666,0.00017776989,0.000031293002,0.0018310833,0.000040227613,0.000070332564],"category_scores_gemma":[0.00016648916,0.00019911288,0.00022638244,0.0019591732,0.0002068829,0.00024716143,0.0009792773,0.00029951992,0.0000040881196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032922362,0.00034973613,0.0010431685,0.00026112449,0.000087780885,0.000018194785,0.0055254274,0.00017579133,0.11751527,0.8740781,0.0000650145,0.0008474713],"study_design_scores_gemma":[0.0017952234,0.0011796388,0.0022781193,0.00011020103,0.000045542925,0.00005365019,0.003428604,0.04967229,0.13924876,0.801446,0.000106512256,0.00063545845],"about_ca_topic_score_codex":0.000018674898,"about_ca_topic_score_gemma":0.000008349923,"teacher_disagreement_score":0.07263209,"about_ca_system_score_codex":0.000029466195,"about_ca_system_score_gemma":0.00011523169,"threshold_uncertainty_score":0.81195873},"labels":[],"label_agreement":null},{"id":"W3198462604","doi":"10.1137/21m1443352","title":"Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Induced subgraph; Discrete mathematics; Complete coloring; Integer (computer science); Graph; Time complexity; Fractional coloring; List coloring; Graph power; Computer science; Line graph","score_opus":0.0753537972018547,"score_gpt":0.32949796142603377,"score_spread":0.25414416422417907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198462604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27768594,0.000051791154,0.7166793,0.0012466637,0.00028449277,0.0010780648,0.000029580173,0.00015124063,0.0027929852],"genre_scores_gemma":[0.8253295,0.0000067994806,0.1737555,0.00021190352,0.00008522441,0.00024988857,0.0000034376528,0.00005109076,0.0003066671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997339,0.00017232659,0.00044976381,0.00034573805,0.0010684993,0.0006246634],"domain_scores_gemma":[0.99798703,0.0005142083,0.0003943899,0.0006819983,0.00016532927,0.00025706275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015431803,0.00024743952,0.00036367562,0.0003727174,0.001170323,0.00034220703,0.0017855212,0.00003473675,0.00006947576],"category_scores_gemma":[0.00013861415,0.00018947665,0.00020435256,0.0007883692,0.00011041303,0.00046259773,0.00048530818,0.00084529613,0.000006629163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002539041,0.00032123982,0.00017491203,0.00011648838,0.00014341762,0.00013573133,0.0029062475,0.0006545068,0.0013112624,0.9916883,0.0003129489,0.0019810083],"study_design_scores_gemma":[0.0020703361,0.0029499356,0.00020022887,0.0001306269,0.000027321004,0.0008910429,0.0013256483,0.03567136,0.0018040203,0.9511293,0.0032623578,0.0005377845],"about_ca_topic_score_codex":0.000001934614,"about_ca_topic_score_gemma":0.000005019834,"teacher_disagreement_score":0.54764354,"about_ca_system_score_codex":0.00018044055,"about_ca_system_score_gemma":0.0001344455,"threshold_uncertainty_score":0.9001296},"labels":[],"label_agreement":null},{"id":"W3202012722","doi":"10.4086/toc.2021.v017a009","title":"","year":2021,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leibniz-Gemeinschaft; Simons Institute for the Theory of Computing, University of California Berkeley; Banff International Research Station for Mathematical Innovation and Discovery; Mathematisches Forschungsinstitut Oberwolfach; Johns Hopkins University; National Science Foundation","keywords":"Combinatorics; Mathematics; Bounded function; Eigenvalues and eigenvectors; Vertex (graph theory); Omega; Binary logarithm; Discrete mathematics; Random graph; Graph","score_opus":0.02864492533377073,"score_gpt":0.3065202544915342,"score_spread":0.2778753291577635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202012722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44784576,0.00031286277,0.55060154,0.00022906711,0.0001205284,0.00007025663,5.0169086e-7,0.00017071172,0.00064876303],"genre_scores_gemma":[0.80368066,0.000007315504,0.1959623,0.00023152595,0.000046743327,0.0000016413638,0.0000010567165,0.00001402277,0.000054728873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995554,0.0016176013,0.00063183345,0.00073602766,0.0006883417,0.00077222654],"domain_scores_gemma":[0.9939845,0.0031900264,0.0002730997,0.0016894675,0.0006666546,0.00019621498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041577416,0.00022978676,0.0004713247,0.00023158394,0.00034923,0.00011185446,0.0023820882,0.00006395461,0.000009392432],"category_scores_gemma":[0.0009927249,0.00023815488,0.00020859583,0.0018299887,0.0003524154,0.0007511166,0.002300099,0.00035851847,0.000005170542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031465977,0.000100773956,0.0011155617,0.000037226135,0.000038704242,0.0001088632,0.0030099037,0.003987648,0.042745378,0.85828966,0.0000019382499,0.09053286],"study_design_scores_gemma":[0.0005827637,0.00008284944,0.006193934,0.00008599747,0.0000041939484,0.0001449486,0.0006723196,0.024129888,0.2199514,0.74790436,0.000023123343,0.00022423915],"about_ca_topic_score_codex":0.0000017895702,"about_ca_topic_score_gemma":0.0000011588717,"teacher_disagreement_score":0.3558349,"about_ca_system_score_codex":0.000034074674,"about_ca_system_score_gemma":0.00020802757,"threshold_uncertainty_score":0.97116745},"labels":[],"label_agreement":null},{"id":"W3202928722","doi":"","title":"A survey on alliances in graphs: Defensive alliances","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Alliance; Realizability; Vertex (graph theory); Graph; Mathematics; Combinatorics; Computer science; Geography; Algorithm","score_opus":0.08717187670400472,"score_gpt":0.3625151750718749,"score_spread":0.2753432983678702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202928722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71508473,0.0032315035,0.13255055,0.0066550337,0.0015347496,0.0036857831,0.00016230154,0.00088324514,0.13621213],"genre_scores_gemma":[0.9801086,0.00008328412,0.019088672,0.00013290688,0.0000140518,0.00006434237,0.000002336694,0.00001672605,0.00048907154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976515,0.00026849817,0.0003443589,0.0006176611,0.0005418061,0.00057614635],"domain_scores_gemma":[0.9959753,0.0012900627,0.00019822543,0.0022606428,0.00013751828,0.00013822291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017160028,0.0002264995,0.00036700175,0.00017926842,0.0003708556,0.00032783856,0.00294399,0.00007208187,0.00004711804],"category_scores_gemma":[0.0024101695,0.00018756355,0.000098151126,0.00029247926,0.00041837746,0.00069750566,0.00045603918,0.0002645306,0.00041782408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006640875,0.00033850953,0.011748699,0.00011084614,0.000044685396,0.000103178456,0.0015801061,0.00003581781,0.00006445128,0.96768016,0.0014802854,0.016746882],"study_design_scores_gemma":[0.00038218003,0.00014587681,0.1329576,0.00024528027,0.0000022779889,0.0000036927945,0.00009174804,0.006511955,0.000529784,0.85842294,0.00043543027,0.00027121956],"about_ca_topic_score_codex":0.00007046294,"about_ca_topic_score_gemma":0.00035928134,"teacher_disagreement_score":0.2650239,"about_ca_system_score_codex":0.000036238394,"about_ca_system_score_gemma":0.00005366322,"threshold_uncertainty_score":0.764862},"labels":[],"label_agreement":null},{"id":"W3204767113","doi":"10.1007/s00493-023-00015-w","title":"Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Algorithm; Mathematics","score_opus":0.03349660689747145,"score_gpt":0.32149013006570326,"score_spread":0.2879935231682318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204767113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61064583,0.00087045843,0.34150377,0.013916749,0.014257066,0.00958766,0.00017484384,0.002975832,0.0060678064],"genre_scores_gemma":[0.9903269,0.000023104627,0.0049108854,0.00022646101,0.00022872018,0.0010779335,0.000017465687,0.00006709283,0.0031214594],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723303,0.00014417962,0.00039097722,0.0006808442,0.00047613584,0.001074807],"domain_scores_gemma":[0.9960526,0.002304495,0.00015993645,0.0010953587,0.00018699956,0.00020057884],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011857275,0.000286096,0.00037794554,0.00012711037,0.0017617835,0.0007334794,0.0022713926,0.00011950333,0.000016208762],"category_scores_gemma":[0.000683509,0.00023411251,0.00029813277,0.001460745,0.00028764672,0.00052201434,0.0007235616,0.00026203733,0.0001838044],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033134516,0.00032560911,0.0004661152,0.00031464305,0.00021001277,0.00003375159,0.0045171953,0.00010428865,0.0021151397,0.2806177,0.6720652,0.038898993],"study_design_scores_gemma":[0.0056624566,0.00094413356,0.0016443055,0.0000928353,0.000045414836,0.000040392886,0.00031499975,0.34418735,0.0012766911,0.39757824,0.24726273,0.00095044926],"about_ca_topic_score_codex":0.000019657777,"about_ca_topic_score_gemma":0.0000028548836,"teacher_disagreement_score":0.42480245,"about_ca_system_score_codex":0.000253645,"about_ca_system_score_gemma":0.0003318761,"threshold_uncertainty_score":0.99953777},"labels":[],"label_agreement":null},{"id":"W3205515510","doi":"10.5614/ejgta.2022.10.2.19","title":"Eternal domination and clique covering","year":2022,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Circulant matrix; Split graph; Discrete mathematics; Vertex (graph theory); Domination analysis; Dominating set; Circulant graph; Clique number; Chordal graph; Clique; Graph; Line graph; 1-planar graph; Graph power","score_opus":0.00545523863843947,"score_gpt":0.26256846333263,"score_spread":0.2571132246941905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205515510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10896662,0.0029193563,0.887362,0.00035240751,0.000022904627,0.0001389739,0.000001899345,0.000014121118,0.00022172871],"genre_scores_gemma":[0.99793696,0.0006970266,0.001087803,0.00009903868,0.000035163666,0.000054071774,5.106041e-7,0.0000058113174,0.00008361284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892616,0.00029789243,0.0001941394,0.00014691055,0.0001982929,0.00023661718],"domain_scores_gemma":[0.9992065,0.00032582908,0.00017169282,0.00016603728,0.000061669685,0.00006829932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024183653,0.00006935213,0.00010404816,0.0002231814,0.00045540222,0.000047940608,0.00043375252,0.000015591106,0.000010598371],"category_scores_gemma":[0.00002405423,0.00006610257,0.000046472775,0.00038080517,0.00009514912,0.00030862988,0.00018479642,0.00048597733,4.4624196e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053661126,0.000029449864,0.00008574451,0.0000033216722,0.000021843947,0.0000016979519,0.00015441062,0.00010791337,0.0029146178,0.95720625,0.000005801005,0.039415278],"study_design_scores_gemma":[0.0003126743,0.00024768166,0.00028190835,0.0000032019573,0.000007369515,0.00049866724,0.00014590523,0.00017689625,0.0007928534,0.9903386,0.0071238107,0.00007042651],"about_ca_topic_score_codex":5.603789e-7,"about_ca_topic_score_gemma":8.0634715e-7,"teacher_disagreement_score":0.8889704,"about_ca_system_score_codex":0.000053735585,"about_ca_system_score_gemma":0.000093157585,"threshold_uncertainty_score":0.35026315},"labels":[],"label_agreement":null},{"id":"W3206226465","doi":"10.1016/j.disc.2021.112679","title":"Serial exchanges in matroids","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University","keywords":"Matroid; Combinatorics; Mathematics; Conjecture; Rank (graph theory); Binary number; Set (abstract data type); Discrete mathematics; Arithmetic; Computer science","score_opus":0.028078970645199982,"score_gpt":0.3088374225669366,"score_spread":0.2807584519217366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206226465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1027116,0.00040192384,0.87903595,0.0015210204,0.00032451976,0.0002528104,0.000008748781,0.00019670282,0.015546721],"genre_scores_gemma":[0.3011719,0.0001010323,0.6949887,0.00020848056,0.00013816214,0.00007059348,0.00001067207,0.00004366875,0.0032667837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880695,0.0000794104,0.0002190834,0.00026682467,0.00030097127,0.00032677583],"domain_scores_gemma":[0.99897254,0.00015014669,0.000047357727,0.0006960116,0.00006261123,0.00007136732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034785207,0.000112786176,0.00018597764,0.000100071265,0.00004766505,0.00013119016,0.00061757857,0.000046249046,0.00006509835],"category_scores_gemma":[0.00017416336,0.00010271032,0.00005649775,0.00059783773,0.000047368223,0.00028256554,0.00046119167,0.00014122136,0.00009135596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004201799,0.00008947803,0.00011842487,0.00011635076,0.000009175018,0.00018508089,0.0029889517,0.00006728719,0.005263971,0.9869065,0.00013701589,0.004113552],"study_design_scores_gemma":[0.0005499926,0.000047517864,0.00029915688,0.000100867415,0.000003490072,0.000059874477,0.00091201917,0.028066013,0.01802975,0.95006925,0.0015578564,0.0003042201],"about_ca_topic_score_codex":0.0000015138221,"about_ca_topic_score_gemma":0.000020972544,"teacher_disagreement_score":0.19846028,"about_ca_system_score_codex":0.000030773437,"about_ca_system_score_gemma":0.000053312437,"threshold_uncertainty_score":0.41884056},"labels":[],"label_agreement":null},{"id":"W3206275166","doi":"","title":"A method for proving lower bounds for the 2-limited broadcast domination number on grid graphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cartesian product; Grid; Upper and lower bounds; Path (computing); Product (mathematics); Mathematics; Computer science; Yield (engineering); Cartesian coordinate system; Combinatorics; Discrete mathematics; Computer network; Geometry; Physics","score_opus":0.08241547423905698,"score_gpt":0.2687666741549569,"score_spread":0.18635119991589993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206275166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0179055,0.000049332328,0.9779925,0.000386583,0.0010428684,0.001855837,0.000051339724,0.00015525814,0.0005607834],"genre_scores_gemma":[0.8671909,0.00011135201,0.1282361,0.00031274013,0.00020258302,0.00009962472,0.00007354651,0.00006766275,0.0037054822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720615,0.00033645285,0.0002313735,0.001466411,0.00018883796,0.00057076046],"domain_scores_gemma":[0.9949257,0.0023751582,0.0002782137,0.0015995355,0.0006899097,0.0001315007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012693045,0.00036024037,0.00035928094,0.0003200619,0.0005868287,0.0004377214,0.00223554,0.0002644099,0.000018078199],"category_scores_gemma":[0.00028022242,0.00033212712,0.00056800456,0.001050111,0.0001720723,0.00053731556,0.0014059821,0.00062708545,0.000009802591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054090715,0.00025437024,0.00013624695,0.00021671005,0.0002857158,0.000072778,0.000456245,0.0734467,0.0002637907,0.90394276,0.00068749796,0.019696303],"study_design_scores_gemma":[0.0012592225,0.0002094639,0.00017898681,0.00013722618,0.00010373533,0.0000078469875,0.00020575919,0.70956045,0.00088793307,0.28166232,0.005277075,0.0005099794],"about_ca_topic_score_codex":0.00003522109,"about_ca_topic_score_gemma":0.000039074774,"teacher_disagreement_score":0.8497564,"about_ca_system_score_codex":0.0002558052,"about_ca_system_score_gemma":0.00027347798,"threshold_uncertainty_score":0.9999131},"labels":[],"label_agreement":null},{"id":"W3208757949","doi":"10.1007/s00453-022-01045-4","title":"Shortest Beer Path Queries in Outerplanar Graphs","year":2022,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ackermann function; Combinatorics; Mathematics; Path graph; Shortest path problem; Graph; Distance; Inverse; Wheel graph; Discrete mathematics; Graph power; Line graph","score_opus":0.020354054189384185,"score_gpt":0.295687206561516,"score_spread":0.2753331523721318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208757949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04726456,0.0042829663,0.91539675,0.0063902284,0.0068428344,0.0035021238,0.0007289122,0.0019324562,0.013659166],"genre_scores_gemma":[0.588618,0.000851882,0.40279058,0.0013515406,0.00041086503,0.0022309348,0.00048339154,0.00023785839,0.003024936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961539,0.00037751743,0.0004950561,0.001330796,0.00086688006,0.00077586813],"domain_scores_gemma":[0.9972756,0.00027215344,0.00015959573,0.0020216934,0.00009225928,0.00017872582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008463791,0.00042033926,0.00052321295,0.0007481046,0.00018463499,0.00022796365,0.003786861,0.00021494925,0.00016538147],"category_scores_gemma":[0.0000846478,0.00044832364,0.00021608607,0.0009459509,0.00019309559,0.000340307,0.0061857365,0.0019841006,0.000042921365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008405344,0.0008090553,0.011028844,0.00024466272,0.00028598713,0.003584966,0.006034595,0.005315739,0.00020178358,0.6803206,0.0052880365,0.28680164],"study_design_scores_gemma":[0.00051726727,0.00022364597,0.0054712067,0.0001256003,0.000013260171,0.000060986866,0.0002315678,0.039936632,0.00031647403,0.9224233,0.029369963,0.0013101067],"about_ca_topic_score_codex":0.00021205533,"about_ca_topic_score_gemma":0.00005256056,"teacher_disagreement_score":0.54135346,"about_ca_system_score_codex":0.00020737489,"about_ca_system_score_gemma":0.00029163292,"threshold_uncertainty_score":0.99979687},"labels":[],"label_agreement":null},{"id":"W3209535718","doi":"10.1007/978-3-030-89543-3_5","title":"A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Listing (finance); Spanning tree; Gray (unit); Computer science; Combinatorics; Mathematics; Business; Medicine","score_opus":0.03706637153232336,"score_gpt":0.29979928516799187,"score_spread":0.26273291363566853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209535718","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010010194,0.0014359569,0.994346,0.0014040911,0.0013029125,0.0007176901,0.000015023624,0.00006416634,0.00061404175],"genre_scores_gemma":[0.40335503,0.00009862664,0.59299505,0.0015468099,0.0006371296,0.00007645722,0.000003849087,0.00008675021,0.0012003292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960544,0.000097324744,0.00053865736,0.0012910911,0.0012504718,0.00076806673],"domain_scores_gemma":[0.99290013,0.0037224544,0.0004261469,0.0023249243,0.00052528974,0.00010107056],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019455905,0.00043945058,0.0005059363,0.00046546615,0.00080872455,0.00043877107,0.0073792944,0.00018598369,0.0000064285978],"category_scores_gemma":[0.0006834798,0.00026558814,0.00036232825,0.0014724638,0.0019764546,0.00034812326,0.0027366162,0.0009837602,0.0000015126897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016058373,0.000031608415,0.00022953669,0.00009377247,0.000045325283,0.000024663159,0.002003498,0.07672315,0.001605375,0.30817983,0.000026981856,0.6110202],"study_design_scores_gemma":[0.00034647473,0.0001597382,0.00043629875,0.00090598577,0.000019896072,0.00006523522,0.000002733097,0.3708798,0.00918442,0.61553395,0.001897877,0.0005675844],"about_ca_topic_score_codex":0.000021270685,"about_ca_topic_score_gemma":0.0003215799,"teacher_disagreement_score":0.6104526,"about_ca_system_score_codex":0.00011434919,"about_ca_system_score_gemma":0.0005773071,"threshold_uncertainty_score":0.9999796},"labels":[],"label_agreement":null},{"id":"W3210535977","doi":"10.1145/3614094","title":"Recognizing <i>k</i> -Leaf Powers in Polynomial Time, for Constant <i>k</i>","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Combinatorics; Graph; Mathematics; Time complexity; Degree (music); Tree (set theory); Function (biology); Discrete mathematics; Constant (computer programming); Computer science; Physics","score_opus":0.031538997989108974,"score_gpt":0.303262989034617,"score_spread":0.27172399104550804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210535977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021427225,0.000038143357,0.99140966,0.0030827164,0.0007407068,0.00073218206,0.000100320496,0.00063503755,0.0011184836],"genre_scores_gemma":[0.22841683,0.00047164553,0.75792235,0.0023832922,0.0002586187,0.0013581321,0.000053685853,0.00021876159,0.008916706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786615,0.00010302805,0.00033079038,0.0006401014,0.00034288276,0.0007170506],"domain_scores_gemma":[0.9977031,0.0010647445,0.000053754662,0.00093455944,0.00008634401,0.00015753914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007700645,0.00020861898,0.00024834057,0.0007159714,0.0002828209,0.00010176653,0.0012364819,0.00010741861,0.00003945432],"category_scores_gemma":[0.00012080351,0.00021855837,0.00016122032,0.0021490853,0.00012148881,0.00051124784,0.000036563535,0.0003654542,0.00051138544],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018131308,0.00022118367,0.000015811092,0.000024046141,0.000056958783,0.00006896644,0.00063414883,0.0032688235,0.0069656456,0.0017399199,0.0023540854,0.9844691],"study_design_scores_gemma":[0.015524219,0.002726623,0.00052450737,0.00043658572,0.000063358675,0.00018706077,0.0014597293,0.58918494,0.11389314,0.17993183,0.092711896,0.0033560835],"about_ca_topic_score_codex":0.000015731193,"about_ca_topic_score_gemma":0.000015935082,"teacher_disagreement_score":0.981113,"about_ca_system_score_codex":0.000111586625,"about_ca_system_score_gemma":0.00012186659,"threshold_uncertainty_score":0.89125514},"labels":[],"label_agreement":null},{"id":"W3211499386","doi":"","title":"Randomized Communication and the Implicit Graph Conjecture.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Conjecture; Constant (computer programming); Mathematics; Bipartite graph; Adjacency list; Cartesian product; Randomized algorithm; Graph; Bounded function; Discrete mathematics; Upper and lower bounds; Computer science","score_opus":0.05097654668574888,"score_gpt":0.21891114234009823,"score_spread":0.16793459565434934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211499386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1490357,0.0017874861,0.8446603,0.00091552973,0.00015689016,0.0009894203,0.0000045915554,0.00015517623,0.0022948943],"genre_scores_gemma":[0.9939086,0.0033328026,0.0020846596,0.00017298087,0.000015321366,0.000007691374,0.000012943921,0.000013421925,0.0004515766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640816,0.0021255026,0.00022088892,0.0008258133,0.00011832469,0.00030129263],"domain_scores_gemma":[0.99489784,0.0019846102,0.00025345507,0.002532153,0.0002155904,0.000116373354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017661378,0.0002655035,0.0006518187,0.00022171592,0.0003650035,0.00030656927,0.0027740176,0.00019590494,0.000018031129],"category_scores_gemma":[0.00022067409,0.00021040987,0.00035547838,0.0007017389,0.0013497134,0.00031946832,0.0049377372,0.0009606977,0.000007180118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028570504,0.000021591432,0.000061276645,0.000027128712,0.00016965726,0.000041736912,0.00055860245,0.011413626,0.000012508,0.984477,0.000025301213,0.00033453063],"study_design_scores_gemma":[0.049135737,0.0000089979585,0.000072608935,0.000060128106,0.000074430885,0.000013012884,0.00015774717,0.12616302,0.000086547385,0.82390094,0.00006862058,0.00025820307],"about_ca_topic_score_codex":0.0001874431,"about_ca_topic_score_gemma":0.000050565723,"teacher_disagreement_score":0.8448729,"about_ca_system_score_codex":0.000057880683,"about_ca_system_score_gemma":0.00012487984,"threshold_uncertainty_score":0.8580265},"labels":[],"label_agreement":null},{"id":"W3211716743","doi":"10.1016/j.ejc.2021.103467","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e117\" altimg=\"si8.svg\"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> -conjectures on the domination game and claw-free graphs","year":2021,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Conjecture; Combinatorics; Graph; Mathematics; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.01985399388103665,"score_gpt":0.2507570447313059,"score_spread":0.23090305085026924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211716743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94120467,0.004187924,0.009438815,0.0026011574,0.004466699,0.00012140005,0.0002153714,0.0001821267,0.03758183],"genre_scores_gemma":[0.99109226,0.002570988,0.002622355,0.0014862132,0.0011481385,0.00007096522,0.0001247127,0.00044652188,0.00043786786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98919195,0.002063258,0.0020375552,0.0014985781,0.0033496344,0.001859029],"domain_scores_gemma":[0.99036235,0.0027895595,0.0025330414,0.0025111688,0.0007282764,0.0010756328],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005655683,0.0009344223,0.0005567284,0.0006752563,0.0016465358,0.0020785192,0.0041191857,0.0007076594,0.0013970768],"category_scores_gemma":[0.0035053205,0.0011574645,0.0013163418,0.0019204842,0.0015233496,0.0017227068,0.0028984824,0.0031946402,0.0006256271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008089008,0.00053593836,0.000015217557,0.00039673742,0.0007612561,0.003772898,0.0024602483,0.0008923755,0.0017139447,0.96106386,0.022472577,0.005106058],"study_design_scores_gemma":[0.010677815,0.010268783,0.0011837815,0.004399635,0.0019792104,0.010451796,0.004190635,0.4574716,0.39093897,0.051859822,0.052495852,0.004082066],"about_ca_topic_score_codex":0.00004174865,"about_ca_topic_score_gemma":0.000047892892,"teacher_disagreement_score":0.909204,"about_ca_system_score_codex":0.000053978958,"about_ca_system_score_gemma":0.0010588559,"threshold_uncertainty_score":0.99965316},"labels":[],"label_agreement":null},{"id":"W3214559626","doi":"10.1137/20m136373x","title":"Graphon Mean Field Games and Their Equations","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"Air Force Office of Scientific Research; Natural Environment Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Field (mathematics); Mathematical economics; Applied mathematics; Calculus (dental); Mathematical analysis; Pure mathematics","score_opus":0.012380578866352868,"score_gpt":0.25629748069981706,"score_spread":0.2439169018334642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214559626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012323522,0.001179041,0.9924572,0.0044844938,0.00011784541,0.00006278795,0.0000015331381,0.00002221182,0.0004425012],"genre_scores_gemma":[0.96910864,0.001286315,0.02811115,0.0012615717,0.000079041805,0.0000046091445,0.0000016982484,0.0000069804546,0.00014001351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924624,0.00015512838,0.00014306443,0.0001747945,0.00013016735,0.00015060186],"domain_scores_gemma":[0.99903554,0.0004567569,0.000067496745,0.00014598384,0.00018289308,0.00011131611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030357236,0.000083659725,0.00011471326,0.00012518415,0.00027097363,0.00027297653,0.00012555782,0.00003853316,0.000019026753],"category_scores_gemma":[0.0002145648,0.00006329591,0.00003787096,0.00023440918,0.00003064894,0.00041273583,0.000041104726,0.0001888282,0.0000010771986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015574234,0.00013520419,0.00056358025,0.000016561275,0.00012117612,0.000081981496,0.0015843853,0.3590059,0.0024546506,0.36750233,0.00024282979,0.26813564],"study_design_scores_gemma":[0.0014599003,0.0002831289,0.00026548476,0.000039965897,0.0000071892086,0.00015068875,0.00013938325,0.9412454,0.0010759195,0.05474299,0.00045252685,0.00013744456],"about_ca_topic_score_codex":5.5119966e-7,"about_ca_topic_score_gemma":0.0000038619733,"teacher_disagreement_score":0.96787626,"about_ca_system_score_codex":0.000009533436,"about_ca_system_score_gemma":0.000041185034,"threshold_uncertainty_score":0.26323187},"labels":[],"label_agreement":null},{"id":"W3215138631","doi":"10.37236/11946","title":"Almost Every Matroid has an $M(K_4)$- or a $\\mathcal{W}^3$-Minor","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Matroid; Minor (academic); Discrete mathematics; Humanities","score_opus":0.04081058879379447,"score_gpt":0.3119434884356311,"score_spread":0.2711328996418366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215138631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.630517,0.003489472,0.35112816,0.010908842,0.0020439075,0.00060644204,0.0000033165434,0.00046935093,0.0008335234],"genre_scores_gemma":[0.99690473,0.0006948044,0.00021927842,0.00014779672,0.00014714045,0.000008097719,9.23723e-7,0.00003573477,0.0018414855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963898,0.00046519988,0.00053359487,0.00026684336,0.0010876791,0.0012568483],"domain_scores_gemma":[0.99735343,0.000674577,0.00037944593,0.00095311005,0.00040782455,0.00023158411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035326825,0.00022915618,0.00035836126,0.0004187539,0.00045775366,0.00027584806,0.0036529684,0.00008468449,0.00001977969],"category_scores_gemma":[0.00030251802,0.00014381387,0.00018100339,0.0027956073,0.00017907865,0.0010451633,0.00041400577,0.00124634,0.00011401488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016136322,0.00015509463,0.00010724594,0.000013048872,0.000080479535,0.00017294197,0.0006444392,0.00020208133,0.00097176724,0.99174416,0.0017736895,0.003973658],"study_design_scores_gemma":[0.00089481653,0.0018825912,0.00041010618,0.0000251428,0.00001899892,0.0009775491,0.00020210881,0.0043536406,0.0017459809,0.97781813,0.011453079,0.00021785518],"about_ca_topic_score_codex":0.0000037830378,"about_ca_topic_score_gemma":0.000007689876,"teacher_disagreement_score":0.36638775,"about_ca_system_score_codex":0.00034944803,"about_ca_system_score_gemma":0.0013290527,"threshold_uncertainty_score":0.6788185},"labels":[],"label_agreement":null},{"id":"W3217648472","doi":"10.32920/ryerson.14653842.v1","title":"Constraint Satisfaction Problems and Their Reduction to Directed Graphs","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Constraint satisfaction; Backtracking; Constraint satisfaction dual problem; Homomorphism; Constraint graph; Local consistency; Constraint logic programming; Digraph; Constraint programming; Mathematics; Theoretical computer science; Computer science; Discrete mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.03139085037536413,"score_gpt":0.2835385388460185,"score_spread":0.2521476884706544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217648472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23545538,0.00031193328,0.75914687,0.0010928138,0.0007990795,0.00091809756,0.000007761833,0.00072055333,0.0015475324],"genre_scores_gemma":[0.9065346,0.00019257939,0.09277888,0.000057817746,0.00003430519,0.00015297109,0.000012591688,0.000016557373,0.00021966567],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792784,0.00022962729,0.00026028068,0.0010026905,0.00025696028,0.0003226019],"domain_scores_gemma":[0.99845195,0.00008439673,0.00008904301,0.00088505715,0.00028549306,0.00020408492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043506685,0.00026118607,0.00028581012,0.00036535406,0.00013400587,0.00044789517,0.00044164513,0.0001735766,0.000038147784],"category_scores_gemma":[0.00007552895,0.00022253465,0.00008651399,0.00061705057,0.0001336507,0.00029545827,0.0015813045,0.0005865752,0.0000064542205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023171267,0.000087085915,0.00083240034,0.000261046,0.00019569541,0.000016313305,0.006837071,0.0030878333,0.07139134,0.15553729,0.0003225387,0.7614082],"study_design_scores_gemma":[0.0005433559,0.00026216562,0.020426368,0.0006363796,0.0000158947,0.00043027083,0.0016528164,0.026213579,0.0495204,0.89801234,0.0007757936,0.0015106488],"about_ca_topic_score_codex":0.00019565318,"about_ca_topic_score_gemma":0.00012453782,"teacher_disagreement_score":0.7598976,"about_ca_system_score_codex":0.000077998615,"about_ca_system_score_gemma":0.00012581234,"threshold_uncertainty_score":0.90747},"labels":[],"label_agreement":null},{"id":"W33291493","doi":"10.1007/978-1-4419-7997-1_76","title":"Graph Searching and Related Problems","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Toronto Metropolitan University","funders":"","keywords":"Graph; Null graph; Probabilistic logic; Combinatorics; Computer science; Digraph; Complement graph; Theoretical computer science; Mathematics; Discrete mathematics; Voltage graph; Line graph; Artificial intelligence","score_opus":0.01691411052915559,"score_gpt":0.26736804140194065,"score_spread":0.25045393087278506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33291493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17767183,0.00032858213,0.7367141,0.005214492,0.000110394016,0.00076707924,2.782479e-7,0.000641597,0.07855164],"genre_scores_gemma":[0.9475826,0.00003219462,0.047968544,0.00015393272,0.000005476262,0.000034747973,3.3733477e-7,0.0000078496505,0.0042143357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991096,0.00007333371,0.0001004769,0.00025465176,0.0001836469,0.0002782516],"domain_scores_gemma":[0.99937195,0.000107475906,0.000016842034,0.00032501944,0.00005488007,0.00012381925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030814443,0.00006496952,0.00006565633,0.00013983875,0.00011540267,0.00017492352,0.00043491076,0.000026632975,0.00011174218],"category_scores_gemma":[0.000032530726,0.000049698843,0.000020067606,0.0004401851,0.00009063051,0.0008438603,0.0003427655,0.000167536,0.0002164866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.946827e-7,0.000018272316,0.0011735855,0.000011829746,0.000011848962,0.0000038227167,0.0005630843,0.00006670815,0.005888263,0.9205832,0.0005771202,0.07110176],"study_design_scores_gemma":[0.00016339925,0.00004943833,0.0040734904,0.000006993094,4.0124337e-7,0.000027120424,0.000023621926,0.022873338,0.0005774918,0.9716663,0.0004350236,0.0001033928],"about_ca_topic_score_codex":0.000042644893,"about_ca_topic_score_gemma":0.0000021877797,"teacher_disagreement_score":0.76991075,"about_ca_system_score_codex":0.0000062811546,"about_ca_system_score_gemma":0.000011172634,"threshold_uncertainty_score":0.27825695},"labels":[],"label_agreement":null},{"id":"W33743767","doi":"10.1186/s13019-021-01418-w","title":"New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Hamiltonian (control theory); Hamiltonian path; Graph; Connectivity; Pancyclic graph; Discrete mathematics; Line graph; 1-planar graph","score_opus":0.020367679419616945,"score_gpt":0.2765313554340319,"score_spread":0.256163676014415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33743767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9779608,0.00051144283,0.016631167,0.0008932594,0.0014444704,0.0010437863,0.0000379239,0.00056111225,0.00091600994],"genre_scores_gemma":[0.98891634,0.000112683156,0.010013165,0.00024737432,0.0000063391135,0.00010641206,0.000021433414,0.000035360434,0.0005408853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748284,0.0001314064,0.00036127164,0.00078566535,0.00045922975,0.0007796041],"domain_scores_gemma":[0.997536,0.0005739476,0.00012365976,0.0009488711,0.00029720855,0.00052031525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003541008,0.00030478401,0.000351613,0.00048387254,0.00089046493,0.00012244444,0.0010452283,0.00012630521,0.000021796417],"category_scores_gemma":[0.00019152054,0.00031416267,0.00016227976,0.0014387384,0.00039679228,0.0005525517,0.00030261665,0.0002861213,0.000029683331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000224488,0.00012434163,0.002195555,0.000013194917,0.00004059921,0.0000341332,0.0007245645,0.000012829548,0.0016174273,0.9903419,0.0041976585,0.0006753166],"study_design_scores_gemma":[0.00218015,0.00044193794,0.020429904,0.000022130762,0.000010897946,0.00010419105,0.00005483597,0.0012457088,0.002176211,0.9704745,0.0024588108,0.00040074566],"about_ca_topic_score_codex":0.00004625439,"about_ca_topic_score_gemma":0.000020356252,"teacher_disagreement_score":0.019867456,"about_ca_system_score_codex":0.000059060927,"about_ca_system_score_gemma":0.00024156155,"threshold_uncertainty_score":0.99993104},"labels":[],"label_agreement":null},{"id":"W344896498","doi":"10.46298/dmtcs.2073","title":"Uniquely monopolar-partitionable block graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Postdoctoral Science Foundation","keywords":"Combinatorics; Mathematics; Chordal graph; Bipartite graph; Indifference graph; Cograph; Pathwidth; Partition (number theory); Discrete mathematics; Maximal independent set; 1-planar graph; Modular decomposition; Vertex (graph theory); Block graph; Graph; Line graph","score_opus":0.01466658074978645,"score_gpt":0.2808183078698894,"score_spread":0.266151727120103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W344896498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013217893,0.000021387059,0.9687964,0.0009611241,0.0002697321,0.00032668552,0.0000031035916,0.0004141423,0.015989577],"genre_scores_gemma":[0.58895886,0.0000040112404,0.41062933,0.00030220443,0.000033544755,0.000021800264,0.0000010687955,0.000017186123,0.000031991123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541515,0.00025304433,0.000536499,0.0010816612,0.0015253659,0.0011882955],"domain_scores_gemma":[0.99594474,0.00081144145,0.00015210811,0.0020732754,0.00042067288,0.0005977393],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0037454152,0.00035580312,0.00040131315,0.00044290855,0.00085815875,0.0009184926,0.004785634,0.00008713604,0.00006146912],"category_scores_gemma":[0.000446397,0.00028933142,0.00016780084,0.0022863094,0.004153962,0.0012326174,0.0019624315,0.00040251316,0.00023932668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037901416,0.0000916354,0.000023770493,0.000028585282,0.000007130392,0.0000058083106,0.00044428394,0.00021186951,0.0010265023,0.9957051,0.000053774525,0.0023977382],"study_design_scores_gemma":[0.00012937671,0.000115458766,0.000034722085,0.000033823333,0.0000037593031,0.00003134379,0.000011671984,0.42590192,0.0031835844,0.57018536,0.0001408888,0.0002280823],"about_ca_topic_score_codex":0.0000016752058,"about_ca_topic_score_gemma":5.295647e-7,"teacher_disagreement_score":0.575741,"about_ca_system_score_codex":0.00005918197,"about_ca_system_score_gemma":0.00012451413,"threshold_uncertainty_score":0.9999559},"labels":[],"label_agreement":null},{"id":"W34914328","doi":"","title":"Maximally local-edge-connected graphs and digraphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Telecommunications","score_opus":0.010867030066820205,"score_gpt":0.24752762622162705,"score_spread":0.23666059615480683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34914328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93745613,0.00073801714,0.05574688,0.0009780142,0.0010051682,0.00039865848,0.0000029662808,0.0006649146,0.0030092434],"genre_scores_gemma":[0.9944931,0.000095571995,0.0051118187,0.00019392381,0.0000022660322,0.000027990978,0.000002302451,0.000021532189,0.00005149073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808085,0.00009284052,0.00023544765,0.00061347755,0.00040651392,0.0005708493],"domain_scores_gemma":[0.9984934,0.0001680057,0.00006973887,0.0008307976,0.00016221878,0.0002758516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003572472,0.00022700823,0.00023624607,0.00034479442,0.00024937472,0.00016227002,0.0010562342,0.00009802011,0.000007721575],"category_scores_gemma":[0.00009717138,0.0002216187,0.00008289603,0.0014653647,0.00037815463,0.0006934495,0.00045484913,0.0003080675,0.00005980805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152018965,0.00009332823,0.00079452497,0.000011466335,0.000022545297,0.00006295184,0.00025542494,0.000028738325,0.00069960195,0.98979974,0.000068993744,0.0081475],"study_design_scores_gemma":[0.0015209815,0.0002253567,0.0048864577,0.00002512519,0.0000043347054,0.00003984012,0.000032753094,0.00025312076,0.0046962714,0.98761284,0.0004330975,0.00026981227],"about_ca_topic_score_codex":0.000039157476,"about_ca_topic_score_gemma":0.000012818369,"teacher_disagreement_score":0.057036962,"about_ca_system_score_codex":0.00005850769,"about_ca_system_score_gemma":0.00009086098,"threshold_uncertainty_score":0.9037348},"labels":[],"label_agreement":null},{"id":"W34988218","doi":"10.1183/23120541.00511-2021","title":"Extremal Size In Graphs With Bounded Degree.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European and Developing Countries Clinical Trials Partnership","keywords":"Mathematics; Degree (music); Bounded function; Combinatorics; Mathematical analysis","score_opus":0.016480262883457268,"score_gpt":0.2541906489632152,"score_spread":0.23771038607975792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34988218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98330754,0.0001840651,0.0038756535,0.00031389302,0.0004198299,0.00029046857,9.126055e-7,0.00020970085,0.011397908],"genre_scores_gemma":[0.98944944,0.000004330148,0.009990064,0.000052942425,0.0000041220906,0.000035885754,0.0000011844011,0.000017635086,0.0004444215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812686,0.00013475602,0.00021916209,0.0004802533,0.00047808661,0.0005608777],"domain_scores_gemma":[0.9986602,0.00034330992,0.00006476841,0.00074321724,0.00009532213,0.0000931675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003940558,0.00018004957,0.00020295696,0.00020641927,0.00012364011,0.00013467492,0.0010122362,0.000065454646,0.000014860408],"category_scores_gemma":[0.000057212746,0.00015898241,0.00004956509,0.0014768688,0.00016648741,0.0005895904,0.00020913221,0.00027314664,0.000038258713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003168939,0.00014309467,0.021004783,0.0000055195974,0.000005444747,0.0001319378,0.00005941498,0.000024144203,0.00041340047,0.97681344,0.00016516875,0.0012019839],"study_design_scores_gemma":[0.0013293066,0.0001454883,0.044637553,0.000020242665,0.0000015464375,0.000019424226,0.000012907759,0.00053012546,0.0012494506,0.95148724,0.00035600137,0.00021070665],"about_ca_topic_score_codex":0.00012818558,"about_ca_topic_score_gemma":0.00017274015,"teacher_disagreement_score":0.025326172,"about_ca_system_score_codex":0.0000783872,"about_ca_system_score_gemma":0.00009185417,"threshold_uncertainty_score":0.64831144},"labels":[],"label_agreement":null},{"id":"W35341376","doi":"10.1177/00469580221086922","title":"On Connected [k, k+1]-Factors in Claw-Free Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Apoio à Pesquisa do Estado da Paraíba; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Claw; Mathematics; Combinatorics; Biology; Ecology","score_opus":0.023810903285058988,"score_gpt":0.26164254658796327,"score_spread":0.23783164330290427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35341376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890531,0.0001273769,0.0003412911,0.000533413,0.001203886,0.00027263502,0.0000028949426,0.00028680614,0.0081786495],"genre_scores_gemma":[0.99892694,0.000023784209,0.0005793581,0.00016824117,0.000002360124,0.000022730364,0.0000017334021,0.000020258329,0.00025461556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783975,0.00022896145,0.00026095143,0.00055239233,0.00052105135,0.00059687864],"domain_scores_gemma":[0.99744177,0.00072876335,0.00006869642,0.0015040684,0.00008198322,0.00017472846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032246296,0.00021803411,0.00024679504,0.00047211608,0.00012857717,0.00009082832,0.0021033424,0.000107319516,0.000114345465],"category_scores_gemma":[0.0005474984,0.00020723004,0.00008635514,0.0017482638,0.00011917588,0.00047050853,0.00039817338,0.0004625542,0.0001815964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009384362,0.0002197811,0.0048979213,0.00000432265,0.000008900278,0.00004918613,0.00033375173,0.000021434362,0.00017620783,0.99140376,0.0021344256,0.00074094464],"study_design_scores_gemma":[0.0014433954,0.00024173805,0.0070971027,0.000021976877,0.0000011720425,0.0000030319266,0.000018417044,0.0025069749,0.0017918613,0.98627555,0.0003590702,0.0002397106],"about_ca_topic_score_codex":0.000020053547,"about_ca_topic_score_gemma":0.000014086895,"teacher_disagreement_score":0.009873872,"about_ca_system_score_codex":0.000094713614,"about_ca_system_score_gemma":0.000016863502,"threshold_uncertainty_score":0.8450596},"labels":[],"label_agreement":null},{"id":"W35665625","doi":"10.1016/j.ejmp.2022.05.017","title":"Acyclic Domination Number and Minimum Degree in 2-Diameter-Critical Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.031746575799540606,"score_gpt":0.3052332758681095,"score_spread":0.2734867000685689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35665625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919525,0.00014548478,0.004009485,0.0005417945,0.0005966676,0.0001850879,0.0000010183904,0.00008853216,0.0024794233],"genre_scores_gemma":[0.9915242,0.00006435749,0.008185773,0.00008744924,0.000003797644,0.00003310453,0.0000010448855,0.000013048105,0.00008720232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983139,0.0002035848,0.0002345579,0.0004559588,0.00036008836,0.00043189048],"domain_scores_gemma":[0.9984963,0.0007185121,0.000035886012,0.0004966095,0.00009459445,0.00015813208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041753918,0.00014968119,0.00020101764,0.00023292124,0.00015591658,0.000057768288,0.0005784339,0.000087930435,0.000013579859],"category_scores_gemma":[0.0004183466,0.00015416107,0.00004756847,0.00083775056,0.0003387926,0.0007653138,0.00029387054,0.00026767555,0.0000600367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144696505,0.00013132552,0.025518285,0.000009649598,0.000004786781,0.000119808145,0.00044331496,5.2638e-7,0.0005059936,0.9657646,0.00019301879,0.007294229],"study_design_scores_gemma":[0.0009934411,0.00008028244,0.05982802,0.000017535142,0.0000016761613,0.000100380756,0.000019729763,0.0011399394,0.0013167674,0.93618214,0.00013501014,0.00018505099],"about_ca_topic_score_codex":0.0000150773485,"about_ca_topic_score_gemma":0.000005070305,"teacher_disagreement_score":0.034309734,"about_ca_system_score_codex":0.000047201815,"about_ca_system_score_gemma":0.00004182608,"threshold_uncertainty_score":0.6286506},"labels":[],"label_agreement":null},{"id":"W35857846","doi":"10.1126/sciadv.abo4459","title":"Total Perfect Codes in Tensor Products of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of General Medical Sciences; National Institute on Aging","keywords":"Mathematics; Combinatorics; Discrete mathematics; Tensor product; Vertex (graph theory); Graph; Pure mathematics","score_opus":0.02030590098042657,"score_gpt":0.2640185442954222,"score_spread":0.24371264331499565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35857846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9977236,0.00025739806,0.00018510896,0.00018236085,0.0004694667,0.00023650686,0.0000014234092,0.000072691226,0.00087145774],"genre_scores_gemma":[0.99688137,0.000039291775,0.0028417653,0.000016995431,0.0000029334237,0.000019145153,9.4900105e-7,0.000010935469,0.000186636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984489,0.00016050506,0.00023843731,0.00040015677,0.00038996388,0.0003620478],"domain_scores_gemma":[0.9987794,0.0001752247,0.000070149086,0.0007132151,0.00018828483,0.00007369238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042214844,0.00013021278,0.0002442894,0.00028811087,0.00008794765,0.000014315146,0.0007619973,0.000049777624,0.0000055852965],"category_scores_gemma":[0.0002773437,0.0001234535,0.000057109854,0.0014425642,0.00023602201,0.00039591562,0.00024729682,0.00021628199,0.00002144853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024066412,0.00022563848,0.033398207,0.00002404291,0.000010677006,0.000077973986,0.00068320497,0.0000394425,0.006059492,0.95838493,0.00023090656,0.00084143784],"study_design_scores_gemma":[0.0011986094,0.00037952777,0.102168955,0.000035168356,0.000002062073,0.00010342768,0.000031200216,0.00095809915,0.04885723,0.845886,0.00011296942,0.0002667855],"about_ca_topic_score_codex":0.000027014621,"about_ca_topic_score_gemma":0.000002109087,"teacher_disagreement_score":0.11249895,"about_ca_system_score_codex":0.000034353023,"about_ca_system_score_gemma":0.00010156926,"threshold_uncertainty_score":0.50342876},"labels":[],"label_agreement":null},{"id":"W36880984","doi":"10.1111/dgd.12848","title":"Theorems and computations in circular colourings of graphs","year":2007,"lang":"en","type":"dissertation","venue":"Development Growth & Differentiation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fondation Maladies Rares","keywords":"Combinatorics; Mathematics; Foster graph; Discrete mathematics; Graph; Lemma (botany); Friendship graph; Graph power; Line graph","score_opus":0.012098582545925135,"score_gpt":0.2794793296674278,"score_spread":0.2673807471215026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36880984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83075404,0.0002854669,0.16695659,0.000019668334,0.0002785903,0.00050765544,0.0000025804961,0.0000649255,0.0011304718],"genre_scores_gemma":[0.9869724,0.00009592028,0.012157168,0.000015794536,0.0000084595595,0.00005861921,0.0004836912,0.00002465355,0.00018327782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9977326,0.00011112935,0.00064933504,0.00053325825,0.0006247583,0.00034896366],"domain_scores_gemma":[0.9987799,0.0001958876,0.00037492145,0.00025261525,0.00031011587,0.000086537984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059332204,0.0002748002,0.0003643332,0.0014199065,0.00013277722,0.000078363344,0.00053568225,0.00021407355,0.000008644012],"category_scores_gemma":[0.000081522805,0.00029014423,0.00006202689,0.0009910994,0.000055847522,0.00031851372,0.00010615259,0.0003073871,0.000004803306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001168704,0.00043393482,0.0657612,0.0012989315,0.00020356126,0.000026324764,0.018441675,0.000051824907,0.007134403,0.8562036,0.00002278081,0.050304905],"study_design_scores_gemma":[0.00067153975,0.000038098573,0.80149627,0.0002895332,0.000013430218,0.000003570051,0.00024365987,0.0013707756,0.025111767,0.17031898,0.000030110177,0.00041229252],"about_ca_topic_score_codex":0.000016101023,"about_ca_topic_score_gemma":0.000085134765,"teacher_disagreement_score":0.73573506,"about_ca_system_score_codex":0.000103819344,"about_ca_system_score_gemma":0.00016328873,"threshold_uncertainty_score":0.99995506},"labels":[],"label_agreement":null},{"id":"W369866893","doi":"10.1007/978-3-540-93952-8","title":"Graph Factors and Matching Extensions","year":2009,"lang":"en","type":"book","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matching (statistics); Computer science; Graph; Graph theory; Theoretical computer science; Mathematics; Combinatorics; Statistics","score_opus":0.02745059931612261,"score_gpt":0.28994935403746575,"score_spread":0.26249875472134315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W369866893","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022502609,0.00069413596,0.40075523,0.000267647,0.00012310133,0.00025674037,0.0000035453106,0.00039888048,0.59727573],"genre_scores_gemma":[0.0013589025,0.0002726209,0.044355996,0.00040062005,0.000053653814,0.000003881756,0.000010430499,0.000031181462,0.9535127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845546,0.00004848754,0.0001779966,0.0005868199,0.0003817714,0.00034948043],"domain_scores_gemma":[0.9985575,0.00032144622,0.00006706241,0.0007869463,0.00007212382,0.00019493072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019776031,0.0002724428,0.00029165554,0.00039598066,0.00019346469,0.00015600232,0.0008883947,0.0001687333,0.000035771664],"category_scores_gemma":[0.000026482674,0.00020634964,0.00010535669,0.00016751762,0.000113652815,0.0003456747,0.0004910567,0.00051445223,0.000038379127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012512171,0.000009209834,0.000011977054,0.000010791126,0.000014629664,0.00003512593,0.00015139065,0.000005933928,0.000036888465,0.97429466,0.012097544,0.013330574],"study_design_scores_gemma":[0.000066081244,0.0000492644,0.0002775415,0.00004991558,0.0000039220677,0.000018894667,0.000009666228,0.00007802735,0.000035295052,0.9733487,0.025801666,0.00026106145],"about_ca_topic_score_codex":0.000006416384,"about_ca_topic_score_gemma":0.000011530439,"teacher_disagreement_score":0.3563992,"about_ca_system_score_codex":0.000038193284,"about_ca_system_score_gemma":0.00011670695,"threshold_uncertainty_score":0.8414694},"labels":[],"label_agreement":null},{"id":"W37360314","doi":"10.1007/s41870-023-01336-1","title":"Graph decompositions through prescribed vertices without isolates.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.02692470145932538,"score_gpt":0.2861416189690892,"score_spread":0.25921691750976383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37360314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76340854,0.0046924613,0.157722,0.0052246866,0.0056321123,0.0015444446,0.000014869522,0.0023416514,0.05941922],"genre_scores_gemma":[0.98386204,0.00011039567,0.015256452,0.0002566583,0.000007743038,0.000053111627,0.0000020476386,0.000022306947,0.00042926616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809545,0.00017578085,0.00025829748,0.00052712637,0.00036941198,0.000573908],"domain_scores_gemma":[0.9983423,0.00022104684,0.00007904782,0.00104176,0.00014927304,0.00016661368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019811216,0.00020703016,0.00021937853,0.00014091603,0.00039421458,0.00021899659,0.0014894126,0.00007978401,0.00010624147],"category_scores_gemma":[0.000067916386,0.00020280281,0.000110380475,0.0009841237,0.00016947972,0.001583516,0.00037497864,0.0003013137,0.0003808407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008271263,0.00022442096,0.0010986569,0.00000877355,0.000036691355,0.000015413681,0.0008456447,0.000034443445,0.0012518156,0.9931067,0.0021768794,0.0011922539],"study_design_scores_gemma":[0.0008123932,0.00017258483,0.0005102298,0.000024799918,0.00000920116,0.000020137526,0.000022013877,0.012082075,0.003994584,0.97906935,0.003002192,0.00028044812],"about_ca_topic_score_codex":0.000018983732,"about_ca_topic_score_gemma":0.0000036660697,"teacher_disagreement_score":0.22045347,"about_ca_system_score_codex":0.000048371337,"about_ca_system_score_gemma":0.000018152601,"threshold_uncertainty_score":0.82700586},"labels":[],"label_agreement":null},{"id":"W38533780","doi":"10.37201/req/149.2023","title":"Upper bounds on the domination number of a graph in terms of order and minimum degree.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Graph; Order (exchange); Physics","score_opus":0.013871727514548926,"score_gpt":0.27393067211615574,"score_spread":0.26005894460160683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38533780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919934,0.000031048636,0.00062911265,0.0003427012,0.00017242985,0.00017802251,0.000001320005,0.000012594445,0.0066393265],"genre_scores_gemma":[0.99873877,0.000007970717,0.0010799712,0.000026517664,0.0000020768196,0.000016721851,8.104483e-7,0.0000068396675,0.000120299126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893767,0.0001365655,0.00022543097,0.00020954806,0.00030299567,0.00018781771],"domain_scores_gemma":[0.99894613,0.00041509478,0.00009804336,0.00042294685,0.000093485876,0.000024308292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051591505,0.00009373913,0.00015113551,0.00015389248,0.000050377803,0.00002570589,0.00045621744,0.000048365448,0.000009646949],"category_scores_gemma":[0.00008898339,0.00006886352,0.000035959365,0.00084467337,0.00021498067,0.00020070205,0.00013995172,0.00012633784,0.0000040046048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020850752,0.00012577462,0.04239977,0.000010126117,0.0000048911697,0.000002430461,0.00018407617,0.0000060189172,0.0011374791,0.95463145,0.00010915249,0.0013680016],"study_design_scores_gemma":[0.0006448603,0.00007413474,0.061654933,0.000029484336,0.0000015582975,0.0000031974716,0.00001961406,0.0006177621,0.005909868,0.93091685,0.00005668573,0.00007105099],"about_ca_topic_score_codex":0.000049322218,"about_ca_topic_score_gemma":0.000014957347,"teacher_disagreement_score":0.023714574,"about_ca_system_score_codex":0.000019180807,"about_ca_system_score_gemma":0.000020429597,"threshold_uncertainty_score":0.2808173},"labels":[],"label_agreement":null},{"id":"W39381033","doi":"10.3389/fnume.2024.1324698","title":"A Note on the Unit Interval Number and Proper Interval Number of Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Heart, Lung, and Blood Institute","keywords":"Mathematics; Interval (graph theory); Unit interval; Unit (ring theory); Combinatorics; Discrete mathematics; Mathematics education","score_opus":0.021097818232278666,"score_gpt":0.29992475290418696,"score_spread":0.2788269346719083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39381033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9761181,0.000022800556,0.00024418213,0.0008997058,0.00035696808,0.0002703591,0.0000029033154,0.000071611335,0.022013359],"genre_scores_gemma":[0.99774885,0.000024346744,0.00080416625,0.00026566864,0.0000050376366,0.000026380596,7.6038907e-7,0.00001863479,0.0011061296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827933,0.00030892968,0.00025552118,0.0003843287,0.0004190154,0.0003528437],"domain_scores_gemma":[0.9985599,0.0003452338,0.00006680059,0.00082340516,0.00009743823,0.000107235224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059381133,0.00018523147,0.00022396477,0.000058378682,0.00014038534,0.000090899346,0.0011501603,0.00006673152,0.00047105324],"category_scores_gemma":[0.000077346,0.00012542562,0.000095850926,0.0006203796,0.00034851977,0.000355401,0.00035612175,0.00038592378,0.000320565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007334074,0.00013593366,0.0044502295,0.000012259464,0.000027386674,0.000012840228,0.0008329102,0.0000027348722,0.00014920934,0.97774,0.00048155335,0.0160816],"study_design_scores_gemma":[0.00069912086,0.00019472736,0.0036137963,0.0000889584,0.0000058739006,0.00004254666,0.00004152535,0.00091403734,0.0032170883,0.9873735,0.0036094068,0.00019944858],"about_ca_topic_score_codex":0.000029852552,"about_ca_topic_score_gemma":0.000003189196,"teacher_disagreement_score":0.021630764,"about_ca_system_score_codex":0.000022066162,"about_ca_system_score_gemma":0.00003722114,"threshold_uncertainty_score":0.51577026},"labels":[],"label_agreement":null},{"id":"W4205106693","doi":"10.1016/s0012-365x(04)00022-6","title":"Absorbing sets in arc-coloured tournaments*1","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Combinatorics; Monochromatic color; Arc (geometry); Path (computing); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.02730265602279779,"score_gpt":0.31723079426519624,"score_spread":0.28992813824239844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205106693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21378796,0.00011637822,0.77867377,0.0009949671,0.00011114539,0.0003762097,0.0000029834314,0.00014968652,0.0057868958],"genre_scores_gemma":[0.8016147,0.000027758984,0.19803174,0.00010721295,0.0000140644825,0.00003020738,0.000001608559,0.000020039446,0.00015265965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846673,0.00004321702,0.00033295687,0.00028135386,0.00042122448,0.0004545184],"domain_scores_gemma":[0.9989903,0.00011470942,0.00010037162,0.0006444457,0.000040010702,0.00011014796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005340279,0.00015308124,0.00021148713,0.00020832407,0.00008641499,0.00013573648,0.0009867795,0.00005265833,0.00001582387],"category_scores_gemma":[0.0001526629,0.00013393458,0.00006782106,0.0005686914,0.000064499174,0.00041613582,0.00032951604,0.00024467983,0.00011349736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064074657,0.0001807097,0.00019503514,0.00008301591,0.0000185929,0.00014639045,0.007651407,0.0018361717,0.0019091739,0.9853745,0.000039333067,0.0025592556],"study_design_scores_gemma":[0.0007463582,0.000056814966,0.00033036768,0.00015748202,0.0000024664769,0.00003216813,0.00037191756,0.011190339,0.0032235957,0.98355114,0.00012246011,0.00021487815],"about_ca_topic_score_codex":0.0000072405255,"about_ca_topic_score_gemma":0.000014651489,"teacher_disagreement_score":0.5878267,"about_ca_system_score_codex":0.00013137936,"about_ca_system_score_gemma":0.000057840753,"threshold_uncertainty_score":0.54616934},"labels":[],"label_agreement":null},{"id":"W4205253237","doi":"10.1016/s0012-365x(04)00143-8","title":"The structure of strong arc-locally semicomplete digraphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Arc (geometry); Digraph; Combinatorics; Vertex (graph theory); Class (philosophy); Generalization; Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.0176590252653728,"score_gpt":0.2834667429367344,"score_spread":0.26580771767136163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205253237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067484245,0.0001735868,0.9296872,0.00041551722,0.00009235374,0.0003101569,0.000024210294,0.00009205203,0.0017206884],"genre_scores_gemma":[0.8844929,0.000021872533,0.11535447,0.000025984933,0.00001839893,0.0000041465673,0.0000023960165,0.000017024633,0.000062827756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983603,0.000050408085,0.00037655677,0.00024428449,0.00055765937,0.00041079894],"domain_scores_gemma":[0.99816567,0.00031867457,0.00019012942,0.0011176708,0.00011491353,0.000092954004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027915317,0.00017241697,0.00021966208,0.000082892344,0.00023545505,0.00012377961,0.0017806973,0.00004907174,0.0000062610948],"category_scores_gemma":[0.00013350182,0.00010748918,0.00012255865,0.0004792047,0.00032135856,0.00023525328,0.00039891616,0.0002368112,0.000009323907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045285306,0.000019596335,0.000028802677,0.00004748446,0.000028383638,0.0000031840725,0.0010961452,0.00084036915,0.008308822,0.98809195,0.000012414933,0.0015183268],"study_design_scores_gemma":[0.0003013628,0.000072746254,0.00007833218,0.00006961339,0.000006174345,0.000017998733,0.0003314074,0.0062386487,0.01712655,0.97542346,0.00018399577,0.0001497249],"about_ca_topic_score_codex":0.0000041284084,"about_ca_topic_score_gemma":0.000017499435,"teacher_disagreement_score":0.8170086,"about_ca_system_score_codex":0.00003145149,"about_ca_system_score_gemma":0.00006628592,"threshold_uncertainty_score":0.43832815},"labels":[],"label_agreement":null},{"id":"W4205300480","doi":"10.1016/j.jctb.2015.02.003","title":"Projective geometries in exponentially dense matroids. I","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Rank (graph theory); Graphic matroid; Integer (computer science); Prime (order theory); Prime power; Matroid partitioning; Discrete mathematics; Computer science","score_opus":0.02429588280191961,"score_gpt":0.28916004476698653,"score_spread":0.2648641619650669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205300480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82249385,0.001907402,0.15350676,0.0010378873,0.014716516,0.0006108785,0.000003923066,0.00012029924,0.005602508],"genre_scores_gemma":[0.9923814,0.00005000242,0.0068464587,0.000039448205,0.00036593663,0.000007444596,3.2626284e-7,0.000019318828,0.00028968474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712163,0.0007337147,0.0006206255,0.00021830226,0.0008984027,0.00040734452],"domain_scores_gemma":[0.9974904,0.0004949396,0.00042044817,0.00042553752,0.0009148871,0.00025376535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049241874,0.00018864176,0.00043308258,0.0008516629,0.00008027111,0.0001980971,0.0014368518,0.00009456183,0.000013239405],"category_scores_gemma":[0.0020906192,0.00016033542,0.00013435773,0.0014250453,0.00025691395,0.00261326,0.00039025405,0.0005270659,0.000013277748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023413545,0.00017595838,0.0004997681,0.000008660579,0.00004458989,0.00029255744,0.0024368905,0.000086882836,0.00077624584,0.990862,0.00026176372,0.0022133172],"study_design_scores_gemma":[0.0022340266,0.0014067728,0.0002551402,0.00003805214,0.0000061094865,0.00028700172,0.001086078,0.000018894183,0.008932978,0.98177963,0.0037801906,0.00017513987],"about_ca_topic_score_codex":0.0000039089764,"about_ca_topic_score_gemma":0.0000021548847,"teacher_disagreement_score":0.16988754,"about_ca_system_score_codex":0.00022293144,"about_ca_system_score_gemma":0.0006095797,"threshold_uncertainty_score":0.65382886},"labels":[],"label_agreement":null},{"id":"W4205569288","doi":"","title":"Pure pairs VI. Excluding an ordered tree","year":2022,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Combinatorics; Mathematics; Subject (documents); Tree (set theory); Discrete mathematics; Computer science; Library science","score_opus":0.043204147124573516,"score_gpt":0.27800537100088335,"score_spread":0.23480122387630983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205569288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4429119,0.000114463845,0.4622646,0.0041802535,0.00026619813,0.0017767041,0.0005696479,0.0006747084,0.087241545],"genre_scores_gemma":[0.93917155,0.00052219845,0.05137083,0.000050085906,0.000045652952,0.0000016834641,0.0001356025,0.000049644557,0.008652735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920556,0.0025453442,0.00021600862,0.0013353075,0.002275668,0.001572057],"domain_scores_gemma":[0.9957531,0.0008107854,0.00021949275,0.0018447228,0.00056690676,0.00080495706],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0025804366,0.0003389632,0.00051661854,0.002568779,0.004547915,0.00009887298,0.008097508,0.000110462526,0.0006789106],"category_scores_gemma":[0.00014005696,0.00047229597,0.00034666757,0.0043558134,0.0014148352,0.0025055078,0.009212619,0.0019014667,0.000016596307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041524153,0.0019308717,0.010893645,0.00024253021,0.0005060593,0.005495704,0.023500137,0.0040738564,0.01132613,0.7782014,0.010367887,0.1493094],"study_design_scores_gemma":[0.0061218296,0.004841125,0.00986659,0.000082984996,0.00004890418,0.00015712905,0.10816243,0.065720014,0.0003296073,0.12930518,0.67386705,0.0014971477],"about_ca_topic_score_codex":0.0004500015,"about_ca_topic_score_gemma":0.0011950791,"teacher_disagreement_score":0.6634992,"about_ca_system_score_codex":0.0006756668,"about_ca_system_score_gemma":0.0007817035,"threshold_uncertainty_score":0.99977285},"labels":[],"label_agreement":null},{"id":"W4205679529","doi":"10.1007/978-3-030-93176-6_35","title":"An Efficient Oracle for Counting Shortest Paths in Planar Graphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Voronoi diagram; Planar graph; Shortest path problem; Mathematics; Path (computing); Binary logarithm; Planar; Discrete mathematics; Computer science; Graph; Geometry","score_opus":0.022331315858264866,"score_gpt":0.29187573104238107,"score_spread":0.2695444151841162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205679529","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013462424,0.00065160164,0.99529475,0.00024116016,0.0009805091,0.00079350604,0.000018801076,0.00014304413,0.00053035875],"genre_scores_gemma":[0.34811747,0.0000430104,0.6504156,0.00086774887,0.0002745529,0.00006218303,0.000027957609,0.00007970191,0.00011177248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441284,0.000083814964,0.00065187796,0.0023553395,0.0012859268,0.0012102223],"domain_scores_gemma":[0.99587464,0.0012259352,0.00023767985,0.001939217,0.00046449655,0.00025800825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023921083,0.0005641007,0.000656164,0.0015283073,0.00035990478,0.00073211367,0.004364946,0.00031694467,0.000010932221],"category_scores_gemma":[0.00023619451,0.0005565991,0.00016591161,0.0015968246,0.00075453176,0.0006442821,0.00082341064,0.0010194022,0.000009389059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024984383,0.00016662512,0.00047700305,0.00008393346,0.0000118749285,0.00043761896,0.001147427,0.24374388,0.00093939726,0.28474468,0.0000063354246,0.4682162],"study_design_scores_gemma":[0.00034850082,0.0002481952,0.00020049725,0.00038034577,0.000003446293,0.000049546943,0.0000011791286,0.7308101,0.001125095,0.26576117,0.0004142,0.00065770437],"about_ca_topic_score_codex":0.000020547663,"about_ca_topic_score_gemma":0.0002711595,"teacher_disagreement_score":0.48706624,"about_ca_system_score_codex":0.0003406458,"about_ca_system_score_gemma":0.0007497625,"threshold_uncertainty_score":0.99968857},"labels":[],"label_agreement":null},{"id":"W4205686199","doi":"10.1016/j.procs.2021.11.008","title":"Treelength of Series-parallel Graphs","year":2021,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Ministry of Communications and Information, Singapore; Ministerul Cercetării şi Inovării; Providence Health Care","keywords":"Chordal graph; Combinatorics; Pathwidth; Indifference graph; Mathematics; Metric dimension; Cograph; Modular decomposition; Discrete mathematics; Outerplanar graph; Partial k-tree; Planar graph; Treewidth; Split graph; Clique-sum; Tree-depth; 1-planar graph; Graph; Line graph","score_opus":0.01713181673032898,"score_gpt":0.2728725849228167,"score_spread":0.2557407681924877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205686199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025806164,0.00025895523,0.97038805,0.0006737268,0.00060258416,0.00016141056,0.0000019887764,0.00018808205,0.00191905],"genre_scores_gemma":[0.44728512,0.000051546023,0.55232966,0.00014725405,0.00004639971,0.0000140032125,7.1589e-7,0.000007747232,0.000117590986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996977,0.00006929663,0.0003235541,0.0009273624,0.0010403402,0.0006624529],"domain_scores_gemma":[0.9974163,0.00013578057,0.000121717145,0.0011522396,0.00091284944,0.00026108912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008559669,0.00017901802,0.00025507648,0.0003663751,0.00030613958,0.00021995715,0.003075014,0.000041360432,0.000011507557],"category_scores_gemma":[0.00017769242,0.00016803379,0.00009536185,0.004720616,0.0008684807,0.0021880313,0.001616299,0.00020054568,0.000026264472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012464106,0.00014879827,0.0012321889,0.000058188918,0.000011560227,0.000069688285,0.0008235785,0.0005921241,0.013678332,0.87816346,0.00015577595,0.10505385],"study_design_scores_gemma":[0.0012149414,0.00068837666,0.012771444,0.00012243316,0.000008167043,0.00073847093,0.00007126639,0.23104976,0.30022478,0.4482982,0.00382877,0.0009834346],"about_ca_topic_score_codex":0.0000022686988,"about_ca_topic_score_gemma":0.000005394064,"teacher_disagreement_score":0.42986527,"about_ca_system_score_codex":0.000038234404,"about_ca_system_score_gemma":0.0007206199,"threshold_uncertainty_score":0.68522185},"labels":[],"label_agreement":null},{"id":"W4205716054","doi":"10.1016/j.dam.2009.08.002","title":"On well-covered triangulations: Part III","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Triangulation; Degree (music); Discrete mathematics; Geometry","score_opus":0.01805474444878341,"score_gpt":0.2866769156131945,"score_spread":0.2686221711644111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205716054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022548905,0.0000058672586,0.8360876,0.00039148383,0.00030960114,0.0007537405,0.00000839925,0.0003482888,0.13954616],"genre_scores_gemma":[0.67648625,0.000007103285,0.32089406,0.00030410598,0.00013845687,0.00021738722,0.000016399457,0.000049060138,0.0018871533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983419,0.000017841141,0.000348302,0.00039055222,0.0005103473,0.00039104983],"domain_scores_gemma":[0.9977059,0.00055852585,0.00014571658,0.0013957742,0.000050874685,0.00014320291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049148005,0.0002009084,0.00024194493,0.00014572458,0.00019810158,0.00016114001,0.001044754,0.00009663949,0.00019993367],"category_scores_gemma":[0.00014118651,0.0001680242,0.00008852206,0.0004542264,0.00011329627,0.00019893733,0.00024262634,0.00039340733,0.00069163425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013752636,0.00008077099,0.0000011116837,0.000018308385,0.000013747486,0.0000028970178,0.000398762,0.00007511251,0.0056137918,0.99106765,0.00078882463,0.0019253009],"study_design_scores_gemma":[0.0007348259,0.000038758826,0.000018799812,0.000016903115,0.0000067667916,0.0000047146345,0.00009147038,0.011279664,0.00996228,0.9731648,0.0044265883,0.00025441786],"about_ca_topic_score_codex":9.865151e-7,"about_ca_topic_score_gemma":0.000002106132,"teacher_disagreement_score":0.65393734,"about_ca_system_score_codex":0.000017760414,"about_ca_system_score_gemma":0.000040721363,"threshold_uncertainty_score":0.88897896},"labels":[],"label_agreement":null},{"id":"W4205800876","doi":"10.1016/j.jctb.2010.08.001","title":"On inequivalent representations of matroids over non-prime fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Prime (order theory); Combinatorics; Finite field; Mathematics; Order (exchange); Mace; Graphic matroid; Field (mathematics); Discrete mathematics; Pure mathematics","score_opus":0.009937836447893521,"score_gpt":0.3008611600237114,"score_spread":0.29092332357581785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205800876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8984709,0.000044527835,0.083253406,0.000691592,0.0112261595,0.00019971558,0.000004231282,0.000031373474,0.0060781455],"genre_scores_gemma":[0.99514747,0.000016225777,0.0040876046,0.000049392333,0.00034849206,0.000003002215,3.6078995e-7,0.000012442424,0.00033499248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981441,0.00023645151,0.00054968806,0.00016822129,0.000664884,0.0002366801],"domain_scores_gemma":[0.99737597,0.0008289797,0.00047782215,0.00071848027,0.0004533674,0.00014540911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016024348,0.00013983382,0.0003165359,0.00028639505,0.0001061265,0.00007004615,0.0013073564,0.000105812054,0.00016882009],"category_scores_gemma":[0.0008470983,0.00011552353,0.0002017059,0.00041093916,0.00022065139,0.00092824775,0.00025694325,0.0007351177,0.000007312212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059286,0.00016312177,0.00011901519,0.000009340799,0.000044949906,0.000029906016,0.00036700975,0.000070323884,0.024161717,0.97294664,0.00042481103,0.0010703264],"study_design_scores_gemma":[0.0010040341,0.001055882,0.00061815116,0.000027822338,0.000008509433,0.000059649676,0.000055824676,0.000058317444,0.07584758,0.9202747,0.00088487036,0.000104697894],"about_ca_topic_score_codex":0.0000022798572,"about_ca_topic_score_gemma":8.9933775e-7,"teacher_disagreement_score":0.09667664,"about_ca_system_score_codex":0.000027467335,"about_ca_system_score_gemma":0.00016597917,"threshold_uncertainty_score":0.47109127},"labels":[],"label_agreement":null},{"id":"W4205847801","doi":"10.1016/j.disc.2006.03.014","title":"Spanning subgraphs with specified valencies","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Valency; Mathematics; Combinatorics; Discrete mathematics; Vertex (graph theory); Graph factorization; Graph; Spanning tree; Voltage graph; Line graph","score_opus":0.019353913978545932,"score_gpt":0.25991806906105447,"score_spread":0.24056415508250853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205847801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07480438,0.00010454507,0.8932929,0.00016420634,0.000042062296,0.00020240764,0.0000029472687,0.00026158127,0.03112497],"genre_scores_gemma":[0.66233885,0.000005602107,0.33641833,0.000023349925,0.000045678953,0.00002022317,0.000003178778,0.000024230549,0.0011205358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843633,0.00003880381,0.00024554116,0.00031611914,0.0005310153,0.0004322138],"domain_scores_gemma":[0.9987588,0.0001870493,0.00007676022,0.0008114407,0.000092018614,0.00007396371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032049307,0.00018469304,0.00020770266,0.00016269328,0.00016539554,0.00025245573,0.00088330114,0.000038667764,0.000016835389],"category_scores_gemma":[0.000030846626,0.00013428023,0.000070845075,0.00066271005,0.00018060056,0.00041240169,0.00019655612,0.00015650953,0.00005405595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062424456,0.0000479086,0.00054305536,0.00005406494,0.000012463574,0.000035012963,0.0006114638,0.00022639317,0.0009943361,0.9967611,0.00016994795,0.00053804676],"study_design_scores_gemma":[0.00042122998,0.00016971068,0.0021617608,0.00015258197,0.000014866452,0.00008883803,0.0006784126,0.025966998,0.013303183,0.95505315,0.0014013181,0.00058795087],"about_ca_topic_score_codex":0.0000061182386,"about_ca_topic_score_gemma":0.00000771018,"teacher_disagreement_score":0.5875345,"about_ca_system_score_codex":0.000023197073,"about_ca_system_score_gemma":0.000026355377,"threshold_uncertainty_score":0.5475789},"labels":[],"label_agreement":null},{"id":"W4205947909","doi":"10.1007/978-3-030-92681-6_11","title":"Computing the One-Visibility Cop-Win Strategies for Trees","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Visibility; Computer science; Tree (set theory); Key (lock); Search tree; Tree structure; Algorithm; Theoretical computer science; Combinatorics; Search algorithm; Mathematics; Binary tree; Computer security","score_opus":0.0434007628512319,"score_gpt":0.31865329805760945,"score_spread":0.27525253520637755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205947909","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022889789,0.0010073729,0.9930109,0.0014470186,0.0011175635,0.0009909053,0.000012683001,0.00018825439,0.0019964417],"genre_scores_gemma":[0.32526362,0.0000478579,0.6716136,0.0016286563,0.0008045095,0.000034984252,0.0000123351265,0.00006816262,0.0005262918],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436975,0.000152398,0.000687087,0.002260076,0.0014023017,0.0011283698],"domain_scores_gemma":[0.99242324,0.0036302106,0.00032471216,0.0027378476,0.00069971004,0.00018426075],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030009672,0.00061301095,0.00071702816,0.00052525685,0.0008501835,0.0017000799,0.0064154714,0.0002964702,0.00002037999],"category_scores_gemma":[0.00034910414,0.0004768138,0.0002963699,0.0010601046,0.0019133603,0.0009016795,0.0027814615,0.0012658215,0.000013476442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014400692,0.000044262728,0.000028641798,0.00007489823,0.000025611826,0.000033906865,0.0011507788,0.050643194,0.00029121368,0.47177532,0.000018672472,0.4758991],"study_design_scores_gemma":[0.00025956865,0.0001684796,0.00012839508,0.00027049956,0.0000069064267,0.000029507835,0.000003075873,0.32635912,0.00096807745,0.6704283,0.00087682874,0.00050122733],"about_ca_topic_score_codex":0.000017404098,"about_ca_topic_score_gemma":0.0002625693,"teacher_disagreement_score":0.47539788,"about_ca_system_score_codex":0.00031389555,"about_ca_system_score_gemma":0.0015861633,"threshold_uncertainty_score":0.9997684},"labels":[],"label_agreement":null},{"id":"W4206382042","doi":"10.1016/j.ejc.2006.06.009","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-Free bound for the class of planar graphs","year":2006,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph; Vertex (graph theory); Homomorphism; Scroll; Discrete mathematics; Algorithm; Philosophy; Theology","score_opus":0.01973816240423871,"score_gpt":0.24753745387877338,"score_spread":0.22779929147453468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206382042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54791284,0.0042391755,0.013776924,0.0015676522,0.006171469,0.000080649545,0.00034003242,0.00015588898,0.42575538],"genre_scores_gemma":[0.99080044,0.0016364984,0.0035667038,0.00085682917,0.0016424005,0.00014616309,0.00018961504,0.0006355866,0.000525742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98946327,0.0010619159,0.0023920161,0.0013165572,0.003467379,0.0022988613],"domain_scores_gemma":[0.9891597,0.003025635,0.003275147,0.0029923005,0.0005113793,0.0010358564],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005101034,0.0008045201,0.0004212017,0.0007445207,0.0017915136,0.001628921,0.0055543324,0.0008847179,0.0457609],"category_scores_gemma":[0.0022190076,0.0012807766,0.0020914234,0.0019095935,0.0020352686,0.0018083056,0.0024041566,0.0023271453,0.0005856548],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013711854,0.00040801827,0.000027039845,0.000562792,0.00095782534,0.0020452465,0.0010185194,0.0017609885,0.0010201117,0.7309475,0.25840762,0.0014731319],"study_design_scores_gemma":[0.0057101785,0.005991913,0.00051409786,0.0017188685,0.0014198542,0.0028973697,0.0014639902,0.08699463,0.8642734,0.0063942526,0.020657843,0.0019636017],"about_ca_topic_score_codex":0.00023689924,"about_ca_topic_score_gemma":0.0002526,"teacher_disagreement_score":0.8632533,"about_ca_system_score_codex":0.000025192801,"about_ca_system_score_gemma":0.0015321672,"threshold_uncertainty_score":0.99997455},"labels":[],"label_agreement":null},{"id":"W4206830864","doi":"10.1016/j.dam.2021.07.005","title":"Parameterized algorithms for the Happy Set problem","year":2021,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Parameterized complexity; Mathematics; Undirected graph; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.05288598446721245,"score_gpt":0.32754774320663876,"score_spread":0.27466175873942633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206830864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036253108,0.00011479088,0.9936067,0.0009842819,0.00007641497,0.0009927159,0.00002565861,0.00015784436,0.003679088],"genre_scores_gemma":[0.014346829,0.00003466541,0.98382145,0.00025108538,0.00005042721,0.00083854585,0.000015510115,0.000035392473,0.0006060645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983016,0.000030156576,0.0003405641,0.00043467322,0.00041015644,0.0004828232],"domain_scores_gemma":[0.9968223,0.0015506699,0.00013051722,0.0012687328,0.0001325357,0.000095266965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704067,0.00020204778,0.00028064832,0.00004508817,0.00029449473,0.00029502186,0.0012295449,0.00006402904,0.000021983202],"category_scores_gemma":[0.0001494776,0.00013564524,0.00014084883,0.0005020332,0.00013189006,0.0001481494,0.0005055388,0.00018441115,0.000050813476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009540919,0.00004854636,5.537194e-7,0.00011958738,0.000060534534,0.000005646991,0.0013037552,0.000110878056,0.007601416,0.97625744,0.00044827757,0.014033844],"study_design_scores_gemma":[0.00054057856,0.00003424276,0.0000036339095,0.000028023758,0.000022866103,0.0000244003,0.0006898662,0.11990751,0.020048503,0.8518598,0.0065889,0.00025165593],"about_ca_topic_score_codex":5.7924774e-7,"about_ca_topic_score_gemma":0.0000012880283,"teacher_disagreement_score":0.1243976,"about_ca_system_score_codex":0.000024148903,"about_ca_system_score_gemma":0.00008323777,"threshold_uncertainty_score":0.55314523},"labels":[],"label_agreement":null},{"id":"W4207028927","doi":"10.1002/jgt.22796","title":"Asymptotically good edge correspondence colourings","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.012935515915053134,"score_gpt":0.26809266483450434,"score_spread":0.2551571489194512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207028927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23707223,0.0017191829,0.7496634,0.0017753895,0.0022211948,0.00028737012,0.000008691645,0.000115855204,0.007136673],"genre_scores_gemma":[0.985836,0.000042901127,0.011788526,0.0006757687,0.00009451069,0.000012441949,2.7043066e-7,0.0000219769,0.0015275509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628454,0.0012367096,0.0005320838,0.00027125364,0.0012113509,0.00046405915],"domain_scores_gemma":[0.99712294,0.0012698005,0.00045000153,0.00058322883,0.00031513436,0.00025887918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060692895,0.0001622908,0.00030088492,0.00077058974,0.00048776995,0.000103874576,0.0031874457,0.00004097986,0.00033707605],"category_scores_gemma":[0.00045723672,0.00014542208,0.00029503394,0.0013591339,0.00025143352,0.00069205515,0.0009898514,0.001091165,0.000024343373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004947647,0.00019838293,0.0005872006,0.0000075406247,0.0000625519,0.00043836606,0.0006165785,0.00083486794,0.003301483,0.9847426,0.0008935316,0.007822148],"study_design_scores_gemma":[0.000754897,0.0012768048,0.0016967269,0.000021618564,0.000014158584,0.0014411907,0.00032790462,0.0003112301,0.0017569592,0.9823789,0.009804051,0.00021556641],"about_ca_topic_score_codex":4.9409414e-7,"about_ca_topic_score_gemma":2.8650942e-7,"teacher_disagreement_score":0.7487638,"about_ca_system_score_codex":0.0001196685,"about_ca_system_score_gemma":0.000291197,"threshold_uncertainty_score":0.593014},"labels":[],"label_agreement":null},{"id":"W4207062810","doi":"10.1007/978-3-030-95018-7_17","title":"Approximation and Parameterized Algorithms for Balanced Connected Partition Problems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Parameterized complexity; Partition (number theory); Disjoint sets; Mathematics; Graph partition; Vertex (graph theory); Approximation algorithm; Discrete mathematics; Graph","score_opus":0.034742319451082984,"score_gpt":0.2855835556091444,"score_spread":0.2508412361580614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207062810","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019051982,0.00026107035,0.99626184,0.0005565747,0.00064512726,0.0015654607,0.000023967776,0.00019443088,0.00030102767],"genre_scores_gemma":[0.044958863,0.00009497493,0.953548,0.0005372561,0.00017340994,0.00040209497,0.00005812027,0.000051822743,0.00017541712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964295,0.0000797431,0.0004564823,0.0015464568,0.0008299725,0.00065781595],"domain_scores_gemma":[0.99737483,0.0010065308,0.00028893168,0.000928164,0.00025206618,0.00014948864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013800624,0.0003977067,0.00048296785,0.0007235243,0.0004589881,0.00042974163,0.0016877127,0.00017672135,0.000026005613],"category_scores_gemma":[0.00021326513,0.00038630486,0.000094629584,0.000673016,0.0006265198,0.0008621464,0.0010631698,0.0005987791,0.000003865256],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043935648,0.000044892087,0.000018724735,0.00016261001,0.000020776843,0.000018363593,0.0008245933,0.02484482,0.0020093129,0.19220558,0.000008164641,0.7797982],"study_design_scores_gemma":[0.00046259628,0.0002761661,0.000019387115,0.000075705546,0.000003622553,0.000027236878,1.6333013e-7,0.53143495,0.0007821019,0.46558502,0.0010114544,0.0003215772],"about_ca_topic_score_codex":0.0000053548138,"about_ca_topic_score_gemma":0.000009692721,"teacher_disagreement_score":0.77947664,"about_ca_system_score_codex":0.00023565094,"about_ca_system_score_gemma":0.00023234637,"threshold_uncertainty_score":0.99985886},"labels":[],"label_agreement":null},{"id":"W4210439484","doi":"10.1016/j.dam.2010.12.024","title":"Generalization of matching extensions in graphs (III)","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Matching (statistics); Generalization; Discrete mathematics; Graph","score_opus":0.03876667402242115,"score_gpt":0.28391648846985723,"score_spread":0.24514981444743608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210439484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08475755,0.00001692891,0.9017179,0.00001970243,0.00003205693,0.0002752874,0.0000015745676,0.00006953145,0.013109489],"genre_scores_gemma":[0.61454976,0.000014830394,0.38534272,0.000022457887,0.0000031500035,0.000027754068,0.0000019752667,0.000011932413,0.000025421466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998815,0.00002326795,0.0003886578,0.00023797272,0.00027833646,0.00025673982],"domain_scores_gemma":[0.99899447,0.00008692181,0.00015032508,0.00065651565,0.00005128248,0.000060501665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037961162,0.00012569729,0.00022586776,0.00025180497,0.00005208516,0.000019150608,0.0006600441,0.000050327726,0.000020173826],"category_scores_gemma":[0.000022268896,0.000110066176,0.00005143298,0.0006803033,0.00008151759,0.00019350243,0.00026402483,0.00011739425,0.000013370869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005257461,0.000073881565,0.000033185792,0.00004747436,0.000006545998,0.000003455918,0.006323712,0.00013336791,0.012592337,0.9800597,0.000010890849,0.00071018055],"study_design_scores_gemma":[0.00024559506,0.000016717211,0.00029123694,0.000038062615,0.0000038086146,0.00000292713,0.00050021335,0.008021047,0.017772635,0.97297007,0.0000065150175,0.0001311444],"about_ca_topic_score_codex":0.000019132653,"about_ca_topic_score_gemma":0.0000071617173,"teacher_disagreement_score":0.5297922,"about_ca_system_score_codex":0.000013832315,"about_ca_system_score_gemma":0.000020692705,"threshold_uncertainty_score":0.44883686},"labels":[],"label_agreement":null},{"id":"W4210762532","doi":"10.1016/j.disc.2006.03.011","title":"Tough graphs and hamiltonian circuits","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Hamiltonian path; Graph; Discrete mathematics; Hamiltonian (control theory); Cubic graph; Quartic graph; Graph power; Line graph; Voltage graph","score_opus":0.016694382914690224,"score_gpt":0.2695214490345573,"score_spread":0.2528270661198671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210762532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1377666,0.00035297623,0.82192725,0.0006155181,0.00010383792,0.00035753276,0.0000095880905,0.00038965145,0.03847706],"genre_scores_gemma":[0.8899369,0.000019820387,0.10858767,0.000090345995,0.00002336562,0.000022550397,0.0000026434082,0.000022455739,0.0012942429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987601,0.00003965203,0.00023463785,0.00029379938,0.00032332397,0.00034849855],"domain_scores_gemma":[0.9989705,0.00018848565,0.000074332456,0.0006278272,0.000052584,0.000086256776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002993106,0.00014772215,0.00017683476,0.00012390179,0.00014417383,0.00019013038,0.0005965217,0.000046839374,0.000009480538],"category_scores_gemma":[0.000060560986,0.00012569015,0.00005504507,0.0004088785,0.00014640162,0.0003433407,0.00025544016,0.00012226448,0.00003833274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.9428405e-7,0.000025808666,0.00020767386,0.00004647264,0.000006428696,0.000013973869,0.0004749791,0.000010456102,0.00089996133,0.995301,0.00018467338,0.002828088],"study_design_scores_gemma":[0.00018633777,0.00003331085,0.001027241,0.000028833381,0.0000041111557,0.000036371566,0.000060413684,0.008222815,0.0013318136,0.9880579,0.000823914,0.00018689857],"about_ca_topic_score_codex":0.000006213489,"about_ca_topic_score_gemma":0.000007881468,"teacher_disagreement_score":0.7521703,"about_ca_system_score_codex":0.000014503296,"about_ca_system_score_gemma":0.000017704066,"threshold_uncertainty_score":0.5125495},"labels":[],"label_agreement":null},{"id":"W4212817891","doi":"10.1016/j.tcs.2022.02.009","title":"Vertex coloring (4K1, hole-twin, 5-wheel)-free graphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Neighbourhood (mathematics); Chordal graph; Mathematics; Feedback vertex set; Vertex (graph theory); Wheel graph; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.016109313204729876,"score_gpt":0.27365762230865104,"score_spread":0.2575483091039212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212817891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07298154,0.00008593039,0.91546744,0.0021209933,0.0016777914,0.00040749335,0.000009370148,0.0005981592,0.006651284],"genre_scores_gemma":[0.9132002,0.0000046490754,0.085532345,0.0010543525,0.00006033643,0.00007154588,0.0000011107276,0.0000206193,0.000054816355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993686,0.0004903735,0.00040474941,0.0014692309,0.0024990216,0.0014505782],"domain_scores_gemma":[0.99557817,0.00068519305,0.000100544785,0.0028181432,0.00024639245,0.00057157094],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["sts","open_science"],"category_scores_codex":[0.0041487226,0.00030784978,0.0003285473,0.0006884487,0.002351611,0.0005508456,0.012808971,0.00004288899,0.00024499698],"category_scores_gemma":[0.00029011295,0.00029339708,0.00015725262,0.0050007473,0.0045871977,0.0011881448,0.013425962,0.00083950884,0.000096318836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028449851,0.00010207242,0.00007336621,0.000005656113,0.0000066199095,0.00008089261,0.00051239104,0.0017329506,0.0012011346,0.9800755,0.00029295485,0.01588801],"study_design_scores_gemma":[0.00045266838,0.00048825037,0.00035723447,0.000008952134,0.0000030505903,0.00009013688,0.000029255345,0.2664214,0.0019428529,0.72900546,0.00085946586,0.0003412988],"about_ca_topic_score_codex":0.0000047202934,"about_ca_topic_score_gemma":6.958786e-7,"teacher_disagreement_score":0.84021866,"about_ca_system_score_codex":0.00025801884,"about_ca_system_score_gemma":0.00032327723,"threshold_uncertainty_score":0.99995184},"labels":[],"label_agreement":null},{"id":"W4213387244","doi":"10.1007/s00453-022-00937-9","title":"On 3-Coloring of ( <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mn>2</mml:mn> <mml:msub><mml:mi>P</mml:mi> <mml:mn>4</mml:mn></mml:msub> <mml:mo>,</mml:mo> <mml:msub><mml:mi>C</mml:mi> <mml:mn>5</mml:mn></mml:msub> </mml:mrow> </mml:math> )-Free Graphs.","year":2022,"lang":"lv","type":"article","venue":"PubMed","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Grantová Agentura, Univerzita Karlova; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Combinatorics; Mathematics; Theory of computation; Discrete mathematics; Graph coloring; Class (philosophy); Chordal graph; Graph; Time complexity; Computer science; Algorithm; Artificial intelligence","score_opus":0.02451577508842445,"score_gpt":0.24284211274195935,"score_spread":0.2183263376535349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213387244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.509612,0.0050467364,0.0036553554,0.0027771632,0.011294607,0.0004131775,0.0023174142,0.0013761631,0.46350735],"genre_scores_gemma":[0.96674174,0.0029401165,0.0052439873,0.003326077,0.0035920318,0.012203492,0.002284637,0.0024382642,0.001229656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9667658,0.0026277103,0.0054389094,0.0063565145,0.009631321,0.009179736],"domain_scores_gemma":[0.97431916,0.0059060026,0.0058193286,0.008890279,0.0008115236,0.004253709],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.009524656,0.0028679578,0.0013087522,0.0031657573,0.0061804876,0.0040599657,0.0125489645,0.0047096475,0.30600545],"category_scores_gemma":[0.006345892,0.005678263,0.005522476,0.007129894,0.0057908855,0.004988923,0.01235588,0.0068438314,0.0035040944],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004173447,0.001240864,0.00005979316,0.0020978013,0.0033816178,0.003800139,0.0035913636,0.004652601,0.0023166884,0.5503844,0.41180387,0.012497398],"study_design_scores_gemma":[0.0060265297,0.004469638,0.00032551427,0.0017789793,0.0025422648,0.0032556495,0.0035667678,0.013330565,0.9335942,0.0074052503,0.01832756,0.005377048],"about_ca_topic_score_codex":0.0030191564,"about_ca_topic_score_gemma":0.0030390876,"teacher_disagreement_score":0.9312776,"about_ca_system_score_codex":0.00014300489,"about_ca_system_score_gemma":0.0041803746,"threshold_uncertainty_score":0.9984052},"labels":[],"label_agreement":null},{"id":"W4213422038","doi":"10.37236/10556","title":"The Tree Alternative Conjecture Under the Topological Minor Relation","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Conjecture; Equivalence relation; Minor (academic); Combinatorics; Isomorphism (crystallography); Tree (set theory); Relation (database); Equivalence (formal languages); Class (philosophy); Equivalence class (music); Discrete mathematics; Aleph; Computer science","score_opus":0.014602869886890812,"score_gpt":0.27517264728094887,"score_spread":0.26056977739405807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213422038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26652148,0.017646557,0.62752444,0.08276348,0.0024804778,0.0006286015,0.0000014763506,0.000055171284,0.0023783045],"genre_scores_gemma":[0.99842954,0.0003626411,0.000019874107,0.0002973218,0.00007971675,0.000012307524,1.8996826e-7,0.000008449471,0.0007899799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683106,0.0012564085,0.00029920522,0.0001359152,0.000928671,0.0005487117],"domain_scores_gemma":[0.99688613,0.001976741,0.00039427404,0.0005252773,0.00017082262,0.00004677111],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0037043889,0.00011855486,0.00014206393,0.00006412928,0.0015812664,0.000111089415,0.0033794162,0.000029746492,0.000014678034],"category_scores_gemma":[0.00014584181,0.000051451978,0.00014054369,0.000774168,0.00023495671,0.00018969609,0.00051626464,0.0020657405,0.0000033777335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006015411,0.00004099357,0.00003420259,4.2769094e-7,0.00006134106,0.000007888984,0.0004263958,0.0027013526,0.000052710355,0.99448174,0.000324472,0.0018083352],"study_design_scores_gemma":[0.00044071666,0.0008493054,0.0004020013,0.0000015812733,0.000012152153,0.00038360455,0.0005772533,0.002343702,0.00024549133,0.98324627,0.011429757,0.00006819688],"about_ca_topic_score_codex":0.0000032107794,"about_ca_topic_score_gemma":0.000005892868,"teacher_disagreement_score":0.731908,"about_ca_system_score_codex":0.0005208185,"about_ca_system_score_gemma":0.00038622096,"threshold_uncertainty_score":0.99971855},"labels":[],"label_agreement":null},{"id":"W4221140426","doi":"10.4230/lipics.swat.2022.19","title":"An Optimal Algorithm for Product Structure in Planar Graphs","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Product (mathematics); Planar; Graph; Path (computing); Discrete mathematics; Time complexity; Treewidth; Algorithm; Pathwidth; Computer science; Geometry; Line graph","score_opus":0.019428817194095484,"score_gpt":0.3105806399749501,"score_spread":0.2911518227808546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221140426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057838365,0.00027130335,0.9198029,0.0003019128,0.0026469287,0.007853805,0.010423737,0.0005063909,0.00035462613],"genre_scores_gemma":[0.07930775,0.000103149825,0.90907824,0.00065738236,0.00038236528,0.002706435,0.0073441905,0.00020525878,0.0002152187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937928,0.00019869758,0.0017525498,0.001273241,0.0012323981,0.0017503316],"domain_scores_gemma":[0.9947944,0.00028228018,0.0008460514,0.0031760416,0.0004945863,0.0004066021],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00174146,0.0009670828,0.0010977592,0.0014835215,0.00061735144,0.00089076866,0.0063502644,0.0004865345,0.00006301278],"category_scores_gemma":[0.00014431486,0.0009630512,0.0005385356,0.00090807205,0.0002439583,0.0023873558,0.0027118968,0.002557035,0.000009477567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017751527,0.002904627,0.0046522794,0.008205706,0.0014639663,0.00015637816,0.052080695,0.08449453,0.0003060829,0.16864556,0.00821557,0.6670995],"study_design_scores_gemma":[0.0051437384,0.0012628312,0.0005132166,0.00026296385,0.000054239674,0.0001203783,0.0018270653,0.82055867,0.0014227823,0.11796801,0.048538815,0.002327286],"about_ca_topic_score_codex":0.000022629727,"about_ca_topic_score_gemma":0.000027193355,"teacher_disagreement_score":0.73606414,"about_ca_system_score_codex":0.00044383964,"about_ca_system_score_gemma":0.00046391904,"threshold_uncertainty_score":0.9997441},"labels":[],"label_agreement":null},{"id":"W4224980430","doi":"10.4230/lipics.isaac.2022.56","title":"Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Treewidth; Planar graph; Pathwidth; Clique-sum; Chordal graph; Vertex (graph theory); Discrete mathematics; Graph; 1-planar graph; Line graph","score_opus":0.08403979795398728,"score_gpt":0.2179856208734921,"score_spread":0.13394582291950483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224980430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9199769,0.00077812804,0.0744154,0.0002465548,0.00068705046,0.0007825775,0.000039985673,0.00035912008,0.0027142665],"genre_scores_gemma":[0.9953085,0.0013207209,0.001153432,0.000075505355,0.000016376627,0.0000075454614,0.00001773661,0.000028406193,0.002071749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996612,0.0006121766,0.00024561046,0.0016313918,0.00027326675,0.0006255608],"domain_scores_gemma":[0.99755627,0.00037364513,0.00018626025,0.0015604735,0.00010673966,0.00021663176],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010146651,0.00037984326,0.00045817863,0.0011424482,0.00029646774,0.00018766329,0.003011838,0.00022454534,0.00007629836],"category_scores_gemma":[0.00009559812,0.00045974026,0.00016891287,0.0018785782,0.0003401107,0.00061700464,0.008706969,0.001322024,0.000017720695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012738143,0.00019721585,0.02781778,0.00016547593,0.00007036399,0.0011795375,0.00078855763,0.027129734,0.00012032794,0.9404972,0.00013817892,0.001768227],"study_design_scores_gemma":[0.0011257473,0.00018249037,0.01311019,0.00011748401,0.000024158791,0.000013977098,0.0005773917,0.059049483,0.00009340848,0.92278606,0.002078018,0.0008416051],"about_ca_topic_score_codex":0.00050509395,"about_ca_topic_score_gemma":0.0004273038,"teacher_disagreement_score":0.07533161,"about_ca_system_score_codex":0.00026803973,"about_ca_system_score_gemma":0.00020387354,"threshold_uncertainty_score":0.9997854},"labels":[],"label_agreement":null},{"id":"W4225162735","doi":"10.1016/j.tcs.2022.04.052","title":"A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Modular design; Mathematics; Orthogonality; Time complexity; Decomposition; Scheme (mathematics); Polynomial; Focus (optics); Discrete mathematics; Combinatorics; Algorithm; Computer science","score_opus":0.006917649435479797,"score_gpt":0.27963597498471354,"score_spread":0.27271832554923375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225162735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09420871,0.00001310281,0.9033883,0.0008488568,0.00028716362,0.0009501849,0.000032835615,0.00012320837,0.0001476469],"genre_scores_gemma":[0.5342804,3.7347084e-7,0.46515957,0.00015410718,0.000045025445,0.00034400492,0.000005335283,0.000009180623,0.000002002409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702543,0.00016241289,0.00031652115,0.00085816695,0.0010143087,0.0006231402],"domain_scores_gemma":[0.99775016,0.00031201364,0.00009255842,0.001045682,0.00046359395,0.00033600588],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012560725,0.00018761332,0.00025839213,0.00043875605,0.0013456576,0.00013583846,0.003013878,0.000026950278,0.000013147033],"category_scores_gemma":[0.00002766078,0.00017515062,0.000100494646,0.003068692,0.0014124559,0.0004133536,0.0014853086,0.0002249613,0.000005994504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073396084,0.00022049897,0.000021223723,0.0000062477875,0.000010036477,0.000002486352,0.00016677694,0.015240194,0.03573719,0.9443107,0.000017145789,0.0041940873],"study_design_scores_gemma":[0.00050239346,0.0010301959,0.00011259472,0.0000067330047,0.0000050766484,0.000043199307,0.000007996566,0.60799885,0.010090546,0.3798708,0.00014571454,0.00018593018],"about_ca_topic_score_codex":0.000004049849,"about_ca_topic_score_gemma":4.4083558e-7,"teacher_disagreement_score":0.59275866,"about_ca_system_score_codex":0.00013809356,"about_ca_system_score_gemma":0.00021040357,"threshold_uncertainty_score":0.99995446},"labels":[],"label_agreement":null},{"id":"W4225363091","doi":"10.1016/j.dam.2021.11.001","title":"Dichotomizing k-vertex-critical H-free graphs for H of order four","year":2022,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Discrete mathematics; Algorithm; Graph","score_opus":0.03854525185925415,"score_gpt":0.31333448810442494,"score_spread":0.27478923624517076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225363091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065471763,0.000387946,0.98210645,0.0008487016,0.000502661,0.002396966,0.000504302,0.00015050784,0.0065552755],"genre_scores_gemma":[0.44998783,0.000037775975,0.5479093,0.00018245369,0.000049916867,0.0012722411,0.00002577541,0.00014006747,0.00039463892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951059,0.0001370948,0.0011193296,0.00090556516,0.0015712199,0.0011608388],"domain_scores_gemma":[0.9931883,0.0032477826,0.00043746512,0.0025056787,0.0003371748,0.00028359846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020097948,0.0004933622,0.0009172022,0.00042275304,0.0008871845,0.00016549518,0.0038143073,0.00012442518,0.00022757765],"category_scores_gemma":[0.0011970359,0.0005051419,0.00039595022,0.0017329081,0.00063805777,0.00025409632,0.0034381275,0.0007165867,0.00002223408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015460273,0.00039927135,0.000008358187,0.0013587113,0.0001290063,0.0000108874565,0.00312086,0.00040222748,0.0058399495,0.9850735,0.000914972,0.0025876593],"study_design_scores_gemma":[0.0016597986,0.00032643598,0.0000076052975,0.00008891341,0.00010163993,0.00003142822,0.0023968252,0.0850696,0.0025264802,0.9062728,0.0009956739,0.0005228043],"about_ca_topic_score_codex":0.000004497024,"about_ca_topic_score_gemma":0.000002762347,"teacher_disagreement_score":0.44344065,"about_ca_system_score_codex":0.000111718466,"about_ca_system_score_gemma":0.00024877168,"threshold_uncertainty_score":0.99974},"labels":[],"label_agreement":null},{"id":"W4225460864","doi":"","title":"Recolouring planar graphs of girth at least five","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Planar graph; 1-planar graph; Pathwidth; Outerplanar graph; Triangle-free graph; Discrete mathematics; Chordal graph; Clique-sum; Indifference graph; Planar straight-line graph; Symmetric graph; Graph; Line graph; Voltage graph","score_opus":0.018902533421486286,"score_gpt":0.2545153314195927,"score_spread":0.23561279799810642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225460864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3274926,0.0028883747,0.5593594,0.010260678,0.00095348695,0.001639532,0.00033300693,0.0008343642,0.09623861],"genre_scores_gemma":[0.7749509,0.001046776,0.19453937,0.00010073319,0.00001792586,0.00027454665,0.00037421926,0.00008839538,0.02860709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898655,0.006843104,0.00063336984,0.0011818097,0.00092420576,0.00055205444],"domain_scores_gemma":[0.99128544,0.0022071279,0.00074113486,0.004123327,0.0014113084,0.00023168685],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0066735605,0.0003564102,0.0004949704,0.00054883293,0.00063864613,0.00021163542,0.005147233,0.00019554987,0.00031767102],"category_scores_gemma":[0.0011038801,0.0004056196,0.0003321262,0.000992281,0.0003773777,0.0002502289,0.008534036,0.001118777,0.00003105903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005130196,0.0006773854,0.0046889717,0.0003631811,0.00018807715,0.000037812642,0.016646491,0.0013062321,0.004075625,0.932202,0.0014272879,0.03833568],"study_design_scores_gemma":[0.0029704713,0.000008961848,0.021014668,0.003870094,0.000104653605,0.00011608602,0.0009849918,0.09278267,0.20087539,0.6206951,0.053336687,0.0032402072],"about_ca_topic_score_codex":0.00046325542,"about_ca_topic_score_gemma":0.0007888591,"teacher_disagreement_score":0.44745833,"about_ca_system_score_codex":0.00028565366,"about_ca_system_score_gemma":0.00033465403,"threshold_uncertainty_score":0.99983954},"labels":[],"label_agreement":null},{"id":"W4226093078","doi":"10.1002/jgt.23025","title":"Single-conflict colorings of degenerate graphs","year":2023,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; European Commission","keywords":"Combinatorics; Mathematics; Graph; Degenerate energy levels; Simple graph; Discrete mathematics; Physics","score_opus":0.07845420285947077,"score_gpt":0.3152875862785836,"score_spread":0.23683338341911284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226093078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5279897,0.006729892,0.45562238,0.00085316057,0.0048685917,0.00072066084,0.000055820063,0.00028585465,0.0028739313],"genre_scores_gemma":[0.9590287,0.0020212934,0.03734292,0.00016000826,0.00023328725,0.000026551834,0.000004537147,0.00012793425,0.0010547679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510044,0.0009924938,0.0014691813,0.0005732766,0.0012454132,0.00061916886],"domain_scores_gemma":[0.99365765,0.0012728345,0.0022021662,0.0013900634,0.0011597573,0.0003175574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006096254,0.0004502594,0.0010663732,0.00255246,0.00013249974,0.00017385768,0.0044273078,0.0003457338,0.000020626161],"category_scores_gemma":[0.00060315075,0.00039165065,0.0010858569,0.0015587637,0.000583594,0.00049570814,0.0020244261,0.0018345125,0.000015255104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038045106,0.00023849419,0.0004961412,0.0002520869,0.0006498874,0.00031710777,0.0009770001,0.0026168826,0.021259932,0.96432436,0.0005010731,0.007986584],"study_design_scores_gemma":[0.00051248627,0.000512617,0.000600665,0.00047813656,0.000059291884,0.000109394154,0.000100688485,0.0001369522,0.03462335,0.96167654,0.0008414294,0.00034845268],"about_ca_topic_score_codex":0.000006453856,"about_ca_topic_score_gemma":0.0000034360237,"teacher_disagreement_score":0.431039,"about_ca_system_score_codex":0.00009203084,"about_ca_system_score_gemma":0.0003823235,"threshold_uncertainty_score":0.99985355},"labels":[],"label_agreement":null},{"id":"W4229847238","doi":"10.1002/jgt.10047","title":"Convex‐round graphs are circular‐perfect","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Regular polygon; Chordal graph; Discrete mathematics; Graph; Geometry","score_opus":0.028524529176912734,"score_gpt":0.2678457779785755,"score_spread":0.23932124880166278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229847238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32584447,0.01843017,0.64261806,0.0016887431,0.0020674446,0.00037858987,0.000006624285,0.00019667462,0.008769243],"genre_scores_gemma":[0.99416786,0.00058835704,0.0042215018,0.00050597964,0.00011715813,0.000004222838,1.816876e-7,0.000027287508,0.00036747122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683976,0.0008051357,0.00060065486,0.00032298258,0.00088206655,0.0005494095],"domain_scores_gemma":[0.99705845,0.0007070706,0.0006186019,0.00082394277,0.00046455892,0.00032740022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028044437,0.00024768335,0.00047230517,0.0010284337,0.0002561331,0.00018741575,0.0020858655,0.000107121974,0.00024277043],"category_scores_gemma":[0.000360677,0.00020148937,0.00055060687,0.0014569148,0.00040599718,0.0012181405,0.00019050416,0.0007661055,0.00008335212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090573514,0.00029796577,0.0034756656,0.000040569135,0.00026000704,0.00075788144,0.0008639242,0.000099890014,0.0035159884,0.9658349,0.0020586138,0.022704035],"study_design_scores_gemma":[0.0009072849,0.000379384,0.0022684047,0.000088116845,0.000024847124,0.0010114321,0.00021021263,0.00044146512,0.0015019514,0.9899345,0.0029458422,0.00028657686],"about_ca_topic_score_codex":7.352115e-7,"about_ca_topic_score_gemma":6.065102e-7,"teacher_disagreement_score":0.66832334,"about_ca_system_score_codex":0.00005491259,"about_ca_system_score_gemma":0.000038292488,"threshold_uncertainty_score":0.8216498},"labels":[],"label_agreement":null},{"id":"W4230596415","doi":"10.1002/net.20169","title":"On the minimum path problem in Knödel graphs","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Logarithm; Bipartite graph; Longest path problem; Degree (music); Discrete mathematics; Shortest path problem; Graph","score_opus":0.016665121090767704,"score_gpt":0.27220704893071435,"score_spread":0.25554192783994667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230596415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044198394,0.00029009354,0.9327719,0.0009718525,0.0002567141,0.00046238978,3.8877658e-7,0.0001231279,0.020925088],"genre_scores_gemma":[0.9922215,0.00002567077,0.0065880585,0.00083179126,0.00005402859,0.000023333412,6.233662e-7,0.000010915457,0.00024408168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985085,0.00011985705,0.00018695727,0.0003135384,0.00029841292,0.0005727392],"domain_scores_gemma":[0.9983331,0.00087069167,0.000045434994,0.00063313835,0.000038087263,0.00007952744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017764932,0.00011241238,0.000099733974,0.00013780652,0.000113779904,0.000060799826,0.00105601,0.00007347368,0.000013019089],"category_scores_gemma":[0.000041997955,0.00007555896,0.00005074495,0.0011391705,0.00009015776,0.00014521558,0.00020065933,0.0004845948,0.00003050538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030224908,0.000054715125,0.00083449343,0.0000019926485,0.000004173587,0.000043339136,0.00022279908,0.0070310743,0.0000337906,0.9442044,0.0018458113,0.045693185],"study_design_scores_gemma":[0.0003857215,0.0001710951,0.004433442,0.00006301205,9.817944e-7,0.0000074972345,0.0000485092,0.15946566,0.0001175133,0.833174,0.0019193342,0.00021323915],"about_ca_topic_score_codex":0.0000057113825,"about_ca_topic_score_gemma":0.00003388763,"teacher_disagreement_score":0.9480231,"about_ca_system_score_codex":0.00003109948,"about_ca_system_score_gemma":0.0000195859,"threshold_uncertainty_score":0.3081205},"labels":[],"label_agreement":null},{"id":"W4230754851","doi":"10.7251/139","title":"THE UPPER OPEN GEODETIC NUMBER OF A GRAPH","year":2012,"lang":"sr","type":"article","venue":"Зборник радова Економског факултета у Источном Сарајеву","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Geodetic datum; Combinatorics; Vertex (graph theory); Connectivity; Mathematics; Graph; Geodesic; Bound graph; Cardinality (data modeling); Discrete mathematics; Geodesy; Graph power; Computer science; Geometry; Geography; Line graph","score_opus":0.039316191930176714,"score_gpt":0.3667610176148421,"score_spread":0.3274448256846654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230754851","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4369901,0.041685946,0.100419246,0.01725069,0.018205935,0.016926896,0.00076115533,0.001494127,0.3662659],"genre_scores_gemma":[0.95281816,0.0018093587,0.019320004,0.00090695906,0.001090195,0.00046894088,0.000026243573,0.00032524907,0.023234919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98520315,0.0023497343,0.0024201625,0.0020230208,0.002957459,0.0050464477],"domain_scores_gemma":[0.98607457,0.0034355577,0.0013177976,0.006450289,0.0011020843,0.0016197147],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"category_scores_codex":[0.0077013173,0.0015006723,0.0017674437,0.0005783372,0.0023527225,0.0017068096,0.01468765,0.00069341477,0.0020600918],"category_scores_gemma":[0.0012333079,0.0011624803,0.0010307106,0.0045090015,0.003051728,0.0044670035,0.008882237,0.0021103604,0.005799247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007594048,0.002146892,0.07012444,0.0003559182,0.0009013739,0.00006749222,0.0055210833,0.00008323682,0.0025480054,0.7841203,0.020260181,0.113111675],"study_design_scores_gemma":[0.008649194,0.0015601723,0.06963121,0.0020002914,0.00067222136,0.0014206056,0.0044888477,0.004083492,0.024604004,0.36063924,0.5159388,0.006311928],"about_ca_topic_score_codex":0.0005926353,"about_ca_topic_score_gemma":0.000103800754,"teacher_disagreement_score":0.515828,"about_ca_system_score_codex":0.0003369876,"about_ca_system_score_gemma":0.0008500283,"threshold_uncertainty_score":0.9997742},"labels":[],"label_agreement":null},{"id":"W4231986041","doi":"10.1002/1097-0118(200103)36:3<121::aid-jgt1000>3.0.co;2-u","title":"Tree embeddings","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Graph; Discrete mathematics; Degree (music); Tree (set theory); Computer science","score_opus":0.017674241947864735,"score_gpt":0.2940075536422283,"score_spread":0.2763333116943636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231986041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104986235,0.001213235,0.87592655,0.00079715805,0.0005278474,0.00007529879,4.9425324e-7,0.00005790693,0.016415246],"genre_scores_gemma":[0.9668041,0.00040618412,0.03097451,0.0004261075,0.00019984791,0.000002034167,1.243226e-7,0.000019162566,0.0011679683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982151,0.00030910902,0.00040283252,0.00017164231,0.00054725126,0.0003540784],"domain_scores_gemma":[0.99828243,0.00045621968,0.00031248905,0.00045116857,0.0002885739,0.00020910331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026225466,0.00013169202,0.00024118615,0.0006567222,0.00012325488,0.000095294694,0.0016883723,0.000054153097,0.000091211754],"category_scores_gemma":[0.0002516069,0.00010174258,0.00027173213,0.0009950257,0.00016997145,0.0010265508,0.00016284033,0.00041277288,0.000033431577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017561932,0.00008399591,0.00083744293,0.000004341908,0.000057100602,0.0003553019,0.0004291413,0.000041770574,0.003150051,0.87603384,0.000958941,0.11787247],"study_design_scores_gemma":[0.00050874363,0.00027694905,0.0011408953,0.000032810836,0.000007888673,0.0010505617,0.00015015875,0.0001825536,0.0016184183,0.9887802,0.006121935,0.00012891198],"about_ca_topic_score_codex":4.226926e-7,"about_ca_topic_score_gemma":7.893976e-7,"teacher_disagreement_score":0.86181784,"about_ca_system_score_codex":0.00002638922,"about_ca_system_score_gemma":0.000064207394,"threshold_uncertainty_score":0.41489422},"labels":[],"label_agreement":null},{"id":"W4233116492","doi":"10.1002/jgt.20244","title":"Tough spiders","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Combinatorics; Mathematics; Indifference graph; Hamiltonian path; Split graph; Pathwidth; Graph; Spider; Interval graph; Outerplanar graph; Discrete mathematics; 1-planar graph; Line graph; Physics","score_opus":0.017325918051113578,"score_gpt":0.302466478754902,"score_spread":0.28514056070378846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233116492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052605253,0.00096204126,0.9383014,0.0003753186,0.0006243551,0.00006228384,3.3235023e-7,0.000035515084,0.0070335134],"genre_scores_gemma":[0.9457645,0.00008639147,0.053064838,0.00052600686,0.00019805123,5.465898e-7,8.620674e-8,0.000014751451,0.00034483717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981294,0.00022150042,0.00048581848,0.00015926998,0.0005816897,0.00042229137],"domain_scores_gemma":[0.99787873,0.0008224817,0.0003278607,0.00044309578,0.00029325057,0.00023456267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069941147,0.0001225811,0.0002168801,0.0007078261,0.00011438607,0.00006259008,0.0014602629,0.000058112128,0.00003887972],"category_scores_gemma":[0.00034959777,0.000095936426,0.00025718004,0.0008883964,0.00020302422,0.0008333026,0.00014259954,0.0004452923,0.00002208962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016302713,0.00005914569,0.0004336571,0.0000056725057,0.00004977129,0.0002875084,0.00040064368,0.0000439224,0.003006985,0.9239888,0.0004999051,0.07106095],"study_design_scores_gemma":[0.00042973686,0.00025376084,0.00206707,0.000027512744,0.000006381478,0.0003813575,0.00023326115,0.00002051818,0.008135534,0.9841091,0.004212261,0.00012349592],"about_ca_topic_score_codex":5.996034e-7,"about_ca_topic_score_gemma":0.0000013070674,"teacher_disagreement_score":0.8931592,"about_ca_system_score_codex":0.000040620223,"about_ca_system_score_gemma":0.000069585294,"threshold_uncertainty_score":0.3912174},"labels":[],"label_agreement":null},{"id":"W4233474037","doi":"10.1090/stml/061/07","title":"Infinite graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.035585325981399074,"score_gpt":0.28144610809560294,"score_spread":0.24586078211420387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233474037","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012763683,0.0004013106,0.027909959,0.0002847776,0.0001671021,0.00051159883,0.000016462702,0.0006498627,0.97004616],"genre_scores_gemma":[0.0010562796,0.00035469932,0.04534298,0.00055290386,0.00011681389,0.000058898084,0.00001846724,0.00016264038,0.9523363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997142,0.000052087624,0.0005880756,0.0007477112,0.0009500527,0.00052008417],"domain_scores_gemma":[0.9972788,0.00043431664,0.00019513679,0.0017124224,0.000041891934,0.00033742725],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023114338,0.00050281297,0.0006147401,0.00043851012,0.00008984902,0.00026748184,0.0034823343,0.00029484797,0.003182871],"category_scores_gemma":[0.000025548332,0.0004203626,0.00035388378,0.00014529875,0.00032020392,0.0011085398,0.0029660081,0.00077520276,0.0035535796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007058885,0.0000794934,0.000011578642,0.00008607321,0.00009555027,0.00012615143,0.00030013357,1.1363088e-7,0.0000027327774,0.9924612,0.0041626357,0.0026672555],"study_design_scores_gemma":[0.00013707111,0.00010852075,0.000019889118,0.00021469919,0.000015588354,0.000020916928,0.0000039354873,0.000024351104,0.000029187964,0.9177734,0.081235476,0.00041692817],"about_ca_topic_score_codex":8.140069e-8,"about_ca_topic_score_gemma":6.4199355e-8,"teacher_disagreement_score":0.07707284,"about_ca_system_score_codex":0.000015283858,"about_ca_system_score_gemma":0.000082431834,"threshold_uncertainty_score":0.9998248},"labels":[],"label_agreement":null},{"id":"W4235526718","doi":"10.4171/owr/2013/02","title":"Graph Theory","year":2013,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Line graph; Mathematics; Combinatorics; Matroid; Graph; Graph theory; Discrete mathematics","score_opus":0.015043781832494699,"score_gpt":0.2606351500046955,"score_spread":0.2455913681722008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235526718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10964347,0.0005714051,0.7875487,0.00085011125,0.00080352876,0.00075474806,6.461756e-7,0.000784057,0.09904332],"genre_scores_gemma":[0.96587986,0.000013129607,0.026181463,0.00031167292,0.000049845647,0.00014003401,0.0000023370017,0.000021017075,0.0074006673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978431,0.00016815196,0.00036452417,0.00059459696,0.00049780705,0.0005318321],"domain_scores_gemma":[0.9976694,0.00016815648,0.00015136761,0.0015979467,0.00018160541,0.00023150086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000998592,0.000168684,0.00017478279,0.000199218,0.00017467311,0.00021162268,0.0006952555,0.00006909001,0.0004282813],"category_scores_gemma":[0.00021894084,0.00014202669,0.00011872825,0.0006426126,0.00013430526,0.0010688524,0.00039019785,0.00023418776,0.0004962716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004168801,0.00012070762,0.007575507,0.000016825788,0.00004514836,0.0009699344,0.0003396072,0.00006462405,0.0056477566,0.79721034,0.006954719,0.18105069],"study_design_scores_gemma":[0.00007335223,0.000039845654,0.009172525,0.000008513996,0.0000022328982,0.00058291183,0.000022957616,0.00028068174,0.0037941048,0.97795594,0.007850021,0.00021694339],"about_ca_topic_score_codex":0.0000323433,"about_ca_topic_score_gemma":0.0000019060371,"teacher_disagreement_score":0.8562364,"about_ca_system_score_codex":0.00002959116,"about_ca_system_score_gemma":0.00005731917,"threshold_uncertainty_score":0.6378733},"labels":[],"label_agreement":null},{"id":"W4235539439","doi":"10.15803/ijnc.6.2_149","title":"A Practical Algorithm for Embedding Graphs on Torus","year":2016,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Torus; Embedding; Computer science; Time complexity; Implementation; Exponential function; Graph embedding; Algorithm; Graph; Theoretical computer science; Exponential growth; Mathematics; Artificial intelligence","score_opus":0.04362782216819385,"score_gpt":0.382500242558034,"score_spread":0.33887242038984017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235539439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009010569,0.00009849778,0.9867558,0.002333516,0.001622396,0.000045826102,7.950592e-7,0.000020882355,0.00011175001],"genre_scores_gemma":[0.66712475,0.00006326085,0.33153266,0.00017429804,0.0010743077,8.433118e-7,1.2309363e-7,0.000007216801,0.000022569202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883074,0.000080469676,0.00028777026,0.00016816547,0.00041777705,0.00021506115],"domain_scores_gemma":[0.9969537,0.0022304514,0.00027872063,0.00009295668,0.0003577742,0.00008634694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010178254,0.00008559812,0.00012739869,0.00019225606,0.00010216709,0.00014819592,0.0005140791,0.000033977234,0.000001262466],"category_scores_gemma":[0.00020536305,0.00005819225,0.000090438225,0.000099451645,0.0000427113,0.00030466146,0.00017141932,0.00016520625,0.0000010775872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004171742,0.000027898282,0.00022016214,9.531138e-7,0.000080323436,0.00005966715,0.00008426987,0.00025685347,0.00017535097,0.05407408,0.00032477468,0.9446539],"study_design_scores_gemma":[0.0023280068,0.0007595435,0.00055873283,0.0010077454,0.000013379357,0.0015740639,0.00006138621,0.75866324,0.0005470238,0.21776201,0.016442968,0.00028190136],"about_ca_topic_score_codex":3.8075805e-7,"about_ca_topic_score_gemma":1.1772004e-7,"teacher_disagreement_score":0.94437206,"about_ca_system_score_codex":0.000056001038,"about_ca_system_score_gemma":0.000042852724,"threshold_uncertainty_score":0.23730111},"labels":[],"label_agreement":null},{"id":"W4235772560","doi":"10.1007/978-1-4614-6170-8_100097","title":"Heterogeneous Graph","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.0257561604201205,"score_gpt":0.26854258467395653,"score_spread":0.24278642425383604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235772560","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.15621e-7,0.00018821751,0.46699256,0.00008815497,0.00014714913,0.000106472726,0.0000016118393,0.00022044701,0.53225476],"genre_scores_gemma":[0.0010940823,0.00010443259,0.019243209,0.0005255227,0.00011042111,0.000008932763,0.0000044524795,0.00005130523,0.97885764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981859,0.00002656142,0.00022973104,0.00068046205,0.0005050401,0.00037234428],"domain_scores_gemma":[0.9978933,0.0001374243,0.00009465052,0.0015773451,0.00011333904,0.00018399178],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023503492,0.00030556892,0.00030569828,0.00033707675,0.000094406016,0.0001066478,0.0019601823,0.00021957296,0.0005201133],"category_scores_gemma":[0.000012918869,0.00026765186,0.00023653767,0.000054774482,0.00014651012,0.00009768098,0.0006660719,0.00037658075,0.0017941237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021753017,0.0000024052083,3.885466e-7,0.00000878078,0.000024575851,0.000041968317,0.000007782896,0.000023591581,0.000011237208,0.95605284,0.0012629444,0.042561308],"study_design_scores_gemma":[0.000064958214,0.000067174726,3.3724035e-7,0.00001732812,0.0000026524938,0.000045172426,1.0732275e-7,0.0003814351,0.00016078187,0.6784384,0.32056975,0.00025186766],"about_ca_topic_score_codex":0.0000014699073,"about_ca_topic_score_gemma":0.000006498859,"teacher_disagreement_score":0.44774935,"about_ca_system_score_codex":0.000030893458,"about_ca_system_score_gemma":0.000039810868,"threshold_uncertainty_score":0.9999776},"labels":[],"label_agreement":null},{"id":"W4235983012","doi":"10.1090/conm/618/12349","title":"Exact Finite Difference Schemes","year":2014,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.03726260562589402,"score_gpt":0.30449115453820524,"score_spread":0.26722854891231124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235983012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015847918,0.00047744543,0.6583885,0.000313857,0.00009365524,0.00071600056,0.000032043816,0.0012086754,0.33875397],"genre_scores_gemma":[0.0046413103,0.00023425426,0.63121015,0.000879268,0.00031180572,0.00029007896,0.00003644403,0.0009985234,0.36139816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947674,0.00029692706,0.0010897106,0.0013257082,0.0014476127,0.0010726408],"domain_scores_gemma":[0.99218655,0.0024008898,0.0013437615,0.003329201,0.0001468676,0.00059275667],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011127762,0.0010836801,0.0021049222,0.0002610313,0.00019746067,0.00038794332,0.003755766,0.00041822897,0.0008516893],"category_scores_gemma":[0.00088672613,0.0008987128,0.0009196644,0.0011373014,0.0017561251,0.00025033345,0.0013851401,0.0010501418,0.0017793346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006171905,0.0007990939,0.00002838777,0.0027549202,0.00059592735,0.000031629945,0.001701117,0.0000021865353,0.00011944397,0.6148769,0.37256736,0.006516834],"study_design_scores_gemma":[0.00093059207,0.00039379692,0.000009352949,0.0021832082,0.000075351156,0.000036152218,0.00065392966,0.08350525,0.00016025003,0.59007585,0.3194985,0.0024777835],"about_ca_topic_score_codex":0.000014066271,"about_ca_topic_score_gemma":0.000001287981,"teacher_disagreement_score":0.08350307,"about_ca_system_score_codex":0.00010737664,"about_ca_system_score_gemma":0.00029015285,"threshold_uncertainty_score":0.9993464},"labels":[],"label_agreement":null},{"id":"W4236037274","doi":"10.32920/ryerson.14652594","title":"Wall cops and robbers","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Hypercube; Combinatorics; Graph; Computer science; Plane (geometry); Mathematics; Theoretical computer science; Geometry","score_opus":0.02797876477314936,"score_gpt":0.3040144018227216,"score_spread":0.27603563704957224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236037274","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01807862,0.0011299051,0.9601251,0.001984243,0.00037091158,0.0002341555,0.0000014140821,0.00025624337,0.017819406],"genre_scores_gemma":[0.44031587,0.00068630575,0.5482817,0.0011058387,0.00006213031,0.00006288329,0.000014961179,0.00003078502,0.009439532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985102,0.00010600159,0.0001365037,0.0006959525,0.00027934008,0.00027201266],"domain_scores_gemma":[0.99855447,0.00012366832,0.0000415444,0.0010331859,0.000109412256,0.0001377215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030301546,0.000155283,0.0001989672,0.00011135451,0.00006057647,0.00039960817,0.0010825671,0.00012551562,0.000073213734],"category_scores_gemma":[0.000049641298,0.00014258876,0.00006204514,0.00018373677,0.00008782888,0.00019956414,0.0049584094,0.0005241639,0.000017784538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009726814,0.00008771309,0.00094670954,0.00027292816,0.0001335781,0.00031141634,0.0019567776,0.0015720957,0.00076464785,0.8818711,0.00197256,0.11010073],"study_design_scores_gemma":[0.00068262976,0.00010409176,0.002852326,0.00026401287,0.0000149464695,0.00011773372,0.0002874982,0.14865233,0.006207647,0.8286828,0.010707732,0.0014262507],"about_ca_topic_score_codex":0.00004483748,"about_ca_topic_score_gemma":0.000028287528,"teacher_disagreement_score":0.42223725,"about_ca_system_score_codex":0.0000336716,"about_ca_system_score_gemma":0.00014076038,"threshold_uncertainty_score":0.61803025},"labels":[],"label_agreement":null},{"id":"W4236676762","doi":"10.1109/sct.1992.215385","title":"Self-witnessing polynomial-time complexity and prime factorization","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Time complexity; Factorization of polynomials; Computer science; Prime (order theory); Factorization; Polynomial; Prime factor; Prime time; Computational complexity theory; Theoretical computer science; Algebra over a field; Mathematics; Algorithm; Combinatorics; Matrix polynomial; Pure mathematics","score_opus":0.027140715676401743,"score_gpt":0.2783989629865446,"score_spread":0.25125824731014285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236676762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01983793,0.00005210578,0.9600258,0.00015714641,0.000080862796,0.00015364218,6.077713e-7,0.00030916158,0.019382758],"genre_scores_gemma":[0.7570304,0.000004442643,0.24237756,0.0000551039,0.000012848421,0.0000026129533,9.2809114e-7,0.0000069050425,0.00050916086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900967,0.000152123,0.000115186194,0.0002913516,0.00018657176,0.00024510876],"domain_scores_gemma":[0.9993711,0.00010088637,0.000036739104,0.00032781484,0.0000588993,0.00010455016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030558225,0.00009381216,0.00010684864,0.00009056747,0.00019072507,0.00015588703,0.00027706384,0.000036213256,0.0000796573],"category_scores_gemma":[0.00006812232,0.00008299711,0.000019058389,0.0003514927,0.00008837293,0.00062916585,0.00012664586,0.000082794664,0.00005014312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040069376,0.00005603688,0.0021248467,0.00001082194,0.000011389053,0.0000032045484,0.00035045177,0.000007725816,0.014556748,0.9762743,0.00010686372,0.006493614],"study_design_scores_gemma":[0.0017701586,0.00024165203,0.012703293,0.000025918489,0.000010330564,0.00010826938,0.00007617675,0.12032881,0.15954992,0.68619305,0.017936694,0.0010557299],"about_ca_topic_score_codex":0.0000045035335,"about_ca_topic_score_gemma":9.4802715e-7,"teacher_disagreement_score":0.7371925,"about_ca_system_score_codex":0.00003337521,"about_ca_system_score_gemma":0.000052852498,"threshold_uncertainty_score":0.3384524},"labels":[],"label_agreement":null},{"id":"W4237366326","doi":"10.2478/v10037-006-0010-3","title":"Chordal Graphs","year":2006,"lang":"en","type":"article","venue":"Formalized Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Chordal graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.015325347601894192,"score_gpt":0.2766044067953619,"score_spread":0.2612790591934677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237366326","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025794847,0.00007610284,0.93276405,0.00013616844,0.000112348214,0.00022004532,0.0000026969801,0.00036148194,0.04053227],"genre_scores_gemma":[0.16217245,0.000014549036,0.83555466,0.00010134751,0.000046361336,0.000052053798,0.0000055352257,0.000025162284,0.0020278883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986211,0.000032439082,0.0003082009,0.00020037993,0.00040462072,0.00043326285],"domain_scores_gemma":[0.9989231,0.00012798341,0.00009843351,0.00069813355,0.000078964746,0.00007338918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045120672,0.00014193113,0.00018259117,0.00017098185,0.00014203298,0.00012507026,0.00096112175,0.000050733313,0.000043206728],"category_scores_gemma":[0.00004399676,0.00011910006,0.00010332199,0.0005596123,0.00007503756,0.0006220645,0.00025522953,0.00013236923,0.00019728756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026859332,0.000083694205,0.000037992024,0.000033474254,0.0000056591384,0.0000058621467,0.00017048224,0.00003686711,0.00063603075,0.9968081,0.0010179938,0.0011611239],"study_design_scores_gemma":[0.00042719868,0.00003749055,0.00008309738,0.000011774253,0.000003066966,0.000030129384,0.000022545675,0.015473095,0.0061789374,0.97203296,0.005535229,0.00016446973],"about_ca_topic_score_codex":0.0000059821255,"about_ca_topic_score_gemma":0.0000034321192,"teacher_disagreement_score":0.1363776,"about_ca_system_score_codex":0.000022371709,"about_ca_system_score_gemma":0.000026827496,"threshold_uncertainty_score":0.48567596},"labels":[],"label_agreement":null},{"id":"W4237481075","doi":"10.1007/978-3-319-71743-2_9","title":"Inequalities","year":2017,"lang":"en","type":"book-chapter","venue":"Springer texts in education","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Subject (documents); Competition (biology); Computer science; World Wide Web; Biology; Ecology","score_opus":0.04005225720859527,"score_gpt":0.33753679237174644,"score_spread":0.29748453516315115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237481075","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019033761,0.0021403828,0.00450223,0.00052123144,0.0021084906,0.0003295102,0.0000030327103,0.00010219516,0.9901026],"genre_scores_gemma":[0.018988227,0.00036803924,0.009534131,0.00012595113,0.0004271255,0.000060673312,0.000010378079,0.000045424382,0.97044003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985846,0.000029966171,0.0002631678,0.00051382056,0.00034167775,0.00026671108],"domain_scores_gemma":[0.99780434,0.000091347094,0.00022855603,0.0016709968,0.00012721434,0.000077539196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044912603,0.00021917932,0.00022357963,0.00052524346,0.00012576282,0.0002020729,0.0016307448,0.00018364193,0.000107267966],"category_scores_gemma":[0.00011791817,0.00023645427,0.0000693524,0.000029345338,0.00013142101,0.00053668395,0.00041354648,0.00047179533,0.00037083027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018440227,0.000020216274,0.000053121432,0.000031451997,0.0000044019016,0.0000027140047,0.0003982675,0.0000021503315,0.000009189617,0.7940408,0.00039638835,0.20503947],"study_design_scores_gemma":[0.00005546058,0.000014653237,0.00048331206,0.00022919907,0.0000018406489,0.0000033536621,0.000010981769,0.000020655563,0.000064314016,0.7469106,0.25197738,0.00022828853],"about_ca_topic_score_codex":0.000021530363,"about_ca_topic_score_gemma":0.000045278608,"teacher_disagreement_score":0.251581,"about_ca_system_score_codex":0.00021087818,"about_ca_system_score_gemma":0.0005973892,"threshold_uncertainty_score":0.96423256},"labels":[],"label_agreement":null},{"id":"W4237624345","doi":"10.1002/jgt.10121","title":"Partitioning a graph into two isomorphic pieces","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Cograph; Property (philosophy); Discrete mathematics; Graph; Split graph; Line graph; Pathwidth","score_opus":0.018785615975345,"score_gpt":0.2971040975381128,"score_spread":0.2783184815627678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237624345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09386429,0.0036796555,0.89791185,0.00051755615,0.0008260222,0.0001261123,0.0000016304591,0.00006529548,0.0030076061],"genre_scores_gemma":[0.96424425,0.00023099488,0.035025142,0.00030079202,0.000083365965,0.000006577553,4.070327e-7,0.000015062922,0.000093412775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969476,0.0010717746,0.0005815073,0.0002691884,0.0006725473,0.0004573687],"domain_scores_gemma":[0.9977352,0.00056979654,0.000463302,0.00055091525,0.00040707667,0.00027370878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046641706,0.00019610842,0.0003272948,0.00090754364,0.0003358944,0.00017134163,0.0012682419,0.000058875212,0.000101524805],"category_scores_gemma":[0.00055651367,0.00016150266,0.00033663557,0.0014375616,0.00030265882,0.0012198706,0.000105630796,0.0005776149,0.000046536414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062674495,0.00010193115,0.0012005756,0.000011943761,0.000085053594,0.00012320593,0.0007396182,0.00053009327,0.002061608,0.98778635,0.00038298007,0.006913969],"study_design_scores_gemma":[0.00076014776,0.0002788791,0.00022514614,0.00006533698,0.000015184953,0.0004526242,0.00022077504,0.00006380849,0.0051642805,0.9892655,0.003302319,0.0001860086],"about_ca_topic_score_codex":0.00000209946,"about_ca_topic_score_gemma":0.00000596958,"teacher_disagreement_score":0.8703799,"about_ca_system_score_codex":0.00004349735,"about_ca_system_score_gemma":0.00014144454,"threshold_uncertainty_score":0.65858877},"labels":[],"label_agreement":null},{"id":"W4238082519","doi":"10.1002/net.20345","title":"Wavelength assignment in multifiber star networks","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Clemson University","keywords":"Maximization; Star network; Star (game theory); Path (computing); Computer science; Minification; Time complexity; Approximation algorithm; Wavelength-division multiplexing; Optimization problem; Mathematics; Algorithm; Mathematical optimization; Topology (electrical circuits); Combinatorics; Wavelength; Network topology; Physics; Optics; Computer network","score_opus":0.01544820293658534,"score_gpt":0.2726451021917512,"score_spread":0.25719689925516587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238082519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006164712,0.0005365685,0.9895889,0.00054431957,0.0003388808,0.00032384408,3.6785474e-7,0.00017312806,0.0023292552],"genre_scores_gemma":[0.9790618,0.0001490013,0.019451074,0.0007577289,0.00020036974,0.000019798887,0.0000034457291,0.000013290332,0.00034350625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977289,0.00020315031,0.0002975721,0.0005508735,0.00036773513,0.00085181376],"domain_scores_gemma":[0.9986817,0.00021455469,0.000066293964,0.0008053356,0.00005108755,0.0001810334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074761576,0.00019928177,0.00022183309,0.00014661028,0.00010813854,0.000114446935,0.0010249288,0.00014724952,0.00002766802],"category_scores_gemma":[0.0000256527,0.00018620036,0.00006940144,0.0008896953,0.000056122946,0.0004115902,0.00020384215,0.00063380616,0.000024044211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030948733,0.00012030578,0.00049421453,0.0000013768193,0.000007313531,0.000079241676,0.00014602642,0.33450335,0.000020440211,0.03760528,0.0012241174,0.6257674],"study_design_scores_gemma":[0.000471795,0.0001194043,0.006904444,0.00002837361,0.0000012436974,0.000005155017,0.000010012032,0.9746758,0.000025340669,0.015538004,0.0019999887,0.00022046814],"about_ca_topic_score_codex":0.0000060482307,"about_ca_topic_score_gemma":0.000016656373,"teacher_disagreement_score":0.97289705,"about_ca_system_score_codex":0.00012297361,"about_ca_system_score_gemma":0.00002820785,"threshold_uncertainty_score":0.75930303},"labels":[],"label_agreement":null},{"id":"W4238200461","doi":"10.1002/jgt.20420","title":"Path homomorphisms, graph colorings, and boolean matrices","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Combinatorics; Mathematics; Homomorphism; Path (computing); Graph; Constructive; Algebraic number; Chromatic scale; Discrete mathematics; Computer science","score_opus":0.012494258158381146,"score_gpt":0.2634158145642281,"score_spread":0.25092155640584696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238200461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5791227,0.018823477,0.3944772,0.0020786168,0.00063582556,0.0003257409,0.000006586142,0.00015828211,0.004371581],"genre_scores_gemma":[0.9795914,0.0018996643,0.017825034,0.0004551859,0.00009302619,0.0000016155365,2.5102065e-7,0.00001298734,0.00012079695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978854,0.0003503663,0.00049028656,0.00026688655,0.0005856381,0.00042142902],"domain_scores_gemma":[0.9981455,0.00040928947,0.0004616128,0.00043345924,0.0002517136,0.00029839162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025945636,0.00020270664,0.00035618726,0.0008891309,0.00022472098,0.000179946,0.0012569549,0.000076879835,0.000014271933],"category_scores_gemma":[0.00014422361,0.00016107911,0.00020978287,0.0009878011,0.00025689867,0.0011098088,0.00013513755,0.000512516,0.0000059427484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018377631,0.00011013146,0.00055448036,0.000014247264,0.00005022753,0.00027053492,0.00031504998,0.000018552935,0.0020882906,0.9558693,0.0003825226,0.040142864],"study_design_scores_gemma":[0.00062944274,0.00093137,0.007455578,0.00007595798,0.000018870918,0.00062323886,0.00014021309,0.000039501316,0.001248231,0.9876849,0.0009591224,0.00019356377],"about_ca_topic_score_codex":7.5646517e-7,"about_ca_topic_score_gemma":3.188854e-7,"teacher_disagreement_score":0.40046874,"about_ca_system_score_codex":0.000027095235,"about_ca_system_score_gemma":0.00006488696,"threshold_uncertainty_score":0.65686154},"labels":[],"label_agreement":null},{"id":"W4240422189","doi":"10.1002/jgt.20304","title":"Straight line embeddings of cubic planar graphs with integer edge lengths","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Polyhedral graph; Cubic graph; Embedding; Planar; Planar straight-line graph; Book embedding; Integer (computer science); Enhanced Data Rates for GSM Evolution; Graph; Line (geometry); Discrete mathematics; Line graph; 1-planar graph; Geometry; Computer science; Voltage graph; Telecommunications","score_opus":0.019259993860155224,"score_gpt":0.27004024612303285,"score_spread":0.25078025226287765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240422189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47918501,0.001838827,0.5149762,0.00029550455,0.0003544426,0.00019019425,0.000008493546,0.00005595497,0.0030953665],"genre_scores_gemma":[0.9764329,0.00044039314,0.022587288,0.00011602504,0.00007746133,0.0000026808548,6.735428e-7,0.000027411084,0.0003151357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729276,0.00037110617,0.00071897457,0.00028341697,0.00088439224,0.00044933378],"domain_scores_gemma":[0.9970846,0.0006544897,0.0007235236,0.0006208697,0.0006525234,0.00026396345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001907401,0.0002555658,0.00054336054,0.0011942143,0.0001800762,0.000032443524,0.0017636528,0.00009487629,0.00006639827],"category_scores_gemma":[0.00016291528,0.00017560383,0.00034063667,0.0014139442,0.0008141829,0.0010035948,0.000112255235,0.00076544523,0.0000070670962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010420379,0.00036871893,0.0014300977,0.000050718238,0.00033568163,0.00068648753,0.0023701263,0.00042772395,0.0093383705,0.9761242,0.00084047765,0.0069853426],"study_design_scores_gemma":[0.0022760928,0.0029030303,0.002331315,0.00035466877,0.000051642368,0.0028536564,0.0004458575,0.0002908302,0.034386788,0.95244163,0.0011857096,0.0004788025],"about_ca_topic_score_codex":0.0000016534726,"about_ca_topic_score_gemma":0.0000020837572,"teacher_disagreement_score":0.49724793,"about_ca_system_score_codex":0.00003114476,"about_ca_system_score_gemma":0.00020582584,"threshold_uncertainty_score":0.71609163},"labels":[],"label_agreement":null},{"id":"W4241301040","doi":"10.1002/jgt.20205","title":"Independent dominating sets and hamiltonian cycles","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Hamiltonian path; Combinatorics; Hamiltonian (control theory); Graph; Hamiltonian path problem; Discrete mathematics; Mathematical optimization","score_opus":0.010089306253866797,"score_gpt":0.27225994589591235,"score_spread":0.26217063964204557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241301040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7522586,0.002136934,0.24235554,0.0003759893,0.00025008523,0.000093228875,0.0000016144014,0.00003434186,0.0024936928],"genre_scores_gemma":[0.9756714,0.000064241176,0.023992885,0.00007615115,0.00007425009,0.0000014235517,1.5841418e-7,0.000011294596,0.00010821091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982593,0.0003543236,0.00040620004,0.00018576611,0.00049805304,0.00029637874],"domain_scores_gemma":[0.9985888,0.0004897339,0.00033573405,0.0002794344,0.00018268262,0.00012360772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026808593,0.00013193338,0.00022317002,0.0005329023,0.00017896185,0.00014208013,0.0007626587,0.000057280315,0.00000940125],"category_scores_gemma":[0.00011686716,0.000105184656,0.0001252157,0.0003928494,0.00020755644,0.00072363584,0.00021016994,0.00038177686,0.0000034633024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078755525,0.0000833804,0.005190824,0.000016122947,0.00004042149,0.0002197481,0.00041215526,0.00014152656,0.006962664,0.91478574,0.00012762593,0.07194101],"study_design_scores_gemma":[0.0005910086,0.0001309938,0.032317046,0.000049976115,0.0000074988384,0.00052586634,0.0001343108,0.00022636156,0.0027646092,0.96291953,0.00020663887,0.0001261652],"about_ca_topic_score_codex":0.0000038991902,"about_ca_topic_score_gemma":0.000005511628,"teacher_disagreement_score":0.22341281,"about_ca_system_score_codex":0.000030257399,"about_ca_system_score_gemma":0.000047763817,"threshold_uncertainty_score":0.42893058},"labels":[],"label_agreement":null},{"id":"W4241335985","doi":"10.1002/jgt.20363","title":"Circle graph obstructions under pivoting","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Corollary; Circle graph; Mathematics; Outerplanar graph; Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.01817147925094919,"score_gpt":0.2891290677880259,"score_spread":0.2709575885370767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241335985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10018756,0.0011005186,0.8939127,0.0013073888,0.00068842847,0.00009090936,0.00000107491,0.000082853454,0.0026285779],"genre_scores_gemma":[0.9738966,0.000095138996,0.025217384,0.0005133809,0.00015229435,0.0000010079368,1.9609563e-7,0.000012062879,0.00011188437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978117,0.00039121907,0.00053125474,0.00023766054,0.00058865064,0.00043954633],"domain_scores_gemma":[0.99802625,0.00043289652,0.00040672097,0.0005453697,0.00034883482,0.00023995111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002080337,0.00015832612,0.00027578097,0.0008973856,0.00031564818,0.00013684771,0.0014245159,0.00007348137,0.000029258466],"category_scores_gemma":[0.00020419226,0.0001431758,0.00036303056,0.0014261142,0.00019693813,0.0011691783,0.00009161051,0.0006182062,0.000013789721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048362308,0.00009264682,0.00013278206,0.0000036901015,0.000052567182,0.00005132855,0.00027883088,0.0007967799,0.005378622,0.91644394,0.0001404018,0.07658006],"study_design_scores_gemma":[0.00043008546,0.00029132701,0.010446049,0.00004205401,0.000012380478,0.0005234028,0.00025125052,0.00007213647,0.0018590513,0.9857232,0.00019356818,0.00015550523],"about_ca_topic_score_codex":5.8889214e-7,"about_ca_topic_score_gemma":6.86992e-7,"teacher_disagreement_score":0.8737091,"about_ca_system_score_codex":0.00004614209,"about_ca_system_score_gemma":0.00008741712,"threshold_uncertainty_score":0.58385396},"labels":[],"label_agreement":null},{"id":"W4241813520","doi":"10.1007/978-1-4939-7131-2_100370","title":"Exponential Family of Random Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Random graph; Exponential family; Exponential random graph models; Mathematics; Exponential function; Combinatorics; Computer science; Statistics; Graph; Mathematical analysis","score_opus":0.030297262794509578,"score_gpt":0.27517830898890216,"score_spread":0.24488104619439258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241813520","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007774978,0.00033470363,0.3296898,0.000025749063,0.0003751137,0.00026073528,0.000006900151,0.00011625278,0.669113],"genre_scores_gemma":[0.00551256,0.00030095945,0.03187973,0.00014804974,0.00016671864,0.000014206033,0.000009044019,0.00006118688,0.96190757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979805,0.00003979861,0.00039408702,0.00056872127,0.0007087182,0.0003082002],"domain_scores_gemma":[0.9979252,0.00019516409,0.00019456656,0.0012702454,0.00029429418,0.00012047973],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004369456,0.00027527043,0.00045958484,0.0004695501,0.00006653485,0.000045174504,0.0018364192,0.00021402624,0.0010146551],"category_scores_gemma":[0.00002255274,0.00023449882,0.00031750585,0.000096822136,0.00047396132,0.00024029637,0.000695225,0.00027517322,0.0004234603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006808365,0.000010351942,7.934993e-7,0.000017412127,0.000057096153,0.000012896822,0.00006605249,8.8811964e-7,0.0006295339,0.99053264,0.0027638904,0.005840367],"study_design_scores_gemma":[0.0008657922,0.00016285967,0.000004990848,0.00006023402,0.000009527107,0.0000063929333,0.000004085294,0.00015200283,0.0014690226,0.95436144,0.0426287,0.00027495297],"about_ca_topic_score_codex":0.000005485558,"about_ca_topic_score_gemma":0.000003963083,"teacher_disagreement_score":0.29781008,"about_ca_system_score_codex":0.000017661692,"about_ca_system_score_gemma":0.000088170906,"threshold_uncertainty_score":0.99989855},"labels":[],"label_agreement":null},{"id":"W4242981398","doi":"10.1109/asonam.2016.7752211","title":"Tradeoffs between density and size in extracting dense subgraphs: A unified framework","year":2016,"lang":"en","type":"article","venue":"2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Maximization; Range (aeronautics); Quadratic equation; Generalization; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.0412797631814928,"score_gpt":0.34760454320269846,"score_spread":0.30632478002120567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242981398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63705814,0.0005328341,0.35945892,0.0015720349,0.00026917117,0.00014618694,0.000010968756,0.000047805996,0.0009039366],"genre_scores_gemma":[0.9834782,0.0030643619,0.01286233,0.00011643757,0.0002510429,0.000024421473,0.0000036161669,0.0000137503575,0.00018588046],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99729794,0.00030955917,0.00052197534,0.00083652214,0.0005052202,0.0005287645],"domain_scores_gemma":[0.9957775,0.003235752,0.00030718808,0.00035725842,0.0001792405,0.0001430598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010958076,0.00027957463,0.0005453916,0.0003849484,0.00022840107,0.00020392348,0.0009318783,0.00020781413,0.000045241017],"category_scores_gemma":[0.000757591,0.0002281147,0.00013222122,0.0012314538,0.00032277452,0.0009024314,0.0002801905,0.0004725566,0.000002643356],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019440307,0.00009300419,0.47916475,0.000010011162,0.00029626873,0.00006203156,0.0014422499,0.00044585622,0.00026984292,0.19731186,0.000030951527,0.32067877],"study_design_scores_gemma":[0.002541832,0.00024277875,0.5263683,0.0011337982,0.00014276517,0.000010584386,0.0014290212,0.06116822,0.00022457371,0.40437198,0.0010267913,0.0013393513],"about_ca_topic_score_codex":0.000031524913,"about_ca_topic_score_gemma":0.0004532421,"teacher_disagreement_score":0.3465966,"about_ca_system_score_codex":0.00010899159,"about_ca_system_score_gemma":0.000059542872,"threshold_uncertainty_score":0.9302248},"labels":[],"label_agreement":null},{"id":"W4243040998","doi":"10.1002/jgt.20265","title":"Small cycle double covers of products I: Lexicographic product with paths and cycles","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Dalhousie University","funders":"","keywords":"Cartesian product; Lexicographical order; Combinatorics; Mathematics; Vertex (graph theory); Graph; Product (mathematics); Cartesian coordinate system; Discrete mathematics; Geometry","score_opus":0.022393583621144894,"score_gpt":0.266034926208744,"score_spread":0.24364134258759912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243040998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8919392,0.002458433,0.104093984,0.00030133052,0.00018499169,0.00025931877,0.0000015439252,0.000030969,0.00073020015],"genre_scores_gemma":[0.97481066,0.00023184261,0.024761798,0.000046873516,0.000077721204,0.0000018249085,2.528674e-7,0.000019873016,0.000049183323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787706,0.00020252708,0.00053328567,0.00034552833,0.00059985055,0.0004417232],"domain_scores_gemma":[0.99759376,0.00035913868,0.0006016082,0.0006020233,0.0006380052,0.00020545389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005066737,0.00020096161,0.00037180725,0.0009906406,0.0001298095,0.00006141037,0.00090346613,0.000050950923,0.0000035178336],"category_scores_gemma":[0.00015149332,0.00014353625,0.00012163366,0.0015682357,0.0006973519,0.00074439956,0.00015376248,0.0004207178,8.8425514e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045098355,0.0005347463,0.02465811,0.00019766338,0.0003719298,0.00032119802,0.0022656596,0.00043016498,0.048871405,0.8616407,0.00005463225,0.056143973],"study_design_scores_gemma":[0.0035206878,0.0019923584,0.037916716,0.00030349856,0.000066030305,0.0011894946,0.00071877486,0.000032141445,0.17427312,0.7790168,0.00049792713,0.00047245435],"about_ca_topic_score_codex":0.000004256103,"about_ca_topic_score_gemma":0.000009158566,"teacher_disagreement_score":0.1254017,"about_ca_system_score_codex":0.000018922867,"about_ca_system_score_gemma":0.00013618915,"threshold_uncertainty_score":0.58532387},"labels":[],"label_agreement":null},{"id":"W4244373956","doi":"10.1007/978-0-387-68276-1_7","title":"Combinatorial Analysis","year":2010,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Majorization; Graph theory; Graph; Mathematics; Combinatorics; Section (typography); Incidence matrix; Discrete mathematics; Computer science; Physics","score_opus":0.01776107994668128,"score_gpt":0.2875817969558252,"score_spread":0.2698207170091439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244373956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014508732,0.0001427177,0.78422445,0.00006527855,0.0023716565,0.00024531124,0.00028646673,0.0001362321,0.21251339],"genre_scores_gemma":[0.0043380163,0.00048675455,0.73980683,0.000079646146,0.0004965448,0.000037870515,0.00012706078,0.0001354845,0.25449178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774855,0.000037924638,0.0004563421,0.0006715756,0.00064788817,0.0004377193],"domain_scores_gemma":[0.9976618,0.00031692974,0.00021158418,0.0014404858,0.00022944983,0.00013973523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039992802,0.00035211333,0.0006000513,0.00079719914,0.00011339028,0.00016764893,0.0015408356,0.00035294096,0.0003088115],"category_scores_gemma":[0.00015896493,0.00038667358,0.00012893081,0.00036155764,0.000431588,0.00027762924,0.0008828941,0.0012695154,0.00011213537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018334005,0.00001268508,0.00009071404,0.000024439145,0.00015671733,0.00019504588,0.000120609075,0.000021640986,0.000017987813,0.9946756,0.000093045724,0.0045731952],"study_design_scores_gemma":[0.00016778824,0.0000636485,0.00014412917,0.000016916067,0.00006237681,0.0000032767862,0.0000024574513,0.00032741457,0.000079068974,0.8906495,0.108105674,0.00037775497],"about_ca_topic_score_codex":0.000012432911,"about_ca_topic_score_gemma":0.0003115732,"teacher_disagreement_score":0.10801263,"about_ca_system_score_codex":0.00009644128,"about_ca_system_score_gemma":0.0001469097,"threshold_uncertainty_score":0.9998585},"labels":[],"label_agreement":null},{"id":"W4244488833","doi":"10.1007/978-3-319-70151-6_7","title":"Relations: Especially on (Integer) Sequences","year":2012,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Lexicographical order; Equivalence relation; Notation; Natural number; Mathematics; Order (exchange); Equivalence (formal languages); Set (abstract data type); Binary relation; Integer (computer science); Finite set; Combinatorics; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Arithmetic","score_opus":0.04505898733537834,"score_gpt":0.30019110386243564,"score_spread":0.2551321165270573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244488833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029754388,0.00050249865,0.7129511,0.0048894067,0.0022669982,0.00046339014,0.0000043116315,0.0002323123,0.27866018],"genre_scores_gemma":[0.058064528,0.0012046965,0.50245583,0.0027333538,0.0033792797,0.000069335634,0.00001684248,0.00016507643,0.43191108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950066,0.000086887565,0.0006470147,0.0014902073,0.0017676938,0.0010015977],"domain_scores_gemma":[0.9966994,0.0004511877,0.00030246453,0.0019103182,0.00031133855,0.0003253094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016276785,0.00052453484,0.00047130056,0.0015100455,0.00043699387,0.0005759174,0.0048382236,0.00025762265,0.000053026215],"category_scores_gemma":[0.000090053974,0.00049734977,0.00016205516,0.0008159983,0.0012771464,0.0014618371,0.0015525799,0.0012582779,0.00074561493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036436647,0.000029726722,0.000038937993,0.000009825869,0.000007635151,0.00005263788,0.00016035809,0.00089365797,0.000007872335,0.87356436,0.0002414586,0.12498987],"study_design_scores_gemma":[0.00018096392,0.00017394075,0.00010307442,0.00025405092,0.000003746725,0.00003242155,0.0000012076047,0.016699405,0.00012751727,0.9390966,0.04275474,0.0005722786],"about_ca_topic_score_codex":0.000008213885,"about_ca_topic_score_gemma":0.00004176306,"teacher_disagreement_score":0.21049534,"about_ca_system_score_codex":0.0007217007,"about_ca_system_score_gemma":0.0007916521,"threshold_uncertainty_score":0.9997478},"labels":[],"label_agreement":null},{"id":"W4245157219","doi":"10.1007/978-981-287-532-7_648-1","title":"Critical Braiding Approach to Ethno[Mathematics]","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics education; Mathematics; Sociology; Computer science","score_opus":0.08789507715122324,"score_gpt":0.3497326706677329,"score_spread":0.26183759351650965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245157219","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.766453e-7,0.00003249705,0.49972415,0.00021854037,0.00010933691,0.00019700242,0.000002306285,0.00018772096,0.49952748],"genre_scores_gemma":[0.00019287755,0.0000034215086,0.51663154,0.00037646378,0.00017859199,0.000019510664,0.0000017019642,0.000049760303,0.48254615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721164,0.000028910752,0.00038246167,0.00093803986,0.000845575,0.0005933736],"domain_scores_gemma":[0.99683946,0.0006876948,0.00005943547,0.00165178,0.00035734504,0.00040428457],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00079367106,0.00037521278,0.00043687993,0.0004715021,0.00017645472,0.00029273744,0.0024460373,0.00029935714,0.0006027911],"category_scores_gemma":[0.00048998004,0.00032532722,0.00017131981,0.0001534435,0.00031193788,0.0003748229,0.0015676036,0.0005470236,0.0031894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021346282,0.00002857168,8.2312056e-8,0.00006974225,0.000018118346,0.00000872091,0.00043142532,0.0000020292323,0.00004814264,0.99127656,0.0047012097,0.003413287],"study_design_scores_gemma":[0.00006265533,0.000109364824,2.4256204e-7,0.00011393348,0.000006199995,0.00003828066,0.00001964123,0.0048609725,0.00024143081,0.9443836,0.049721535,0.0004421407],"about_ca_topic_score_codex":0.0000010977866,"about_ca_topic_score_gemma":0.0000014811291,"teacher_disagreement_score":0.046892934,"about_ca_system_score_codex":0.00007448198,"about_ca_system_score_gemma":0.000081444836,"threshold_uncertainty_score":0.9999199},"labels":[],"label_agreement":null},{"id":"W4245789633","doi":"10.1002/jgt.20328","title":"Cycle spaces in topological spaces","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cycle basis; Combinatorics; Hausdorff space; Complement (music); Discrete mathematics; Generalization; Space (punctuation); Zero-dimensional space; Topological space; Topology (electrical circuits); Graph; Line graph; Topological vector space; Computer science; Mathematical analysis","score_opus":0.026632276348587856,"score_gpt":0.2972262758258897,"score_spread":0.27059399947730184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245789633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.903656,0.0017558096,0.090214066,0.0013568372,0.00031292724,0.00007651378,5.762417e-7,0.000032994685,0.0025942533],"genre_scores_gemma":[0.98566544,0.00046192802,0.013394447,0.00021288102,0.00007797077,0.000001856008,6.5464924e-8,0.000007854091,0.00017756652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799275,0.0005544441,0.00039138662,0.0001972622,0.0004927154,0.00037144282],"domain_scores_gemma":[0.9984762,0.00063749397,0.00024588985,0.0003432202,0.00013635926,0.00016080236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020833705,0.0001348445,0.00029903027,0.0006884784,0.00013392825,0.00005618947,0.0012886231,0.000075834294,0.000050982264],"category_scores_gemma":[0.0003273635,0.000098094955,0.00018931915,0.0008966747,0.0004641745,0.0007784462,0.000188774,0.0005277765,0.00001645004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021162647,0.00020113825,0.01160123,0.0000066114244,0.000031778163,0.0012369609,0.001507452,0.00045966357,0.0013747843,0.9782106,0.00030763668,0.0048504844],"study_design_scores_gemma":[0.0005630255,0.00035889779,0.01129615,0.000025877249,0.0000026262362,0.00093382923,0.0002678922,0.00010368895,0.0015185861,0.98371637,0.0010737287,0.00013933716],"about_ca_topic_score_codex":0.0000028624754,"about_ca_topic_score_gemma":0.0000033241363,"teacher_disagreement_score":0.08200941,"about_ca_system_score_codex":0.00003549911,"about_ca_system_score_gemma":0.00008063447,"threshold_uncertainty_score":0.40001962},"labels":[],"label_agreement":null},{"id":"W4247202641","doi":"10.1007/s004930070033","title":"Adaptive Multicolouring","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02092664864078052,"score_gpt":0.27073266581200073,"score_spread":0.2498060171712202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247202641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24593809,0.0015011317,0.44119796,0.002317469,0.0012381064,0.001076021,0.0000030649114,0.0021913645,0.3045368],"genre_scores_gemma":[0.9854037,0.000025151965,0.011705039,0.00008796469,0.000015350044,0.000022262497,1.997401e-7,0.000008887637,0.0027314026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989404,0.00007619908,0.00010729624,0.0002975303,0.0002435331,0.00033500488],"domain_scores_gemma":[0.9991171,0.00013016233,0.00002045986,0.0005540013,0.000052927768,0.00012539882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015524706,0.00009403134,0.000106960906,0.00007605432,0.00015880358,0.0000561395,0.0009801969,0.00003533857,0.00015957604],"category_scores_gemma":[0.000029789058,0.00009072692,0.000045803234,0.00056784495,0.0000531524,0.00035996924,0.00016267039,0.00017355589,0.00066545047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015166443,0.00012821276,0.00014361837,0.000002866215,0.000010281677,0.000049679482,0.00027499843,0.000108813016,0.00014132186,0.78345245,0.00047767162,0.21519494],"study_design_scores_gemma":[0.0011755213,0.00037736906,0.0029753128,0.00002036853,0.0000032962103,0.000025489653,0.000027434024,0.047460593,0.0044543846,0.8966996,0.046341896,0.0004387265],"about_ca_topic_score_codex":0.0000038325898,"about_ca_topic_score_gemma":1.9311426e-7,"teacher_disagreement_score":0.73946565,"about_ca_system_score_codex":0.00006414318,"about_ca_system_score_gemma":0.000027702175,"threshold_uncertainty_score":0.85532415},"labels":[],"label_agreement":null},{"id":"W4247832516","doi":"10.1002/jgt.20271","title":"Maximum acyclic and fragmented sets in regular graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Bounded function; Graph; Upper and lower bounds; Order (exchange); Discrete mathematics","score_opus":0.01239526032330909,"score_gpt":0.2878449829069343,"score_spread":0.2754497225836252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247832516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7543759,0.0023171618,0.24181175,0.0003202486,0.00025733327,0.00012612091,8.039157e-7,0.000026210297,0.0007644725],"genre_scores_gemma":[0.9830793,0.0003279112,0.016261851,0.00023426235,0.00002875654,0.0000013603424,2.3263266e-7,0.000015317308,0.000050972492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977696,0.00037247027,0.000589127,0.00024487337,0.0005395377,0.00048442185],"domain_scores_gemma":[0.9982451,0.00060811255,0.00031015286,0.000431914,0.00015996114,0.00024475693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066480385,0.00016643938,0.0003008592,0.0015544548,0.000099566,0.000067438334,0.00096599903,0.00008933103,0.000012077913],"category_scores_gemma":[0.00019684741,0.00013818314,0.00015219497,0.0013486351,0.00027951814,0.00077575835,0.00020397523,0.0005718937,0.0000032805094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052242156,0.000194176,0.010730917,0.000025755795,0.00008457512,0.000913966,0.0010791888,0.000034710705,0.011007481,0.8599649,0.00011680097,0.11532509],"study_design_scores_gemma":[0.00096484873,0.0002290527,0.022739677,0.00007670379,0.0000059644835,0.00036358557,0.0002667476,0.000052278723,0.003488147,0.9712794,0.00038882048,0.00014478673],"about_ca_topic_score_codex":0.0000016739922,"about_ca_topic_score_gemma":0.0000065522645,"teacher_disagreement_score":0.22870344,"about_ca_system_score_codex":0.000040226067,"about_ca_system_score_gemma":0.000042364383,"threshold_uncertainty_score":0.56349444},"labels":[],"label_agreement":null},{"id":"W4247937443","doi":"10.1002/jgt.20262","title":"Compatible circuit decompositions of 4‐regular graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Combinatorics; Mathematics; Eulerian path; Conjecture; Vertex (graph theory); Discrete mathematics; Cubic graph; Graph; Line graph; Voltage graph; Pure mathematics; Lagrangian","score_opus":0.020600229845801045,"score_gpt":0.2970902916336,"score_spread":0.27649006178779895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247937443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1939235,0.0009994308,0.8018116,0.00007988976,0.00030675795,0.000094778195,0.000002814759,0.000026962573,0.002754286],"genre_scores_gemma":[0.96604824,0.000067331544,0.033685155,0.000090937625,0.000044975037,9.787633e-7,5.3367177e-7,0.000014247255,0.000047607406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975413,0.00033696977,0.00080132013,0.00018684054,0.00071712706,0.00041645832],"domain_scores_gemma":[0.9969568,0.00095144263,0.0006352369,0.0005941258,0.0006133024,0.00024907637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051060715,0.00015786244,0.00038283388,0.0014303867,0.0001620074,0.0000424949,0.0016124746,0.000072152034,0.000045273042],"category_scores_gemma":[0.00011464607,0.00013596623,0.0004165852,0.0015754895,0.00038636528,0.00069544,0.00014099454,0.00041823412,0.0000065194263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011451265,0.00020115805,0.0012608028,0.000018310375,0.00010923417,0.00008362668,0.00044668367,0.00012913103,0.03129669,0.9506061,0.0001251899,0.015608566],"study_design_scores_gemma":[0.00056678214,0.00036976507,0.0066424645,0.000076243436,0.000019229015,0.00028502915,0.0002137623,0.00004664697,0.037688226,0.9537174,0.00023861702,0.00013581793],"about_ca_topic_score_codex":0.0000015570146,"about_ca_topic_score_gemma":0.0000023736857,"teacher_disagreement_score":0.7721247,"about_ca_system_score_codex":0.00003667031,"about_ca_system_score_gemma":0.00007919383,"threshold_uncertainty_score":0.5544542},"labels":[],"label_agreement":null},{"id":"W4248423866","doi":"10.1002/jgt.20310","title":"Disjoint quasi‐kernels in digraphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Digraph; Combinatorics; Disjoint sets; Mathematics; Vertex (graph theory); Transitive relation; Multipartite; Discrete mathematics; Kernel (algebra); Graph; Physics","score_opus":0.025463151831893203,"score_gpt":0.2833942381524385,"score_spread":0.25793108632054534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248423866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55257934,0.0020653524,0.4421031,0.0004608998,0.00047207114,0.00014530467,0.0000015266572,0.000046143927,0.0021262506],"genre_scores_gemma":[0.9901501,0.0005813822,0.008835644,0.00016986487,0.00006720312,0.0000037288191,1.652634e-7,0.00001580726,0.00017609149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973382,0.00060604216,0.0006700817,0.0002476022,0.00067868776,0.000459406],"domain_scores_gemma":[0.9980184,0.0006139485,0.00036038517,0.00056775054,0.00021401168,0.00022553906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027560838,0.00018131502,0.00038671083,0.0012584276,0.00013864212,0.000044128425,0.0016335641,0.00007275518,0.000029275847],"category_scores_gemma":[0.0003091318,0.00014321988,0.0003444286,0.0015035043,0.0003791862,0.0010725384,0.00019350913,0.0006561544,0.000018829678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027001317,0.0004566732,0.013242186,0.000014137848,0.000064005646,0.0013428695,0.0024434943,0.00020889023,0.0019868375,0.9620948,0.00031038324,0.017565742],"study_design_scores_gemma":[0.0008686811,0.0004141582,0.020716509,0.00006930646,0.00000422541,0.0010758868,0.00016698502,0.00013287613,0.0018466295,0.9739806,0.0005286368,0.00019547965],"about_ca_topic_score_codex":0.0000031613333,"about_ca_topic_score_gemma":0.000003727162,"teacher_disagreement_score":0.43757075,"about_ca_system_score_codex":0.000052586427,"about_ca_system_score_gemma":0.00013380659,"threshold_uncertainty_score":0.5840337},"labels":[],"label_agreement":null},{"id":"W4248887642","doi":"10.1016/j.disc.2006.03.009","title":"Edmonds polytopes and a hierarchy of combinatorial problems","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Closure (psychology); Polyhedron; Rank (graph theory); Integer (computer science); Bounded function; Discrete mathematics; Integer programming; Order (exchange); Upper and lower bounds; Set (abstract data type); Linear programming; Linear inequality; Inequality; Mathematical optimization","score_opus":0.012975112282765456,"score_gpt":0.26285539803572117,"score_spread":0.2498802857529557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248887642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21323392,0.000530614,0.7662658,0.0004722231,0.00021190285,0.00060136564,0.000014957034,0.00017997842,0.018489199],"genre_scores_gemma":[0.88735986,0.000012341387,0.11220047,0.00001007304,0.00003962872,0.000018280998,0.0000023553991,0.000014644168,0.00034232912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888605,0.00004356834,0.00028602334,0.00020342712,0.00033785726,0.00024310089],"domain_scores_gemma":[0.9991187,0.00018141509,0.00011562108,0.0004573268,0.00007001212,0.000056949724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034340424,0.00011769542,0.00021528892,0.00011809121,0.00007026016,0.00007329674,0.0005247407,0.00004255715,0.000005095854],"category_scores_gemma":[0.000055924018,0.000095678435,0.00004756541,0.00033494612,0.00019130821,0.00024854744,0.00031275846,0.00010275434,0.000004977357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029363732,0.00006911435,0.00025296188,0.00012617324,0.000007848135,0.0000026589535,0.00059781317,0.000020613548,0.002410903,0.9957133,0.00005923757,0.00073647406],"study_design_scores_gemma":[0.000361598,0.00009447758,0.0002215597,0.000049495105,0.0000042925694,0.000010193287,0.00004549105,0.010841477,0.0053841444,0.9825357,0.00032779918,0.00012375481],"about_ca_topic_score_codex":0.000012977987,"about_ca_topic_score_gemma":0.0000021627395,"teacher_disagreement_score":0.67412597,"about_ca_system_score_codex":0.000010760928,"about_ca_system_score_gemma":0.000024234696,"threshold_uncertainty_score":0.39016533},"labels":[],"label_agreement":null},{"id":"W4249553598","doi":"10.1002/jgt.20202","title":"Between ends and fibers","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Equivalence relation; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.01167765994295173,"score_gpt":0.2656986678228765,"score_spread":0.25402100787992477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249553598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40140837,0.002267005,0.5897284,0.00066212314,0.00024154173,0.000077052435,0.0000028700936,0.000043537875,0.005569081],"genre_scores_gemma":[0.98200834,0.000055876793,0.017375976,0.0000669253,0.00017596554,7.497517e-7,2.546001e-7,0.000009526343,0.00030639418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986468,0.0002617157,0.00032827753,0.00014707171,0.0003643762,0.00025177238],"domain_scores_gemma":[0.99868006,0.00056894013,0.00022637799,0.00026804334,0.00013290999,0.00012364493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019292,0.00010627868,0.000211783,0.0004798023,0.00010953998,0.000081352475,0.00072303764,0.00004847615,0.000011765609],"category_scores_gemma":[0.00006483551,0.000083635736,0.00012614849,0.00047285383,0.00022033468,0.000603635,0.0001341663,0.00029951736,0.0000040727855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004050042,0.000029919782,0.00808548,0.000008466292,0.000045263827,0.00006835692,0.00015805414,0.000035230743,0.0013429942,0.9463375,0.0005243936,0.04332382],"study_design_scores_gemma":[0.00036783254,0.00016471723,0.017545152,0.000020447413,0.000010053606,0.00012965407,0.00003639455,0.00002011139,0.0018786163,0.9780085,0.0017206335,0.000097900614],"about_ca_topic_score_codex":0.0000018935868,"about_ca_topic_score_gemma":6.50101e-7,"teacher_disagreement_score":0.58059996,"about_ca_system_score_codex":0.000018320592,"about_ca_system_score_gemma":0.000037965663,"threshold_uncertainty_score":0.34105664},"labels":[],"label_agreement":null},{"id":"W4249649555","doi":"10.1002/jgt.20004","title":"Spanning<i>k</i>‐arc‐strong subdigraphs with few arcs in<i>k</i>‐arc‐strong tournaments","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Tournament; Arc (geometry); Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Geometry","score_opus":0.017238159962472115,"score_gpt":0.27887144748304976,"score_spread":0.26163328752057763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249649555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4613143,0.002252708,0.53142226,0.0008763335,0.00052571145,0.00040924104,0.0000050638114,0.00009238276,0.0031020285],"genre_scores_gemma":[0.9725305,0.00030349815,0.026543524,0.00028577776,0.00014472925,0.000012913378,0.0000011807352,0.00005862958,0.000119242075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948909,0.0006180955,0.0011062355,0.0005924227,0.0015580344,0.0012342883],"domain_scores_gemma":[0.9966287,0.00045134375,0.0008964287,0.000996079,0.00046147243,0.0005659743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037145165,0.0005006213,0.0007614562,0.0020303654,0.0002956311,0.00028723112,0.0028406344,0.00014662047,0.000030030023],"category_scores_gemma":[0.00014363423,0.00039256067,0.00044219586,0.0025090259,0.00062704086,0.0022454557,0.00035135713,0.0016252826,0.00001991876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014180089,0.0007565553,0.022331303,0.00006382071,0.00036459285,0.0021522352,0.0025848674,0.010166226,0.0033101744,0.94237703,0.00010618708,0.01436897],"study_design_scores_gemma":[0.0072110305,0.002245989,0.017580852,0.001050384,0.00006092429,0.0018722889,0.0012861965,0.00009805291,0.007995432,0.9589945,0.00073345145,0.0008708769],"about_ca_topic_score_codex":0.0000145034,"about_ca_topic_score_gemma":0.00003640504,"teacher_disagreement_score":0.5112162,"about_ca_system_score_codex":0.00027697027,"about_ca_system_score_gemma":0.00047321513,"threshold_uncertainty_score":0.99985266},"labels":[],"label_agreement":null},{"id":"W4249657637","doi":"10.1002/jgt.20375","title":"Circular choosability","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Conseil Régional Provence-Alpes-Côte d'Azur; Commonwealth Scholarship Commission; University of Oxford","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Bounded function; Planar; Generalization; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015441950375016986,"score_gpt":0.28929294776738507,"score_spread":0.27385099739236807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249657637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15158862,0.0016825872,0.8413615,0.0014823998,0.00038354786,0.0001124893,7.494934e-7,0.00005915684,0.003328908],"genre_scores_gemma":[0.98414457,0.00006684974,0.015137511,0.0004894176,0.00009671887,6.4302395e-7,9.5396395e-8,0.0000059125323,0.000058289123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979934,0.0005002014,0.0004298745,0.00019596546,0.0005618763,0.0003186727],"domain_scores_gemma":[0.9982339,0.0003155649,0.00026950284,0.0006570397,0.00031149,0.00021248686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038515504,0.00012709788,0.00025640384,0.00040960847,0.00011402631,0.00007826982,0.0016153425,0.000057103676,0.000034009896],"category_scores_gemma":[0.00041103328,0.00009957777,0.0003171924,0.0007786059,0.00015539078,0.0008717224,0.00007530927,0.00045781955,0.000014860975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009148647,0.00016063316,0.0004605238,0.000005924027,0.00003448377,0.00010188051,0.00026440452,0.00008142699,0.0062559727,0.9186892,0.00019186302,0.07366219],"study_design_scores_gemma":[0.00035441376,0.0003518366,0.009442089,0.000019290177,0.000006262122,0.00023506233,0.00003820826,0.000057809484,0.0029862446,0.98547095,0.00092929864,0.000108516084],"about_ca_topic_score_codex":1.9843817e-7,"about_ca_topic_score_gemma":7.474651e-8,"teacher_disagreement_score":0.83255595,"about_ca_system_score_codex":0.00004516591,"about_ca_system_score_gemma":0.00008673444,"threshold_uncertainty_score":0.40606636},"labels":[],"label_agreement":null},{"id":"W4249894547","doi":"10.1002/jgt.10148","title":"Weakening arcs in tournaments","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Regina","funders":"","keywords":"Tournament; Arc (geometry); Mathematics; Combinatorics; Graph; Discrete mathematics; Geometry","score_opus":0.017712551384883285,"score_gpt":0.288039795630729,"score_spread":0.27032724424584575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249894547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31218034,0.002003142,0.6743246,0.00023072121,0.0007366479,0.00012253717,4.785125e-7,0.000025228548,0.010376343],"genre_scores_gemma":[0.97009015,0.00013695637,0.029366957,0.00015684596,0.000032473567,0.0000018214593,4.5010655e-8,0.0000119654915,0.00020279697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976413,0.00079388294,0.0005031658,0.00016676587,0.0005123527,0.00038251907],"domain_scores_gemma":[0.9985863,0.0004388831,0.00030373433,0.0003544427,0.0001525831,0.00016405417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045574983,0.00012658218,0.0002488114,0.00089470064,0.000081973165,0.00007755089,0.001041887,0.00005080667,0.000043036278],"category_scores_gemma":[0.00052069593,0.00010437651,0.00017001065,0.0009967443,0.000103301405,0.00081441813,0.00008379377,0.0005684468,0.00001070407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007217936,0.00011295289,0.0055243527,0.0000064412543,0.000035417586,0.00029200615,0.0006253788,0.00027387205,0.0024585351,0.9751052,0.00009795056,0.015395712],"study_design_scores_gemma":[0.00080515275,0.00017449225,0.0016125025,0.00007856469,0.0000036367992,0.00038171228,0.0002287019,0.00008070613,0.0032654307,0.99155855,0.0016851628,0.00012540836],"about_ca_topic_score_codex":5.156732e-7,"about_ca_topic_score_gemma":0.0000012809207,"teacher_disagreement_score":0.6579098,"about_ca_system_score_codex":0.0000644616,"about_ca_system_score_gemma":0.00010557588,"threshold_uncertainty_score":0.42563504},"labels":[],"label_agreement":null},{"id":"W4250290902","doi":"10.1007/s003730050014","title":"Group Connectivity of 3-Edge-Connected Chordal Graphs","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Path graph; Induced subgraph; Connectivity; Bound graph; Vertex connectivity; Wheel graph; Chordal graph; Induced path; Hamiltonian path; Graph; Discrete mathematics; Graph power; Vertex (graph theory); Line graph; Longest path problem","score_opus":0.011794593628280486,"score_gpt":0.24316710782463466,"score_spread":0.23137251419635418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250290902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865296,0.00085642905,0.008719432,0.00010025743,0.0002385521,0.00023726044,0.000007171887,0.00019672693,0.0031145674],"genre_scores_gemma":[0.9981459,0.0004722262,0.0011506121,0.000055395125,0.0000054608254,0.000022005537,0.0000028194584,0.000014566572,0.00013102962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981832,0.00017701967,0.00027653849,0.00051718537,0.0003976455,0.00044839762],"domain_scores_gemma":[0.9985589,0.0003061443,0.00008653245,0.0007001283,0.00014785319,0.00020046474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048627023,0.00021321746,0.00032605635,0.00029650866,0.00022557047,0.00007304696,0.00077763986,0.00010485671,0.00004984622],"category_scores_gemma":[0.000055270837,0.00020328136,0.00012581074,0.0019508991,0.00027331928,0.00047564114,0.00017740366,0.0002780205,0.000008303357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031543343,0.00020371875,0.0063935104,0.000023870658,0.000026843261,0.000011550522,0.00018381522,0.0000028744653,0.00058581197,0.9556747,0.00007906364,0.036782667],"study_design_scores_gemma":[0.00094371167,0.0003864594,0.021110814,0.000016010059,0.0000072809817,0.00002005158,0.000025793037,0.00088764227,0.0014761321,0.9739019,0.00097328075,0.00025088942],"about_ca_topic_score_codex":0.000037534563,"about_ca_topic_score_gemma":0.000006464685,"teacher_disagreement_score":0.036531776,"about_ca_system_score_codex":0.000016959677,"about_ca_system_score_gemma":0.000029352988,"threshold_uncertainty_score":0.8289573},"labels":[],"label_agreement":null},{"id":"W4250937028","doi":"10.1002/jgt.10140","title":"Steiner type problems for digraphs that are locally semicomplete or extended semicomplete","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Combinatorics; Graph; Polynomial; Directed graph; Discrete mathematics","score_opus":0.05605105297153749,"score_gpt":0.30124318246946197,"score_spread":0.24519212949792446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250937028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03437703,0.0030427272,0.95901376,0.00036878046,0.001118546,0.0007949361,0.00001963282,0.000116877396,0.0011477259],"genre_scores_gemma":[0.9257316,0.000498339,0.07113004,0.0008232538,0.00016135181,0.00003855328,0.0000025956726,0.00009540694,0.0015188624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963533,0.00076984795,0.00078431214,0.0004780501,0.0008073022,0.0008071562],"domain_scores_gemma":[0.9956624,0.0012493132,0.0009160909,0.00087831484,0.0009327686,0.00036110336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037542577,0.00037485856,0.0006579058,0.00086391316,0.00030152305,0.00019029732,0.001984733,0.00013537599,0.00006990981],"category_scores_gemma":[0.0006759689,0.00026070775,0.0005118918,0.0013619097,0.00032023422,0.0009592048,0.00015961316,0.00062396214,0.000012160565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017395267,0.00037392695,0.0011749051,0.0001871533,0.00046947302,0.00018477775,0.00068908744,0.0006471144,0.02321108,0.9551472,0.0026179056,0.013557851],"study_design_scores_gemma":[0.002148635,0.0012926175,0.00050257327,0.00027533923,0.000042825955,0.0007759578,0.00033236705,0.00035940186,0.005216573,0.9649348,0.02365999,0.00045886435],"about_ca_topic_score_codex":6.9182033e-7,"about_ca_topic_score_gemma":0.0000062546733,"teacher_disagreement_score":0.89135456,"about_ca_system_score_codex":0.000071138486,"about_ca_system_score_gemma":0.00023991238,"threshold_uncertainty_score":0.9999845},"labels":[],"label_agreement":null},{"id":"W4251499002","doi":"10.1002/jgt.20036","title":"Graphs with independent perfect matchings","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Perfect graph theorem; Strong perfect graph theorem; Perfect graph; Trivially perfect graph; Matching (statistics); Discrete mathematics; Line graph; Graph; Pathwidth","score_opus":0.009461830976999132,"score_gpt":0.2545278158753462,"score_spread":0.24506598489834705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251499002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42068866,0.000593255,0.5768531,0.0004722705,0.0002231542,0.0001119319,8.1897434e-7,0.00004916851,0.0010076185],"genre_scores_gemma":[0.97042525,0.00009551882,0.029075697,0.00025965492,0.00004883105,0.0000032825753,1.594335e-7,0.000021755583,0.00006987912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976788,0.00029335162,0.00040627227,0.00025677818,0.0009416797,0.0004230963],"domain_scores_gemma":[0.99823284,0.0002569706,0.00039375262,0.00053597137,0.0003234078,0.000257055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00266372,0.00020569409,0.00031423874,0.00084723765,0.00019557757,0.00014059326,0.0016637356,0.00006695413,0.000021879492],"category_scores_gemma":[0.000084595435,0.00013913785,0.00026440204,0.0010265714,0.00026616844,0.0011798453,0.0001651146,0.0007361675,0.00001634973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032710622,0.0001415922,0.0007481507,0.000012975829,0.00011939086,0.00041956163,0.0010922776,0.0010607856,0.0028509477,0.986265,0.00002516734,0.006937024],"study_design_scores_gemma":[0.0014067987,0.00091144105,0.001971515,0.000105748324,0.000016143213,0.001574988,0.0002163398,0.000008040547,0.005354081,0.98810947,0.00013687812,0.00018853619],"about_ca_topic_score_codex":0.0000035112653,"about_ca_topic_score_gemma":0.0000037185077,"teacher_disagreement_score":0.54973656,"about_ca_system_score_codex":0.00007372459,"about_ca_system_score_gemma":0.00020629216,"threshold_uncertainty_score":0.5673877},"labels":[],"label_agreement":null},{"id":"W4251692629","doi":"10.1002/net.20159","title":"The bridges of Königsberg—A historical perspective","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Perspective (graphical); Computer science; Graph theory; Graph; Operations research; Combinatorics; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.01678236245234923,"score_gpt":0.2940905582696183,"score_spread":0.27730819581726907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251692629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015312626,0.003015156,0.986481,0.0008524045,0.00045110806,0.000088995585,1.4817266e-7,0.000057986137,0.0075219194],"genre_scores_gemma":[0.99399954,0.000110011046,0.004377724,0.00006152614,0.00020265653,0.0000037123057,1.4114158e-7,0.00000745754,0.0012372066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989263,0.00006981651,0.00015707784,0.0002051426,0.0002828039,0.00035886126],"domain_scores_gemma":[0.998331,0.00084134005,0.00006270268,0.0004994964,0.00018878418,0.00007665961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010367327,0.000070323484,0.000097468896,0.000049169143,0.00017986818,0.000027734564,0.0008943595,0.000049076763,0.000002768441],"category_scores_gemma":[0.00012548214,0.000049386905,0.000064403626,0.0004817628,0.00012305746,0.00011746495,0.00020591165,0.0002479911,0.0000052988703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003680879,0.000027875532,0.0005622922,0.0000010429704,0.000012312507,0.000011973133,0.00031119076,0.0011487586,0.00005404112,0.9378015,0.0029621075,0.0570701],"study_design_scores_gemma":[0.0012170556,0.0008172033,0.051613912,0.000056722263,0.000015664089,0.00008133336,0.0012718813,0.23766911,0.0026182511,0.52439094,0.1794233,0.0008246561],"about_ca_topic_score_codex":0.000039228176,"about_ca_topic_score_gemma":0.000047622656,"teacher_disagreement_score":0.9924683,"about_ca_system_score_codex":0.00029309123,"about_ca_system_score_gemma":0.00002667839,"threshold_uncertainty_score":0.20139395},"labels":[],"label_agreement":null},{"id":"W4251858507","doi":"10.1007/978-1-4939-7131-2_101355","title":"Time-Varying Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.029865651204645575,"score_gpt":0.28319086545208744,"score_spread":0.25332521424744187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251858507","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030387073,0.00017828778,0.09676776,0.00011288683,0.00018954332,0.00018316974,0.0000033976064,0.00039253442,0.9021694],"genre_scores_gemma":[0.00005865222,0.000051145315,0.03428492,0.00028843342,0.00011272624,0.000005684216,0.000005575961,0.000045698835,0.96514714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980768,0.000022339005,0.00023213481,0.0007163519,0.0005480457,0.00040432252],"domain_scores_gemma":[0.99798185,0.00015301186,0.00009946287,0.0014125991,0.00018692488,0.0001661676],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031624723,0.00030176435,0.00028395842,0.00041686062,0.00014608496,0.00011890624,0.0019987253,0.00022032698,0.0056648944],"category_scores_gemma":[0.000019685798,0.00026757334,0.00018718399,0.00010190214,0.00035592492,0.00035090614,0.0009353617,0.0003870369,0.011940364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037800173,0.0000039933025,2.6382983e-7,0.000007634459,0.00003018691,0.000030039206,0.000048466412,0.0000012868884,0.00005765273,0.97938585,0.010130022,0.01030083],"study_design_scores_gemma":[0.0000809253,0.00007238714,3.454342e-7,0.00004413623,0.00000346273,0.000017752225,5.3988776e-7,0.0010321799,0.00018336331,0.8162163,0.18205312,0.0002955242],"about_ca_topic_score_codex":9.50566e-7,"about_ca_topic_score_gemma":0.0000011245409,"teacher_disagreement_score":0.1719231,"about_ca_system_score_codex":0.000039206934,"about_ca_system_score_gemma":0.00007459052,"threshold_uncertainty_score":0.99997765},"labels":[],"label_agreement":null},{"id":"W4252734876","doi":"10.24124/2009/bpgub587","title":"Hamiltonian cycles in symmetric graphs.","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; University of Northern British Columbia; Library and Archives Canada","funders":"","keywords":"Combinatorics; Homogeneous space; Hamiltonian (control theory); Mathematics; Vertex (graph theory); Binary number; Hamiltonian path; Graph; Discrete mathematics; Geometry; Arithmetic","score_opus":0.016230905270881463,"score_gpt":0.313854579493623,"score_spread":0.29762367422274155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252734876","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18637432,0.0058176075,0.0246715,0.0006558434,0.0017234716,0.0017017631,0.000007100427,0.0011867955,0.7778616],"genre_scores_gemma":[0.8787369,0.0011767884,0.064854994,0.0005702937,0.000075093754,0.00012969975,0.00022530867,0.000088211396,0.05414269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784666,0.00010553709,0.00032212219,0.0006637596,0.000554138,0.00050775876],"domain_scores_gemma":[0.99874645,0.00014991296,0.000098196644,0.00078832253,0.00010200198,0.00011509571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037754816,0.0002611129,0.000309093,0.0026249518,0.00007578646,0.00014943672,0.001790201,0.00023035266,0.000024436575],"category_scores_gemma":[0.000103600534,0.00024520035,0.00012525712,0.003906482,0.000025336314,0.00042247458,0.00006807563,0.0005435332,0.00011444466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012413583,0.00006366245,0.00022653128,0.000025184345,0.000007279316,0.000049544484,0.00017047732,0.000015271225,0.000110072586,0.71297,0.00018356869,0.28616598],"study_design_scores_gemma":[0.00032876708,0.000108315144,0.12691751,0.000101573714,0.0000032733324,0.0000055277283,0.00012368512,0.0013617723,0.0018129576,0.8678239,0.0008975811,0.00051514944],"about_ca_topic_score_codex":0.000084466774,"about_ca_topic_score_gemma":0.0015196445,"teacher_disagreement_score":0.7237189,"about_ca_system_score_codex":0.000070151684,"about_ca_system_score_gemma":0.000116380244,"threshold_uncertainty_score":0.9998981},"labels":[],"label_agreement":null},{"id":"W4253269339","doi":"10.1007/978-1-4939-7131-2_100463","title":"Heterogeneous Graph","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.03217080802089717,"score_gpt":0.2821233465326942,"score_spread":0.24995253851179705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253269339","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033662977,0.0002771562,0.27331877,0.000076160366,0.0002553794,0.0001568924,0.0000040422087,0.00029859287,0.72560966],"genre_scores_gemma":[0.00030361887,0.00011261865,0.025277862,0.00036488267,0.00017366833,0.000007832402,0.0000041383178,0.0000490371,0.97370636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981498,0.000019128007,0.00022141237,0.0007148996,0.0005079771,0.0003867702],"domain_scores_gemma":[0.9978894,0.000085521926,0.00008890643,0.0015810379,0.00017754988,0.00017755646],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019500495,0.0003012565,0.00026166695,0.00034436013,0.000109225366,0.00011475534,0.002038398,0.00022436108,0.0026844412],"category_scores_gemma":[0.000010986786,0.000262882,0.000214707,0.00006945798,0.00027419953,0.00018440063,0.0008241051,0.0003058251,0.003997349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036622266,0.000004530152,3.3459014e-7,0.000006841745,0.000035317848,0.00007490639,0.000027157319,0.0000029656508,0.000014721728,0.98300016,0.004386719,0.012442685],"study_design_scores_gemma":[0.000058746886,0.000105018924,2.7623756e-7,0.000018688124,0.0000027090762,0.00005414985,3.3078936e-7,0.0001464763,0.0003443503,0.7416713,0.25734812,0.0002498044],"about_ca_topic_score_codex":0.0000011983707,"about_ca_topic_score_gemma":0.000008840587,"teacher_disagreement_score":0.2529614,"about_ca_system_score_codex":0.00003665083,"about_ca_system_score_gemma":0.00005703384,"threshold_uncertainty_score":0.99998236},"labels":[],"label_agreement":null},{"id":"W4253689634","doi":"10.1002/jgt.20334","title":"Bounding χ in terms of ω and Δ for quasi‐line graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Combinatorics; Mathematics; Line graph; Conjecture; Cubic graph; Graph; Discrete mathematics; Omega; Vertex (graph theory); Vertex-transitive graph; Graph power; Voltage graph; Physics","score_opus":0.04185691599901831,"score_gpt":0.3278837972455143,"score_spread":0.286026881246496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253689634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61491495,0.0008810238,0.3834916,0.00014464215,0.00019641258,0.00013973154,0.0000023179673,0.0000091325555,0.00022020162],"genre_scores_gemma":[0.97552687,0.00044413735,0.02388853,0.00004794232,0.00003710237,0.0000035466405,1.6183301e-7,0.000009898354,0.00004182686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985532,0.0002129597,0.0005168265,0.00015710152,0.0002999967,0.00025992768],"domain_scores_gemma":[0.99832594,0.0008195139,0.00035645178,0.00025246144,0.00013896658,0.000106680665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026036096,0.000110446475,0.0003289789,0.0009965919,0.00010388194,0.000020317086,0.00065145094,0.000050059683,0.0000029153841],"category_scores_gemma":[0.00030708243,0.00008823667,0.00017373518,0.00066943443,0.00036491646,0.00056573894,0.000093117786,0.00024365148,2.781362e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003830427,0.000165044,0.011844054,0.00004586663,0.00004330856,0.00007609963,0.0013017327,0.0000594811,0.00556461,0.96752596,0.00004598981,0.01294484],"study_design_scores_gemma":[0.0010654539,0.0006746533,0.004539714,0.000082514,0.0000052811747,0.00036904064,0.00008349929,0.0003805802,0.0029851373,0.9895996,0.00011909736,0.00009541808],"about_ca_topic_score_codex":9.996614e-7,"about_ca_topic_score_gemma":0.0000023375653,"teacher_disagreement_score":0.36061192,"about_ca_system_score_codex":0.00001774529,"about_ca_system_score_gemma":0.000045426827,"threshold_uncertainty_score":0.35981873},"labels":[],"label_agreement":null},{"id":"W4254576424","doi":"10.1007/s00224-007-9040-7","title":"Algorithms in the W-Hierarchy","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hierarchy; Mathematical proof; Intersection (aeronautics); Extension (predicate logic); Set (abstract data type); Upper and lower bounds; Mathematics; State (computer science); Computer science; Discrete mathematics; Theoretical computer science; Algorithm; Programming language; Engineering","score_opus":0.0302898493409319,"score_gpt":0.31553094789313363,"score_spread":0.2852410985522017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254576424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113554046,0.0004779067,0.8770537,0.00007344604,0.00039130574,0.0003174102,5.864129e-7,0.00008309704,0.008048524],"genre_scores_gemma":[0.9920801,0.0000022292938,0.007611573,0.00007377514,0.00011510114,0.000002898566,4.664228e-7,0.000009789998,0.00010406279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970555,0.0010333585,0.0005058944,0.0003007109,0.00058576814,0.00051876745],"domain_scores_gemma":[0.99595094,0.0028701033,0.00016960964,0.00085435004,0.00009783893,0.000057174333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016545834,0.00013336093,0.0002459705,0.00033075718,0.00012558427,0.00007114197,0.0022120979,0.00005271568,0.0000014852823],"category_scores_gemma":[0.00015203586,0.00009459269,0.000069478956,0.0010895835,0.00021120433,0.00017101472,0.00025812842,0.00029926907,0.000017052329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017678989,0.00004590408,0.00034622976,0.000034864093,0.000009150084,0.000033485525,0.005394362,0.0011714284,0.00033405988,0.95781535,0.000022735861,0.034774777],"study_design_scores_gemma":[0.0017206545,0.00052341074,0.02229135,0.0005994526,0.000008610391,0.00047189943,0.0074990625,0.14929405,0.0033893462,0.81064457,0.0027845707,0.00077304756],"about_ca_topic_score_codex":0.000019863217,"about_ca_topic_score_gemma":0.0000020992788,"teacher_disagreement_score":0.87852603,"about_ca_system_score_codex":0.000038480695,"about_ca_system_score_gemma":0.000036592082,"threshold_uncertainty_score":0.57344884},"labels":[],"label_agreement":null},{"id":"W4255025375","doi":"10.1002/jgt.20480","title":"Cycle and cocycle coverings of graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Cover (algebra); Discrete mathematics; Simple graph","score_opus":0.006994280001931636,"score_gpt":0.2609395767562744,"score_spread":0.25394529675434274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255025375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92640287,0.00046903637,0.07113025,0.00019328127,0.00038988152,0.00006664175,0.00000217507,0.000018465502,0.0013274145],"genre_scores_gemma":[0.98433757,0.00013310245,0.015358746,0.00009115526,0.000031009324,9.543392e-7,7.1119906e-8,0.000010148973,0.00003725769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986837,0.00015459889,0.0003843223,0.00015299188,0.0003943633,0.00023004887],"domain_scores_gemma":[0.99831194,0.00048007927,0.00037539308,0.00040017528,0.00025622567,0.00017620453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021776382,0.00011301728,0.00026329805,0.0005010052,0.000074758536,0.00004738864,0.0009292215,0.00006410361,0.000028681186],"category_scores_gemma":[0.00023675773,0.000091280024,0.00016157776,0.00051169086,0.00046740336,0.0006919643,0.00019542177,0.0005210181,0.0000020890159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010345022,0.00006478331,0.0017120324,0.000016995355,0.000043588752,0.00002550241,0.00037536529,0.000017687755,0.08604925,0.8965266,0.000072422634,0.014992351],"study_design_scores_gemma":[0.0005076618,0.00023076184,0.0054901494,0.000021782962,0.000008559998,0.00026299077,0.000059456517,0.000088735964,0.019624244,0.9730149,0.0005916515,0.00009912064],"about_ca_topic_score_codex":0.0000020124153,"about_ca_topic_score_gemma":0.000001978054,"teacher_disagreement_score":0.076488316,"about_ca_system_score_codex":0.000005519035,"about_ca_system_score_gemma":0.000048951206,"threshold_uncertainty_score":0.37222913},"labels":[],"label_agreement":null},{"id":"W4255327711","doi":"10.1002/jgt.20307","title":"Odd‐angulated graphs and cancelling factors in box products","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Combinatorics; Homomorphism; Mathematics; Graph; Graph homomorphism; Girth (graph theory); Discrete mathematics; Path (computing); Connectivity; Graph power; Line graph; Computer science","score_opus":0.025640238291251068,"score_gpt":0.2670994768727819,"score_spread":0.24145923858153084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255327711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9777198,0.0032119877,0.018284198,0.00016164091,0.00029110693,0.00012223913,9.911524e-7,0.000031875614,0.00017619829],"genre_scores_gemma":[0.9929811,0.00094141474,0.0058880686,0.000053453412,0.000029166518,0.0000015119696,2.6672075e-7,0.000014615878,0.00009043559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980432,0.0003685193,0.00047494523,0.00027365898,0.00044976026,0.00038995128],"domain_scores_gemma":[0.9985454,0.00036351502,0.00029516214,0.00036213765,0.00026202315,0.00017177491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016738008,0.0001757969,0.0003300496,0.0010638495,0.00016714269,0.000041255844,0.0007730962,0.000067776695,0.000007344882],"category_scores_gemma":[0.00026791508,0.000138112,0.000110316876,0.0015493243,0.00034596075,0.00081032387,0.00011653531,0.0005424806,0.0000014269974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000654971,0.00045053943,0.123596266,0.0001057935,0.00024045078,0.0018185591,0.015335565,0.0013714076,0.045413427,0.79646844,0.0003379815,0.014206625],"study_design_scores_gemma":[0.0009682118,0.00030759038,0.04367033,0.000114563845,0.000009090744,0.00069400435,0.00030474493,0.0001586519,0.026232589,0.92700565,0.00024317333,0.00029141255],"about_ca_topic_score_codex":0.000009434852,"about_ca_topic_score_gemma":0.000005326867,"teacher_disagreement_score":0.13053723,"about_ca_system_score_codex":0.00003914433,"about_ca_system_score_gemma":0.00013240414,"threshold_uncertainty_score":0.56320435},"labels":[],"label_agreement":null},{"id":"W4255623367","doi":"10.32920/ryerson.14652594.v1","title":"Wall cops and robbers","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Hypercube; Combinatorics; Graph; Computer science; Mathematics; Theoretical computer science","score_opus":0.02797876477314936,"score_gpt":0.3040144018227216,"score_spread":0.27603563704957224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255623367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01807862,0.0011299051,0.9601251,0.001984243,0.00037091158,0.0002341555,0.0000014140821,0.00025624337,0.017819406],"genre_scores_gemma":[0.44031587,0.00068630575,0.5482817,0.0011058387,0.00006213031,0.00006288329,0.000014961179,0.00003078502,0.009439532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985102,0.00010600159,0.0001365037,0.0006959525,0.00027934008,0.00027201266],"domain_scores_gemma":[0.99855447,0.00012366832,0.0000415444,0.0010331859,0.000109412256,0.0001377215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030301546,0.000155283,0.0001989672,0.00011135451,0.00006057647,0.00039960817,0.0010825671,0.00012551562,0.000073213734],"category_scores_gemma":[0.000049641298,0.00014258876,0.00006204514,0.00018373677,0.00008782888,0.00019956414,0.0049584094,0.0005241639,0.000017784538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009726814,0.00008771309,0.00094670954,0.00027292816,0.0001335781,0.00031141634,0.0019567776,0.0015720957,0.00076464785,0.8818711,0.00197256,0.11010073],"study_design_scores_gemma":[0.00068262976,0.00010409176,0.002852326,0.00026401287,0.0000149464695,0.00011773372,0.0002874982,0.14865233,0.006207647,0.8286828,0.010707732,0.0014262507],"about_ca_topic_score_codex":0.00004483748,"about_ca_topic_score_gemma":0.000028287528,"teacher_disagreement_score":0.42223725,"about_ca_system_score_codex":0.0000336716,"about_ca_system_score_gemma":0.00014076038,"threshold_uncertainty_score":0.61803025},"labels":[],"label_agreement":null},{"id":"W4255798272","doi":"10.1002/jgt.20006","title":"Interval bigraphs and circular arc graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Interval graph; Chordal graph; Indifference graph; Bipartite graph; Cograph; Conjecture; Discrete mathematics; Split graph; Permutation graph; Vertex (graph theory); Interval (graph theory); Graph; 1-planar graph","score_opus":0.015949460529420006,"score_gpt":0.2725096860002505,"score_spread":0.25656022547083046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255798272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47934455,0.0043243705,0.51427037,0.0007052481,0.0004746357,0.00012528032,0.0000018316694,0.000057107904,0.00069658016],"genre_scores_gemma":[0.98037034,0.00052790146,0.01868665,0.000310762,0.000052322855,0.0000026968526,1.9570332e-7,0.000018430192,0.000030704196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978137,0.0003616153,0.00051812513,0.0002902567,0.00059855345,0.00041776057],"domain_scores_gemma":[0.9982344,0.00028288484,0.000338901,0.00053216756,0.0002824128,0.00032924872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027767795,0.00020813632,0.00035649486,0.0012287477,0.0001738268,0.00014217637,0.0013537067,0.000084317086,0.000012611037],"category_scores_gemma":[0.00021069526,0.0001668371,0.00036980063,0.0011251896,0.000506126,0.0010043342,0.00024584142,0.00061273685,0.000006912717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011082998,0.00010790374,0.00073475926,0.000022750204,0.00013254558,0.0002752341,0.0008292059,0.00009943292,0.0050913393,0.9709149,0.000027363294,0.02165373],"study_design_scores_gemma":[0.0010719011,0.00044862018,0.002491829,0.00009877181,0.000017604189,0.0010415195,0.00019336835,0.000015972644,0.0038061526,0.99043256,0.00019906629,0.00018262524],"about_ca_topic_score_codex":0.0000020096854,"about_ca_topic_score_gemma":0.000001419948,"teacher_disagreement_score":0.5010258,"about_ca_system_score_codex":0.000036593963,"about_ca_system_score_gemma":0.00010329421,"threshold_uncertainty_score":0.6803419},"labels":[],"label_agreement":null},{"id":"W4256250877","doi":"10.1002/jgt.20203","title":"Closure for the property of having a hamiltonian prism","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Quartic graph; Graph; Hamiltonian (control theory); Prism; Graph power; Discrete mathematics; Line graph; Physics; Optics","score_opus":0.016521925811267636,"score_gpt":0.27070374401507796,"score_spread":0.2541818182038103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256250877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041295804,0.0026650869,0.95306915,0.0012794973,0.00036977348,0.0003786336,0.0000028702575,0.000023032284,0.0009161678],"genre_scores_gemma":[0.96152645,0.00006743298,0.037222233,0.00010907596,0.00017287825,0.000012080169,2.0879106e-7,0.00001914701,0.0008704672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824286,0.0002896405,0.00052708073,0.00015728286,0.00048106434,0.00030206423],"domain_scores_gemma":[0.99743664,0.0010887706,0.0005164543,0.00051466184,0.00038014268,0.00006333368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038732719,0.00012868359,0.0002587415,0.0002978301,0.00021105545,0.00006573346,0.0016263061,0.00005770169,0.000005694],"category_scores_gemma":[0.0002410494,0.00006231091,0.00037005634,0.0005301111,0.00030595213,0.00045023582,0.00013071523,0.00033033357,0.0000011636786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003507813,0.00018082283,0.0019710204,0.000045297737,0.0001284786,0.000023728982,0.0006205535,0.00040707528,0.012371001,0.92951894,0.0014789011,0.052903406],"study_design_scores_gemma":[0.00073454995,0.0003872263,0.00525956,0.00008271595,0.000028065348,0.00013121495,0.00011762045,0.00067532616,0.0069763116,0.97884387,0.006642288,0.000121269586],"about_ca_topic_score_codex":0.000005632626,"about_ca_topic_score_gemma":0.0000043538707,"teacher_disagreement_score":0.9202307,"about_ca_system_score_codex":0.000024068102,"about_ca_system_score_gemma":0.0001196792,"threshold_uncertainty_score":0.30221084},"labels":[],"label_agreement":null},{"id":"W4256347034","doi":"10.1002/net.20318","title":"Improper coloring of unit disk graphs","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Complete coloring; Mathematics; Indifference graph; Edge coloring; Chromatic scale; Graph coloring; Discrete mathematics; Chordal graph; Graph; Interval graph; Computer science; Interval (graph theory); Unit disk; 1-planar graph; Line graph; Graph power","score_opus":0.021960333528217062,"score_gpt":0.2843527786470723,"score_spread":0.26239244511885523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256347034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09576763,0.0006222222,0.8941368,0.00024131755,0.00024867314,0.0001977425,5.759873e-7,0.00015283718,0.008632224],"genre_scores_gemma":[0.9919477,0.000059418708,0.0076179425,0.000118124735,0.000043643544,0.0000043142536,6.568573e-7,0.000005166157,0.0002030511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999056,0.00006076845,0.00014676654,0.00021704347,0.00020042104,0.00031900004],"domain_scores_gemma":[0.999207,0.00008061402,0.000049178034,0.00050164515,0.00007985834,0.00008165839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028990005,0.00008395412,0.0001245863,0.000090438385,0.0000755812,0.000032524127,0.0007834257,0.00005159083,0.00001036604],"category_scores_gemma":[0.000019063553,0.00007115846,0.00005457827,0.0007809225,0.000067184475,0.00026795358,0.00013471842,0.00021071733,0.000006844862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033812754,0.000068223104,0.0026006524,0.0000048468287,0.000013680974,0.0000152089815,0.00015370682,0.018551521,0.001316013,0.6932797,0.00027318194,0.28368947],"study_design_scores_gemma":[0.0010711226,0.0010453404,0.05185123,0.000101123216,0.000010473571,0.000019827285,0.000044135635,0.46279487,0.004612857,0.47279826,0.005072464,0.0005783052],"about_ca_topic_score_codex":0.0000032773214,"about_ca_topic_score_gemma":0.0000020913371,"teacher_disagreement_score":0.89618003,"about_ca_system_score_codex":0.000009364385,"about_ca_system_score_gemma":0.000016998525,"threshold_uncertainty_score":0.29017577},"labels":[],"label_agreement":null},{"id":"W4256561526","doi":"10.1007/978-3-540-79228-4_15","title":"Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; Université du Québec en Outaouais; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Planar graph; Combinatorics; Unit disk graph; Vertex (graph theory); Computer science; Graph factorization; Graph coloring; Graph; Complete coloring; Mathematics; Graph power; Line graph","score_opus":0.032815704219324796,"score_gpt":0.28332560821975944,"score_spread":0.25050990400043466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256561526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003056797,0.0007141968,0.99597096,0.00015871695,0.0008346714,0.00075756694,0.000023481727,0.00012924681,0.001105465],"genre_scores_gemma":[0.39348364,0.00037843987,0.6050647,0.00042087294,0.00018485873,0.000058149748,0.000013606406,0.00008851233,0.00030726191],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952907,0.000051811137,0.0006769899,0.0016668672,0.0012943778,0.0010192754],"domain_scores_gemma":[0.9956095,0.0015226802,0.0003592142,0.0017588754,0.0004950196,0.00025466635],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010894892,0.0005766409,0.0007602987,0.0019855998,0.00037411094,0.00013424744,0.0051756673,0.0003368539,0.000006502128],"category_scores_gemma":[0.00013509383,0.0005373391,0.00031336249,0.0015028004,0.0027762763,0.0006433471,0.0009707789,0.00086376944,0.00000838911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000760936,0.00007015275,0.00026841162,0.00016469818,0.00004491073,0.00013199293,0.0010472359,0.034013435,0.00040138225,0.3842227,0.000036112368,0.5795229],"study_design_scores_gemma":[0.00058850297,0.0006041056,0.00018403349,0.00038187418,0.000009170193,0.00009852927,5.781243e-7,0.14435446,0.0068618082,0.8443078,0.0018021554,0.00080699776],"about_ca_topic_score_codex":0.000018888297,"about_ca_topic_score_gemma":0.00007113987,"teacher_disagreement_score":0.5787159,"about_ca_system_score_codex":0.00014881084,"about_ca_system_score_gemma":0.00056495215,"threshold_uncertainty_score":0.9999376},"labels":[],"label_agreement":null},{"id":"W4281251691","doi":"10.1016/j.dam.2022.04.014","title":"Critical independent sets of König–Egerváry graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Xi’an Jiaotong University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Thompson Rivers University","keywords":"Mathematics; Combinatorics; Independence number; Independent set; Vertex (graph theory); Discrete mathematics; Graph; Simple graph; Bipartite graph","score_opus":0.02301127744059721,"score_gpt":0.3104668868562302,"score_spread":0.287455609415633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281251691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047287576,0.00014601464,0.921687,0.0004248551,0.00021504286,0.00070643646,0.00005911136,0.0002640039,0.029209936],"genre_scores_gemma":[0.8509997,0.000005345584,0.14861454,0.00009710121,0.000007874986,0.00018379724,0.000005956195,0.000025549498,0.000060104354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744546,0.00007115012,0.0004571733,0.00040053471,0.0011223683,0.0005033264],"domain_scores_gemma":[0.9980113,0.0005405456,0.00014225693,0.0010767513,0.00007644686,0.00015270525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000958622,0.00018397611,0.0003232755,0.0002339535,0.0002814996,0.00005871033,0.001683512,0.000044307744,0.00015720182],"category_scores_gemma":[0.000113137794,0.00017692156,0.00012653353,0.0007474142,0.00020845108,0.00017875545,0.001629613,0.00041158462,0.000028822069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001120379,0.00017763325,0.0000134826605,0.00012168344,0.000021247602,0.00001519129,0.0015435504,0.00017821431,0.0063595963,0.9898654,0.0001383808,0.0015543943],"study_design_scores_gemma":[0.00028440764,0.00009085676,0.00004345479,0.000010658845,0.000010320002,0.000030366567,0.0011363383,0.009105276,0.00667951,0.9821465,0.00023881043,0.00022348229],"about_ca_topic_score_codex":0.0000015121218,"about_ca_topic_score_gemma":6.453569e-7,"teacher_disagreement_score":0.8037121,"about_ca_system_score_codex":0.000052522802,"about_ca_system_score_gemma":0.0000743812,"threshold_uncertainty_score":0.72146523},"labels":[],"label_agreement":null},{"id":"W4281661106","doi":"10.1137/1.9781611977554.ch116","title":"Sparse graphs with bounded induced cycle packing number have logarithmic treewidth","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"Berlin Mathematics Research Center MATH+; Agence Nationale de la Recherche; Deutsche Forschungsgemeinschaft","keywords":"Treewidth; Combinatorics; Bipartite graph; Mathematics; Logarithm; Cograph; Independent set; Time complexity; Chordal graph; Indifference graph; Discrete mathematics; Maximal independent set; Disjoint sets; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.09548717066097315,"score_gpt":0.28618216172683714,"score_spread":0.190694991065864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281661106","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031856608,0.00002656614,0.09530932,0.00032826257,0.00060707494,0.008781871,0.00028226431,0.0013997577,0.8900792],"genre_scores_gemma":[0.018491331,0.00009255069,0.34474865,0.00072112266,0.001831179,0.0022752862,0.00018133514,0.0012307626,0.6304278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968322,0.000010776837,0.000577013,0.0009289402,0.00090572785,0.00074537226],"domain_scores_gemma":[0.9975473,0.00063382543,0.00049322104,0.0008626467,0.0002119646,0.00025099854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010008245,0.0006699264,0.0008630072,0.00012367778,0.0005879872,0.00038778494,0.00088228274,0.0009437252,0.000010270399],"category_scores_gemma":[0.000036617937,0.0005676397,0.00046208204,0.00010376508,0.0004974744,0.00010256562,0.0005770732,0.0012108547,0.000030726787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004394635,0.000024702244,5.7305397e-7,0.00016051097,0.00038244357,0.0000061356013,0.0013200135,0.0000026820426,0.00014551076,0.9748842,0.000969042,0.022060249],"study_design_scores_gemma":[0.0022126958,0.00014496436,1.7766085e-7,0.00029648078,0.00012531613,0.000020133248,0.0003422757,0.00084229227,0.000758823,0.98873395,0.005797698,0.0007251868],"about_ca_topic_score_codex":0.0000046412324,"about_ca_topic_score_gemma":0.000015666697,"teacher_disagreement_score":0.25965142,"about_ca_system_score_codex":0.000120813536,"about_ca_system_score_gemma":0.0003344541,"threshold_uncertainty_score":0.9996775},"labels":[],"label_agreement":null},{"id":"W4283011735","doi":"10.1137/21m1417077","title":"Robust Connectivity of Graphs on Surfaces","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Uniwersytet Warszawski","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Lambda; Discrete mathematics; Degeneracy (biology); Dominating set; Tree (set theory); Arboricity; Spanning tree; Invariant (physics); Graph; Planar graph","score_opus":0.046048372849475355,"score_gpt":0.2979433993994719,"score_spread":0.2518950265499965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283011735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7201879,0.00016850373,0.26682758,0.0012642655,0.0005572519,0.00039029936,0.000035091896,0.00010385464,0.010465251],"genre_scores_gemma":[0.97162825,0.000029767927,0.027933337,0.000096371325,0.00001854414,0.000011428649,7.186027e-7,0.0000220062,0.00025959456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738985,0.0003797109,0.00042819514,0.00024939308,0.0011953977,0.0003574766],"domain_scores_gemma":[0.9978196,0.0008321161,0.00042976727,0.000665316,0.000105079176,0.0001481271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001895395,0.00017821917,0.000326839,0.0003455049,0.0004927521,0.00010289867,0.0014311016,0.000028580525,0.00014274352],"category_scores_gemma":[0.0002582323,0.00014244003,0.00020018462,0.00071511895,0.00011225577,0.00026381927,0.0004247978,0.0007829976,0.000015982212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061237035,0.00042986672,0.00013668768,0.000050554325,0.0000612038,0.000074854965,0.001232779,0.04998526,0.0008971833,0.9451008,0.0003669444,0.0016026341],"study_design_scores_gemma":[0.0007212777,0.0019538414,0.0003611186,0.000110258654,0.000011003096,0.00030921565,0.0010371138,0.051134165,0.004281342,0.9391784,0.0005820203,0.00032026428],"about_ca_topic_score_codex":9.726081e-7,"about_ca_topic_score_gemma":8.009599e-7,"teacher_disagreement_score":0.25144035,"about_ca_system_score_codex":0.000089047026,"about_ca_system_score_gemma":0.00007441094,"threshold_uncertainty_score":0.5808536},"labels":[],"label_agreement":null},{"id":"W4283124407","doi":"10.4230/lipics.approx/random.2022.18","title":"Sketching Distances in Monotone Graph Classes","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Monotone polygon; Computer science; Graph; Theoretical computer science; Combinatorics; Mathematics; Geometry","score_opus":0.02570291299465333,"score_gpt":0.3180068150081586,"score_spread":0.29230390201350526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283124407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2016374,0.0007226366,0.77951986,0.00066078047,0.002972199,0.0042063775,0.0014193784,0.00071251934,0.008148863],"genre_scores_gemma":[0.8936199,0.0008017217,0.099618964,0.0009087009,0.00022704889,0.0026884244,0.0012963071,0.00017740806,0.00066155405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99362105,0.00025773112,0.0020522627,0.0009752339,0.0014656885,0.0016280427],"domain_scores_gemma":[0.99515855,0.0006121088,0.0010111656,0.0026112685,0.0002805377,0.0003263869],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002096372,0.0008905532,0.0011154357,0.001517248,0.0006377005,0.0011143903,0.006067426,0.0004339736,0.00006694419],"category_scores_gemma":[0.0002509197,0.0008941207,0.0006221947,0.0012444023,0.00029541962,0.002571968,0.0074542407,0.0032096677,0.000042422667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011194524,0.0028122233,0.049919084,0.009980984,0.0012248667,0.0002922027,0.0652428,0.056884773,0.00013424839,0.722733,0.005375316,0.08428105],"study_design_scores_gemma":[0.0065353406,0.0007171458,0.0036950263,0.0013851024,0.000068648085,0.00009270594,0.0069298996,0.24042055,0.000795833,0.59661937,0.13858949,0.0041508833],"about_ca_topic_score_codex":0.000058038764,"about_ca_topic_score_gemma":0.00009774502,"teacher_disagreement_score":0.69198245,"about_ca_system_score_codex":0.0005843322,"about_ca_system_score_gemma":0.0003551953,"threshold_uncertainty_score":0.9999226},"labels":[],"label_agreement":null},{"id":"W4283330479","doi":"10.4230/lipics.icalp.2022.81","title":"A Study of Weisfeiler-Leman Colorings on Planar Graphs","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Graph isomorphism; Discrete mathematics; Planar graph; Isomorphism (crystallography); Subgraph isomorphism problem; Line graph; Chordal graph; Pathwidth; Graph","score_opus":0.040270605147283325,"score_gpt":0.3205178733126442,"score_spread":0.2802472681653609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283330479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9450822,0.00006279453,0.03190287,0.00024082822,0.0022652883,0.0082161,0.00170867,0.00058737077,0.009933879],"genre_scores_gemma":[0.98485535,0.00005739744,0.011571709,0.00041948014,0.000076839926,0.0019719785,0.0004767748,0.00011678421,0.0004537091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99312514,0.00027157099,0.0021930884,0.00097146037,0.0021443637,0.001294387],"domain_scores_gemma":[0.99353606,0.0005842312,0.0014778455,0.0035684824,0.00047161587,0.0003617817],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018653256,0.00092165783,0.0013358885,0.0016356863,0.00065351406,0.00043806504,0.0064991903,0.00037679146,0.000074257405],"category_scores_gemma":[0.00017830434,0.00089935085,0.0006316614,0.0010551609,0.00024129401,0.0010162089,0.005876051,0.0025685118,0.000043812255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032242632,0.016988343,0.035728067,0.008116994,0.0044146646,0.0003391826,0.16732663,0.022477748,0.00012112057,0.7110922,0.01185435,0.018316437],"study_design_scores_gemma":[0.052434895,0.045652043,0.019021923,0.0034638662,0.0007857468,0.00035135608,0.091614105,0.10261589,0.003133522,0.4374449,0.23048593,0.012995814],"about_ca_topic_score_codex":0.000054541433,"about_ca_topic_score_gemma":0.000030101752,"teacher_disagreement_score":0.2736473,"about_ca_system_score_codex":0.00036259618,"about_ca_system_score_gemma":0.00026202924,"threshold_uncertainty_score":0.9997326},"labels":[],"label_agreement":null},{"id":"W42843301","doi":"10.1007/978-3-642-25591-5_38","title":"Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Path (computing); Planar graph; Planar; Grid; Graph theory; Mathematics; Time complexity; Minor (academic); Computer science; Combinatorics; Graph; Discrete mathematics; Geometry","score_opus":0.038764956491295466,"score_gpt":0.3027215662326018,"score_spread":0.26395660974130636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42843301","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044958422,0.00012051995,0.9956302,0.00022709904,0.0006350573,0.0021727206,0.000042772765,0.00019650973,0.00093013694],"genre_scores_gemma":[0.033873454,0.0000029290893,0.96415603,0.0012449546,0.00022283963,0.0001162801,0.000020198888,0.00006365447,0.00029964515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410886,0.0002290819,0.0006305574,0.0023754565,0.0017798701,0.00087620225],"domain_scores_gemma":[0.9938885,0.003095344,0.00033755568,0.00167708,0.00073797215,0.00026354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003841298,0.00068771705,0.0006379953,0.0011411601,0.0005003343,0.00030551892,0.0037445338,0.00025606426,0.000028172208],"category_scores_gemma":[0.00011516655,0.0005954888,0.00021176688,0.0007260262,0.001018128,0.00045535175,0.0011052178,0.00093968207,0.000046652454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044068955,0.00033733516,0.00003343516,0.000024622308,0.000023957697,0.00007171076,0.0004706334,0.039512362,0.00000542388,0.21375762,0.000009921999,0.7457089],"study_design_scores_gemma":[0.0005498195,0.0009887532,0.00017853534,0.00014227262,0.0000064064884,0.000010411805,2.697084e-7,0.38023648,0.000109257926,0.61717016,0.00015612395,0.0004515354],"about_ca_topic_score_codex":0.000006559235,"about_ca_topic_score_gemma":0.000009286959,"teacher_disagreement_score":0.7452574,"about_ca_system_score_codex":0.00031371842,"about_ca_system_score_gemma":0.0009323349,"threshold_uncertainty_score":0.99964964},"labels":[],"label_agreement":null},{"id":"W4285020995","doi":"10.1007/s00453-022-01069-w","title":"The Complexity of Two Colouring Games","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Vancouver Island University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Algorithm; Graph; Computer science; Artificial intelligence; Combinatorics; Mathematics","score_opus":0.044289254215219065,"score_gpt":0.3150605287076965,"score_spread":0.27077127449247745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285020995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088488534,0.0012959124,0.8889742,0.010271727,0.001209997,0.00083624193,0.000045490477,0.00038523067,0.0084926495],"genre_scores_gemma":[0.95464694,0.000008157328,0.044694733,0.00008946969,0.00003085059,0.00005573755,0.0000010457069,0.000007924398,0.00046511425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872214,0.00022997132,0.000150586,0.0002037961,0.00042194384,0.00027154214],"domain_scores_gemma":[0.99889815,0.00033162785,0.00007236861,0.0005950816,0.00005664418,0.000046117293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006770734,0.00006401908,0.00009846719,0.000057239504,0.00064826553,0.000035197158,0.0016642101,0.0000071269683,0.000033044205],"category_scores_gemma":[0.000039198043,0.000050997776,0.00005523859,0.00049150264,0.00041399486,0.00011021436,0.0013776862,0.000225062,0.0000080999425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009735555,0.000037589216,0.000076125594,0.0000024767594,0.000015998798,0.000009369313,0.00024478475,0.00032774385,0.0008257453,0.9256141,0.00033035473,0.07250596],"study_design_scores_gemma":[0.0004185283,0.00016548707,0.0007632535,0.0000027344465,0.0000022942424,0.000036360663,0.00018512967,0.082179524,0.009535691,0.8873824,0.019195518,0.00013307584],"about_ca_topic_score_codex":0.000026799697,"about_ca_topic_score_gemma":0.000004471435,"teacher_disagreement_score":0.8661584,"about_ca_system_score_codex":0.000043501183,"about_ca_system_score_gemma":0.000052302203,"threshold_uncertainty_score":0.49859998},"labels":[],"label_agreement":null},{"id":"W4285075493","doi":"10.48550/arxiv.1907.07441","title":"Maximum rectilinear convex subsets","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Departamento de Investigaciones Científicas y Tecnológicas, Universidad de Santiago de Chile; Comisión Nacional de Investigación Científica y Tecnológica; European Commission; Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; Gobierno de Aragón; Universidad de Santiago de Chile","keywords":"Convex hull; Combinatorics; Mathematics; Orthogonal convex hull; Regular polygon; Convex set; Boundary (topology); Convex polytope; Hull; Convex body; Point (geometry); Plane (geometry); Mixed volume; Convex combination; Interior point method; Geometry; Mathematical analysis; Algorithm; Convex optimization; Materials science","score_opus":0.08574779962800823,"score_gpt":0.22103733134798143,"score_spread":0.1352895317199732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285075493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15451303,0.00013138233,0.832637,0.00011863072,0.001326106,0.00060004817,0.000023150142,0.00048750776,0.010163142],"genre_scores_gemma":[0.9878934,0.00021289679,0.00286903,0.00011013691,0.00006932047,0.000001297494,0.000014985328,0.000034262634,0.008794665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969546,0.00031524198,0.0002117783,0.0016771447,0.00019197371,0.0006492704],"domain_scores_gemma":[0.9961613,0.00026504375,0.00021900942,0.0027999948,0.0002933542,0.00026132909],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005014328,0.00038823576,0.00045846723,0.00046542147,0.00015286646,0.00014890931,0.003908615,0.00038756384,0.00009706864],"category_scores_gemma":[0.00007988638,0.0004541416,0.00028799157,0.00095275877,0.00022188274,0.0005198473,0.004361956,0.0012472136,0.0013218584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017732881,0.00020518205,0.007378042,0.00025704224,0.00023907775,0.001334133,0.0002982315,0.20993645,0.00024188672,0.77563334,0.0011545145,0.003144786],"study_design_scores_gemma":[0.0007821517,0.00009881364,0.00082291267,0.00009901407,0.0000310833,0.000014752808,0.000054420092,0.46983352,0.0010902162,0.5211327,0.005191129,0.0008493142],"about_ca_topic_score_codex":0.000047379293,"about_ca_topic_score_gemma":0.00001045677,"teacher_disagreement_score":0.83338034,"about_ca_system_score_codex":0.00023935041,"about_ca_system_score_gemma":0.00033393202,"threshold_uncertainty_score":0.999791},"labels":[],"label_agreement":null},{"id":"W4285106094","doi":"10.1007/978-981-19-0957-3_5","title":"Trees","year":2022,"lang":"en","type":"book-chapter","venue":"Texts and readings in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Graph; Computer science; Mathematics; Combinatorics; Forestry; Geography","score_opus":0.02774547025241809,"score_gpt":0.28150271713564173,"score_spread":0.25375724688322365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285106094","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007335818,0.0011186056,0.013825039,0.00021618685,0.000112201305,0.0003147573,0.000008261089,0.00011595426,0.9842156],"genre_scores_gemma":[0.0015663925,0.0016160534,0.056186393,0.00009350438,0.000052926418,0.00002868748,0.000004968435,0.00007491986,0.94037616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870276,0.000012870392,0.00030125224,0.00036966003,0.00037103228,0.00024243149],"domain_scores_gemma":[0.99893045,0.0002937994,0.00015698753,0.0005215342,0.000025776188,0.0000714325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004958592,0.00022173516,0.00035008797,0.00033332748,0.00011124371,0.00008604696,0.00077424274,0.00011545067,0.00030748374],"category_scores_gemma":[0.00003949135,0.0001894453,0.00006226207,0.0000799961,0.00013965355,0.0001621138,0.00075254537,0.0005017483,0.000037146176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012387541,0.000017437487,0.0000030221017,0.00008203037,0.000010895274,0.00005279181,0.00102843,0.0000030011222,0.000013210825,0.98542666,0.00026934495,0.013091908],"study_design_scores_gemma":[0.0000975479,0.00004814113,0.0000037235168,0.00014123775,0.000004539203,0.00004803041,0.00002015935,0.0012670859,0.000012382486,0.9157025,0.08244328,0.00021136823],"about_ca_topic_score_codex":0.0000017563199,"about_ca_topic_score_gemma":0.0000054721513,"teacher_disagreement_score":0.082173936,"about_ca_system_score_codex":0.00005843246,"about_ca_system_score_gemma":0.000029758077,"threshold_uncertainty_score":0.7725355},"labels":[],"label_agreement":null},{"id":"W4285174338","doi":"10.1007/978-981-19-0957-3_8","title":"Matching Theory","year":2022,"lang":"en","type":"book-chapter","venue":"Texts and readings in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Disjoint sets; Pairwise comparison; Matching (statistics); Mathematics; Graph; Discrete mathematics; Statistics","score_opus":0.023000625730765358,"score_gpt":0.27914971192498444,"score_spread":0.2561490861942191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285174338","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012626946,0.001111875,0.08814411,0.00011681531,0.00014254168,0.00035097942,0.000007837031,0.0001411795,0.9098584],"genre_scores_gemma":[0.0029226097,0.0013981167,0.09652503,0.00018713622,0.000072919975,0.00003702189,0.000006178061,0.00012650304,0.8987245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984601,0.000033935656,0.00036203177,0.00043102296,0.00041625043,0.00029663852],"domain_scores_gemma":[0.9984373,0.0006443379,0.00020378357,0.0006073138,0.000027097702,0.00008015914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013122003,0.0002686334,0.00039659283,0.0003690672,0.00016853251,0.000116336065,0.00092040753,0.00013518949,0.00038137555],"category_scores_gemma":[0.00003772283,0.00023108923,0.000075096665,0.00008180847,0.00015434493,0.00021675056,0.001040057,0.00074358506,0.000043667867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026125074,0.000017170865,8.27519e-7,0.0001468658,0.00001621094,0.00006530383,0.0032701502,0.000006014457,0.000018180293,0.98328567,0.00006217722,0.013108813],"study_design_scores_gemma":[0.000099591794,0.000034694174,0.0000010715407,0.00022801744,0.0000064807346,0.00007407887,0.000081870756,0.00039403234,0.000011275599,0.97652084,0.022289183,0.0002588722],"about_ca_topic_score_codex":0.0000018234568,"about_ca_topic_score_gemma":0.000002013821,"teacher_disagreement_score":0.022227006,"about_ca_system_score_codex":0.00007522493,"about_ca_system_score_gemma":0.00003573813,"threshold_uncertainty_score":0.94235456},"labels":[],"label_agreement":null},{"id":"W4285186269","doi":"10.1007/978-981-19-0957-3_11","title":"Edges and Cycles","year":2022,"lang":"en","type":"book-chapter","venue":"Texts and readings in mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Graph; Enhanced Data Rates for GSM Evolution; Multiple edges; Mathematics; Computer science; Artificial intelligence","score_opus":0.030236779175911603,"score_gpt":0.2828326274313007,"score_spread":0.2525958482553891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285186269","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091385713,0.0058092074,0.017480223,0.000591649,0.00017434898,0.0006269598,0.000017416633,0.00018281181,0.9742035],"genre_scores_gemma":[0.009863073,0.01235051,0.13665561,0.00022107788,0.0001317436,0.0000590691,0.000008703899,0.00017188753,0.8405383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989003,0.000012615738,0.00024861796,0.0003601125,0.00026880653,0.00020954025],"domain_scores_gemma":[0.9990766,0.00032961776,0.00013032091,0.00036633108,0.000022745437,0.00007435647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045395677,0.00020652168,0.00032484366,0.0002738061,0.00012686528,0.00010469349,0.00045904395,0.00010711671,0.00008852254],"category_scores_gemma":[0.00004004415,0.0001750179,0.00003481029,0.000054392014,0.00021086854,0.00015784512,0.0008294481,0.00040720953,0.000010170951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011906391,0.000011683872,0.000009365202,0.00015946045,0.000010240314,0.0000322713,0.0012075356,7.970942e-7,0.000014594832,0.9700964,0.00012407107,0.028332366],"study_design_scores_gemma":[0.000098546254,0.000042534048,0.000012863168,0.0001856985,0.0000055002797,0.000073393974,0.0000362385,0.0007459666,0.000022456356,0.9664886,0.03207937,0.00020883093],"about_ca_topic_score_codex":0.0000014437004,"about_ca_topic_score_gemma":0.0000027356791,"teacher_disagreement_score":0.1336652,"about_ca_system_score_codex":0.000030397732,"about_ca_system_score_gemma":0.000019834088,"threshold_uncertainty_score":0.71370226},"labels":[],"label_agreement":null},{"id":"W4285687327","doi":"10.26686/wgtn.12212528.v1","title":"Certifying non-representability of matroids over prime fields","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund","keywords":"Matroid; Prime (order theory); Rank (graph theory); Element (criminal law); Combinatorics; Mathematics; Finite field; Discrete mathematics; Political science","score_opus":0.06243789805997328,"score_gpt":0.35538502633549324,"score_spread":0.29294712827551994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285687327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042197447,0.000072675786,0.9440792,0.0015732248,0.00039842844,0.0005757002,0.0000091966085,0.000215941,0.010878158],"genre_scores_gemma":[0.92737055,0.000015365367,0.071993224,0.00013941753,0.00007074549,0.000037936876,0.0000048812585,0.000017273935,0.0003505945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971568,0.00017645143,0.0005121014,0.0010679861,0.0006863848,0.0004002658],"domain_scores_gemma":[0.9966697,0.00031452827,0.00019486902,0.002461922,0.00016738263,0.00019160534],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00052201276,0.00027143085,0.00050513155,0.0001520861,0.000056670062,0.0001105263,0.0030184535,0.00026609012,0.00023628096],"category_scores_gemma":[0.00020713934,0.00024891345,0.0003060986,0.00041156515,0.00015852846,0.00026390882,0.008897392,0.0009772581,0.000041131632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006774994,0.0015967815,0.07108754,0.006688407,0.0012132251,0.00026078668,0.011397223,0.010732349,0.11693836,0.6042694,0.011246729,0.16389169],"study_design_scores_gemma":[0.00054413005,0.000169281,0.018383874,0.00014264943,0.000018074194,0.000005438071,0.000055884004,0.16219568,0.17339677,0.64385146,0.00046575294,0.0007709907],"about_ca_topic_score_codex":0.00023814834,"about_ca_topic_score_gemma":0.00001187271,"teacher_disagreement_score":0.88517314,"about_ca_system_score_codex":0.000071824434,"about_ca_system_score_gemma":0.00024351363,"threshold_uncertainty_score":0.9999963},"labels":[],"label_agreement":null},{"id":"W4285773650","doi":"10.1016/j.tcs.2022.12.014","title":"The Maker-Breaker Largest Connected Subgraph game","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Agence Nationale de la Recherche; H2020 European Research Council; Providence Health Care; University for the Creative Arts","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Connected component; Induced subgraph; Graph; Discrete mathematics; Factor-critical graph; Planar graph; Distance-hereditary graph; Graph power; Line graph","score_opus":0.010715997083649407,"score_gpt":0.26696795117937877,"score_spread":0.2562519540957294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285773650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037402622,0.00015886092,0.9516558,0.005315783,0.0012558759,0.00041324258,0.000007125649,0.00045683933,0.0033338345],"genre_scores_gemma":[0.9805079,0.00001047902,0.01820152,0.001014032,0.000080042344,0.00007953137,0.0000012723664,0.000016935846,0.00008825246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994424,0.0007207812,0.00035851847,0.0010785834,0.0020414838,0.0013766582],"domain_scores_gemma":[0.9956683,0.0015012814,0.000099961006,0.0020299337,0.00029968435,0.00040086007],"candidate_categories":["sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0052033914,0.00024856225,0.00022378082,0.00029813114,0.0036828069,0.0008332814,0.00823984,0.000032494296,0.00016560663],"category_scores_gemma":[0.00025524996,0.00017763209,0.00012919445,0.0044914824,0.0063731847,0.00061577413,0.0060576834,0.0007650861,0.00010065685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028508792,0.000066540175,0.00007782404,0.000001684414,0.0000062600993,0.000040313895,0.0002513707,0.00035415104,0.0005322443,0.9775305,0.00017344182,0.020937188],"study_design_scores_gemma":[0.00035624506,0.0003812944,0.0011721787,0.000004705573,0.0000028326524,0.00019362544,0.000031746054,0.26516405,0.0012712011,0.72298265,0.008120936,0.0003185215],"about_ca_topic_score_codex":0.0000034015202,"about_ca_topic_score_gemma":0.0000013563432,"teacher_disagreement_score":0.94310534,"about_ca_system_score_codex":0.00013672542,"about_ca_system_score_gemma":0.0002569168,"threshold_uncertainty_score":0.99761426},"labels":[],"label_agreement":null},{"id":"W4286716144","doi":"10.1007/s00373-022-02517-8","title":"On the Structure of Graphs Without Claw, $$4K_1$$ and co-R","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Claw; Split graph; Induced subgraph; Vertex (graph theory); Indifference graph; Cograph; Discrete mathematics; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.013209525833009866,"score_gpt":0.25861029588980816,"score_spread":0.2454007700567983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286716144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967702,0.00067079783,0.0010154062,0.00033042525,0.00021200105,0.00024466327,0.000025810637,0.000050460796,0.0006802298],"genre_scores_gemma":[0.9994214,0.0001016482,0.00016529165,0.00022170934,0.000002060335,0.00001180003,0.000001832365,0.000009836063,0.0000644134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857897,0.0001994094,0.00015156464,0.0003250117,0.0004987376,0.00024628406],"domain_scores_gemma":[0.9989297,0.0002950259,0.000091179296,0.00053843454,0.000059435653,0.00008621916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035085637,0.00013855268,0.00017506677,0.00019977719,0.00058604067,0.000060607243,0.0007063604,0.000034819528,0.000019163352],"category_scores_gemma":[0.00002527804,0.000100803016,0.000050260758,0.0009697342,0.0002548623,0.00011457854,0.00045607195,0.0004003395,3.608321e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019338111,0.00004114256,0.0058664097,0.000010859954,0.000016665696,0.0000042432307,0.00032439083,0.000011497621,0.0005391849,0.9915162,0.00025649206,0.0013935913],"study_design_scores_gemma":[0.00037735648,0.00039933668,0.0024485774,0.000004465934,0.000004300787,0.000020610678,0.00015906786,0.00056153786,0.0008937947,0.99413747,0.00087053125,0.00012298112],"about_ca_topic_score_codex":0.000007767202,"about_ca_topic_score_gemma":0.0000013128674,"teacher_disagreement_score":0.0034178323,"about_ca_system_score_codex":0.000013329602,"about_ca_system_score_gemma":0.000027070506,"threshold_uncertainty_score":0.45074102},"labels":[],"label_agreement":null},{"id":"W4286796610","doi":"10.1016/j.tcs.2023.113760","title":"A simple certifying algorithm for 3-edge-connectivity","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Edge contraction; Algorithm; Connectivity; Graph; Mathematics; Computer science; Time complexity; Combinatorics; Line graph; Graph power","score_opus":0.039444340114994994,"score_gpt":0.3386094380291295,"score_spread":0.29916509791413454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286796610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015588062,0.0000117687805,0.9812186,0.00074307073,0.0005543155,0.0004607202,0.000007459261,0.00089815655,0.000517869],"genre_scores_gemma":[0.6734811,0.0000029239598,0.32600275,0.00025575008,0.00014753114,0.00006598221,0.000001997926,0.000015750882,0.00002619941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962273,0.00015134134,0.00026777392,0.0011606568,0.0008713993,0.0013215248],"domain_scores_gemma":[0.9963994,0.0016191705,0.00005758779,0.0011780257,0.00034194498,0.00040388768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038650015,0.00022041326,0.0002634245,0.00052148174,0.0010138851,0.00052669214,0.003620368,0.00006044588,0.000018604886],"category_scores_gemma":[0.0004343317,0.0001921925,0.00013039305,0.0043255067,0.0025790269,0.0010890118,0.0021841018,0.0002416634,0.0002118642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048797997,0.000023938426,0.000016462278,0.0000066991784,0.0000032431883,0.00000984557,0.00023611293,0.00015824195,0.000743811,0.70188946,0.00008834056,0.296819],"study_design_scores_gemma":[0.00017907159,0.00013031783,0.0002724894,0.000006905676,0.0000012111507,0.000009815038,0.000007655462,0.54465586,0.0046385136,0.4497266,0.00021773491,0.00015381443],"about_ca_topic_score_codex":0.0000022051065,"about_ca_topic_score_gemma":5.4574656e-7,"teacher_disagreement_score":0.65789306,"about_ca_system_score_codex":0.000088433095,"about_ca_system_score_gemma":0.00015944485,"threshold_uncertainty_score":0.9502531},"labels":[],"label_agreement":null},{"id":"W4286901735","doi":"10.48550/arxiv.2110.08943","title":"Proving exact values for the $2$-limited broadcast domination number on grid graphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Square (algebra); Square tiling; Mathematics; Combinatorics; Grid; Discrete mathematics; Geometry","score_opus":0.07982233156300793,"score_gpt":0.2417703291488874,"score_spread":0.16194799758587947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286901735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19819388,0.00008611623,0.7973078,0.00030594686,0.0010713965,0.0012096216,0.000026181027,0.00024503557,0.001554045],"genre_scores_gemma":[0.9944828,0.00020228865,0.0032079308,0.00011637312,0.00011264652,0.000015115664,0.000035572095,0.000031805303,0.0017954321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973458,0.00036723982,0.00020688164,0.0013476323,0.0002256985,0.00050673337],"domain_scores_gemma":[0.99606496,0.0013035032,0.00025303636,0.0017793713,0.00046758878,0.00013151324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075446133,0.0003512346,0.0003089277,0.00030413872,0.0005174082,0.00038527464,0.002472205,0.0002245175,0.000030274217],"category_scores_gemma":[0.00023219573,0.00031456683,0.0003986625,0.0010794627,0.00023253851,0.0006378907,0.0018082481,0.00076869264,0.000031925367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026837602,0.00029804106,0.0012588778,0.00020109145,0.00031601806,0.00023597841,0.0008413653,0.15229893,0.00027219375,0.8274969,0.00074124674,0.015770981],"study_design_scores_gemma":[0.001292977,0.00019678402,0.0026560796,0.0002947853,0.00011762246,0.000013845671,0.00054460973,0.63262826,0.0019083567,0.3581319,0.0013626387,0.0008521597],"about_ca_topic_score_codex":0.000043909175,"about_ca_topic_score_gemma":0.00002040644,"teacher_disagreement_score":0.79628897,"about_ca_system_score_codex":0.00023035213,"about_ca_system_score_gemma":0.00020501408,"threshold_uncertainty_score":0.9999306},"labels":[],"label_agreement":null},{"id":"W4287665957","doi":"10.48550/arxiv.2009.07932","title":"On Weak Flexibility in Planar Graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Iowa State University; Simon Fraser University; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Planar graph; Graph; List coloring; Discrete mathematics; Class (philosophy); Computer science; Graph power; Line graph; Artificial intelligence","score_opus":0.11771016570052466,"score_gpt":0.23967822767178157,"score_spread":0.12196806197125691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287665957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4993281,0.00005266964,0.4868547,0.0005972963,0.0004885938,0.0007317255,0.000037724352,0.0005060003,0.011403184],"genre_scores_gemma":[0.9977209,0.00006776684,0.0015667174,0.00016619718,0.000020339941,0.0000017254042,0.000010813477,0.000018364899,0.00042718076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967944,0.00040812412,0.00022456665,0.0018664356,0.00018501963,0.0005214541],"domain_scores_gemma":[0.9971937,0.00034976416,0.00014218176,0.0019460625,0.00008496253,0.00028335908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046188405,0.00034709467,0.00040669309,0.0005994952,0.00010549121,0.00007947972,0.003311221,0.00026988893,0.000028348028],"category_scores_gemma":[0.00014414682,0.0004056229,0.00023241529,0.0015892946,0.00021101163,0.00032156394,0.002035696,0.0014820658,0.0002081301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013231649,0.00010587088,0.0019117867,0.00005059062,0.000026727346,0.0005678948,0.00012144642,0.06361595,0.000041390696,0.9328781,0.0001611579,0.0003867766],"study_design_scores_gemma":[0.0004186241,0.000101716665,0.0020293603,0.00006459757,0.0000059119507,0.0000013257313,0.00003565367,0.12201957,0.00013210508,0.8746854,0.00015973578,0.00034601468],"about_ca_topic_score_codex":0.00008836145,"about_ca_topic_score_gemma":0.00007108938,"teacher_disagreement_score":0.4983928,"about_ca_system_score_codex":0.00028392707,"about_ca_system_score_gemma":0.000204561,"threshold_uncertainty_score":0.99983954},"labels":[],"label_agreement":null},{"id":"W4287703761","doi":"10.48550/arxiv.2007.14944","title":"Edge-colouring graphs with local list sizes","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Hypergraph; Generalization; Edge coloring; Chromatic scale; Graph; Degree (music); Discrete mathematics; Line graph; Physics; Mathematical analysis; Graph power","score_opus":0.06837617475248794,"score_gpt":0.20711603614274066,"score_spread":0.1387398613902527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287703761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115514666,0.00007015284,0.87969846,0.00029006516,0.000230734,0.00036273728,0.000010051306,0.0004982732,0.003324847],"genre_scores_gemma":[0.99367356,0.00008863229,0.005110145,0.00012659753,0.00005067128,0.0000023306595,0.000007049254,0.000034964654,0.0009060374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708587,0.00022292894,0.00018160857,0.0016794695,0.00021584773,0.00061427255],"domain_scores_gemma":[0.99739116,0.00022547515,0.00019285474,0.0015608072,0.00021617382,0.0004135011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023735854,0.00042296931,0.00043844883,0.00037732674,0.0002648309,0.00018835059,0.0034894813,0.00023375795,0.000034860546],"category_scores_gemma":[0.00004454332,0.00043879892,0.0002239344,0.0014924566,0.000560016,0.00052233116,0.004064887,0.0012631877,0.00010186507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019607929,0.00008983403,0.0027299786,0.00014254067,0.0001692654,0.0022841732,0.00030701724,0.1728949,0.00008759793,0.8195123,0.00020219339,0.0013841029],"study_design_scores_gemma":[0.0010308544,0.00031272668,0.0010686672,0.00020636474,0.00006512255,0.000021819393,0.00021194923,0.3156393,0.00120742,0.6782968,0.0008906732,0.0010482924],"about_ca_topic_score_codex":0.00007463437,"about_ca_topic_score_gemma":0.00007046843,"teacher_disagreement_score":0.8781589,"about_ca_system_score_codex":0.00020062321,"about_ca_system_score_gemma":0.00031110557,"threshold_uncertainty_score":0.9998064},"labels":[],"label_agreement":null},{"id":"W4287764604","doi":"10.48550/arxiv.2006.03188","title":"A note on the connected game coloring number","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; List coloring; Complete coloring; Mathematics; Degeneracy (biology); Fractional coloring; Discrete mathematics; Graph; Graph coloring; Bounded function; Edge coloring; Graph power; Line graph","score_opus":0.12157014200749877,"score_gpt":0.23647111567974674,"score_spread":0.11490097367224797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287764604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2678504,0.000010939072,0.7167297,0.0019921307,0.00049266295,0.00063128077,0.000016312022,0.00052873674,0.011747805],"genre_scores_gemma":[0.99757516,0.000045300287,0.0008012645,0.0004716672,0.00007417338,0.0000031927916,0.0000040368645,0.000024161553,0.0010010279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975489,0.00039738725,0.00015670955,0.0012351762,0.00018487086,0.00047695817],"domain_scores_gemma":[0.9968538,0.00090397144,0.00017064456,0.0016834274,0.00017130005,0.00021681457],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032963068,0.0003165185,0.00030160652,0.00013673758,0.00021780429,0.00015891026,0.0035735227,0.00019888776,0.000099442],"category_scores_gemma":[0.00026140027,0.00028522886,0.0002201883,0.0011492335,0.00022318178,0.00023248488,0.003691938,0.0014051377,0.0008754381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008325447,0.000039907707,0.00030980233,0.000024582412,0.00006228216,0.0004974624,0.0003365166,0.03592561,0.00015103426,0.9620846,0.0002485145,0.000236431],"study_design_scores_gemma":[0.00045780907,0.000084836385,0.0005830281,0.000101420956,0.000024469484,0.000005905315,0.0000714572,0.39251867,0.0011076316,0.60213274,0.0024066682,0.00050535664],"about_ca_topic_score_codex":0.000029808922,"about_ca_topic_score_gemma":0.000009732693,"teacher_disagreement_score":0.72972476,"about_ca_system_score_codex":0.00021505411,"about_ca_system_score_gemma":0.00019730502,"threshold_uncertainty_score":0.99996},"labels":[],"label_agreement":null},{"id":"W4288374872","doi":"10.48550/arxiv.1904.03723","title":"Linear-Time and Efficient Distributed Algorithms for List Coloring\\n Graphs on Surfaces","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Algorithm; Time complexity; Vertex (graph theory); Discrete mathematics; Edge coloring; Graph; Line graph; Graph power","score_opus":0.07860142928739612,"score_gpt":0.2365674104703093,"score_spread":0.15796598118291316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288374872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52020466,0.0001212993,0.47546372,0.00011958851,0.0008620051,0.002032029,0.00073937315,0.00018233043,0.0002749682],"genre_scores_gemma":[0.99179184,0.00045174925,0.0030770751,0.000049749677,0.00008191456,0.000008146298,0.0001420265,0.00007244948,0.0043250155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99330235,0.00052458973,0.00056056865,0.0037103577,0.0003960799,0.0015060293],"domain_scores_gemma":[0.99327284,0.0020794345,0.0006062162,0.002474272,0.0008571737,0.0007100715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014741328,0.0010052974,0.0011129422,0.00078680407,0.00090718677,0.0003815991,0.003318333,0.0006350788,0.000059236405],"category_scores_gemma":[0.0002805017,0.0011545729,0.0005954735,0.0021337646,0.0011345109,0.00043582014,0.0039149243,0.0013579596,0.00025102397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009072119,0.00045544744,0.0010031904,0.00023992968,0.00026058182,0.00014990929,0.00020496659,0.85189927,0.0002600799,0.14357452,0.000082645645,0.0009622163],"study_design_scores_gemma":[0.002267341,0.0010664384,0.0009187375,0.00031657552,0.000120711185,0.000007842519,0.00010385661,0.9611101,0.001105242,0.030625237,0.0012049007,0.0011529941],"about_ca_topic_score_codex":0.000079383324,"about_ca_topic_score_gemma":0.000009735689,"teacher_disagreement_score":0.47238666,"about_ca_system_score_codex":0.00046889702,"about_ca_system_score_gemma":0.00039183826,"threshold_uncertainty_score":0.99909043},"labels":[],"label_agreement":null},{"id":"W4289222390","doi":"10.1016/j.jctb.2022.06.002","title":"Bounding χ by a fraction of Δ for graphs without large cliques","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Degree (music); Upper and lower bounds; Conjecture; Discrete mathematics; Vertex (graph theory); Brooks' theorem; Bounding overwatch; Fractional coloring; Graph; Clique; Chromatic scale; Graph coloring; Greedy coloring; Clique number; Chordal graph; Graph power; Line graph; 1-planar graph; Computer science","score_opus":0.012658909168851392,"score_gpt":0.30400812249916687,"score_spread":0.2913492133303155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289222390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30674118,0.0008897916,0.6830883,0.0005253882,0.0076225773,0.00048024073,0.000047345708,0.000064359374,0.0005408143],"genre_scores_gemma":[0.9943324,0.000046608773,0.005250904,0.000054984386,0.00014172512,0.000024452807,0.000001992648,0.000018435509,0.00012852742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976502,0.0006922874,0.0005317228,0.00016563441,0.0006603411,0.00029983177],"domain_scores_gemma":[0.9977838,0.00062330026,0.00077255047,0.00030320216,0.0004209372,0.00009620259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004612539,0.00012801288,0.00038606575,0.000294963,0.00045015162,0.00007346674,0.0010553072,0.000044181586,0.0000456978],"category_scores_gemma":[0.00042555353,0.00012026863,0.00022786371,0.0004940635,0.00011634715,0.0012815977,0.00029835413,0.0004340038,2.6728745e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001952532,0.00020831928,0.0002998413,0.000020386036,0.00006847309,0.000005582226,0.00053777406,0.000015978092,0.007204484,0.98779356,0.00088560145,0.0010074773],"study_design_scores_gemma":[0.0014303027,0.0020485464,0.00001732493,0.000015716205,0.000012557527,0.00006097144,0.000801851,0.00006767091,0.016325125,0.9358128,0.043294318,0.00011282251],"about_ca_topic_score_codex":0.0000010464514,"about_ca_topic_score_gemma":1.7131514e-7,"teacher_disagreement_score":0.6875912,"about_ca_system_score_codex":0.000119402575,"about_ca_system_score_gemma":0.00015706853,"threshold_uncertainty_score":0.49044126},"labels":[],"label_agreement":null},{"id":"W4289455500","doi":"10.1109/focs.2018.00074","title":"Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Genus; Time complexity; Polynomial-time approximation scheme; Quadratic equation; Mathematics; Scheme (mathematics); Approximation algorithm; Embedding; Polynomial; Combinatorics; Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Artificial intelligence; Geometry","score_opus":0.02184293508396369,"score_gpt":0.2890824211643078,"score_spread":0.26723948608034415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289455500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10373341,0.000078687866,0.893888,0.00036744127,0.00010942221,0.0004835242,0.0000022831036,0.000064649634,0.001272578],"genre_scores_gemma":[0.795327,0.0000021727194,0.20376298,0.00009621597,0.000052501113,0.00005202853,5.6682615e-7,0.000008635438,0.00069790566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990621,0.000046577166,0.00017184363,0.00022806229,0.00024462593,0.00024675613],"domain_scores_gemma":[0.99861395,0.0003948801,0.000072128234,0.00062589266,0.0002471713,0.00004599817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007287595,0.00007750765,0.00009902723,0.00011461943,0.00018233259,0.00003864909,0.00081838743,0.000030431242,0.000032240332],"category_scores_gemma":[0.0001333748,0.000049748178,0.00008033181,0.00048160515,0.00026128677,0.00008080183,0.00019560115,0.00004986886,0.00006502397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000176694,0.00017542677,0.000087485845,0.000036488585,0.000068942114,8.3271783e-7,0.0012108794,0.0007374917,0.10961623,0.77480316,0.0033149316,0.10977147],"study_design_scores_gemma":[0.00039255506,0.0002019117,0.00023189688,0.000007927158,0.0000040336163,0.0000047561966,0.000034172066,0.88948774,0.091083676,0.01709847,0.0013467048,0.00010614583],"about_ca_topic_score_codex":0.000006660333,"about_ca_topic_score_gemma":0.0000018705092,"teacher_disagreement_score":0.88875026,"about_ca_system_score_codex":0.000014637496,"about_ca_system_score_gemma":0.000039103776,"threshold_uncertainty_score":0.20286718},"labels":[],"label_agreement":null},{"id":"W4289885984","doi":"10.1002/jgt.22870","title":"Characterizing circular colouring mixing for pq&lt;4 $\\frac{p}{q}\\lt 4$","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Homomorphism; Conjecture; Bipartite graph; Vertex (graph theory); Mixing (physics); Graph; Planar graph; Discrete mathematics; Physics","score_opus":0.022589676475499584,"score_gpt":0.28187799252581675,"score_spread":0.25928831605031716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289885984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29217976,0.0015688676,0.70317626,0.0008160057,0.0013006631,0.00041081276,0.00001173731,0.000073445444,0.00046247817],"genre_scores_gemma":[0.9795678,0.000057054876,0.019250838,0.0005946707,0.00023469128,0.00006123838,0.0000015583726,0.000042620213,0.00018950601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968045,0.0007397266,0.0006574824,0.00033618,0.000854053,0.0006080623],"domain_scores_gemma":[0.9972402,0.0010105293,0.00068055117,0.0005551337,0.00030179234,0.00021181292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067539364,0.00020506827,0.0004081232,0.0009223257,0.0008927473,0.00015700769,0.0022085574,0.000049506652,0.00006687573],"category_scores_gemma":[0.0003523378,0.00019924341,0.00051176414,0.0009242031,0.00012408037,0.00093442673,0.00062302133,0.0007571375,0.0000036325728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073327526,0.00028573943,0.0005377569,0.00010079463,0.0003225865,0.00043265795,0.0028552094,0.0014310523,0.21085852,0.7355015,0.000439558,0.046501316],"study_design_scores_gemma":[0.0015959325,0.0009341041,0.00087698566,0.0000809082,0.000038117098,0.0010217893,0.00072952785,0.0014142956,0.014195366,0.9529391,0.025746336,0.0004275182],"about_ca_topic_score_codex":4.109373e-7,"about_ca_topic_score_gemma":2.443674e-7,"teacher_disagreement_score":0.68738806,"about_ca_system_score_codex":0.00015998355,"about_ca_system_score_gemma":0.00016361363,"threshold_uncertainty_score":0.81249106},"labels":[],"label_agreement":null},{"id":"W4290720427","doi":"10.3390/math10152787","title":"Acyclic Chromatic Index of 1-Planar Graphs","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Planar graph; Combinatorics; Friendship graph; Edge coloring; Outerplanar graph; Mathematics; Windmill graph; Graph; Book embedding; Butterfly graph; Discrete mathematics; Wheel graph; Graph power; 1-planar graph; Line graph; Voltage graph","score_opus":0.022745750849878076,"score_gpt":0.28162561902337263,"score_spread":0.25887986817349457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290720427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16626681,0.0001370309,0.82825375,0.00026248183,0.00014906494,0.00038452845,0.000011139089,0.00018065449,0.0043545156],"genre_scores_gemma":[0.8959023,0.0000050668523,0.103581525,0.000067580055,0.0000063093953,0.00006249319,0.0000017062031,0.000015655723,0.0003573954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854046,0.000096710995,0.00030525302,0.0001843769,0.00062666595,0.0002465275],"domain_scores_gemma":[0.9986358,0.00027377758,0.00016283081,0.0008304611,0.000037997936,0.000059111848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060282834,0.00009967745,0.00020878427,0.00024320347,0.00016736449,0.000025760812,0.0014282346,0.000018825822,0.00011054418],"category_scores_gemma":[0.00007918254,0.00009407944,0.000076111326,0.0009011462,0.000077059194,0.00014727944,0.00051201775,0.00018818807,0.000025136647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032866105,0.00025799504,0.00035371727,0.0001707677,0.000028556964,0.000018208993,0.002678898,0.0003153761,0.0024049515,0.99094296,0.00043756492,0.0023877323],"study_design_scores_gemma":[0.00020814643,0.00010620648,0.00023783745,0.000014711337,0.0000038523067,0.00004798902,0.0003437896,0.040005747,0.0011819232,0.9572978,0.00043141292,0.00012057971],"about_ca_topic_score_codex":0.0000027958415,"about_ca_topic_score_gemma":7.5005636e-7,"teacher_disagreement_score":0.7296354,"about_ca_system_score_codex":0.000034168443,"about_ca_system_score_gemma":0.000040187082,"threshold_uncertainty_score":0.38364485},"labels":[],"label_agreement":null},{"id":"W4291794536","doi":"10.1016/j.dam.2022.08.005","title":"Irredundance graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Discrete mathematics","score_opus":0.019515790046845772,"score_gpt":0.2775828868383306,"score_spread":0.2580670967914848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291794536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008200168,0.000100919555,0.9363103,0.00034912984,0.00015643763,0.0004979983,0.000015216152,0.000413801,0.05395603],"genre_scores_gemma":[0.6415294,0.000009480255,0.3568306,0.0002988301,0.000019280964,0.000521581,0.000008663126,0.00003867776,0.00074349024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981578,0.00003561105,0.00026819145,0.00039657162,0.00070652005,0.00043529473],"domain_scores_gemma":[0.9984787,0.00017319378,0.00012416272,0.0010897289,0.000027636432,0.00010657019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054153695,0.00016497834,0.00020455672,0.00015843661,0.0005119652,0.000100398014,0.0018822233,0.000022264012,0.00012455205],"category_scores_gemma":[0.000023190321,0.00016000512,0.00008586678,0.0009259729,0.00010218376,0.00016963312,0.0013331679,0.000326589,0.000091357884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004853469,0.00006860342,0.0000046345363,0.00002706766,0.000012593112,0.000008458071,0.0011153601,0.00035033637,0.0030723654,0.9915575,0.00043734623,0.0033408871],"study_design_scores_gemma":[0.0002386763,0.00004380646,0.000016498292,0.0000036935467,0.000003854169,0.000024910309,0.00060537993,0.011695864,0.0017502845,0.9799333,0.0054483893,0.00023531825],"about_ca_topic_score_codex":8.202442e-7,"about_ca_topic_score_gemma":4.189257e-7,"teacher_disagreement_score":0.6333292,"about_ca_system_score_codex":0.00005515905,"about_ca_system_score_gemma":0.00004444241,"threshold_uncertainty_score":0.6524819},"labels":[],"label_agreement":null},{"id":"W4292258317","doi":"10.46298/dmtcs.7660","title":"Tuza's Conjecture for Threshold Graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst; European Commission","keywords":"Clique-sum; Mathematics; Combinatorics; Treewidth; Pathwidth; Cograph; Chordal graph; Conjecture; 1-planar graph; Indifference graph; Discrete mathematics; Planar graph; Split graph; Graph; Disjoint sets; Line graph","score_opus":0.019202324987098087,"score_gpt":0.2970529105084879,"score_spread":0.27785058552138986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292258317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069844015,0.000059178463,0.9869222,0.00152167,0.0005714731,0.0008964043,0.000028827812,0.0003103272,0.0027054898],"genre_scores_gemma":[0.6267555,0.0000018649074,0.37249875,0.0004520852,0.000044052435,0.00018890359,0.000003664952,0.000023591128,0.000031635886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99527514,0.00013856623,0.00048528585,0.0011618164,0.0017628402,0.001176357],"domain_scores_gemma":[0.9965101,0.0008984138,0.00016047987,0.0018093692,0.0002327046,0.00038895657],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0035774722,0.0003386016,0.00040692074,0.00046073878,0.002006979,0.0006307984,0.006498931,0.000048768678,0.00014350889],"category_scores_gemma":[0.00018347474,0.0002831344,0.00025478975,0.002381939,0.0029120892,0.0006298566,0.004113272,0.0005276201,0.0000205307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001407108,0.0001092644,0.000011684065,0.000033621018,0.000011607653,0.000013632625,0.0011346847,0.00087219896,0.00063472014,0.99456286,0.00014454567,0.00245712],"study_design_scores_gemma":[0.00024300507,0.00026715518,0.0000067885044,0.000009577705,0.000005056636,0.000059560927,0.000056731555,0.42078185,0.00077715906,0.57728595,0.00027338197,0.00023377624],"about_ca_topic_score_codex":5.359179e-7,"about_ca_topic_score_gemma":2.3533853e-7,"teacher_disagreement_score":0.61977106,"about_ca_system_score_codex":0.00010180914,"about_ca_system_score_gemma":0.00020099015,"threshold_uncertainty_score":0.9999621},"labels":[],"label_agreement":null},{"id":"W4293795622","doi":"10.48550/arxiv.2112.02633","title":"Hereditary classes of ordered sets of width at most two","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche; Canadian Defence Academy","keywords":"Mathematics; Countable set; Bipartite graph; Combinatorics; Partially ordered set; Conjecture; Permutation (music); Discrete mathematics; Class (philosophy); Graph; Computer science","score_opus":0.07282576209150653,"score_gpt":0.2334737114108887,"score_spread":0.1606479493193822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293795622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77850217,0.00027230498,0.21829098,0.000039276078,0.00037476688,0.00026228375,0.00005259979,0.000087056236,0.002118535],"genre_scores_gemma":[0.9915719,0.00021005856,0.0072591836,0.000022804608,0.000022064236,7.2216056e-7,0.00003386849,0.00002030847,0.0008591061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976837,0.00032311643,0.0003108039,0.0010579248,0.00023251607,0.0003919283],"domain_scores_gemma":[0.9965245,0.00034112314,0.0003999512,0.0019841152,0.0005823032,0.0001679991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029648113,0.00029229608,0.0005555657,0.00037862803,0.000101644444,0.000029387844,0.0025083828,0.0002063407,0.00010725767],"category_scores_gemma":[0.00010043421,0.00034569678,0.00025532098,0.0013903975,0.00039984594,0.00040815969,0.005980841,0.0005180578,0.0000119065035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047360998,0.00094039494,0.032972317,0.0014774963,0.0010041347,0.0039917678,0.0013542791,0.5505409,0.007924922,0.3932142,0.0010879387,0.0050180303],"study_design_scores_gemma":[0.0039843614,0.0005035754,0.008901654,0.0011217822,0.0002222765,0.000077519406,0.0009929361,0.41965765,0.053218175,0.5087532,0.000559335,0.0020075357],"about_ca_topic_score_codex":0.00020594533,"about_ca_topic_score_gemma":0.0002265345,"teacher_disagreement_score":0.21306969,"about_ca_system_score_codex":0.00017578455,"about_ca_system_score_gemma":0.00047043897,"threshold_uncertainty_score":0.9998995},"labels":[],"label_agreement":null},{"id":"W4295008616","doi":"10.1007/s10878-022-00900-y","title":"Linear time algorithms on mirror trees","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Université du Québec à Chicoutimi","funders":"Agence Nationale de la Recherche","keywords":"Theory of computation; Time complexity; Algorithm; Mathematics; Linear programming; Running time; Isomorphism (crystallography); Graph algorithms; Graph; Combinatorics; Computer science; Discrete mathematics","score_opus":0.015391637546273932,"score_gpt":0.2813810696624643,"score_spread":0.26598943211619036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295008616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052763657,0.000114438924,0.9806909,0.002042576,0.010071168,0.00029617682,0.000006324831,0.00008988936,0.0014121721],"genre_scores_gemma":[0.18906337,0.000070224145,0.80764824,0.0004658352,0.0013128767,0.000028345063,0.000013846745,0.000074409676,0.0013228484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978876,0.0003646647,0.00038327443,0.00016195656,0.0009806515,0.0002218517],"domain_scores_gemma":[0.9986746,0.00020757574,0.000389871,0.00027906633,0.0003384135,0.00011052643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164554,0.000107907275,0.0002109039,0.00037541895,0.00030785482,0.00006845991,0.0009946122,0.000035241705,0.00015980563],"category_scores_gemma":[0.00018361036,0.000101325066,0.00011697241,0.00078062364,0.000030970423,0.0005692263,0.00026469555,0.0004154293,0.000015179501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025775292,0.00036921035,0.000017059065,0.0000022677932,0.000031715485,0.000059998376,0.00020694098,0.9311558,0.00043390834,0.06388645,0.0011749273,0.0024039845],"study_design_scores_gemma":[0.0029190504,0.0032160517,0.00004232444,0.000016163405,0.000011762706,0.00011133574,0.00003547027,0.93919283,0.0015005792,0.04374202,0.008987339,0.00022509789],"about_ca_topic_score_codex":0.000001125972,"about_ca_topic_score_gemma":1.8796039e-8,"teacher_disagreement_score":0.183787,"about_ca_system_score_codex":0.00016659916,"about_ca_system_score_gemma":0.00014646024,"threshold_uncertainty_score":0.41319162},"labels":[],"label_agreement":null},{"id":"W4295796971","doi":"10.1016/j.jctb.2022.09.001","title":"A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number","year":2022,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Counterexample; Mathematics; Conjecture; Digraph; Induced subgraph; Clique number; Bounded function; Chromatic scale; Graph; Discrete mathematics; Perfect graph; Pathwidth; Line graph; Vertex (graph theory)","score_opus":0.046242049614965176,"score_gpt":0.20926206288637625,"score_spread":0.16302001327141108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295796971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8694156,0.000018027793,0.12863167,0.000084217376,0.00008021162,0.00048127907,0.00005844522,0.0001266464,0.0011039197],"genre_scores_gemma":[0.9980102,0.000004248014,0.001366414,0.00019127125,0.000007354855,0.000007687994,0.0000049675573,0.000020885198,0.00038695615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979127,0.00033099175,0.00019720553,0.0007106885,0.00030171272,0.00054668036],"domain_scores_gemma":[0.9977004,0.00024155085,0.00016854527,0.0015169902,0.00015022812,0.00022227371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055230496,0.00021776542,0.00035238022,0.0004945208,0.0003634837,0.000040141458,0.0024840212,0.000050469193,0.00029145638],"category_scores_gemma":[0.000063427644,0.0002198069,0.00014830462,0.004132584,0.0001093841,0.00042032846,0.0012585054,0.00035585562,0.000025531815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040631992,0.00031077384,0.0116553595,0.000045078265,0.00014027831,0.00044475813,0.0015542961,0.0042547886,0.0015928169,0.978947,0.00047460073,0.00017395985],"study_design_scores_gemma":[0.022647433,0.0053105415,0.02257936,0.00021880223,0.00018651529,0.00033976877,0.0043037646,0.048243295,0.0060821995,0.8812489,0.006286927,0.0025525165],"about_ca_topic_score_codex":0.00010561951,"about_ca_topic_score_gemma":0.00013747347,"teacher_disagreement_score":0.12859462,"about_ca_system_score_codex":0.00012370154,"about_ca_system_score_gemma":0.0001598329,"threshold_uncertainty_score":0.89634657},"labels":[],"label_agreement":null},{"id":"W4296168370","doi":"10.1007/978-3-031-16081-3_34","title":"Fast Searching on k-Combinable Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cartesian product; Product (mathematics); Graph; Search tree; Tree (set theory); Depth-first search; Search algorithm; Cartesian coordinate system","score_opus":0.021495394991355426,"score_gpt":0.2802285690483312,"score_spread":0.25873317405697577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296168370","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011609179,0.0002536902,0.9710358,0.0008499556,0.0014681314,0.0005662463,0.000008095429,0.00027363363,0.025428353],"genre_scores_gemma":[0.3191405,0.0003349552,0.66485065,0.0065906,0.0007217202,0.00017071668,0.000030631607,0.00033465927,0.00782554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99304086,0.00015047588,0.00048124036,0.0023702818,0.0026021716,0.0013549774],"domain_scores_gemma":[0.99546933,0.0011642259,0.00022371346,0.0026344224,0.00019285099,0.00031542577],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002246678,0.00063603424,0.0005884645,0.0024976854,0.0009912429,0.000686351,0.007697783,0.00019721405,0.00017207529],"category_scores_gemma":[0.00015073108,0.0006143205,0.00023174266,0.0017852616,0.0010761194,0.00097295985,0.0046883556,0.0027463243,0.0001091649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012763157,0.000039678056,0.000017498014,0.000022023562,0.000009474608,0.0002421835,0.00041781837,0.06276718,0.00007945055,0.551832,0.000017033637,0.38454285],"study_design_scores_gemma":[0.0002895118,0.00052919635,0.00003408409,0.00016190148,0.0000026087869,0.00007316765,3.5133954e-7,0.111718185,0.0007086557,0.88153344,0.0042598154,0.0006890557],"about_ca_topic_score_codex":0.000024220391,"about_ca_topic_score_gemma":0.000017407903,"teacher_disagreement_score":0.3838538,"about_ca_system_score_codex":0.0006150597,"about_ca_system_score_gemma":0.0006413715,"threshold_uncertainty_score":0.9996308},"labels":[],"label_agreement":null},{"id":"W4296437525","doi":"10.48550/arxiv.1309.4140","title":"Dynamic vs Oblivious Routing in Network Design","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Polytope; Static routing; Multipath routing; Mathematical optimization; Mathematics; Combinatorics; Routing protocol; Computer network","score_opus":0.07349595624345387,"score_gpt":0.21494370200330884,"score_spread":0.14144774575985497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296437525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09863003,0.00008687255,0.8992449,0.00006247702,0.00038630312,0.000615053,0.0000019142506,0.00027034068,0.0007021315],"genre_scores_gemma":[0.96894634,0.00018134443,0.029434577,0.000065771535,0.00003608777,0.0000041648773,0.0000047244835,0.000030597887,0.0012963886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965197,0.0006643203,0.0002705999,0.001451543,0.00015047214,0.00094335235],"domain_scores_gemma":[0.997192,0.00050109776,0.0002371062,0.0017082972,0.00014771115,0.00021374637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095238537,0.00037973194,0.00043564104,0.00050338253,0.00018287588,0.00019421833,0.0035266175,0.00033374134,0.000030192325],"category_scores_gemma":[0.00008570356,0.00045503178,0.00016918199,0.0016382689,0.00016654882,0.0006115079,0.0041141734,0.0012977364,0.00023575361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028381994,0.000039654842,0.001766002,0.00002180409,0.000025750864,0.0003802345,0.00012687917,0.7737802,0.000012068392,0.22276345,0.00008184008,0.00097371696],"study_design_scores_gemma":[0.00023986754,0.000037859285,0.0010926183,0.0001025653,0.00000649915,0.0000033791043,0.000019175786,0.6510178,0.000009550935,0.3471365,0.000021991105,0.00031220622],"about_ca_topic_score_codex":0.00014869877,"about_ca_topic_score_gemma":0.00006399257,"teacher_disagreement_score":0.8703163,"about_ca_system_score_codex":0.00048572652,"about_ca_system_score_gemma":0.00025130427,"threshold_uncertainty_score":0.99979013},"labels":[],"label_agreement":null},{"id":"W4297724406","doi":"10.37236/10411","title":"$2\\times n$ Grids have Unbounded Anagram-Free Chromatic Number","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Anagram; Mathematics; Combinatorics; Vertex (graph theory); Bounded function; Chromatic scale; Square-free integer; Grid; Discrete mathematics; Graph; Geometry","score_opus":0.008679594744389717,"score_gpt":0.2614543574190871,"score_spread":0.2527747626746974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297724406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30600274,0.009879853,0.6512208,0.016697822,0.0029817151,0.00088843534,0.000005755314,0.00023381769,0.01208906],"genre_scores_gemma":[0.99811286,0.00017686434,0.00024455605,0.0001621014,0.00006303407,0.000013486429,5.1083003e-7,0.000023223829,0.0012033384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962666,0.00071236584,0.0004874511,0.00020224703,0.0014196298,0.00091172336],"domain_scores_gemma":[0.9975186,0.00050400564,0.00046949307,0.0011314747,0.0002526298,0.00012380845],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0032635138,0.00018755348,0.00031925886,0.00019912077,0.0007172497,0.00014314553,0.0054213027,0.00003426854,0.00010577289],"category_scores_gemma":[0.00021262276,0.0001399463,0.000210013,0.0013492601,0.00013650343,0.0004799442,0.0011793082,0.0016990534,0.000016858132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037904625,0.00015960568,0.00017986781,0.000006401594,0.00009799782,0.000039114027,0.00043353482,0.00035852034,0.00007993448,0.99566364,0.0020964155,0.0008470645],"study_design_scores_gemma":[0.0010468254,0.000798,0.00011151334,0.000006739329,0.000020851587,0.0010354228,0.00023041239,0.0023469473,0.0003987062,0.9862445,0.007601082,0.00015900056],"about_ca_topic_score_codex":0.0000053518365,"about_ca_topic_score_gemma":0.0000022923646,"teacher_disagreement_score":0.6921102,"about_ca_system_score_codex":0.00087683514,"about_ca_system_score_gemma":0.00084165315,"threshold_uncertainty_score":0.9999598},"labels":[],"label_agreement":null},{"id":"W4298156949","doi":"10.60692/qgwq7-feg45","title":"Cycle transversals in bounded degree graphs","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degree (music); Bounded function; Mathematics; Combinatorics; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.08373494902059772,"score_gpt":0.29485420605563617,"score_spread":0.21111925703503845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298156949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12958767,0.00008238377,0.7033461,0.00023555955,0.0001335571,0.0002514991,8.1141366e-7,0.00029369447,0.16606875],"genre_scores_gemma":[0.9165856,0.000011452078,0.0828245,0.00018105116,0.000003442889,0.000014762102,2.0710192e-7,0.000006760942,0.0003721772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988852,0.00008153952,0.00014908393,0.00030249348,0.00021234344,0.00036934987],"domain_scores_gemma":[0.9992624,0.000063510044,0.000018327002,0.0005265033,0.000032416076,0.00009685459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003691318,0.000090273956,0.000108805376,0.0002590639,0.000050509767,0.00003507389,0.0010283733,0.000040793188,0.00018945186],"category_scores_gemma":[0.000019658668,0.00007922247,0.00005433389,0.0007838041,0.00009576915,0.0006152453,0.00010882783,0.0001347605,0.00011898921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019930616,0.000068608075,0.0015351998,0.0000030586084,0.000004895733,0.00003585093,0.001126696,0.0000034984262,0.00053572515,0.9807722,0.000053839016,0.015840523],"study_design_scores_gemma":[0.0004613237,0.00007663442,0.013070614,0.000004732562,7.540351e-7,0.000007312884,0.000055566583,0.0016113071,0.010425995,0.97375405,0.00037576468,0.00015597341],"about_ca_topic_score_codex":0.00012602434,"about_ca_topic_score_gemma":0.00027664745,"teacher_disagreement_score":0.786998,"about_ca_system_score_codex":0.000019433355,"about_ca_system_score_gemma":0.00003063829,"threshold_uncertainty_score":0.32305986},"labels":[],"label_agreement":null},{"id":"W4299814619","doi":"10.48550/arxiv.1107.1292","title":"Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with\\n Applications","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Separator (oil production); Mathematics; Binary logarithm; Graph; Minor (academic); Upper and lower bounds; Planar graph; Discrete mathematics; Physics; Mathematical analysis; Thermodynamics","score_opus":0.06812773794562967,"score_gpt":0.2137788574022211,"score_spread":0.14565111945659143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299814619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056789566,0.0002838448,0.9347036,0.00010415372,0.00012868473,0.0018476954,0.00014283288,0.00030144083,0.0056982106],"genre_scores_gemma":[0.94571763,0.00026241603,0.05062887,0.00009227594,0.00007301596,0.00010350935,0.000031103307,0.00006355047,0.00302762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700564,0.00014370996,0.00022662374,0.0018093267,0.00016523885,0.0006494508],"domain_scores_gemma":[0.99433166,0.00034910394,0.00026665934,0.004304303,0.00037494223,0.00037334976],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00041621158,0.00048097208,0.00044989082,0.00052025507,0.0003659857,0.00015003498,0.005783067,0.0003097712,0.000018455885],"category_scores_gemma":[0.00006140518,0.0004866651,0.00022885283,0.00085211167,0.00070137583,0.00050595595,0.0041811415,0.000563943,0.000022808403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016176415,0.000107824046,0.002378381,0.00013328044,0.00015060963,0.000049808616,0.00022069286,0.0010859619,0.000056970694,0.9943366,0.00030841713,0.0010096567],"study_design_scores_gemma":[0.0012805462,0.00018914603,0.00060663634,0.000054185555,0.000085864194,0.000012117918,0.00008077185,0.012612602,0.00029362214,0.98252255,0.0016296072,0.0006323272],"about_ca_topic_score_codex":0.00005123806,"about_ca_topic_score_gemma":0.0001434082,"teacher_disagreement_score":0.88892806,"about_ca_system_score_codex":0.000090020585,"about_ca_system_score_gemma":0.00021004883,"threshold_uncertainty_score":0.9997585},"labels":[],"label_agreement":null},{"id":"W4300040415","doi":"","title":"Locating any two vertices on Hamiltonian cycles","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Jewish General Hospital","funders":"","keywords":"Hamiltonian (control theory); Hamiltonian path; Combinatorics; Mathematics; Physics; Computer science; Graph; Mathematical optimization","score_opus":0.023523900163965907,"score_gpt":0.287574474175542,"score_spread":0.2640505740115761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300040415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12264978,0.00078023743,0.7911228,0.009402327,0.0005095889,0.00063295953,0.00002717764,0.00077598565,0.07409912],"genre_scores_gemma":[0.81252384,0.00014455813,0.18411548,0.00020680022,0.000052868796,0.00008467575,0.0000576415,0.000052992564,0.0027611514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99023885,0.0061865533,0.00055329746,0.0014397843,0.00087278726,0.00070871564],"domain_scores_gemma":[0.98950285,0.0023974776,0.0005052074,0.005011519,0.002267799,0.00031512225],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007484413,0.0004408147,0.0004039987,0.00040583007,0.0006890425,0.0010408026,0.0053406893,0.00022915567,0.00006558105],"category_scores_gemma":[0.0022599925,0.00045730764,0.00021324464,0.0007562073,0.0005726689,0.00039624228,0.004847245,0.00103177,0.00026648087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025544252,0.0006905527,0.0020795607,0.00022698593,0.00010557936,0.000020805155,0.011291658,0.00060846173,0.003497848,0.8041125,0.0006754136,0.17666507],"study_design_scores_gemma":[0.0016315909,0.0000049924033,0.009435793,0.0061180196,0.000050061688,0.00003073866,0.0002006188,0.3428468,0.27442613,0.34970397,0.013451132,0.0021001138],"about_ca_topic_score_codex":0.00044182083,"about_ca_topic_score_gemma":0.0007797413,"teacher_disagreement_score":0.68987405,"about_ca_system_score_codex":0.00018383775,"about_ca_system_score_gemma":0.00036607235,"threshold_uncertainty_score":0.9999962},"labels":[],"label_agreement":null},{"id":"W4300051575","doi":"","title":"(Circular) backbone colouring: tree backbones in planar graphs","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar; Tree (set theory); Computer science; Mathematics; Computer graphics (images)","score_opus":0.04534725260201361,"score_gpt":0.30355880036842553,"score_spread":0.2582115477664119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300051575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16908088,0.005526151,0.74527997,0.0032803256,0.0032849715,0.0029549622,0.00003921813,0.0014878252,0.06906568],"genre_scores_gemma":[0.9144422,0.0002738992,0.08290935,0.00025466905,0.00013349522,0.000238938,0.000032198273,0.00006850699,0.0016467348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99565125,0.00043062062,0.0006103075,0.001267057,0.00082846294,0.0012123345],"domain_scores_gemma":[0.99652356,0.0003333577,0.00020005033,0.0024353152,0.00013126251,0.00037644542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001510097,0.000529911,0.0006885054,0.0010432579,0.00010537562,0.00023316282,0.0036520667,0.00049062824,0.00012600984],"category_scores_gemma":[0.0000941873,0.00050524843,0.00027927416,0.0010006024,0.00020579033,0.00054619537,0.0030549965,0.0015812839,0.00034035151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060960596,0.00054896134,0.022353224,0.00038090572,0.00013555765,0.00028709974,0.0012095443,0.0010123403,0.0016776073,0.95460296,0.0011151345,0.016615715],"study_design_scores_gemma":[0.0011785212,0.000085291686,0.042724084,0.00025168323,0.000016940958,0.00006577445,0.0001109115,0.008077463,0.002839074,0.9395046,0.0035604562,0.0015851501],"about_ca_topic_score_codex":0.00016274797,"about_ca_topic_score_gemma":0.0002605978,"teacher_disagreement_score":0.7453613,"about_ca_system_score_codex":0.000173838,"about_ca_system_score_gemma":0.00020532975,"threshold_uncertainty_score":0.9997399},"labels":[],"label_agreement":null},{"id":"W4300158289","doi":"","title":"Cycles intersecting edge-cuts of prescribed sizes","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.025753434914451305,"score_gpt":0.30150521464283647,"score_spread":0.27575177972838516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300158289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24131611,0.000051452855,0.7435382,0.0003299595,0.00013131664,0.00011382533,5.237293e-7,0.00016050437,0.014358141],"genre_scores_gemma":[0.9141694,0.0000040469854,0.085424416,0.000049990318,0.000018402103,0.0000047979643,1.8346884e-7,0.000005657096,0.00032314725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909735,0.00004116388,0.00016561754,0.00023659185,0.00021993344,0.0002393414],"domain_scores_gemma":[0.9992245,0.000145681,0.000047949758,0.0004323495,0.00008606609,0.000063471205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024242472,0.000078081895,0.000114726805,0.00012042292,0.0000561058,0.000035575966,0.0008238567,0.000026965014,0.000021499836],"category_scores_gemma":[0.0001513403,0.000065420856,0.00005575543,0.00036173538,0.00009650517,0.0004548819,0.00039155406,0.00010577539,0.000027967315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028642835,0.00013093831,0.0012946706,0.00003749293,0.00003221419,0.000017888402,0.0028326355,0.0016044418,0.06597242,0.8929004,0.00011181949,0.035036452],"study_design_scores_gemma":[0.0008080991,0.00021394233,0.002776502,0.000076389726,0.000002463588,0.000021300702,0.00049796974,0.0018737694,0.5511376,0.4421381,0.00022993343,0.00022391061],"about_ca_topic_score_codex":0.000040760948,"about_ca_topic_score_gemma":0.000022407847,"teacher_disagreement_score":0.67285323,"about_ca_system_score_codex":0.000027416987,"about_ca_system_score_gemma":0.000043276374,"threshold_uncertainty_score":0.2667785},"labels":[],"label_agreement":null},{"id":"W4300944187","doi":"10.1016/j.aam.2006.05.006","title":"Counting unlabelled toroidal graphs with no <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-subdivisions","year":2007,"lang":"lv","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Scroll; Mathematics; Toroid; Combinatorics; Physics; Theology; Philosophy","score_opus":0.01626335641312451,"score_gpt":0.26011814077966683,"score_spread":0.24385478436654232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300944187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5016634,0.0036436585,0.05025694,0.0003987119,0.0032960726,0.0002828552,0.00046101515,0.00073958974,0.43925774],"genre_scores_gemma":[0.92297405,0.0025021245,0.06878136,0.0011381158,0.0012816249,0.0014621239,0.0004989665,0.0010039344,0.00035767216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9844269,0.00041263917,0.0031410996,0.002971219,0.0047201375,0.0043279873],"domain_scores_gemma":[0.9858909,0.005061902,0.0032139816,0.0039211507,0.00041123698,0.0015008169],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005132062,0.0015280934,0.00078706053,0.0010931925,0.0026512193,0.0018631908,0.004898544,0.0021649397,0.038508322],"category_scores_gemma":[0.0021656544,0.0025437137,0.0015089369,0.0033529985,0.0031374968,0.0027780745,0.0037964114,0.0030138493,0.0028752293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001654273,0.0008549497,0.00002444541,0.002378897,0.0010317354,0.001385092,0.0039802603,0.0041514034,0.0036042074,0.94120747,0.033642415,0.006084878],"study_design_scores_gemma":[0.0041284473,0.0022478711,0.00003409313,0.0027716768,0.0010261866,0.0014097991,0.004357594,0.12278672,0.8326587,0.016802026,0.0085077975,0.0032690882],"about_ca_topic_score_codex":0.0003552489,"about_ca_topic_score_gemma":0.0014372548,"teacher_disagreement_score":0.9244054,"about_ca_system_score_codex":0.000060660852,"about_ca_system_score_gemma":0.0015678619,"threshold_uncertainty_score":0.9997468},"labels":[],"label_agreement":null},{"id":"W4301417336","doi":"10.1002/rsa.20118","title":"The satisfiability threshold for randomly generated binary constraint satisfaction problems","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Satisfiability; Homomorphism; Constraint (computer-aided design); Constraint satisfaction; Discrete mathematics; Binary number; Mathematics; Random graph; Computer science; Combinatorics; Statistics; Arithmetic; Graph","score_opus":0.013276901874903858,"score_gpt":0.2629478193031268,"score_spread":0.24967091742822292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301417336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1774873,0.0028921186,0.81511426,0.001152677,0.00058216474,0.0023168235,0.000052197916,0.0001888714,0.00021356907],"genre_scores_gemma":[0.97343236,0.00017568143,0.025782289,0.000049635524,0.00020385582,0.00019970912,0.000013183655,0.000015994914,0.00012726168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982794,0.00015773176,0.00034730913,0.00048154936,0.00029167812,0.00044235773],"domain_scores_gemma":[0.9983746,0.0008512523,0.0001130329,0.00042556287,0.00015141805,0.00008414701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095166086,0.00021022359,0.0002817891,0.000064704385,0.00089899095,0.0003622078,0.0003411494,0.00008221009,0.0000061222927],"category_scores_gemma":[0.00007869647,0.00012844645,0.00011230884,0.0002451738,0.00040310403,0.00025909176,0.00010915554,0.00019327182,6.649336e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011879809,0.000034584697,0.0025732948,0.00008465855,0.000109223416,0.000009645231,0.00020457951,0.00765024,0.013721896,0.5102849,0.0011475121,0.4629915],"study_design_scores_gemma":[0.013308205,0.00016186944,0.016999729,0.000012672304,0.000014442827,0.000056551144,0.00003418772,0.15684025,0.0025739686,0.80735934,0.0023354087,0.00030341416],"about_ca_topic_score_codex":0.000105460706,"about_ca_topic_score_gemma":0.0000823019,"teacher_disagreement_score":0.7959451,"about_ca_system_score_codex":0.000033681885,"about_ca_system_score_gemma":0.00005338957,"threshold_uncertainty_score":0.6914403},"labels":[],"label_agreement":null},{"id":"W4301830469","doi":"10.48550/arxiv.1707.05252","title":"Spanning Euler tours and spanning Euler families in hypergraphs with\\n particular vertex cuts","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Euler's formula; Hypergraph; Vertex (graph theory); Mathematics; Traverse; Euler characteristic; Spanning tree; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.06581837429658459,"score_gpt":0.22308820371650773,"score_spread":0.15726982941992312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301830469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8733864,0.0003573998,0.12322698,0.00012706823,0.00031663472,0.00032829496,0.000004773711,0.00016465918,0.0020878061],"genre_scores_gemma":[0.99591434,0.0004207,0.0028822382,0.000037357295,0.000028891305,0.0000037287118,0.000004765436,0.000034566256,0.00067340385],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969397,0.00023592102,0.00021717894,0.0015928048,0.00022697095,0.0007873925],"domain_scores_gemma":[0.9970853,0.00028603608,0.00024838932,0.0019129218,0.00018272862,0.00028464702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005161614,0.0004620838,0.0005327233,0.00075244805,0.0003966647,0.0003227452,0.0021731101,0.00027185434,0.000008650997],"category_scores_gemma":[0.00015097861,0.00047961017,0.00013652415,0.0006461423,0.0005883352,0.0010129233,0.0029649837,0.0010558167,0.000024764991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038484926,0.00026163645,0.34192204,0.00033484926,0.00045001414,0.007882599,0.0036268772,0.32679904,0.00067404564,0.31081188,0.00021600796,0.0066361404],"study_design_scores_gemma":[0.004106897,0.0004079707,0.12264467,0.002149113,0.000185893,0.000083814906,0.001616837,0.58203316,0.0014324669,0.280452,0.0017916292,0.0030955728],"about_ca_topic_score_codex":0.00022037239,"about_ca_topic_score_gemma":0.00011195971,"teacher_disagreement_score":0.2552341,"about_ca_system_score_codex":0.00012719155,"about_ca_system_score_gemma":0.00017980297,"threshold_uncertainty_score":0.9997656},"labels":[],"label_agreement":null},{"id":"W4306652466","doi":"10.37236/11179","title":"Digraphs with All Induced Directed Cycles of the Same Length are not $\\vec{\\chi}$-Bounded","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Royal Society Te Apārangi; Royal Society","keywords":"Combinatorics; Mathematics; Bounded function; Digraph; Chordal graph; Clique; Vertex (graph theory); Discrete mathematics; Treewidth; Graph; Pathwidth","score_opus":0.017181983305825422,"score_gpt":0.2577195889919505,"score_spread":0.2405376056861251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306652466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98783267,0.0019322284,0.005359992,0.003822719,0.00044091744,0.0003155126,0.000003017159,0.00005441867,0.00023851157],"genre_scores_gemma":[0.9992511,0.000259163,0.00008371753,0.00019969931,0.000025703048,0.000012025664,2.98363e-7,0.000025240739,0.00014302238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596596,0.0009930655,0.00047517548,0.00022428736,0.0015821572,0.0007593392],"domain_scores_gemma":[0.9970617,0.0005158794,0.0009961306,0.000943148,0.0003893847,0.00009372039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021378414,0.00021180573,0.00038409428,0.00024135175,0.00057363196,0.00007181051,0.004130617,0.00004128154,0.000010471061],"category_scores_gemma":[0.00015342308,0.00012059275,0.00021897012,0.002115068,0.00019585084,0.0003171069,0.00069137855,0.0019925563,0.0000010007916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026295974,0.00031647398,0.0011244217,0.000011005467,0.0002537281,0.000015062073,0.0010098309,0.00039525633,0.002480653,0.993307,0.00009582582,0.00072777073],"study_design_scores_gemma":[0.001844673,0.0018552396,0.006575652,0.000039234226,0.00006498631,0.0004928989,0.0004252194,0.0010043909,0.013938661,0.97072536,0.0027607966,0.0002728867],"about_ca_topic_score_codex":0.000014480492,"about_ca_topic_score_gemma":0.000018948926,"teacher_disagreement_score":0.02258165,"about_ca_system_score_codex":0.00042409447,"about_ca_system_score_gemma":0.0008788835,"threshold_uncertainty_score":0.86567765},"labels":[],"label_agreement":null},{"id":"W4306976709","doi":"10.37236/11070","title":"On the Hamiltonian Property Hierarchy of 3-Connected Planar Graphs","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Hamiltonian path; Discrete mathematics; Outerplanar graph; Prism; Graph; Line graph; Pathwidth; Physics; Optics","score_opus":0.012745447788768032,"score_gpt":0.2377635597652711,"score_spread":0.22501811197650307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306976709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90634227,0.004657163,0.06344625,0.020793207,0.0011321462,0.0008838892,0.0000063831217,0.00007595254,0.002662741],"genre_scores_gemma":[0.9991232,0.00017786343,0.000035187277,0.00026587473,0.000015877802,0.000013551711,3.0625597e-7,0.000015660833,0.00035247408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964705,0.0011035968,0.00041787775,0.00016495271,0.0012063634,0.0006367213],"domain_scores_gemma":[0.9972584,0.0011410918,0.00047005634,0.000785983,0.00027268298,0.00007173402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037402094,0.00014967672,0.0002553697,0.00027769164,0.0006261344,0.000041505362,0.003892185,0.000026282396,0.00002803423],"category_scores_gemma":[0.00026431782,0.000070145456,0.00018113958,0.0018067202,0.00018077258,0.00017947248,0.0003224279,0.0018525855,0.0000028751062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014897798,0.00017499056,0.00004163477,0.000003857609,0.00008541855,0.00001487609,0.0004995639,0.00038331427,0.0008932752,0.99612784,0.0006704505,0.0009557816],"study_design_scores_gemma":[0.0005658861,0.0022410438,0.00011926953,0.000010349067,0.000010588284,0.0002054464,0.00012974977,0.000685678,0.0021061613,0.98973846,0.0040905257,0.0000968643],"about_ca_topic_score_codex":0.0000072134358,"about_ca_topic_score_gemma":0.0000021674862,"teacher_disagreement_score":0.09278094,"about_ca_system_score_codex":0.00031151867,"about_ca_system_score_gemma":0.00073070556,"threshold_uncertainty_score":0.8048665},"labels":[],"label_agreement":null},{"id":"W4307260506","doi":"10.46298/dmtcs.8877","title":"Improved product structure for graphs on surfaces","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Banff International Research Station for Mathematical Innovation and Discovery; Australian Government","keywords":"Treewidth; Combinatorics; Mathematics; Planar graph; 1-planar graph; Graph; Pathwidth; Partial k-tree; Graph minor; Outerplanar graph; Discrete mathematics; Chordal graph; Line graph; Graph power","score_opus":0.016088019632851162,"score_gpt":0.29082658547601,"score_spread":0.2747385658431588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307260506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03546138,0.000030086414,0.96022946,0.0014660964,0.0006731866,0.0011811483,0.000060078302,0.0002583024,0.00064029207],"genre_scores_gemma":[0.6563263,0.0000010216112,0.3432312,0.00025667157,0.000040717496,0.00009416829,0.0000037966345,0.000021258646,0.000024862002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954731,0.00019312298,0.0004394775,0.0013256688,0.0015180388,0.001050602],"domain_scores_gemma":[0.99651766,0.0008584536,0.0001763898,0.0018719527,0.0002728825,0.00030266686],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026735628,0.00034506354,0.00037617126,0.00040986526,0.0017638872,0.0005688724,0.005506197,0.000033757966,0.00008724207],"category_scores_gemma":[0.00032048038,0.0002740586,0.00017525458,0.0021008474,0.0022041935,0.0005403595,0.0026839655,0.00050225604,0.000007381595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029033092,0.000111263595,0.0000045909214,0.000038814716,0.000011311121,0.0000043038817,0.00095031597,0.0013955375,0.0060688695,0.9869791,0.000059528247,0.0043472927],"study_design_scores_gemma":[0.00019527726,0.0004626945,0.00000946155,0.000009270009,0.000003771559,0.000021115127,0.000042217467,0.44975626,0.005643046,0.54355204,0.00008485101,0.00021999866],"about_ca_topic_score_codex":7.144774e-7,"about_ca_topic_score_gemma":3.551037e-7,"teacher_disagreement_score":0.6208649,"about_ca_system_score_codex":0.00009830836,"about_ca_system_score_gemma":0.00017594318,"threshold_uncertainty_score":0.99997115},"labels":[],"label_agreement":null},{"id":"W4307725203","doi":"10.1016/j.disc.2022.113220","title":"Obstructions for acyclic local tournament orientation completions","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Directed acyclic graph; Mathematics; Combinatorics; Orientation (vector space); Interval graph; Directed graph; Discrete mathematics; Graph; Class (philosophy); Pathwidth; Computer science; Line graph; Geometry; Artificial intelligence","score_opus":0.035658052615687615,"score_gpt":0.3263953272624663,"score_spread":0.2907372746467787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307725203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005803502,0.000021349915,0.9916803,0.0008789132,0.00024918915,0.00047792282,0.000053204585,0.00010767266,0.00072789955],"genre_scores_gemma":[0.5302042,0.0000035633327,0.4680994,0.00012199088,0.000039584997,0.0007736996,0.000048722217,0.000022787694,0.00068609713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987793,0.00006313537,0.00025552942,0.00023301512,0.00040542582,0.00026357427],"domain_scores_gemma":[0.998991,0.00025466323,0.00010839058,0.0004973908,0.00007156186,0.00007695682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033335647,0.0000972147,0.00013139601,0.00012668724,0.00081353413,0.00008512697,0.0006692502,0.000014259777,0.00008769098],"category_scores_gemma":[0.00006130781,0.000095618576,0.000096299525,0.00045043931,0.00007971962,0.0002131092,0.00039530118,0.00014888066,0.00001531501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042479705,0.000080500206,0.000012735328,0.000024811154,0.000016029773,0.0000016509971,0.0017530945,0.0044221124,0.00031263864,0.9887116,0.00045451472,0.004206053],"study_design_scores_gemma":[0.00038652454,0.0001435655,0.000054980872,0.000006858636,0.000010701913,0.00004493605,0.0034792114,0.2558118,0.0003790051,0.7297983,0.00972242,0.00016167942],"about_ca_topic_score_codex":0.0000019145232,"about_ca_topic_score_gemma":0.0000021288056,"teacher_disagreement_score":0.52440065,"about_ca_system_score_codex":0.00014614256,"about_ca_system_score_gemma":0.00003809678,"threshold_uncertainty_score":0.6257129},"labels":[],"label_agreement":null},{"id":"W4307930562","doi":"10.32920/21482265","title":"A Finer Reduction of Constraint Problems to Digraphs","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Grantová Agentura České Republiky; Grantová Agentura, Univerzita Karlova","keywords":"Digraph; Nondeterministic algorithm; Constraint satisfaction problem; Combinatorics; Mathematics; Conjecture; Constraint (computer-aided design); Discrete mathematics; Complexity of constraint satisfaction; Reduction (mathematics); Algebraic number; Local consistency","score_opus":0.03845277788491487,"score_gpt":0.31617200238418675,"score_spread":0.2777192244992719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307930562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016752023,0.00013979209,0.9543464,0.0019268873,0.0009273772,0.0014935572,0.0000323622,0.00030640294,0.02407517],"genre_scores_gemma":[0.7610945,0.0000478638,0.23303917,0.00011075117,0.00005687191,0.0006855833,0.000019757717,0.00002913809,0.004916358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781156,0.00016283403,0.00036175817,0.00075407163,0.00059547153,0.00031429034],"domain_scores_gemma":[0.99809384,0.00007155444,0.00014582311,0.0013731474,0.00018070427,0.00013493298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006970167,0.00018904092,0.00028591728,0.0005572138,0.0000772744,0.00006599745,0.0018545456,0.000083181665,0.00043259375],"category_scores_gemma":[0.000068832516,0.00017655827,0.00016354716,0.0008317093,0.00014205066,0.000120948134,0.0043541463,0.0006361823,0.0000142379595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026523643,0.00019254854,0.00011433784,0.00022626405,0.00008718417,0.000011278484,0.0021034437,0.05084172,0.009020076,0.8853875,0.0021082256,0.049880937],"study_design_scores_gemma":[0.0003630028,0.00049397536,0.0003746517,0.00016540744,0.000011316246,0.000057818866,0.0004245549,0.0073501347,0.01111885,0.9654878,0.013367377,0.0007851317],"about_ca_topic_score_codex":0.000073371535,"about_ca_topic_score_gemma":0.000006615157,"teacher_disagreement_score":0.7443425,"about_ca_system_score_codex":0.0000726601,"about_ca_system_score_gemma":0.0002198127,"threshold_uncertainty_score":0.71998376},"labels":[],"label_agreement":null},{"id":"W4307930563","doi":"10.32920/21482265.v1","title":"A Finer Reduction of Constraint Problems to Digraphs","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Grantová Agentura České Republiky; Grantová Agentura, Univerzita Karlova","keywords":"Digraph; Nondeterministic algorithm; Constraint satisfaction problem; Combinatorics; Mathematics; Conjecture; Constraint (computer-aided design); Discrete mathematics; Complexity of constraint satisfaction; Reduction (mathematics); Algebraic number; Local consistency","score_opus":0.03845277788491487,"score_gpt":0.31617200238418675,"score_spread":0.2777192244992719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307930563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016752023,0.00013979209,0.9543464,0.0019268873,0.0009273772,0.0014935572,0.0000323622,0.00030640294,0.02407517],"genre_scores_gemma":[0.7610945,0.0000478638,0.23303917,0.00011075117,0.00005687191,0.0006855833,0.000019757717,0.00002913809,0.004916358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781156,0.00016283403,0.00036175817,0.00075407163,0.00059547153,0.00031429034],"domain_scores_gemma":[0.99809384,0.00007155444,0.00014582311,0.0013731474,0.00018070427,0.00013493298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006970167,0.00018904092,0.00028591728,0.0005572138,0.0000772744,0.00006599745,0.0018545456,0.000083181665,0.00043259375],"category_scores_gemma":[0.000068832516,0.00017655827,0.00016354716,0.0008317093,0.00014205066,0.000120948134,0.0043541463,0.0006361823,0.0000142379595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026523643,0.00019254854,0.00011433784,0.00022626405,0.00008718417,0.000011278484,0.0021034437,0.05084172,0.009020076,0.8853875,0.0021082256,0.049880937],"study_design_scores_gemma":[0.0003630028,0.00049397536,0.0003746517,0.00016540744,0.000011316246,0.000057818866,0.0004245549,0.0073501347,0.01111885,0.9654878,0.013367377,0.0007851317],"about_ca_topic_score_codex":0.000073371535,"about_ca_topic_score_gemma":0.000006615157,"teacher_disagreement_score":0.7443425,"about_ca_system_score_codex":0.0000726601,"about_ca_system_score_gemma":0.0002198127,"threshold_uncertainty_score":0.71998376},"labels":[],"label_agreement":null},{"id":"W4309783453","doi":"10.1007/s00453-022-01062-3","title":"On the Tractability of Covering a Graph with 2-Clubs","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Università degli studi di Bergamo","keywords":"Algorithm; Parameterized complexity; Graph; Computer science; Club; Artificial intelligence; Combinatorics; Mathematics; Geology","score_opus":0.014201262110029454,"score_gpt":0.2454591080255627,"score_spread":0.23125784591553325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309783453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44336346,0.00007122974,0.5495349,0.0024527814,0.00015868926,0.0005724252,0.000026517047,0.00013049007,0.0036894965],"genre_scores_gemma":[0.99212134,0.0000013809426,0.0075371764,0.00017309551,0.000008297688,0.0000813713,6.6448894e-7,0.000007806537,0.0000688625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985979,0.00021364167,0.00012550307,0.0002809228,0.0005549916,0.00022704226],"domain_scores_gemma":[0.99838054,0.00067439233,0.00006555951,0.0007856586,0.000050551476,0.000043284905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006722957,0.00008504599,0.000111524634,0.000084458254,0.00027849548,0.000022647351,0.0011720671,0.000011295395,0.00009656982],"category_scores_gemma":[0.00005868065,0.000055919943,0.00005611541,0.00080836035,0.00014630485,0.00013215982,0.00039771743,0.00031806575,0.000004984135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016797881,0.00036531876,0.00022843959,0.000013915883,0.00006140103,0.00003700354,0.0012839367,0.005000609,0.0019373306,0.9479812,0.00029697444,0.04262594],"study_design_scores_gemma":[0.0012469011,0.00284517,0.004558074,0.000026243875,0.0000122655965,0.00011678199,0.00069692446,0.06500359,0.03234965,0.8872211,0.0053683193,0.0005550041],"about_ca_topic_score_codex":0.000015945689,"about_ca_topic_score_gemma":0.000001788796,"teacher_disagreement_score":0.5487579,"about_ca_system_score_codex":0.000040511084,"about_ca_system_score_gemma":0.000056769783,"threshold_uncertainty_score":0.22803491},"labels":[],"label_agreement":null},{"id":"W4310697302","doi":"10.48550/arxiv.2111.03639","title":"Randomized Communication and Implicit Graph Representations","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Waterloo","keywords":"Combinatorics; Mathematics; Bipartite graph; Adjacency list; Constant (computer programming); Discrete mathematics; Oracle; Graph; Adjacency matrix; Computer science","score_opus":0.07825722120564545,"score_gpt":0.2509182619427501,"score_spread":0.17266104073710464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310697302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19296138,0.0005714845,0.8024203,0.00029300078,0.00010399281,0.0005487956,0.0000059986883,0.00017410672,0.0029209096],"genre_scores_gemma":[0.98716325,0.0025257617,0.009397445,0.000060103725,0.0000117420905,0.000007423533,0.0000344129,0.000013649691,0.00078620814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734324,0.0010826911,0.00022531349,0.00096919696,0.00010573528,0.0002738297],"domain_scores_gemma":[0.99601525,0.00089953997,0.00021736589,0.0024148813,0.00029421935,0.00015873599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079092,0.000220225,0.0004785373,0.00036478403,0.00029374383,0.00026398245,0.0017892005,0.00017264587,0.000021830314],"category_scores_gemma":[0.0002044274,0.00025172552,0.0002512482,0.0008533881,0.0004810102,0.00057663,0.004319283,0.0006508992,0.000009096987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080981286,0.000053710188,0.0004468558,0.000040169027,0.00015796213,0.000084712185,0.00057367166,0.022790516,0.00007928433,0.9744294,0.000049786744,0.00048411285],"study_design_scores_gemma":[0.019709544,0.000011146853,0.00048500038,0.000079448764,0.00006636609,0.000011438098,0.0002998108,0.16477473,0.00018947531,0.8139853,0.000040365783,0.00034740334],"about_ca_topic_score_codex":0.00020965438,"about_ca_topic_score_gemma":0.00004666987,"teacher_disagreement_score":0.79420185,"about_ca_system_score_codex":0.000065256936,"about_ca_system_score_gemma":0.00012261918,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W4311250857","doi":"10.48550/arxiv.2212.04659","title":"A refinement on the structure of vertex-critical ($P_5$, gem)-free graphs","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Combinatorics; Induced subgraph; Mathematics; Discrete mathematics; Chordal graph; Computer science; Graph","score_opus":0.0711221325704998,"score_gpt":0.22897521253619568,"score_spread":0.15785307996569586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311250857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83321536,0.0002001982,0.15167443,0.002866111,0.0017913684,0.0013264939,0.00041793345,0.00037088472,0.008137217],"genre_scores_gemma":[0.99791896,0.00007308722,0.0012256952,0.00021848628,0.000017397522,0.000001926804,0.0000096894355,0.000021252146,0.0005134787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971545,0.00055378966,0.00023994638,0.0011554717,0.00040517538,0.0004911256],"domain_scores_gemma":[0.9947996,0.00091395655,0.00017452645,0.0037609672,0.00019471663,0.00015623997],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004224804,0.0003304593,0.00035322414,0.0004331131,0.00034709318,0.000064429754,0.0065145777,0.00016605417,0.00052790623],"category_scores_gemma":[0.00036810973,0.00028948116,0.00030680417,0.0011887017,0.00047866665,0.00016698614,0.008268655,0.0014932145,0.00001398446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008093203,0.000098527904,0.00025243885,0.000058903992,0.00008088558,0.00016627905,0.00014285461,0.02365842,0.00025720298,0.97428274,0.0006536328,0.0002671814],"study_design_scores_gemma":[0.0003748333,0.00020839513,0.00040867255,0.00005786752,0.000032153126,0.0000036218412,0.00014375741,0.021690786,0.0008127792,0.97522515,0.0007315006,0.00031051034],"about_ca_topic_score_codex":0.000048511123,"about_ca_topic_score_gemma":0.000021735576,"teacher_disagreement_score":0.16470364,"about_ca_system_score_codex":0.00020710414,"about_ca_system_score_gemma":0.00020149379,"threshold_uncertainty_score":0.9999557},"labels":[],"label_agreement":null},{"id":"W4312107465","doi":"10.48550/arxiv.2212.10757","title":"Circular flows in mono-directed signed graphs","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; European Commission; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Young Elite Scientists Sponsorship Program by Tianjin; Agence Nationale de la Recherche","keywords":"Combinatorics; Signed graph; Mathematics; Vertex (graph theory); Sigma; Graph; Discrete mathematics; Physics","score_opus":0.06446944014509982,"score_gpt":0.21298352238818033,"score_spread":0.1485140822430805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312107465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70932335,0.0002447413,0.28489518,0.000079907826,0.0006279432,0.0008159809,0.000030799863,0.0008587166,0.0031234177],"genre_scores_gemma":[0.9962978,0.00015042063,0.0025319592,0.0000570196,0.000018329334,0.00000878877,0.000021577293,0.000034216588,0.000879897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614286,0.00078832364,0.00027794056,0.0018287676,0.00025303033,0.0007090784],"domain_scores_gemma":[0.9969205,0.00025074944,0.00018885238,0.0022673262,0.00013780793,0.00023475506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070889376,0.00040015604,0.00047364808,0.0013461433,0.00024558834,0.000104233615,0.0043110834,0.0002536295,0.00025766125],"category_scores_gemma":[0.00008587712,0.0005246964,0.00032090902,0.0032826352,0.00013846297,0.000473769,0.005374698,0.0015227334,0.000057649046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008126789,0.00023754395,0.0070620133,0.00009069428,0.00011470883,0.0029906752,0.00045211476,0.52228737,0.00043270664,0.46505672,0.00008133557,0.0011128401],"study_design_scores_gemma":[0.00063503854,0.00005794119,0.0023462852,0.00003490914,0.000015294483,0.0000042979455,0.00008732154,0.47644216,0.0001166945,0.51929575,0.00040288013,0.00056139485],"about_ca_topic_score_codex":0.00017635607,"about_ca_topic_score_gemma":0.00006573559,"teacher_disagreement_score":0.28697446,"about_ca_system_score_codex":0.0005085171,"about_ca_system_score_gemma":0.0003105435,"threshold_uncertainty_score":0.99972045},"labels":[],"label_agreement":null},{"id":"W4312619734","doi":"10.1007/978-3-031-20624-5_32","title":"On the Zombie Number of Various Graph Classes","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Ottawa; Carleton University","funders":"","keywords":"Zombie; Combinatorics; Vertex (graph theory); Graph; Computer science; Upper and lower bounds; Time complexity; Mathematics; Computer security","score_opus":0.021685132845375713,"score_gpt":0.286610425871994,"score_spread":0.26492529302661827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312619734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026105976,0.00017164598,0.97850204,0.0012315413,0.0011064353,0.00046912418,0.000009981426,0.00010251242,0.018145686],"genre_scores_gemma":[0.7076031,0.00024261797,0.2837655,0.005814922,0.0003662935,0.00010344112,0.000008374229,0.00014763481,0.0019481236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99515605,0.00015345444,0.0004952264,0.0014148797,0.0020479294,0.0007324567],"domain_scores_gemma":[0.99341655,0.0033501147,0.0003359599,0.0025232937,0.0002438862,0.00013022471],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017285625,0.0004742276,0.00050411903,0.00079496717,0.0004994971,0.00024842692,0.007291546,0.00017406052,0.00037539878],"category_scores_gemma":[0.00027220658,0.00034740666,0.00022147357,0.0015699463,0.0017200281,0.00042105172,0.0029390727,0.0016586386,0.00005496036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012156498,0.000041357212,0.000034781762,0.000017008422,0.000014962476,0.00006548882,0.00034809002,0.014167447,0.0000561885,0.8960905,0.000046642464,0.089105345],"study_design_scores_gemma":[0.00014909863,0.00022554085,0.000042507025,0.00010938086,0.000004000544,0.00006915424,2.5741122e-7,0.023061195,0.00077384536,0.973081,0.0021003007,0.00038372254],"about_ca_topic_score_codex":0.000020837924,"about_ca_topic_score_gemma":0.000021678312,"teacher_disagreement_score":0.707342,"about_ca_system_score_codex":0.00023,"about_ca_system_score_gemma":0.00054629834,"threshold_uncertainty_score":0.9998978},"labels":[],"label_agreement":null},{"id":"W4312849998","doi":"10.1007/978-3-031-20624-5_31","title":"Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Homomorphism; Combinatorics; Conjecture; Mathematics; Discrete mathematics; Graph homomorphism; Bipartite graph; Graph; Line graph","score_opus":0.016646946668137996,"score_gpt":0.2586985705551679,"score_spread":0.2420516238870299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312849998","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006395537,0.0016841886,0.99426544,0.0010586727,0.0005698802,0.0010110525,0.00002285396,0.00014549535,0.0006028834],"genre_scores_gemma":[0.21422887,0.00055011903,0.781124,0.0020525092,0.00024531578,0.00025312978,0.000018638553,0.00014003563,0.0013873869],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600583,0.00005965858,0.00041243323,0.0018980886,0.0008454417,0.00077855226],"domain_scores_gemma":[0.9967011,0.0015853214,0.00021150034,0.0010488163,0.00020343557,0.0002497832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012284409,0.00054240995,0.00059404975,0.0012314494,0.00075732585,0.00062377704,0.0023374665,0.00019585153,0.000028977129],"category_scores_gemma":[0.00018579763,0.0005252341,0.00010258089,0.0007797172,0.0019868673,0.0007702322,0.0026137272,0.0006930526,0.0000016327452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006569368,0.000040122413,0.000064509135,0.00016406528,0.000030056968,0.00013075283,0.0018871563,0.0012465941,0.0016068376,0.4619857,0.000037619855,0.5327409],"study_design_scores_gemma":[0.00063779025,0.00065059133,0.00003323191,0.00012224649,0.000009527766,0.000106604515,7.5167833e-7,0.08033832,0.0008277108,0.9098297,0.0067018215,0.0007417549],"about_ca_topic_score_codex":0.000025262565,"about_ca_topic_score_gemma":0.000067572255,"teacher_disagreement_score":0.5319992,"about_ca_system_score_codex":0.00013238762,"about_ca_system_score_gemma":0.00025817062,"threshold_uncertainty_score":0.9997199},"labels":[],"label_agreement":null},{"id":"W4313325064","doi":"10.1016/j.disc.2022.113289","title":"Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Induced subgraph; Mathematics; Distance-hereditary graph; Hamiltonian path; Pancyclic graph; Discrete mathematics; Factor-critical graph; Induced path; Cograph; Graph; Line graph; Vertex (graph theory); Pathwidth; Graph power","score_opus":0.019883120479224105,"score_gpt":0.2683981368726628,"score_spread":0.24851501639343868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313325064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748816,0.000050878043,0.019860825,0.00046916518,0.00022710729,0.0006319651,0.000084049476,0.00006766708,0.0037267767],"genre_scores_gemma":[0.9777929,0.000003827725,0.02191858,0.000049690458,0.0000071292466,0.00006635422,0.0000027806157,0.000027038755,0.00013170758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972453,0.00026378472,0.0006313368,0.00035219255,0.0010918047,0.0004155621],"domain_scores_gemma":[0.9963505,0.00045117637,0.00049935764,0.0024396435,0.00017254527,0.00008673655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009069954,0.00021346445,0.00041328152,0.00031002867,0.0002763549,0.000032886008,0.00431674,0.0000556162,0.000048173188],"category_scores_gemma":[0.00034046936,0.00016121828,0.00030883844,0.0021997627,0.0002974692,0.00019285253,0.002552855,0.00041757326,0.0000024820254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035656365,0.00031331065,0.0011818013,0.00026029756,0.00009537172,0.000008227411,0.008080939,0.0001650316,0.07590864,0.9130488,0.00031114795,0.00059079804],"study_design_scores_gemma":[0.0013727882,0.0005825055,0.005011547,0.000110254776,0.000041511248,0.00003814468,0.0029353872,0.033527825,0.07983966,0.87589437,0.00018052557,0.00046546015],"about_ca_topic_score_codex":0.000015033356,"about_ca_topic_score_gemma":0.000014393533,"teacher_disagreement_score":0.037154395,"about_ca_system_score_codex":0.00003664647,"about_ca_system_score_gemma":0.0001271754,"threshold_uncertainty_score":0.8021649},"labels":[],"label_agreement":null},{"id":"W4313331485","doi":"10.1287/moor.2022.1339","title":"Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Unimodular matrix; Mathematics; Bounded function; Polynomial; Integer (computer science); Upper and lower bounds; Combinatorics; Matrix (chemical analysis); Relaxation (psychology); Matrix polynomial; Constraint (computer-aided design); Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.08539722762037652,"score_gpt":0.38763204911546406,"score_spread":0.3022348214950875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313331485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9628516,0.000027688895,0.0316811,0.0008403201,0.000053524393,0.0008837434,0.000019234403,0.000020061074,0.0036227298],"genre_scores_gemma":[0.9740182,0.000005742767,0.024444472,0.000009046209,0.000012933668,0.00031153942,0.0000032453565,0.000017260256,0.0011775711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968205,0.0005085103,0.00047354348,0.00024057912,0.0016048816,0.00035199997],"domain_scores_gemma":[0.997324,0.00078323204,0.00006783922,0.0011902855,0.00057804404,0.00005662886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032301722,0.00010141097,0.00025193612,0.00029854808,0.00053588423,0.00009511442,0.0019275725,0.000031466498,0.00029862518],"category_scores_gemma":[0.00054369617,0.00007666532,0.000108023305,0.0015194678,0.0005636752,0.00016991887,0.0014067802,0.00053762464,0.0000139661415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003793121,0.0016683982,0.00068469124,0.00017484838,0.00008197686,0.0000037520304,0.008237154,0.0058273706,0.039608873,0.9409118,0.00044518104,0.0023180165],"study_design_scores_gemma":[0.0012642064,0.002106495,0.0008627722,0.0003194229,0.00001618445,0.000059655154,0.011255123,0.7684937,0.12634614,0.08675729,0.0020083329,0.00051065657],"about_ca_topic_score_codex":0.00006242567,"about_ca_topic_score_gemma":0.000011274472,"teacher_disagreement_score":0.8541545,"about_ca_system_score_codex":0.00008223407,"about_ca_system_score_gemma":0.00020770004,"threshold_uncertainty_score":0.41216424},"labels":[],"label_agreement":null},{"id":"W4313349528","doi":"10.1007/978-3-031-20796-9_14","title":"Bounds for the Oriented Diameter of Planar Triangulations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Planar graph; Treewidth; Outerplanar graph; Pathwidth; Mathematics; Bounded function; Planar; 1-planar graph; Discrete mathematics; Upper and lower bounds; Graph; Book embedding; Chordal graph; Computer science; Line graph","score_opus":0.030204133745168296,"score_gpt":0.2973592118436405,"score_spread":0.2671550780984722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313349528","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010699766,0.0006558274,0.9949723,0.0014696312,0.001131519,0.00085704494,0.000039240607,0.000059365575,0.0008043544],"genre_scores_gemma":[0.03252205,0.00006672455,0.9642771,0.0010714626,0.000379142,0.00017654362,0.000019483181,0.00006638456,0.001421142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969522,0.0000575548,0.00046403764,0.0009601158,0.0010411369,0.0005249644],"domain_scores_gemma":[0.9939213,0.003749825,0.00028500406,0.0016849458,0.000268964,0.00008995332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014745619,0.00030234206,0.00039023746,0.00078768533,0.00060932484,0.0001579793,0.0040761163,0.00011410699,0.00006792619],"category_scores_gemma":[0.00031745277,0.00022566464,0.00021051696,0.0010148056,0.0011160759,0.00040095847,0.0010656627,0.000626595,0.0000041322237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037673213,0.00003227388,0.000038821512,0.000029579807,0.000034682518,0.000011420147,0.0009910022,0.028025595,0.00012387957,0.60500365,0.00006111817,0.3656103],"study_design_scores_gemma":[0.0005296321,0.00040054918,0.00009387294,0.00006955854,0.000014920114,0.000025398798,6.786931e-7,0.29142725,0.0005887389,0.66735196,0.03906874,0.00042872096],"about_ca_topic_score_codex":0.00005154255,"about_ca_topic_score_gemma":0.00016601045,"teacher_disagreement_score":0.3651816,"about_ca_system_score_codex":0.00024113593,"about_ca_system_score_gemma":0.0007276535,"threshold_uncertainty_score":0.9202337},"labels":[],"label_agreement":null},{"id":"W4313351153","doi":"10.1007/978-3-031-22105-7_25","title":"Semi-strict Chordal Digraphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Chordal graph; Digraph; Interval graph; Combinatorics; Computer science; Mathematics; Transitive relation; Discrete mathematics; Graph; 1-planar graph","score_opus":0.01945569434449878,"score_gpt":0.273544141588552,"score_spread":0.2540884472440532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313351153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074144664,0.000952563,0.9830767,0.0005965955,0.0018055657,0.00053190475,0.000015303527,0.0003162665,0.012630975],"genre_scores_gemma":[0.23870312,0.0007548527,0.74790806,0.0048389616,0.0015107468,0.00016905542,0.00004304832,0.00028656106,0.0057856077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932061,0.00013587848,0.00058631273,0.0024299384,0.0023747236,0.0012670527],"domain_scores_gemma":[0.9952133,0.001266483,0.0002894554,0.0026641067,0.00023093545,0.0003356748],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020221013,0.00068614125,0.0006372289,0.0022135933,0.0006867566,0.0005807495,0.008536191,0.00026148054,0.00024617728],"category_scores_gemma":[0.00021224427,0.00066601345,0.00026881127,0.0023891693,0.0012119021,0.0011251367,0.0050252466,0.002216478,0.00007231948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002098013,0.000050451512,0.00012904571,0.000032636195,0.000021583817,0.0004198813,0.00056245446,0.03252216,0.00016298526,0.2545164,0.000057380727,0.71150404],"study_design_scores_gemma":[0.00042680674,0.00044666743,0.00014230698,0.0001368862,0.000007303527,0.0002085451,3.048023e-7,0.13937189,0.0008759508,0.82734615,0.029749919,0.0012872887],"about_ca_topic_score_codex":0.000022205917,"about_ca_topic_score_gemma":0.000031953186,"teacher_disagreement_score":0.71021676,"about_ca_system_score_codex":0.0005402119,"about_ca_system_score_gemma":0.0007700633,"threshold_uncertainty_score":0.99957913},"labels":[],"label_agreement":null},{"id":"W4313450058","doi":"10.1016/j.ejc.2007.04.014","title":"An upper bound for the chromatic number of line graphs","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Upper and lower bounds; Computer science; Line (geometry); Combinatorics; Mathematics; Geometry","score_opus":0.02439923940933715,"score_gpt":0.3239694786796888,"score_spread":0.29957023927035165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313450058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23678625,0.00038867386,0.76039255,0.00020395344,0.0006778142,0.00012612871,9.574021e-7,0.000016545531,0.0014071345],"genre_scores_gemma":[0.9856693,0.000053173033,0.01399009,0.00007583165,0.00008359136,4.3158278e-7,2.441778e-7,0.000023351813,0.00010398392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813247,0.00032328625,0.00058966386,0.00012689353,0.0005352159,0.00029244472],"domain_scores_gemma":[0.9973873,0.00077030313,0.000466972,0.000566821,0.0006474702,0.00016117067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058549293,0.000115923,0.00020400701,0.00016642212,0.00016239173,0.00008526522,0.0019222597,0.000017471357,0.0000085837155],"category_scores_gemma":[0.00025505666,0.00007757725,0.00016737661,0.0006651009,0.00014307039,0.00047317334,0.000120577424,0.00029065064,0.000009173813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105975,0.00038607663,0.002411616,0.000042503147,0.000086029715,0.00013282403,0.0009643827,0.00014830453,0.0017714812,0.9703104,0.00054504274,0.023095364],"study_design_scores_gemma":[0.0034148314,0.0030451068,0.024100699,0.00013675504,0.00005555598,0.00067673234,0.0003353402,0.0043497207,0.008318078,0.9405162,0.01466816,0.00038286403],"about_ca_topic_score_codex":3.1680253e-7,"about_ca_topic_score_gemma":2.0146835e-7,"teacher_disagreement_score":0.74888307,"about_ca_system_score_codex":0.00002942578,"about_ca_system_score_gemma":0.000057813628,"threshold_uncertainty_score":0.35720688},"labels":[],"label_agreement":null},{"id":"W4313483988","doi":"10.48550/arxiv.2301.00434","title":"Cops and robbers pebbling in graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Merge (version control); Security token; Graph; Computer science; Combinatorics; Theoretical computer science; Discrete mathematics; Mathematics; Computer network; Parallel computing","score_opus":0.12628454702569075,"score_gpt":0.22976733723899354,"score_spread":0.10348279021330278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313483988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6837891,0.00013553373,0.31369737,0.00018638639,0.00044074003,0.00038896166,0.0000074547797,0.0004302588,0.00092423236],"genre_scores_gemma":[0.9961988,0.00055433845,0.0019409276,0.000032757103,0.000014424812,0.0000014982795,0.000005101458,0.000022348357,0.0012298175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978242,0.00019344909,0.0001660231,0.0012220618,0.0001135159,0.00048073826],"domain_scores_gemma":[0.9983433,0.0002890481,0.00010676551,0.0009999193,0.00008331346,0.00017763878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056388194,0.00024602588,0.00028929932,0.0010218162,0.00012109742,0.00011750322,0.0016531338,0.00020783007,0.000006121828],"category_scores_gemma":[0.00007440844,0.0003029225,0.00010792521,0.0016753171,0.00021041546,0.0004062221,0.0035110996,0.00086122635,0.000052279418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029768886,0.000035386736,0.018834809,0.00007385507,0.000040186285,0.0010068276,0.00038066888,0.15439595,0.00004299604,0.8243415,0.00006367481,0.00075438234],"study_design_scores_gemma":[0.0004148489,0.000027874037,0.004355317,0.000108507,0.000008213282,0.0000035881565,0.00013334778,0.2502551,0.000045251374,0.74424016,0.00007097363,0.0003368309],"about_ca_topic_score_codex":0.00016342828,"about_ca_topic_score_gemma":0.00018095646,"teacher_disagreement_score":0.31240973,"about_ca_system_score_codex":0.00013003757,"about_ca_system_score_gemma":0.00011859998,"threshold_uncertainty_score":0.9999423},"labels":[],"label_agreement":null},{"id":"W4315472389","doi":"10.1109/cdc51059.2022.9992862","title":"Linear Stochastic Graphon Systems with Q-Space Noise","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Noise (video); Computer science; Space (punctuation); Linear system; Statistical physics; Mathematics; Physics; Mathematical analysis; Artificial intelligence","score_opus":0.022862459549763823,"score_gpt":0.2726310505189883,"score_spread":0.24976859096922446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315472389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04383617,0.0005122084,0.9520687,0.00092210993,0.0008086807,0.0008723326,0.000057650897,0.00018802124,0.00073415885],"genre_scores_gemma":[0.9967565,0.000055284687,0.0012309441,0.00041217613,0.00005559059,0.0003423655,0.0000034827976,0.000029446464,0.0011142192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608564,0.00045496516,0.00036839527,0.0009929907,0.0014868921,0.00061111077],"domain_scores_gemma":[0.997193,0.0008750402,0.00018940626,0.0011304982,0.0002577217,0.00035433564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009908186,0.00034088845,0.00049307104,0.00051634357,0.0007714933,0.00034402,0.001425345,0.00006541263,0.00016738795],"category_scores_gemma":[0.00011504814,0.0002770674,0.00009536589,0.0010325786,0.000176876,0.000338126,0.0003593998,0.00073922717,0.00007385143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052463976,0.0006835414,0.00039190383,0.000044984303,0.00020342984,0.00056185154,0.0011112043,0.1039969,0.01107649,0.74524,0.0024576243,0.12898569],"study_design_scores_gemma":[0.0073568276,0.0031110886,0.0005291871,0.0001268316,0.000031603493,0.00020921713,0.00093188835,0.9537594,0.00014420865,0.027926845,0.005020661,0.0008522663],"about_ca_topic_score_codex":0.000036157573,"about_ca_topic_score_gemma":0.000018960172,"teacher_disagreement_score":0.9529203,"about_ca_system_score_codex":0.000081192265,"about_ca_system_score_gemma":0.00019724046,"threshold_uncertainty_score":0.9999682},"labels":[],"label_agreement":null},{"id":"W4316652490","doi":"10.1137/1.9781611977554.ch52","title":"Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"Uniwersytet Warszawski","keywords":"Combinatorics; Euclidean geometry; Travelling salesman problem; Mathematics; Plane (geometry); Planar graph; Euclidean distance; Graph; Algorithm; Geometry","score_opus":0.12640079075434937,"score_gpt":0.31834753798452814,"score_spread":0.19194674723017877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316652490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013520572,0.00007385566,0.95912707,0.00026822678,0.00028096503,0.0057985303,0.00017532315,0.0004245254,0.032499474],"genre_scores_gemma":[0.0026304193,0.0001124797,0.7535564,0.00016461956,0.0018557358,0.0015198907,0.0003591749,0.00041896233,0.23938233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759454,0.000010434625,0.0006884293,0.0007858883,0.00041542773,0.00050526066],"domain_scores_gemma":[0.99782,0.00088229077,0.0005546167,0.000425261,0.00015276388,0.00016502032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012828499,0.000491756,0.0006740893,0.00013596159,0.00084296695,0.00046261042,0.00042683122,0.0008344154,0.0000013859403],"category_scores_gemma":[0.000047811387,0.00047297784,0.0003770065,0.000070108246,0.0003970311,0.00013784342,0.0002545823,0.0005404265,0.000002439093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005343713,0.000012791284,9.872706e-8,0.0005547449,0.00016375275,4.664214e-7,0.002748424,0.000014112436,0.002322127,0.94643533,0.00050194835,0.047192745],"study_design_scores_gemma":[0.0020937757,0.00016006638,8.016909e-8,0.00036047527,0.00013341235,0.0000058472406,0.00043669058,0.024649188,0.007012135,0.94878453,0.01573014,0.0006336681],"about_ca_topic_score_codex":0.0000011069874,"about_ca_topic_score_gemma":0.000003723081,"teacher_disagreement_score":0.20688285,"about_ca_system_score_codex":0.000074307136,"about_ca_system_score_gemma":0.00015608336,"threshold_uncertainty_score":0.9997722},"labels":[],"label_agreement":null},{"id":"W4317617507","doi":"10.26493/1855-3974.2853.b51","title":"Domination and independence number of large 2-crossing-critical graphs","year":2023,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Independence number; Mathematics; Combinatorics; Domination analysis; Independence (probability theory); Subfamily; Crossing number (knot theory); Upper and lower bounds; Discrete mathematics; Graph; Statistics; Geography; Vertex (graph theory)","score_opus":0.03054575374732277,"score_gpt":0.3541777078688711,"score_spread":0.3236319541215483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317617507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57123494,0.00013132484,0.41799682,0.0020836066,0.00018215839,0.0005620731,0.000021057589,0.00046544382,0.0073225605],"genre_scores_gemma":[0.98008394,0.000012102938,0.01948895,0.00004700556,0.0000051931265,0.000028252087,0.0000021631574,0.000014191985,0.00031820612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818474,0.00013238704,0.00036655407,0.00035742985,0.0005804989,0.00037837762],"domain_scores_gemma":[0.9978702,0.0011520342,0.00009973028,0.0005494347,0.00020851415,0.00012005634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001683156,0.00013918364,0.00027800252,0.00019524514,0.00020227126,0.00015316262,0.0005612813,0.00007886026,0.000030192565],"category_scores_gemma":[0.0009124245,0.00012630512,0.00006601763,0.00087911385,0.00046029972,0.0006470664,0.00035099775,0.00017455016,0.00014348449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106799735,0.00006925519,0.001020416,0.00018142974,0.000012670279,0.000035456935,0.0017337285,5.154665e-7,0.0020534308,0.9929446,0.00013277696,0.0018050221],"study_design_scores_gemma":[0.00054564513,0.000040172337,0.0007531697,0.00011840652,0.0000049052046,0.000056328983,0.0002487911,0.012757327,0.0030113698,0.98214567,0.00015706639,0.00016112337],"about_ca_topic_score_codex":0.0000038725293,"about_ca_topic_score_gemma":0.0000024392918,"teacher_disagreement_score":0.40884897,"about_ca_system_score_codex":0.000010981512,"about_ca_system_score_gemma":0.000059560403,"threshold_uncertainty_score":0.5150573},"labels":[],"label_agreement":null},{"id":"W4318620924","doi":"10.48550/arxiv.2301.11577","title":"Defective acyclic colorings of planar graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Graph; Integer (computer science); Planar; Edge coloring; Discrete mathematics; Graph power; Computer science; Line graph","score_opus":0.11543747030010088,"score_gpt":0.23038956970957775,"score_spread":0.11495209940947687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318620924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5859469,0.00005132329,0.40903392,0.00007117139,0.00040719734,0.00052840123,0.00004456374,0.00053256354,0.0033839713],"genre_scores_gemma":[0.99652576,0.00021499855,0.0016847077,0.000019159006,0.000013943335,0.0000029843477,0.000008783618,0.000028603012,0.0015010663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976475,0.00023570364,0.00021821434,0.0012242189,0.00018007688,0.00049425045],"domain_scores_gemma":[0.9972471,0.0004940807,0.00028819192,0.0015521277,0.0002301254,0.00018837216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044523756,0.00029853318,0.00043296456,0.00084953074,0.00013720802,0.00004549082,0.0030118797,0.0002583389,0.000009167335],"category_scores_gemma":[0.000107330896,0.00035411227,0.00032618694,0.0018372312,0.0003320973,0.00035795325,0.002764182,0.0007836025,0.00012817796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060317376,0.0000609004,0.005591031,0.00009202417,0.000150327,0.0003257889,0.00020670754,0.024472045,0.00020036656,0.9685974,0.000092898816,0.0001502061],"study_design_scores_gemma":[0.00038614648,0.00011307293,0.0056082048,0.00010261396,0.000032689823,0.0000029936466,0.000105443956,0.016118916,0.0010508498,0.97595626,0.00015022165,0.00037258305],"about_ca_topic_score_codex":0.00016435931,"about_ca_topic_score_gemma":0.000045701487,"teacher_disagreement_score":0.41057888,"about_ca_system_score_codex":0.00016295759,"about_ca_system_score_gemma":0.00017686361,"threshold_uncertainty_score":0.9998911},"labels":[],"label_agreement":null},{"id":"W4318953856","doi":"10.1016/j.disc.2023.113342","title":"The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Bounded function; Matching (statistics); Vertex (graph theory); Time complexity; Discrete mathematics; Graph","score_opus":0.01991825721515068,"score_gpt":0.2848979128020826,"score_spread":0.26497965558693193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318953856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96552366,0.00010429139,0.028176457,0.0008097119,0.000043557302,0.00062322104,0.0000058615847,0.00021744859,0.00449582],"genre_scores_gemma":[0.8334348,0.00024216775,0.16464487,0.000045406665,0.000017244482,0.00016461955,0.0000022108745,0.00005109196,0.0013975941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986157,0.00006826155,0.00022086113,0.00030495954,0.0003101389,0.0004801023],"domain_scores_gemma":[0.9984001,0.0009681928,0.000071296614,0.00043866292,0.000035817146,0.000085957756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010030989,0.00015742025,0.00019005706,0.00007200415,0.00035538856,0.00045446458,0.00043682556,0.000036825328,0.0000030839535],"category_scores_gemma":[0.00008308776,0.00010019466,0.000020883215,0.0007462862,0.0001925837,0.0003413139,0.00051088026,0.00021096686,0.000014676586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003350975,0.00003310211,0.0051830155,0.00043109414,0.00004938322,0.00007246144,0.015132871,0.00014585131,0.0006133898,0.97458225,0.00010359672,0.0036194941],"study_design_scores_gemma":[0.00037876752,0.000040493418,0.001228878,0.00012757634,0.0000044137437,0.000047200945,0.0021819505,0.013207121,0.00015458427,0.98207915,0.00036431712,0.0001855602],"about_ca_topic_score_codex":0.000014614875,"about_ca_topic_score_gemma":0.00006438113,"teacher_disagreement_score":0.13646841,"about_ca_system_score_codex":0.00002102251,"about_ca_system_score_gemma":0.000030257614,"threshold_uncertainty_score":0.43824124},"labels":[],"label_agreement":null},{"id":"W4319722891","doi":"10.37236/11461","title":"Cooperative Colorings of Forests","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Star (game theory); Graph; Greedy coloring; Discrete mathematics; Line graph","score_opus":0.015500626155127003,"score_gpt":0.2886190215033137,"score_spread":0.2731183953481867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319722891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78401273,0.0017177337,0.2095206,0.002528331,0.00049514644,0.00023630536,7.7651833e-7,0.00006529956,0.0014230768],"genre_scores_gemma":[0.9990311,0.0004663506,0.000034442644,0.000018942721,0.000018553597,0.000002841343,1.4651529e-7,0.0000092416485,0.0004183281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829346,0.00018884789,0.00032637065,0.000099462224,0.00057171984,0.0005201175],"domain_scores_gemma":[0.99822664,0.0005644432,0.00030000348,0.00034523648,0.0005003577,0.00006331997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020979573,0.0000940479,0.00021908173,0.00022676976,0.00012008185,0.000031162217,0.0017152833,0.0000336667,0.0000028283582],"category_scores_gemma":[0.0002469394,0.000061942956,0.00009752117,0.0020510277,0.00011633098,0.0003412372,0.00023204104,0.00058261206,0.00001344112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033974306,0.000036204878,0.00022699125,0.000005274583,0.000045736233,0.000011856672,0.00031168174,0.00056186126,0.0010168505,0.9969695,0.00021887234,0.000561147],"study_design_scores_gemma":[0.00053211115,0.0009594623,0.0007549722,0.000016154741,0.000006904577,0.0000692007,0.0000764839,0.00093484763,0.018759875,0.97613513,0.0016869796,0.00006789387],"about_ca_topic_score_codex":0.0000013526518,"about_ca_topic_score_gemma":0.0000029160492,"teacher_disagreement_score":0.21501842,"about_ca_system_score_codex":0.00014614785,"about_ca_system_score_gemma":0.0005165665,"threshold_uncertainty_score":0.31874517},"labels":[],"label_agreement":null},{"id":"W4321277043","doi":"10.1007/s00453-025-01356-2","title":"Maximum Independent Set when Excluding an Induced Minor: $$K_1 + tK_2$$ and $$tC_3 \\uplus C_4$$","year":2025,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Disjoint sets; Discrete mathematics; Time complexity; Graph; Planar graph","score_opus":0.06205807901296858,"score_gpt":0.3396687315471117,"score_spread":0.27761065253414313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321277043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14034374,0.0018046611,0.83888626,0.0027888662,0.00392337,0.0026291225,0.00035006646,0.0012645577,0.0080093425],"genre_scores_gemma":[0.5668966,0.00039678405,0.42401126,0.001163239,0.001057797,0.0006724766,0.00025158166,0.00017160158,0.0053786593],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944999,0.0005198269,0.0006424024,0.0022379514,0.001030982,0.0010689154],"domain_scores_gemma":[0.99577224,0.00035126138,0.00029322432,0.0027688253,0.00030347068,0.0005109529],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012195626,0.0006997787,0.0007767644,0.0008710519,0.0003772602,0.00072896446,0.0039917864,0.00067936804,0.000045279856],"category_scores_gemma":[0.00014744725,0.00073498546,0.00018562871,0.00053430645,0.00020049178,0.00074692414,0.009564905,0.0021567878,0.000042719377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106379455,0.00036397803,0.00063665566,0.000606868,0.0005589738,0.0005758406,0.008049784,0.00037264626,0.0029322084,0.036875427,0.0024295212,0.9464917],"study_design_scores_gemma":[0.0017102191,0.00042451257,0.0015027954,0.00054403784,0.000087019675,0.0001369028,0.00043726587,0.10000622,0.008977589,0.8776642,0.0062926197,0.00221661],"about_ca_topic_score_codex":0.00026259382,"about_ca_topic_score_gemma":0.000044573484,"teacher_disagreement_score":0.9442751,"about_ca_system_score_codex":0.00028026494,"about_ca_system_score_gemma":0.0005628862,"threshold_uncertainty_score":0.9995101},"labels":[],"label_agreement":null},{"id":"W4321377127","doi":"10.1007/s00454-022-00478-6","title":"Three-Dimensional Graph Products with Unbounded Stack-Number","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bounded function; Combinatorics; Mathematics; Upper and lower bounds; Cartesian product; Discrete mathematics; Graph; Vertex (graph theory); Degree (music)","score_opus":0.023090070453325007,"score_gpt":0.29694691226906667,"score_spread":0.27385684181574166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321377127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28936175,0.00006912861,0.70623606,0.0020157956,0.00026671233,0.00042278774,0.000039949624,0.0007145833,0.00087323127],"genre_scores_gemma":[0.88046426,0.0000028979343,0.11820366,0.00029017398,0.00010309722,0.000055243425,0.00024126617,0.000042865344,0.0005965166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649477,0.000090032976,0.0003017635,0.00089713366,0.0015341239,0.0006821551],"domain_scores_gemma":[0.99792403,0.00053328776,0.0001188773,0.000655945,0.0005596798,0.00020817306],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005925996,0.0002784349,0.00025261202,0.00066602277,0.00041120104,0.00021562923,0.000959572,0.00006401953,0.00008038095],"category_scores_gemma":[0.00012245832,0.00023344175,0.00008957625,0.006735248,0.0003142295,0.00078752957,0.00055852043,0.0003242951,0.00095936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016656888,0.00014496835,0.017511668,0.00007634261,0.00022736691,0.0002627417,0.00023788096,0.2705827,0.00019275733,0.69697803,0.0058230017,0.0077959714],"study_design_scores_gemma":[0.0011084324,0.00020945816,0.11414343,0.000055384327,0.000010681258,0.00012387516,0.00004232636,0.15380448,0.00025334023,0.72824264,0.0013494736,0.0006564936],"about_ca_topic_score_codex":0.000015548314,"about_ca_topic_score_gemma":0.000010049021,"teacher_disagreement_score":0.59110254,"about_ca_system_score_codex":0.000056764242,"about_ca_system_score_gemma":0.0002865812,"threshold_uncertainty_score":0.9998185},"labels":[],"label_agreement":null},{"id":"W43227363","doi":"","title":"Average distance in k-connected tournaments.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01215013825521703,"score_gpt":0.2710863167351376,"score_spread":0.25893617847992056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43227363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92066205,0.00056436326,0.0613833,0.0029845731,0.0013825778,0.00046009524,0.000002935958,0.0003663159,0.012193795],"genre_scores_gemma":[0.9948646,0.000026138856,0.004430025,0.00021179071,0.0000074821296,0.000023299934,0.000001257553,0.000012088651,0.00042331635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843544,0.00012721732,0.00023633441,0.00038654974,0.0003489782,0.00046549903],"domain_scores_gemma":[0.99891925,0.00015742541,0.00005924377,0.0006778539,0.00006464638,0.00012155605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998172,0.00013557114,0.00016764137,0.00017538521,0.00009161578,0.00009265681,0.001126522,0.000051039802,0.000038409755],"category_scores_gemma":[0.000108187836,0.00013902875,0.000046589797,0.00086960825,0.000053478932,0.00080695,0.000273834,0.00029067442,0.00016210192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011454923,0.000119100245,0.0027183993,0.00000337976,0.0000056613517,0.000042373635,0.00029369563,0.00025931653,0.00036184452,0.9848086,0.0003412518,0.011034888],"study_design_scores_gemma":[0.0013382528,0.00006295619,0.0048286146,0.00002644067,6.981667e-7,0.000007782268,0.000013340982,0.011840679,0.0027393054,0.96768856,0.011217769,0.00023559417],"about_ca_topic_score_codex":0.000007434679,"about_ca_topic_score_gemma":0.000021925667,"teacher_disagreement_score":0.07420256,"about_ca_system_score_codex":0.00018568635,"about_ca_system_score_gemma":0.00004425363,"threshold_uncertainty_score":0.5669428},"labels":[],"label_agreement":null},{"id":"W4323317406","doi":"10.1007/s00453-023-01106-2","title":"Path Cover Problems with Length Cost","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Corporation; Japan Society for the Promotion of Science London","keywords":"Combinatorics; Mathematics; Disjoint sets; Hamiltonian path; Cover (algebra); Path (computing); Vertex (graph theory); Discrete mathematics; Graph; Computer science","score_opus":0.022347467224206333,"score_gpt":0.2734891129624179,"score_spread":0.25114164573821157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323317406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005810422,0.00007242242,0.9838912,0.0016054335,0.00022956831,0.00073077116,0.000017244798,0.0011223245,0.0065206164],"genre_scores_gemma":[0.76410073,0.00019131612,0.21423383,0.0010215009,0.00037176776,0.00069253135,0.000057999892,0.00014904182,0.019181263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982704,0.00006913249,0.00013139413,0.0004978497,0.00047872993,0.0005524946],"domain_scores_gemma":[0.99876857,0.00017533072,0.000043823733,0.00076733564,0.00010133891,0.00014359517],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038851786,0.00014038001,0.00014097586,0.00017169553,0.00015779155,0.00011175999,0.0009487335,0.00004334269,0.00002773495],"category_scores_gemma":[0.000035802208,0.0001095701,0.000038714083,0.0015532663,0.00011528769,0.00046774975,0.0003561079,0.00021620665,0.0014306982],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060221453,0.00024144696,0.0012115362,0.00010599332,0.00016289778,0.00075767684,0.0019666469,0.0035779746,0.002068931,0.317931,0.022340063,0.6495756],"study_design_scores_gemma":[0.0029416701,0.0011369038,0.00452954,0.00017136523,0.000015295605,0.00019163109,0.0001615429,0.544457,0.008174477,0.16905814,0.26778376,0.001378643],"about_ca_topic_score_codex":0.000008190553,"about_ca_topic_score_gemma":0.0000020179195,"teacher_disagreement_score":0.7696574,"about_ca_system_score_codex":0.000036942958,"about_ca_system_score_gemma":0.00007982816,"threshold_uncertainty_score":0.9993468},"labels":[],"label_agreement":null},{"id":"W4323557190","doi":"10.4230/lipics.itcs.2024.55","title":"Electrical Flows for Polylogarithmic Competitive Oblivious Routing","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Austrian Science Fund; European Commission","keywords":"Routing (electronic design automation); Routing algorithm; Regular polygon; Tree (set theory); Computer science; Combinatorics; Scheme (mathematics); Mathematics; Discrete mathematics; Computer network; Routing protocol; Geometry","score_opus":0.10157218864569131,"score_gpt":0.23884959101315972,"score_spread":0.1372774023674684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323557190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028734019,0.00004057276,0.96781814,0.00018866638,0.0005858965,0.000915207,0.000055572247,0.0007956317,0.00086627674],"genre_scores_gemma":[0.98573965,0.00009051014,0.010763071,0.00006917048,0.0001338304,0.000010723374,0.00003455021,0.00005269241,0.0031057945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967343,0.00025138812,0.0002507975,0.0016784881,0.00017339778,0.0009116277],"domain_scores_gemma":[0.9968269,0.0010798001,0.00021162485,0.00129346,0.00033951388,0.00024871354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006296643,0.00038275737,0.0004649665,0.0006538565,0.00035891155,0.00017128541,0.0030424949,0.0003367086,0.00000852795],"category_scores_gemma":[0.00029123444,0.00046069914,0.00037778867,0.001490266,0.00015311307,0.00031464404,0.0033080892,0.0010526197,0.00016433944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006387866,0.000067622175,0.00051277713,0.00004297162,0.00010714876,0.00031906943,0.00013269736,0.039478328,0.000103299084,0.9578211,0.0001436541,0.0012074739],"study_design_scores_gemma":[0.00048481885,0.00010683555,0.0003182775,0.000058653313,0.000024967081,0.0000053104955,0.000047528672,0.6586984,0.0001631074,0.33942842,0.00026115967,0.0004025658],"about_ca_topic_score_codex":0.000075559205,"about_ca_topic_score_gemma":0.00006465492,"teacher_disagreement_score":0.9570551,"about_ca_system_score_codex":0.00040887354,"about_ca_system_score_gemma":0.00034834223,"threshold_uncertainty_score":0.99978447},"labels":[],"label_agreement":null},{"id":"W4324311863","doi":"10.48550/arxiv.2303.06299","title":"Reconfiguration of Minimum Independent Dominating Sets in Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Block graph; Pathwidth; Split graph; Chordal graph; Indifference graph; Symmetric graph; Graph; Maximal independent set; Vertex-transitive graph; Line graph; Graph power; Voltage graph","score_opus":0.11058991501462338,"score_gpt":0.24482338640016452,"score_spread":0.13423347138554115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324311863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80393004,0.000025925907,0.19376656,0.000074427255,0.00042309918,0.00043012394,0.0000143905145,0.00014914662,0.0011862505],"genre_scores_gemma":[0.99769366,0.00010279877,0.001506273,0.000009802294,0.00000996173,0.0000024784113,0.000012246531,0.000017917333,0.00064486766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997818,0.00031952362,0.00032838492,0.0009859317,0.00017761247,0.00037056647],"domain_scores_gemma":[0.9979481,0.00036085444,0.00033868887,0.0010576241,0.00019453523,0.00010021595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008966551,0.00022407537,0.00034239228,0.0011341107,0.00006896216,0.00004979879,0.0018553735,0.00025559007,0.000012745978],"category_scores_gemma":[0.00014734808,0.00027769076,0.000163336,0.0015360102,0.0001253844,0.00042205356,0.0017685393,0.00071729335,0.00003807511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103924765,0.00016284619,0.013710501,0.0002868268,0.000089190675,0.0007816538,0.0013037217,0.20621623,0.0014316491,0.7710347,0.00006056748,0.004818151],"study_design_scores_gemma":[0.00058380817,0.000056196634,0.007492541,0.00021182065,0.000009642532,0.000002433508,0.0002386251,0.28060853,0.0016359175,0.70883995,0.000008347068,0.00031218026],"about_ca_topic_score_codex":0.00014063763,"about_ca_topic_score_gemma":0.00019414785,"teacher_disagreement_score":0.19376358,"about_ca_system_score_codex":0.00017479096,"about_ca_system_score_gemma":0.00017646687,"threshold_uncertainty_score":0.9999675},"labels":[],"label_agreement":null},{"id":"W4327630093","doi":"10.1016/j.disc.2023.113405","title":"2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Providence Health Care","keywords":"Combinatorics; Mathematics; Complete coloring; Edge coloring; Injective function; List coloring; Square (algebra); Fractional coloring; Planar graph; Discrete mathematics; Degree (music); Greedy coloring; Graph; Graph power; Geometry; Physics; Line graph","score_opus":0.036004568719994384,"score_gpt":0.2867906976001002,"score_spread":0.25078612888010576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327630093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35457557,0.00011989767,0.6375293,0.00012971628,0.000058793015,0.00050027657,0.000031000483,0.0003215365,0.0067338794],"genre_scores_gemma":[0.89898735,0.000055432633,0.10056668,0.0000143043735,0.000010972541,0.00005093081,0.0000063553525,0.00003508654,0.0002729015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985189,0.000049186794,0.0002586484,0.00033802094,0.00046003415,0.00037525233],"domain_scores_gemma":[0.9986286,0.00036783368,0.00014548269,0.0006514956,0.000100452664,0.00010609144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000411888,0.00018258434,0.0002903506,0.0003067983,0.00013039948,0.00007753142,0.0006204543,0.00004738318,0.000005137578],"category_scores_gemma":[0.00009553034,0.00013984993,0.00005277376,0.0013645851,0.00022498891,0.00035073122,0.00023397032,0.00016218613,0.0000106457555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004865611,0.000055388322,0.0049011977,0.0006253385,0.00007184738,0.0000768419,0.0047307755,0.000094040886,0.0006534319,0.9848352,0.00010697132,0.0038003116],"study_design_scores_gemma":[0.0007582423,0.00048564133,0.005707171,0.00042468624,0.000020402165,0.000047379872,0.0026150446,0.022656823,0.0025090107,0.96406704,0.00025516172,0.00045339574],"about_ca_topic_score_codex":0.0000067504498,"about_ca_topic_score_gemma":0.00002485527,"teacher_disagreement_score":0.5444117,"about_ca_system_score_codex":0.00002038096,"about_ca_system_score_gemma":0.00003313942,"threshold_uncertainty_score":0.57029146},"labels":[],"label_agreement":null},{"id":"W4327905048","doi":"10.1016/j.dam.2023.03.019","title":"Separable and equatable hypergraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Technion-Israel Institute of Technology; Israel Science Foundation; University of Toronto","keywords":"Matroid; Hypergraph; Separable space; Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Monotone polygon; Function (biology); Binary number; Multipartite; Computer science; Arithmetic","score_opus":0.025312144205700066,"score_gpt":0.29147204455506776,"score_spread":0.2661599003493677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327905048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036764685,0.00014167248,0.89478314,0.00038094074,0.00008470814,0.000571208,0.00000965427,0.0011137463,0.066150226],"genre_scores_gemma":[0.5552253,0.0002724549,0.4409416,0.000189345,0.000045337092,0.0002680663,0.000018254977,0.00007119298,0.002968413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985873,0.0000138685655,0.00021053453,0.0003579217,0.0003491555,0.00048123003],"domain_scores_gemma":[0.99873966,0.00029236425,0.000060801714,0.000745985,0.000029264458,0.00013193155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383246,0.0001556825,0.00021147661,0.00020403626,0.00019371758,0.00015883922,0.00067350216,0.000050351053,0.000013262532],"category_scores_gemma":[0.00004656948,0.00013414769,0.000040157312,0.0011566249,0.00010879008,0.00024853012,0.00058139354,0.0001375799,0.00041469352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002384822,0.000015857804,0.000012981677,0.00007846822,0.000013597963,0.000007320964,0.000630876,0.000087868335,0.006535828,0.9890392,0.0005691749,0.0030064317],"study_design_scores_gemma":[0.00023570163,0.000021030603,0.000041399915,0.00001706462,0.000005254797,0.000008877454,0.00032025875,0.058983378,0.0042533013,0.93414897,0.0017523722,0.00021240851],"about_ca_topic_score_codex":0.0000015059958,"about_ca_topic_score_gemma":8.807313e-7,"teacher_disagreement_score":0.51846063,"about_ca_system_score_codex":0.000011325072,"about_ca_system_score_gemma":0.000021726291,"threshold_uncertainty_score":0.5470384},"labels":[],"label_agreement":null},{"id":"W4353057842","doi":"10.5206/mase/15775","title":"Minimum Dominating Set for the Prism Graph Family","year":2023,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Combinatorics; Vertex (graph theory); Neighbourhood (mathematics); Mathematics; Domination analysis; Graph; Prism; Maximal independent set; Discrete mathematics; Line graph; Physics; 1-planar graph; Optics","score_opus":0.04418239865493833,"score_gpt":0.29690884563862796,"score_spread":0.2527264469836896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353057842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066045105,0.000104999985,0.9321476,0.00022997266,0.00011110775,0.00037090795,8.7855653e-7,0.00013420862,0.0008551829],"genre_scores_gemma":[0.7091448,0.00004863239,0.29050252,0.00002864548,0.000022461676,0.00020117106,3.1958618e-7,0.000010477545,0.00004098506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898,0.0000051129045,0.000171693,0.00023791508,0.0002412405,0.00036406732],"domain_scores_gemma":[0.99839497,0.0013051894,0.000033622357,0.00021880052,0.0000091288475,0.000038265112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019665086,0.000095741845,0.00011690348,0.00023441596,0.000233914,0.00016692522,0.000743457,0.000027196313,3.4863018e-7],"category_scores_gemma":[0.00010530598,0.00006669307,0.000025520616,0.0013325444,0.000110577086,0.000104258586,0.00025290318,0.000105494524,0.0000036858617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010738065,0.000008576172,0.000013165739,0.00010896311,0.0000052123796,0.0000017077193,0.003098332,0.024587858,0.010167375,0.94967574,0.000056784676,0.01227521],"study_design_scores_gemma":[0.00011675873,0.000013474131,0.00011045302,0.000023429315,0.000001017679,0.0000020009843,0.00076632743,0.8564083,0.00044793836,0.14184666,0.00017555762,0.00008811294],"about_ca_topic_score_codex":8.057372e-7,"about_ca_topic_score_gemma":6.432225e-7,"teacher_disagreement_score":0.8318204,"about_ca_system_score_codex":0.000009925846,"about_ca_system_score_gemma":0.000012618469,"threshold_uncertainty_score":0.27196646},"labels":[],"label_agreement":null},{"id":"W4360975061","doi":"10.1007/s10878-023-01012-x","title":"Fast searching on cactus graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Chordal graph; Combinatorics; Mathematics; Graph; Discrete mathematics","score_opus":0.018589754965846778,"score_gpt":0.2992848647634814,"score_spread":0.28069510979763457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360975061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102008395,0.00002575736,0.9805447,0.0015320223,0.0059502143,0.00016011181,0.0000011861943,0.00013301433,0.0014521702],"genre_scores_gemma":[0.90399975,0.00023031705,0.09475285,0.0001693657,0.00057153025,0.0000057740413,0.000004992005,0.000043052787,0.00022237204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811214,0.00023966293,0.00035078145,0.00015746443,0.00085723377,0.00028271452],"domain_scores_gemma":[0.9984823,0.00035066358,0.00026771214,0.0002795239,0.00042031583,0.00019950235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001266272,0.00010745071,0.00018944993,0.00080353627,0.00017351333,0.00016746808,0.00080821745,0.000059229606,0.000012538219],"category_scores_gemma":[0.0006559665,0.00009394993,0.000113392685,0.0017084766,0.000040694442,0.0008538986,0.0001382467,0.00038041495,0.00003295286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076033,0.0000581988,0.000054244763,0.0000053526064,0.0000192758,0.00005445387,0.00025808156,0.61604977,0.00019424924,0.37763146,0.0010332351,0.0045656497],"study_design_scores_gemma":[0.0022204523,0.0011277464,0.00024600036,0.000085686544,0.000007755711,0.000047470425,0.00006479729,0.3606514,0.0017918708,0.63262767,0.00090466964,0.00022446609],"about_ca_topic_score_codex":0.0000010649592,"about_ca_topic_score_gemma":4.0130566e-8,"teacher_disagreement_score":0.8937989,"about_ca_system_score_codex":0.000074817064,"about_ca_system_score_gemma":0.00015427175,"threshold_uncertainty_score":0.3831167},"labels":[],"label_agreement":null},{"id":"W4361865602","doi":"10.48550/arxiv.2303.17028","title":"On the Complexity of Embedding in Graph Products","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Pathwidth; Tree-depth; Combinatorics; Embedding; Discrete mathematics; Mathematics; Tree decomposition; Partial k-tree; Graph; Computer science; Line graph","score_opus":0.24681553037414253,"score_gpt":0.2605355533776101,"score_spread":0.013720023003467557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361865602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7345323,0.000025680232,0.2613991,0.0011154609,0.000472709,0.00077944406,0.000020861691,0.00024466906,0.0014097794],"genre_scores_gemma":[0.99831295,0.000051135343,0.0009858161,0.00003258797,0.000016747177,0.0000018861978,0.0000037475304,0.000016003296,0.0005791487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785626,0.0004023187,0.00019603723,0.0009898216,0.00017313549,0.00038242617],"domain_scores_gemma":[0.99715984,0.00053982635,0.00019620512,0.001867799,0.00016962163,0.000066725006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009204237,0.00021810869,0.0002939663,0.00064072997,0.00011620914,0.000041864256,0.0030748683,0.0001199426,0.000010369581],"category_scores_gemma":[0.00029887797,0.00019590414,0.0001346822,0.0023169618,0.0006382085,0.00017993104,0.0028987653,0.00087856123,0.00005545477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028098582,0.00005571675,0.000557148,0.00005782148,0.000023590932,0.00010043563,0.00019218482,0.15423559,0.00006865871,0.8445222,0.00009834761,0.00006025598],"study_design_scores_gemma":[0.00015828156,0.000037262897,0.0019843453,0.00013180437,0.000004555301,6.5512455e-7,0.00007424592,0.13048768,0.0006964079,0.8662388,0.000013391583,0.00017260085],"about_ca_topic_score_codex":0.000104561295,"about_ca_topic_score_gemma":0.00005669556,"teacher_disagreement_score":0.26378062,"about_ca_system_score_codex":0.00011556218,"about_ca_system_score_gemma":0.00013539467,"threshold_uncertainty_score":0.7988739},"labels":[],"label_agreement":null},{"id":"W4364374056","doi":"10.48550/arxiv.2101.11168","title":"Using edge cuts to find Euler tours and Euler families in hypergraphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traverse; Hypergraph; Euler's formula; Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence; Geography","score_opus":0.10936681950473502,"score_gpt":0.24257572430812954,"score_spread":0.13320890480339453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364374056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7752597,0.00018079125,0.22289433,0.00007133123,0.00038213877,0.00024572882,0.0000067887204,0.000070655784,0.0008885629],"genre_scores_gemma":[0.9885407,0.0002944245,0.010294386,0.00009378531,0.00003324862,0.0000014071423,0.000004333658,0.000024075362,0.000713632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972817,0.0002754406,0.00020420556,0.0014954108,0.00015512943,0.0005881317],"domain_scores_gemma":[0.99791354,0.0002673723,0.000096614705,0.0012454791,0.0001905491,0.00028644898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003483614,0.00034738643,0.0004213305,0.0010270709,0.00015179274,0.00020417858,0.0015092333,0.0002497946,0.000019857383],"category_scores_gemma":[0.000121067154,0.0004219359,0.00013896915,0.0018391549,0.00019636651,0.0005768169,0.004463065,0.0007505762,0.000016693519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019357735,0.0004002815,0.07749414,0.00034049284,0.000256357,0.0044991956,0.005141942,0.63383836,0.0071106697,0.2627486,0.00022834647,0.0077480273],"study_design_scores_gemma":[0.0031574497,0.0002856574,0.08818571,0.001557543,0.00013172453,0.000090110414,0.0040330556,0.66361177,0.004480469,0.22870496,0.0016288619,0.004132709],"about_ca_topic_score_codex":0.00022498363,"about_ca_topic_score_gemma":0.00016591269,"teacher_disagreement_score":0.21328102,"about_ca_system_score_codex":0.0001919286,"about_ca_system_score_gemma":0.0002392943,"threshold_uncertainty_score":0.9998233},"labels":[],"label_agreement":null},{"id":"W4364380168","doi":"10.48550/arxiv.2304.03857","title":"On the restricted Hanoi Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Digraph; Mathematics; Arc (geometry); Discrete mathematics; Graph; Geometry","score_opus":0.1365597770595831,"score_gpt":0.22598559858804346,"score_spread":0.08942582152846035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364380168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3833008,0.00004473703,0.60491604,0.0016914542,0.0013343527,0.001002795,0.000038762115,0.0015268445,0.006144201],"genre_scores_gemma":[0.99260086,0.0001825946,0.00036535578,0.00016680681,0.000031620544,0.0000039922,0.000008655593,0.000031964075,0.00660813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729913,0.0004595271,0.00016661764,0.0012943017,0.00022809063,0.0005523551],"domain_scores_gemma":[0.9954858,0.0012026614,0.00017046394,0.0027876645,0.00018134808,0.00017208778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046113526,0.00031716534,0.00025161786,0.0006464166,0.0003728497,0.00017130707,0.004879161,0.0002382623,0.000030882886],"category_scores_gemma":[0.00028581655,0.00027197588,0.00026847195,0.0026112052,0.00027793043,0.0002159312,0.0038666483,0.0012913666,0.0006802797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003060244,0.00003783467,0.000187028,0.00001409163,0.00005770232,0.00039200074,0.000066880726,0.048379052,0.000033172168,0.94878644,0.0018450222,0.0001701504],"study_design_scores_gemma":[0.00018797678,0.00006153433,0.0010653618,0.00006363308,0.000012371582,0.000001429116,0.000035675028,0.09046253,0.0001531968,0.907395,0.00027658037,0.00028472365],"about_ca_topic_score_codex":0.00006201543,"about_ca_topic_score_gemma":0.000020203339,"teacher_disagreement_score":0.6093001,"about_ca_system_score_codex":0.00014269493,"about_ca_system_score_gemma":0.00017683739,"threshold_uncertainty_score":0.99997324},"labels":[],"label_agreement":null},{"id":"W4365520282","doi":"10.1016/j.aim.2023.109020","title":"Breaking the degeneracy barrier for coloring graphs with no K minor","year":2023,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Mathematics; Degeneracy (biology); Combinatorics; Minor (academic); Graph; Graph minor; Discrete mathematics; Graph power; Line graph; Humanities","score_opus":0.024666962673488654,"score_gpt":0.32302891935356604,"score_spread":0.29836195668007737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365520282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061033133,0.00070413394,0.9316021,0.00034560403,0.00040332336,0.0012460479,0.000008805431,0.00035697367,0.004299848],"genre_scores_gemma":[0.24002333,0.00046759497,0.7562623,0.00017804124,0.00010331535,0.0009978986,0.0000039347015,0.000066498644,0.0018970974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854344,0.000045707024,0.00025946405,0.00031352686,0.00034375797,0.00049408455],"domain_scores_gemma":[0.99742675,0.0016136732,0.00011211044,0.00066886813,0.00012450207,0.00005411442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008457287,0.00015404423,0.00018950149,0.00019090895,0.00023828744,0.0000944056,0.0011530269,0.000031685995,0.000005345799],"category_scores_gemma":[0.00035325138,0.00009810966,0.000055417393,0.0013085004,0.00014373584,0.00079405156,0.00023519843,0.00015237849,0.000044895824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028354001,0.000050961877,0.00094753626,0.00026094128,0.000018937393,0.000023831228,0.0022261774,0.006928061,0.0005807188,0.96101815,0.00008103335,0.027835285],"study_design_scores_gemma":[0.0005210279,0.000121814686,0.00017348888,0.00015552471,0.0000060241596,0.000019843936,0.0004934314,0.12437644,0.0021378454,0.859914,0.011816462,0.00026408053],"about_ca_topic_score_codex":0.0000010345615,"about_ca_topic_score_gemma":0.00002600997,"teacher_disagreement_score":0.17899019,"about_ca_system_score_codex":0.000030380948,"about_ca_system_score_gemma":0.000037849146,"threshold_uncertainty_score":0.40007958},"labels":[],"label_agreement":null},{"id":"W4366371563","doi":"10.1007/s10107-023-01950-8","title":"Small separations in pinch-graphic matroids","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Corollary; Combinatorics; Graphic matroid; Mathematics; Time complexity; Polynomial; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.06714110996471906,"score_gpt":0.33528556079250055,"score_spread":0.2681444508277815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366371563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07195592,0.000056361732,0.92069244,0.0013204479,0.00007592829,0.0006964932,8.5776657e-7,0.0011351664,0.004066356],"genre_scores_gemma":[0.6661923,0.000008653345,0.33248192,0.0000638895,0.000035580833,0.0004038415,0.000004976399,0.000029506939,0.0007793188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818164,0.000106555104,0.00033344034,0.00038108113,0.00033797152,0.0006593221],"domain_scores_gemma":[0.99873716,0.0004330606,0.000041520685,0.0006050503,0.000045800447,0.00013740345],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010781479,0.00014112087,0.00020402079,0.00049431814,0.00013651876,0.00020677567,0.0008607255,0.00006433125,0.000019428202],"category_scores_gemma":[0.00026316577,0.0001281901,0.000089185174,0.002928265,0.00011859546,0.00028811066,0.0004102645,0.0002025354,0.0008263652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042848706,0.000111149784,0.00026428897,0.00008508744,0.000008012425,0.000065669155,0.00062525505,0.000080477126,0.000298277,0.92644817,0.000053142256,0.07195619],"study_design_scores_gemma":[0.00024974748,0.00010069016,0.00042026505,0.000068839756,0.000002646717,0.000021066255,0.00018971525,0.08549402,0.00024774036,0.91112787,0.0018584138,0.00021897115],"about_ca_topic_score_codex":0.0000022635231,"about_ca_topic_score_gemma":0.00001291344,"teacher_disagreement_score":0.5942364,"about_ca_system_score_codex":0.00003356629,"about_ca_system_score_gemma":0.00003243824,"threshold_uncertainty_score":0.9999516},"labels":[],"label_agreement":null},{"id":"W4366465856","doi":"10.1007/s10107-023-01951-7","title":"Recognizing pinch-graphic matroids","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Graphic matroid; Combinatorics; Matroid partitioning; Mathematics; Pinch; Graph; Binary number; Oriented matroid; Discrete mathematics; Time complexity; Arithmetic; Physics","score_opus":0.04805252912963237,"score_gpt":0.32410374137317893,"score_spread":0.27605121224354656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366465856","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016168987,0.00007834946,0.9742713,0.0011711019,0.00013987003,0.0005142963,7.4028776e-7,0.0024385694,0.005216763],"genre_scores_gemma":[0.4513401,0.000017804783,0.54701185,0.00011652457,0.00009682509,0.00027137026,0.000004972242,0.000058269357,0.0010822702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762523,0.000108628104,0.00034301248,0.00048808876,0.00057348184,0.00086157996],"domain_scores_gemma":[0.9983429,0.00053802493,0.0000628692,0.0007612915,0.000077711265,0.00021724624],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014462908,0.00018322913,0.0002462874,0.0003915933,0.00026105205,0.0003183189,0.0011459929,0.00007529834,0.000039271097],"category_scores_gemma":[0.0005238974,0.0001603625,0.00014326352,0.00259131,0.00015152725,0.00046014585,0.000666323,0.00030446317,0.002040314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035189732,0.00006750219,0.00009171909,0.00014545087,0.000020590465,0.0000748407,0.00055720063,0.00001096462,0.00060649554,0.64268047,0.00018986962,0.3555514],"study_design_scores_gemma":[0.0002286598,0.00009522939,0.00007420874,0.00010164577,0.0000057172365,0.0000449148,0.00023842447,0.042793963,0.0007402882,0.95002913,0.0053528333,0.00029500606],"about_ca_topic_score_codex":9.3141267e-7,"about_ca_topic_score_gemma":6.7332724e-7,"teacher_disagreement_score":0.43517113,"about_ca_system_score_codex":0.000029215533,"about_ca_system_score_gemma":0.00002701507,"threshold_uncertainty_score":0.99873674},"labels":[],"label_agreement":null},{"id":"W4366958223","doi":"10.1007/978-3-031-30448-4_4","title":"Independent Set Under a Change Constraint from an Initial Solution","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Interval graph; Combinatorics; Mathematics; Bipartite graph; Chordal graph; Comparability; Vertex cover; Split graph; Independent set; Discrete mathematics; Maximal independent set; Vertex (graph theory); Bounded function; Time complexity; Indifference graph; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.09432143081044465,"score_gpt":0.3439484019149341,"score_spread":0.24962697110448945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366958223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002644346,0.0001271806,0.9943957,0.0011546767,0.0022699207,0.00064070435,0.00006810812,0.0004284506,0.0006508598],"genre_scores_gemma":[0.7317886,0.00009724365,0.26013517,0.0047785095,0.002459998,0.000106132684,0.00012883492,0.00016207439,0.0003434449],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942841,0.00013252748,0.00051614444,0.0021987932,0.001812593,0.001055877],"domain_scores_gemma":[0.9964812,0.0007409863,0.00024981538,0.0018693793,0.00029131531,0.00036734724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014035531,0.00058627024,0.00053860724,0.0013240289,0.00037008937,0.00065282884,0.004386795,0.0004814297,0.000049820897],"category_scores_gemma":[0.00009111217,0.0005719323,0.00014003062,0.0009264363,0.0015229958,0.0014351213,0.00264429,0.0014431981,0.0001906195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024155077,0.000053872034,0.00004161853,0.000022278235,0.000029877177,0.00046958696,0.0025891417,0.008883812,0.0003688136,0.18224105,0.000010531315,0.80526525],"study_design_scores_gemma":[0.00031183884,0.0002219152,0.00034331743,0.00020854265,0.000005130091,0.000044929267,0.0000011155606,0.26606694,0.0005202666,0.7315509,0.00012313286,0.0006020194],"about_ca_topic_score_codex":0.00015806874,"about_ca_topic_score_gemma":0.0006172248,"teacher_disagreement_score":0.80466324,"about_ca_system_score_codex":0.0004424262,"about_ca_system_score_gemma":0.000648539,"threshold_uncertainty_score":0.9996732},"labels":[],"label_agreement":null},{"id":"W4366999929","doi":"10.48550/arxiv.2304.11795","title":"Fractional eternal domination: securely distributing resources across a network","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Université de Montréal; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Mathematics; Cayley graph; Chordal graph; Graph; Order (exchange); Abelian group; Discrete mathematics","score_opus":0.09792242774839244,"score_gpt":0.2528480175974495,"score_spread":0.15492558984905708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366999929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2267217,0.000053135125,0.77099997,0.00021728016,0.0008367062,0.00021330694,0.000067903755,0.00044920327,0.00044077903],"genre_scores_gemma":[0.99426454,0.000068242836,0.0020664,0.00004599043,0.0004417277,0.000003052504,0.00004235987,0.00002865556,0.0030390099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970109,0.0003034234,0.00025469964,0.0013336886,0.00029039473,0.0008068914],"domain_scores_gemma":[0.9973661,0.0006602361,0.0003469775,0.001112412,0.00029380133,0.00022048183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010450988,0.00031792515,0.0003118407,0.00017342203,0.00068514195,0.00034323896,0.002718891,0.00030536234,0.000026037222],"category_scores_gemma":[0.00016163167,0.0003791723,0.00027193292,0.0013480601,0.00023786258,0.0005401913,0.005188685,0.0013380381,0.00019975626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100848476,0.000046931524,0.008350179,0.000053915235,0.00013208862,0.00079335226,0.00048422566,0.69606316,0.000011695709,0.2923882,0.00071792386,0.00085749157],"study_design_scores_gemma":[0.0005631074,0.000049320235,0.010685392,0.00018004182,0.00002009951,0.000017632276,0.00016846943,0.4376459,0.00004745243,0.5465339,0.0035122323,0.0005764518],"about_ca_topic_score_codex":0.00006522001,"about_ca_topic_score_gemma":0.000047653462,"teacher_disagreement_score":0.7689336,"about_ca_system_score_codex":0.00031266158,"about_ca_system_score_gemma":0.00013896755,"threshold_uncertainty_score":0.999866},"labels":[],"label_agreement":null},{"id":"W4367046853","doi":"10.1016/j.disc.2023.113419","title":"A cop-winning strategy on strongly cop-win graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Monotonic function; Graph; Generalization; Discrete mathematics","score_opus":0.04702494367628042,"score_gpt":0.3317302440295708,"score_spread":0.2847053003532904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367046853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3172061,0.000119826036,0.6292714,0.0011085774,0.00047592213,0.0012148474,0.000061368664,0.0024631855,0.048078783],"genre_scores_gemma":[0.9592884,0.000029798237,0.03814697,0.000104547384,0.000054832366,0.00008866994,0.000022402697,0.00006877404,0.002195583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974679,0.00010818646,0.00039085315,0.0005001527,0.0007907484,0.00074219325],"domain_scores_gemma":[0.9978641,0.00055649865,0.00013765368,0.0011599907,0.00008981848,0.00019191914],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008077209,0.00027109866,0.00031491945,0.0004050099,0.0002512976,0.00028350356,0.0014005138,0.0000818206,0.00004535909],"category_scores_gemma":[0.00019719586,0.00023144213,0.00014655672,0.0017055135,0.00014688775,0.00038843314,0.00043576493,0.0003496889,0.00092264946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000874166,0.00005662756,0.000071699826,0.000089886234,0.00003450638,0.000077927485,0.0014168646,0.0023211115,0.0006842342,0.99055743,0.0011862366,0.0034947605],"study_design_scores_gemma":[0.0006073075,0.00039465877,0.00045775445,0.00019611136,0.000010530475,0.000018161549,0.0013972159,0.21456794,0.0022204989,0.7789626,0.0006580053,0.0005091897],"about_ca_topic_score_codex":0.0000027560654,"about_ca_topic_score_gemma":0.0000023616576,"teacher_disagreement_score":0.64208233,"about_ca_system_score_codex":0.000043120093,"about_ca_system_score_gemma":0.0000647233,"threshold_uncertainty_score":0.9998552},"labels":[],"label_agreement":null},{"id":"W4367050287","doi":"10.1007/s10107-023-01944-6","title":"Recognizing even-cycle and even-cut matroids","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Matroid partitioning; Graphic matroid; Combinatorics; Mathematics; Oriented matroid; Weighted matroid; Binary number; Discrete mathematics; Time complexity; Polynomial; Arithmetic","score_opus":0.03575428695673117,"score_gpt":0.3188795183276457,"score_spread":0.28312523137091455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367050287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10626368,0.00017008958,0.8865277,0.0016724975,0.00012887496,0.0007178944,0.0000015200263,0.0016486777,0.0028690433],"genre_scores_gemma":[0.6118643,0.000021090162,0.3866851,0.00008159393,0.000075620475,0.00017739518,0.0000029433947,0.000049137507,0.0010428061],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979494,0.00010546174,0.00030097849,0.00047639225,0.00044868252,0.0007190368],"domain_scores_gemma":[0.99853605,0.00059162616,0.000057215264,0.0005342938,0.00005820114,0.00022258477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013045118,0.0001724741,0.00024382782,0.00021026637,0.00025409978,0.00029889963,0.00063949905,0.000071445735,0.000023646038],"category_scores_gemma":[0.0005298062,0.00015264182,0.00007474821,0.0011098182,0.00015097471,0.00045571872,0.00073829177,0.00025897557,0.00066277356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006741407,0.000077366225,0.00013633723,0.00024604585,0.000025057741,0.00007623035,0.0012366105,0.000013523708,0.0007424266,0.39062497,0.00012576337,0.6066889],"study_design_scores_gemma":[0.0002782712,0.000103574275,0.00013828129,0.00012257708,0.0000067471324,0.000071463284,0.00025183547,0.069036424,0.00066324265,0.9260599,0.0029917122,0.0002759497],"about_ca_topic_score_codex":0.0000016133538,"about_ca_topic_score_gemma":0.0000012161846,"teacher_disagreement_score":0.60641295,"about_ca_system_score_codex":0.000028821805,"about_ca_system_score_gemma":0.000023060033,"threshold_uncertainty_score":0.8518834},"labels":[],"label_agreement":null},{"id":"W4367317590","doi":"10.18280/mmep.100222","title":"Power Domination in Different Graphs with Applications","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Power (physics); Computer science; Mathematics; Physics","score_opus":0.01965937566093939,"score_gpt":0.23895016890802862,"score_spread":0.21929079324708922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367317590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03696718,0.000034498327,0.96215296,0.00018282267,0.000008474582,0.00023151572,3.809204e-7,0.00024549323,0.00017667623],"genre_scores_gemma":[0.9275252,0.000026900958,0.07208709,0.0000047409517,0.00000445639,0.0002727334,0.0000012545311,0.000013954385,0.000063655454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923956,0.000009465114,0.00013771176,0.00021358991,0.00016295543,0.00023669847],"domain_scores_gemma":[0.999527,0.00015836507,0.000014914634,0.00021410723,0.00002026163,0.00006538815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023811831,0.000099466415,0.00012241078,0.00023852513,0.00004041748,0.000058718746,0.00018178049,0.000031552467,0.0000014581817],"category_scores_gemma":[0.0000089494015,0.00007315001,0.000016756812,0.00059502217,0.000022536355,0.00012713247,0.00006666761,0.00012821864,0.0000134997845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010169043,0.000020441488,0.000010201825,0.00009422619,0.000003318832,0.0000014006869,0.000345712,0.5003555,0.00014882283,0.49862957,0.0000011484593,0.00038870066],"study_design_scores_gemma":[0.00009740126,0.000018271936,0.00003448119,0.000054027343,7.465212e-7,0.0000032176672,0.000006302465,0.69710684,0.000053062377,0.30250648,0.00004854969,0.00007061221],"about_ca_topic_score_codex":5.5323244e-7,"about_ca_topic_score_gemma":1.7327886e-7,"teacher_disagreement_score":0.890558,"about_ca_system_score_codex":0.000012792,"about_ca_system_score_gemma":0.0000037962159,"threshold_uncertainty_score":0.2982971},"labels":[],"label_agreement":null},{"id":"W4367848794","doi":"10.1007/s44007-023-00044-3","title":"Eternal Distance-k Domination on Graphs","year":2023,"lang":"en","type":"article","venue":"La Matematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; Université du Québec à Montréal; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; Mount Allison University; Mount Saint Vincent University; Université du Québec à Montréal","keywords":"Combinatorics; Vertex (graph theory); Domination analysis; Mathematics; Dominating set; Graph; Guard (computer science); Sequence (biology); Discrete mathematics; Computer science","score_opus":0.0210567289810974,"score_gpt":0.31274645861037026,"score_spread":0.29168972962927286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367848794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09973371,0.000026784215,0.82422245,0.002460338,0.00047603968,0.000605154,0.000011106795,0.0013931319,0.07107131],"genre_scores_gemma":[0.98905617,0.000014652213,0.0088412305,0.000084946994,0.000015174848,0.000064587046,0.0000035301775,0.000012855837,0.0019068692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987501,0.00015339072,0.00016736204,0.00023652049,0.00043001457,0.00026261804],"domain_scores_gemma":[0.9988474,0.0004836352,0.000050755996,0.0005096044,0.00004046315,0.00006809301],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066581625,0.000090540896,0.000119280645,0.00021512299,0.00009927416,0.00014409015,0.0006629237,0.000033519987,0.00002686082],"category_scores_gemma":[0.00013285122,0.0000739028,0.00005051813,0.00082255446,0.00006119513,0.0002770285,0.00014906208,0.00011503132,0.0012104883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072269054,0.000019453377,0.00005146954,0.00007031266,0.0000061446294,0.000038015907,0.00022737471,0.00004914488,0.0003706,0.9941857,0.00062023057,0.0043543642],"study_design_scores_gemma":[0.00022978219,0.000057148012,0.0026454339,0.00011049629,0.0000017346041,0.000008763216,0.00002955994,0.025635963,0.002262325,0.9672666,0.0016224829,0.00012967199],"about_ca_topic_score_codex":6.553305e-7,"about_ca_topic_score_gemma":7.0648866e-7,"teacher_disagreement_score":0.88932246,"about_ca_system_score_codex":0.000019268507,"about_ca_system_score_gemma":0.000011515373,"threshold_uncertainty_score":0.9995672},"labels":[],"label_agreement":null},{"id":"W4368372142","doi":"10.1016/j.disc.2023.113473","title":"Metric hypergraphs and metric-line equivalences","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; HORIZON EUROPE Framework Programme; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Mathematics; Metric space; Combinatorics; Real line; Metric (unit); Equivalence (formal languages); Equivalence relation; Line (geometry); Intrinsic metric; Injective metric space; Discrete mathematics; Geometry","score_opus":0.04917666888456311,"score_gpt":0.3371808582659878,"score_spread":0.2880041893814247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368372142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1037268,0.0013866418,0.8848723,0.0010643117,0.0002492062,0.00048066158,0.000017789223,0.0009499878,0.0072523043],"genre_scores_gemma":[0.848264,0.0006983027,0.14922342,0.00006710361,0.000043337415,0.00004521039,0.0000053738086,0.00003205982,0.0016212421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981793,0.00006840894,0.00029290063,0.0003808574,0.0006130906,0.00046540998],"domain_scores_gemma":[0.99806875,0.00091590645,0.00009653848,0.00067905086,0.000082923085,0.00015686057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010321643,0.00017350791,0.00026072454,0.0010821134,0.00017526945,0.00019112042,0.0009971911,0.000052732667,0.000015480218],"category_scores_gemma":[0.0007284568,0.00013473126,0.000081670005,0.0061498624,0.00014678141,0.00041050444,0.00072191434,0.00015453105,0.0001710238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034937975,0.000052126394,0.0004516225,0.0002349043,0.000054786186,0.000047547044,0.0013113165,0.00015008458,0.00070246705,0.972239,0.00036444992,0.02438819],"study_design_scores_gemma":[0.00030271415,0.00015772667,0.0005753396,0.000054648746,0.000016427804,0.00002835546,0.0005743937,0.16296402,0.0021710598,0.8321749,0.00064688793,0.0003335346],"about_ca_topic_score_codex":0.0000026013333,"about_ca_topic_score_gemma":0.00000109849,"teacher_disagreement_score":0.7445372,"about_ca_system_score_codex":0.000014208253,"about_ca_system_score_gemma":0.000022406124,"threshold_uncertainty_score":0.54941815},"labels":[],"label_agreement":null},{"id":"W4372233695","doi":"10.1016/j.tcs.2023.113936","title":"A refinement on the structure of vertex-critical (P5, gem)-free graphs","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; The King's University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Induced subgraph; Mathematics; Discrete mathematics; Chordal graph; Computer science; Graph","score_opus":0.019315533797664167,"score_gpt":0.3026259989599015,"score_spread":0.28331046516223735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372233695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22223455,0.000028044737,0.7542048,0.018020134,0.0012259114,0.00052860525,0.000025970938,0.0005180755,0.0032139244],"genre_scores_gemma":[0.9727681,0.0000059490153,0.026384737,0.0007719176,0.000038416896,0.0000069436414,7.21862e-7,0.0000115543435,0.000011642023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956943,0.00030332006,0.0003468761,0.0008566383,0.0018564491,0.000942458],"domain_scores_gemma":[0.9943112,0.0024499306,0.000058462254,0.002590075,0.00031140907,0.0002788869],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021633508,0.00022908466,0.00025301563,0.0004645176,0.00059198163,0.00024204711,0.007420274,0.00005986494,0.000103561135],"category_scores_gemma":[0.0013282662,0.00014236217,0.00011471908,0.004615312,0.007210686,0.0003630575,0.003391585,0.00044358923,0.000106005136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019751518,0.000041306026,0.00001766284,0.000011039447,0.0000055772894,0.000017401537,0.00025567354,0.00015990374,0.004866818,0.9847247,0.00043044487,0.009449731],"study_design_scores_gemma":[0.00017876731,0.00036676868,0.0006084972,0.000040128987,0.0000026098471,0.000012505375,0.000013007028,0.12556691,0.017651752,0.85533446,0.000068755064,0.00015585791],"about_ca_topic_score_codex":0.0000016938002,"about_ca_topic_score_gemma":7.63206e-7,"teacher_disagreement_score":0.7505336,"about_ca_system_score_codex":0.000043918553,"about_ca_system_score_gemma":0.00012774488,"threshold_uncertainty_score":0.9979501},"labels":[],"label_agreement":null},{"id":"W4376618462","doi":"10.1007/s00373-023-02644-w","title":"On Reconfiguration Graphs of Independent Sets Under Token Sliding","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Control reconfiguration; Bipartite graph; Discrete mathematics; Graph; Computer science","score_opus":0.03079598120794812,"score_gpt":0.2877690375327042,"score_spread":0.2569730563247561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376618462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844149,0.00017259507,0.011212539,0.00034893566,0.0006361224,0.00025484205,0.000005363371,0.00026283885,0.0026919015],"genre_scores_gemma":[0.99932855,0.00027467427,0.00015832072,0.00006298434,0.0000023954988,0.000016784987,0.000006089607,0.000010618551,0.0001395685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986059,0.000091439026,0.00021461333,0.00034213817,0.00044811296,0.0002977926],"domain_scores_gemma":[0.99901944,0.0002590122,0.00009187253,0.00042237545,0.00010071617,0.000106568514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053468836,0.0001310394,0.0001682606,0.0005559594,0.00017848458,0.00007275835,0.00044925147,0.0000772919,0.0000046197583],"category_scores_gemma":[0.000043045246,0.00012371314,0.0000685478,0.0018915696,0.000050820243,0.00028995745,0.00017456974,0.0001944498,0.0000109053635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009407332,0.000040235864,0.000872061,0.00001761884,0.000015335916,0.000008075219,0.00020894775,0.000071715556,0.0006708399,0.9926799,0.00023360403,0.0051722745],"study_design_scores_gemma":[0.00038605722,0.00021591013,0.007018832,0.000022630982,0.0000029911937,0.0000044071808,0.00010975115,0.0026744613,0.0029307455,0.98641247,0.00008553313,0.00013620354],"about_ca_topic_score_codex":0.000006934344,"about_ca_topic_score_gemma":0.000001910601,"teacher_disagreement_score":0.014913701,"about_ca_system_score_codex":0.000021215983,"about_ca_system_score_gemma":0.000028531982,"threshold_uncertainty_score":0.5044875},"labels":[],"label_agreement":null},{"id":"W4377200039","doi":"10.1007/978-3-031-32726-1_29","title":"Cut-Sufficient Directed 2-Commodity Multiflow Topologies","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Network topology; Path (computing); Computer science; Directed graph; Topology (electrical circuits); Graph; Path length; Mathematics; Mathematical optimization; Combinatorics; Computer network","score_opus":0.03793505711548806,"score_gpt":0.3009265805198412,"score_spread":0.26299152340435317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023951777,0.00023058499,0.990305,0.001042604,0.0031628662,0.00060589536,0.000022505457,0.0015416587,0.0028493386],"genre_scores_gemma":[0.17776838,0.0003032324,0.8130048,0.0015615288,0.0009560025,0.00009223715,0.000035557467,0.00021296575,0.0060653025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99357,0.000120762044,0.0006389847,0.0024479395,0.0018176957,0.0014045854],"domain_scores_gemma":[0.99423444,0.0019448128,0.00028012268,0.0027925633,0.00045756684,0.0002905016],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017801002,0.00073037203,0.00075404695,0.0016921464,0.0005560766,0.0006358276,0.0072788023,0.0004353163,0.000027648766],"category_scores_gemma":[0.0006572328,0.0006541649,0.00023247059,0.0020046816,0.0021559338,0.0006780181,0.0048682215,0.0016381701,0.0002983066],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022338474,0.00009455632,0.000113833376,0.00007002219,0.00003051969,0.00048048387,0.0012144701,0.06803031,0.00029970345,0.15674378,0.00014537733,0.7727546],"study_design_scores_gemma":[0.00026965525,0.00019728848,0.00029585965,0.00024243814,0.0000048668016,0.000040607018,5.0551483e-7,0.51558155,0.002364791,0.4788673,0.0012724409,0.00086270546],"about_ca_topic_score_codex":0.000028823211,"about_ca_topic_score_gemma":0.00019368643,"teacher_disagreement_score":0.7718919,"about_ca_system_score_codex":0.00051021355,"about_ca_system_score_gemma":0.00060635793,"threshold_uncertainty_score":0.99959093},"labels":[],"label_agreement":null},{"id":"W4377822168","doi":"10.1142/s1793830923500568","title":"A constructive proof of the Fulkerson–Ryser characterization of digraphic sequences","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Digraph; Constructive; Vertex (graph theory); Combinatorics; Mathematics; Constructive proof; Characterization (materials science); Inequality; Graph; Discrete mathematics; Computer science; Physics; Process (computing)","score_opus":0.018277324969393504,"score_gpt":0.2813524692736935,"score_spread":0.2630751443043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377822168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088947885,0.000027211634,0.9092399,0.00039350727,0.000028821212,0.0008333319,0.000095706244,0.000048408245,0.00038524106],"genre_scores_gemma":[0.9589267,0.000068649126,0.04031812,0.000014307343,0.000027368233,0.0004498245,0.000017299866,0.000013768844,0.0001640028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917877,0.000028358572,0.0002403473,0.00018341735,0.00023929996,0.00012980805],"domain_scores_gemma":[0.9990498,0.000117562064,0.00021808075,0.00044731417,0.00013187643,0.00003541033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292082,0.000081941456,0.00014670283,0.000109133536,0.0001292023,0.00002805073,0.00048487986,0.000030343192,0.0000021940552],"category_scores_gemma":[0.000023851004,0.000055989458,0.00005311225,0.0013013078,0.00037323008,0.00015564404,0.00020919107,0.000067385976,0.000001432744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.543393e-7,0.000038581078,0.00027180798,0.00014159559,0.000027379416,1.7408193e-7,0.0014990126,0.00002169231,0.025935614,0.9570908,0.0000027159508,0.014969652],"study_design_scores_gemma":[0.00022992986,0.000050104903,0.0049545905,0.00011444233,0.000021747734,0.000011531495,0.00097340276,0.13144234,0.058722533,0.80297124,0.00031340055,0.00019471052],"about_ca_topic_score_codex":0.000002337855,"about_ca_topic_score_gemma":7.873605e-7,"teacher_disagreement_score":0.8699788,"about_ca_system_score_codex":0.000004761664,"about_ca_system_score_gemma":0.00003360879,"threshold_uncertainty_score":0.22831838},"labels":[],"label_agreement":null},{"id":"W4378611059","doi":"10.9734/bpi/ratmcs/v1/5816e","title":"On the DAG Decomposition into Minimum Number of Chains","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Disjoint sets; Node (physics); Path (computing); Directed acyclic graph; Mathematics; Time complexity; Bounded function; Discrete mathematics; Decomposition; Computer science; Computer network; Chemistry; Physics","score_opus":0.034842895703856396,"score_gpt":0.33279935747495826,"score_spread":0.29795646177110185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378611059","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013939812,0.000015484417,0.16097276,0.0014897961,0.00027189823,0.00032500285,0.000006780844,0.00018516187,0.8365937],"genre_scores_gemma":[0.012491168,0.00007014486,0.0076330556,0.0004802131,0.00008155509,0.000026638021,0.000012873743,0.00006174626,0.9791426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841434,0.000051650666,0.00026073313,0.00044137912,0.0006006344,0.00023128759],"domain_scores_gemma":[0.99755883,0.0009909208,0.00013307907,0.0011483841,0.000100017445,0.00006874019],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044514897,0.00021930542,0.00023565374,0.00018505166,0.00011794416,0.000046830894,0.001465605,0.000150736,0.00034365285],"category_scores_gemma":[0.00004315689,0.00014808793,0.00016224862,0.00013259209,0.00019085761,0.00011173219,0.00057328783,0.0003833376,0.0016544939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010552393,0.000010401702,0.0000012788496,0.000012744796,0.000031297528,0.000011973042,0.00012666069,0.0000121190305,0.00009669985,0.99288225,0.0020214324,0.00478259],"study_design_scores_gemma":[0.00008615091,0.00007704389,0.0000070522383,0.000104693856,0.000003806413,0.000005654676,0.0000079155125,0.001972491,0.0004934333,0.99317014,0.0039004823,0.00017113054],"about_ca_topic_score_codex":0.000008033112,"about_ca_topic_score_gemma":0.00001800147,"teacher_disagreement_score":0.15333971,"about_ca_system_score_codex":0.000048777296,"about_ca_system_score_gemma":0.000054349202,"threshold_uncertainty_score":0.99912286},"labels":[],"label_agreement":null},{"id":"W4379251988","doi":"10.48550/arxiv.2306.00220","title":"Graphs with Large Girth and Small Cop Number","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Girth (graph theory); Conjecture; Mathematics; Exponent; Degree (music); Upper and lower bounds; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.089286639939253,"score_gpt":0.21654945631519476,"score_spread":0.12726281637594178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379251988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4001611,0.000036369212,0.5966353,0.00010534212,0.00019812476,0.0003491895,0.000032166405,0.00050899177,0.0019734297],"genre_scores_gemma":[0.9894796,0.00031040094,0.0040937453,0.00006428924,0.000022559609,0.000002472,0.000012518915,0.00003884224,0.005975582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975001,0.00019005398,0.00013512696,0.0014131055,0.00014036636,0.0006212247],"domain_scores_gemma":[0.997749,0.00022285595,0.00013922439,0.0014247698,0.00018724425,0.00027692097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042006967,0.00033550494,0.00033221132,0.00034864337,0.00023667557,0.00015032657,0.0017762358,0.00021270735,0.00002484816],"category_scores_gemma":[0.000031221654,0.00034023647,0.000114092574,0.0012428145,0.00026962016,0.00032389554,0.0036717532,0.00080917537,0.00019296372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007501439,0.0000683516,0.040674433,0.00010286568,0.00012947618,0.0012193542,0.00022517514,0.007604635,0.000009325078,0.9494564,0.00016920536,0.00026577534],"study_design_scores_gemma":[0.0014641903,0.0001359468,0.0104175145,0.00019655448,0.000056724457,0.000032486685,0.00018619225,0.090054,0.000104424,0.89506984,0.0013085537,0.0009735659],"about_ca_topic_score_codex":0.00007625907,"about_ca_topic_score_gemma":0.00020297423,"teacher_disagreement_score":0.5925416,"about_ca_system_score_codex":0.000073019284,"about_ca_system_score_gemma":0.00015039535,"threshold_uncertainty_score":0.999905},"labels":[],"label_agreement":null},{"id":"W4380186075","doi":"10.48550/arxiv.2306.04710","title":"On heroes in digraphs with forbidden induced forests","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Government of Ontario","keywords":"Combinatorics; Transitive relation; Tournament; Digraph; Mathematics; Degree (music); Bounded function; Class (philosophy); HERO; Discrete mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.12366488989010033,"score_gpt":0.23423496352129694,"score_spread":0.11057007363119661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380186075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8592182,0.000009304976,0.13863993,0.000103228165,0.00019965935,0.0004831684,0.0000073619676,0.0003555687,0.0009836239],"genre_scores_gemma":[0.9979838,0.00004151839,0.0005913352,0.000033534747,0.000020368843,0.0000058343567,0.000007650149,0.000038629067,0.0012772903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738795,0.0001984315,0.00017382593,0.0014097521,0.0002124434,0.0006176193],"domain_scores_gemma":[0.9974669,0.00038775674,0.00014990463,0.001696341,0.0001123572,0.00018672766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003613915,0.00035275333,0.0003530921,0.0011390811,0.00011540607,0.00011248675,0.0026739375,0.0002534789,0.000007174608],"category_scores_gemma":[0.00006924186,0.00034738728,0.00014057494,0.002070859,0.00014326614,0.00041401695,0.0020417718,0.0010824322,0.00012755446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022031636,0.00013215044,0.028569503,0.00007245743,0.0000850887,0.0021932602,0.00038019946,0.16527678,0.000033185832,0.80230474,0.000084051455,0.0006482883],"study_design_scores_gemma":[0.00093508913,0.0003238808,0.023734719,0.00032701672,0.000011697393,0.0000035079968,0.00013190016,0.0665614,0.00025593519,0.90711725,0.00002305897,0.0005745226],"about_ca_topic_score_codex":0.00019878284,"about_ca_topic_score_gemma":0.0017518757,"teacher_disagreement_score":0.13876568,"about_ca_system_score_codex":0.00020773504,"about_ca_system_score_gemma":0.00019793319,"threshold_uncertainty_score":0.99989784},"labels":[],"label_agreement":null},{"id":"W4380551832","doi":"10.48550/arxiv.2306.06449","title":"List homomorphisms to separable signed graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Horizon 2020 Framework Programme; Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura, Univerzita Karlova; European Commission; Univerzita Karlova v Praze","keywords":"Signed graph; Separable space; Homomorphism; Conjecture; Focus (optics); Combinatorics; Mathematics; Discrete mathematics; Chordal graph; Indifference graph; Class (philosophy); Computer science; Graph; Artificial intelligence","score_opus":0.11939388513340575,"score_gpt":0.23558697130494538,"score_spread":0.11619308617153963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380551832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13007689,0.000048981252,0.86288846,0.00038411046,0.0010296556,0.0008168894,0.00005284853,0.0012823398,0.003419822],"genre_scores_gemma":[0.9776861,0.00009599943,0.004384995,0.0001782724,0.000049383234,0.000007458022,0.000019653775,0.00005555394,0.01752255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639565,0.0002780105,0.00024495152,0.0019688888,0.00025035127,0.00086216076],"domain_scores_gemma":[0.99600697,0.000320333,0.00016284182,0.0026783668,0.00029228025,0.00053920946],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006359261,0.00043818227,0.0004709079,0.0010942292,0.00033056576,0.00024594364,0.004783911,0.00029880047,0.00005879003],"category_scores_gemma":[0.000116317024,0.00053188956,0.00033101186,0.0031762319,0.000211029,0.0004611938,0.0060095447,0.0008513702,0.0013692925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056147444,0.00007659653,0.0005251521,0.00005688004,0.00009130996,0.0011826702,0.00018520489,0.13967387,0.000350968,0.8553522,0.002148554,0.0003004013],"study_design_scores_gemma":[0.00036818118,0.00012217382,0.0004278511,0.00010157741,0.00002570861,0.0000049071423,0.000057596808,0.07396494,0.0005837377,0.92239076,0.0012272219,0.0007253411],"about_ca_topic_score_codex":0.00020619029,"about_ca_topic_score_gemma":0.00007549342,"teacher_disagreement_score":0.85850346,"about_ca_system_score_codex":0.00025196583,"about_ca_system_score_gemma":0.0002394066,"threshold_uncertainty_score":0.99971324},"labels":[],"label_agreement":null},{"id":"W4380563556","doi":"10.1109/focs57990.2023.00116","title":"Proof of the Clustered Hadwiger Conjecture","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Conjecture; Computer science; Mathematics; Combinatorics","score_opus":0.05355433327769208,"score_gpt":0.3220586471461332,"score_spread":0.2685043138684411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380563556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003808421,0.00013254817,0.9790288,0.0071582953,0.0017295765,0.0013476965,0.000020733063,0.00034890504,0.00642502],"genre_scores_gemma":[0.918946,0.00001725289,0.038140327,0.00044357026,0.00012413801,0.00017449641,0.000006161758,0.000059855873,0.042088173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980485,0.0002133003,0.00027541383,0.00058066,0.0005792203,0.00030294675],"domain_scores_gemma":[0.99692684,0.00021989038,0.00017374248,0.002464518,0.00015865498,0.000056375644],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00053226843,0.00018881792,0.00026605205,0.00013916667,0.000072645096,0.00008111126,0.0042121853,0.00019603004,0.000033191875],"category_scores_gemma":[0.00015662116,0.0001116199,0.00021693618,0.0005261522,0.00019116099,0.000081334954,0.008902902,0.00078611827,0.000028703784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042386266,0.00017786659,0.0016357992,0.0009812003,0.00033312608,0.000039242877,0.002755084,0.040455993,0.0014789016,0.89384514,0.018329538,0.0399257],"study_design_scores_gemma":[0.00021433862,0.000037656882,0.0012861955,0.00016291297,0.0000065157105,0.0000062508157,0.00002644721,0.026833823,0.032477107,0.9372391,0.0014418992,0.00026776735],"about_ca_topic_score_codex":0.000028234424,"about_ca_topic_score_gemma":0.000042448763,"teacher_disagreement_score":0.94088846,"about_ca_system_score_codex":0.00003521172,"about_ca_system_score_gemma":0.00024364343,"threshold_uncertainty_score":0.9991129},"labels":[],"label_agreement":null},{"id":"W4380629273","doi":"10.1007/s00493-023-00024-9","title":"An Improved Bound for the Linear Arboricity Conjecture","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Conjecture; Mathematics; Combinatorics","score_opus":0.028501187315718303,"score_gpt":0.33020969997860394,"score_spread":0.3017085126628856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380629273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030643314,0.0004584038,0.95955473,0.004395237,0.0020056681,0.0012938626,0.000013982647,0.0012286294,0.00040619491],"genre_scores_gemma":[0.9958953,0.000043715598,0.002932208,0.00022133888,0.0001094284,0.0001941779,0.0000053496797,0.00002329483,0.0005751561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986487,0.00009058371,0.00013888256,0.0003999512,0.00024808463,0.0004737652],"domain_scores_gemma":[0.9976517,0.0008980173,0.000052911564,0.0011183859,0.000153306,0.00012567487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069376023,0.00013138434,0.0001411726,0.000103560385,0.0005314302,0.00014788467,0.0018904249,0.00006673247,0.0000043752507],"category_scores_gemma":[0.00022869687,0.000091287984,0.00008283336,0.0014482851,0.00010163127,0.00029196983,0.0002781736,0.00023941444,0.000048811566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002878985,0.00010734138,0.00015422323,0.00002177834,0.000032319633,0.000010501684,0.00043561985,0.00020123195,0.0031768763,0.97209555,0.0038388583,0.0198969],"study_design_scores_gemma":[0.0006540589,0.0004340695,0.00090054626,0.0000035102375,0.0000059131357,0.0000034107518,0.000041327017,0.33782017,0.0034796596,0.61578566,0.04066979,0.00020191705],"about_ca_topic_score_codex":0.000008093538,"about_ca_topic_score_gemma":0.0000016865894,"teacher_disagreement_score":0.96525204,"about_ca_system_score_codex":0.00005110918,"about_ca_system_score_gemma":0.00008405125,"threshold_uncertainty_score":0.4087385},"labels":[],"label_agreement":null},{"id":"W4380876845","doi":"10.5817/cz.muni.eurocomb23-042","title":"Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Institute for Basic Science; Agence Nationale de la Recherche; European Commission","keywords":"Combinatorics; Conjecture; Mathematics; Clique number; Vertex (graph theory); Graph; Omega; Digraph; Clique; Discrete mathematics; Physics","score_opus":0.0287188648968487,"score_gpt":0.3202329579205905,"score_spread":0.29151409302374176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380876845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13748881,0.000027505725,0.8560021,0.001447584,0.0002739564,0.001127626,0.000045885143,0.0003299875,0.003256561],"genre_scores_gemma":[0.9770544,0.0000019890285,0.021260124,0.000040709398,0.000010857331,0.000056875568,0.0000045870297,0.0000067233764,0.001563697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992332,0.000064087006,0.00015626407,0.00016924972,0.00020460345,0.00017262742],"domain_scores_gemma":[0.9988224,0.00046403488,0.00007129838,0.00042412704,0.00019113452,0.000026986407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026435335,0.000055652454,0.00010377043,0.00012775467,0.00008548346,0.000012636096,0.0006348398,0.00002608683,0.000009541519],"category_scores_gemma":[0.00028071506,0.000034409677,0.00007632342,0.00171776,0.00010399513,0.00012531926,0.00021891083,0.00006132521,0.0000033593813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019096773,0.00005201751,0.0043227365,0.000087673056,0.000046833084,0.0000010709261,0.0016760097,0.0014399105,0.031245792,0.9507409,0.0017910256,0.008576969],"study_design_scores_gemma":[0.0015110489,0.00035128617,0.052497778,0.00009021543,0.000023891447,0.000006482504,0.00068849034,0.19178276,0.3906622,0.35854074,0.0034955705,0.0003495336],"about_ca_topic_score_codex":0.000023579403,"about_ca_topic_score_gemma":0.00006665571,"teacher_disagreement_score":0.83956563,"about_ca_system_score_codex":0.000009763037,"about_ca_system_score_gemma":0.00007883353,"threshold_uncertainty_score":0.14031859},"labels":[],"label_agreement":null},{"id":"W4380876964","doi":"10.5817/cz.muni.eurocomb23-058","title":"Cop number of random k-uniform hypergraphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Hypergraph; Combinatorics; Conjecture; Random graph; Mathematics; Social connectedness; Zigzag; Upper and lower bounds; Graph; Discrete mathematics; Binomial (polynomial); Vertex (graph theory); Binary logarithm; Geometry; Statistics","score_opus":0.022611169466931723,"score_gpt":0.3191085700868565,"score_spread":0.2964974006199248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380876964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17790353,0.00003716477,0.62137973,0.0010690708,0.00034931913,0.00035371046,0.000004624793,0.0009753216,0.19792753],"genre_scores_gemma":[0.96268433,0.000060728373,0.028728576,0.00009542437,0.000016029395,0.000018882696,0.0000020268492,0.000010268251,0.008383729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900365,0.00004629909,0.00015400024,0.00020062199,0.00031877856,0.00027662574],"domain_scores_gemma":[0.9990001,0.0002839278,0.00003107868,0.00052223203,0.00008969811,0.000073007875],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048324483,0.000070989365,0.00013742704,0.00016260955,0.00005832244,0.000023609746,0.00079079135,0.000029845552,0.00015921962],"category_scores_gemma":[0.00006679633,0.00005609726,0.00007801527,0.0017024813,0.000091810616,0.00029338486,0.0003104565,0.00008059227,0.00079791644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031402866,0.000024662253,0.002810706,0.000013627106,0.000017508211,0.000014388396,0.00018148523,0.000087306216,0.001896316,0.9775215,0.002482897,0.014918192],"study_design_scores_gemma":[0.0031101294,0.00009042942,0.0034323242,0.000022958748,0.0000038859343,0.00003517078,0.00017893243,0.042733222,0.031566195,0.9076132,0.01087723,0.0003362815],"about_ca_topic_score_codex":0.0000120280365,"about_ca_topic_score_gemma":0.000003645195,"teacher_disagreement_score":0.7847808,"about_ca_system_score_codex":0.000007056294,"about_ca_system_score_gemma":0.0000294339,"threshold_uncertainty_score":0.9999801},"labels":[],"label_agreement":null},{"id":"W4380876996","doi":"10.5817/cz.muni.eurocomb23-021","title":"The Localization game on locally finite trees","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Finite graph; Combinatorics; Discrete mathematics; Vertex (graph theory); Countable set; Finite set; Subdivision; Graph","score_opus":0.028917622296725235,"score_gpt":0.3050418196226142,"score_spread":0.27612419732588894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380876996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033922453,0.000019721081,0.98575395,0.0029290817,0.00011419437,0.00010101125,4.2058693e-7,0.00042602487,0.010316341],"genre_scores_gemma":[0.97821736,0.00022759764,0.0019568184,0.0018925106,0.00006054062,0.000044713794,0.0000039308748,0.000018225957,0.017578326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989724,0.00009044128,0.00010309987,0.00021858889,0.00034037244,0.00027510565],"domain_scores_gemma":[0.9985251,0.0007690441,0.00001990723,0.0005700549,0.000061937135,0.000053983655],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046630003,0.00006617769,0.0000497283,0.00010667149,0.00021220704,0.00014047828,0.00085977936,0.000023905317,0.0000132341265],"category_scores_gemma":[0.00021152104,0.00003992358,0.000031580887,0.001270259,0.00008484514,0.00017358977,0.00021748178,0.00008808946,0.001213007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000115957,0.000010757775,0.000093749455,0.0000015223155,0.0000048101874,0.00000980619,0.00010570387,0.028353516,0.000086127904,0.8507091,0.0039134105,0.1166999],"study_design_scores_gemma":[0.00012827541,0.00010104787,0.00086591765,0.0000068591717,3.8508722e-7,7.9876617e-7,0.000023701974,0.717091,0.0010292163,0.227628,0.053045683,0.00007910974],"about_ca_topic_score_codex":0.0000022799363,"about_ca_topic_score_gemma":0.000024542254,"teacher_disagreement_score":0.98379713,"about_ca_system_score_codex":0.00001374422,"about_ca_system_score_gemma":0.00002642015,"threshold_uncertainty_score":0.99956465},"labels":[],"label_agreement":null},{"id":"W4381333094","doi":"10.1007/s10878-023-01058-x","title":"Balanced connected partitions of graphs: approximation, parameterization and lower bounds","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Combinatorics; Mathematics; Approximation algorithm; Partition (number theory); Vertex (graph theory); Time complexity; Discrete mathematics; Graph","score_opus":0.0146910651880712,"score_gpt":0.27154278237925394,"score_spread":0.2568517171911827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381333094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08540274,0.000045160217,0.9122623,0.00034794444,0.0015900531,0.00017333718,0.0000032298128,0.000063395404,0.00011179012],"genre_scores_gemma":[0.93245,0.0002064762,0.06722351,0.00001751085,0.000058021586,0.000006860061,0.00001281108,0.000011185587,0.000013599774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986022,0.00017363092,0.0005096551,0.00013467997,0.00042204987,0.00015779218],"domain_scores_gemma":[0.9980814,0.00025063896,0.00050573633,0.00020338397,0.00087467843,0.00008414727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006794013,0.00009194513,0.00022375511,0.0004848515,0.000110552326,0.000097740885,0.00029604268,0.00006761223,0.000008935194],"category_scores_gemma":[0.000612049,0.00008694488,0.000062364306,0.0017868076,0.000093418035,0.0010435275,0.00007273046,0.000118879616,0.0000014412631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017382693,0.00020127589,0.00084982545,0.0000520645,0.000069148395,0.00001033393,0.00054465205,0.35696113,0.004506804,0.6349825,0.00041087068,0.0012375482],"study_design_scores_gemma":[0.0021211174,0.00066325953,0.0012047095,0.00008117332,0.000020099187,0.000022186601,0.00004992014,0.4910819,0.0033972776,0.5010599,0.00013927212,0.00015918055],"about_ca_topic_score_codex":7.5164735e-7,"about_ca_topic_score_gemma":7.08676e-8,"teacher_disagreement_score":0.84704727,"about_ca_system_score_codex":0.000026528605,"about_ca_system_score_gemma":0.00008238983,"threshold_uncertainty_score":0.3545509},"labels":[],"label_agreement":null},{"id":"W4381433330","doi":"10.1016/j.jctb.2023.05.004","title":"Local Hadwiger's Conjecture","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Conjecture; Minor (academic); Complement (music); Mathematics; Graph; Vertex (graph theory); Discrete mathematics; Biology; Humanities","score_opus":0.012895943215520312,"score_gpt":0.27703519847462554,"score_spread":0.26413925525910525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381433330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09206201,0.00088070455,0.86318856,0.005161068,0.030278316,0.00040641762,0.000007747839,0.00061098224,0.0074041663],"genre_scores_gemma":[0.9966219,0.00009113514,0.001724752,0.00011096649,0.0005332255,0.0000036649715,8.399063e-7,0.000023800156,0.00088972924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764866,0.0005130208,0.00046482307,0.00019755877,0.0007416797,0.0004342588],"domain_scores_gemma":[0.9978878,0.0007158468,0.00030207535,0.0004975102,0.00037778076,0.0002189931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027611207,0.00017681549,0.00036209507,0.0004010304,0.00019396878,0.00015651288,0.0016946787,0.00011093072,0.00006196508],"category_scores_gemma":[0.000496214,0.00014194526,0.00020469853,0.0012944185,0.00033718674,0.0013178595,0.00037892786,0.0005569002,0.000082247534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036621944,0.00003699236,0.00002708038,0.000009391038,0.000055864028,0.00033315338,0.00043149258,0.00030278275,0.00063678605,0.987096,0.0019851099,0.008719132],"study_design_scores_gemma":[0.00089440035,0.0006950507,0.00009169498,0.000027277289,0.0000063950847,0.00026190782,0.0002595061,0.00012041559,0.008199979,0.9561441,0.03314909,0.00015021053],"about_ca_topic_score_codex":5.350363e-7,"about_ca_topic_score_gemma":2.4244363e-7,"teacher_disagreement_score":0.90455985,"about_ca_system_score_codex":0.000071191236,"about_ca_system_score_gemma":0.00022422052,"threshold_uncertainty_score":0.57883596},"labels":[],"label_agreement":null},{"id":"W4381798257","doi":"10.1002/jgt.22987","title":"Polynomial bounds for chromatic number VII. Disjoint holes","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Disjoint sets; Chromatic scale; Bounded function; Graph; Chromatic polynomial; Discrete mathematics; Integer (computer science); Constant (computer programming)","score_opus":0.02322918043151791,"score_gpt":0.31729970638571847,"score_spread":0.2940705259542006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381798257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35630623,0.00035172259,0.63828593,0.0015592492,0.0015354985,0.00034246736,0.000012957886,0.000180783,0.0014251951],"genre_scores_gemma":[0.9830956,0.0000938126,0.015348718,0.00019686508,0.00036046698,0.000020286381,0.0000015537393,0.000035430225,0.0008472887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792945,0.00028846788,0.0005359683,0.00022260158,0.00052409037,0.00049940904],"domain_scores_gemma":[0.9976461,0.0010761293,0.00035541126,0.00047987103,0.00023806436,0.00020441414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034374732,0.00017121295,0.0003431906,0.00059382897,0.00024905958,0.00017488809,0.0013771458,0.00006972328,0.000035939214],"category_scores_gemma":[0.0004127957,0.0001347557,0.00044424998,0.0011028924,0.00032878452,0.0007520693,0.00022537628,0.00030158777,0.00008876887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057491707,0.000205465,0.0008656632,0.00013193113,0.00032694868,0.00019161274,0.002054594,0.00027524112,0.012607171,0.9066915,0.029969314,0.046105634],"study_design_scores_gemma":[0.0010021896,0.00031698876,0.0020251728,0.000087696855,0.000019679377,0.0002241842,0.0002531691,0.0008414034,0.0028339766,0.98749954,0.004689919,0.00020607474],"about_ca_topic_score_codex":5.880769e-7,"about_ca_topic_score_gemma":8.328681e-7,"teacher_disagreement_score":0.6267894,"about_ca_system_score_codex":0.00005275433,"about_ca_system_score_gemma":0.00013392161,"threshold_uncertainty_score":0.5495178},"labels":[],"label_agreement":null},{"id":"W4383604917","doi":"10.48550/arxiv.2307.02816","title":"The grid-minor theorem revisited","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Monash University; Australian Government","keywords":"Combinatorics; Graph minor; Treewidth; Minor (academic); Mathematics; Robertson–Seymour theorem; Discrete mathematics; Graph; Planar graph; Upper and lower bounds; 1-planar graph; Line graph; Pathwidth; Graph power","score_opus":0.1084343330650851,"score_gpt":0.2325336489437,"score_spread":0.12409931587861489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383604917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03222859,0.00037142064,0.9553215,0.0010914474,0.0020024388,0.0009828263,0.00005062038,0.0014784068,0.006472765],"genre_scores_gemma":[0.977439,0.0012683754,0.0010125114,0.000104007966,0.00021717415,0.0000045928505,0.000019999661,0.000052915886,0.019881442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700445,0.000507012,0.0002290326,0.0013509708,0.00021311174,0.00069540634],"domain_scores_gemma":[0.9951699,0.001018968,0.00022829314,0.0030979095,0.0002706582,0.00021428154],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011898312,0.00034183852,0.0003070007,0.00032720357,0.00063136173,0.0003274698,0.0059291795,0.00023354586,0.000016122693],"category_scores_gemma":[0.00025473934,0.00028783968,0.00030703275,0.0016457251,0.00042798446,0.0003253817,0.0063901814,0.0010960022,0.0006863338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036900914,0.000020899859,0.0004802468,0.000036288053,0.000084079555,0.0003668052,0.00009418295,0.016572695,0.000020423091,0.97917485,0.0016474598,0.001465176],"study_design_scores_gemma":[0.00024749438,0.00003897163,0.00081523973,0.00008620072,0.00002374421,0.0000045755373,0.000082845196,0.13229299,0.00011685972,0.8600949,0.0057860836,0.00041012786],"about_ca_topic_score_codex":0.00003037612,"about_ca_topic_score_gemma":0.000021491045,"teacher_disagreement_score":0.954309,"about_ca_system_score_codex":0.00018465599,"about_ca_system_score_gemma":0.00019007213,"threshold_uncertainty_score":0.9999574},"labels":[],"label_agreement":null},{"id":"W4383982199","doi":"10.2139/ssrn.4506735","title":"The Minimum Size of Matching-Saturated Graphs","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matching (statistics); Combinatorics; Mathematics; Statistics","score_opus":0.017843584668923815,"score_gpt":0.29589907023783385,"score_spread":0.27805548556891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383982199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21736345,0.021050584,0.7405791,0.012251371,0.0056848074,0.0013613218,0.000025182462,0.0007183903,0.00096575066],"genre_scores_gemma":[0.96975476,0.021707892,0.0023248545,0.000046647194,0.00020727192,0.000034806464,0.0000036431727,0.00008101977,0.005839129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937858,0.0005779947,0.0006879063,0.0005609172,0.0009961305,0.0033912326],"domain_scores_gemma":[0.9960944,0.0013736485,0.00067892467,0.0013007597,0.0004153607,0.00013687125],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006607739,0.00034458144,0.00041933625,0.00029736257,0.00057314546,0.00035973388,0.005275561,0.00022846747,0.000003593554],"category_scores_gemma":[0.00051432074,0.00023943951,0.000431309,0.0009334603,0.00025339518,0.00023147716,0.00195773,0.008532553,0.000035328234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007442209,0.000035149,0.000066034154,0.000026500948,0.00042933828,0.00001804179,0.00032636625,0.0008412054,0.0008800998,0.9816229,0.00017410923,0.01550583],"study_design_scores_gemma":[0.00026950333,0.00016240151,0.00023221769,0.00007928368,0.000014958966,0.00016735944,0.00041793133,0.0009839424,0.0002776436,0.9969561,0.00020513858,0.00023349549],"about_ca_topic_score_codex":0.0000498575,"about_ca_topic_score_gemma":0.00034818696,"teacher_disagreement_score":0.7523913,"about_ca_system_score_codex":0.00054243713,"about_ca_system_score_gemma":0.004749075,"threshold_uncertainty_score":0.9937548},"labels":[],"label_agreement":null},{"id":"W4384339936","doi":"10.37236/11657","title":"Graphs of Linear Growth have Bounded Treewidth","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Japan Society for the Promotion of Science; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Australian Government","keywords":"Combinatorics; Treewidth; Mathematics; Bounded function; Discrete mathematics; Graph; Partial k-tree; 1-planar graph; Pathwidth; Chordal graph; Line graph","score_opus":0.016056357463164528,"score_gpt":0.28395786498195147,"score_spread":0.26790150751878694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384339936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5965082,0.0037512502,0.3913958,0.0047119483,0.0011599554,0.0004055652,0.0000023522905,0.00017478452,0.0018901414],"genre_scores_gemma":[0.99814147,0.0012286245,0.00015490256,0.00003726023,0.00003776588,0.000002409935,3.9885646e-7,0.000017511928,0.00037964032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973875,0.00030027275,0.0004899399,0.00015568014,0.00090258813,0.0007639792],"domain_scores_gemma":[0.9977127,0.00058235164,0.00045279108,0.0005544095,0.0005928522,0.00010490966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028983348,0.0001485839,0.00031849532,0.00047766496,0.00019665947,0.000042841235,0.0024692307,0.00005773699,0.0000035356443],"category_scores_gemma":[0.00028660914,0.000102132195,0.00022421339,0.0024206755,0.00017320659,0.00038589592,0.00026176695,0.0008741294,0.000013173821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043644875,0.00007181247,0.0003356842,0.000010764011,0.00007797468,0.000018189421,0.00035982786,0.00006529546,0.00044603046,0.99725264,0.00029776315,0.0010203824],"study_design_scores_gemma":[0.0007196588,0.0008195301,0.00053451007,0.000017993214,0.000014531497,0.00009360465,0.000083285304,0.001822426,0.0070911823,0.9879901,0.000712553,0.00010066203],"about_ca_topic_score_codex":0.000005676564,"about_ca_topic_score_gemma":0.0000034170457,"teacher_disagreement_score":0.4016333,"about_ca_system_score_codex":0.00015281986,"about_ca_system_score_gemma":0.0005475794,"threshold_uncertainty_score":0.4588486},"labels":[],"label_agreement":null},{"id":"W4385290098","doi":"10.1016/j.aam.2023.102593","title":"Rota's basis conjecture for matroids with density close to one","year":2023,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Mathematics; Disjoint sets; Combinatorics; Conjecture; Rainbow; Basis (linear algebra); Rank (graph theory); Graphic matroid; Discrete mathematics; Geometry","score_opus":0.019146766410876957,"score_gpt":0.304987635809085,"score_spread":0.285840869398208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385290098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025187766,0.00006370472,0.97034675,0.0003933943,0.00006548618,0.0014192299,0.000009723632,0.00035180748,0.0021621576],"genre_scores_gemma":[0.20253266,0.000046351204,0.79642016,0.00017075358,0.00003487375,0.000615669,0.0000045052575,0.00003627694,0.0001387298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981039,0.00001724213,0.0003003688,0.00052532495,0.00045616517,0.0005970107],"domain_scores_gemma":[0.99791455,0.0009223139,0.00009881385,0.00086353376,0.00006689598,0.00013390851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006229569,0.00021916993,0.0003672343,0.0003096866,0.00012521833,0.00007190774,0.0009556068,0.00006632889,0.0000043932687],"category_scores_gemma":[0.00014328836,0.00018708468,0.000046004578,0.0017012649,0.00009152364,0.00025401055,0.00034495536,0.00019276328,0.000116625175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006373224,0.000095794276,0.00010056449,0.00029372817,0.000011828019,0.000011930183,0.0010585638,0.0020135753,0.001266146,0.96811,0.0000927021,0.026881436],"study_design_scores_gemma":[0.0007047781,0.00016375487,0.000089348454,0.00008174617,0.000006281554,0.000008196031,0.00022914432,0.0067034503,0.013292417,0.9762007,0.0022148993,0.00030526845],"about_ca_topic_score_codex":6.5263276e-7,"about_ca_topic_score_gemma":0.000041537685,"teacher_disagreement_score":0.1773449,"about_ca_system_score_codex":0.00006567319,"about_ca_system_score_gemma":0.000042547897,"threshold_uncertainty_score":0.7629092},"labels":[],"label_agreement":null},{"id":"W4385317346","doi":"10.1007/978-3-031-38906-1_7","title":"A Parameterized Approximation Scheme for Generalized Partial Vertex Cover","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Vertex cover; Parameterized complexity; Combinatorics; Cover (algebra); Mathematics; Vertex (graph theory); Partition (number theory); Discrete mathematics; Time complexity; Graph","score_opus":0.04523031406818988,"score_gpt":0.30699976659108835,"score_spread":0.26176945252289846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385317346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015169519,0.00009467612,0.9952476,0.0005480223,0.0018644308,0.0012833186,0.000019948227,0.0003798173,0.00041048988],"genre_scores_gemma":[0.008021589,0.00004271749,0.98873186,0.0008573453,0.00038069155,0.00020006848,0.00003275397,0.00009130739,0.0016416749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950981,0.000074050084,0.0006112713,0.0019021396,0.0012748528,0.0010395662],"domain_scores_gemma":[0.9961013,0.001348703,0.00029594888,0.0016634415,0.00036987165,0.00022073388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017152451,0.00055347383,0.0006719271,0.001016937,0.0003429577,0.00064245897,0.0035100956,0.00035363808,0.000020079136],"category_scores_gemma":[0.0004945535,0.00051819644,0.0002577484,0.0010190932,0.00075883867,0.0008217028,0.0014028909,0.0006398806,0.00014395156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015122238,0.000056180506,0.00001133027,0.00018053253,0.000052946125,0.000069631955,0.0006214861,0.034158196,0.004372443,0.48395294,0.00013128073,0.47624183],"study_design_scores_gemma":[0.0005850269,0.00013167105,0.0000052249006,0.00010133741,0.0000048157226,0.000010257578,4.3340624e-8,0.5646953,0.002416507,0.43069997,0.00096579426,0.0003840396],"about_ca_topic_score_codex":0.0000053358685,"about_ca_topic_score_gemma":0.0000073871124,"teacher_disagreement_score":0.5305371,"about_ca_system_score_codex":0.00026650884,"about_ca_system_score_gemma":0.00051947276,"threshold_uncertainty_score":0.99972695},"labels":[],"label_agreement":null},{"id":"W4385357590","doi":"10.1007/978-3-031-38906-1_22","title":"Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Computer science; Discrete mathematics; Graph; 1-planar graph","score_opus":0.023025434302450163,"score_gpt":0.2662281672661516,"score_spread":0.24320273296370146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385357590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024100086,0.0004838337,0.99214447,0.00052801904,0.0010732084,0.0007939101,0.000018304749,0.00029313433,0.0022551443],"genre_scores_gemma":[0.335166,0.0011029742,0.6596296,0.0007630947,0.00027684486,0.00013116196,0.000017974678,0.00027408884,0.0026382508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945538,0.000071102884,0.00064809923,0.0020733767,0.001467553,0.0011860356],"domain_scores_gemma":[0.9960761,0.0011139167,0.00039932632,0.0017027796,0.00039963482,0.00030826303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020553626,0.0006546539,0.0008932089,0.0023826149,0.00032310243,0.00037019755,0.0040291185,0.00038323036,0.0000084171115],"category_scores_gemma":[0.00017691379,0.0006212939,0.00019696723,0.0023229478,0.002669967,0.0008285621,0.0029887017,0.0010667907,0.00002021287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084513165,0.00008252465,0.00074909796,0.00043432476,0.00007004604,0.00030039318,0.0012469806,0.0059779505,0.002429758,0.68665814,0.000040873572,0.3019254],"study_design_scores_gemma":[0.00041915735,0.00035599573,0.0002572226,0.00032619096,0.00000898364,0.000053688804,7.799734e-7,0.06963929,0.0044298046,0.9235482,0.00030255856,0.00065811776],"about_ca_topic_score_codex":0.000023839388,"about_ca_topic_score_gemma":0.000049623824,"teacher_disagreement_score":0.33275598,"about_ca_system_score_codex":0.00012075241,"about_ca_system_score_gemma":0.00039204938,"threshold_uncertainty_score":0.99962384},"labels":[],"label_agreement":null},{"id":"W4385659976","doi":"10.1007/s11083-023-09641-x","title":"Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications","year":2023,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Interval graph; Discrete mathematics; Split graph; Distance-hereditary graph; Line graph; Pathwidth; Chordal graph; Induced subgraph; Block graph; Cograph; Intersection graph; Indifference graph; Induced subgraph isomorphism problem; Graph; Graph power; Voltage graph; Vertex (graph theory)","score_opus":0.031763554937995854,"score_gpt":0.3440101601170344,"score_spread":0.3122466051790385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385659976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028132034,0.00006287556,0.9687051,0.0011547618,0.00004227212,0.00099528,0.000018984003,0.0004961626,0.00039249985],"genre_scores_gemma":[0.5349242,0.000022602026,0.46249261,0.00015727735,0.00007087956,0.0017025605,0.000028781242,0.00002970093,0.0005713669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988497,0.000051070157,0.00012634801,0.00041704607,0.00021906727,0.00033676386],"domain_scores_gemma":[0.99877834,0.00028935683,0.00004622217,0.0005900261,0.00022081303,0.00007525034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030330254,0.00011199797,0.00013029142,0.0001425945,0.00020441007,0.000096422664,0.0007151503,0.000037732072,0.000015620231],"category_scores_gemma":[0.000026965641,0.00008691883,0.000040851275,0.0012343271,0.00017222804,0.00029055917,0.00013661936,0.00011218665,0.00004062421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049678754,0.000052884967,0.003423434,0.00006624195,0.000039505063,0.0000028279667,0.00037815067,0.00058645534,0.00034294292,0.9306138,0.00058824336,0.06385584],"study_design_scores_gemma":[0.00038490247,0.00013580729,0.011664441,0.000005504621,0.000005366659,0.000005640826,0.000074394615,0.017182022,0.0011110262,0.95002687,0.019202884,0.00020111803],"about_ca_topic_score_codex":0.000006185054,"about_ca_topic_score_gemma":0.000019982008,"teacher_disagreement_score":0.5067922,"about_ca_system_score_codex":0.0000144853875,"about_ca_system_score_gemma":0.00005766958,"threshold_uncertainty_score":0.35444468},"labels":[],"label_agreement":null},{"id":"W4385986349","doi":"10.1007/s00373-023-02696-y","title":"A Note on $$\\Delta $$-Critical Graphs","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Conjecture; Delta; Critical graph; Graph; Discrete mathematics; Line graph; Graph power; Physics","score_opus":0.025462665368886868,"score_gpt":0.3117780709124376,"score_spread":0.2863154055435507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385986349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80970067,0.0020873935,0.13224342,0.016569981,0.0070446776,0.0014850681,0.00007165794,0.0060738814,0.02472324],"genre_scores_gemma":[0.9983218,0.00032390218,0.0007750411,0.0002809704,0.000009120349,0.00003503889,0.0000035946875,0.000018507184,0.00023202958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980474,0.00009905821,0.00018252434,0.0005406363,0.0005339088,0.00059647276],"domain_scores_gemma":[0.9982848,0.00062283926,0.000029258783,0.0006815753,0.0001168706,0.00026462873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004936598,0.00018683393,0.00019396144,0.0005583401,0.0003603451,0.0001692724,0.0007671992,0.00009257313,0.0000044873027],"category_scores_gemma":[0.0002116282,0.00017179135,0.00009789211,0.0030404802,0.0002112055,0.00029322566,0.00040581712,0.00033874853,0.00009782164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095557325,0.00006434775,0.0005771328,0.000016887143,0.000006892757,0.00007697174,0.00013693582,0.000004770763,0.00008074374,0.98804164,0.0010354455,0.00994867],"study_design_scores_gemma":[0.00035885524,0.00029872297,0.002586047,0.000018190312,0.0000032226976,0.000011336469,0.000025837528,0.0044105276,0.00029319027,0.9888621,0.002918861,0.00021310155],"about_ca_topic_score_codex":0.000005619178,"about_ca_topic_score_gemma":0.0000011646605,"teacher_disagreement_score":0.18862112,"about_ca_system_score_codex":0.000017665794,"about_ca_system_score_gemma":0.00003225095,"threshold_uncertainty_score":0.70054483},"labels":[],"label_agreement":null},{"id":"W4386266281","doi":"10.1016/j.jctb.2023.08.001","title":"A proof of the tree alternative conjecture under the topological minor relation","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Conjecture; Minor (academic); Equivalence relation; Relation (database); Combinatorics; Tree (set theory); Isomorphism (crystallography); Congruence relation; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.023536585466061296,"score_gpt":0.2928676424930599,"score_spread":0.2693310570269986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386266281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8891283,0.00046299087,0.075085126,0.01629747,0.013856088,0.00083450146,0.0000071842915,0.00008279228,0.0042455383],"genre_scores_gemma":[0.99874187,0.000018433342,0.00026743952,0.00007789437,0.00028583707,0.000005303716,2.2021207e-7,0.000008452074,0.00059456617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742866,0.0011020922,0.00041621274,0.00014006352,0.00068412896,0.00022886225],"domain_scores_gemma":[0.9972755,0.0013306573,0.00053064874,0.0004733234,0.00033378636,0.000056100373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002403306,0.00012670962,0.00024568615,0.000119854165,0.00023142975,0.00006018371,0.0017957463,0.00008508857,0.000024094581],"category_scores_gemma":[0.00071126583,0.00006066542,0.00020734887,0.00094540615,0.00057498034,0.0005274487,0.00041819212,0.0005343516,0.000003137316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003459039,0.000041323827,0.000109028195,0.0000053922954,0.000060844905,0.000012388719,0.0010320678,0.00079959026,0.0007536313,0.995139,0.00019531295,0.0015055207],"study_design_scores_gemma":[0.00064178923,0.00052559486,0.0019862375,0.00002821821,0.000011519639,0.00007006723,0.00054449536,0.00015926562,0.016530268,0.9782632,0.0011696919,0.00006967278],"about_ca_topic_score_codex":0.0000011327502,"about_ca_topic_score_gemma":0.0000013893324,"teacher_disagreement_score":0.109613545,"about_ca_system_score_codex":0.00005304122,"about_ca_system_score_gemma":0.00014513303,"threshold_uncertainty_score":0.33369732},"labels":[],"label_agreement":null},{"id":"W4386559272","doi":"10.37236/11862","title":"Irreducible Subcube Partitions","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; University of Haifa; Israel Science Foundation; Fonds Wetenschappelijk Onderzoek; Vlaamse regering; European Commission","keywords":"Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Dimension (graph theory)","score_opus":0.019568141892636892,"score_gpt":0.29277190572134376,"score_spread":0.27320376382870687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386559272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31888056,0.005316793,0.6456172,0.022068553,0.0024931913,0.00036428522,0.0000016973426,0.0003629835,0.004894732],"genre_scores_gemma":[0.99796206,0.0009017502,0.000050615563,0.000057708243,0.0000631595,0.000004763806,3.5887712e-7,0.000011196831,0.00094838964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810874,0.00019736207,0.00028313405,0.00012363274,0.00056271715,0.0007244184],"domain_scores_gemma":[0.9985201,0.00040218126,0.00018202724,0.00052832084,0.0002723085,0.00009509129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002343709,0.00009570013,0.00015649771,0.00026103132,0.0002556687,0.000083529565,0.0018250813,0.000033071912,0.000008422777],"category_scores_gemma":[0.00018254624,0.00006587648,0.00012266572,0.002484733,0.00008033813,0.00044000085,0.00019875808,0.0007089962,0.00010863357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009074178,0.000042016807,0.00005175245,0.0000025207141,0.000030475927,0.000016449909,0.00017900234,0.0004061231,0.0003404384,0.99523497,0.0027221646,0.0009650094],"study_design_scores_gemma":[0.0003025899,0.00032365072,0.00022719301,0.000008324217,0.000007162477,0.0001465106,0.000065142616,0.0010397355,0.0017562092,0.98500556,0.011043478,0.000074446354],"about_ca_topic_score_codex":0.0000010833885,"about_ca_topic_score_gemma":0.0000010692105,"teacher_disagreement_score":0.6790815,"about_ca_system_score_codex":0.00016638244,"about_ca_system_score_gemma":0.00049975544,"threshold_uncertainty_score":0.33914855},"labels":[],"label_agreement":null},{"id":"W4386621544","doi":"10.48550/arxiv.2309.04390","title":"Induced subgraphs and tree decompositions XI. Local structure in even-hole-free graphs of large treewidth","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; Clique-sum; Chordal graph; Mathematics; Tree-depth; Partial k-tree; 1-planar graph; Converse; Tree decomposition; Discrete mathematics; Pathwidth; Bounded function; Graph; Line graph","score_opus":0.060262239499770644,"score_gpt":0.23721944233531103,"score_spread":0.1769572028355404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386621544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76406676,0.00010971256,0.23439841,0.00013469011,0.00019851979,0.00043792208,0.00022333258,0.00018783264,0.0002428221],"genre_scores_gemma":[0.99741,0.00024055898,0.0020901684,0.000026111704,0.00001419308,0.000002563016,0.000039451617,0.000033839267,0.00014309742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698174,0.0003783468,0.0003564565,0.0013947238,0.0002280955,0.00066064583],"domain_scores_gemma":[0.9968779,0.00034308765,0.00025480922,0.0020873703,0.0001833286,0.00025348255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036200607,0.0004126109,0.00057549716,0.0017721256,0.00016888817,0.00006409762,0.0029981392,0.00043396844,0.000012305844],"category_scores_gemma":[0.00006889405,0.0004783503,0.00024092934,0.0028117355,0.00037014385,0.0004520947,0.0043513444,0.0012028409,0.0000067855603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000135701,0.00022086191,0.021843182,0.00017376093,0.00016113817,0.0006396912,0.00050485006,0.032855455,0.001629315,0.9398241,0.000095473,0.0019164522],"study_design_scores_gemma":[0.001772119,0.00014270032,0.03193804,0.00022424037,0.000038369384,0.000007073666,0.0002951467,0.07684581,0.0011394843,0.88704276,0.000017767241,0.00053647393],"about_ca_topic_score_codex":0.0002246322,"about_ca_topic_score_gemma":0.0028607938,"teacher_disagreement_score":0.23334326,"about_ca_system_score_codex":0.00013808208,"about_ca_system_score_gemma":0.00019263684,"threshold_uncertainty_score":0.9997668},"labels":[],"label_agreement":null},{"id":"W4386786301","doi":"10.1016/j.tcs.2023.114186","title":"The one-visibility localization game","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Mathematics; Combinatorics; Visibility; Isoperimetric inequality; Constant (computer programming); Multiplicative function; Discrete mathematics; Tree (set theory); Treewidth; Order (exchange); Computer science; Pathwidth; Mathematical analysis; Graph","score_opus":0.02531236495019715,"score_gpt":0.317641038245972,"score_spread":0.29232867329577483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386786301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010470748,0.000021009419,0.983968,0.0025167305,0.0004935811,0.00024377949,7.802252e-7,0.000653677,0.001631667],"genre_scores_gemma":[0.9818363,0.000021709811,0.017667053,0.00031881008,0.000086119384,0.00001641147,7.244164e-7,0.000009050666,0.000043772445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625665,0.00030168437,0.0002846905,0.00084045256,0.0013507573,0.00096577883],"domain_scores_gemma":[0.9963829,0.0012018473,0.000053509724,0.0017287055,0.00034117192,0.00029186084],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0056995573,0.00015098875,0.00014555175,0.00022345092,0.0013063095,0.0008325085,0.004852795,0.000042431322,0.000014700603],"category_scores_gemma":[0.0005626929,0.00010232455,0.00006625416,0.005442381,0.006162381,0.00080312917,0.002478421,0.00025733424,0.0005596133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071449326,0.000019521798,0.00006059272,0.0000031725253,0.0000021126525,0.000004857071,0.00021718728,0.0009557446,0.00020294783,0.93393075,0.00005747606,0.06453847],"study_design_scores_gemma":[0.00006497459,0.000059848408,0.00091034046,0.0000059698955,6.126348e-7,0.0000037545428,0.000004504964,0.4896726,0.0012532166,0.5076005,0.00033937563,0.00008432562],"about_ca_topic_score_codex":0.0000012011943,"about_ca_topic_score_gemma":8.541923e-7,"teacher_disagreement_score":0.9713656,"about_ca_system_score_codex":0.000076731965,"about_ca_system_score_gemma":0.00015137314,"threshold_uncertainty_score":0.99999386},"labels":[],"label_agreement":null},{"id":"W4386832011","doi":"10.1016/j.ejc.2023.103809","title":"Guarding isometric subgraphs and cops and robber in planar graphs","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Conjecture; Planar graph; Graph; Planar; Discrete mathematics; Computer science; Computer graphics (images)","score_opus":0.021495076137568046,"score_gpt":0.26022560617976226,"score_spread":0.23873053004219422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386832011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9782744,0.002371776,0.015786937,0.00045732592,0.0005302479,0.00009515274,0.0000010843273,0.00006106067,0.0024220143],"genre_scores_gemma":[0.9971187,0.0015155153,0.001199724,0.000042026797,0.000017359347,3.846594e-7,2.5618442e-7,0.00001895693,0.00008708539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981325,0.0005243223,0.00038576373,0.00020857931,0.00042496048,0.00032386818],"domain_scores_gemma":[0.9988359,0.00040912908,0.00018631133,0.00023514903,0.00013923463,0.00019427612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031569372,0.00012744157,0.00023597611,0.0021358102,0.000108109976,0.00014380696,0.00065128814,0.000020675367,0.0000012247176],"category_scores_gemma":[0.00030143667,0.00011527429,0.00005378155,0.004546889,0.00009100078,0.0005385036,0.00027098774,0.00043418628,0.000010616429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006066734,0.00012365355,0.13865457,0.000071760274,0.00006690373,0.004561841,0.001782779,0.00013251172,0.00084989547,0.81411326,0.0023030795,0.037279055],"study_design_scores_gemma":[0.003774508,0.0011990382,0.382212,0.00019478652,0.000014104208,0.000828243,0.00042786065,0.0016697594,0.00025323743,0.6030824,0.00585034,0.0004936636],"about_ca_topic_score_codex":5.991311e-7,"about_ca_topic_score_gemma":2.6661868e-7,"teacher_disagreement_score":0.24355745,"about_ca_system_score_codex":0.000024485085,"about_ca_system_score_gemma":0.000024343473,"threshold_uncertainty_score":0.4700749},"labels":[],"label_agreement":null},{"id":"W4387101675","doi":"10.1017/s0963548323000275","title":"The Excluded Tree Minor Theorem Revisited","year":2023,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Monash University; Australian Government","keywords":"Minor (academic); Combinatorics; Mathematics; Robertson–Seymour theorem; Graph minor; Discrete mathematics; Graph; Upper and lower bounds; Tree (set theory); RADIUS; Pathwidth; Line graph; Computer science; Graph power; Law; Mathematical analysis","score_opus":0.039797771614092606,"score_gpt":0.30333307116574887,"score_spread":0.2635352995516563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387101675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57299536,0.0011342801,0.39350343,0.00638315,0.003003493,0.002815102,0.000004681942,0.0051430995,0.015017429],"genre_scores_gemma":[0.9950553,0.00003410738,0.0041442253,0.00007441372,0.000068949914,0.000027658567,0.0000046794935,0.000027614811,0.000563044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959488,0.00077161036,0.0005633752,0.000874504,0.0008049975,0.0010367144],"domain_scores_gemma":[0.9936701,0.003294396,0.00019246027,0.0021800755,0.00045872983,0.00020426039],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0057664276,0.0002735893,0.000308232,0.00019586207,0.0014511369,0.00046055837,0.0034529811,0.00009825653,0.0000025549143],"category_scores_gemma":[0.0021626102,0.00020697806,0.00017955816,0.0045382795,0.00035291616,0.00033754297,0.0024266185,0.0005516963,0.00018823537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009652026,0.00006019693,0.002430325,0.00004297485,0.000016427666,0.000013408008,0.00039548252,0.00015518178,0.0001335686,0.94884247,0.00071274024,0.047187556],"study_design_scores_gemma":[0.00035299352,0.0000778931,0.0057115383,0.00002878879,0.0000030290964,0.00000744624,0.00004405258,0.09975204,0.00044258867,0.8905907,0.0027535253,0.0002353939],"about_ca_topic_score_codex":0.000003209346,"about_ca_topic_score_gemma":0.0000020863765,"teacher_disagreement_score":0.42205998,"about_ca_system_score_codex":0.00020704941,"about_ca_system_score_gemma":0.00012343674,"threshold_uncertainty_score":0.99984884},"labels":[],"label_agreement":null},{"id":"W4387172124","doi":"10.1002/jgt.23035","title":"The edge‐connectivity of vertex‐transitive hypergraphs","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Transitive relation; Vertex (graph theory); Hypergraph; Discrete mathematics; Transitive reduction; Automorphism; Graph; Line graph; Voltage graph","score_opus":0.01647421525668126,"score_gpt":0.2826238086771157,"score_spread":0.2661495934204344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387172124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8146431,0.0024311915,0.17507955,0.0017949314,0.0017053264,0.00027548563,0.0000075618204,0.000118403106,0.003944454],"genre_scores_gemma":[0.9984439,0.0006117111,0.00068742957,0.00005334727,0.000048104717,0.0000039665692,1.668108e-7,0.000014803811,0.00013654462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732226,0.00090513634,0.00048576645,0.00019650855,0.0006753015,0.0004150422],"domain_scores_gemma":[0.9947167,0.0036452604,0.0003840346,0.000595885,0.0005195751,0.0001385321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005891709,0.00015082718,0.00031674007,0.00067389366,0.0002831811,0.00005584565,0.0017273516,0.00006281004,0.000005113762],"category_scores_gemma":[0.0006823951,0.000097250006,0.00040175222,0.0023351256,0.0005826305,0.0004583808,0.00019040155,0.0004847111,0.000009078048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031992435,0.00007397101,0.0007064046,0.000015520256,0.00021126057,0.0000842007,0.001063199,0.00013254644,0.011155414,0.9324096,0.00029233453,0.053535637],"study_design_scores_gemma":[0.0004670177,0.00033598221,0.007553786,0.000052634794,0.00001585032,0.000091547736,0.000545616,0.00048543132,0.010609926,0.9792909,0.00043544662,0.00011583609],"about_ca_topic_score_codex":0.0000017403829,"about_ca_topic_score_gemma":0.0000036357058,"teacher_disagreement_score":0.18380083,"about_ca_system_score_codex":0.000022688528,"about_ca_system_score_gemma":0.00013257399,"threshold_uncertainty_score":0.39657402},"labels":[],"label_agreement":null},{"id":"W4387258707","doi":"10.46298/dmtcs.9957","title":"Homomorphically Full Oriented Graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Syddansk Universitet","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.018584024645807756,"score_gpt":0.2938300156535539,"score_spread":0.2752459910077461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387258707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026500624,0.0000139882795,0.96541506,0.0016222298,0.0005074606,0.00042371496,0.000007799813,0.0011769239,0.0043322113],"genre_scores_gemma":[0.6056179,0.00001268374,0.39396414,0.00022586422,0.00005536794,0.000040292332,0.0000044437334,0.00002986464,0.00004948925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418515,0.00018125228,0.00061591616,0.0012869011,0.0021750506,0.0015557384],"domain_scores_gemma":[0.9954438,0.0009767407,0.00014453435,0.0022678608,0.0004777647,0.0006893051],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038264878,0.00039184335,0.00044475662,0.0008762415,0.0008905409,0.0007756834,0.0056365593,0.00010011712,0.00008274098],"category_scores_gemma":[0.00058516173,0.00031117158,0.00020909472,0.008225241,0.00533385,0.001010567,0.003558574,0.00048822217,0.0009447949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008658106,0.00007596121,0.000017443848,0.000031387153,0.000010627439,0.0000737769,0.0008780412,0.00010194869,0.0022500854,0.99262124,0.00012555967,0.0038052495],"study_design_scores_gemma":[0.00016775279,0.00014008328,0.00006574121,0.00003899333,0.0000038311296,0.000048325535,0.000034466575,0.44105232,0.0008000939,0.55730474,0.00009182983,0.0002518498],"about_ca_topic_score_codex":7.066394e-7,"about_ca_topic_score_gemma":4.832668e-7,"teacher_disagreement_score":0.57911724,"about_ca_system_score_codex":0.00005650062,"about_ca_system_score_gemma":0.00017443261,"threshold_uncertainty_score":0.999934},"labels":[],"label_agreement":null},{"id":"W4387294350","doi":"10.48550/arxiv.2309.17291","title":"Exponentially Many Correspondence Colourings of Planar and Locally Planar Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Conjecture; Planar; Girth (graph theory); Class (philosophy); Triangle-free graph; 1-planar graph; Discrete mathematics; Graph; Chordal graph; Computer science","score_opus":0.07458261769763382,"score_gpt":0.21845678630421392,"score_spread":0.1438741686065801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387294350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4300489,0.00009271259,0.5683564,0.000094320625,0.00037632263,0.00039241483,0.000046981808,0.00027889264,0.00031305358],"genre_scores_gemma":[0.9924321,0.00056110584,0.0040604696,0.000041563173,0.000019778092,0.0000024380315,0.0000118067765,0.000033340097,0.002837352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971963,0.00026012497,0.0003178365,0.0013988634,0.00027646992,0.00055037474],"domain_scores_gemma":[0.9972596,0.00046729995,0.00034743993,0.0014171537,0.00022968797,0.00027882255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066510163,0.0003615152,0.00048784693,0.0009073381,0.00017536362,0.00009283909,0.002958188,0.00030449365,0.000014301801],"category_scores_gemma":[0.00009359999,0.0004310704,0.00018507619,0.0011068296,0.0005445748,0.0004089786,0.002336724,0.0007581218,0.000066302026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036854687,0.00008345457,0.0055844327,0.0002504993,0.00015869926,0.0018978985,0.00040311916,0.0151560465,0.0011014469,0.9742426,0.00042173814,0.00033150148],"study_design_scores_gemma":[0.00093961693,0.00028785213,0.01012604,0.0003853536,0.000059660964,0.000026583832,0.00020099468,0.09157802,0.0009873908,0.8944106,0.0002261754,0.00077168195],"about_ca_topic_score_codex":0.00016129132,"about_ca_topic_score_gemma":0.00006233197,"teacher_disagreement_score":0.56429595,"about_ca_system_score_codex":0.00008936464,"about_ca_system_score_gemma":0.00025217232,"threshold_uncertainty_score":0.9998141},"labels":[],"label_agreement":null},{"id":"W4387351544","doi":"10.2139/ssrn.4592858","title":"Computing the Pathwidth and Bandwidth of Solid, Convex Grids ∗","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Regular polygon; Bandwidth (computing); Mathematics; Computer science; Telecommunications; Geometry","score_opus":0.023204293377991826,"score_gpt":0.30854352318974804,"score_spread":0.2853392298117562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387351544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048876513,0.0062210597,0.94106364,0.002334549,0.00085420464,0.00038030423,0.000013979961,0.00012129008,0.00013444001],"genre_scores_gemma":[0.9885469,0.008087542,0.002318767,0.00007362624,0.0003335346,0.000007642924,0.0000035719315,0.000045827153,0.0005825602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526274,0.00047178788,0.0005588592,0.00054531184,0.00070590165,0.002455403],"domain_scores_gemma":[0.9976914,0.0005506356,0.0005287175,0.00084516377,0.00025901542,0.00012508211],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006678228,0.0002994646,0.00048229462,0.0002963819,0.00043788226,0.00018915493,0.0026754225,0.00016979579,0.0000032731673],"category_scores_gemma":[0.00020018712,0.00021243574,0.00021000607,0.00043951996,0.00032605047,0.00017888963,0.0027497415,0.006344435,0.00001058762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044308883,0.000050693136,0.0014313329,0.000096712465,0.0004922669,0.00002837221,0.0014321099,0.0027582876,0.00030977125,0.89553297,0.00013922069,0.09768394],"study_design_scores_gemma":[0.0003784958,0.00020180603,0.0006931839,0.00012585364,0.000018747915,0.00037049266,0.00041387224,0.020143175,0.00020699232,0.9770625,0.00015890744,0.00022596186],"about_ca_topic_score_codex":0.00004118694,"about_ca_topic_score_gemma":0.00009034739,"teacher_disagreement_score":0.93967044,"about_ca_system_score_codex":0.00033203216,"about_ca_system_score_gemma":0.002910419,"threshold_uncertainty_score":0.99594796},"labels":[],"label_agreement":null},{"id":"W4388317972","doi":"10.1093/oso/9780198505617.005.0003","title":"Asymptotics for <i>q</i> -factorials","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03807506390446683,"score_gpt":0.2945142205117252,"score_spread":0.25643915660725836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388317972","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.2000557e-7,0.00012207736,0.39219224,0.00012485897,0.00048353634,0.0004270278,0.000026475516,0.0001852946,0.6064383],"genre_scores_gemma":[0.00008431754,0.00024098277,0.070739605,0.00035595213,0.0005282608,0.000025564827,0.000018322247,0.00006541916,0.92794156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820524,0.00001528959,0.00031118662,0.0006185539,0.0004436696,0.0004060672],"domain_scores_gemma":[0.997924,0.00053535256,0.00010065104,0.0011293208,0.00015851803,0.00015221113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029851298,0.0003072092,0.0003801171,0.00018655472,0.00010568958,0.00014653374,0.0015596612,0.00030162127,0.00062275334],"category_scores_gemma":[0.000036307018,0.00027450905,0.00024820375,0.00004238309,0.00009221872,0.0002296624,0.00023751086,0.0002595715,0.0005222211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011496633,0.0000058723354,1.2653896e-7,0.0000121921985,0.000028911847,0.0000045790334,0.000013728144,0.000013735109,0.000023723074,0.96408266,0.0051301727,0.030672794],"study_design_scores_gemma":[0.00011374415,0.0000614757,8.6469676e-8,0.000014348397,0.000004201094,0.0000026568216,1.7138586e-7,0.00013779277,0.00023469665,0.52841043,0.47083727,0.00018315959],"about_ca_topic_score_codex":7.9675203e-7,"about_ca_topic_score_gemma":0.0000020912614,"teacher_disagreement_score":0.4657071,"about_ca_system_score_codex":0.000056307963,"about_ca_system_score_gemma":0.00012638955,"threshold_uncertainty_score":0.99997073},"labels":[],"label_agreement":null},{"id":"W4388317990","doi":"10.1093/oso/9780198505617.005.0004","title":"Bond or edge percolation","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Scholarship; Combinatorics; Percolation (cognitive psychology); Subject (documents); Enhanced Data Rates for GSM Evolution; Bond; Graph theory; Graph; Percolation theory; Mathematics; Statistical physics; Computer science; Physics; Library science; Psychology; Economics; Artificial intelligence; Topology (electrical circuits)","score_opus":0.03989398380301909,"score_gpt":0.2966270266582216,"score_spread":0.2567330428552025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388317990","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020928799,0.00013561736,0.11637387,0.00017086124,0.000109412846,0.00023848431,0.0000038664443,0.00021260208,0.8827532],"genre_scores_gemma":[0.00022361314,0.00017164901,0.025464077,0.00023110183,0.000113439215,0.000008454592,0.000007336583,0.00003114184,0.97374916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985579,0.000014925148,0.00020713313,0.00052745146,0.00042494148,0.00026761292],"domain_scores_gemma":[0.9987237,0.00013447437,0.000055613127,0.00088960596,0.0000805721,0.0001160732],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018034292,0.00022518466,0.0002098564,0.00026310614,0.00010613658,0.00011697497,0.0010187742,0.00020395503,0.004326474],"category_scores_gemma":[0.000011910197,0.00017396678,0.00009979185,0.000077473385,0.000084604886,0.0004172229,0.00024675048,0.0003509442,0.0021052756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015810681,0.000004848974,5.3702456e-7,0.0000060211205,0.000009404012,0.000031967975,0.00003928913,0.000004040035,0.000009712484,0.90620124,0.0032706712,0.090406455],"study_design_scores_gemma":[0.00009662213,0.000067248904,0.0000050652407,0.000024605586,0.0000024870583,0.000020585547,9.86015e-7,0.00068118685,0.000036607984,0.5382851,0.46057203,0.00020746423],"about_ca_topic_score_codex":0.0000024367657,"about_ca_topic_score_gemma":0.000017015822,"teacher_disagreement_score":0.45730138,"about_ca_system_score_codex":0.0000630358,"about_ca_system_score_gemma":0.00013165043,"threshold_uncertainty_score":0.9986717},"labels":[],"label_agreement":null},{"id":"W4388318195","doi":"10.1093/oso/9780198505617.005.0002","title":"Convex functions","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Combinatorics; Subject (documents); Scholarship; Mathematics; Graph; Regular polygon; Graph theory; Discrete mathematics; Computer science; Library science; Political science; Geometry","score_opus":0.030368163834407,"score_gpt":0.2701441202576862,"score_spread":0.2397759564232792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388318195","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1663318e-7,0.00017088107,0.23115116,0.00022797199,0.00016332515,0.000118289616,0.0000057044745,0.00026773245,0.7678947],"genre_scores_gemma":[0.00013904375,0.00013176164,0.005660166,0.00032072488,0.00008506431,0.000008276965,0.000007669779,0.000025579542,0.9936217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872184,0.000012800771,0.00016908033,0.000486755,0.00035249704,0.00025702987],"domain_scores_gemma":[0.9985984,0.00010500897,0.000042414118,0.0010488068,0.000075212876,0.0001301817],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000109571876,0.00020259971,0.00020016391,0.00024259694,0.000114820374,0.00008202795,0.0010120852,0.00016665131,0.0089260675],"category_scores_gemma":[0.0000055115233,0.00018231793,0.00013147177,0.000060752674,0.000132877,0.00022499295,0.00024301327,0.0004096128,0.0092730755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002678653,0.0000038246167,3.210182e-7,0.0000024689907,0.000017378672,0.000018335837,0.000009311946,0.0000059081103,0.0000031885804,0.9345065,0.006892441,0.058537673],"study_design_scores_gemma":[0.000045447785,0.000026416821,0.0000010667599,0.000008571974,0.0000020173977,0.000011684803,4.976335e-7,0.00015921865,0.000009477218,0.47316512,0.52644145,0.00012898874],"about_ca_topic_score_codex":0.0000021756543,"about_ca_topic_score_gemma":0.0000046068108,"teacher_disagreement_score":0.519549,"about_ca_system_score_codex":0.000036088884,"about_ca_system_score_gemma":0.00008492798,"threshold_uncertainty_score":0.9919799},"labels":[],"label_agreement":null},{"id":"W4388456631","doi":"10.1002/rsa.21197","title":"Sharp thresholds in adaptive random graph processes","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation of Sri Lanka; University of Toronto; National Science Foundation","keywords":"Mathematics; Random regular graph; Graph; Monotone polygon; Null graph; Combinatorics; Random graph; Line graph; Complement graph; Discrete mathematics; Voltage graph; Geometry; Pathwidth","score_opus":0.0224160680928744,"score_gpt":0.2887039899985048,"score_spread":0.2662879219056304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388456631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29983562,0.0095357,0.6813723,0.0017504507,0.0010917749,0.0027392395,0.00010086595,0.0012845086,0.0022895655],"genre_scores_gemma":[0.9874152,0.0011992637,0.010799208,0.000107762215,0.00011798841,0.00011089589,0.000010206845,0.00002436634,0.00021513083],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980293,0.00013157411,0.00026612388,0.0005966865,0.0004196538,0.0005566908],"domain_scores_gemma":[0.9987077,0.00062651734,0.00006583281,0.00035939825,0.00009959259,0.00014094789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006038502,0.00023016868,0.00039261536,0.00046615055,0.00020946431,0.00018038691,0.00068150513,0.00008664604,0.000015771662],"category_scores_gemma":[0.00018311231,0.0001750515,0.00007423885,0.002037898,0.00018242281,0.0005041187,0.00032378046,0.0002810762,0.000008935946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00526311,0.00014928736,0.0064551816,0.0005779867,0.0003204931,0.0012051137,0.009930859,0.009546167,0.0020199826,0.34200597,0.0019899765,0.62053585],"study_design_scores_gemma":[0.019312538,0.000177272,0.0076362407,0.00007687372,0.000008407599,0.00007371257,0.00028075944,0.047657114,0.0017795741,0.9216551,0.0008349109,0.0005074868],"about_ca_topic_score_codex":0.000030399005,"about_ca_topic_score_gemma":0.000035531546,"teacher_disagreement_score":0.6875796,"about_ca_system_score_codex":0.000014637362,"about_ca_system_score_gemma":0.00006908902,"threshold_uncertainty_score":0.7138393},"labels":[],"label_agreement":null},{"id":"W4388471823","doi":"10.1016/j.jctb.2023.10.008","title":"Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Induced subgraph; Subdivision; Bipartite graph; Discrete mathematics; Treewidth; Chordal graph; Cograph; Graph; Pathwidth; 1-planar graph; Line graph; Vertex (graph theory)","score_opus":0.017087698286873558,"score_gpt":0.27820646013842604,"score_spread":0.26111876185155247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388471823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9843213,0.00054803345,0.0031525206,0.0024551733,0.007596295,0.0002331426,0.000008379176,0.00014378635,0.001541377],"genre_scores_gemma":[0.99556136,0.00043869132,0.0035956332,0.000039264673,0.00018164518,0.000013741026,0.0000013417485,0.000022946708,0.00014537033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782825,0.00053079386,0.00052861945,0.00023552502,0.000471165,0.00040562646],"domain_scores_gemma":[0.9979729,0.0007444876,0.00023888737,0.00057417015,0.0002646671,0.00020485593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014785004,0.00017697817,0.0003399947,0.0012687896,0.0002486713,0.00015901853,0.0012079593,0.00010868109,0.00001622054],"category_scores_gemma":[0.0005037342,0.0001682008,0.00014955517,0.0026738439,0.000275659,0.0018603441,0.0003999632,0.0005755012,0.000006208588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021479589,0.000083760984,0.00039818222,0.0000101839405,0.000039613984,0.00012499047,0.0005502587,0.000027055861,0.0032611063,0.9891317,0.0003136877,0.005844667],"study_design_scores_gemma":[0.0016047801,0.00055143016,0.0039961417,0.000053557786,0.000009351082,0.00028980145,0.00033513943,0.000041604635,0.0023722767,0.9897938,0.00078988884,0.00016223585],"about_ca_topic_score_codex":0.000004044423,"about_ca_topic_score_gemma":0.0000116599995,"teacher_disagreement_score":0.0112400735,"about_ca_system_score_codex":0.000057884055,"about_ca_system_score_gemma":0.00012403619,"threshold_uncertainty_score":0.68590295},"labels":[],"label_agreement":null},{"id":"W4388473630","doi":"10.1016/j.disc.2023.113777","title":"On an f-coloring generalization of linear arboricity of multigraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Multigraph; Conjecture; Degree (music); Simple (philosophy); Generalization; Vertex (graph theory); Edge coloring; Function (biology); Discrete mathematics; Graph; Planar graph; Line graph; Graph power; Biology; Physics","score_opus":0.04239752126348623,"score_gpt":0.3394515713267526,"score_spread":0.29705405006326635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388473630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53540075,0.0000057556294,0.46391934,0.000019530695,0.000045716984,0.0001341938,0.000006440033,0.00009206841,0.00037621034],"genre_scores_gemma":[0.8798537,0.000017256847,0.12001076,0.000008978157,0.0000130334965,0.00001184676,0.0000068104737,0.000014154204,0.0000634395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885297,0.000064547894,0.00030540625,0.000189011,0.00039737293,0.00019072222],"domain_scores_gemma":[0.99879646,0.00022886189,0.00016678404,0.00063301343,0.00011811601,0.00005673505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164017,0.00009610213,0.00019439816,0.0002752365,0.00005499672,0.000013266861,0.00059868576,0.00003942913,0.000004596594],"category_scores_gemma":[0.00022584377,0.00008208509,0.00006515163,0.0011659953,0.000071748036,0.00020689101,0.0001484234,0.000075427306,0.000011086063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007682157,0.00010314633,0.00022581496,0.00017286894,0.000015345393,0.0000028640466,0.0028304502,0.012292144,0.01556699,0.9678344,0.00001379218,0.00093450886],"study_design_scores_gemma":[0.00017008418,0.0001669807,0.0004742026,0.00005904185,0.0000038795974,6.024516e-7,0.00014492392,0.68653256,0.067811035,0.24452984,0.000008465046,0.00009837098],"about_ca_topic_score_codex":0.000004937266,"about_ca_topic_score_gemma":0.0000019726463,"teacher_disagreement_score":0.72330457,"about_ca_system_score_codex":0.000010050115,"about_ca_system_score_gemma":0.00001754213,"threshold_uncertainty_score":0.33473328},"labels":[],"label_agreement":null},{"id":"W4388650663","doi":"10.48550/arxiv.2311.05719","title":"Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; Subdivision; Tree decomposition; Graph; Line graph; Vertex (graph theory); Mathematics; Distance-hereditary graph; Planar graph; Tree-depth; Discrete mathematics; 1-planar graph; Pathwidth; Graph power; Geography","score_opus":0.10192352268935731,"score_gpt":0.24007779009271785,"score_spread":0.13815426740336054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388650663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79446846,0.00004759378,0.20330305,0.00037093327,0.0003104212,0.00050205004,0.000018260029,0.00025599447,0.0007232207],"genre_scores_gemma":[0.9971437,0.0003595606,0.0018017067,0.000048233804,0.000025196896,0.00000617193,0.000013761039,0.000030751053,0.0005709303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973373,0.00023163535,0.00022927839,0.0014241525,0.00015051053,0.00062715024],"domain_scores_gemma":[0.99784094,0.00027093926,0.00014745315,0.0013288559,0.00011690621,0.00029489215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034501663,0.00034339674,0.00038879062,0.0012963943,0.00019738653,0.00015844438,0.0018488584,0.00028355623,0.000008647389],"category_scores_gemma":[0.000040589828,0.0004195773,0.00017150451,0.002017885,0.00019712035,0.0004620627,0.003260964,0.0010342331,0.00008711376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020792661,0.0006225683,0.05557582,0.00024783344,0.0002645223,0.0037376701,0.0019629418,0.1420894,0.0032905284,0.78714377,0.00033941347,0.0045176228],"study_design_scores_gemma":[0.0017198703,0.0001541976,0.06838985,0.0003326019,0.000040055216,0.0000099466915,0.0003126684,0.36540538,0.0008411023,0.5617122,0.00007053569,0.0010116154],"about_ca_topic_score_codex":0.00019117011,"about_ca_topic_score_gemma":0.00064447033,"teacher_disagreement_score":0.22543156,"about_ca_system_score_codex":0.00022292143,"about_ca_system_score_gemma":0.00019510758,"threshold_uncertainty_score":0.9998256},"labels":[],"label_agreement":null},{"id":"W4388763349","doi":"10.1007/s00012-023-00834-4","title":"Surjective polymorphisms of directed reflexive cycles","year":2023,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Champlain Regional College; University of Waterloo","funders":"","keywords":"Surjective function; Mathematics; Unary operation; Digraph; Reflexivity; Combinatorics; Property (philosophy); Discrete mathematics; Pure mathematics","score_opus":0.023771078318776527,"score_gpt":0.29066574735699496,"score_spread":0.26689466903821846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388763349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90581787,0.0002158642,0.059507437,0.0018177256,0.0005172739,0.0005246972,0.000076346005,0.0030880943,0.028434694],"genre_scores_gemma":[0.99387515,0.000060781033,0.004509971,0.000046309593,0.000022871363,0.0000048647025,0.000012822554,0.000018591376,0.0014486667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985456,0.00018268327,0.00015349484,0.00038036838,0.00036265657,0.0003752236],"domain_scores_gemma":[0.99856293,0.0004217988,0.00009007304,0.00063714484,0.00018037738,0.000107694534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028139158,0.00012870618,0.00019369734,0.000556881,0.000110149296,0.000025321799,0.0010317095,0.000060520222,0.000039042192],"category_scores_gemma":[0.000117227035,0.00012929004,0.00009441459,0.0029348747,0.00022975598,0.00059677055,0.00047170263,0.00013450405,0.00012276928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053486598,0.000043727476,0.00130436,0.000010117038,0.00009628968,0.00014220297,0.002668982,0.00009753848,0.011562804,0.9722456,0.0016879496,0.010086949],"study_design_scores_gemma":[0.0021581117,0.00063655095,0.072548576,0.00012271306,0.000037545895,0.00002899539,0.002308596,0.017297026,0.16502766,0.7332379,0.005518464,0.0010778534],"about_ca_topic_score_codex":0.00016304098,"about_ca_topic_score_gemma":0.000023981796,"teacher_disagreement_score":0.23900768,"about_ca_system_score_codex":0.00005978547,"about_ca_system_score_gemma":0.00008228142,"threshold_uncertainty_score":0.5272295},"labels":[],"label_agreement":null},{"id":"W4388850666","doi":"10.1002/jgt.23055","title":"Induced subgraphs and tree decompositions V. one neighbor in a hole","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; 1-planar graph; Mathematics; Tree-depth; Clique-sum; Partial k-tree; Tree decomposition; Vertex (graph theory); Discrete mathematics; Bounded function; Pathwidth; Chordal graph; Graph; Line graph","score_opus":0.031559004045184,"score_gpt":0.30382379051584285,"score_spread":0.2722647864706589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388850666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492087,0.00058634277,0.0479014,0.0011012114,0.00020583603,0.0001405083,0.0000027042684,0.00006596939,0.000787342],"genre_scores_gemma":[0.993001,0.0003531554,0.0064115175,0.00012323319,0.000041470033,0.0000068344552,5.5693613e-7,0.000014077904,0.000048153237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981466,0.00043970032,0.0004256175,0.0002170915,0.00040041647,0.0003705948],"domain_scores_gemma":[0.9983543,0.00076122425,0.00019861023,0.00035222218,0.00014280409,0.00019081001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991767,0.00013190141,0.0002807009,0.0020178761,0.00012995432,0.00009313912,0.00080544275,0.0000689347,0.000010193938],"category_scores_gemma":[0.00016849939,0.00011748595,0.00014381985,0.0027218782,0.00015887427,0.00074525847,0.00021163409,0.000491888,0.00001264544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019155865,0.00019111739,0.004027156,0.000017875802,0.00007843533,0.0002995819,0.0012456344,0.00009089769,0.051114287,0.89138806,0.00012588539,0.05122949],"study_design_scores_gemma":[0.0009126943,0.0003193659,0.049904875,0.00008722598,0.000008198983,0.000090170906,0.00021313256,0.00037931727,0.0026179883,0.9452761,0.000050009032,0.00014096456],"about_ca_topic_score_codex":0.0000037402542,"about_ca_topic_score_gemma":0.000023137618,"teacher_disagreement_score":0.05388798,"about_ca_system_score_codex":0.00002734904,"about_ca_system_score_gemma":0.00007129553,"threshold_uncertainty_score":0.47909382},"labels":[],"label_agreement":null},{"id":"W4388906444","doi":"10.46298/dmtcs.11478","title":"Proving exact values for the $2$-limited broadcast domination number on grid graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square (algebra); Mathematics; Square tiling; Combinatorics; Grid; Discrete mathematics; Geometry","score_opus":0.026306557541697813,"score_gpt":0.3233868965664962,"score_spread":0.2970803390247984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388906444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011742915,0.000011241297,0.98130065,0.0023339964,0.0007237916,0.0011551743,0.000012864767,0.00050787395,0.0022114746],"genre_scores_gemma":[0.7799994,0.00001527281,0.21911895,0.0003362397,0.00017704323,0.00021074332,0.0000065890795,0.00004036445,0.00009540196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995685,0.0001791968,0.00048114496,0.0009940772,0.0015761107,0.0010844733],"domain_scores_gemma":[0.9929248,0.0045824633,0.00017061798,0.0016687536,0.00039942007,0.00025395423],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.005046352,0.00034089887,0.00032035867,0.0004067439,0.0014215981,0.0011564307,0.004243841,0.00007239682,0.000026198899],"category_scores_gemma":[0.0009172102,0.00021484306,0.00022273682,0.0034919025,0.0031847402,0.0008887517,0.0014043166,0.00033547642,0.00022634007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018306953,0.00006751343,0.000011564088,0.00004634983,0.000014003678,0.0000060287853,0.0014404339,0.00048763948,0.0004042029,0.97722423,0.0002986883,0.019981043],"study_design_scores_gemma":[0.00018788784,0.00013225764,0.000114914415,0.000056495654,0.0000069722805,0.000012255213,0.000068753754,0.51117975,0.0011122186,0.4868674,0.00008578101,0.00017533824],"about_ca_topic_score_codex":8.831355e-7,"about_ca_topic_score_gemma":3.1814469e-7,"teacher_disagreement_score":0.7682565,"about_ca_system_score_codex":0.00006743138,"about_ca_system_score_gemma":0.00009991986,"threshold_uncertainty_score":0.9998805},"labels":[],"label_agreement":null},{"id":"W4389067604","doi":"10.1016/j.dam.2023.11.042","title":"Vertex-critical <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e185\" altimg=\"si23.svg\"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">+</mml:mo><mml:mi>ℓ</mml:mi><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>-free and vertex-critical (gem, co-gem)-free graphs","year":2023,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Prince Edward Island; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Clique number; Discrete mathematics","score_opus":0.019513514046064873,"score_gpt":0.264985636913285,"score_spread":0.24547212286722014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389067604","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17152205,0.0040219794,0.008789769,0.002843609,0.007193052,0.00023701153,0.0028458072,0.0014773,0.80106944],"genre_scores_gemma":[0.9537618,0.004456209,0.0150117725,0.0044716643,0.0049996814,0.007300087,0.005151418,0.004072869,0.0007744821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.96276057,0.0019915167,0.007063694,0.0073032677,0.010514916,0.010366063],"domain_scores_gemma":[0.9676624,0.0103395805,0.0055203014,0.009620259,0.00095865794,0.0058987876],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.008165802,0.003729036,0.0014561957,0.003070286,0.005917838,0.0071855104,0.012136861,0.0085957,0.7451517],"category_scores_gemma":[0.010834826,0.0078084995,0.006524046,0.006506391,0.0103627695,0.005491507,0.012225948,0.0074309423,0.007973899],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038672842,0.001040451,0.000018553246,0.004451017,0.0038861672,0.004764961,0.0036751411,0.0016088102,0.0042279297,0.48837864,0.48031235,0.003768681],"study_design_scores_gemma":[0.0067369547,0.0049452707,0.00012247778,0.004459967,0.005452338,0.0064451583,0.006053768,0.036553,0.91074204,0.0056536533,0.0057804314,0.00705491],"about_ca_topic_score_codex":0.002908201,"about_ca_topic_score_gemma":0.0040943976,"teacher_disagreement_score":0.90651417,"about_ca_system_score_codex":0.00007592288,"about_ca_system_score_gemma":0.0053708004,"threshold_uncertainty_score":0.99754304},"labels":[],"label_agreement":null},{"id":"W4389129622","doi":"10.1016/j.jctb.2023.11.005","title":"Hitting all maximum stable sets in P5-free graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Mathematics; Bounded function; Induced subgraph; Conjecture; Discrete mathematics; Graph; Vertex (graph theory); Induced path; Cardinality (data modeling); Longest path problem; Chordal graph; Computer science","score_opus":0.021601945378098928,"score_gpt":0.29157513236965915,"score_spread":0.2699731869915602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389129622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9433268,0.0010858133,0.018386204,0.0047727292,0.022484267,0.0006875432,0.000015690024,0.000511906,0.008729057],"genre_scores_gemma":[0.9916977,0.00028612252,0.0068212426,0.0001591232,0.00032515204,0.000012412913,0.0000020185917,0.000051793573,0.00064442115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966235,0.000769429,0.0007413983,0.0002780557,0.0008855832,0.00070200005],"domain_scores_gemma":[0.9972453,0.00096964935,0.0004210472,0.0008063126,0.00034102795,0.00021666837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061016,0.00021793075,0.00045750744,0.00087809365,0.00015732151,0.00020422667,0.0027300953,0.00011300344,0.00003639555],"category_scores_gemma":[0.0014274837,0.00019640838,0.00018946003,0.0021056987,0.00018114479,0.0021585145,0.00088058616,0.0007166486,0.000027803171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005007337,0.00008374595,0.00043671258,0.00002230621,0.000050689887,0.00046701526,0.0010022387,0.0002244311,0.001202735,0.99041855,0.0013077812,0.0042830794],"study_design_scores_gemma":[0.0017544071,0.00046789335,0.00044038877,0.00006776933,0.000005701451,0.00010462584,0.0004076074,0.00013298626,0.0028061273,0.9864131,0.007201367,0.00019798719],"about_ca_topic_score_codex":0.0000036508316,"about_ca_topic_score_gemma":0.0000027459441,"teacher_disagreement_score":0.048370924,"about_ca_system_score_codex":0.0001109489,"about_ca_system_score_gemma":0.00019568406,"threshold_uncertainty_score":0.80093014},"labels":[],"label_agreement":null},{"id":"W4389152900","doi":"10.4230/lipics.mfcs.2024.48","title":"Local Certification of Geometric Graph Classes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Upper and lower bounds; Graph","score_opus":0.15941040939257803,"score_gpt":0.24286886965372095,"score_spread":0.08345846026114292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389152900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07256028,0.0000727438,0.92588234,0.00008360538,0.0003410104,0.0002482207,0.000016670589,0.0003053343,0.00048981135],"genre_scores_gemma":[0.99637586,0.00035371265,0.0017494606,0.000011011761,0.000017798175,0.0000017227645,0.000015893595,0.000021595266,0.0014529573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789083,0.0002029964,0.00024875268,0.0010731932,0.00020181123,0.00038240838],"domain_scores_gemma":[0.99704146,0.00041232884,0.0002846494,0.0017516956,0.0003591207,0.00015076018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047291795,0.00022986195,0.0003185023,0.0018795273,0.000104997285,0.000051207302,0.0027811874,0.00024343652,0.00001414426],"category_scores_gemma":[0.00013163219,0.0002686542,0.00023834627,0.0050693853,0.00035447342,0.00035207736,0.0024255053,0.0005679454,0.00014732448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004247136,0.00012824374,0.003125664,0.00019333631,0.00011568834,0.00014467773,0.00008922103,0.35634717,0.000215368,0.635177,0.0003258807,0.0040952684],"study_design_scores_gemma":[0.00031125676,0.00008863716,0.008070698,0.0000878195,0.00003572687,0.0000023580626,0.00012216764,0.2504209,0.0033365672,0.7368715,0.00021296083,0.00043941452],"about_ca_topic_score_codex":0.000099955265,"about_ca_topic_score_gemma":0.00001880834,"teacher_disagreement_score":0.9241329,"about_ca_system_score_codex":0.00015245655,"about_ca_system_score_gemma":0.00018506087,"threshold_uncertainty_score":0.9999766},"labels":[],"label_agreement":null},{"id":"W4389192328","doi":"10.22215/etd/2023-15707","title":"Graph Colouring and Decomposition","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Monash University; University of Ottawa","keywords":"Treewidth; Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Discrete mathematics; Pathwidth; Wheel graph; Chromatic scale; Graph; Line graph; Graph power","score_opus":0.01831761318829731,"score_gpt":0.3450516480140816,"score_spread":0.3267340348257843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389192328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71823156,0.0009128273,0.21738617,0.00043224104,0.0026183194,0.0010980777,0.000006667143,0.0024873673,0.05682678],"genre_scores_gemma":[0.6607333,0.0018598905,0.13252975,0.00030338386,0.00027794443,0.00045352266,0.0007643617,0.0002425328,0.20283534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899316,0.000041949235,0.00012850354,0.00038000592,0.00023806955,0.0002183193],"domain_scores_gemma":[0.99937886,0.0001367617,0.00005108794,0.00028712413,0.00007107382,0.00007508514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019490159,0.00012626707,0.00013276596,0.00037527678,0.00014319395,0.00014310853,0.00044185744,0.00010364139,0.000010274148],"category_scores_gemma":[0.000022470149,0.00012295095,0.000043362274,0.0004912948,0.000019487765,0.00023797357,0.00009914427,0.00020069325,0.000079968915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006344607,0.000044691977,0.00020537728,0.00031071366,0.00008514917,0.00010452818,0.0018379001,0.000050451315,0.0073745195,0.8581359,0.0015562624,0.13023107],"study_design_scores_gemma":[0.0004566348,0.00018218994,0.02109394,0.00023610043,0.000015039282,0.000021531037,0.00069953187,0.0055141374,0.017484084,0.95300835,0.0005530099,0.00073546584],"about_ca_topic_score_codex":0.00001426248,"about_ca_topic_score_gemma":0.00013393738,"teacher_disagreement_score":0.14600855,"about_ca_system_score_codex":0.000017000611,"about_ca_system_score_gemma":0.000030268806,"threshold_uncertainty_score":0.50137943},"labels":[],"label_agreement":null},{"id":"W4389224571","doi":"10.1287/moor.2022.0335","title":"Proximity and Flatness Bounds for Linear Integer Optimization","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Polyhedron; Combinatorics; Unimodular matrix; Cutting-plane method; Integer programming; Integer (computer science); Linear programming; Linear programming relaxation; Integer points in convex polyhedra; Hyperplane; Vertex (graph theory); Polytope; Regular polygon; Discrete mathematics; Branch and price; Mathematical optimization; Computer science; Geometry","score_opus":0.13205313635593666,"score_gpt":0.4352795687934838,"score_spread":0.3032264324375471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389224571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024916226,0.000027950851,0.97263587,0.00094154396,0.000033974127,0.00089140795,0.000011173174,0.000086776236,0.00045508973],"genre_scores_gemma":[0.17102721,0.00007109307,0.82571834,0.00000872727,0.000035353416,0.0004580245,0.000020006191,0.00002425772,0.002636997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984334,0.00012478139,0.00027566933,0.00027253095,0.00055367,0.00033992226],"domain_scores_gemma":[0.9974735,0.00078583334,0.00002150228,0.00057148724,0.0010661486,0.00008157371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031272036,0.00008287509,0.00015881742,0.0005779763,0.00045347106,0.000205675,0.0006458498,0.00005768371,0.000012572021],"category_scores_gemma":[0.0016429109,0.00007250248,0.000034835342,0.0016204859,0.00026048473,0.0006178936,0.0004921997,0.00018455074,0.000020724525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009341585,0.00013296075,0.000020198207,0.00030660254,0.000019097322,0.0000015982415,0.0023934634,0.12567936,0.0030013686,0.86616707,0.00027822857,0.0019907057],"study_design_scores_gemma":[0.00019417284,0.000097002136,0.000012243781,0.000034926903,0.000001390138,0.0000029144755,0.00025904374,0.93170047,0.0040642153,0.063444495,0.00012052058,0.00006859446],"about_ca_topic_score_codex":0.0000052081245,"about_ca_topic_score_gemma":0.000009210828,"teacher_disagreement_score":0.8060211,"about_ca_system_score_codex":0.00002855337,"about_ca_system_score_gemma":0.0001322126,"threshold_uncertainty_score":0.34877786},"labels":[],"label_agreement":null},{"id":"W4389363201","doi":"10.48550/arxiv.2312.00979","title":"Recoloring some hereditary graph classes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Computer science; Geography; Theoretical computer science","score_opus":0.14564447674312617,"score_gpt":0.23506731079044713,"score_spread":0.08942283404732096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389363201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32939154,0.00023602993,0.6608685,0.0004799321,0.0040697097,0.0006876794,0.000041588122,0.0022630885,0.0019619267],"genre_scores_gemma":[0.99094236,0.00077215466,0.0030959763,0.00007734154,0.00024279814,0.000005095194,0.000018288667,0.000055362467,0.004790652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968631,0.00026635162,0.00023458991,0.0016860481,0.00020146239,0.00074841175],"domain_scores_gemma":[0.9968272,0.00047258794,0.00019044704,0.0020378658,0.00018560344,0.00028632671],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005481039,0.0003859295,0.00039940947,0.0008829628,0.00028314785,0.00015414401,0.0038941256,0.00033704992,0.00001909239],"category_scores_gemma":[0.00011269053,0.00046560616,0.00033080086,0.0015976155,0.00023433479,0.0010661555,0.0058121365,0.0012361658,0.00047993468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045163026,0.000087780216,0.0029962002,0.00015636165,0.00019604927,0.0032875012,0.00013186701,0.17366746,0.000066801804,0.8169521,0.0014461271,0.00096660515],"study_design_scores_gemma":[0.00029620243,0.00006728334,0.0021543147,0.00011146466,0.000023372828,0.000007124676,0.00009499585,0.06852155,0.00022800986,0.9274479,0.00049369776,0.0005540537],"about_ca_topic_score_codex":0.00008164297,"about_ca_topic_score_gemma":0.000057598598,"teacher_disagreement_score":0.66155076,"about_ca_system_score_codex":0.00025590687,"about_ca_system_score_gemma":0.0002571434,"threshold_uncertainty_score":0.9997796},"labels":[],"label_agreement":null},{"id":"W4389482197","doi":"10.1007/978-3-031-49190-0_9","title":"Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Oracle; Turing machine; Combinatorics; Time complexity; Computer science; Discrete mathematics; Polynomial; Mathematics; Algorithm","score_opus":0.033529423076539416,"score_gpt":0.28663770938035055,"score_spread":0.2531082863038111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389482197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022255667,0.00049422274,0.9938446,0.00080532226,0.0021857964,0.001633543,0.0000780021,0.00053608854,0.00019984842],"genre_scores_gemma":[0.07591718,0.00028314124,0.91677994,0.0016722829,0.0010666021,0.0004914307,0.00008880656,0.00031847705,0.0033821312],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99368364,0.000086222,0.00076366204,0.002536488,0.001384269,0.0015457392],"domain_scores_gemma":[0.995085,0.0017925048,0.0003731767,0.002108983,0.00024781097,0.0003925196],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014468038,0.0007859545,0.0008825185,0.0015241959,0.00069457456,0.00078845373,0.006036965,0.0003737637,0.0000069549837],"category_scores_gemma":[0.00023195773,0.0007182911,0.00035424152,0.0011014789,0.0012776993,0.0011251395,0.0027185888,0.0012085949,0.000038349095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011365838,0.00017254891,0.00003307531,0.0003817676,0.00012304794,0.00014801165,0.0010802584,0.19489937,0.024929168,0.058144007,0.0011240672,0.71885103],"study_design_scores_gemma":[0.000772488,0.0002772988,0.000015153535,0.00046859027,0.000008386694,0.000025897272,1.4115676e-7,0.36672217,0.005426951,0.62305313,0.0023382206,0.0008915589],"about_ca_topic_score_codex":0.000015572294,"about_ca_topic_score_gemma":0.00001705227,"teacher_disagreement_score":0.71795946,"about_ca_system_score_codex":0.00024161284,"about_ca_system_score_gemma":0.000399013,"threshold_uncertainty_score":0.9995268},"labels":[],"label_agreement":null},{"id":"W4389482199","doi":"10.1007/978-3-031-49190-0_13","title":"Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Parameterized complexity; Combinatorics; Vertex (graph theory); Feedback vertex set; Computer science; Degree (music); Neighbourhood (mathematics); Discrete mathematics; Graph; Pathwidth; Mathematics; Algorithm; Line graph; Physics","score_opus":0.05257799256211758,"score_gpt":0.30604118313786904,"score_spread":0.25346319057575145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389482199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088734436,0.00016376805,0.99458957,0.0006837044,0.0018461177,0.0011827815,0.000024035908,0.00031781316,0.0003048929],"genre_scores_gemma":[0.020711318,0.00026884186,0.97439253,0.0027394837,0.00024321362,0.00018456424,0.000032469467,0.00014883526,0.0012787554],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948194,0.00009388234,0.0005479761,0.0022749752,0.0011819302,0.001081842],"domain_scores_gemma":[0.9958172,0.0018833063,0.00023731815,0.0014587402,0.0003129155,0.00029055832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016148109,0.0006774517,0.0006706304,0.0019218698,0.0004667677,0.0006051903,0.0027162202,0.00040101886,0.0000043212913],"category_scores_gemma":[0.00023213385,0.00060552673,0.00024807695,0.0011204353,0.001164716,0.00057787943,0.0012745368,0.0008596684,0.00002744957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007569662,0.000025098869,0.000017448316,0.000054006676,0.000025749669,0.00003798458,0.00021954972,0.005641418,0.00028086387,0.22816694,0.000045739696,0.7654095],"study_design_scores_gemma":[0.0006047568,0.00045444348,0.00008390347,0.00016089636,0.0000060750303,0.00003096569,9.7461154e-8,0.379209,0.00046099024,0.61824715,0.00026693885,0.00047480417],"about_ca_topic_score_codex":0.000011040767,"about_ca_topic_score_gemma":0.000037874524,"teacher_disagreement_score":0.7649347,"about_ca_system_score_codex":0.00016058181,"about_ca_system_score_gemma":0.00021406899,"threshold_uncertainty_score":0.99963963},"labels":[],"label_agreement":null},{"id":"W4389482327","doi":"10.1007/978-3-031-49190-0_14","title":"Sum-of-Local-Effects Data Structures for Separable Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Graph; Separable space; Distance; Mathematics; Computer science; Discrete mathematics; Shortest path problem","score_opus":0.04905899834068726,"score_gpt":0.33177045157629137,"score_spread":0.2827114532356041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389482327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003892621,0.00066524785,0.99515474,0.00020101904,0.0020069599,0.0010842424,0.00008083468,0.00024563962,0.00052239327],"genre_scores_gemma":[0.068804905,0.00019218514,0.92859495,0.00062592665,0.00038350027,0.000066650195,0.000093578354,0.00015772475,0.0010806009],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943296,0.00006856692,0.0006169525,0.0024795174,0.0014152584,0.0010901407],"domain_scores_gemma":[0.9911154,0.0034042767,0.00035058567,0.0044998717,0.00040052284,0.00022932419],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019218448,0.0006032031,0.0008122333,0.0015915342,0.0003191908,0.00031415067,0.011702482,0.00035792345,0.000006301221],"category_scores_gemma":[0.00040725863,0.0005413223,0.00018551438,0.0015944156,0.0017908234,0.00096254924,0.005109735,0.0008309424,0.000020049449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021933041,0.000018599087,0.000019839306,0.00028345516,0.00003332109,0.000056912522,0.0001763648,0.02782175,0.00027377447,0.39750805,0.00012503183,0.57366097],"study_design_scores_gemma":[0.00027023273,0.00019711156,0.0000500999,0.00026258617,0.000008646981,0.000016334108,1.6915722e-7,0.2520166,0.0041908603,0.74180263,0.000743711,0.00044100263],"about_ca_topic_score_codex":0.000023241926,"about_ca_topic_score_gemma":0.00009523151,"teacher_disagreement_score":0.57321995,"about_ca_system_score_codex":0.00012998715,"about_ca_system_score_gemma":0.0006804393,"threshold_uncertainty_score":0.9997038},"labels":[],"label_agreement":null},{"id":"W4389678620","doi":"10.1016/j.disc.2023.113829","title":"Comparability digraphs: An analogue of comparability graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Comparability; Digraph; Mathematics; Lemma (botany); Combinatorics; Comparability graph; Discrete mathematics; Cograph; Graph; Chordal graph; 1-planar graph","score_opus":0.06293062498048756,"score_gpt":0.3512163822837604,"score_spread":0.2882857573032728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389678620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7650313,0.000032077125,0.23234537,0.00015395597,0.00009586814,0.00046039082,0.00005126157,0.0005120657,0.001317717],"genre_scores_gemma":[0.9559236,0.000010840315,0.04390719,0.000017596525,0.000009126008,0.00003417884,0.000039894203,0.000017789656,0.00003974381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997205,0.0002921723,0.00069106015,0.0005650988,0.00070774776,0.0005388745],"domain_scores_gemma":[0.9963754,0.000711334,0.0002262116,0.00223913,0.00021901375,0.00022891912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018816823,0.00024147105,0.00055652024,0.00036576213,0.00016061998,0.0000839348,0.0019142978,0.00007413149,0.000017139639],"category_scores_gemma":[0.00026381572,0.0002047958,0.00023191924,0.0025460345,0.00058838434,0.00059111544,0.0004850709,0.0002345229,0.000088794855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014311909,0.00034892696,0.007912397,0.00031538436,0.00004150906,0.0000072992752,0.0034826554,0.00059434323,0.0008970548,0.98518085,0.0001107245,0.0010945604],"study_design_scores_gemma":[0.00023513714,0.00013492974,0.015879914,0.000033222244,0.000008230586,0.0000044545445,0.00058809604,0.12608686,0.001531288,0.85522497,0.000049168284,0.00022372679],"about_ca_topic_score_codex":0.000011847383,"about_ca_topic_score_gemma":0.000021428814,"teacher_disagreement_score":0.19089235,"about_ca_system_score_codex":0.000025879513,"about_ca_system_score_gemma":0.000048181784,"threshold_uncertainty_score":0.835133},"labels":[],"label_agreement":null},{"id":"W4389899308","doi":"10.1016/j.ejc.2023.103908","title":"Reconfiguration of vertex colouring and forbidden induced subgraphs","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Induced subgraph; Bound graph; Graph power; Discrete mathematics; Line graph","score_opus":0.03411597351799357,"score_gpt":0.2729934213049364,"score_spread":0.23887744778694286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389899308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9798328,0.00013850832,0.016057935,0.0002484863,0.00056705694,0.00006831474,4.9249564e-7,0.000036703917,0.0030496966],"genre_scores_gemma":[0.9990423,0.0001528814,0.00066824956,0.000014342586,0.000018879306,2.8640963e-7,2.590712e-7,0.0000129638,0.0000898812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857825,0.00038636016,0.00038292605,0.00011853542,0.00035645114,0.00017748824],"domain_scores_gemma":[0.99879396,0.00022219941,0.00032467913,0.00022970566,0.00031708647,0.00011237278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020791667,0.00008101767,0.00017202519,0.00043342603,0.00007713411,0.000057725236,0.0006486357,0.000017206496,0.0000022600864],"category_scores_gemma":[0.0002820137,0.00007461187,0.000059131162,0.0010045837,0.000042771833,0.00046238894,0.0001752575,0.00024284997,0.000011303063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109065506,0.00014874747,0.005802916,0.0001020902,0.000117206444,0.00086272793,0.0030142693,0.00012040427,0.055338062,0.84131855,0.0017057145,0.09136023],"study_design_scores_gemma":[0.005467895,0.004796543,0.19288026,0.00044115368,0.00003662723,0.0005364577,0.0006641218,0.0064555355,0.060597572,0.7233993,0.004048113,0.00067643943],"about_ca_topic_score_codex":3.5207293e-7,"about_ca_topic_score_gemma":1.5556193e-7,"teacher_disagreement_score":0.18707733,"about_ca_system_score_codex":0.000019915327,"about_ca_system_score_gemma":0.000046747875,"threshold_uncertainty_score":0.30425838},"labels":[],"label_agreement":null},{"id":"W4390018095","doi":"10.1137/1.9781611977806.ch10","title":"Chapter 10: Normal Cones","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Cone (formal languages); Combinatorics; Dual cone and polar cone; Convex cone; Mathematics; Regular polygon; Geometry; Convex set; Convex optimization; Algorithm","score_opus":0.10414404048757395,"score_gpt":0.27998350114644727,"score_spread":0.17583946065887332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390018095","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050478593,0.00005586027,0.060976755,0.00022675816,0.0004444403,0.00259651,0.00019480514,0.00058944453,0.93486494],"genre_scores_gemma":[0.0002346934,0.00004559304,0.050422344,0.00013798685,0.000764212,0.00027420773,0.000033716806,0.00016947249,0.94791776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785334,0.0000034623333,0.00050858903,0.00063199294,0.00049024116,0.00051235687],"domain_scores_gemma":[0.9982033,0.000564401,0.00031455694,0.0006231743,0.00010936788,0.00018520265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006884724,0.0004722884,0.000625037,0.00009087713,0.0003763544,0.00019051727,0.00077904406,0.0007279756,0.000047030597],"category_scores_gemma":[0.000024520283,0.00042787677,0.0005388681,0.000033553108,0.00039999833,0.00006677531,0.0007197417,0.000655183,0.000107404325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018202887,0.0000081673625,2.1845175e-8,0.00013714541,0.00017333677,0.0000015772548,0.000635925,0.0000015595626,0.00012370058,0.97196007,0.0024265477,0.024513736],"study_design_scores_gemma":[0.001017609,0.00009724132,2.428547e-8,0.00012428923,0.00006006607,0.000006316513,0.000101073936,0.00050520926,0.0006052806,0.90849644,0.088488646,0.00049778656],"about_ca_topic_score_codex":5.298629e-7,"about_ca_topic_score_gemma":8.590227e-7,"teacher_disagreement_score":0.086062096,"about_ca_system_score_codex":0.000033625372,"about_ca_system_score_gemma":0.000094415744,"threshold_uncertainty_score":0.9998173},"labels":[],"label_agreement":null},{"id":"W4390075896","doi":"10.5840/cpsem20227","title":"Intentionally Going Through Percolations of Mazes","year":2022,"lang":"en","type":"book-chapter","venue":"Semiotics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.041488461351376994,"score_gpt":0.29939055137865433,"score_spread":0.2579020900272773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390075896","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015949026,0.0005218938,0.29429743,0.0004722907,0.00040551368,0.00023600494,0.00006376874,0.00009784412,0.7038893],"genre_scores_gemma":[0.006270263,0.0008174437,0.21545671,0.00029552687,0.0001440795,0.000011902909,0.00009076477,0.00008880131,0.77682453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983929,0.000039033523,0.00034713544,0.0003665085,0.00064132974,0.0002130892],"domain_scores_gemma":[0.99836236,0.00037627964,0.00021079996,0.00077305804,0.00022872144,0.00004875025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028820027,0.00018124125,0.00026135854,0.00019007994,0.00015680712,0.00003457797,0.0011825997,0.00010775853,0.0007086473],"category_scores_gemma":[0.000098053526,0.0001968024,0.00019029749,0.00012547681,0.00012953265,0.0003121228,0.0010237229,0.00056297245,0.00006128805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032239252,0.000013305608,0.000021321457,0.00003634761,0.000043792046,0.000008033486,0.00022855242,0.00034153374,0.000061029048,0.9974048,0.0007469697,0.0010910506],"study_design_scores_gemma":[0.00008440921,0.00007080103,0.000024381361,0.00008573536,0.000013622067,0.000014950071,0.000017871987,0.0017729072,0.00004480636,0.8031686,0.19450705,0.00019488469],"about_ca_topic_score_codex":0.000002503467,"about_ca_topic_score_gemma":0.000005715628,"teacher_disagreement_score":0.19423626,"about_ca_system_score_codex":0.00011496488,"about_ca_system_score_gemma":0.00017417633,"threshold_uncertainty_score":0.8025369},"labels":[],"label_agreement":null},{"id":"W4390098013","doi":"10.1109/focs57990.2023.00109","title":"Testing Graph Properties with the Container Method","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Induced subgraph; Mathematics; Clique; Split graph; Graph; Discrete mathematics; Property testing; Induced subgraph isomorphism problem; Chordal graph; Line graph; 1-planar graph; Vertex (graph theory)","score_opus":0.08386699813099939,"score_gpt":0.32629457350167634,"score_spread":0.24242757537067694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390098013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008099763,0.00003040146,0.98005193,0.003847081,0.000034090248,0.00020766185,1.8763107e-7,0.0006218856,0.0071069943],"genre_scores_gemma":[0.52243155,0.0000023878135,0.46941337,0.00072552875,0.000035343404,0.00011726595,3.1480442e-7,0.00001812588,0.0072561335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989528,0.0001517438,0.00007061651,0.0002372937,0.00028107848,0.00030645667],"domain_scores_gemma":[0.9987733,0.0005595952,0.000021919945,0.0004699378,0.00013083509,0.000044448356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009223858,0.00007913688,0.00007825253,0.000112898735,0.00023577678,0.00011783633,0.00084971235,0.000013856592,0.0000048002053],"category_scores_gemma":[0.00014027813,0.000034139484,0.000021609118,0.002183136,0.00010619513,0.00026940907,0.0003006935,0.00012494961,0.0000620516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003465852,0.00002341782,0.0034024466,0.000027582415,0.000054657085,0.00007123642,0.001526646,0.0037663595,0.025458395,0.79539275,0.0030895423,0.1671523],"study_design_scores_gemma":[0.0011974084,0.00085687207,0.01541169,0.00010576534,0.000013726771,0.00017993011,0.003073441,0.519091,0.053688705,0.39414865,0.011324599,0.0009082025],"about_ca_topic_score_codex":0.000021090756,"about_ca_topic_score_gemma":0.000009626842,"teacher_disagreement_score":0.51532465,"about_ca_system_score_codex":0.000007091342,"about_ca_system_score_gemma":0.000038533013,"threshold_uncertainty_score":0.18134283},"labels":[],"label_agreement":null},{"id":"W4390214413","doi":"10.48550/arxiv.2312.14295","title":"On Separating Path and Tree Systems in Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; National Science Foundation","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Path (computing); Tree (set theory); Graph; Pathwidth; Discrete mathematics; Computer science; Line graph","score_opus":0.10675457928508525,"score_gpt":0.23460405408787643,"score_spread":0.12784947480279119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390214413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82548386,0.00015766083,0.17074677,0.000052745447,0.0005627045,0.0005705283,0.000014756829,0.0003920276,0.0020189185],"genre_scores_gemma":[0.998156,0.00021216134,0.00036392218,0.000017889986,0.00001642658,0.0000031521488,0.0000045073302,0.000020356592,0.001205544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775934,0.0003073961,0.00018448499,0.0011905889,0.00013467169,0.00042349068],"domain_scores_gemma":[0.99814653,0.00046386034,0.00013802246,0.001036525,0.000068345005,0.00014668854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004606476,0.00025640248,0.0003186026,0.0007864911,0.000121019526,0.00014587515,0.0013190429,0.00019693942,0.0000015605638],"category_scores_gemma":[0.00007735111,0.00028963154,0.00009094685,0.0011829644,0.00011818634,0.0002674978,0.001937934,0.0007578362,0.000054532724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023024224,0.000029683299,0.003139412,0.00007994313,0.000021850336,0.00071036216,0.00018393491,0.18120109,0.000026688092,0.8141196,0.00005647429,0.00040794822],"study_design_scores_gemma":[0.00033925474,0.000069208065,0.0022963227,0.00023816156,0.00000530011,0.000002907245,0.00011131942,0.49936238,0.000014377726,0.49725857,0.000024117633,0.00027807485],"about_ca_topic_score_codex":0.00018813778,"about_ca_topic_score_gemma":0.00008687573,"teacher_disagreement_score":0.3181613,"about_ca_system_score_codex":0.00013609664,"about_ca_system_score_gemma":0.000083256054,"threshold_uncertainty_score":0.9999556},"labels":[],"label_agreement":null},{"id":"W4390238367","doi":"10.1016/j.dam.2023.12.003","title":"Induced forests in some distance-regular graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Regina; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Upper and lower bounds; Order (exchange); Graph; Discrete mathematics","score_opus":0.028890506300846216,"score_gpt":0.29864886284332104,"score_spread":0.2697583565424748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390238367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49592826,0.00006602241,0.49384606,0.0005487297,0.00018227095,0.0012429467,0.0000121642415,0.0010296581,0.0071439054],"genre_scores_gemma":[0.9639697,0.000024655938,0.035428185,0.00006014248,0.000024717707,0.00026763542,0.000012889475,0.000043875938,0.00016818092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775743,0.000029085228,0.00041444178,0.00049094175,0.0006017265,0.0007063585],"domain_scores_gemma":[0.99828875,0.00027077913,0.00011366615,0.001155472,0.000032349064,0.00013897305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006924513,0.00023686617,0.00032766483,0.00048024885,0.00011779243,0.000119924916,0.0013855454,0.00009508946,0.000006216068],"category_scores_gemma":[0.00007045803,0.0002115265,0.00008812529,0.0022266733,0.00010858418,0.0003962031,0.00055924436,0.00027578062,0.0002853555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005986862,0.000041837025,0.000079204576,0.00008687604,0.000010706,0.000030096564,0.0011586146,0.00013490004,0.006348471,0.98925275,0.00009868541,0.0027518694],"study_design_scores_gemma":[0.00042732153,0.000023590179,0.00080975186,0.00004303755,0.0000026700027,0.0000024122244,0.0002828689,0.02151463,0.0051476313,0.971356,0.0001296589,0.0002604307],"about_ca_topic_score_codex":0.0000020287266,"about_ca_topic_score_gemma":0.000021629705,"teacher_disagreement_score":0.46804148,"about_ca_system_score_codex":0.000049487706,"about_ca_system_score_gemma":0.000041471507,"threshold_uncertainty_score":0.86258},"labels":[],"label_agreement":null},{"id":"W4390545157","doi":"10.1007/978-3-031-30488-0_8","title":"An Addendum to Trees","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Addendum; Notation; Binary tree; Simple (philosophy); Combinatorics; Mathematics; Conjecture; Weight-balanced tree; Graph theory; Binary number; Function (biology); Graph; Binary expression tree; Discrete mathematics; Computer science; Arithmetic; Binary search tree","score_opus":0.02637404452301958,"score_gpt":0.2987445835412294,"score_spread":0.27237053901820985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390545157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000052960704,0.00042325238,0.8682945,0.00027053867,0.00019961483,0.00039685183,0.0007606776,0.00019734525,0.12945193],"genre_scores_gemma":[0.0016668653,0.0003149822,0.84944504,0.00032864197,0.0003323792,0.000067372595,0.000018188362,0.0001977711,0.14762875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782604,0.000026138157,0.00037259178,0.0007412284,0.00065695686,0.00037703587],"domain_scores_gemma":[0.99669,0.0016342185,0.00011435275,0.0011378345,0.0001097817,0.00031381688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003371448,0.0004849845,0.00054076145,0.00047976532,0.00015752982,0.00049197965,0.0009729245,0.00021261448,0.0001681596],"category_scores_gemma":[0.0003030982,0.0003935259,0.00008093631,0.00008434945,0.00012324938,0.000071950635,0.00024942675,0.00046792644,0.0003561001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070780825,0.000028563278,5.56378e-8,0.00019393263,0.000069817674,0.0000937206,0.00043478722,0.000049189373,0.00006506695,0.92472935,0.005361983,0.06896647],"study_design_scores_gemma":[0.000031852996,0.0002818383,0.0000010079741,0.0003923568,0.00005060596,0.000012379753,0.000012970181,0.011391852,0.0002862312,0.96088594,0.026205981,0.00044697477],"about_ca_topic_score_codex":0.0000015031486,"about_ca_topic_score_gemma":0.00003545994,"teacher_disagreement_score":0.068519495,"about_ca_system_score_codex":0.00005314529,"about_ca_system_score_gemma":0.000063444604,"threshold_uncertainty_score":0.99985164},"labels":[],"label_agreement":null},{"id":"W4390575946","doi":"10.1137/1.9781611977912.46","title":"Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Random graph; Chordal graph; Indifference graph; Random regular graph; Mathematics; Combinatorics; Pathwidth; Maximal independent set; Embedding; 1-planar graph; Discrete mathematics; Logarithm; Graph; Line graph; Computer science","score_opus":0.045822696444820246,"score_gpt":0.289255121712687,"score_spread":0.2434324252678668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390575946","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023742624,0.0016659636,0.048313614,0.0006780111,0.0010684747,0.017275557,0.0014117535,0.00048378584,0.9053602],"genre_scores_gemma":[0.15572986,0.0014191328,0.27310556,0.00069495186,0.0009033028,0.0025304428,0.00014314306,0.0009501647,0.56452346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781245,0.000009332144,0.0008184217,0.0005044254,0.00051595573,0.0003393947],"domain_scores_gemma":[0.9978582,0.0008860035,0.0004977211,0.0005643386,0.0001252413,0.00006849642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008675021,0.0004002756,0.0008655932,0.00013741016,0.00012522371,0.00008051865,0.0008781394,0.0005841823,0.000018842546],"category_scores_gemma":[0.000026272135,0.0002856084,0.0006291961,0.00016783083,0.00077867374,0.00004812505,0.00046309285,0.00079031737,0.0000024749143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055172957,0.000023750512,7.5907855e-7,0.00039620762,0.00030130317,6.5782785e-7,0.0061400346,0.000002668599,0.0005086676,0.9881563,0.0010624352,0.003352051],"study_design_scores_gemma":[0.0019459561,0.000049378523,6.239559e-8,0.00043811125,0.00009482454,0.000005443647,0.00088011427,0.00055515056,0.0038971484,0.98962295,0.0022383053,0.00027255784],"about_ca_topic_score_codex":0.0000056494887,"about_ca_topic_score_gemma":0.0000024924605,"teacher_disagreement_score":0.34083676,"about_ca_system_score_codex":0.000028020102,"about_ca_system_score_gemma":0.000116491705,"threshold_uncertainty_score":0.9999596},"labels":[],"label_agreement":null},{"id":"W4390681216","doi":"10.1007/978-3-031-49275-4_1","title":"Cops and Robbers on 1-Planar Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Manitoba","funders":"","keywords":"Planar graph; Planar; Pathwidth; Combinatorics; 1-planar graph; Outerplanar graph; Chordal graph; Planar straight-line graph; Computer science; Indifference graph; Mathematics; Book embedding; Graph; Discrete mathematics; Line graph; Computer graphics (images)","score_opus":0.024908045172357517,"score_gpt":0.2772720050297431,"score_spread":0.2523639598573856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390681216","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010311267,0.0002151511,0.99168193,0.000979852,0.0012343993,0.000403676,0.000007286121,0.0003357947,0.00503879],"genre_scores_gemma":[0.17797028,0.0011299952,0.80237424,0.008423196,0.0009281502,0.00008048629,0.000027878015,0.00036614167,0.008699606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954859,0.00005521662,0.000367773,0.0019102498,0.0013016898,0.0008791496],"domain_scores_gemma":[0.9965805,0.0012535643,0.00015977188,0.0015618984,0.00015806599,0.00028623658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011788114,0.00052743196,0.00048706646,0.0017841214,0.00035622728,0.00047186553,0.0033238714,0.00027796082,0.000009651894],"category_scores_gemma":[0.00014495077,0.00047545752,0.00010592696,0.0012434446,0.0013945919,0.0004735552,0.001198337,0.0011577683,0.00013608746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012873094,0.0000139453205,0.000046415782,0.000027146216,0.000013554456,0.00027028105,0.00036627374,0.007091413,0.00009359034,0.5545599,0.000054872326,0.43744975],"study_design_scores_gemma":[0.00023730085,0.00031142175,0.00014852523,0.0003038487,0.0000032845705,0.000057868,1.9322528e-7,0.062086668,0.00042053385,0.9349821,0.00086955895,0.0005787061],"about_ca_topic_score_codex":0.000010888849,"about_ca_topic_score_gemma":0.00006240751,"teacher_disagreement_score":0.43687105,"about_ca_system_score_codex":0.0001571693,"about_ca_system_score_gemma":0.0002626008,"threshold_uncertainty_score":0.9997697},"labels":[],"label_agreement":null},{"id":"W4390761431","doi":"10.1007/978-3-031-49272-3_19","title":"Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Interval graph; Mathematics; Conjecture; Line graph; Intersection graph; Pathwidth; Discrete mathematics; Block graph; Graph; Complement (music); Interval (graph theory)","score_opus":0.03456102144668092,"score_gpt":0.3022580983892588,"score_spread":0.2676970769425779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390761431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010172869,0.00038565346,0.9958534,0.0012028033,0.0004291633,0.00054053694,0.000011205102,0.00007886201,0.00048108777],"genre_scores_gemma":[0.76958877,0.00064326474,0.22763719,0.0014110436,0.00015543097,0.000026249818,0.0000057794964,0.00006992134,0.0004623224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692553,0.000108824206,0.00048692554,0.0010882939,0.0008709785,0.0005194471],"domain_scores_gemma":[0.9967213,0.0016050311,0.00026116936,0.0010725823,0.0002095155,0.00013037291],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002062023,0.00036804372,0.0005746222,0.00078686175,0.0002482106,0.00026637764,0.0024428824,0.00012399806,0.000005320618],"category_scores_gemma":[0.0001942429,0.00025949406,0.0001008682,0.0007273361,0.0039369995,0.00038100022,0.0035866664,0.0006712491,0.000004638811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006865115,0.000024440727,0.00020445579,0.00013538323,0.000052507523,0.000047794678,0.0021852984,0.0016520905,0.00015972723,0.5225537,0.000011426132,0.47290456],"study_design_scores_gemma":[0.000798889,0.00020002121,0.00027222285,0.00029061423,0.0000073737783,0.00003427392,0.0000011579606,0.1670046,0.0003111904,0.8306671,0.00012765228,0.00028489612],"about_ca_topic_score_codex":0.00004062008,"about_ca_topic_score_gemma":0.00012156716,"teacher_disagreement_score":0.7685715,"about_ca_system_score_codex":0.00004382984,"about_ca_system_score_gemma":0.00011538472,"threshold_uncertainty_score":0.99998575},"labels":[],"label_agreement":null},{"id":"W4390923673","doi":"10.22457/apam.v28n1a02913","title":"Common Minimal Common Neighborhood Dominating Symmetric n-Sigraphs","year":2023,"lang":"en","type":"article","venue":"Annals of Pure and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.057692848681984356,"score_gpt":0.3369124050235708,"score_spread":0.2792195563415864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390923673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86618614,0.00084398483,0.08383992,0.0021817717,0.00011736637,0.0010435472,0.000028678727,0.0006125071,0.045146104],"genre_scores_gemma":[0.9754493,0.00017521309,0.024090575,0.00013746774,0.000023744395,0.00003232547,0.0000044858843,0.000019597548,0.00006726899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983953,0.000033101893,0.0004245878,0.0002863446,0.0004338076,0.00042685404],"domain_scores_gemma":[0.9981184,0.0008970163,0.0002196663,0.0005593454,0.00008377994,0.000121776764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009883844,0.00018097999,0.0004098235,0.00049838214,0.0001484348,0.00008216471,0.0007450708,0.000082655555,0.000004283747],"category_scores_gemma":[0.000082751154,0.00015915924,0.000085321975,0.00206426,0.000121922785,0.00017802852,0.0004940137,0.00019714702,0.00003072233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007930248,0.00011135504,0.00011527386,0.00024865262,0.000031992768,0.000008669879,0.0012037925,0.000020412479,0.002539863,0.93607515,0.0006949427,0.058941953],"study_design_scores_gemma":[0.00032362083,0.00013845014,0.0005497742,0.00007351499,0.000009665899,0.000009996823,0.00074627704,0.015051524,0.02534685,0.95735675,0.00015904092,0.0002345539],"about_ca_topic_score_codex":0.0000012181325,"about_ca_topic_score_gemma":0.0000020574657,"teacher_disagreement_score":0.109263204,"about_ca_system_score_codex":0.0000033365502,"about_ca_system_score_gemma":0.000016917473,"threshold_uncertainty_score":0.64903253},"labels":[],"label_agreement":null},{"id":"W4391123222","doi":"10.1016/j.dam.2024.01.017","title":"A note on the minimum size of matching-saturated graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Xi’an Jiaotong University; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Graph; Complement (music); Matching (statistics); Discrete mathematics; Statistics","score_opus":0.018700145839186038,"score_gpt":0.2922533596073705,"score_spread":0.2735532137681844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391123222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070914485,0.00017465127,0.8837072,0.0021880048,0.0002668178,0.0010911543,0.000028346722,0.00057636807,0.041052964],"genre_scores_gemma":[0.9216675,0.000018048426,0.077739775,0.00015955667,0.000020814547,0.00007681924,0.0000019979102,0.000034915065,0.00028053098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983205,0.0000400226,0.00036037495,0.0003627765,0.0005726905,0.00034362834],"domain_scores_gemma":[0.9962471,0.0024900958,0.000098887904,0.0010450529,0.00004817373,0.00007068307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067542156,0.00021543581,0.00025148736,0.00012842061,0.00011557397,0.0001882748,0.0012864163,0.00006814885,0.00003350922],"category_scores_gemma":[0.0001224508,0.00012864824,0.00013332046,0.0010289081,0.00018735143,0.0001275798,0.00030599046,0.00035710653,0.00014684447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010331991,0.000036554422,1.7582319e-7,0.00017368482,0.000034808392,0.000008689527,0.0030834517,0.000053560987,0.031785652,0.96291196,0.00025468416,0.0016464468],"study_design_scores_gemma":[0.000105402316,0.00004701698,0.000006894919,0.00014028414,0.000011198025,0.0000065068816,0.00032075332,0.021569349,0.0233317,0.95401174,0.00028522857,0.00016390844],"about_ca_topic_score_codex":0.00000130193,"about_ca_topic_score_gemma":8.638639e-7,"teacher_disagreement_score":0.85075307,"about_ca_system_score_codex":0.000022530523,"about_ca_system_score_gemma":0.000053084972,"threshold_uncertainty_score":0.5246123},"labels":[],"label_agreement":null},{"id":"W4391127430","doi":"10.61091/ars157-11","title":"Independent Fixed Connected Geodetic Number of a Graph","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Combinatorics; Geodesy; Geography","score_opus":0.018683842477843642,"score_gpt":0.2954436813489655,"score_spread":0.2767598388711218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932544,0.000033819655,0.00258071,0.0002389132,0.0011027904,0.0002451463,0.000004283878,0.00043928245,0.0021006071],"genre_scores_gemma":[0.99844027,0.000020241907,0.0010698923,0.000034554803,0.0000029549053,0.000035597248,0.000004928976,0.00001745858,0.0003741149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998057,0.00018259905,0.0002774187,0.0004034229,0.0006082123,0.00047132667],"domain_scores_gemma":[0.9982357,0.0004298573,0.00010051692,0.0008800296,0.00021749217,0.00013638465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058747095,0.00014581069,0.00023787122,0.00026963273,0.00010484704,0.000046368707,0.0012493456,0.00008188313,0.000059427337],"category_scores_gemma":[0.00022028983,0.000145539,0.00010007969,0.002579186,0.00012654874,0.00029227565,0.00058764446,0.00022907418,0.0004847822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013250379,0.00007119983,0.007435694,0.000018115605,0.00002915536,0.00004406696,0.00030602884,0.000028360097,0.0019121456,0.9884721,0.0006476636,0.0010222141],"study_design_scores_gemma":[0.000840995,0.00006995323,0.013881239,0.000021080192,0.000003591174,0.000011746278,0.00004517918,0.0021140326,0.0057778237,0.97688025,0.00019025237,0.0001638644],"about_ca_topic_score_codex":0.000021560845,"about_ca_topic_score_gemma":0.000002839556,"teacher_disagreement_score":0.011591863,"about_ca_system_score_codex":0.0000311583,"about_ca_system_score_gemma":0.000072633586,"threshold_uncertainty_score":0.62310565},"labels":[],"label_agreement":null},{"id":"W4391127506","doi":"10.61091/ars157-12","title":"Broadcast Domination in Line Graphs of Trees","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line (geometry); Combinatorics; Geometry","score_opus":0.021494279347316576,"score_gpt":0.30032992707406947,"score_spread":0.2788356477267529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964194,0.00008756628,0.0013264363,0.00032848393,0.00061198615,0.00017963648,0.0000019542947,0.00015134604,0.00089316815],"genre_scores_gemma":[0.99884653,0.00004800603,0.000864094,0.000012515494,0.0000019233667,0.000020206284,0.0000037400812,0.000008619058,0.00019436014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878997,0.000115550094,0.00023023825,0.00025819824,0.0003335346,0.00027249937],"domain_scores_gemma":[0.9990324,0.00027971886,0.00006743872,0.00046634965,0.00010063386,0.000053498366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006836874,0.00008898417,0.00016002479,0.0006017042,0.000042655804,0.000023935609,0.00073772244,0.000048174035,0.0000053855642],"category_scores_gemma":[0.00016786275,0.00008983454,0.000050962284,0.0029292125,0.000078361394,0.00036331118,0.0002642405,0.00013673342,0.000052073035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117027075,0.000071196555,0.0036789677,0.00001060467,0.0000048725083,0.000018922074,0.0003821431,0.00013012026,0.0032481598,0.97507846,0.00015550114,0.017209347],"study_design_scores_gemma":[0.0007526994,0.000112382215,0.022540264,0.000022979784,8.6657207e-7,0.00000146976,0.000040419105,0.008692209,0.008844893,0.9587508,0.00015025021,0.00009078358],"about_ca_topic_score_codex":0.000016029915,"about_ca_topic_score_gemma":0.000016651458,"teacher_disagreement_score":0.018861296,"about_ca_system_score_codex":0.000028461867,"about_ca_system_score_gemma":0.00003368869,"threshold_uncertainty_score":0.36633462},"labels":[],"label_agreement":null},{"id":"W4391127510","doi":"10.61091/ars157-13","title":"Extremal Regular Graphs of Given Chromatic Number","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.019419569842584146,"score_gpt":0.28633348463248803,"score_spread":0.2669139147899039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99241185,0.000066649365,0.0018371592,0.00041981848,0.0009772355,0.00025539636,0.0000026785858,0.00043013296,0.0035991005],"genre_scores_gemma":[0.99660945,0.000019325807,0.0026637458,0.000019838544,0.0000032222192,0.0000255399,0.0000030483252,0.000018008965,0.00063781074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998261,0.00015889933,0.000261511,0.00034894314,0.0005477722,0.00042189096],"domain_scores_gemma":[0.9984046,0.0002771213,0.00009793261,0.00097787,0.00012791072,0.0001145708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006212243,0.00013577082,0.00023478,0.00022016866,0.00010574564,0.000039614846,0.0012478005,0.000062876,0.000041919808],"category_scores_gemma":[0.00012659465,0.00013378898,0.00011085847,0.002201207,0.00015800113,0.00039627202,0.0004951443,0.00015150369,0.00047129366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000538104,0.00005207831,0.0024462265,0.000037259997,0.000023913268,0.000041598883,0.00034101377,0.000015194569,0.00312573,0.99041444,0.0018737242,0.0016234472],"study_design_scores_gemma":[0.00045389385,0.00006741082,0.0056705177,0.000035580546,0.0000033491021,0.000008945634,0.000035260724,0.0026678208,0.0067904647,0.98368776,0.0004392303,0.0001397648],"about_ca_topic_score_codex":0.0000075733724,"about_ca_topic_score_gemma":7.1781426e-7,"teacher_disagreement_score":0.006726671,"about_ca_system_score_codex":0.00002780998,"about_ca_system_score_gemma":0.00005144708,"threshold_uncertainty_score":0.6057684},"labels":[],"label_agreement":null},{"id":"W4391148150","doi":"10.55016/ojs/cdm.v18i2.73457","title":"On Colouring Oriented Graphs of Large Girth","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics","score_opus":0.016449777144991736,"score_gpt":0.3373477100802734,"score_spread":0.3208979329352817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098910965,0.000016186717,0.8977815,0.00087561127,0.00012261618,0.0005179705,0.00031992712,0.00034852634,0.0011066868],"genre_scores_gemma":[0.9808406,0.000008905682,0.018375827,0.00007591654,0.000013252284,0.00009528154,0.000023793438,0.000017418899,0.0005489606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827814,0.00007612248,0.0003532859,0.00028529082,0.00045659914,0.0005505741],"domain_scores_gemma":[0.9978382,0.00065561215,0.000107611784,0.000885566,0.00033352003,0.00017947263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819115,0.00014394613,0.0002644227,0.0004756136,0.00024603787,0.00004768577,0.00079498295,0.000052554908,0.000019904366],"category_scores_gemma":[0.0016791802,0.00012668218,0.000116516436,0.0026738353,0.00006968532,0.00015990582,0.00050640776,0.00015634713,0.0003451782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007836867,0.00008393755,0.00003346282,0.00003111592,0.00002241046,0.000008694389,0.0005521384,0.00032089598,0.0011520246,0.99679846,0.0008259518,0.00016305438],"study_design_scores_gemma":[0.0008593142,0.00029537137,0.00051225926,0.00018596917,0.000012373009,0.0000052073615,0.00027263418,0.060753305,0.013471126,0.9211809,0.0021690766,0.00028243897],"about_ca_topic_score_codex":9.328048e-7,"about_ca_topic_score_gemma":0.000002779816,"teacher_disagreement_score":0.8819297,"about_ca_system_score_codex":0.000060525093,"about_ca_system_score_gemma":0.000054072774,"threshold_uncertainty_score":0.5165949},"labels":[],"label_agreement":null},{"id":"W4391148179","doi":"10.55016/ojs/cdm.v18i2.74004","title":"Structural theory of trees I. Branching and condensations of trees","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Branching (polymer chemistry); Mathematics; Combinatorics; Tree (set theory); Chemistry","score_opus":0.02636778410779442,"score_gpt":0.3287260191071142,"score_spread":0.30235823499931974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37265766,0.000092293114,0.6257914,0.00046901952,0.000044547123,0.00030935125,0.00025860302,0.00010122825,0.00027594678],"genre_scores_gemma":[0.9792119,0.00000934876,0.02051461,0.000011536144,0.000011806086,0.000022088707,0.0000108507065,0.000008948008,0.00019888575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987638,0.000112790505,0.00038791046,0.00019752668,0.00027246654,0.00026549067],"domain_scores_gemma":[0.99782056,0.0011247065,0.00014322957,0.0005454281,0.00026327616,0.00010277832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073589827,0.00011868761,0.00029025742,0.0003064346,0.00017319647,0.000045812365,0.00050714513,0.000043395004,0.000013331585],"category_scores_gemma":[0.0013598455,0.00009939854,0.00007707543,0.0009804891,0.00023840311,0.00024292259,0.00035514505,0.000097126314,0.000009115117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000603283,0.000012443289,0.0002141432,0.00004241925,0.000033921286,0.0000012747003,0.002314822,0.00048161595,0.010617403,0.98464274,0.00004203591,0.001591128],"study_design_scores_gemma":[0.00038274878,0.00008392675,0.008787989,0.00009884611,0.000020208128,0.000008104723,0.0008069118,0.05812155,0.008468802,0.92303914,0.000034665347,0.00014709549],"about_ca_topic_score_codex":0.0000021375056,"about_ca_topic_score_gemma":0.000019541902,"teacher_disagreement_score":0.60655427,"about_ca_system_score_codex":0.000021627393,"about_ca_system_score_gemma":0.000048556263,"threshold_uncertainty_score":0.40533546},"labels":[],"label_agreement":null},{"id":"W4391294907","doi":"10.1016/j.dam.2024.01.014","title":"The <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e20\" altimg=\"si5.svg\"> <mml:mi>q</mml:mi> </mml:math> -analogue of zero forcing for certain families of graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Manitoba; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Mathematics; Scalable Vector Graphics; Zero (linguistics); Combinatorics; Forcing (mathematics); Algorithm; Discrete mathematics; Mathematical analysis; Computer science; World Wide Web","score_opus":0.02191222765559496,"score_gpt":0.275700517625191,"score_spread":0.253788289969596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391294907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.594599,0.0003773161,0.40218982,0.00016924318,0.00023536949,0.00027493524,0.00013142938,0.00016025557,0.0018626279],"genre_scores_gemma":[0.9394423,0.00019253665,0.059522804,0.000071385366,0.00007090182,0.00046559138,0.000065011925,0.00010794268,0.000061539344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689937,0.000044811106,0.00090075796,0.00057974475,0.0008662917,0.0007090331],"domain_scores_gemma":[0.99582237,0.0020710388,0.00048341675,0.0013767738,0.00010049486,0.00014588112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013906021,0.0003457045,0.00036193462,0.0001987083,0.00043449798,0.00027843838,0.001545587,0.00022913895,0.0000032647738],"category_scores_gemma":[0.00030147398,0.00029797497,0.0004824354,0.0006809409,0.000596448,0.00033990963,0.00077295094,0.00037802407,0.0000630423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064795255,0.00006602954,0.0000010998639,0.0014166592,0.00024991969,0.00001536659,0.0026990697,0.00065104844,0.005807128,0.98668736,0.00011517679,0.0022263296],"study_design_scores_gemma":[0.00024085783,0.00015330323,0.0000025962875,0.00025784306,0.000098986755,0.000023506593,0.0015436938,0.71151567,0.019505564,0.26603994,0.00039747488,0.00022056671],"about_ca_topic_score_codex":0.000025236275,"about_ca_topic_score_gemma":0.00003145979,"teacher_disagreement_score":0.72064745,"about_ca_system_score_codex":0.000015054059,"about_ca_system_score_gemma":0.00018274902,"threshold_uncertainty_score":0.99994725},"labels":[],"label_agreement":null},{"id":"W4391361420","doi":"10.18280/mmep.110112","title":"Dominance Parameters in Prism Graphs: A Comparative Study of Minimum Dominating Sets","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominance (genetics); Prism; Mathematics; Combinatorics; Computer science; Physics; Biology; Optics; Genetics","score_opus":0.04892220258389337,"score_gpt":0.29323350337982174,"score_spread":0.24431130079592836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391361420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4569367,0.00032228092,0.5423349,0.000019322602,0.000027732543,0.0002475926,2.7972317e-7,0.00006865153,0.000042553547],"genre_scores_gemma":[0.8380541,0.000015951966,0.16182195,0.0000015250143,0.0000023078055,0.00007895039,1.7796363e-7,0.0000118307935,0.000013189934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986567,0.00004407903,0.00039479858,0.0003697822,0.00023774075,0.0002968837],"domain_scores_gemma":[0.99896127,0.000653379,0.000034683628,0.00026060286,0.000022298304,0.00006775623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069267297,0.00016514522,0.00033639884,0.0003033778,0.000032505468,0.00009780785,0.0002904296,0.000044906526,4.547048e-7],"category_scores_gemma":[0.00003284765,0.00014205503,0.000039755705,0.00061349623,0.000045647357,0.00024927457,0.00012244527,0.00028047594,0.0000027613366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056795025,0.00018230389,0.000011373815,0.0007174949,0.000030495365,0.000019719979,0.021669695,0.88239247,0.00037795873,0.0932794,0.0000018185644,0.001311575],"study_design_scores_gemma":[0.00022484959,0.00013095715,0.0000054172883,0.0005372949,0.0000045041797,0.000008270169,0.00017036399,0.8483228,0.00027158126,0.15019499,0.0000040148616,0.00012491866],"about_ca_topic_score_codex":0.00000686981,"about_ca_topic_score_gemma":6.7892375e-7,"teacher_disagreement_score":0.3811174,"about_ca_system_score_codex":0.000019381489,"about_ca_system_score_gemma":0.0000102990725,"threshold_uncertainty_score":0.5792836},"labels":[],"label_agreement":null},{"id":"W4391716630","doi":"10.1007/s00373-023-02747-4","title":"Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dawson College","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Colored; Vertex (graph theory); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.050015451489095294,"score_gpt":0.2940527677184181,"score_spread":0.2440373162293228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391716630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8979119,0.0075159646,0.07772027,0.0034379931,0.0026138083,0.0013498117,0.00013321864,0.0014498775,0.007867148],"genre_scores_gemma":[0.9969633,0.0003769722,0.002372575,0.00009583557,0.000009044141,0.000053111806,0.000011013694,0.000018905348,0.000099234494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997346,0.00027633167,0.00040011393,0.00089657836,0.00044640002,0.00063457125],"domain_scores_gemma":[0.9982126,0.0006775803,0.00006251323,0.00071597804,0.00011071478,0.00022065542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011036018,0.0002778853,0.00037415946,0.0006538007,0.0002551662,0.00035515265,0.00086863677,0.000119065735,0.0000036722756],"category_scores_gemma":[0.00011518124,0.00026248518,0.00012724934,0.002877686,0.00040986185,0.0006202667,0.00050271675,0.0005894565,0.000018340186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059275935,0.00012703105,0.0015443957,0.000059271882,0.000024335233,0.00013110605,0.0005543858,0.000017356917,0.0000852532,0.9927572,0.00048413582,0.0041562486],"study_design_scores_gemma":[0.0011131826,0.00022874303,0.019274134,0.000057697816,0.000004502702,0.00002661871,0.00004297298,0.022021687,0.000058646725,0.95336854,0.0034928126,0.0003104359],"about_ca_topic_score_codex":0.000096224234,"about_ca_topic_score_gemma":0.000078585515,"teacher_disagreement_score":0.0990514,"about_ca_system_score_codex":0.000066992696,"about_ca_system_score_gemma":0.00007456058,"threshold_uncertainty_score":0.9999827},"labels":[],"label_agreement":null},{"id":"W4391918015","doi":"10.1142/s179352532450016x","title":"Automorphisms and subdivisions of Helly graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Topology and Analysis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Automorphism; Subdivision; Combinatorics; Discrete mathematics; Geography","score_opus":0.01287078616966978,"score_gpt":0.3106733131053419,"score_spread":0.2978025269356721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391918015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5605197,0.009876977,0.42640957,0.00283083,0.00014034777,0.000022853792,0.000003904471,0.000013798705,0.0001820533],"genre_scores_gemma":[0.9911967,0.00084327685,0.007772043,0.000037969625,0.000012515588,2.4311532e-7,2.0716617e-7,0.0000019175302,0.00013510982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992851,0.00010139121,0.00024152649,0.00012405582,0.00013815082,0.00010979122],"domain_scores_gemma":[0.99930876,0.00029353346,0.00009365467,0.00013314532,0.000090470276,0.000080428465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006308987,0.000055901928,0.00025745403,0.0009267599,0.000060805316,0.00003534553,0.00023611948,0.00004251662,0.00003050504],"category_scores_gemma":[0.00005168254,0.00004015485,0.00015452673,0.0010770916,0.0002637836,0.00022948546,0.00010365903,0.00017691206,7.491087e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003147486,0.00006545637,0.030593896,0.000046329315,0.0023973973,0.00037596794,0.0010226328,0.00023853387,0.004481232,0.90836746,0.0002347015,0.052144893],"study_design_scores_gemma":[0.00039523398,0.0007482538,0.045987457,0.00006654608,0.0010113297,0.0006524021,0.00022324757,0.056809064,0.0024216038,0.89021087,0.0012801604,0.00019386299],"about_ca_topic_score_codex":0.0000049651253,"about_ca_topic_score_gemma":0.0000057010784,"teacher_disagreement_score":0.43067706,"about_ca_system_score_codex":0.000004741172,"about_ca_system_score_gemma":0.00003055534,"threshold_uncertainty_score":0.16374673},"labels":[],"label_agreement":null},{"id":"W4391994399","doi":"10.2478/amsil-2024-0002","title":"The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets","year":2024,"lang":"en","type":"article","venue":"Annales Mathematicae Silesianae","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Realizability; Control reconfiguration; Mathematics; Combinatorics; Computer science; Discrete mathematics; Algorithm","score_opus":0.025256115818017066,"score_gpt":0.3218521306284077,"score_spread":0.2965960148103906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391994399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88490945,0.0034820132,0.08023169,0.0023030958,0.00039769788,0.0015520501,0.000037671176,0.0003248249,0.026761493],"genre_scores_gemma":[0.99387634,0.00016259213,0.005629422,0.000015490758,0.000008773882,0.000050652805,0.000003300827,0.000020127509,0.0002332813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972348,0.00035957835,0.00081291905,0.00046434847,0.000751912,0.0003764121],"domain_scores_gemma":[0.9961693,0.0019413023,0.00029135417,0.0012168712,0.00028315705,0.00009799622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026864647,0.00021033206,0.00035466137,0.00029466813,0.00018979817,0.00014337065,0.0013320189,0.000087898006,0.00003397801],"category_scores_gemma":[0.0006265045,0.00014367166,0.00028297488,0.0011112666,0.00048385744,0.00045880204,0.00021998925,0.00023969426,0.000033289714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001861176,0.000085875356,0.00010449397,0.0004938559,0.000085955304,0.000012606976,0.0027469455,0.00000976629,0.0050483285,0.9604995,0.00015443964,0.030739589],"study_design_scores_gemma":[0.000112521055,0.00014891771,0.00073244656,0.00030925596,0.00001721478,0.000033197844,0.0006590792,0.0077733854,0.028985409,0.96099424,0.00008879611,0.00014550477],"about_ca_topic_score_codex":0.00001911415,"about_ca_topic_score_gemma":0.000020951384,"teacher_disagreement_score":0.108966894,"about_ca_system_score_codex":0.000025933736,"about_ca_system_score_gemma":0.00013790588,"threshold_uncertainty_score":0.585876},"labels":[],"label_agreement":null},{"id":"W4392128265","doi":"10.1093/imrn/rnaf189","title":"Web Bases in Degree Two From Hourglass Plabic Graphs","year":2025,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; Österreichischen Akademie der Wissenschaften; North Dakota State University; National Science Foundation","keywords":"Hourglass; Degree (music); Computer science; World Wide Web; Geography; Physics; Archaeology","score_opus":0.17196761521514492,"score_gpt":0.4493012501158872,"score_spread":0.27733363490074225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392128265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56106746,0.0027596802,0.2431103,0.015226961,0.0067728474,0.00460085,0.002127999,0.0009735858,0.1633603],"genre_scores_gemma":[0.79071176,0.0005367295,0.20415854,0.00013566724,0.00028734718,0.0006403462,0.0001218031,0.000054943706,0.0033528446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925214,0.0007998418,0.00091301743,0.001316572,0.0035337817,0.00091536576],"domain_scores_gemma":[0.98801106,0.00829424,0.00030314206,0.0019244547,0.0012460375,0.00022105743],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.004013681,0.0004351223,0.0005955543,0.0032458156,0.0001714933,0.001201869,0.00946735,0.00027665636,0.00022965131],"category_scores_gemma":[0.0033704035,0.0004180656,0.00023579398,0.0012770521,0.00041759873,0.0007063445,0.009446982,0.0027663698,0.00020988035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008867659,0.0011472971,0.0033199713,0.0006459651,0.00043973798,0.0004146771,0.002350419,0.008090923,0.0005949963,0.96670496,0.0016260081,0.0145763615],"study_design_scores_gemma":[0.0005347386,0.000027363052,0.00046373333,0.0012015229,0.000005668559,0.000002192889,0.00014050248,0.30187523,0.00079023244,0.6936605,0.0010130658,0.00028528995],"about_ca_topic_score_codex":0.0006528468,"about_ca_topic_score_gemma":0.0014045642,"teacher_disagreement_score":0.2937843,"about_ca_system_score_codex":0.0004994651,"about_ca_system_score_gemma":0.0009977212,"threshold_uncertainty_score":0.99983495},"labels":[],"label_agreement":null},{"id":"W4392144194","doi":"10.1007/s00373-024-02756-x","title":"Infinite Families of k-Vertex-Critical ($$P_5$$, $$C_5$$)-Free Graphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.015829665010986597,"score_gpt":0.2788217830343118,"score_spread":0.2629921180233252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392144194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76533407,0.0499851,0.13267955,0.0055640703,0.008396908,0.0011855687,0.00015944558,0.0025753116,0.034119956],"genre_scores_gemma":[0.99616337,0.0015164342,0.0020492352,0.00007663607,0.0000064540186,0.000021691061,0.000002001062,0.000021372474,0.00014279275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979533,0.00010573373,0.00033533823,0.0005470217,0.0005782025,0.000480382],"domain_scores_gemma":[0.9977825,0.0008327469,0.000035935052,0.0009411598,0.00020159049,0.00020603866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048071143,0.00023091584,0.00030100686,0.0007004202,0.00017630192,0.00022442751,0.0011900957,0.00011469121,0.00000877203],"category_scores_gemma":[0.00025751872,0.00020819697,0.00015999444,0.00252986,0.000519056,0.00061802776,0.0007319748,0.00038866716,0.000008919687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079790325,0.000073790936,0.00106541,0.00017398712,0.000033085387,0.000050855324,0.00033118756,0.0000011726373,0.00032351582,0.9861614,0.0008746275,0.010902979],"study_design_scores_gemma":[0.00030357644,0.00026468153,0.0011860374,0.000086686836,0.000013117362,0.000029165412,0.00009533507,0.0027870974,0.00073360687,0.9910735,0.0031920108,0.00023521761],"about_ca_topic_score_codex":0.000018071147,"about_ca_topic_score_gemma":0.0000033172387,"teacher_disagreement_score":0.2308293,"about_ca_system_score_codex":0.000017838129,"about_ca_system_score_gemma":0.000083277555,"threshold_uncertainty_score":0.8490026},"labels":[],"label_agreement":null},{"id":"W4392238446","doi":"10.1137/18m1234849","title":"Four-Coloring \\(\\boldsymbol{P_6}\\)-Free Graphs. II. Finding an Excellent Precoloring","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; National Science Foundation","keywords":"Combinatorics; Mathematics; Graph coloring; Complete coloring; Discrete mathematics; Graph; Line graph","score_opus":0.05692025520573841,"score_gpt":0.3279586546606393,"score_spread":0.2710383994549009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392238446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6488395,0.0009389477,0.33979127,0.0010180176,0.0047639855,0.00029191945,0.0000017004568,0.0007713311,0.0035833442],"genre_scores_gemma":[0.9586318,0.00008912842,0.03981702,0.00014043514,0.00096764654,0.000007101293,7.5390324e-7,0.00006380527,0.0002823192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956971,0.00037062296,0.00070086564,0.00089392136,0.0010987441,0.0012387355],"domain_scores_gemma":[0.997331,0.00079180644,0.00020984838,0.0009689109,0.0001670322,0.0005313917],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0033066573,0.00039689709,0.00038336997,0.0011443052,0.001800741,0.0014845022,0.0029920402,0.00012081554,0.000037829202],"category_scores_gemma":[0.0002632713,0.0003648375,0.00030484344,0.0014913146,0.0000821102,0.00171345,0.0016090277,0.0019081137,0.00007043378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007799803,0.000281922,0.0012449446,0.00018769971,0.00024928094,0.002732517,0.0058782306,0.06661492,0.0052888272,0.47318044,0.0010376116,0.44322562],"study_design_scores_gemma":[0.0013825689,0.0022684557,0.0025960305,0.0021748568,0.000030579704,0.0023611588,0.00036692186,0.6748782,0.006032082,0.29674062,0.009863332,0.0013052213],"about_ca_topic_score_codex":0.0000031100708,"about_ca_topic_score_gemma":0.000003134277,"teacher_disagreement_score":0.60826325,"about_ca_system_score_codex":0.0003505624,"about_ca_system_score_gemma":0.00018669615,"threshold_uncertainty_score":0.9998804},"labels":[],"label_agreement":null},{"id":"W4392450535","doi":"10.1007/978-3-031-55601-2_3","title":"Bi-arc Digraphs: Recognition Algorithm and Applications","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Arc (geometry); Algorithm; Mathematics","score_opus":0.021695642205586597,"score_gpt":0.2808262074283002,"score_spread":0.2591305652227136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392450535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046780856,0.002211412,0.99124265,0.00050197076,0.0005529943,0.0006482932,0.00002613037,0.00037372485,0.0044381428],"genre_scores_gemma":[0.004352214,0.0006856526,0.9922417,0.0007679987,0.0007245275,0.0001466634,0.000021208602,0.00007362746,0.00098641],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996313,0.00002863693,0.0003757732,0.0018210236,0.00084974116,0.0006118648],"domain_scores_gemma":[0.9976746,0.0005439834,0.00012250857,0.0011869611,0.0002467779,0.00022520256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081692176,0.00043261153,0.00036116963,0.0015800174,0.0002981168,0.000756707,0.0021793435,0.00024656774,0.000011426655],"category_scores_gemma":[0.000034736437,0.00039927504,0.00010424402,0.0013540135,0.0012549924,0.00067322125,0.0016098317,0.0010269975,0.00014210759],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013399483,0.000011165799,0.0000025112708,0.000040043826,0.000008758549,0.00003733003,0.00015096663,0.0002791455,0.000040491737,0.07269315,0.000008213491,0.9267269],"study_design_scores_gemma":[0.00009321214,0.000087219225,0.000009611369,0.00023201392,0.000006446963,0.00009661498,1.7522774e-7,0.15217791,0.00036190197,0.8417521,0.0047745868,0.0004082165],"about_ca_topic_score_codex":0.0000066127914,"about_ca_topic_score_gemma":0.000015512218,"teacher_disagreement_score":0.92631865,"about_ca_system_score_codex":0.00014635721,"about_ca_system_score_gemma":0.00023275895,"threshold_uncertainty_score":0.9998459},"labels":[],"label_agreement":null},{"id":"W4392595156","doi":"10.1002/jgt.23089","title":"Finding triangle‐free 2‐factors in general graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Carnegie Mellon University","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.029967797853744167,"score_gpt":0.31226156345549816,"score_spread":0.282293765601754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392595156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80873805,0.0067983624,0.1795198,0.0006074215,0.0022135556,0.00017033638,0.000006270959,0.00010833995,0.0018378373],"genre_scores_gemma":[0.9914464,0.00026034555,0.007682533,0.00007971534,0.00013848585,0.0000033762024,4.830371e-7,0.000027070371,0.00036162505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973649,0.0005945917,0.0006444377,0.00029050306,0.0006345724,0.0004710126],"domain_scores_gemma":[0.9978019,0.0011531325,0.0001819049,0.0005660465,0.000106560256,0.00019046088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042030443,0.00020193183,0.00037728206,0.0025236937,0.0000938551,0.0002461932,0.0020650423,0.00009276241,0.000047535297],"category_scores_gemma":[0.0004741498,0.00015202614,0.00047292834,0.0023657829,0.0001638917,0.0013168134,0.00026326763,0.0008236737,0.000009504353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088442604,0.0000536144,0.0017819601,0.000027175653,0.00008194543,0.00065443775,0.0010751974,0.00014085002,0.0032822588,0.978518,0.000533946,0.013762178],"study_design_scores_gemma":[0.0005719744,0.00020067614,0.0027080495,0.00016796529,0.000010527527,0.00017991733,0.00014586646,0.00045449284,0.0031686898,0.991317,0.000900294,0.0001745473],"about_ca_topic_score_codex":0.000003303319,"about_ca_topic_score_gemma":0.0000056872072,"teacher_disagreement_score":0.1827083,"about_ca_system_score_codex":0.00008884434,"about_ca_system_score_gemma":0.00015664115,"threshold_uncertainty_score":0.61994463},"labels":[],"label_agreement":null},{"id":"W4393008377","doi":"10.1137/22m1515768","title":"List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Mathematics; Edge coloring; List coloring; Complete coloring; Discrete mathematics; Brooks' theorem; Graph coloring; Greedy coloring; Chordal graph; Graph; 1-planar graph; Line graph","score_opus":0.03265438846763929,"score_gpt":0.3106433100962616,"score_spread":0.2779889216286223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393008377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3706681,0.0007539901,0.6120807,0.0021064763,0.0007803642,0.00068346306,0.000008065564,0.0006567642,0.012262086],"genre_scores_gemma":[0.92573863,0.00010330485,0.07331335,0.00009720797,0.000099631994,0.00003262323,0.0000010537069,0.000070843846,0.0005433503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973029,0.0001128595,0.00048387895,0.00042456528,0.0010193856,0.0006564088],"domain_scores_gemma":[0.99815977,0.00046162645,0.00016980225,0.0007278315,0.00016102298,0.0003199311],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010577457,0.0003223485,0.00034809904,0.000739829,0.00033395234,0.0012039623,0.0013689225,0.00008764321,0.000046437304],"category_scores_gemma":[0.00013714093,0.00021410447,0.00022128911,0.0016779877,0.000108831046,0.0009463624,0.00021634191,0.0010207227,0.00007890073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046323887,0.000100338664,0.000055565408,0.00021398519,0.00019767178,0.00079339865,0.0024746454,0.00009362846,0.0023213932,0.98646224,0.00025052458,0.006990297],"study_design_scores_gemma":[0.0006864589,0.0012948683,0.00011209559,0.0014041015,0.00003985769,0.0016223785,0.0005921998,0.024166942,0.0035375878,0.964396,0.0015467544,0.00060074724],"about_ca_topic_score_codex":0.0000018226708,"about_ca_topic_score_gemma":0.000006818377,"teacher_disagreement_score":0.5550705,"about_ca_system_score_codex":0.0000898286,"about_ca_system_score_gemma":0.00017024534,"threshold_uncertainty_score":0.99983287},"labels":[],"label_agreement":null},{"id":"W4393024088","doi":"","title":"A guide book for the traveller on graphs full of blockages","year":2019,"lang":"en","type":"preprint","venue":"theses.fr (ABES)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Data science; Mathematics","score_opus":0.041242483411066726,"score_gpt":0.32370673419779705,"score_spread":0.2824642507867303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393024088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008944471,0.0069573517,0.84569156,0.003930981,0.0025772685,0.007363422,0.00030410013,0.0004940337,0.123736784],"genre_scores_gemma":[0.9673837,0.0018191088,0.020729022,0.0010157496,0.00028652776,0.0008222313,0.000018363975,0.0001489398,0.0077763502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963268,0.00030141024,0.00061248546,0.0010711025,0.0009321322,0.00075607357],"domain_scores_gemma":[0.99221504,0.0031039522,0.00040866682,0.0037868589,0.00035254846,0.00013295049],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017852328,0.00051073695,0.000690676,0.00039703335,0.00018676439,0.00015033186,0.005485853,0.00030329032,0.00009982494],"category_scores_gemma":[0.0003574783,0.00034600438,0.0006058092,0.0003755399,0.00039732075,0.00016897089,0.0022060329,0.0009332178,0.00013311137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027566275,0.00026139905,0.00004684841,0.00043783218,0.0004505385,0.0000110144265,0.0041365554,0.008207623,0.0025453418,0.9409126,0.004686644,0.03802796],"study_design_scores_gemma":[0.0017533277,0.0011463356,0.00040485818,0.00094115635,0.00013121993,0.000025632777,0.00088237296,0.033872113,0.044574395,0.61791277,0.29691952,0.0014362716],"about_ca_topic_score_codex":0.00015396037,"about_ca_topic_score_gemma":0.000019573343,"teacher_disagreement_score":0.95843923,"about_ca_system_score_codex":0.00007192058,"about_ca_system_score_gemma":0.0002464581,"threshold_uncertainty_score":0.9998992},"labels":[],"label_agreement":null},{"id":"W4393216900","doi":"10.1016/j.disc.2024.114005","title":"A note on highly connected K2,-minor free graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Minor (academic); Discrete mathematics","score_opus":0.022923630332942358,"score_gpt":0.30634562913222824,"score_spread":0.28342199879928587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393216900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02297199,0.0003670614,0.9494096,0.0023371668,0.00063057814,0.00055123516,0.000057508638,0.0013454237,0.022329407],"genre_scores_gemma":[0.7945301,0.00004041455,0.20214966,0.0002972533,0.0001013821,0.00010389832,0.000011996796,0.00008917911,0.0026761491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979437,0.0000750397,0.00032881505,0.00052350416,0.0006389765,0.0004899408],"domain_scores_gemma":[0.9972259,0.0008877372,0.00005840244,0.0015920722,0.000075557145,0.00016035775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044779366,0.0002528538,0.00026020364,0.0003562321,0.00013161151,0.00041297215,0.00174781,0.00008385831,0.000046058252],"category_scores_gemma":[0.0003770076,0.00019624626,0.00016924975,0.0010971265,0.00013402852,0.00037781554,0.0004976067,0.00034644944,0.000565182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005786042,0.000046476376,0.0000030727624,0.00017585413,0.000032694694,0.00009914555,0.0015746569,0.000027199698,0.0012825093,0.99205,0.0012513489,0.003451265],"study_design_scores_gemma":[0.00022385332,0.0001552754,0.000023301442,0.00023085109,0.0000116926,0.00002559475,0.000063733576,0.10167699,0.00511089,0.8896697,0.0025287168,0.0002793698],"about_ca_topic_score_codex":0.0000029301686,"about_ca_topic_score_gemma":0.000004553449,"teacher_disagreement_score":0.7715581,"about_ca_system_score_codex":0.00004952911,"about_ca_system_score_gemma":0.000060211696,"threshold_uncertainty_score":0.800269},"labels":[],"label_agreement":null},{"id":"W4394190359","doi":"10.6084/m9.figshare.5325607","title":"Property Graphs","year":2017,"lang":"en","type":"dataset","venue":"Figshare","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Computer science; Combinatorics","score_opus":0.08526674129771894,"score_gpt":0.34934958491836515,"score_spread":0.2640828436206462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394190359","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.265643e-9,0.0002362814,0.000010266495,0.000068253205,0.00015295744,0.00033874827,0.9980882,0.000118575554,0.0009867199],"genre_scores_gemma":[6.355622e-7,0.000015949074,0.00028807885,0.0001339202,0.00010187684,0.00035215874,0.99739665,0.000015520582,0.0016951842],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799025,0.00008867041,0.00016386833,0.0007112038,0.00055063085,0.00049536134],"domain_scores_gemma":[0.99555427,0.000117146155,0.0002212959,0.0037326496,0.00019556658,0.00017905157],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000100961224,0.00028872222,0.00027532867,0.00022737119,0.0003593905,0.0005876871,0.0075635794,0.00025631435,0.060230825],"category_scores_gemma":[0.001781252,0.00019351202,0.00015041856,0.00020713576,0.000024120052,0.0005959796,0.0023854356,0.0007084202,0.029572003],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018896897,0.000018730561,1.16044255e-7,0.00018693674,0.000013268281,0.00014316302,0.00000310785,5.413511e-7,3.7829818e-7,0.000035943496,0.9945444,0.005051556],"study_design_scores_gemma":[0.0000871689,0.000040678067,0.00001437174,0.0010215276,0.0000021419726,0.000018463803,2.5195789e-7,0.00004080477,0.00001624869,0.0022426283,0.99620587,0.00030983923],"about_ca_topic_score_codex":0.000011939758,"about_ca_topic_score_gemma":0.000023008715,"teacher_disagreement_score":0.030658823,"about_ca_system_score_codex":0.000033470587,"about_ca_system_score_gemma":0.00023616735,"threshold_uncertainty_score":0.99780595},"labels":[],"label_agreement":null},{"id":"W4394572107","doi":"10.1007/s00493-024-00097-0","title":"Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Prism; Tree (set theory); Forestry; Geography; Physics","score_opus":0.025770290063203218,"score_gpt":0.2955779802607052,"score_spread":0.269807690197502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394572107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9007583,0.0055583515,0.07411388,0.0033932182,0.0013626657,0.0010568812,0.0000055173805,0.0010899387,0.012661223],"genre_scores_gemma":[0.99563223,0.00021755068,0.0038539176,0.000044284603,0.000013142781,0.00011319264,0.0000022338381,0.00002634168,0.00009710688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979603,0.00015499613,0.00028888776,0.000683805,0.00036866224,0.0005433131],"domain_scores_gemma":[0.9982427,0.00051463064,0.000039948336,0.0009512672,0.000049841405,0.0002016633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038785455,0.00022268477,0.00025163693,0.0010180989,0.00022749772,0.00033744998,0.0012927447,0.00009985082,0.000004207194],"category_scores_gemma":[0.00010183015,0.00021693982,0.00010677965,0.0029597206,0.00012253318,0.00078977825,0.0007803074,0.0005015193,0.000024772056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008292129,0.00011475622,0.0031431518,0.000037088965,0.000023696253,0.00015977772,0.0005862193,0.000004140789,0.0023475594,0.9679707,0.00029626308,0.025308339],"study_design_scores_gemma":[0.0006024294,0.00017639904,0.009818464,0.0001035256,0.0000066245852,0.000043106193,0.000028750637,0.009062456,0.0009511772,0.9778981,0.0010426174,0.00026631894],"about_ca_topic_score_codex":0.000027485868,"about_ca_topic_score_gemma":0.00004274963,"teacher_disagreement_score":0.09487391,"about_ca_system_score_codex":0.00010506602,"about_ca_system_score_gemma":0.00007558407,"threshold_uncertainty_score":0.8846549},"labels":[],"label_agreement":null},{"id":"W4394576516","doi":"10.1017/nws.2024.3","title":"Generating preferential attachment graphs via a Pólya urn with expanding colors","year":2024,"lang":"en","type":"article","venue":"Network Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.02093150770126085,"score_gpt":0.31378465379297715,"score_spread":0.2928531460917163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394576516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13605948,0.0006674475,0.8598322,0.0001601524,0.0009925214,0.00030090866,7.1705773e-7,0.00039195278,0.0015945963],"genre_scores_gemma":[0.9179769,0.000024100596,0.081408925,0.00010220454,0.00020901827,0.000057109122,8.420073e-7,0.000014059123,0.00020679922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654686,0.00009276345,0.0002251399,0.0009855328,0.0011244249,0.0010252933],"domain_scores_gemma":[0.99876255,0.0001708113,0.00005511727,0.00063819584,0.000117320255,0.00025598842],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001645107,0.00019632364,0.00015853505,0.0003095013,0.00092885643,0.0011072739,0.0018096567,0.000038991304,0.000021908802],"category_scores_gemma":[0.000026258509,0.00014895537,0.000055605862,0.0047990456,0.0006640783,0.0015335068,0.0006999959,0.00032826082,0.000039739447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055021574,0.00010563109,0.0036218103,0.00007043628,0.00005991571,0.00021533573,0.0021333992,0.17267805,0.042546824,0.6025784,0.0016135846,0.1743216],"study_design_scores_gemma":[0.00022505215,0.00037921194,0.00058370375,0.00021505907,0.000008227549,0.000087517925,0.00003754198,0.952013,0.004294072,0.040018585,0.0017275108,0.00041053162],"about_ca_topic_score_codex":0.0000066024586,"about_ca_topic_score_gemma":0.000018103388,"teacher_disagreement_score":0.78191745,"about_ca_system_score_codex":0.00013342848,"about_ca_system_score_gemma":0.00031306216,"threshold_uncertainty_score":0.99992967},"labels":[],"label_agreement":null},{"id":"W4394758905","doi":"10.1007/s00453-024-01228-1","title":"Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Univerzita Karlova v Praze","keywords":"Homomorphism; Mathematics; Combinatorics; Conjecture; Discrete mathematics; Pathwidth; Chordal graph; Extension (predicate logic); Class (philosophy); Indifference graph; Graph; Computer science; Line graph","score_opus":0.012695415782799858,"score_gpt":0.2723994767271793,"score_spread":0.2597040609443794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394758905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102116525,0.010745157,0.87798434,0.0054557086,0.0006977809,0.0013036884,0.00008451762,0.0009620141,0.00065028167],"genre_scores_gemma":[0.8388745,0.00051658443,0.15858555,0.0002554773,0.00006503214,0.0002962538,0.000009941524,0.000057418238,0.0013392247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854547,0.000042815245,0.00017490907,0.00063046435,0.00020472218,0.00040160303],"domain_scores_gemma":[0.9988452,0.00054819987,0.000026851094,0.00034625205,0.00007074583,0.00016272505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034622345,0.00018876315,0.00019863108,0.00033651202,0.00022388402,0.00042324248,0.00042986916,0.000069155954,0.0000070971355],"category_scores_gemma":[0.00006014979,0.00017110788,0.000069222544,0.0006390944,0.00035777222,0.0005315874,0.00029664664,0.00016536102,0.0000055115834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023155997,0.000033463057,0.00005541306,0.00015658187,0.00007199238,0.00007258313,0.0009185332,9.620286e-7,0.005753302,0.7650805,0.0015437693,0.2262897],"study_design_scores_gemma":[0.00044163698,0.00028219534,0.00011931346,0.00006074395,0.000014594686,0.000078511635,0.00004592097,0.03607167,0.0035704826,0.94187516,0.017134536,0.00030521167],"about_ca_topic_score_codex":0.00002215329,"about_ca_topic_score_gemma":0.000008331604,"teacher_disagreement_score":0.736758,"about_ca_system_score_codex":0.000013797438,"about_ca_system_score_gemma":0.000035008663,"threshold_uncertainty_score":0.6977577},"labels":[],"label_agreement":null},{"id":"W4394792901","doi":"10.61091/um119-01","title":"Generalized 3-Rainbow Domination in Graphs and Honeycomb System (HC(n))","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Rainbow; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.018841296281883378,"score_gpt":0.2930727004844571,"score_spread":0.27423140420257375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394792901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.446424,0.008515953,0.52100354,0.0024462303,0.00086717535,0.0018927313,0.000016605116,0.0019480891,0.016885644],"genre_scores_gemma":[0.9470415,0.000032224143,0.052362815,0.00002460743,0.000011172503,0.00009777397,0.0000017594148,0.000017727272,0.00041041014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983605,0.00017709832,0.00032206665,0.0004607198,0.00034404936,0.00033556164],"domain_scores_gemma":[0.9987134,0.0005520608,0.000032326447,0.00055869546,0.00004314394,0.00010040834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012308953,0.00015888958,0.00024337086,0.00047563686,0.000073812764,0.00022436638,0.00048366122,0.00006249332,0.00002010929],"category_scores_gemma":[0.00013088479,0.00013228862,0.00006540203,0.00088662154,0.000112376685,0.00048328814,0.00023907874,0.00017132946,0.00009468976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000557547,0.000028462535,0.000022789936,0.00059050147,0.00001385689,0.000054401105,0.0015635509,0.000004093165,0.00051913154,0.9896469,0.00018447175,0.007366266],"study_design_scores_gemma":[0.00028750437,0.00003746222,0.00015993249,0.0003584603,0.0000056551517,0.000070507485,0.00024325808,0.25960693,0.0004438211,0.7381956,0.0004390758,0.00015183484],"about_ca_topic_score_codex":0.0000060932402,"about_ca_topic_score_gemma":0.000002892202,"teacher_disagreement_score":0.5006175,"about_ca_system_score_codex":0.000073330775,"about_ca_system_score_gemma":0.000036463764,"threshold_uncertainty_score":0.5394574},"labels":[],"label_agreement":null},{"id":"W4394793198","doi":"10.61091/ars158-05","title":"On Domination and 2-packing Numbers in Intersecting Linear Systems","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Prime (order theory); Rank (graph theory); Projective plane; Element (criminal law); Discrete mathematics; Geometry","score_opus":0.015467110374370329,"score_gpt":0.2987086625492166,"score_spread":0.28324155217484626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98265576,0.00046655393,0.0106598,0.00019736346,0.0030694276,0.00022343069,5.554143e-7,0.00020167445,0.002525409],"genre_scores_gemma":[0.99938035,0.000012333101,0.00044962871,0.000018594366,0.000007667921,0.00001670175,5.9838214e-7,0.000011920228,0.000102227394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989223,0.0001243375,0.0001574916,0.000347313,0.00022281364,0.00022576968],"domain_scores_gemma":[0.99908626,0.0005614947,0.000025836316,0.00023703696,0.000035769408,0.000053596257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007554751,0.00009649789,0.00011134214,0.00030472624,0.000065337976,0.00023160927,0.00028994287,0.000046579255,0.0000016223355],"category_scores_gemma":[0.00016079885,0.00009378353,0.000023673754,0.00066276366,0.000036783375,0.0004924101,0.00016144844,0.00028193518,0.000030451087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063803564,0.000015385653,0.00035337164,0.000046373243,0.0000063940433,0.000058089216,0.0010983334,0.00015990406,0.00027024825,0.99284816,0.000045352877,0.0050920304],"study_design_scores_gemma":[0.00040088533,0.000113355345,0.00026079497,0.00043156548,0.0000015350798,0.000023259836,0.00025832924,0.22826034,0.00067172997,0.76918006,0.00024287523,0.0001552708],"about_ca_topic_score_codex":0.000032963846,"about_ca_topic_score_gemma":0.000005021474,"teacher_disagreement_score":0.22810043,"about_ca_system_score_codex":0.00012106775,"about_ca_system_score_gemma":0.000025049938,"threshold_uncertainty_score":0.38243812},"labels":[],"label_agreement":null},{"id":"W4394793215","doi":"10.61091/ars158-03","title":"Algorithmic Aspects of Vertex-edge Domination in Some Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"SASTRA University; National Board for Higher Mathematics; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Neighbourhood (mathematics); Dominating set; Edge cover; Chordal graph; Bipartite graph; Vertex cover; Discrete mathematics; Maximal independent set; Graph; 1-planar graph","score_opus":0.012135276949478156,"score_gpt":0.2796549732610593,"score_spread":0.2675196963115812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9722613,0.0039340267,0.008263067,0.00085010467,0.0066904547,0.0006959623,0.000006407326,0.00044513273,0.0068535074],"genre_scores_gemma":[0.998729,0.000062217616,0.0010587922,0.000020653993,0.0000041066774,0.000027357693,0.0000019646134,0.000014571514,0.00008137168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851316,0.00012582277,0.00025340586,0.00040036562,0.00039291327,0.00031431852],"domain_scores_gemma":[0.998989,0.00032505812,0.000040114577,0.0004957933,0.00007865086,0.000071395996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006132272,0.0001278801,0.00018865694,0.00062785164,0.00004259862,0.00007771166,0.00081212615,0.00006845887,0.000008575125],"category_scores_gemma":[0.00009060585,0.00012811471,0.00007699631,0.0016729173,0.00009698318,0.0009517627,0.00022954431,0.000263603,0.00006289567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053129847,0.00007051213,0.00012480115,0.00004413696,0.000011807874,0.00007117544,0.00035435412,0.000009549861,0.0023612361,0.9785344,0.00010623208,0.018306484],"study_design_scores_gemma":[0.0004514252,0.0001046854,0.001640444,0.000082317776,0.000002254096,0.0000069969838,0.000015548025,0.015849423,0.010453635,0.97108686,0.00018059218,0.00012583782],"about_ca_topic_score_codex":0.000015543781,"about_ca_topic_score_gemma":0.000003570082,"teacher_disagreement_score":0.026467627,"about_ca_system_score_codex":0.00010010518,"about_ca_system_score_gemma":0.000114362054,"threshold_uncertainty_score":0.5224367},"labels":[],"label_agreement":null},{"id":"W4394877485","doi":"10.26493/2590-9770.1641.f6d","title":"On the restricted Hanoi graphs","year":2024,"lang":"en","type":"article","venue":"The Art of Discrete and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Computer science","score_opus":0.02129496135886784,"score_gpt":0.27305642652165074,"score_spread":0.2517614651627829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394877485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23154138,0.00074601365,0.59706897,0.013139608,0.0001467281,0.0014651275,0.000017865443,0.00044745463,0.15542684],"genre_scores_gemma":[0.98876566,0.00007282876,0.0105165215,0.00013968805,0.000011767549,0.000037928316,8.05668e-7,0.00001299547,0.00044181017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914646,0.000027716638,0.00017236188,0.00017340126,0.000300345,0.00017971391],"domain_scores_gemma":[0.99807787,0.0011621034,0.000044228884,0.00066324265,0.000016755372,0.000035809637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004467188,0.00010668577,0.00012276313,0.0000687148,0.0001523161,0.00012129814,0.0007115227,0.000024339924,0.000009371786],"category_scores_gemma":[0.000041925032,0.000048690083,0.000048978618,0.0005009618,0.00023079365,0.00007136323,0.00026003344,0.00017883362,0.00003676488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004552679,0.000015320104,2.19202e-7,0.0000465923,0.00002034785,0.0000011575504,0.0008722087,0.00001560875,0.0036960163,0.99270755,0.0010562962,0.001564154],"study_design_scores_gemma":[0.000059772963,0.00004650649,0.000009070368,0.00006025728,0.000008732182,0.0000047153844,0.0002128476,0.0077544893,0.008557181,0.98252,0.0006976703,0.000068763286],"about_ca_topic_score_codex":3.0498907e-7,"about_ca_topic_score_gemma":3.9090503e-7,"teacher_disagreement_score":0.75722426,"about_ca_system_score_codex":0.0000042816673,"about_ca_system_score_gemma":0.000013875731,"threshold_uncertainty_score":0.1985524},"labels":[],"label_agreement":null},{"id":"W4394881837","doi":"10.1007/s00373-024-02778-5","title":"Semi-strict Chordality of Digraphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014632078909479816,"score_gpt":0.2712885078436402,"score_spread":0.2566564289341604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394881837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7585604,0.03039301,0.19223534,0.0008595321,0.0022577713,0.0005725676,0.00003643484,0.0010694924,0.01401541],"genre_scores_gemma":[0.9982687,0.00087962113,0.00061158737,0.000023281138,0.0000058241008,0.0000115323965,0.0000013622529,0.000009501486,0.00018854652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868464,0.00008881629,0.00020946328,0.00038827612,0.00034937658,0.00027943272],"domain_scores_gemma":[0.9989656,0.00028264849,0.000036750054,0.0004960251,0.00009264655,0.00012631292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005753896,0.00013463508,0.00018223349,0.0003510791,0.000095979594,0.00013017966,0.0005707211,0.000063313586,0.000004652118],"category_scores_gemma":[0.00004465603,0.00011706664,0.00010688715,0.00228149,0.00014763033,0.00037060195,0.00026584254,0.00022770457,0.000004186382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004239452,0.00004374329,0.0031122398,0.00008225413,0.000023445393,0.000018497347,0.00015160126,0.0000016182906,0.00022285315,0.9828171,0.00027268773,0.013249711],"study_design_scores_gemma":[0.00015831304,0.00013083563,0.003993185,0.00003365555,0.0000062757777,0.000012836818,0.000023080313,0.002466531,0.0012960327,0.98754114,0.004196522,0.00014156655],"about_ca_topic_score_codex":0.000014012749,"about_ca_topic_score_gemma":7.859111e-7,"teacher_disagreement_score":0.2397083,"about_ca_system_score_codex":0.000014127856,"about_ca_system_score_gemma":0.000045854515,"threshold_uncertainty_score":0.47738388},"labels":[],"label_agreement":null},{"id":"W4394906558","doi":"10.48550/arxiv.2404.10663","title":"A note on inverting the dijoin of oriented graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.06808779366377844,"score_gpt":0.23019993041954723,"score_spread":0.1621121367557688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394906558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54398996,0.00014683252,0.44725603,0.00059116934,0.0009516988,0.000602775,0.000026688842,0.0003635376,0.0060712937],"genre_scores_gemma":[0.99813855,0.00006521436,0.00087902223,0.0001051984,0.000025854206,0.0000015384221,0.0000029839794,0.00002041216,0.0007612518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790305,0.0002850447,0.00022318208,0.0009998662,0.00020561703,0.00038322198],"domain_scores_gemma":[0.99728996,0.00043722132,0.00020214685,0.0017805808,0.00017601454,0.000114078124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059420767,0.00026833167,0.0002797999,0.000521184,0.00015686359,0.0000667779,0.0025932586,0.00016801694,0.000010725793],"category_scores_gemma":[0.00013882073,0.00022112041,0.00030451326,0.001872562,0.00032569256,0.00013712533,0.0049467552,0.0012692119,0.00009559551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044615,0.000045494337,0.00024359161,0.00009470551,0.00006633565,0.00017282642,0.0004597537,0.03368627,0.00020063635,0.96371984,0.00012772855,0.0011382131],"study_design_scores_gemma":[0.00017075098,0.00007051784,0.00012461323,0.00021508613,0.000026304233,0.000002045832,0.00005754358,0.24654993,0.0014610315,0.75081307,0.00030105395,0.00020805465],"about_ca_topic_score_codex":0.000060056103,"about_ca_topic_score_gemma":0.000020795633,"teacher_disagreement_score":0.45414856,"about_ca_system_score_codex":0.00012591292,"about_ca_system_score_gemma":0.0001890322,"threshold_uncertainty_score":0.9017029},"labels":[],"label_agreement":null},{"id":"W4394913316","doi":"10.1016/j.tcs.2024.114580","title":"List homomorphisms to separable signed graphs","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Agence Nationale de la Recherche; Univerzita Karlova v Praze; HORIZON EUROPE Framework Programme; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura, Univerzita Karlova; European Commission","keywords":"Signed graph; Separable space; Homomorphism; Mathematics; Focus (optics); Combinatorics; Conjecture; Discrete mathematics; Chordal graph; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.013531344058050261,"score_gpt":0.3004726099934867,"score_spread":0.2869412659354364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394913316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012711795,0.00015719018,0.97411126,0.0024368316,0.0012022696,0.00034055294,0.0000038057658,0.0009134558,0.008122814],"genre_scores_gemma":[0.8304865,0.0000046123564,0.16840611,0.0008500518,0.000095488875,0.00002711247,5.531143e-7,0.000017813458,0.000111777306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955251,0.00016765275,0.0003122338,0.0014671149,0.0013322645,0.0011956153],"domain_scores_gemma":[0.9968532,0.0006177191,0.000023171187,0.0014639363,0.00024173396,0.0008002931],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027349188,0.0002771153,0.00026071866,0.00084715144,0.0005900859,0.0018151617,0.004958016,0.00005963719,0.00014462892],"category_scores_gemma":[0.00014225578,0.00022701948,0.00012637682,0.006612454,0.00322137,0.0013652636,0.0021965837,0.00037980024,0.0010252721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009417495,0.000034893266,0.000004637069,0.00001306863,0.0000055057803,0.00011479496,0.00035906074,0.00019626308,0.004749629,0.95854425,0.00033683077,0.035631638],"study_design_scores_gemma":[0.000074475895,0.00028406383,0.000042394924,0.000057187794,0.0000025064794,0.00006785957,0.0000035597736,0.26645026,0.008069033,0.72350776,0.0011659162,0.00027499854],"about_ca_topic_score_codex":0.0000035297069,"about_ca_topic_score_gemma":5.960148e-7,"teacher_disagreement_score":0.8177747,"about_ca_system_score_codex":0.00011279017,"about_ca_system_score_gemma":0.00024923237,"threshold_uncertainty_score":0.9997525},"labels":[],"label_agreement":null},{"id":"W4395452445","doi":"10.1002/jgt.23091","title":"Another proof of Seymour's 6‐flow theorem","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical proof; Combinatorial proof; Generalization; Combinatorics; Robertson–Seymour theorem; Graph; Discrete mathematics; Flow (mathematics); Graph minor; Voltage graph; 1-planar graph; Line graph; Mathematical analysis; Geometry","score_opus":0.016249949979179206,"score_gpt":0.2863374115613792,"score_spread":0.2700874615822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395452445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012252812,0.0070650363,0.9747042,0.00064773246,0.0007940627,0.0001482975,0.0000055691507,0.0000613035,0.00432098],"genre_scores_gemma":[0.96378744,0.0001389556,0.034831233,0.00015800985,0.00018861215,0.000003845994,2.455352e-7,0.000038444163,0.0008532375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976608,0.000522828,0.0005679977,0.00023686113,0.0006813753,0.0003301188],"domain_scores_gemma":[0.99799395,0.00076276984,0.00026556363,0.0005432998,0.00031713216,0.00011729162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040860013,0.00017446373,0.00033911224,0.00089734176,0.00006565249,0.00011196735,0.0015063626,0.000077703495,0.000115939845],"category_scores_gemma":[0.00018132677,0.00012223682,0.0004162219,0.0012092763,0.00035377996,0.00086937717,0.0001771477,0.00050013256,0.00001293335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013921781,0.000087971945,0.000052527103,0.00007531089,0.00017120682,0.00016846853,0.0010269659,0.00034489483,0.0051772757,0.8587099,0.0005603968,0.13348588],"study_design_scores_gemma":[0.00026719057,0.0003595532,0.00007928284,0.00023724102,0.000019357312,0.0003049695,0.000095697935,0.0015921642,0.025998907,0.967843,0.0030697212,0.000132893],"about_ca_topic_score_codex":4.3871896e-7,"about_ca_topic_score_gemma":4.1208088e-7,"teacher_disagreement_score":0.9515346,"about_ca_system_score_codex":0.00003564568,"about_ca_system_score_gemma":0.00019003879,"threshold_uncertainty_score":0.49846724},"labels":[],"label_agreement":null},{"id":"W4395462958","doi":"10.1002/jgt.23104","title":"Tree independence number I. (Even hole, diamond, pyramid)‐free graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Alexander von Humboldt-Stiftung","keywords":"Treewidth; Combinatorics; Mathematics; Bounded function; Clique-sum; Partial k-tree; Tree-depth; Discrete mathematics; Chordal graph; Independent set; Tree decomposition; Conjecture; 1-planar graph; Graph; Pathwidth; Line graph","score_opus":0.014898540024867096,"score_gpt":0.2909779846108253,"score_spread":0.27607944458595823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395462958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12603205,0.011634615,0.8324231,0.0021624104,0.0040282714,0.00041159874,0.000025368592,0.00046204546,0.022820553],"genre_scores_gemma":[0.98421466,0.000618222,0.013511697,0.00022541116,0.00022422553,0.000010292191,6.5116734e-7,0.000053280288,0.001141562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959677,0.000639694,0.0007487345,0.00049257337,0.0014884134,0.0006628845],"domain_scores_gemma":[0.9966073,0.001109918,0.0002947088,0.0012072315,0.00039956818,0.0003812995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0046120966,0.00032392252,0.00044766683,0.0011495806,0.0001926129,0.00046058474,0.004042409,0.00018176805,0.00016089756],"category_scores_gemma":[0.00045934314,0.0002542937,0.0006443473,0.0023971733,0.0005199139,0.0022910773,0.0006319416,0.0014757769,0.00014584744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011813933,0.00009456605,0.0008226453,0.000045730972,0.0001960975,0.0010331322,0.0006865003,0.00006180566,0.0017239638,0.92277485,0.003324879,0.069117695],"study_design_scores_gemma":[0.00051052397,0.00022483087,0.001171127,0.00021203581,0.00003191011,0.0007799085,0.00017772886,0.0004332803,0.0021039972,0.99137247,0.0026863704,0.0002958031],"about_ca_topic_score_codex":0.0000031463665,"about_ca_topic_score_gemma":0.000006993225,"teacher_disagreement_score":0.8581826,"about_ca_system_score_codex":0.00006314513,"about_ca_system_score_gemma":0.00027269352,"threshold_uncertainty_score":0.99999094},"labels":[],"label_agreement":null},{"id":"W4395481781","doi":"10.4230/lipics.fsttcs.2024.7","title":"Minimum Consistent Subset in Trees and Interval Graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Interval (graph theory); Combinatorics; Mathematics; Interval graph; Discrete mathematics; Chordal graph; Computer science; Graph; 1-planar graph","score_opus":0.07786774674370767,"score_gpt":0.22547202554912035,"score_spread":0.1476042788054127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395481781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9712324,0.0006840731,0.024564069,0.0002704791,0.00051568105,0.0003615863,0.000028713146,0.00021480476,0.0021281522],"genre_scores_gemma":[0.997761,0.00033255568,0.0006914594,0.000046128982,0.000015625028,0.000001973004,0.0000058009477,0.00001784865,0.0011275901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977057,0.00022808166,0.00021173802,0.0013197344,0.000111227324,0.00042351923],"domain_scores_gemma":[0.99844867,0.00021213699,0.000086214546,0.0009886278,0.00007861808,0.00018575984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040689058,0.00030100174,0.00036000315,0.00088314275,0.00006435046,0.00017047767,0.0014706737,0.0002082558,0.000012286076],"category_scores_gemma":[0.000039696366,0.00033081844,0.00018642665,0.0009691381,0.00035951598,0.0002211242,0.005466655,0.0009790672,0.000051595904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006367285,0.00007877837,0.0054055788,0.000176536,0.00009262517,0.001998783,0.00053440133,0.0051892926,0.00009796158,0.9847418,0.00017241668,0.0014481638],"study_design_scores_gemma":[0.00041147764,0.000073624215,0.0022570416,0.000243653,0.000024841536,0.000015455316,0.00015932492,0.1423843,0.00010663184,0.85375834,0.00018456264,0.00038076902],"about_ca_topic_score_codex":0.0000686583,"about_ca_topic_score_gemma":0.0003009928,"teacher_disagreement_score":0.13719502,"about_ca_system_score_codex":0.0001389189,"about_ca_system_score_gemma":0.00013697594,"threshold_uncertainty_score":0.9999144},"labels":[],"label_agreement":null},{"id":"W4395689393","doi":"10.1016/j.dam.2024.04.012","title":"Proximity and remoteness in graphs: A survey","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"United Arab Emirates University","keywords":"Mathematics; Combinatorics","score_opus":0.030622952570315574,"score_gpt":0.30350614578349416,"score_spread":0.2728831932131786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395689393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09857776,0.0003973711,0.8937667,0.00017539652,0.00007734999,0.000594263,0.000010504517,0.00029410826,0.0061065536],"genre_scores_gemma":[0.8618464,0.00006957391,0.1378253,0.00004622502,0.000009838307,0.00006523178,0.0000055209043,0.00002785992,0.0001040557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986599,0.000049888215,0.00025547683,0.00043051277,0.00028357495,0.0003206417],"domain_scores_gemma":[0.9988184,0.0004907722,0.000032886164,0.00054695876,0.000027063848,0.00008394801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013273672,0.0001566059,0.00021597162,0.00023847594,0.000054514734,0.00025123756,0.0005425322,0.000060271366,0.0000046323366],"category_scores_gemma":[0.00008241059,0.00012807545,0.000032255062,0.0010232623,0.0001184261,0.0003077652,0.00036344185,0.00023301531,0.000025643369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054093225,0.000027719943,0.00008998866,0.00028285797,0.000010369514,0.000021587408,0.0010487246,0.000010711141,0.0009274716,0.988861,0.00004097173,0.008673173],"study_design_scores_gemma":[0.00014699395,0.00001664901,0.0013043421,0.00007545772,0.0000027890305,0.000014253443,0.0000798717,0.049147114,0.00083374494,0.94807,0.00011615406,0.00019261727],"about_ca_topic_score_codex":0.000009779711,"about_ca_topic_score_gemma":0.000031195865,"teacher_disagreement_score":0.76326865,"about_ca_system_score_codex":0.000024090734,"about_ca_system_score_gemma":0.000040492705,"threshold_uncertainty_score":0.5222765},"labels":[],"label_agreement":null},{"id":"W4395695587","doi":"10.1007/s10878-024-01165-3","title":"Planar graphs are acyclically edge $$(\\Delta + 5)$$-colorable","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Ministry of Science and Technology of the People's Republic of China; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Combinatorics; Planar graph; Theory of computation; Mathematics; Enhanced Data Rates for GSM Evolution; Planar; Outerplanar graph; Chordal graph; Delta; Computer science; Pathwidth; Discrete mathematics; Graph; Physics; Algorithm; Telecommunications; Line graph; Computer graphics (images)","score_opus":0.014175916864579724,"score_gpt":0.2796604955159583,"score_spread":0.26548457865137853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395695587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019208328,0.0008535536,0.9871768,0.0015849187,0.007297837,0.00016116581,0.0000031153536,0.0001202488,0.0008815777],"genre_scores_gemma":[0.7277237,0.0006417713,0.26992527,0.00022312322,0.0011042446,0.000012995884,0.000007722595,0.00006769287,0.00029348533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980139,0.00019427731,0.00053603156,0.00024176892,0.00072421134,0.0002897874],"domain_scores_gemma":[0.9983152,0.00030865034,0.0002906119,0.0003186657,0.0005760258,0.00019082802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010310645,0.0001546599,0.00028357745,0.0005627073,0.00013617765,0.00046762088,0.0010310515,0.00011689415,0.000027247115],"category_scores_gemma":[0.00031649397,0.00013241378,0.00017237032,0.0013829293,0.000063026106,0.0018380203,0.000106909196,0.00047648355,0.000016934162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012609959,0.00015701295,0.0001148062,0.00004359272,0.00008416993,0.00023973822,0.000223059,0.097370096,0.0003857447,0.8931469,0.005596418,0.0025124077],"study_design_scores_gemma":[0.0012987735,0.0006908207,0.00010006546,0.00024072385,0.000029600318,0.00016998632,0.000033569893,0.21782453,0.0010534184,0.7693736,0.00890747,0.00027743742],"about_ca_topic_score_codex":0.0000014569382,"about_ca_topic_score_gemma":1.9218088e-7,"teacher_disagreement_score":0.72580284,"about_ca_system_score_codex":0.00011615778,"about_ca_system_score_gemma":0.00023930256,"threshold_uncertainty_score":0.5399677},"labels":[],"label_agreement":null},{"id":"W4396212934","doi":"10.61091/jcmcc119-13","title":"NDC Pebbling Number for Some Class of Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Mathematics; Combinatorics; Computer science; Discrete mathematics; Artificial intelligence","score_opus":0.0224031363621556,"score_gpt":0.3129240023425292,"score_spread":0.29052086598037363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396212934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5159004,0.0022182553,0.4413585,0.00049101864,0.038301125,0.0007458101,0.0000072615694,0.00016237711,0.0008152929],"genre_scores_gemma":[0.96299225,0.00006635848,0.03594239,0.0000145562535,0.0009301356,0.0000037955697,5.607549e-7,0.0000391836,0.000010763245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701524,0.000116972325,0.0012535506,0.000315233,0.00085380307,0.00044521503],"domain_scores_gemma":[0.9955505,0.0024530906,0.0006829808,0.00037279679,0.0007336536,0.00020698861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030612724,0.00027839266,0.0007854447,0.00041672596,0.00021628947,0.0004280163,0.0010637278,0.00013183086,0.0000032108069],"category_scores_gemma":[0.00059390895,0.00024168206,0.00038611246,0.0007492499,0.00014190149,0.00081218744,0.00041326415,0.0005445634,0.0000024469161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052199153,0.00021634881,0.000033265023,0.0006020026,0.0001380212,0.000026973743,0.0007791429,0.00003982753,0.0011015855,0.9931271,0.00019239861,0.0036911557],"study_design_scores_gemma":[0.0018279726,0.00059756037,0.00000791438,0.00060078234,0.000049393893,0.00014129195,0.0001123875,0.040215008,0.0028603456,0.9522098,0.0011486884,0.0002288566],"about_ca_topic_score_codex":0.0000017774419,"about_ca_topic_score_gemma":5.363745e-8,"teacher_disagreement_score":0.4470919,"about_ca_system_score_codex":0.0000685464,"about_ca_system_score_gemma":0.0002507841,"threshold_uncertainty_score":0.9855508},"labels":[],"label_agreement":null},{"id":"W4396240826","doi":"10.61091/jcmcc119-25","title":"An Upper Bound on the Total Roman { 2 } -domination Number of Graphs with Minimum Degree Two","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Babol Noshirvani University of Technology","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Vertex (graph theory); Minimum weight; Degree (music); Upper and lower bounds; Dominating set; Order (exchange); Induced subgraph; Function (biology); Discrete mathematics; Physics","score_opus":0.0194097962874946,"score_gpt":0.3029665248546538,"score_spread":0.2835567285671592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396240826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95887834,0.00014055273,0.033407237,0.00027396315,0.005704859,0.00028900456,0.0000016257296,0.000050929557,0.0012534865],"genre_scores_gemma":[0.9912363,0.000009500167,0.0082071815,0.000014265155,0.00048506464,0.0000030429214,5.3296617e-7,0.000034060587,0.000010000183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970189,0.00028236123,0.00083078345,0.00031261734,0.0011939527,0.00036140005],"domain_scores_gemma":[0.9962122,0.0019005225,0.00057451305,0.0005323489,0.0005988601,0.00018154728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026791105,0.00029158522,0.0005445571,0.00030003622,0.00030715446,0.0006282491,0.001042152,0.00009461263,0.000009574509],"category_scores_gemma":[0.00023346097,0.0001871805,0.00018192173,0.0008186349,0.00022876692,0.0006736626,0.00022730476,0.0006574033,0.0000039499946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108122986,0.00038604008,0.000084400075,0.00010119208,0.000113085734,0.000044737586,0.0014072581,0.00006738858,0.0010229897,0.9941571,0.00006503266,0.0024426824],"study_design_scores_gemma":[0.0019311552,0.0016432074,0.00015717515,0.000575022,0.00004760962,0.0003475985,0.00027059283,0.038257565,0.0020781367,0.95438725,0.00006699459,0.00023771424],"about_ca_topic_score_codex":0.0000046181667,"about_ca_topic_score_gemma":2.598437e-7,"teacher_disagreement_score":0.039769843,"about_ca_system_score_codex":0.000070750095,"about_ca_system_score_gemma":0.00019879288,"threshold_uncertainty_score":0.7632999},"labels":[],"label_agreement":null},{"id":"W4396571105","doi":"10.1007/978-981-97-2340-9_13","title":"On the 3-Tree Core of Plane Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Core (optical fiber); Tree (set theory); Plane (geometry); Theoretical computer science; Combinatorics; Mathematics; Geometry; Telecommunications","score_opus":0.03032448685657374,"score_gpt":0.28373159396970354,"score_spread":0.2534071071131298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396571105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024439566,0.00064884935,0.979625,0.001262756,0.0013452095,0.00046327163,0.000014587125,0.00013483167,0.016261104],"genre_scores_gemma":[0.8107357,0.00021251186,0.17971444,0.003617681,0.0005237308,0.000049399732,0.000010861418,0.00016140085,0.0049742605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960031,0.00003642599,0.0004420565,0.0013542622,0.0015323289,0.0006318547],"domain_scores_gemma":[0.9949143,0.0023581763,0.00019525683,0.0022021302,0.00020202887,0.00012811346],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012787821,0.00046336403,0.00045176112,0.0011821935,0.00019676074,0.00026561317,0.0059101596,0.00021805063,0.000037306843],"category_scores_gemma":[0.00016374976,0.00030286747,0.00018943574,0.0013035182,0.0018282941,0.0002385632,0.0018173617,0.0013977905,0.00011176692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009066273,0.000013774452,0.0000065486647,0.00003433207,0.000012895586,0.00008826886,0.00028076206,0.00419215,0.00017788782,0.8759712,0.000051438576,0.119161695],"study_design_scores_gemma":[0.00008392825,0.00025753694,0.000018821465,0.00047197644,0.0000041760763,0.00003863587,1.581406e-7,0.06646458,0.0018729815,0.9299308,0.0005589558,0.0002974393],"about_ca_topic_score_codex":0.0000069001403,"about_ca_topic_score_gemma":0.000040623207,"teacher_disagreement_score":0.8104913,"about_ca_system_score_codex":0.00012254732,"about_ca_system_score_gemma":0.00030333785,"threshold_uncertainty_score":0.99994236},"labels":[],"label_agreement":null},{"id":"W4396609193","doi":"10.1016/j.comgeo.2024.102103","title":"Distance queries over dynamic interval graphs","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval (graph theory); Interval graph; Computer science; Combinatorics; Mathematics; Chordal graph; Theoretical computer science; Graph; 1-planar graph","score_opus":0.012364742372267706,"score_gpt":0.3126870457532805,"score_spread":0.3003223033810128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396609193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036927216,0.0023830184,0.9581202,0.0005683286,0.000696807,0.00009659751,0.000017262884,0.00041760548,0.0007729107],"genre_scores_gemma":[0.95668674,0.000017569893,0.042251844,0.00017071652,0.000031792275,0.000016547301,0.000022479813,0.000016844566,0.0007854639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840236,0.00006309233,0.00021305229,0.00049568544,0.0005243388,0.00030148058],"domain_scores_gemma":[0.9989161,0.0005411361,0.000030349605,0.00031194187,0.00010148049,0.00009898024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028234604,0.00014949743,0.00013650766,0.00056013005,0.00012620522,0.00036289482,0.0007558468,0.00004244081,0.00008117053],"category_scores_gemma":[0.000064896994,0.00014204637,0.00011867351,0.002031599,0.00018353156,0.00083233416,0.00033411378,0.00025545032,0.00021277394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007966798,0.000025980935,0.00039610374,0.000056183257,0.000037055182,0.00006206285,0.0001603654,0.007099886,0.00005790952,0.9558847,0.0007053263,0.035506442],"study_design_scores_gemma":[0.00008428898,0.000036010948,0.0072450265,0.000048132235,0.0000018922782,0.00002689343,0.000013462944,0.35183284,0.000023978686,0.63564146,0.004898395,0.00014760467],"about_ca_topic_score_codex":0.0000025796924,"about_ca_topic_score_gemma":0.0000028346212,"teacher_disagreement_score":0.9197595,"about_ca_system_score_codex":0.000086445456,"about_ca_system_score_gemma":0.00009610354,"threshold_uncertainty_score":0.57924825},"labels":[],"label_agreement":null},{"id":"W4396700657","doi":"10.1002/jgt.23113","title":"Gallai‐like characterization of strong cocomparability graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Characterization (materials science); Combinatorics; Discrete mathematics; Physics","score_opus":0.0202377984288647,"score_gpt":0.29752501998863096,"score_spread":0.27728722155976626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396700657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4236257,0.0009683916,0.5734885,0.00019083546,0.00089902786,0.00014002777,0.000007946364,0.00005733892,0.0006222473],"genre_scores_gemma":[0.99621123,0.00015121317,0.003416493,0.000037644837,0.000060778395,0.0000031147406,0.0000014259383,0.000015109932,0.00010299659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975919,0.0005616156,0.00069083256,0.00024977818,0.000625647,0.0002802157],"domain_scores_gemma":[0.9981107,0.0005157503,0.00033734075,0.0005010109,0.00038624633,0.00014892062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033588503,0.00015870009,0.0003515001,0.0008693178,0.00007601573,0.000114135975,0.0011335793,0.000065051565,0.000054388165],"category_scores_gemma":[0.00009243798,0.00012510114,0.00036717462,0.0012849515,0.0003027845,0.001181121,0.00014255718,0.0004527964,0.000007676317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012906638,0.00010200139,0.00089841307,0.00009720576,0.000118514705,0.000043600212,0.00054090115,0.0000500397,0.05598611,0.92414665,0.000055954326,0.01783155],"study_design_scores_gemma":[0.0002981285,0.00034783926,0.008278202,0.00020827807,0.0000250573,0.00013299122,0.00006740046,0.0009932,0.010652172,0.97772163,0.0011133567,0.00016177085],"about_ca_topic_score_codex":5.833299e-7,"about_ca_topic_score_gemma":5.1322786e-7,"teacher_disagreement_score":0.5725855,"about_ca_system_score_codex":0.00004040887,"about_ca_system_score_gemma":0.00014511064,"threshold_uncertainty_score":0.51014763},"labels":[],"label_agreement":null},{"id":"W4396867382","doi":"10.1002/jgt.23117","title":"Density of 3‐critical signed graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Centre National de la Recherche Scientifique; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Indo-French Centre for Applied Mathematics; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Signed graph; Discrete mathematics; Graph","score_opus":0.01684958187808392,"score_gpt":0.3136223571510856,"score_spread":0.29677277527300167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396867382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10905311,0.0044304114,0.8833614,0.0007615609,0.0010805528,0.00008061857,0.0000033011836,0.00006830187,0.0011607651],"genre_scores_gemma":[0.98488045,0.00008459366,0.014805024,0.000079055695,0.0000654451,0.000001138215,1.2212669e-7,0.000014098044,0.000070104536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771583,0.00053440314,0.00054059894,0.00022104479,0.00067122275,0.00031690995],"domain_scores_gemma":[0.9968258,0.0019654203,0.00013178335,0.00043632384,0.00044196247,0.0001986932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035005314,0.00014296867,0.00032629297,0.0009558774,0.00008292902,0.00009564001,0.00118813,0.00007502739,0.000045972167],"category_scores_gemma":[0.0006239074,0.00010981646,0.0004413605,0.0012846638,0.0005856924,0.0008439507,0.00018776403,0.000520231,0.000013267872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009664279,0.000090502566,0.00012681188,0.000081038605,0.000080214566,0.00033961982,0.0004194863,0.000012730385,0.014226541,0.97108084,0.00022740384,0.013218184],"study_design_scores_gemma":[0.0001690106,0.00035957704,0.00040161095,0.0001376074,0.000024750489,0.00039526809,0.00009137524,0.00026806875,0.016058523,0.98179865,0.00018527338,0.00011029783],"about_ca_topic_score_codex":7.07785e-7,"about_ca_topic_score_gemma":4.5441743e-7,"teacher_disagreement_score":0.8758273,"about_ca_system_score_codex":0.000025328287,"about_ca_system_score_gemma":0.00014997038,"threshold_uncertainty_score":0.44781852},"labels":[],"label_agreement":null},{"id":"W4396872920","doi":"10.1007/s00453-024-01236-1","title":"Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Parameterized complexity; Theory of computation; Center (category theory); Computer science; Algorithm; Approximation algorithm; Cluster analysis; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.023096027130502784,"score_gpt":0.2990533772984482,"score_spread":0.2759573501679454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396872920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055603012,0.00047123304,0.9920738,0.0006191862,0.00051681965,0.00040583962,0.000020655774,0.00018883399,0.00014333036],"genre_scores_gemma":[0.21797226,0.00010020099,0.7809546,0.00017347133,0.00016787637,0.00017620201,0.0000123593145,0.000038356386,0.00040465954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986851,0.000051236973,0.00018171035,0.0005568289,0.00018218906,0.0003429244],"domain_scores_gemma":[0.9992206,0.0002835215,0.00003461152,0.0002980551,0.000050881823,0.00011233804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044911125,0.00015141375,0.00016264491,0.00016476182,0.00014639003,0.0006013886,0.00027255135,0.000065056134,0.000004616953],"category_scores_gemma":[0.000060649883,0.00013656063,0.000044442488,0.00025375784,0.000109364635,0.0007618955,0.0003245651,0.0001342721,0.0000075817215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040597926,0.000045789682,0.000011371145,0.00016040099,0.000063600775,0.00003522188,0.00054229813,0.0000063143343,0.0027011659,0.035057433,0.00013439872,0.9612014],"study_design_scores_gemma":[0.00063782855,0.00016838766,0.000089586356,0.000060645078,0.0000074581994,0.000114584116,0.000015277876,0.91925544,0.000514346,0.07354146,0.0053999643,0.00019504002],"about_ca_topic_score_codex":0.0000031149618,"about_ca_topic_score_gemma":7.7705323e-7,"teacher_disagreement_score":0.96100634,"about_ca_system_score_codex":0.000027317144,"about_ca_system_score_gemma":0.00002585949,"threshold_uncertainty_score":0.5799204},"labels":[],"label_agreement":null},{"id":"W4396892769","doi":"10.1145/3651144","title":"On Reporting Durable Patterns in Temporal Proximity Graphs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.08898262796644435,"score_gpt":0.3509226316586121,"score_spread":0.26194000369216774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396892769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97934157,0.00011268691,0.0026072762,0.0063318983,0.00030494604,0.0012653444,0.000051194882,0.00019110837,0.009793964],"genre_scores_gemma":[0.98228,0.000049236616,0.01724398,0.000050419418,0.000009016332,0.00002116717,0.0000049948694,0.000013042466,0.00032815104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771136,0.0000137529,0.0006148742,0.0006668103,0.0007168595,0.00027635114],"domain_scores_gemma":[0.9971404,0.00009676366,0.0004688462,0.0021974335,0.00006305445,0.00003348528],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0024990786,0.00013496938,0.0001933129,0.00032387962,0.000059695012,0.00011601281,0.008567345,0.000027892576,0.0000045368383],"category_scores_gemma":[0.00073450175,0.000096232005,0.00006231999,0.0011741532,0.00006573793,0.0013041284,0.008387004,0.00026019532,0.0000048555185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006203659,0.0002575031,0.031742632,0.0023035074,0.0001055475,0.00003263798,0.00018493416,0.00003503736,0.0011962745,0.93479335,0.003966375,0.025320133],"study_design_scores_gemma":[0.00036489664,0.00022392854,0.019307509,0.002907885,0.00002180671,0.0000057906796,0.00028163797,0.008997332,0.011457527,0.9554198,0.00076799956,0.00024393297],"about_ca_topic_score_codex":0.00001706558,"about_ca_topic_score_gemma":0.000002242875,"teacher_disagreement_score":0.0250762,"about_ca_system_score_codex":0.00003236486,"about_ca_system_score_gemma":0.000013795697,"threshold_uncertainty_score":0.99963295},"labels":[],"label_agreement":null},{"id":"W4396904930","doi":"10.1007/s00493-024-00106-2","title":"List-k-Coloring H-Free Graphs for All $$k&gt;4$$","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03212748022118933,"score_gpt":0.3144627735592146,"score_spread":0.28233529333802526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396904930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012865114,0.009213098,0.9386625,0.006492839,0.0074607357,0.0015322353,0.000025190067,0.0029663937,0.020781877],"genre_scores_gemma":[0.9762661,0.0001192973,0.020326536,0.00020455242,0.000083190585,0.00034924582,0.0000042436277,0.00005026264,0.0025966128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981872,0.000056612025,0.00020513583,0.0006101957,0.00036521803,0.0005756571],"domain_scores_gemma":[0.9978741,0.0006347489,0.000029868806,0.0011581073,0.00012334675,0.00017983913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000539255,0.00017638662,0.00018444336,0.0003176239,0.0001766369,0.0003355145,0.0022797657,0.00007380898,0.000012730022],"category_scores_gemma":[0.00024471513,0.00016700948,0.0001719826,0.0012062538,0.00007368049,0.0006138432,0.00073501095,0.00025232753,0.000072080096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007756401,0.000045656925,0.000026394871,0.000065510845,0.00003121114,0.000038827257,0.00018464429,0.0000040766577,0.0009610311,0.9771241,0.01054513,0.010965657],"study_design_scores_gemma":[0.0003067512,0.00016557095,0.000045947476,0.000026838761,0.0000058488868,0.000009529276,0.000005694858,0.0066413134,0.0016931351,0.80196804,0.1889532,0.00017810105],"about_ca_topic_score_codex":0.0000034658192,"about_ca_topic_score_gemma":0.0000011289716,"teacher_disagreement_score":0.96340096,"about_ca_system_score_codex":0.000118353,"about_ca_system_score_gemma":0.00008060169,"threshold_uncertainty_score":0.6810449},"labels":[],"label_agreement":null},{"id":"W4396917302","doi":"10.1051/ro/2024108","title":"Graphs obtained by disjoint unions and joins of cliques and stable sets","year":2024,"lang":"en","type":"article","venue":"RAIRO. Operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Joins; Disjoint sets; Combinatorics; Mathematics; Computer science; Programming language","score_opus":0.047757475617777975,"score_gpt":0.394298531317709,"score_spread":0.346541055699931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396917302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6085132,0.01696456,0.34117195,0.021564687,0.0002046031,0.0021903613,0.00035623534,0.00052698643,0.008507444],"genre_scores_gemma":[0.98383677,0.0014544101,0.011485664,0.000030106869,0.000013683339,0.000105653395,0.000019393809,0.000018755378,0.0030355381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976119,0.000536233,0.00025009213,0.00052750437,0.00060233974,0.00047195895],"domain_scores_gemma":[0.99826705,0.000586925,0.000008734253,0.0005486169,0.0003719332,0.00021671693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019451804,0.00012302525,0.00017157289,0.00067683856,0.000552098,0.00060483173,0.0004595448,0.00006492554,0.00004504741],"category_scores_gemma":[0.00027732918,0.00010484347,0.000035789315,0.0014721055,0.00059701066,0.0009326616,0.0006431793,0.00047149594,0.000016076787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098380615,0.00008422893,0.00021171743,0.00010189875,0.00003473373,0.00001587374,0.0014861942,0.00014658194,0.028149778,0.9492649,0.003654281,0.016839998],"study_design_scores_gemma":[0.0010354121,0.001356619,0.002539838,0.00037607274,0.00001425778,0.00010498676,0.0013164176,0.63024455,0.0425595,0.28199542,0.03771797,0.0007389515],"about_ca_topic_score_codex":0.00018985475,"about_ca_topic_score_gemma":0.00015570846,"teacher_disagreement_score":0.66726947,"about_ca_system_score_codex":0.00004894968,"about_ca_system_score_gemma":0.00026311944,"threshold_uncertainty_score":0.5832406},"labels":[],"label_agreement":null},{"id":"W4398143410","doi":"10.1007/s10878-024-01177-z","title":"On the oriented diameter of planar triangulations","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Treewidth; Pathwidth; Outerplanar graph; Bounded function; 1-planar graph; Discrete mathematics; Upper and lower bounds; Book embedding; Graph; Chordal graph; Line graph","score_opus":0.015825023237351098,"score_gpt":0.2827445070449693,"score_spread":0.2669194838076182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398143410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015482712,0.0001565556,0.9930569,0.0018373369,0.0027902555,0.000112363545,0.0000016916412,0.000019580284,0.0004770736],"genre_scores_gemma":[0.8796516,0.00005394755,0.119750485,0.00007589914,0.00032675752,0.000004924047,0.0000018989934,0.000018760924,0.000115715484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988159,0.00018872444,0.00034717636,0.000090908106,0.00045924686,0.000098032804],"domain_scores_gemma":[0.9981892,0.0010359872,0.00018644179,0.00022002196,0.0003233203,0.000045012657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079327,0.000067713,0.0001326086,0.00028399559,0.00006772807,0.00008057469,0.00043092418,0.0000380476,0.00003484202],"category_scores_gemma":[0.0005954561,0.00004254268,0.000103999766,0.00082016294,0.000047019108,0.0004522191,0.000031992397,0.00020292017,0.0000037668735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006129822,0.000050846596,0.000009470383,0.0000055179903,0.00003551747,0.000007493894,0.00023370821,0.07870265,0.0001245595,0.91905963,0.0009531539,0.00075616885],"study_design_scores_gemma":[0.0011588163,0.0009451662,0.000056015444,0.00017875653,0.00002770417,0.00002745574,0.000037550657,0.3748191,0.002694581,0.617075,0.002855462,0.00012438779],"about_ca_topic_score_codex":0.0000024474025,"about_ca_topic_score_gemma":1.5539774e-7,"teacher_disagreement_score":0.8781033,"about_ca_system_score_codex":0.00005661299,"about_ca_system_score_gemma":0.00016942556,"threshold_uncertainty_score":0.17348401},"labels":[],"label_agreement":null},{"id":"W4398163973","doi":"10.1109/dcc58796.2024.00058","title":"Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Bounded function; Combinatorics; Interval (graph theory); Graph; Degree (music); Interval graph; Discrete mathematics; Mathematics; Computer science; Line graph; Physics; Pathwidth; Mathematical analysis","score_opus":0.0951751355430854,"score_gpt":0.38383912099140566,"score_spread":0.2886639854483203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398163973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01377343,0.0003086747,0.9793486,0.00073869876,0.00070298085,0.0004294882,0.000043290333,0.00058634224,0.0040684757],"genre_scores_gemma":[0.7353651,0.000010769555,0.26259425,0.000189782,0.00007637611,0.000038573347,0.000041477197,0.00002842608,0.0016552412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981337,0.00007932432,0.00024205497,0.00074686244,0.00034761566,0.0004503963],"domain_scores_gemma":[0.9974678,0.0005632825,0.000025940053,0.0017561949,0.00006674536,0.00012000855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006120587,0.00017556138,0.00018301125,0.00016507025,0.00014619745,0.000698998,0.0030711645,0.000054476208,0.00026119448],"category_scores_gemma":[0.00013861968,0.00013170528,0.0000996781,0.0006461689,0.00011742657,0.00138543,0.0012837866,0.00018476405,0.0001554643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010613934,0.000014158269,0.000105975654,0.00012120206,0.00006222961,0.000023141887,0.00014400914,0.0000033285442,0.00023785865,0.94546837,0.009162124,0.044646997],"study_design_scores_gemma":[0.00019449307,0.000056822955,0.0003193674,0.00003768423,0.000008851374,0.00007161376,0.00003221032,0.105677284,0.000929594,0.8828028,0.009680764,0.0001885312],"about_ca_topic_score_codex":0.000022206035,"about_ca_topic_score_gemma":0.000076160955,"teacher_disagreement_score":0.72159165,"about_ca_system_score_codex":0.00003552831,"about_ca_system_score_gemma":0.00010834597,"threshold_uncertainty_score":0.6740454},"labels":[],"label_agreement":null},{"id":"W4399075280","doi":"10.1007/s00453-024-01242-3","title":"Approximation Algorithms for Covering Vertices by Long Paths","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology of the People's Republic of China","keywords":"Theory of computation; Combinatorics; Approximation algorithm; Computer science; Algorithm; Mathematics; Discrete mathematics","score_opus":0.02174289278522585,"score_gpt":0.30872613055365705,"score_spread":0.2869832377684312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399075280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008950653,0.0016871964,0.9950091,0.0005209776,0.0005663073,0.00039963645,0.000032451753,0.00046211976,0.0004271441],"genre_scores_gemma":[0.2495987,0.00015765411,0.7453951,0.00034241623,0.0005816766,0.00066424056,0.000096334465,0.000109848064,0.0030540382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984189,0.000047685466,0.00020651257,0.00055111555,0.0003363539,0.00043942398],"domain_scores_gemma":[0.998956,0.00040886723,0.000032269694,0.00041411445,0.0000808921,0.00010783343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045838955,0.00015433533,0.00014274633,0.0001450232,0.00015608402,0.0004304623,0.0007386078,0.000065204666,0.000010680233],"category_scores_gemma":[0.00007147083,0.00014493457,0.0000927975,0.0005406469,0.000060185295,0.0011417726,0.0001982359,0.0001668399,0.0000794151],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000871902,0.00004352375,0.000008603729,0.00013495385,0.00005102159,0.000024831268,0.00032904217,0.000076521545,0.0043286453,0.08233606,0.0022431242,0.91041493],"study_design_scores_gemma":[0.00023500666,0.00011748194,0.000019210023,0.000054688957,0.000008226085,0.000019194249,0.000021301645,0.8778918,0.029280255,0.065594666,0.026513992,0.00024419255],"about_ca_topic_score_codex":0.000006501674,"about_ca_topic_score_gemma":7.2358597e-7,"teacher_disagreement_score":0.91017073,"about_ca_system_score_codex":0.00007451811,"about_ca_system_score_gemma":0.000057044348,"threshold_uncertainty_score":0.59102607},"labels":[],"label_agreement":null},{"id":"W4399213339","doi":"10.37236/12429","title":"Constructing Graphs with No Independent Transversals","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Maximal independent set; Chordal graph; 1-planar graph; Graph","score_opus":0.007709438158755823,"score_gpt":0.25164732720706195,"score_spread":0.24393788904830613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399213339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08255264,0.008879262,0.9020081,0.001985924,0.001102393,0.00019712583,7.2251316e-7,0.0001036367,0.003170194],"genre_scores_gemma":[0.99901927,0.0004023973,0.00028074614,0.00003187032,0.000045736768,0.0000021748929,1.2226559e-7,0.000016808594,0.00020088245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790144,0.0001961892,0.0003066005,0.00017354022,0.0008016055,0.0006206057],"domain_scores_gemma":[0.9986237,0.00046352294,0.00014528459,0.0003450045,0.00032805023,0.000094396455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019446405,0.00014581284,0.00020923109,0.0002558407,0.00013948728,0.0002128555,0.0014862934,0.000043788812,0.000009503241],"category_scores_gemma":[0.000049898546,0.00008542702,0.00012839204,0.0012143141,0.00014248269,0.00062476896,0.000077055796,0.0013469567,0.000014796433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039431463,0.000025340254,0.00009782919,0.000015358517,0.00013313924,0.0000857602,0.00028833887,0.000046467732,0.00019773639,0.9947553,0.000066077504,0.0042491844],"study_design_scores_gemma":[0.000494433,0.0008803004,0.000018014136,0.000073834504,0.00002647243,0.0016618199,0.00016900618,0.0013203572,0.002153112,0.99078876,0.0022900691,0.00012383448],"about_ca_topic_score_codex":0.0000015573316,"about_ca_topic_score_gemma":0.0000029187638,"teacher_disagreement_score":0.9164666,"about_ca_system_score_codex":0.0003107965,"about_ca_system_score_gemma":0.0007969778,"threshold_uncertainty_score":0.58519316},"labels":[],"label_agreement":null},{"id":"W4399262599","doi":"10.1007/978-3-031-47417-0_12","title":"Treewidth, Circle Graphs and Circular Drawings","year":2024,"lang":"en","type":"book-chapter","venue":"MATRIX book series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Treewidth; Mathematics; Partial k-tree; 1-planar graph; Combinatorics; Chordal graph; Pathwidth; Graph; Line graph","score_opus":0.011174332977298888,"score_gpt":0.2525441712170429,"score_spread":0.24136983823974403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399262599","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011314089,0.08343356,0.0069515454,0.0021799135,0.0009492827,0.0009034257,0.00007486202,0.0016640174,0.9037303],"genre_scores_gemma":[0.0013690707,0.003383705,0.0028011808,0.0002186157,0.00009392072,0.00003260911,0.000011580459,0.00012925942,0.99196005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975437,0.000024153866,0.00035057566,0.0010100318,0.0005784168,0.0004931285],"domain_scores_gemma":[0.9983655,0.000104908686,0.000109884364,0.0011111548,0.0001017614,0.00020678042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028917042,0.00046061663,0.0004958513,0.0005548587,0.00024145111,0.0005487491,0.0010116046,0.00029193138,0.0001405725],"category_scores_gemma":[0.000017675813,0.00048776966,0.0002420364,0.00014544105,0.0005662178,0.0013200366,0.0009936902,0.00065818056,0.00051574747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011545386,0.000003940518,0.0000031780849,0.00025805528,0.000087355875,0.0003389386,0.00028845275,0.000002335397,0.00015283244,0.9908773,0.0008208988,0.0071551907],"study_design_scores_gemma":[0.00008040314,0.000076754695,0.000006981104,0.0001317279,0.000021976535,0.00014062545,0.000007923695,0.000033491247,0.0001741614,0.618284,0.38070408,0.00033790324],"about_ca_topic_score_codex":0.000005893883,"about_ca_topic_score_gemma":0.000005868334,"teacher_disagreement_score":0.37988317,"about_ca_system_score_codex":0.00006341105,"about_ca_system_score_gemma":0.00010207932,"threshold_uncertainty_score":0.9997574},"labels":[],"label_agreement":null},{"id":"W4399357727","doi":"10.1016/j.tcs.2024.114676","title":"The zero-visibility cops and robber game on graph products","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Partition (number theory); Vertex (graph theory); Graph; Graph partition; Discrete mathematics; Monotonic function; Zero (linguistics)","score_opus":0.01449946632246951,"score_gpt":0.2950471680457049,"score_spread":0.2805477017232354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399357727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042290594,0.00052712305,0.9467622,0.006653735,0.0010428464,0.00039084838,0.000001781908,0.00041865217,0.0019122424],"genre_scores_gemma":[0.9775893,0.000043578122,0.021833612,0.00034211876,0.00010190054,0.00001576504,2.2005474e-7,0.000011736973,0.00006174899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961318,0.00028197843,0.00025885852,0.0013976966,0.0010749777,0.0008547401],"domain_scores_gemma":[0.99626464,0.001558119,0.000028618217,0.0016084774,0.00023095269,0.0003092093],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004584177,0.00022711205,0.00017394045,0.00022706643,0.0008060519,0.0017997768,0.0029072273,0.000044582706,0.00000764786],"category_scores_gemma":[0.00040167783,0.00013442805,0.000059607875,0.0027198798,0.008483643,0.00079440436,0.0016479729,0.00050417014,0.00011501243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014221075,0.00002458616,0.000013402068,0.000014053321,0.0000044322132,0.000019000943,0.00025045354,0.000056154044,0.00045440628,0.89921594,0.00010490007,0.09982846],"study_design_scores_gemma":[0.00007841894,0.00026898723,0.00048487593,0.000043753178,0.0000020912973,0.000047580994,0.0000035593653,0.16866063,0.0034915674,0.8256493,0.001095725,0.00017350905],"about_ca_topic_score_codex":0.0000010407815,"about_ca_topic_score_gemma":3.0747873e-7,"teacher_disagreement_score":0.93529874,"about_ca_system_score_codex":0.00006261571,"about_ca_system_score_gemma":0.00018069509,"threshold_uncertainty_score":0.99923646},"labels":[],"label_agreement":null},{"id":"W4399377993","doi":"10.1145/3662158.3662796","title":"(Δ+1) Vertex Coloring in <i>O</i> ( <i>n</i> ) Communication","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex (graph theory); Computer science; Combinatorics; Mathematics; Theoretical computer science; Graph","score_opus":0.0203841843562385,"score_gpt":0.30369220479877135,"score_spread":0.28330802044253284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399377993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022836497,0.0039036958,0.7803911,0.0053325486,0.0004222621,0.00032578598,8.2155145e-7,0.001105496,0.18568178],"genre_scores_gemma":[0.9757887,0.00012819207,0.022808257,0.00020516272,0.000005572663,0.000026318818,6.840652e-7,0.000006093188,0.0010310293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992889,0.00007203672,0.00010760096,0.00020343253,0.00014425519,0.00018374674],"domain_scores_gemma":[0.9991203,0.00028469227,0.000006008663,0.0005340581,0.00001803572,0.000036930367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004595412,0.000052843396,0.0000579518,0.00015972464,0.000040771207,0.00015495153,0.00083638955,0.000023139111,0.000018749655],"category_scores_gemma":[0.000023868717,0.0000475988,0.000022965976,0.0008852668,0.00003570698,0.00070554257,0.00034284798,0.00018414023,0.00020094671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015434102,0.0000109517205,0.00015180216,0.0000087846065,0.00000205269,0.000014868495,0.00020570446,0.00006029823,0.001048952,0.9614091,0.0006549815,0.03643096],"study_design_scores_gemma":[0.00026188183,0.000055004104,0.0007759756,0.00014640606,0.0000011011483,0.000022883096,0.00009043345,0.27585414,0.010951579,0.6514568,0.060134463,0.00024937929],"about_ca_topic_score_codex":0.00001946572,"about_ca_topic_score_gemma":0.000038247617,"teacher_disagreement_score":0.9529522,"about_ca_system_score_codex":0.000045499924,"about_ca_system_score_gemma":0.00003607915,"threshold_uncertainty_score":0.25828305},"labels":[],"label_agreement":null},{"id":"W4399552751","doi":"10.1007/s00373-024-02808-2","title":"Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum degree spanning tree; Graph; Geometric graph theory; Trémaux tree; Discrete mathematics; Line graph; Voltage graph; Pathwidth","score_opus":0.022334004117094065,"score_gpt":0.2883388245521849,"score_spread":0.2660048204350908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399552751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076842375,0.052532513,0.86170185,0.0042137518,0.0022177785,0.0012296176,0.000034986762,0.00038340274,0.0008437152],"genre_scores_gemma":[0.9980694,0.0009330132,0.0006855323,0.00005296383,0.000015307303,0.00005807685,9.228459e-7,0.000013317605,0.00017143996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998822,0.00007525703,0.00018518571,0.0003047023,0.00030810176,0.00030477098],"domain_scores_gemma":[0.99783593,0.0013973655,0.000049416114,0.0005464042,0.00011219834,0.000058677615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008449348,0.00014244029,0.00015978908,0.00017696219,0.00043297053,0.00024483164,0.0010000503,0.000043791624,0.0000013007469],"category_scores_gemma":[0.000060329607,0.00007560818,0.00015724894,0.0014232652,0.000329521,0.0002104598,0.00023001691,0.00021545513,8.6428594e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000799175,0.000023386609,0.0005478722,0.000050820105,0.000051634448,0.0000022197999,0.00074540015,0.000021974784,0.00018485646,0.97595954,0.0005422842,0.021862026],"study_design_scores_gemma":[0.00019476464,0.00017922513,0.0010706378,0.000042033862,0.000020103414,0.000009471378,0.00027610155,0.011621643,0.0007175792,0.97832346,0.007434044,0.00011094513],"about_ca_topic_score_codex":0.00001952541,"about_ca_topic_score_gemma":0.000006136464,"teacher_disagreement_score":0.92122704,"about_ca_system_score_codex":0.000008259423,"about_ca_system_score_gemma":0.00003799186,"threshold_uncertainty_score":0.33301032},"labels":[],"label_agreement":null},{"id":"W4399739735","doi":"10.1002/jgt.23143","title":"A tight upper bound on the average order of dominating sets of a graph","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Upper and lower bounds; Order (exchange); Discrete mathematics","score_opus":0.016489319360998834,"score_gpt":0.2957467529953223,"score_spread":0.2792574336343235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399739735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82802904,0.004297855,0.1613744,0.0014548316,0.0007587729,0.00029924698,0.00001543211,0.000041114767,0.0037292852],"genre_scores_gemma":[0.99543524,0.00016675775,0.004039452,0.00013882144,0.000051534196,0.000004309925,2.7247125e-7,0.000015488555,0.00014811933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971876,0.00074561854,0.00066688604,0.00022851893,0.0008553468,0.00031599085],"domain_scores_gemma":[0.9955133,0.0030013504,0.000425467,0.00051397504,0.00044681662,0.00009907798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004877963,0.00018521909,0.00036165642,0.0007880866,0.00013690829,0.00010415499,0.0014457422,0.00007017438,0.000099025645],"category_scores_gemma":[0.00045275892,0.00010031338,0.00044524178,0.0018485879,0.00040031128,0.0004989637,0.00020020235,0.0006933884,0.000006341074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021224993,0.00012668337,0.00011554997,0.00008996578,0.00024991093,0.00011225801,0.0021671404,0.00018623687,0.017235557,0.9527295,0.00030428864,0.02647066],"study_design_scores_gemma":[0.00034357837,0.00050769676,0.00051534467,0.0005771522,0.000025100562,0.00016754703,0.00023767215,0.0009269977,0.020284366,0.9756257,0.00065259234,0.00013626905],"about_ca_topic_score_codex":0.0000016376711,"about_ca_topic_score_gemma":0.0000012777075,"teacher_disagreement_score":0.16740619,"about_ca_system_score_codex":0.00002906008,"about_ca_system_score_gemma":0.00014485524,"threshold_uncertainty_score":0.4090661},"labels":[],"label_agreement":null},{"id":"W4399888599","doi":"10.1007/978-3-031-63021-7_24","title":"Directed Path Partition Problem on Directed Acyclic Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Directed acyclic graph; Computer science; Partition (number theory); Directed graph; Path (computing); Longest path problem; Theoretical computer science; Algorithm; Graph; Combinatorics; Chordal graph; Mathematics; Programming language","score_opus":0.018878436264308907,"score_gpt":0.2743530151173555,"score_spread":0.2554745788530466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399888599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019090925,0.00075842906,0.97783273,0.00097182946,0.0018849977,0.00095278793,0.000019831947,0.001963917,0.015424553],"genre_scores_gemma":[0.31101465,0.0005226342,0.67707825,0.0026521094,0.0010838554,0.0002631469,0.00007055021,0.0003406298,0.0069741947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99355906,0.000103224964,0.0006409059,0.0027050942,0.0018109397,0.0011807821],"domain_scores_gemma":[0.9961832,0.00086416135,0.00023921001,0.002040664,0.00035023576,0.0003225287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011375704,0.0007906689,0.000650588,0.0021472475,0.00037504255,0.00088341965,0.0038495983,0.00039753888,0.000036336478],"category_scores_gemma":[0.00014265574,0.00068257924,0.00024697944,0.002628155,0.0010319268,0.00073978695,0.0015856506,0.0018172055,0.00031270942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030641357,0.00008724224,0.000032639906,0.00012468046,0.000038867307,0.00041117467,0.00068145123,0.008833796,0.000705856,0.507421,0.00012881125,0.48150384],"study_design_scores_gemma":[0.00019079125,0.00031321667,0.000080543854,0.0008950575,0.000008316737,0.00004271161,8.480028e-8,0.17096415,0.0016380855,0.8230379,0.0021405022,0.00068863714],"about_ca_topic_score_codex":0.000012537151,"about_ca_topic_score_gemma":0.00005076741,"teacher_disagreement_score":0.4808152,"about_ca_system_score_codex":0.00042567038,"about_ca_system_score_gemma":0.00039143066,"threshold_uncertainty_score":0.99956256},"labels":[],"label_agreement":null},{"id":"W4399888636","doi":"10.1007/978-3-031-63021-7_23","title":"On the Finiteness of k-Vertex-Critical $$2P_2$$-Free Graphs with Forbidden Induced Squids or Bulls","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; The King's University","funders":"","keywords":"Vertex (graph theory); Computer science; Combinatorics; Discrete mathematics; Graph; Mathematics; Theoretical computer science","score_opus":0.03512476857951113,"score_gpt":0.30017009480869183,"score_spread":0.2650453262291807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399888636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001043189,0.0002495947,0.9886258,0.0035119776,0.001147597,0.000688526,0.000022653461,0.00015920063,0.004551453],"genre_scores_gemma":[0.83987886,0.00005449718,0.15519813,0.003065497,0.0002380121,0.000078454934,0.0000037404293,0.00014814435,0.001334693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944342,0.00009465212,0.0005674717,0.0018059359,0.0021553335,0.000942436],"domain_scores_gemma":[0.98956454,0.00617181,0.00016407788,0.0033898358,0.0004931245,0.00021659055],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001527811,0.0006649848,0.0006714425,0.0012956306,0.0003105554,0.0005297614,0.008416413,0.00032899703,0.00006263296],"category_scores_gemma":[0.00084149017,0.0003754839,0.00019510009,0.0021172443,0.002572126,0.00048202023,0.0029111924,0.0017089674,0.000050870287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089011846,0.000044225257,0.000009431435,0.000107417516,0.000031486612,0.00029291466,0.0005575125,0.0018435267,0.00019847277,0.94465053,0.00005163774,0.052123856],"study_design_scores_gemma":[0.00026646978,0.0011744233,0.00001956469,0.001208743,0.00001358269,0.00011744082,9.951223e-7,0.04492622,0.0035916448,0.9480085,0.00015473922,0.00051767123],"about_ca_topic_score_codex":0.000012668179,"about_ca_topic_score_gemma":0.000081495666,"teacher_disagreement_score":0.83883566,"about_ca_system_score_codex":0.00015963589,"about_ca_system_score_gemma":0.00086867675,"threshold_uncertainty_score":0.9998697},"labels":[],"label_agreement":null},{"id":"W4399909327","doi":"10.1007/978-3-031-63021-7_37","title":"Broadcasting in Stars of Cliques","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Stars; Telecommunications; Astronomy; Computer security; Computer vision; Physics","score_opus":0.02653955470938015,"score_gpt":0.30489880643104855,"score_spread":0.2783592517216684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399909327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049182324,0.0014312068,0.98979115,0.0003139321,0.0008287158,0.0003247553,0.000005385254,0.00012523818,0.00668779],"genre_scores_gemma":[0.41165614,0.00015695469,0.58643067,0.00038945183,0.00026153706,0.000013927882,0.0000026632051,0.00007210731,0.0010165449],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597085,0.000047309906,0.0006650001,0.0014851099,0.0011004538,0.000731255],"domain_scores_gemma":[0.9973128,0.0008770813,0.0001986143,0.0012645625,0.00022064552,0.00012630351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016835182,0.00041480322,0.0005645136,0.002129989,0.00007677265,0.0002591097,0.0037243492,0.00023950402,0.000013583382],"category_scores_gemma":[0.00017202331,0.00038373444,0.00012890795,0.0015288454,0.0010301432,0.00061483163,0.0023885525,0.0012871908,0.000029124201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011119204,0.0000262644,0.00014468117,0.00017595282,0.00000966029,0.00032348736,0.0012915678,0.033031892,0.0006389041,0.29916477,0.000005146489,0.6651766],"study_design_scores_gemma":[0.00011691079,0.00015015466,0.000055894798,0.0010198097,0.0000020721482,0.00003259238,2.5286576e-7,0.25126895,0.0025519975,0.7440645,0.0003761771,0.00036071558],"about_ca_topic_score_codex":0.000028831355,"about_ca_topic_score_gemma":0.0001074163,"teacher_disagreement_score":0.66481584,"about_ca_system_score_codex":0.00029391522,"about_ca_system_score_gemma":0.0005148474,"threshold_uncertainty_score":0.9998615},"labels":[],"label_agreement":null},{"id":"W4400139069","doi":"10.5539/jmr.v16n3p49","title":"2-Distance and 3-Distance Domination Numbers of the Sierpinski Star Graph","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universitas Diponegoro","keywords":"Combinatorics; Mathematics; Domination analysis; Vertex (graph theory); Graph; Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.04679325449883979,"score_gpt":0.37815985448198125,"score_spread":0.33136659998314144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400139069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14776097,0.005914515,0.84012455,0.0029137728,0.00039980028,0.00042301638,0.0000082057495,0.000027124119,0.0024280662],"genre_scores_gemma":[0.946005,0.0006143693,0.05255084,0.000010100773,0.000050072067,0.000005690737,1.0255253e-7,0.000017738366,0.0007461033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670315,0.0003383115,0.00053937983,0.00019258622,0.0018881356,0.00033845837],"domain_scores_gemma":[0.99673647,0.0016092414,0.00020309331,0.00054795336,0.00078385853,0.00011939057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006024286,0.00010525997,0.00023764157,0.00048348788,0.0001681934,0.00023751648,0.0014756572,0.000053592397,0.000012515315],"category_scores_gemma":[0.00087601726,0.00006709773,0.00013099214,0.0016780293,0.0005272589,0.00062913203,0.0003724474,0.0007890143,0.000005767347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028241684,0.0001420521,0.000105759806,0.00085255574,0.00006674391,0.00006152783,0.004061095,0.00008450634,0.005799751,0.9793794,0.0013406052,0.008077731],"study_design_scores_gemma":[0.00031305364,0.00018014334,0.00026444232,0.0010118833,0.000008235824,0.00018800101,0.0009718278,0.031201215,0.007846336,0.9541966,0.0037063656,0.00011190286],"about_ca_topic_score_codex":0.000002931852,"about_ca_topic_score_gemma":0.00000871447,"teacher_disagreement_score":0.798244,"about_ca_system_score_codex":0.00011039684,"about_ca_system_score_gemma":0.00025523032,"threshold_uncertainty_score":0.34279183},"labels":[],"label_agreement":null},{"id":"W4400213152","doi":"10.1137/23m1548633","title":"Complexity Classification of Counting Graph Homomorphisms Modulo a Prime Number","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modulo; Homomorphism; Prime (order theory); Prime number; Combinatorics; Mathematics; Discrete mathematics; Graph; Computer science","score_opus":0.0611886896354861,"score_gpt":0.34249233135040036,"score_spread":0.2813036417149143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400213152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.197377,0.00025216767,0.7976754,0.0005725964,0.0008112227,0.00012643458,0.000002401736,0.00018585206,0.002996942],"genre_scores_gemma":[0.94963926,0.000018283828,0.049945578,0.00006925992,0.00024982376,0.0000012916393,0.0000014568107,0.000022510676,0.000052507086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738985,0.0002878322,0.00059273647,0.0004283275,0.00082467275,0.00047658672],"domain_scores_gemma":[0.99823064,0.0005444562,0.00029237656,0.00046189583,0.0003125759,0.00015806379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002128609,0.00019267482,0.0002784541,0.0003889942,0.00039779153,0.00045496304,0.001063043,0.000065845175,0.000031679006],"category_scores_gemma":[0.0001248767,0.00017186276,0.00020108337,0.0012739304,0.0001976812,0.00057590246,0.00026330608,0.0009004793,0.0000953035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021639544,0.00011121414,0.0015701185,0.00007939956,0.00007519642,0.0001222294,0.0006179191,0.0020640183,0.0059800367,0.90615183,0.00028447848,0.08292189],"study_design_scores_gemma":[0.00035573498,0.00016648567,0.011045276,0.0006830541,0.00000954031,0.0007884529,0.00008249856,0.6610683,0.0024263994,0.32202718,0.001048147,0.00029891287],"about_ca_topic_score_codex":0.000003316961,"about_ca_topic_score_gemma":5.913738e-7,"teacher_disagreement_score":0.7522623,"about_ca_system_score_codex":0.00012469976,"about_ca_system_score_gemma":0.00014731713,"threshold_uncertainty_score":0.700836},"labels":[],"label_agreement":null},{"id":"W4400218314","doi":"10.3389/fbinf.2024.1391086","title":"Maximum-scoring path sets on pangenome graphs of constant treewidth","year":2024,"lang":"en","type":"article","venue":"Frontiers in Bioinformatics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"HORIZON EUROPE Marie Sklodowska-Curie Actions; European Commission; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Natural Sciences and Engineering Research Council of Canada; Agentúra Ministerstva Školstva, Vedy, Výskumu a Športu SR; National Institutes of Health; National Human Genome Research Institute; Agentúra na Podporu Výskumu a Vývoja","keywords":"Treewidth; Constant (computer programming); Path (computing); Mathematics; Combinatorics; Partial k-tree; Pathwidth; 1-planar graph; Graph; Computer science; Chordal graph","score_opus":0.0175788546057046,"score_gpt":0.26583076268259626,"score_spread":0.24825190807689165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400218314","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011242776,0.0016663431,0.97148466,0.00013815096,0.0017887189,0.000394608,0.00005162694,0.00020889983,0.013024208],"genre_scores_gemma":[0.29887313,0.0005156365,0.7002746,0.00013691511,0.00001821901,0.000025886284,0.000009726196,0.000023996987,0.00012193564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983502,0.00004614733,0.00050337566,0.00021253905,0.00045676823,0.0004309674],"domain_scores_gemma":[0.99904376,0.000120493954,0.00008756022,0.000606184,0.00004477304,0.00009721783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058835046,0.00017467525,0.00026799235,0.00088687375,0.000053434647,0.0001067042,0.00085044716,0.000074418575,0.0000047651033],"category_scores_gemma":[0.000048389804,0.00015053012,0.00009511771,0.0013244879,0.00017972448,0.0007170702,0.00020258418,0.00029355346,0.000022803442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046803172,0.00008066884,0.0027517565,0.00063660456,0.00009572912,0.00011247483,0.0067580882,0.00072552526,0.000103744045,0.38639748,0.0044230223,0.5978681],"study_design_scores_gemma":[0.0005858678,0.00041991152,0.00045130448,0.00065120996,0.000011132433,0.000024348186,0.0018576891,0.5052667,0.0013985086,0.4843738,0.0045047225,0.00045479173],"about_ca_topic_score_codex":0.0000026654864,"about_ca_topic_score_gemma":0.0000011498448,"teacher_disagreement_score":0.5974133,"about_ca_system_score_codex":0.000100331265,"about_ca_system_score_gemma":0.00009841867,"threshold_uncertainty_score":0.613844},"labels":[],"label_agreement":null},{"id":"W4400467622","doi":"10.1137/23m1591773","title":"Product Structure Extension of the Alon–Seymour–Thomas Theorem","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Fonds De La Recherche Scientifique - FNRS; Australian Government; National Science Foundation","keywords":"Mathematics; Extension (predicate logic); Combinatorics; Product (mathematics); Discrete mathematics; Structured program theorem; Geometry; Computer science","score_opus":0.019635966402535964,"score_gpt":0.30057751453888726,"score_spread":0.2809415481363513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400467622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26863387,0.0050048796,0.69477385,0.0133249285,0.004258403,0.0014940223,0.00005658517,0.00041699814,0.012036433],"genre_scores_gemma":[0.9573935,0.00006375824,0.041219212,0.00008665307,0.000180333,0.0000028466807,5.202952e-7,0.0000382641,0.0010148577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975666,0.00023335972,0.00048592192,0.00033189257,0.0010145267,0.00036773208],"domain_scores_gemma":[0.99795794,0.00035197078,0.00022969293,0.0011609525,0.00017557677,0.00012388347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011553393,0.00022573331,0.00027818495,0.00020611951,0.00024628083,0.00033187127,0.001692295,0.00005797491,0.00004347042],"category_scores_gemma":[0.00043163556,0.00011555887,0.0002555507,0.00082545227,0.00020744998,0.00040608592,0.00039677566,0.00085131265,0.00002184044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013847379,0.000050137205,0.000018321616,0.00021104231,0.000059517395,0.00007306161,0.0018668218,0.00045183135,0.013612084,0.9750266,0.00092741917,0.0076893135],"study_design_scores_gemma":[0.00014573822,0.00014685861,0.0001705905,0.0007857247,0.000019802123,0.0007671099,0.00015977165,0.016323222,0.025330976,0.9542945,0.0016730834,0.00018263224],"about_ca_topic_score_codex":2.784601e-7,"about_ca_topic_score_gemma":6.956845e-7,"teacher_disagreement_score":0.6887597,"about_ca_system_score_codex":0.00005726919,"about_ca_system_score_gemma":0.00013437113,"threshold_uncertainty_score":0.4712354},"labels":[],"label_agreement":null},{"id":"W4400484640","doi":"10.61091/jcmcc120-38","title":"A New Lower Bound for the Domination Number of Complete Cylindrical Grid Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Grid; Domination analysis; Upper and lower bounds; Mathematics; Combinatorics; Computer science; Geometry; Graph; Mathematical analysis; Vertex (graph theory)","score_opus":0.023852832496387914,"score_gpt":0.31446046119005205,"score_spread":0.29060762869366413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400484640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05848261,0.001164647,0.90467507,0.00080867374,0.033813763,0.0006116846,0.000005603736,0.000061577564,0.0003763891],"genre_scores_gemma":[0.9462666,0.000060280516,0.051916663,0.000018935567,0.0016777345,0.0000045037586,7.748277e-7,0.00003523138,0.000019261286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715847,0.0001261537,0.0011145667,0.00028028767,0.0009418886,0.00037863164],"domain_scores_gemma":[0.9933713,0.0046664053,0.0006333042,0.0003998045,0.0007352436,0.00019395303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027931728,0.0002590071,0.0006318084,0.00024210272,0.00031186052,0.00056626106,0.0012053477,0.00012704715,0.0000076162155],"category_scores_gemma":[0.0006126177,0.00018393199,0.00037881284,0.0008038397,0.00015793781,0.00048494095,0.0003913437,0.00054866896,0.0000029781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010136699,0.00016542982,0.000018085922,0.00020019777,0.00015677657,0.000015272708,0.0008352102,0.00003388978,0.000409598,0.9888243,0.0007859798,0.008453861],"study_design_scores_gemma":[0.002162015,0.0005925282,0.000030272022,0.00032971607,0.00007639394,0.00017206799,0.00007855402,0.052469365,0.00043679643,0.94001967,0.00344359,0.00018902513],"about_ca_topic_score_codex":0.000006091217,"about_ca_topic_score_gemma":2.2247642e-7,"teacher_disagreement_score":0.887784,"about_ca_system_score_codex":0.000071465394,"about_ca_system_score_gemma":0.000320347,"threshold_uncertainty_score":0.7500529},"labels":[],"label_agreement":null},{"id":"W4400484698","doi":"10.61091/jcmcc120-37","title":"On Vertex-Euclidean Deficiency of Complete Fan Graphs and Complete Wheel Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Combinatorics; Euclidean geometry; Mathematics; 1-planar graph; Indifference graph; Chordal graph; Graph; Geometry","score_opus":0.024362601796538607,"score_gpt":0.2847584975143031,"score_spread":0.2603958957177645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400484698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91294783,0.0024423434,0.06658659,0.00031119163,0.015612123,0.0005332869,0.000014331627,0.0001582874,0.0013939881],"genre_scores_gemma":[0.99038845,0.00012689372,0.00927132,0.000029744046,0.00013390346,0.0000019765844,9.0750854e-7,0.000042284977,0.0000044931317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959085,0.0002641822,0.0014499428,0.0005029708,0.0013034741,0.00057095726],"domain_scores_gemma":[0.9948087,0.0029462583,0.00076780433,0.0005528616,0.00058308843,0.00034129314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002678747,0.00043364672,0.0010416773,0.0008819375,0.00037966014,0.0005519025,0.0012417858,0.00015691259,0.0000046740806],"category_scores_gemma":[0.00052787224,0.00037212594,0.00031378696,0.0011681201,0.00037670703,0.0005455078,0.0006569869,0.0008859874,0.0000037923444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006742108,0.00031241614,0.00006728341,0.00044850158,0.000102795966,0.00006948485,0.00113785,0.000027981772,0.0021972363,0.99208206,0.00012650555,0.003360454],"study_design_scores_gemma":[0.0020857898,0.001818845,0.00014887766,0.0009292108,0.00005322956,0.00021967619,0.00014230527,0.023867838,0.0003719628,0.9697671,0.00024961066,0.00034557196],"about_ca_topic_score_codex":0.000007788361,"about_ca_topic_score_gemma":3.5421417e-7,"teacher_disagreement_score":0.07744062,"about_ca_system_score_codex":0.00006645494,"about_ca_system_score_gemma":0.00016751466,"threshold_uncertainty_score":0.99987304},"labels":[],"label_agreement":null},{"id":"W4400485647","doi":"10.61091/jcmcc120-17","title":"A Sufficient Condition for Fractional ( 2 , b , k ) -Critical Covered Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02003362452505353,"score_gpt":0.32568461532104936,"score_spread":0.30565099079599584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400485647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0863026,0.000925795,0.8842521,0.0006593003,0.027008597,0.00038914807,0.000009692032,0.00011582172,0.00033697204],"genre_scores_gemma":[0.97026664,0.000025913634,0.028655896,0.000024149123,0.0009831407,0.0000068240583,0.0000019233535,0.000028259808,0.000007226282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973301,0.000118697535,0.00090994843,0.00032965277,0.00089167105,0.00041988696],"domain_scores_gemma":[0.99416345,0.004157282,0.0003237531,0.00025776314,0.0008567123,0.00024105424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023634848,0.00024433786,0.0005146696,0.00043921187,0.00036274135,0.00079205475,0.0006535162,0.0001393262,0.000006736554],"category_scores_gemma":[0.0012508516,0.00021776628,0.00029144788,0.00059132685,0.0001616244,0.0007425989,0.00024593397,0.0005568223,0.0000040701275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062022664,0.00032869942,0.0000085805805,0.00029084436,0.000082867606,0.000038857703,0.00052065286,0.000068567875,0.00065499294,0.99610865,0.00053568196,0.0012995581],"study_design_scores_gemma":[0.001496289,0.0009104882,0.000013557153,0.00034814386,0.00004049567,0.00024195401,0.00010380233,0.09160508,0.0005443141,0.9019928,0.002491405,0.00021167181],"about_ca_topic_score_codex":0.0000010311404,"about_ca_topic_score_gemma":4.8580205e-8,"teacher_disagreement_score":0.88396406,"about_ca_system_score_codex":0.00011415391,"about_ca_system_score_gemma":0.0002767102,"threshold_uncertainty_score":0.8880251},"labels":[],"label_agreement":null},{"id":"W4400485947","doi":"10.61091/jcmcc120-03","title":"Carathéodory Number of P 3 -Convexity of Claw-Free Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Convexity; Mathematics; Combinatorics; Biology; Economics","score_opus":0.01864598468377219,"score_gpt":0.30034493183276073,"score_spread":0.2816989471489885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400485947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87197673,0.0016918377,0.103535295,0.00018238432,0.019710839,0.0003407092,0.000007346643,0.000086513595,0.0024683173],"genre_scores_gemma":[0.9753581,0.00007438433,0.024144176,0.000006580293,0.00037757115,0.0000011622091,3.2775378e-7,0.000029223373,0.000008424197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963892,0.00021812823,0.0015391984,0.00029490734,0.0011837205,0.00037485667],"domain_scores_gemma":[0.99546427,0.0017047133,0.0009778707,0.0006955475,0.00095218857,0.00020543917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030666892,0.0002853505,0.0009796413,0.0004094654,0.00012608191,0.0001844792,0.0017055436,0.00017417966,0.000008391832],"category_scores_gemma":[0.000704491,0.00024780654,0.0003752717,0.0010437235,0.0003020994,0.0005684706,0.00086005765,0.00069140195,0.000002255885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051680254,0.00032087122,0.00022822783,0.00066413,0.00016072231,0.000044080574,0.0013047126,0.000016721771,0.00148572,0.99369884,0.00019030065,0.001833973],"study_design_scores_gemma":[0.0018368969,0.0005416041,0.00006134499,0.00068808487,0.00005225729,0.00018124138,0.00013509499,0.008071513,0.0054164287,0.98256683,0.00023502494,0.0002136775],"about_ca_topic_score_codex":0.000007606553,"about_ca_topic_score_gemma":1.5533077e-7,"teacher_disagreement_score":0.103381395,"about_ca_system_score_codex":0.000057107496,"about_ca_system_score_gemma":0.0003156901,"threshold_uncertainty_score":0.99999744},"labels":[],"label_agreement":null},{"id":"W4400486273","doi":"10.61091/jcmcc121-10","title":"Introducing 3-Path Domination in Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"City University of New York; Virginia Commonwealth University; National Science Foundation","keywords":"Path (computing); Mathematics; Computer science; Combinatorics; Computer network","score_opus":0.01262711222905419,"score_gpt":0.28516963011301527,"score_spread":0.27254251788396106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6238065,0.0024252122,0.3425173,0.0006769898,0.029011354,0.00042282577,9.638471e-7,0.00014896582,0.0009899002],"genre_scores_gemma":[0.96874857,0.00007811288,0.030444492,0.000011985696,0.0006833281,0.0000020770717,3.4034912e-7,0.00002555906,0.0000055487444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971968,0.00019159737,0.001056429,0.00034653244,0.00080262095,0.00040603796],"domain_scores_gemma":[0.99745655,0.0012924708,0.0003822152,0.00033538011,0.00037096316,0.0001624205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040220926,0.0002448731,0.000565233,0.0008658596,0.00015302423,0.00065917626,0.00086398295,0.00012410131,0.000002937832],"category_scores_gemma":[0.0006659447,0.00021674082,0.0001608202,0.0013177671,0.00008438533,0.00091148884,0.0004104714,0.0007953742,0.0000037649022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024288755,0.00018165931,0.00007335867,0.00018560901,0.000037057678,0.00012670048,0.0018149508,0.000097488475,0.0008655849,0.9863254,0.000074710726,0.010193205],"study_design_scores_gemma":[0.0014724046,0.0003849007,0.00006746466,0.00064049324,0.000014570752,0.00017005819,0.00013813833,0.071516335,0.0006244052,0.9244006,0.0003621646,0.00020844764],"about_ca_topic_score_codex":0.0000042677802,"about_ca_topic_score_gemma":2.799206e-7,"teacher_disagreement_score":0.34494206,"about_ca_system_score_codex":0.0001466328,"about_ca_system_score_gemma":0.00019133596,"threshold_uncertainty_score":0.8838434},"labels":[],"label_agreement":null},{"id":"W4400486360","doi":"10.61091/jcmcc121-04","title":"On Vertex-Euclidean Deficiency of Complete Fan Graphs and Complete Wheel Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Combinatorics; Euclidean geometry; Mathematics; 1-planar graph; Chordal graph; Graph; Computer science; Geometry","score_opus":0.024362601796538607,"score_gpt":0.2847584975143031,"score_spread":0.2603958957177645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91294783,0.0024423434,0.06658659,0.00031119163,0.015612123,0.0005332869,0.000014331627,0.0001582874,0.0013939881],"genre_scores_gemma":[0.99038845,0.00012689372,0.00927132,0.000029744046,0.00013390346,0.0000019765844,9.0750854e-7,0.000042284977,0.0000044931317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959085,0.0002641822,0.0014499428,0.0005029708,0.0013034741,0.00057095726],"domain_scores_gemma":[0.9948087,0.0029462583,0.00076780433,0.0005528616,0.00058308843,0.00034129314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002678747,0.00043364672,0.0010416773,0.0008819375,0.00037966014,0.0005519025,0.0012417858,0.00015691259,0.0000046740806],"category_scores_gemma":[0.00052787224,0.00037212594,0.00031378696,0.0011681201,0.00037670703,0.0005455078,0.0006569869,0.0008859874,0.0000037923444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006742108,0.00031241614,0.00006728341,0.00044850158,0.000102795966,0.00006948485,0.00113785,0.000027981772,0.0021972363,0.99208206,0.00012650555,0.003360454],"study_design_scores_gemma":[0.0020857898,0.001818845,0.00014887766,0.0009292108,0.00005322956,0.00021967619,0.00014230527,0.023867838,0.0003719628,0.9697671,0.00024961066,0.00034557196],"about_ca_topic_score_codex":0.000007788361,"about_ca_topic_score_gemma":3.5421417e-7,"teacher_disagreement_score":0.07744062,"about_ca_system_score_codex":0.00006645494,"about_ca_system_score_gemma":0.00016751466,"threshold_uncertainty_score":0.99987304},"labels":[],"label_agreement":null},{"id":"W4400486492","doi":"10.61091/jcmcc121-02","title":"Realizing the Asymmetric Index of a Graph","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Index (typography); Graph; Computer science; Mathematics; Theoretical computer science; World Wide Web","score_opus":0.019716257370139226,"score_gpt":0.29545527896834994,"score_spread":0.27573902159821073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20624322,0.006623097,0.755589,0.00085963577,0.026044032,0.00060024706,0.000002622438,0.00016113167,0.003877007],"genre_scores_gemma":[0.9921294,0.00010992999,0.0070870123,0.000013820378,0.0006278228,0.0000015361834,1.5915262e-7,0.000025133775,0.000005189368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690616,0.00022664905,0.0011295319,0.00025133163,0.0011173806,0.0003689404],"domain_scores_gemma":[0.99538004,0.002701206,0.00068964943,0.00047057442,0.00060189323,0.000156648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041078897,0.00023456154,0.00060513656,0.0007097339,0.00025087094,0.00048194762,0.001470213,0.00011692019,0.0000017201386],"category_scores_gemma":[0.0007522644,0.00016377938,0.00027719862,0.002187706,0.00018932545,0.00050134567,0.0006163333,0.0007726355,0.0000015649164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023572651,0.00014107049,0.0000696831,0.000220956,0.00011799134,0.000039962586,0.001051083,0.00005192997,0.00027470107,0.98730236,0.0001424039,0.010564303],"study_design_scores_gemma":[0.0009775979,0.00049625756,0.00007197642,0.000485756,0.000038071506,0.00019945319,0.00024114618,0.029335948,0.00083319447,0.96648014,0.0006716282,0.00016881661],"about_ca_topic_score_codex":0.000008161305,"about_ca_topic_score_gemma":1.4495053e-7,"teacher_disagreement_score":0.78588617,"about_ca_system_score_codex":0.000059627197,"about_ca_system_score_gemma":0.00022390284,"threshold_uncertainty_score":0.6678729},"labels":[],"label_agreement":null},{"id":"W4400512456","doi":"10.61091/ars159-12","title":"A Note on Acyclic Token Sliding Reconfiguration Graphs of Independent Sets","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Japan Society for the Promotion of Science; Vietnam Institute for Advanced Study in Mathematics","keywords":"Combinatorics; Security token; Graph; Control reconfiguration; Mathematics; Discrete mathematics; Computer science; Computer network","score_opus":0.022282467778505767,"score_gpt":0.3089376826373435,"score_spread":0.2866552148588377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977568,0.00036462545,0.0098979445,0.0007282073,0.004005757,0.0004308494,0.000006004354,0.0003846252,0.006613999],"genre_scores_gemma":[0.9986549,0.000036874786,0.0010831038,0.00005023993,0.0000039768656,0.00002373977,0.0000031122818,0.000016181939,0.00012787746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983365,0.00014852101,0.00026473406,0.00043951342,0.000513969,0.00029677976],"domain_scores_gemma":[0.9987468,0.00040330505,0.000064227715,0.00060290965,0.00008807314,0.00009466358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006387194,0.00014285537,0.00017081172,0.00039327654,0.0000943652,0.0001456967,0.0007617795,0.00008023889,0.000018331895],"category_scores_gemma":[0.00010822924,0.0001355726,0.00009849367,0.0009502858,0.000039173217,0.00061395403,0.00017459108,0.00031971195,0.00010397198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136584,0.00004553445,0.000080122074,0.000031952448,0.00001984544,0.000031626714,0.0008063272,0.000028637329,0.007590896,0.96700686,0.00022510457,0.024119439],"study_design_scores_gemma":[0.00027736148,0.00021455511,0.0006024967,0.000115644034,0.0000040561868,0.000009574655,0.00002526327,0.009736921,0.0360937,0.95221925,0.0005536672,0.00014749057],"about_ca_topic_score_codex":0.000008229319,"about_ca_topic_score_gemma":0.0000025308254,"teacher_disagreement_score":0.028502807,"about_ca_system_score_codex":0.000083894454,"about_ca_system_score_gemma":0.000080458005,"threshold_uncertainty_score":0.55284905},"labels":[],"label_agreement":null},{"id":"W4400513378","doi":"10.61091/ars159-01","title":"On Fractional ID-\\((g,f)\\)-factor-critical Covered Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Government of Jiangsu Province","keywords":"Mathematics; Factor (programming language); Combinatorics; Computer science; Programming language","score_opus":0.019749619431785062,"score_gpt":0.31950573020830364,"score_spread":0.2997561107765186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6423628,0.0036778268,0.20860125,0.0136358775,0.058933936,0.0015265926,0.00018298779,0.00571754,0.065361194],"genre_scores_gemma":[0.99823916,0.000018413068,0.0010812416,0.00026402078,0.000015513042,0.000028410377,0.000004988928,0.000024259216,0.000324003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977815,0.00014840075,0.00020438565,0.00062235416,0.00076409266,0.0004792454],"domain_scores_gemma":[0.99710095,0.0019029488,0.000020021045,0.00065595564,0.00010566994,0.00021445092],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030145133,0.00019336025,0.0001682579,0.00031239155,0.0002026169,0.00037027622,0.00086791435,0.000101585676,0.00019506486],"category_scores_gemma":[0.00036653437,0.00018225027,0.00012284316,0.00092139153,0.00016301074,0.0008580203,0.00023256357,0.0005777726,0.0010022871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017932354,0.00010201944,0.000082621445,0.000020526326,0.000026347956,0.00012433535,0.00006962939,0.00001410671,0.00046806136,0.9924454,0.0039071613,0.002721844],"study_design_scores_gemma":[0.00024209368,0.00020733014,0.00056090206,0.00004513605,0.0000029257947,0.000023328526,0.0000060163334,0.0045680194,0.0010760524,0.98679805,0.0062646777,0.00020544734],"about_ca_topic_score_codex":0.000004950676,"about_ca_topic_score_gemma":4.972497e-7,"teacher_disagreement_score":0.35587636,"about_ca_system_score_codex":0.00011416246,"about_ca_system_score_gemma":0.00013701864,"threshold_uncertainty_score":0.9997755},"labels":[],"label_agreement":null},{"id":"W4400596703","doi":"10.55016/ojs/cdm.v14i1.62676","title":"Sun toughness and $P_{\\geq3}$-factors in graphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Combinatorics; Graph; Mathematics; Discrete mathematics","score_opus":0.014420542068680871,"score_gpt":0.3067048240553862,"score_spread":0.2922842819867053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5973116,0.000108396605,0.39933676,0.00080867915,0.00013419239,0.0008074464,0.00006782898,0.00011764445,0.001307415],"genre_scores_gemma":[0.98311377,0.000014075284,0.016271764,0.00006243604,0.0000095360765,0.000049424107,0.000008732854,0.000014661964,0.00045560417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835545,0.000083012266,0.00033764887,0.00039528537,0.00030864018,0.0005199512],"domain_scores_gemma":[0.9982023,0.000519879,0.00007158552,0.00083393924,0.00016163898,0.00021062218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005685599,0.00019072629,0.00032404668,0.0003447703,0.00012183405,0.00017210616,0.0007514206,0.000075559896,0.00003015878],"category_scores_gemma":[0.0005247939,0.00016219397,0.00006799369,0.0011202751,0.0000847602,0.00046210794,0.00050406426,0.00021157376,0.00012682342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004849381,0.000056563338,0.006060395,0.00004098084,0.000011938543,0.0000055731284,0.0011486405,0.00008058758,0.0010505744,0.9911135,0.000056314737,0.00037011996],"study_design_scores_gemma":[0.001239087,0.0002011385,0.014101425,0.00021604865,0.000012424055,0.0000226288,0.00082057953,0.023059156,0.005588133,0.9521022,0.0019718637,0.00066536205],"about_ca_topic_score_codex":0.000008823775,"about_ca_topic_score_gemma":0.000017745378,"teacher_disagreement_score":0.38580212,"about_ca_system_score_codex":0.00008817461,"about_ca_system_score_gemma":0.00005385565,"threshold_uncertainty_score":0.6614078},"labels":[],"label_agreement":null},{"id":"W4400596716","doi":"10.55016/ojs/cdm.v13i1.62554","title":"Some inequalities for orderings of acyclic digraphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Order (exchange); Partially ordered set; Class (philosophy); Dimension (graph theory); Comparability; Discrete mathematics","score_opus":0.028690178979588993,"score_gpt":0.351742915839808,"score_spread":0.323052736860219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019918257,0.00010118822,0.9773736,0.0011107383,0.000115385585,0.0006758536,0.00025814574,0.00012256207,0.00032426472],"genre_scores_gemma":[0.78913695,0.000012763097,0.20980597,0.00014107043,0.00014894483,0.000247958,0.000011659565,0.000020470508,0.00047424098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985657,0.000041927513,0.00042574474,0.00025653333,0.0002661549,0.00044396103],"domain_scores_gemma":[0.99759203,0.0005974552,0.00013846027,0.00081547396,0.0007126457,0.0001439598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006402625,0.00014678907,0.00029828603,0.00024248187,0.00023603377,0.00008407407,0.0009659032,0.0000534447,0.00000960092],"category_scores_gemma":[0.001708921,0.0001282239,0.00012813062,0.00067237654,0.00026379383,0.0004084795,0.00037232452,0.00007409822,0.000039466868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009361304,0.0000471485,0.000012182721,0.0000650464,0.000025645733,3.0189548e-7,0.0013884844,0.000007905993,0.0038015503,0.99369806,0.0003358587,0.0006084684],"study_design_scores_gemma":[0.00041143034,0.00031951212,0.00004663308,0.000077882454,0.000011865358,0.0000033514566,0.00022185787,0.008855207,0.036184702,0.9495029,0.0041693742,0.00019532129],"about_ca_topic_score_codex":0.0000032719217,"about_ca_topic_score_gemma":0.0000044258104,"teacher_disagreement_score":0.7692187,"about_ca_system_score_codex":0.00004252486,"about_ca_system_score_gemma":0.000067537214,"threshold_uncertainty_score":0.52288187},"labels":[],"label_agreement":null},{"id":"W4400596816","doi":"10.55016/ojs/cdm.v16i3.62279","title":"Graphs where each spanning tree has a perfect matching","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Spanning tree; Minimum degree spanning tree; Matching (statistics); Graph; Connectivity; Discrete mathematics; Connected dominating set; Tree (set theory); Minimum spanning tree","score_opus":0.02635374451992335,"score_gpt":0.3218086747465916,"score_spread":0.29545493022666824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016433746,0.00067078014,0.9741941,0.0048844703,0.00014740022,0.0003881259,0.00007436494,0.00031920816,0.0028877773],"genre_scores_gemma":[0.70089585,0.00003191165,0.2970657,0.00021223111,0.00007156476,0.00014122749,0.000027354235,0.000042570704,0.0015115949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974582,0.00020948086,0.00045436583,0.0005688948,0.0005475143,0.0007615099],"domain_scores_gemma":[0.99702525,0.0005840179,0.00011342172,0.0013780682,0.00056034926,0.00033889938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008572555,0.00026817547,0.0004070891,0.00023773023,0.0007713956,0.00075126224,0.001098717,0.00009330726,0.00006226888],"category_scores_gemma":[0.0011349662,0.0002517147,0.00023502302,0.0015901445,0.0001241008,0.0005239425,0.00085483294,0.00038917278,0.000252008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005032791,0.00011453624,0.00007436727,0.000074585376,0.000065152504,0.00010526449,0.0030199657,0.00046416835,0.0077439654,0.9846154,0.0008793495,0.0028382458],"study_design_scores_gemma":[0.0007991024,0.00012020899,0.00026501835,0.00042442098,0.0000447931,0.0002194916,0.0012389104,0.026410053,0.011750535,0.95063734,0.0074180653,0.00067207054],"about_ca_topic_score_codex":0.000006609854,"about_ca_topic_score_gemma":0.000043684322,"teacher_disagreement_score":0.6844621,"about_ca_system_score_codex":0.00014679699,"about_ca_system_score_gemma":0.0002456463,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W4400596823","doi":"10.55016/ojs/cdm.v16i1.68557","title":"k-Forcing number for Cartesian product of some graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Bipartite graph; Forcing (mathematics); Mathematics; Combinatorics; Graph coloring; Graph; Product (mathematics); Discrete mathematics; Generalization; Geometry; Mathematical analysis","score_opus":0.019671688235078175,"score_gpt":0.3361353020900227,"score_spread":0.3164636138549445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008478112,0.00017501335,0.9873535,0.002185163,0.00013031076,0.0007040736,0.00022939823,0.00009094481,0.0006534779],"genre_scores_gemma":[0.6449841,0.000011647176,0.35381508,0.00009877469,0.00006260293,0.00022489252,0.000030661275,0.000022826833,0.0007494316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840856,0.00006303557,0.0004089404,0.00036514475,0.00029820012,0.00045611977],"domain_scores_gemma":[0.99734634,0.0004160964,0.000116833195,0.0010398562,0.00091804715,0.00016282711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919372,0.00014797655,0.0003283401,0.00011006412,0.00021471277,0.00009178951,0.00062999845,0.000042695163,0.000016663698],"category_scores_gemma":[0.0018685724,0.00013788196,0.00017991595,0.0009072357,0.00008364634,0.00036124545,0.00031276597,0.00010742534,0.000034903296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003805473,0.00007104462,0.00005934448,0.00010400423,0.00003489195,0.0000040730006,0.00047727258,0.000081768696,0.0068550343,0.9910939,0.0003766167,0.0008382487],"study_design_scores_gemma":[0.00040789146,0.000048917907,0.00008007032,0.00010097488,0.000023129633,0.0000285086,0.00015739193,0.007343448,0.107020654,0.8829767,0.0016013974,0.00021091047],"about_ca_topic_score_codex":0.0000014296742,"about_ca_topic_score_gemma":0.000003550296,"teacher_disagreement_score":0.63650596,"about_ca_system_score_codex":0.00006074986,"about_ca_system_score_gemma":0.00017964489,"threshold_uncertainty_score":0.56226635},"labels":[],"label_agreement":null},{"id":"W4400596840","doi":"10.55016/ojs/cdm.v16i1.62258","title":"H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México","keywords":"Digraph; Combinatorics; Mathematics; Transitive relation; Arc (geometry); Kernel (algebra); Independence (probability theory); Discrete mathematics; Geometry","score_opus":0.012375351633211898,"score_gpt":0.3119576176220196,"score_spread":0.2995822659888077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029814584,0.00038143893,0.965131,0.0031316855,0.00006368638,0.00045609812,0.00010236851,0.00009902999,0.0008200999],"genre_scores_gemma":[0.9328882,0.00006883688,0.06652667,0.00017973487,0.000014250663,0.000101322315,0.000007916559,0.0000123081845,0.00020076285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979641,0.00015992211,0.00036720204,0.0005265832,0.00043754163,0.0005446696],"domain_scores_gemma":[0.997898,0.00056410587,0.000065926244,0.0007423102,0.0004718846,0.0002578123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007136882,0.00019074242,0.00032392947,0.0002286382,0.00020783524,0.00021436338,0.0006236634,0.00009708622,0.000016679427],"category_scores_gemma":[0.0013950673,0.00018633444,0.000073455005,0.0015611843,0.0001457545,0.00047600776,0.00043632093,0.00031977345,0.000042815005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009552326,0.00017924365,0.00027364935,0.000043269752,0.000021148095,0.00019441897,0.0025387565,0.000098249235,0.008608002,0.98592544,0.000044931418,0.0020633438],"study_design_scores_gemma":[0.0014234497,0.00020537683,0.005001871,0.00041468025,0.000023496497,0.00021333963,0.0013270397,0.059862055,0.028822703,0.90136766,0.00060794695,0.00073035125],"about_ca_topic_score_codex":0.000005498318,"about_ca_topic_score_gemma":0.00008390928,"teacher_disagreement_score":0.9030736,"about_ca_system_score_codex":0.00009360098,"about_ca_system_score_gemma":0.00018421,"threshold_uncertainty_score":0.7598498},"labels":[],"label_agreement":null},{"id":"W4400596854","doi":"10.55016/ojs/cdm.v16i3.69926","title":"Degree conditions of nearly induced matching extendable graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Graph; Matching (statistics); Factor-critical graph; Discrete mathematics; Graph power; Line graph","score_opus":0.037133332334841104,"score_gpt":0.34569371354047956,"score_spread":0.30856038120563845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07069926,0.00011100253,0.9243866,0.0012453191,0.00011511775,0.0003487535,0.0002957094,0.00013646825,0.0026617646],"genre_scores_gemma":[0.8551889,0.000009087657,0.14417264,0.00009795114,0.000017833981,0.00007744592,0.000031622993,0.000017558006,0.0003869613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980732,0.00013217241,0.00049900496,0.0003631932,0.0004423129,0.0004900697],"domain_scores_gemma":[0.99696636,0.00051637815,0.00015065061,0.0011996184,0.00092095666,0.0002460129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005424719,0.00017736529,0.00035859708,0.0002443183,0.00035510364,0.00017676938,0.0008595501,0.00007860009,0.00007547502],"category_scores_gemma":[0.0011214858,0.00017133974,0.00017032218,0.001654415,0.00010165395,0.0004852013,0.0005613922,0.00024071724,0.0001085807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022511815,0.0001119592,0.00002370343,0.00003731634,0.000041579147,0.000020771087,0.0007479741,0.00011692732,0.041244697,0.95688486,0.0001617051,0.00060627976],"study_design_scores_gemma":[0.0004005073,0.000077678356,0.0006026572,0.00014450967,0.000023334458,0.000055741635,0.00045613298,0.0035288613,0.057729397,0.93640715,0.0003245123,0.00024949363],"about_ca_topic_score_codex":0.000008724908,"about_ca_topic_score_gemma":0.0000141990795,"teacher_disagreement_score":0.78448963,"about_ca_system_score_codex":0.00007601679,"about_ca_system_score_gemma":0.00025238318,"threshold_uncertainty_score":0.69870317},"labels":[],"label_agreement":null},{"id":"W4400596861","doi":"10.55016/ojs/cdm.v15i3.62742","title":"A classification of isomorphism-invariant random digraphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission","keywords":"Combinatorics; Mathematics; Randomness; Vertex (graph theory); Discrete mathematics; Invariant (physics); Isomorphism (crystallography); Random graph; Graph","score_opus":0.032306691093479986,"score_gpt":0.3125621024309222,"score_spread":0.2802554113374422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035415837,0.00008143039,0.98334396,0.011080591,0.000042007945,0.0006718433,0.0001637455,0.00014730607,0.0009275427],"genre_scores_gemma":[0.9212744,0.000012299644,0.07826671,0.00024931793,0.000033432356,0.000089074274,0.000014688532,0.000012711471,0.000047332265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834746,0.00011185778,0.00050025445,0.0003217094,0.00039486782,0.00032384152],"domain_scores_gemma":[0.9979122,0.00044185997,0.00018382308,0.0007345767,0.0004238195,0.0003037171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005069096,0.0001519552,0.0003487212,0.00014354679,0.00014737215,0.00008442755,0.001030485,0.000058787446,0.000024896843],"category_scores_gemma":[0.0019899195,0.00013197097,0.00014378909,0.0013106915,0.000121369776,0.00027408902,0.00030290955,0.0001528252,0.00012236548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028959746,0.000067276254,0.000031399264,0.00004545825,0.0000320175,0.0000036272456,0.001447656,0.00010527324,0.02279847,0.9743272,0.00059583556,0.0005168],"study_design_scores_gemma":[0.0035685261,0.00049072836,0.0008857495,0.00016926606,0.000070159345,0.000020108744,0.00058043696,0.45842233,0.027401043,0.5031903,0.0045630685,0.00063827756],"about_ca_topic_score_codex":0.0000016149245,"about_ca_topic_score_gemma":0.0000011301959,"teacher_disagreement_score":0.91773283,"about_ca_system_score_codex":0.0000418056,"about_ca_system_score_gemma":0.00009226346,"threshold_uncertainty_score":0.538162},"labels":[],"label_agreement":null},{"id":"W4400596866","doi":"10.55016/ojs/cdm.v15i2.62639","title":"The 2-tuple dominating independent number of a random graph","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Tuple; Graph; Dominating set; Random graph; Discrete mathematics","score_opus":0.01744434532324139,"score_gpt":0.3260284658623288,"score_spread":0.3085841205390874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073473956,0.00008720386,0.9844646,0.0056332806,0.00005820673,0.0006103532,0.000060341867,0.00009230479,0.0016462988],"genre_scores_gemma":[0.9409938,0.000016505008,0.058543798,0.0001556714,0.000038960097,0.00011113783,0.000003406408,0.000014005589,0.00012273031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982237,0.00013871328,0.00048458984,0.00025336756,0.00050044316,0.00039916587],"domain_scores_gemma":[0.9972652,0.0012533895,0.00017939723,0.00065747555,0.00041658303,0.00022792132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010172602,0.0001427328,0.00028678635,0.000050851697,0.00040594264,0.00015693484,0.0013256691,0.000045175402,0.000018647106],"category_scores_gemma":[0.003220927,0.000098016564,0.00015677931,0.0009854202,0.00014429352,0.00020158842,0.0006250586,0.00020896128,0.00010624284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031520296,0.00003576105,0.00006867238,0.000031360865,0.0000433246,0.000003957806,0.001930694,0.0001346569,0.0016570648,0.99393857,0.000323779,0.0018006305],"study_design_scores_gemma":[0.0031811015,0.00016700159,0.00011579671,0.0001248515,0.000041590672,0.000032904936,0.0015813742,0.12105208,0.018408816,0.8510984,0.0037506593,0.000445378],"about_ca_topic_score_codex":0.0000019812712,"about_ca_topic_score_gemma":0.0000025462855,"teacher_disagreement_score":0.9336464,"about_ca_system_score_codex":0.00003995222,"about_ca_system_score_gemma":0.00007195454,"threshold_uncertainty_score":0.39969996},"labels":[],"label_agreement":null},{"id":"W4400596989","doi":"10.55016/ojs/cdm.v16i3.71109","title":"Starred Italian domination in graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Domination analysis; Neighbourhood (mathematics); Vertex (graph theory); Graph; Omega; Discrete mathematics; Physics","score_opus":0.015552851451988425,"score_gpt":0.3261180961084776,"score_spread":0.31056524465648916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02089028,0.000121223384,0.9725439,0.0037518023,0.00011127093,0.0003832725,0.00008890189,0.000105792,0.0020035796],"genre_scores_gemma":[0.8743156,0.000013659583,0.12469094,0.00013996057,0.000017820812,0.00011740334,0.00003630666,0.0000137044835,0.0006545939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840593,0.00012697825,0.00035963568,0.000337913,0.00034285715,0.0004266992],"domain_scores_gemma":[0.9982225,0.0002914836,0.000064240325,0.00080453034,0.00044781785,0.00016945144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006144079,0.00013507917,0.00022638026,0.00028296732,0.00014361425,0.00018883929,0.00060843804,0.000058678484,0.000033856315],"category_scores_gemma":[0.001597373,0.00013348694,0.000085300126,0.0018634838,0.000055086766,0.00041321732,0.00035486335,0.0001636344,0.00012648027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031095562,0.000099017125,0.00008544764,0.000019101419,0.00001051819,0.000043683387,0.00080002885,0.00013315321,0.0026124574,0.9944071,0.0002154409,0.0015709377],"study_design_scores_gemma":[0.0006933096,0.000044599412,0.00091306446,0.00010018261,0.0000066781945,0.00002633798,0.00041712847,0.021284975,0.014246897,0.96024615,0.0017480953,0.0002726108],"about_ca_topic_score_codex":0.0000026775597,"about_ca_topic_score_gemma":0.00004259824,"teacher_disagreement_score":0.8534253,"about_ca_system_score_codex":0.00016038824,"about_ca_system_score_gemma":0.00013087774,"threshold_uncertainty_score":0.544344},"labels":[],"label_agreement":null},{"id":"W4400667814","doi":"10.48550/arxiv.2407.08927","title":"Tree Independence Number IV. Even-hole-free Graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Tree (set theory); Independence (probability theory); Combinatorics; Mathematics; Forestry; Geography; Statistics","score_opus":0.059267110027745866,"score_gpt":0.22973993481027977,"score_spread":0.1704728247825339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400667814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2855443,0.00054678594,0.621366,0.00075916335,0.002547417,0.0011947163,0.00014278395,0.0020828643,0.08581597],"genre_scores_gemma":[0.9861393,0.00022321378,0.0033956585,0.00008474189,0.00008203902,0.0000048444917,0.000010459859,0.000055007786,0.010004766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99561113,0.0003386945,0.0003107617,0.002410963,0.00045478882,0.0008736325],"domain_scores_gemma":[0.994568,0.00027793206,0.00020331601,0.0042245956,0.00031882667,0.00040736143],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.00072624785,0.0005829934,0.00049878715,0.0007123495,0.00023295888,0.00033429457,0.008239294,0.0005743482,0.00014430878],"category_scores_gemma":[0.00012560039,0.000658756,0.0005055307,0.0022787827,0.00040402717,0.00062422577,0.016449625,0.0026993533,0.0014343414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000447695,0.00008487362,0.0015799209,0.00014032342,0.00014530173,0.0019498218,0.00017213906,0.012380264,0.00006571536,0.9794463,0.0017497308,0.0022408317],"study_design_scores_gemma":[0.00043790793,0.000043507593,0.0003745059,0.00017803085,0.000047743302,0.000022763761,0.00008163518,0.08965273,0.00021077237,0.9076538,0.0006407428,0.0006558357],"about_ca_topic_score_codex":0.000119318196,"about_ca_topic_score_gemma":0.00012977136,"teacher_disagreement_score":0.70059496,"about_ca_system_score_codex":0.0002563546,"about_ca_system_score_gemma":0.00047602053,"threshold_uncertainty_score":0.9996015},"labels":[],"label_agreement":null},{"id":"W4400720472","doi":"10.1016/j.disc.2024.114154","title":"A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Grantová Agentura České Republiky","keywords":"Mathematics; Closure (psychology); Social connectedness; Combinatorics; Discrete mathematics","score_opus":0.025501284242576465,"score_gpt":0.31533044034136765,"score_spread":0.2898291560987912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400720472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043089308,0.0007959523,0.95067877,0.0008229129,0.00042648017,0.0009303605,0.00006472011,0.0004866216,0.0027048683],"genre_scores_gemma":[0.5651614,0.00008511304,0.43182665,0.00016359195,0.00011008875,0.0006862958,0.000024709952,0.0001270864,0.0018150385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998057,0.00006290335,0.00040653994,0.0005213172,0.00040534465,0.0005468753],"domain_scores_gemma":[0.99761313,0.0008819163,0.00005522711,0.0012531223,0.000087077555,0.000109520704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083590485,0.00023194599,0.00030525855,0.00042719932,0.0000920534,0.00033668146,0.001771199,0.000098759265,0.000013654051],"category_scores_gemma":[0.0003707732,0.00019260035,0.00019076478,0.0013180409,0.000112570575,0.00050868595,0.00035078166,0.0002686018,0.00004734281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008251341,0.000048733466,0.000046359884,0.00060047733,0.000028543325,0.000046705252,0.004597942,0.000040224015,0.00033662232,0.9918559,0.0006106835,0.001779546],"study_design_scores_gemma":[0.00039317596,0.00007438119,0.00003275765,0.0002660374,0.000007976588,0.000020798905,0.0002902686,0.11652288,0.0009298841,0.8795109,0.0017059047,0.0002450772],"about_ca_topic_score_codex":0.000003183696,"about_ca_topic_score_gemma":0.00002396837,"teacher_disagreement_score":0.52207214,"about_ca_system_score_codex":0.00005056213,"about_ca_system_score_gemma":0.000075478696,"threshold_uncertainty_score":0.7854014},"labels":[],"label_agreement":null},{"id":"W4400805883","doi":"10.1007/s40314-024-02854-9","title":"On regular triangle-distinct graphs","year":2024,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Science Fund of the Republic of Serbia","keywords":"Mathematics; Combinatorics","score_opus":0.02480918071135287,"score_gpt":0.285359270146763,"score_spread":0.26055008943541014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400805883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129767,0.00020254042,0.9776862,0.00038960294,0.000081506645,0.00019397,0.000005059872,0.00026518008,0.008199219],"genre_scores_gemma":[0.648659,0.0000057509296,0.35080874,0.00012760908,0.000035258276,0.000039200466,0.000008869182,0.000017244074,0.00029834636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900526,0.000013437906,0.00018805655,0.0002997701,0.00032848332,0.00016500555],"domain_scores_gemma":[0.99872476,0.0009318265,0.00003093304,0.00020246109,0.000032544736,0.000077478115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030701127,0.00012191714,0.0001442919,0.00016767686,0.000119908735,0.00021393022,0.0002855524,0.00003245715,0.000013952111],"category_scores_gemma":[0.000032699925,0.00009790844,0.000047458336,0.00040538269,0.00008732098,0.00009643853,0.00012812561,0.00012908007,0.00011413739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038814287,0.000041234016,3.632824e-7,0.00009895347,0.000015697073,0.000009851594,0.00024197524,0.0015548464,0.00007899282,0.97612786,0.00050128566,0.021325028],"study_design_scores_gemma":[0.00013521842,0.000028867806,0.000021134321,0.000041610125,0.00000308602,0.000019068575,0.000015759966,0.18373846,0.00012517947,0.8153703,0.0004072154,0.000094058305],"about_ca_topic_score_codex":9.229136e-8,"about_ca_topic_score_gemma":7.980323e-8,"teacher_disagreement_score":0.6356823,"about_ca_system_score_codex":0.00001471004,"about_ca_system_score_gemma":0.000033977194,"threshold_uncertainty_score":0.39925903},"labels":[],"label_agreement":null},{"id":"W4400869467","doi":"10.1002/jgt.23152","title":"Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar graphs without 4‐cycles","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Claw; Planar straight-line graph; Chordal graph; Planar; Outerplanar graph; 1-planar graph; Pathwidth; Discrete mathematics; Graph; Computer science; Line graph; Biology","score_opus":0.017210814976967793,"score_gpt":0.28433814695748216,"score_spread":0.26712733198051436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400869467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9376929,0.019364499,0.037767753,0.0019337746,0.0011326094,0.00047206468,0.0000460311,0.00041016837,0.0011802164],"genre_scores_gemma":[0.9879427,0.0016583274,0.0098763835,0.0002814233,0.00008597053,0.000014618884,0.0000037145326,0.00006675217,0.00007012438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530745,0.0011321717,0.0010792303,0.0007203875,0.0009120551,0.0008486896],"domain_scores_gemma":[0.99580455,0.0021740685,0.00037061697,0.00095932843,0.0002534634,0.00043798034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036930088,0.0004862863,0.0007969959,0.003694593,0.00024664236,0.0004358255,0.0023415352,0.00023762355,0.000031019386],"category_scores_gemma":[0.00060043065,0.00039537225,0.0003999056,0.0029669781,0.00068630127,0.0016754955,0.00025281272,0.0013806834,0.000011039003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051522744,0.00012820389,0.0073875207,0.0001108464,0.00031887324,0.0012021704,0.0014107482,0.000045447654,0.005965472,0.96942765,0.00090037036,0.012587448],"study_design_scores_gemma":[0.0013871994,0.0004427808,0.015603722,0.00056181697,0.000047516914,0.0010310372,0.0005070027,0.00066343474,0.0012596167,0.9775597,0.00047819677,0.00045797208],"about_ca_topic_score_codex":0.000018520943,"about_ca_topic_score_gemma":0.00009952483,"teacher_disagreement_score":0.050249804,"about_ca_system_score_codex":0.000068347006,"about_ca_system_score_gemma":0.00019131333,"threshold_uncertainty_score":0.9998498},"labels":[],"label_agreement":null},{"id":"W4401333586","doi":"10.1007/s00493-024-00117-z","title":"Pure Pairs. VIII. Excluding a Sparse Graph","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.03483557909027746,"score_gpt":0.2996560542547483,"score_spread":0.2648204751644708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401333586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024303807,0.016707119,0.8966346,0.006610356,0.006873154,0.0008946214,0.0000073844767,0.004766904,0.04320208],"genre_scores_gemma":[0.9954501,0.00011936616,0.0029929054,0.00009041236,0.000055124532,0.000050909464,0.0000012608155,0.000026849837,0.001213074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981006,0.000112239584,0.00018907338,0.000606559,0.0004657335,0.00052581116],"domain_scores_gemma":[0.9985678,0.000279745,0.00002768874,0.0008448127,0.000081995306,0.00019793426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004708731,0.00018104364,0.00017976433,0.0003776663,0.00020617351,0.0003544488,0.0013427119,0.00007458358,0.000040268627],"category_scores_gemma":[0.00009689026,0.00016451493,0.00013692466,0.0023128758,0.000091006325,0.0006695962,0.0005756456,0.0004111581,0.00045410005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000286772,0.00004754297,0.00008650272,0.000046553407,0.000021197508,0.00034111165,0.00033093596,0.000009481539,0.00046069996,0.9742803,0.0051708915,0.019201925],"study_design_scores_gemma":[0.00018399017,0.00010538143,0.00010091029,0.00007303804,0.0000043918035,0.00005745503,0.000027083539,0.005470961,0.0015830761,0.9117862,0.08035886,0.000248673],"about_ca_topic_score_codex":0.0000022768716,"about_ca_topic_score_gemma":4.9297194e-7,"teacher_disagreement_score":0.9711463,"about_ca_system_score_codex":0.0001037419,"about_ca_system_score_gemma":0.00008565523,"threshold_uncertainty_score":0.67087245},"labels":[],"label_agreement":null},{"id":"W4401352220","doi":"10.1016/j.cosrev.2024.100663","title":"A survey on the parameterized complexity of reconfiguration problems","year":2024,"lang":"en","type":"article","venue":"Computer Science Review","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Providence Health Care; University Research Board, American University of Beirut; Alexander von Humboldt-Stiftung","keywords":"Control reconfiguration; Parameterized complexity; Vertex (graph theory); Computer science; Security token; Feedback vertex set; Graph; Theoretical computer science; Independent set; Vertex cover; Algorithm","score_opus":0.20152490290374092,"score_gpt":0.375823881507837,"score_spread":0.1742989786040961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401352220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001485896,0.015822634,0.9754499,0.005088737,0.00055147894,0.0010077568,0.000007523171,0.00015539578,0.00043068032],"genre_scores_gemma":[0.8640751,0.022778686,0.10853552,0.0040662284,0.00013405608,0.00022526238,0.0000131651095,0.000035125613,0.00013682517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725246,0.00060591626,0.0004079931,0.00064749585,0.0007339455,0.0003521706],"domain_scores_gemma":[0.99736077,0.0009171043,0.00010835629,0.0012325159,0.0002827914,0.00009844188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074591795,0.00015007492,0.00030367865,0.00018464398,0.00020312831,0.0003697752,0.0028280148,0.000020286892,0.000027305354],"category_scores_gemma":[0.00033497816,0.00008825998,0.000109864704,0.0036983956,0.0010808428,0.0006991231,0.00045919913,0.00022032477,0.000119135424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022968884,0.000041310977,0.000020102705,0.00086844456,0.000011511963,0.000004431909,0.00014739715,0.00005335182,0.00090009917,0.47895005,0.0012631321,0.51773787],"study_design_scores_gemma":[0.00018160333,0.0006947548,0.008029046,0.013487545,0.000012842,0.000053917563,0.0000018826065,0.7670112,0.0039060914,0.1935168,0.012524526,0.00057974434],"about_ca_topic_score_codex":0.000011730526,"about_ca_topic_score_gemma":0.0000040781388,"teacher_disagreement_score":0.8669144,"about_ca_system_score_codex":0.000050564686,"about_ca_system_score_gemma":0.00027591002,"threshold_uncertainty_score":0.5255202},"labels":[],"label_agreement":null},{"id":"W4401390257","doi":"10.1145/3686798","title":"Automorphisms and Isomorphisms of Maps in Linear Time","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agentúra na Podporu Výskumu a Vývoja; Grantová Agentura České Republiky","keywords":"Automorphism; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.018948114718378872,"score_gpt":0.2882847886829304,"score_spread":0.2693366739645515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401390257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040168366,0.00043748706,0.99285483,0.0016913008,0.0003232968,0.0002024772,0.000044154953,0.00022590753,0.00020372211],"genre_scores_gemma":[0.52286565,0.00040333,0.472747,0.00017183118,0.000052991618,0.00008845542,0.0000064614637,0.000055825814,0.0036084368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987295,0.0000774048,0.00023309035,0.0004140002,0.00028716732,0.00025882028],"domain_scores_gemma":[0.9988322,0.00037129677,0.000021627235,0.0006428067,0.000041698597,0.00009032317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036189728,0.00013606464,0.00018367865,0.0005368525,0.00006463061,0.00005099104,0.0006310869,0.000074847,0.00008158011],"category_scores_gemma":[0.00002250284,0.000128445,0.00006628957,0.001079701,0.00016012804,0.00041261033,0.000029057901,0.00035350406,0.00014867666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031268326,0.00025435796,0.000013174379,0.00007931012,0.00006401921,0.00018690409,0.0010563988,0.002236562,0.006861897,0.016246783,0.00012605183,0.9728433],"study_design_scores_gemma":[0.0010780969,0.0007644742,0.00049202214,0.00030995562,0.00002037942,0.00018660892,0.000067509005,0.77122694,0.033780254,0.18585518,0.005684709,0.0005338395],"about_ca_topic_score_codex":0.000021979817,"about_ca_topic_score_gemma":0.0000046025752,"teacher_disagreement_score":0.9723094,"about_ca_system_score_codex":0.000041687006,"about_ca_system_score_gemma":0.00006082088,"threshold_uncertainty_score":0.5237835},"labels":[],"label_agreement":null},{"id":"W4401656754","doi":"10.1016/j.dam.2024.07.044","title":"Hamiltonicity of covering graphs of trees","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.019444275876684104,"score_gpt":0.28881422514983274,"score_spread":0.2693699492731486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401656754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053042978,0.00030092505,0.9302635,0.000028054194,0.000059281494,0.00023113079,0.000013879581,0.00013725883,0.015922971],"genre_scores_gemma":[0.8491893,0.000037528105,0.15067312,0.000005701618,0.0000059267795,0.000017762995,0.0000013627086,0.000015178038,0.000054112435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987606,0.000012495529,0.0003721045,0.00024079774,0.00039457154,0.00021944066],"domain_scores_gemma":[0.9988102,0.0003388138,0.00009909509,0.00065706944,0.0000432319,0.00005159647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039121683,0.0001290814,0.00027713605,0.00018999609,0.00003207243,0.000043049084,0.0007687352,0.00004441748,0.0000120661925],"category_scores_gemma":[0.00003354811,0.00010640312,0.00011396933,0.0006923105,0.00017207171,0.00016722099,0.00032392904,0.00013025853,0.000012802296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038008304,0.000033943605,0.000006066509,0.0005861746,0.00003664501,0.0000028646648,0.0013135723,0.00021635844,0.044700697,0.9506259,0.000024247,0.0024497276],"study_design_scores_gemma":[0.000114932605,0.000041212254,0.000054383494,0.00017169662,0.000012007481,0.0000040850696,0.00018241176,0.0502614,0.11722452,0.8316989,0.00010333297,0.0001311074],"about_ca_topic_score_codex":0.0000021524365,"about_ca_topic_score_gemma":0.000002260835,"teacher_disagreement_score":0.79614633,"about_ca_system_score_codex":0.000014589941,"about_ca_system_score_gemma":0.000042078558,"threshold_uncertainty_score":0.43389934},"labels":[],"label_agreement":null},{"id":"W4401748186","doi":"10.1016/j.ejc.2024.104043","title":"The Nash-Williams orientation theorem for graphs with countably many ends","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Orientation (vector space); Discrete mathematics; Geometry","score_opus":0.014185230573488274,"score_gpt":0.27121071112808504,"score_spread":0.2570254805545968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401748186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015209193,0.0020532524,0.9743382,0.0010500938,0.0021442848,0.00019610829,0.0000028682475,0.00007670385,0.0049293092],"genre_scores_gemma":[0.9939936,0.00035151496,0.0044331728,0.00006885029,0.00010316267,0.0000039324673,8.230841e-7,0.000043133852,0.00100181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802154,0.00041194042,0.0003776422,0.0002073656,0.0006637492,0.00031776342],"domain_scores_gemma":[0.9979408,0.0007586202,0.0002054771,0.00039009887,0.0005757988,0.0001292561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003453498,0.00014673051,0.00014602105,0.0002033673,0.0003459809,0.00060474244,0.0013762503,0.000015135744,0.0000021366955],"category_scores_gemma":[0.00012135641,0.00008511957,0.00012735165,0.0009857286,0.00015143206,0.0007118147,0.00011196805,0.00038472313,0.000015479076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000726242,0.000029197017,0.00007744909,0.000019340225,0.000054647844,0.00018951367,0.0004031341,0.000059652542,0.00012197521,0.9763224,0.0014149563,0.0212351],"study_design_scores_gemma":[0.0011931527,0.0020842925,0.0005676111,0.00016299025,0.00002953308,0.00042075376,0.0002473578,0.0033054324,0.00099944,0.8266323,0.1641202,0.00023694473],"about_ca_topic_score_codex":1.3164023e-7,"about_ca_topic_score_gemma":2.0674402e-7,"teacher_disagreement_score":0.9787844,"about_ca_system_score_codex":0.000072739305,"about_ca_system_score_gemma":0.00012347511,"threshold_uncertainty_score":0.58315456},"labels":[],"label_agreement":null},{"id":"W4401823787","doi":"10.1007/s00373-024-02829-x","title":"Existential Closure in Line Graphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Closure (psychology); Combinatorics; Line (geometry); Discrete mathematics; Geometry; Political science","score_opus":0.018311866831261008,"score_gpt":0.28131773073709204,"score_spread":0.263005863905831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401823787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8923068,0.026850449,0.061505903,0.0020052143,0.0044001807,0.0007047384,0.000015101267,0.0012036012,0.011008009],"genre_scores_gemma":[0.99784005,0.001005718,0.00073303183,0.000053645632,0.00001147381,0.000022449463,0.0000022598267,0.000014208981,0.0003171831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985387,0.00007608851,0.00020667654,0.00048158664,0.0003214724,0.0003755313],"domain_scores_gemma":[0.9992748,0.00012302442,0.000021324417,0.00039942493,0.000055459535,0.00012595188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044346254,0.00015653607,0.00016975997,0.000631609,0.000100054756,0.00026334875,0.0005424685,0.00008568745,0.000006178442],"category_scores_gemma":[0.000022159315,0.00014183426,0.00009238353,0.0025928018,0.00010397412,0.00042284623,0.00027168804,0.0003735372,0.000012219345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005752071,0.00005385229,0.002226732,0.0000475286,0.000012131154,0.00014771706,0.00020088202,0.0000048089823,0.000068917114,0.98582906,0.00020283247,0.011199808],"study_design_scores_gemma":[0.0003298637,0.00015064229,0.0016810903,0.000044269105,0.0000036396693,0.000026439327,0.000026518153,0.004700045,0.00019016067,0.9879353,0.004735271,0.00017678134],"about_ca_topic_score_codex":0.000016618045,"about_ca_topic_score_gemma":0.00000911908,"teacher_disagreement_score":0.10553323,"about_ca_system_score_codex":0.000020817477,"about_ca_system_score_gemma":0.00004899794,"threshold_uncertainty_score":0.5783833},"labels":[],"label_agreement":null},{"id":"W4401909052","doi":"10.5206/mase/18527","title":"The equitable non-split domination number of graphs","year":2024,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Domination analysis; Combinatorics; Mathematics; Computer science; Graph; Vertex (graph theory)","score_opus":0.01583315733226827,"score_gpt":0.2886430563984206,"score_spread":0.27280989906615233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401909052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08473603,0.00044314848,0.90020293,0.00011911028,0.00015750222,0.00018919753,5.289428e-7,0.00006749374,0.0140840635],"genre_scores_gemma":[0.8815829,0.00006084783,0.11827271,0.0000022650418,0.000005981592,0.000024704861,5.5199884e-8,0.000004280348,0.000046248773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991786,0.000004132253,0.0001652084,0.00016780267,0.00023990087,0.00024437884],"domain_scores_gemma":[0.99931735,0.00045984378,0.00001980393,0.00016563093,0.00001091179,0.000026490588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015585974,0.00006742027,0.000088474655,0.00011961594,0.000108976354,0.00021483963,0.0004726624,0.000020503467,0.0000019236159],"category_scores_gemma":[0.00002835338,0.000045291174,0.000017928953,0.00093542744,0.0001253521,0.0001603038,0.0001996235,0.00009532814,0.000004693499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1240006e-7,0.0000052722476,0.000008939717,0.00010427306,0.00000223521,7.781192e-7,0.00064464926,0.0020511444,0.0033048184,0.9865252,0.0000051078277,0.0073472965],"study_design_scores_gemma":[0.000034564786,0.000006553185,0.00003116725,0.000059381917,7.390872e-7,0.0000048731845,0.00014376901,0.63859683,0.0016389673,0.35931477,0.000115900075,0.000052509073],"about_ca_topic_score_codex":0.00000119058,"about_ca_topic_score_gemma":9.706358e-7,"teacher_disagreement_score":0.79684687,"about_ca_system_score_codex":0.0000129565415,"about_ca_system_score_gemma":0.000015935655,"threshold_uncertainty_score":0.20717035},"labels":[],"label_agreement":null},{"id":"W4401976660","doi":"10.1093/comjnl/bxae055","title":"Approximation algorithms for maximum weighted internal spanning trees in regular graphs and subdivisions of graphs","year":2024,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Spanning tree; Subdivision; Computer science; Algorithm; Combinatorics; Mathematics; Geography","score_opus":0.02779165139718254,"score_gpt":0.3050763644660477,"score_spread":0.27728471306886515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401976660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075689375,0.0014123559,0.9211341,0.0009691827,0.00049160654,0.00021703956,0.0000039558045,0.000053360283,0.000029007415],"genre_scores_gemma":[0.67976063,0.00019640636,0.3197763,0.000063199004,0.00012423542,0.000016433278,0.0000022923389,0.000020908348,0.000039573384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983851,0.00025548515,0.00040337892,0.0002834039,0.0003493872,0.00032325956],"domain_scores_gemma":[0.99879164,0.0005679427,0.000111106936,0.0003065644,0.00012779469,0.00009498261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002051276,0.00014724335,0.00021005,0.0006894734,0.0001967808,0.00037675616,0.0009777059,0.00004540732,0.0000031828067],"category_scores_gemma":[0.000023435658,0.00009869026,0.00014088904,0.00078218774,0.0001644976,0.00065082556,0.0003426243,0.00045074083,0.0000011540244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043789918,0.00005531392,0.00041440089,0.000049985232,0.00008909587,0.00005824429,0.002560453,0.00067200285,0.0012743364,0.38678128,0.00044280852,0.6075583],"study_design_scores_gemma":[0.00027151976,0.00011148117,0.0012678476,0.00016721242,0.00000497706,0.0002441821,0.000029357714,0.47626403,0.00044255017,0.5209844,0.00014240122,0.00007002964],"about_ca_topic_score_codex":0.0000045893657,"about_ca_topic_score_gemma":0.000003224628,"teacher_disagreement_score":0.6074883,"about_ca_system_score_codex":0.000029081453,"about_ca_system_score_gemma":0.000046446366,"threshold_uncertainty_score":0.40244722},"labels":[],"label_agreement":null},{"id":"W4402137504","doi":"10.1016/j.disc.2024.114195","title":"Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; Mathematics; Partial k-tree; Tree-depth; Clique-sum; 1-planar graph; Tree decomposition; Discrete mathematics; Chordal graph; Bounded function; Pathwidth; Clique-width; Graph; Line graph; Voltage graph","score_opus":0.020182274357420475,"score_gpt":0.29895184390847096,"score_spread":0.2787695695510505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402137504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21094865,0.0006130111,0.77769506,0.001013222,0.000119093565,0.00046218117,0.000018325132,0.0006225087,0.008507961],"genre_scores_gemma":[0.83192956,0.0000553083,0.16770846,0.00005148416,0.000014629695,0.000054800093,0.0000056883,0.000032851527,0.00014724041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985831,0.000051504005,0.00022014878,0.00042302956,0.00037090442,0.00035133993],"domain_scores_gemma":[0.99878037,0.00032389365,0.000042032243,0.0006332187,0.000057375444,0.00016308196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002270285,0.00020419717,0.00020360474,0.00034908316,0.00018318922,0.00047167088,0.000547812,0.00005494248,0.000010811511],"category_scores_gemma":[0.000024665133,0.00014788429,0.00007288999,0.00103054,0.00016019335,0.0005643903,0.0002207393,0.0002422979,0.000034676093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004441222,0.000039700728,0.00006299133,0.00015423843,0.00006144735,0.00007657794,0.0018988422,0.000005135375,0.0036472927,0.9874421,0.00007814173,0.006529094],"study_design_scores_gemma":[0.00027419237,0.00026755943,0.00031763257,0.00032967035,0.000032818793,0.00025858276,0.0002954606,0.04274929,0.0044983095,0.9503392,0.00025203734,0.00038523707],"about_ca_topic_score_codex":0.0000028169754,"about_ca_topic_score_gemma":0.000015500607,"teacher_disagreement_score":0.6209809,"about_ca_system_score_codex":0.00001824972,"about_ca_system_score_gemma":0.000044030752,"threshold_uncertainty_score":0.60305464},"labels":[],"label_agreement":null},{"id":"W4402461337","doi":"10.1137/23m157627x","title":"Minimum Spanning Trees in Infinite Graphs: Theory and Algorithms","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Spanning tree; Combinatorics; Minimum spanning tree; Algorithm; Discrete mathematics; Mathematical optimization","score_opus":0.017276378262051327,"score_gpt":0.30020955161130003,"score_spread":0.2829331733492487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402461337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005228286,0.0014278353,0.9911171,0.00069592247,0.00035694116,0.00009732364,0.0000010667052,0.0000820473,0.0009934828],"genre_scores_gemma":[0.7340166,0.0027216712,0.26199752,0.00036890517,0.00019118043,0.000015179186,0.00000409876,0.000046353518,0.00063846254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857366,0.0003533098,0.00024846994,0.00026716213,0.00030099056,0.00025639683],"domain_scores_gemma":[0.999084,0.0005147784,0.00005742813,0.00017341021,0.00006394305,0.0001064344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001679756,0.00012303346,0.00012737466,0.00089109206,0.00013369191,0.00050713884,0.0003136871,0.000055831184,0.000023028286],"category_scores_gemma":[0.00017772174,0.000103352424,0.000047643905,0.0009992389,0.000066949535,0.0010441612,0.00008656528,0.00044291222,0.0000067554065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006858946,0.00004101014,0.00016804542,0.00001564779,0.000025038116,0.0002461852,0.0015057558,0.59018487,0.0002282254,0.31860968,0.000096658725,0.08881031],"study_design_scores_gemma":[0.00032411332,0.00019709345,0.00032778937,0.00024594858,0.0000031574882,0.0001675373,0.00011034667,0.8409053,0.00011764938,0.15697303,0.00048361908,0.00014440129],"about_ca_topic_score_codex":5.1483556e-7,"about_ca_topic_score_gemma":7.9047726e-7,"teacher_disagreement_score":0.72911954,"about_ca_system_score_codex":0.000047624242,"about_ca_system_score_gemma":0.000057236,"threshold_uncertainty_score":0.48903516},"labels":[],"label_agreement":null},{"id":"W4402478393","doi":"10.1016/j.laa.2024.09.009","title":"On the zero forcing number of the complement of graphs with forbidden subgraphs","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada; American Mathematical Society; National Science Foundation","keywords":"Mathematics; Complement (music); Zero (linguistics); Combinatorics; Forcing (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.020219131405441286,"score_gpt":0.29753853548819864,"score_spread":0.27731940408275735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402478393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34789056,0.0006539888,0.6413363,0.00391109,0.00005612944,0.0017044923,0.000055260847,0.00009440745,0.0042977324],"genre_scores_gemma":[0.9971134,0.00003736125,0.0024657182,0.00008750848,0.000008993545,0.00013910122,0.0000015872024,0.000007976564,0.00013833697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992423,0.000038547536,0.00015193266,0.00020119395,0.00023363199,0.00013238515],"domain_scores_gemma":[0.9989327,0.0003975261,0.000050786486,0.00050832913,0.00007883261,0.000031826985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021385848,0.00007695071,0.00008738355,0.000053971817,0.00016344852,0.000030554358,0.00056164095,0.000018087227,0.000017344753],"category_scores_gemma":[0.0000116506835,0.000038633,0.00005339694,0.0008606978,0.00013882625,0.00008826907,0.000160293,0.00012405026,0.00000820722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033612775,0.000021356967,0.0002383508,0.000029418665,0.000023564511,1.2100163e-7,0.00022345266,0.000021703207,0.00073484686,0.99637514,0.00011312618,0.0022155445],"study_design_scores_gemma":[0.0001481042,0.00007637685,0.0010429337,0.000092457616,0.000016976712,0.000008807766,0.00008342859,0.01358133,0.0183603,0.9623316,0.004156687,0.00010097752],"about_ca_topic_score_codex":0.0000061185924,"about_ca_topic_score_gemma":0.0000056724416,"teacher_disagreement_score":0.64922285,"about_ca_system_score_codex":0.0000048446777,"about_ca_system_score_gemma":0.000030319341,"threshold_uncertainty_score":0.1575408},"labels":[],"label_agreement":null},{"id":"W4402696811","doi":"10.48550/arxiv.2408.10452","title":"Eternally surrounding a robber","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Business","score_opus":0.09573952555297077,"score_gpt":0.2311861016547281,"score_spread":0.13544657610175734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402696811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21736087,0.0002647182,0.76972383,0.00018488623,0.0013121596,0.00028574685,0.000012819608,0.0006336083,0.010221377],"genre_scores_gemma":[0.9849083,0.00011754906,0.0030140441,0.00006201683,0.000103785314,0.0000014574339,0.000004474133,0.0000346123,0.011753756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733967,0.00020739058,0.00018669457,0.0015156694,0.00017965055,0.0005709473],"domain_scores_gemma":[0.9976694,0.00019911813,0.00012022916,0.0016220127,0.00015318845,0.0002360551],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00054236245,0.00034163336,0.00031164766,0.00061132206,0.00014527225,0.00039083973,0.0032781546,0.00024951732,0.000043824613],"category_scores_gemma":[0.00004749317,0.00038322635,0.0003147943,0.0010785708,0.00014974411,0.00039101552,0.008426344,0.0014692476,0.00066924706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019807965,0.000034169865,0.00055175746,0.0001328959,0.00011818196,0.0018331694,0.00018890778,0.048612002,0.00013237956,0.947046,0.00023756563,0.0010932067],"study_design_scores_gemma":[0.00016388614,0.00003100101,0.00011902878,0.00017677009,0.000027514234,0.00001451416,0.000023393508,0.2438518,0.00016049891,0.7541293,0.00090561196,0.0003966868],"about_ca_topic_score_codex":0.00005873905,"about_ca_topic_score_gemma":0.000023910026,"teacher_disagreement_score":0.7675474,"about_ca_system_score_codex":0.00033977485,"about_ca_system_score_gemma":0.0002827101,"threshold_uncertainty_score":0.99986196},"labels":[],"label_agreement":null},{"id":"W4402732438","doi":"10.1016/j.ejc.2024.104072","title":"Induced subdivisions with pinned branch vertices","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Mathematics; Combinatorics; Subdivision","score_opus":0.023751553805502992,"score_gpt":0.2766314345661225,"score_spread":0.2528798807606195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402732438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37497544,0.0019813452,0.6091446,0.0015065328,0.0017243149,0.00010306964,8.57414e-7,0.00015931274,0.010404486],"genre_scores_gemma":[0.9973592,0.00007071982,0.002204216,0.000063929794,0.0000791089,4.109862e-7,1.7035524e-7,0.000030124882,0.00019208928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979637,0.0005214357,0.00035327915,0.00020699986,0.0006728083,0.00028176414],"domain_scores_gemma":[0.99860156,0.00029777797,0.00013307165,0.000403204,0.00034518662,0.00021922939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016486092,0.00013963062,0.00018391378,0.00037626678,0.00012333892,0.00039197062,0.0014292136,0.00001635903,0.000010010012],"category_scores_gemma":[0.00014394661,0.00009919076,0.00008915683,0.0013891329,0.00005757174,0.0010239002,0.0002232837,0.0006066751,0.000086695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007437974,0.00019721848,0.00040849508,0.00006422544,0.00014129264,0.004017182,0.0013915722,0.000121918165,0.0055444916,0.92795956,0.0016213119,0.05845833],"study_design_scores_gemma":[0.0072195316,0.01621699,0.027929824,0.0026603458,0.0001579526,0.0046339235,0.00034519212,0.011677576,0.024054788,0.7267916,0.17628525,0.0020269863],"about_ca_topic_score_codex":2.468096e-7,"about_ca_topic_score_gemma":1.4515209e-7,"teacher_disagreement_score":0.6223838,"about_ca_system_score_codex":0.000050491464,"about_ca_system_score_gemma":0.00015224206,"threshold_uncertainty_score":0.40448818},"labels":[],"label_agreement":null},{"id":"W4402779380","doi":"10.1016/j.ejc.2024.104074","title":"Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; Ministry of Colleges and Universities; National Science Foundation","keywords":"Mathematics; Combinatorics; Tree (set theory)","score_opus":0.01722149256355198,"score_gpt":0.2757203212955558,"score_spread":0.2584988287320038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402779380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8298609,0.0030332364,0.15697224,0.0020529334,0.0014273901,0.00015692187,0.0000016618575,0.000069265974,0.0064254194],"genre_scores_gemma":[0.9969271,0.00030038247,0.002576516,0.000056184323,0.000046021734,8.948798e-7,2.8777163e-7,0.000024130795,0.00006852033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982012,0.00045488324,0.00042098342,0.00022948162,0.00039477443,0.0002986975],"domain_scores_gemma":[0.99900055,0.00021631009,0.00011468622,0.0002915704,0.0001477209,0.00022918521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295219,0.00014476995,0.00020613051,0.00077597756,0.000088461886,0.00030902782,0.00083222723,0.000022991946,0.0000040338614],"category_scores_gemma":[0.00006614914,0.0001289441,0.0000985046,0.0013771799,0.00006336052,0.00068793126,0.00025729815,0.0006697772,0.000024716375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006891309,0.00052710157,0.003877666,0.000092447444,0.000103811166,0.00806039,0.0034346343,0.00024100346,0.013347379,0.8867512,0.0015064706,0.081989],"study_design_scores_gemma":[0.008496378,0.005203549,0.1673248,0.0022389092,0.000081191305,0.0027601353,0.0006544713,0.031437363,0.009111471,0.7501391,0.020863656,0.0016889623],"about_ca_topic_score_codex":6.0913464e-7,"about_ca_topic_score_gemma":0.0000012639281,"teacher_disagreement_score":0.16706613,"about_ca_system_score_codex":0.00007948022,"about_ca_system_score_gemma":0.00009919643,"threshold_uncertainty_score":0.52581877},"labels":[],"label_agreement":null},{"id":"W4402795462","doi":"10.1016/j.jcta.2024.105953","title":"On the proportion of metric matroids whose Jacobians have nontrivial p-torsion","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Matroid; Torsion (gastropod); Metric (unit); Combinatorics; Pure mathematics; Discrete mathematics; Surgery","score_opus":0.011077114220522991,"score_gpt":0.2752186489763287,"score_spread":0.2641415347558057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402795462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6769652,0.0026733323,0.28675854,0.003977661,0.024635144,0.0010069006,0.000015249616,0.00017382191,0.003794179],"genre_scores_gemma":[0.9981331,0.00009911898,0.0008258288,0.000035077002,0.00048477392,0.0000055874098,3.6865634e-7,0.000020028938,0.00039609228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702334,0.0006750071,0.0006378863,0.0002078593,0.0011659939,0.00028991554],"domain_scores_gemma":[0.99729145,0.001194575,0.00040310007,0.00047940467,0.0005223106,0.00010918206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004421265,0.00017979852,0.0003425747,0.0005943761,0.00016818439,0.00021402078,0.0012200539,0.00009276011,0.00006423306],"category_scores_gemma":[0.0011149374,0.00010883164,0.0002970166,0.001207709,0.00024889523,0.0010727604,0.00021474785,0.00062716583,0.000012757431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008678446,0.00012332732,0.000018802368,0.00003162962,0.00007955245,0.00008893152,0.00060009817,0.000059449696,0.0026377565,0.98968977,0.00063472264,0.00516814],"study_design_scores_gemma":[0.00050015067,0.0021762692,0.000052713858,0.00017371344,0.000023291246,0.000119763536,0.00018280248,0.0003169749,0.029966665,0.9618416,0.0045286627,0.00011742495],"about_ca_topic_score_codex":0.0000015295958,"about_ca_topic_score_gemma":3.474217e-7,"teacher_disagreement_score":0.32116795,"about_ca_system_score_codex":0.00012708138,"about_ca_system_score_gemma":0.0002491505,"threshold_uncertainty_score":0.44380254},"labels":[],"label_agreement":null},{"id":"W4402841196","doi":"10.2139/ssrn.4967530","title":"Distance-Restricted Firefighting on Finite Graphs","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Firefighting; Computer science; Geography; Cartography","score_opus":0.016156056965141313,"score_gpt":0.2880911824740665,"score_spread":0.2719351255089252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402841196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020067392,0.022876069,0.93990624,0.0037880032,0.0032404105,0.00063080405,0.000026177362,0.0008136264,0.008651275],"genre_scores_gemma":[0.9809589,0.01012816,0.0022278698,0.00014611828,0.0005681017,0.00005769509,0.000014276791,0.000105974716,0.0057929102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99249583,0.0003723928,0.00062005944,0.0010865144,0.0011320289,0.004293192],"domain_scores_gemma":[0.99747056,0.0004702345,0.00036056378,0.0012379959,0.00021650376,0.00024416292],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002185417,0.0005486555,0.0004685706,0.0009924537,0.00044445778,0.00080587727,0.003507608,0.00031093138,0.000011026738],"category_scores_gemma":[0.00031409744,0.00046887144,0.00050181826,0.0013102012,0.000112660186,0.00023978135,0.002160299,0.01769452,0.0001880125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042193613,0.00005164844,0.00003091661,0.000042295316,0.00022093905,0.00010546453,0.00014126631,0.002007615,0.000045187917,0.94094485,0.00018466683,0.05618297],"study_design_scores_gemma":[0.0002667999,0.00031844777,0.000030382507,0.00035861618,0.000023374849,0.00018817528,0.000062033134,0.013375758,0.000089298686,0.9819662,0.0028581212,0.00046279846],"about_ca_topic_score_codex":0.000018977804,"about_ca_topic_score_gemma":0.000078913225,"teacher_disagreement_score":0.9608915,"about_ca_system_score_codex":0.0018063735,"about_ca_system_score_gemma":0.004626388,"threshold_uncertainty_score":0.9997763},"labels":[],"label_agreement":null},{"id":"W4402914195","doi":"10.2139/ssrn.4969841","title":"On 1-Planar Graphs with Bounded Cop-Number","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Bounded function; Planar; Planar graph; Mathematics; Combinatorics; Discrete mathematics; Computer science; Graph; Mathematical analysis; Computer graphics (images)","score_opus":0.010839086775392992,"score_gpt":0.28560327834682864,"score_spread":0.27476419157143567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402914195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14722666,0.010587603,0.7989733,0.0075250645,0.0031469003,0.0013077747,0.000031097734,0.0010374811,0.03016409],"genre_scores_gemma":[0.9827253,0.0039028146,0.0058276583,0.0003191853,0.00034784593,0.000064017215,0.000011783087,0.00013774665,0.006663611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931239,0.00030852432,0.0004055534,0.0010129061,0.0012487047,0.0039004146],"domain_scores_gemma":[0.9978668,0.00019067428,0.00025368892,0.0012107542,0.00021971978,0.00025833747],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026016505,0.0005341864,0.00046628085,0.00057720684,0.0003556665,0.0008406523,0.0029175715,0.00026714947,0.000038427042],"category_scores_gemma":[0.000050180028,0.00040598464,0.00030902305,0.00078073365,0.00018993109,0.00022633167,0.0009110389,0.015187749,0.00050905684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012603334,0.00006147249,0.00006156854,0.00003751268,0.0004624706,0.00017905599,0.00012903231,0.00027500786,0.000023063276,0.9889994,0.0004644045,0.009180931],"study_design_scores_gemma":[0.00043588367,0.00056951,0.000019680674,0.00025813063,0.000035438235,0.002080711,0.00007653745,0.0006243867,0.000080968435,0.9943905,0.0009550892,0.0004732012],"about_ca_topic_score_codex":0.000032192067,"about_ca_topic_score_gemma":0.0003429539,"teacher_disagreement_score":0.8354987,"about_ca_system_score_codex":0.0016464763,"about_ca_system_score_gemma":0.007177674,"threshold_uncertainty_score":0.9998392},"labels":[],"label_agreement":null},{"id":"W4403088534","doi":"10.1016/j.disc.2024.114278","title":"Linear colouring of binomial random graphs","year":2024,"lang":"ca","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Binomial (polynomial); Discrete mathematics; Statistics","score_opus":0.027235953647663784,"score_gpt":0.32104101288585546,"score_spread":0.29380505923819167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403088534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09218725,0.005222718,0.8885328,0.00066009193,0.0017528081,0.0012066059,0.00014288677,0.00038107435,0.009913757],"genre_scores_gemma":[0.9051186,0.00042348012,0.09158577,0.000027688844,0.0002173282,0.00003925689,0.000008406464,0.00010020529,0.0024792673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673367,0.00018937694,0.00091879885,0.0006157343,0.0008635022,0.0006789433],"domain_scores_gemma":[0.99697226,0.0013221072,0.00020744024,0.0011159644,0.00017035252,0.00021185307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015346687,0.00037845585,0.0006936319,0.00052230014,0.00015988472,0.00033641246,0.0014129146,0.00016846342,0.00013296296],"category_scores_gemma":[0.00035326456,0.00032259032,0.00048632754,0.0014883599,0.00050089683,0.00048451123,0.0007428862,0.0005495225,0.00026977304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009276729,0.00015484374,0.000027940336,0.0036556998,0.00029640188,0.00016695968,0.008880261,0.00050915335,0.003794423,0.97669667,0.00041959903,0.0053053005],"study_design_scores_gemma":[0.001044577,0.00025555407,0.000011393334,0.0015367317,0.000103942744,0.00004954823,0.00045692513,0.54398257,0.01210889,0.43862614,0.001383364,0.00044038455],"about_ca_topic_score_codex":0.000006360698,"about_ca_topic_score_gemma":0.00000244546,"teacher_disagreement_score":0.81293136,"about_ca_system_score_codex":0.00006006645,"about_ca_system_score_gemma":0.00022538714,"threshold_uncertainty_score":0.99992263},"labels":[],"label_agreement":null},{"id":"W4403100092","doi":"10.1007/s10107-024-02146-4","title":"Dyadic linear programming and extensions","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Engineering and Physical Sciences Research Council; Office of Naval Research Global; Natural Sciences and Engineering Research Council of Canada","keywords":"Representation (politics); Mathematics; Rational number; Integer (computer science); Binary number; Closure (psychology); Discrete mathematics; Algorithm; Computer science; Arithmetic","score_opus":0.0349194155187307,"score_gpt":0.334993497210502,"score_spread":0.3000740816917713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403100092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046193614,0.001653224,0.99015886,0.0010867105,0.000106473875,0.00051815115,5.400425e-7,0.0011220429,0.00073463464],"genre_scores_gemma":[0.30868402,0.000015014482,0.6905879,0.00004875128,0.00007122442,0.00012805457,0.0000011336726,0.00003186355,0.0004320432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807054,0.00006992586,0.00028910357,0.0005607802,0.00040443556,0.00060523086],"domain_scores_gemma":[0.9985767,0.0005725764,0.000025440075,0.00050120696,0.00006245326,0.00026164157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085888477,0.00018699518,0.00021686594,0.00019894676,0.00021413801,0.00063077576,0.00048697295,0.000074437565,0.000022213799],"category_scores_gemma":[0.00029498208,0.00014684004,0.00008923582,0.0008131973,0.00024204976,0.00051817147,0.00050232233,0.0003777808,0.00022783245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001247406,0.000043939264,0.000008919357,0.00020795559,0.000013848233,0.000104440245,0.00048089758,0.0000016110272,0.00015507113,0.51552993,0.000020030027,0.48343208],"study_design_scores_gemma":[0.00018113939,0.00020979867,0.000020001633,0.0005413378,0.000023142093,0.00044321205,0.00021515184,0.25199848,0.00045099133,0.69492316,0.05057662,0.00041694025],"about_ca_topic_score_codex":0.0000012317445,"about_ca_topic_score_gemma":5.3275204e-7,"teacher_disagreement_score":0.48301515,"about_ca_system_score_codex":0.000028427377,"about_ca_system_score_gemma":0.000040349492,"threshold_uncertainty_score":0.60825855},"labels":[],"label_agreement":null},{"id":"W4403165693","doi":"10.61091/ars-60-03","title":"Illuminating a Graph","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.015949325037328408,"score_gpt":0.28917292093243696,"score_spread":0.27322359589510853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6401024,0.007861335,0.25656217,0.004499461,0.01752873,0.0009122466,0.0000070517067,0.0053198035,0.06720682],"genre_scores_gemma":[0.99359804,0.000020023535,0.005628305,0.000065893706,0.00000792985,0.000026179494,8.722661e-7,0.000017109647,0.0006356338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986204,0.00008449715,0.00014974656,0.00042374985,0.0003520359,0.00036955375],"domain_scores_gemma":[0.99894965,0.000301332,0.000019352237,0.0005531551,0.00006868438,0.00010783177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051920506,0.000119671786,0.000110855035,0.00025641295,0.0001355275,0.00028656772,0.00094341213,0.000045887693,0.000019954356],"category_scores_gemma":[0.0000987632,0.00011224362,0.000083386876,0.0013969066,0.000087848784,0.0006869056,0.00034806246,0.00027113612,0.00028296537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010564668,0.00001936525,0.000062514184,0.000020899794,0.000012986747,0.00009852818,0.00036407937,0.000004056072,0.0007340833,0.9713731,0.0007760586,0.026533296],"study_design_scores_gemma":[0.00012408661,0.000058109697,0.00011024932,0.000044073367,0.000001917437,0.000021500278,0.000025410482,0.008800213,0.0024017962,0.9844175,0.0038547213,0.00014042296],"about_ca_topic_score_codex":0.0000044859466,"about_ca_topic_score_gemma":6.236602e-7,"teacher_disagreement_score":0.35349566,"about_ca_system_score_codex":0.000045108183,"about_ca_system_score_gemma":0.000060411567,"threshold_uncertainty_score":0.4577162},"labels":[],"label_agreement":null},{"id":"W4403165696","doi":"10.61091/ars-160-16","title":"Edge Domination and Secure Edge Domination in Mycielski Graph of Trees","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Combinatorics; Domination analysis; Computer science; Vertex (graph theory); Telecommunications","score_opus":0.011006214837464,"score_gpt":0.2774832059882226,"score_spread":0.2664769911507586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98083866,0.0023415966,0.011690798,0.0006483611,0.0016266031,0.00041916565,0.0000054110765,0.00014462789,0.0022848088],"genre_scores_gemma":[0.99848664,0.000107492255,0.0011779289,0.000014574573,0.0000071723416,0.000029842175,0.000003696963,0.000012644567,0.0001599906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859345,0.00015418725,0.00026160222,0.00040757543,0.00033428913,0.0002488699],"domain_scores_gemma":[0.9989838,0.00042080897,0.000056449204,0.00035559287,0.00011486412,0.000068489964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008195027,0.00013657694,0.00018988027,0.0006163514,0.000060387076,0.00011029628,0.0004755283,0.000090016074,0.0000069942566],"category_scores_gemma":[0.00012499907,0.00013255177,0.00005511942,0.001478368,0.00013358254,0.0008682308,0.00021855548,0.00023195603,0.000009550337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001336082,0.00006783823,0.0007580445,0.00006927611,0.000010484305,0.000020725916,0.0013197457,0.000010349964,0.003373045,0.9685189,0.0002207783,0.025617424],"study_design_scores_gemma":[0.00069941167,0.00013150883,0.0083505465,0.00010954728,0.0000044782078,0.000008582958,0.000070997616,0.009092587,0.009318744,0.9715958,0.00047166782,0.0001460776],"about_ca_topic_score_codex":0.000010610104,"about_ca_topic_score_gemma":0.000023799796,"teacher_disagreement_score":0.025471348,"about_ca_system_score_codex":0.00006232432,"about_ca_system_score_gemma":0.000059898037,"threshold_uncertainty_score":0.54053044},"labels":[],"label_agreement":null},{"id":"W4403165709","doi":"10.61091/ars-160-04","title":"Outer Independent Double Roman Domination Stability in Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stability (learning theory); Combinatorics; Computer science","score_opus":0.022446951307488958,"score_gpt":0.2950131467055869,"score_spread":0.27256619539809795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98695445,0.0003562129,0.005288108,0.0006087072,0.002435545,0.00042752727,0.0000018384613,0.00031013502,0.003617486],"genre_scores_gemma":[0.9988772,0.000012607218,0.0008493035,0.000029458275,0.0000041710314,0.00006760725,0.0000029498926,0.000014215685,0.00014248618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980517,0.00015952734,0.0002689637,0.00060393213,0.00051816966,0.00039771642],"domain_scores_gemma":[0.9988677,0.00020332352,0.00003027856,0.0007128604,0.00008203997,0.000103828745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012516074,0.00015064413,0.0001631164,0.0004105027,0.000074890464,0.00028189362,0.00089978846,0.00008615537,0.00003771634],"category_scores_gemma":[0.000037831036,0.00014455922,0.00007874487,0.001330668,0.000076197444,0.0011129766,0.0003921711,0.0003957615,0.00011466498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002100628,0.0001017762,0.0027928336,0.00003070049,0.000009659492,0.000091027,0.0007858132,0.000008914086,0.0006811087,0.99073416,0.00011570918,0.0046273144],"study_design_scores_gemma":[0.0008065219,0.00007361626,0.005615048,0.000032938162,0.0000018555753,0.000007652735,0.000033930795,0.004499438,0.005742475,0.9824222,0.000597884,0.00016647321],"about_ca_topic_score_codex":0.000039266786,"about_ca_topic_score_gemma":0.000041002582,"teacher_disagreement_score":0.011922761,"about_ca_system_score_codex":0.00020452312,"about_ca_system_score_gemma":0.00008765672,"threshold_uncertainty_score":0.5894954},"labels":[],"label_agreement":null},{"id":"W4403165717","doi":"10.61091/ars-160-12","title":"On the k-Spanning Cyclability of 4-Valent Cayley Graphs on Abelian Groups","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Abelian group; Mathematics; Combinatorics; Pure mathematics; Graph","score_opus":0.020262456624433163,"score_gpt":0.2878129390935451,"score_spread":0.26755048246911195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892559,0.00032044042,0.0011433784,0.0022478548,0.0023411831,0.0003790512,0.0000055444584,0.00025521862,0.0040513985],"genre_scores_gemma":[0.9994203,0.000020490967,0.00023615343,0.00015133456,0.000005455582,0.00003914027,9.531831e-7,0.000018363864,0.00010784983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777514,0.00031244542,0.00026603296,0.00056946924,0.0006823518,0.00039455868],"domain_scores_gemma":[0.9968515,0.0015633497,0.000057083937,0.0013247516,0.00009883712,0.00010445475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013342717,0.0001869216,0.00019326853,0.00023268063,0.00018498834,0.000118787175,0.0013962095,0.00006499416,0.000021225336],"category_scores_gemma":[0.00027751448,0.00012928965,0.00015316144,0.0012985951,0.00022199724,0.0002400003,0.00030798084,0.0005207873,0.00011711295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018765419,0.00011820201,0.00036501425,0.000035527377,0.000028316945,0.00002003141,0.0005646966,0.0000743664,0.000607931,0.9940595,0.00085395685,0.0032536641],"study_design_scores_gemma":[0.00017285939,0.00035778322,0.00187336,0.00013271395,0.0000038326552,0.0000025017048,0.000040252766,0.002673726,0.0079358285,0.986286,0.00038595442,0.00013523243],"about_ca_topic_score_codex":0.00001642043,"about_ca_topic_score_gemma":0.000001818636,"teacher_disagreement_score":0.010164328,"about_ca_system_score_codex":0.00008897851,"about_ca_system_score_gemma":0.00006872503,"threshold_uncertainty_score":0.5272279},"labels":[],"label_agreement":null},{"id":"W4403165727","doi":"10.61091/ars-160-09","title":"Decomposition of Complete Tripartite Graphs into Short Cycles","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Decomposition; Discrete mathematics; Chemistry","score_opus":0.02228818980086592,"score_gpt":0.3231222616827255,"score_spread":0.30083407188185957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94409007,0.0017562035,0.048263565,0.00050477555,0.0025004128,0.00034577044,0.000007948134,0.0005092808,0.0020219926],"genre_scores_gemma":[0.9934779,0.000046819212,0.0063537727,0.000031934247,0.0000051401635,0.00002485494,0.000006709519,0.000016320335,0.00003658973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842256,0.00014352635,0.0002980469,0.000415105,0.0004176066,0.00030316555],"domain_scores_gemma":[0.9988343,0.00029635592,0.00003277447,0.0006070413,0.00011412826,0.00011537484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004979286,0.00014578768,0.00021334316,0.00034633884,0.00011495098,0.00012757027,0.000877103,0.000057088168,0.000012618714],"category_scores_gemma":[0.000024280636,0.00014143878,0.0001312903,0.0011592135,0.00015901444,0.0006347285,0.0002943875,0.00021214668,0.00006591882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011387854,0.000059776467,0.00045280842,0.000055097273,0.000035185316,0.000028723627,0.000401727,0.00002233154,0.017424384,0.96942556,0.00034384272,0.011739191],"study_design_scores_gemma":[0.00018026841,0.00013989994,0.0010750325,0.00007747333,0.000006737313,0.000010793946,0.000017206203,0.011194755,0.01642394,0.9695911,0.0011335403,0.00014927513],"about_ca_topic_score_codex":0.00001833416,"about_ca_topic_score_gemma":0.000004274415,"teacher_disagreement_score":0.049387805,"about_ca_system_score_codex":0.000051068408,"about_ca_system_score_gemma":0.000053741365,"threshold_uncertainty_score":0.5767706},"labels":[],"label_agreement":null},{"id":"W4403165805","doi":"10.61091/jcmcc122-12","title":"Tree Covers of Graphs and their Linear Preservers","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Forestry; Tree (set theory); Geography; Discrete mathematics","score_opus":0.018206796616971773,"score_gpt":0.2807509794985006,"score_spread":0.2625441828815288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8611735,0.0035598518,0.11953166,0.00031962566,0.013717664,0.00038832784,0.0000050047893,0.00012292463,0.0011814226],"genre_scores_gemma":[0.98837024,0.00016723905,0.01115563,0.000008298313,0.00026421263,0.000001001576,3.162408e-7,0.000025536101,0.0000075407825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997696,0.00015330472,0.0009053251,0.0002831453,0.0006302653,0.00033199115],"domain_scores_gemma":[0.9967744,0.0017241857,0.0004964534,0.00034407602,0.00044059407,0.00022033296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021865715,0.0002679244,0.00068292214,0.00044152138,0.00016046863,0.00028948108,0.0008502458,0.00012640742,0.000002577802],"category_scores_gemma":[0.00042030227,0.0002088115,0.00021482834,0.00072352245,0.00018102681,0.0006306962,0.00058921124,0.0005531444,8.152673e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004691216,0.00015114089,0.00007476602,0.00032103286,0.00014516515,0.000031142816,0.0018480079,0.000027517171,0.0015729696,0.9904797,0.00010770846,0.005193916],"study_design_scores_gemma":[0.0015692153,0.0008364534,0.000029945142,0.00050296966,0.00002911117,0.00012424518,0.00031219423,0.06129001,0.003189545,0.9314583,0.00046048718,0.00019755404],"about_ca_topic_score_codex":0.000005123315,"about_ca_topic_score_gemma":2.3800014e-7,"teacher_disagreement_score":0.1271967,"about_ca_system_score_codex":0.000035877878,"about_ca_system_score_gemma":0.00017323658,"threshold_uncertainty_score":0.8515086},"labels":[],"label_agreement":null},{"id":"W4403166158","doi":"10.61091/jcmcc122-27","title":"Efficient Domination in Grid Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Grid; Computer science; Mathematics; Geometry","score_opus":0.014013155764631998,"score_gpt":0.28755652944821863,"score_spread":0.2735433736835866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7979623,0.0019130403,0.15484193,0.0004301013,0.04337721,0.00039430222,0.0000013237329,0.000121366495,0.00095841585],"genre_scores_gemma":[0.986268,0.0000391813,0.012841968,0.000010326467,0.0008105454,0.0000022878355,3.2195814e-7,0.000023284163,0.000004119614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972124,0.00017694659,0.0010179639,0.00030783136,0.00088473805,0.0004001233],"domain_scores_gemma":[0.99752045,0.0012927159,0.00035983694,0.00029627522,0.00035747988,0.00017322258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034895078,0.00023974448,0.00053056516,0.0008534217,0.00014859984,0.0005487058,0.00083598396,0.00012110821,0.0000027713777],"category_scores_gemma":[0.0004515772,0.00020809243,0.000174681,0.0013047577,0.00009330528,0.00033846393,0.00039202592,0.0007030975,0.0000047049944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002579066,0.00026501506,0.00004134817,0.00016742754,0.000032824104,0.00013602446,0.0014083417,0.00045336573,0.00047849378,0.99199325,0.00007543467,0.0049226955],"study_design_scores_gemma":[0.0015756903,0.0003568817,0.00008062029,0.00053047814,0.000013711394,0.0001544885,0.000108110915,0.16290984,0.0004466032,0.8332496,0.00037344376,0.00020050336],"about_ca_topic_score_codex":0.000003215696,"about_ca_topic_score_gemma":2.1094762e-7,"teacher_disagreement_score":0.18830566,"about_ca_system_score_codex":0.00014182214,"about_ca_system_score_gemma":0.00018155464,"threshold_uncertainty_score":0.8485763},"labels":[],"label_agreement":null},{"id":"W4403166161","doi":"10.61091/jcmcc122-25","title":"Decomposition of Complete Graphs into Paths and Stars with Different Number of Edges","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Combinatorics; Decomposition; Mathematics; Computer science; Astrophysics; Physics; Chemistry","score_opus":0.014974458052679803,"score_gpt":0.2936325487595871,"score_spread":0.2786580907069073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8829302,0.00062247756,0.11311447,0.00008130096,0.0028897633,0.00019307803,0.0000026716518,0.000029042001,0.00013699275],"genre_scores_gemma":[0.9685997,0.00008777074,0.03113777,0.0000039820416,0.00014411769,0.000001384527,6.6882035e-7,0.00002329306,0.0000013168071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750423,0.00016374921,0.0009891824,0.00026009392,0.0008169827,0.00026577993],"domain_scores_gemma":[0.9969905,0.0012507032,0.0007020069,0.00029142515,0.0005916628,0.00017372635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011635477,0.00026220968,0.0008022445,0.00032829779,0.0001425946,0.00020109826,0.0005613076,0.00009268552,0.0000025774536],"category_scores_gemma":[0.00010374086,0.00019717068,0.00014217784,0.0005363721,0.0002692364,0.00040661797,0.00039713306,0.00041628283,3.7212806e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010374571,0.00030048846,0.000627452,0.0007920771,0.000165052,0.000029979174,0.0020204247,0.000016202095,0.0039656,0.9860523,0.000016778169,0.005909931],"study_design_scores_gemma":[0.0019077071,0.0013095773,0.00035272454,0.0012796076,0.00006541963,0.00020980272,0.00020034995,0.010596135,0.0047236932,0.9790741,0.00006830307,0.00021258867],"about_ca_topic_score_codex":0.0000064840424,"about_ca_topic_score_gemma":3.9313693e-7,"teacher_disagreement_score":0.08566949,"about_ca_system_score_codex":0.000044836546,"about_ca_system_score_gemma":0.00010577094,"threshold_uncertainty_score":0.8040387},"labels":[],"label_agreement":null},{"id":"W4403214649","doi":"10.1002/jgt.23192","title":"Towards Nash‐Williams orientation conjecture for infinite graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Combinatorics; Orientation (vector space); Nash equilibrium; Discrete mathematics; Mathematical economics; Geometry","score_opus":0.019004085473819626,"score_gpt":0.31852215968629016,"score_spread":0.29951807421247056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403214649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028448073,0.0039925654,0.96344006,0.0008544394,0.0021162322,0.0002588933,0.000014248445,0.00010274271,0.00077275344],"genre_scores_gemma":[0.94741416,0.00048900687,0.050662607,0.00046863113,0.00033748118,0.000027922888,0.000004025469,0.000048717367,0.0005474718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997985,0.00027769402,0.0005150253,0.00029091162,0.0005642344,0.00036713236],"domain_scores_gemma":[0.9978372,0.0009873445,0.0002194842,0.00037140446,0.00040611654,0.00017843841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029564078,0.00019368646,0.00028352806,0.0010752474,0.00015650065,0.00029505053,0.0010427891,0.00010053783,0.00003010425],"category_scores_gemma":[0.00030544648,0.0001445593,0.00048390884,0.0014410706,0.00019589714,0.0011545981,0.00009793446,0.0004914847,0.000010575982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001420582,0.000031301766,0.000047642417,0.000066451124,0.0001343919,0.00007008309,0.0009111188,0.00012599348,0.0017110273,0.9114187,0.0008144494,0.08452682],"study_design_scores_gemma":[0.000502722,0.0005642131,0.00017250402,0.0001296565,0.000029266284,0.000238947,0.00014853166,0.00060191646,0.0040520323,0.981083,0.012308946,0.00016829283],"about_ca_topic_score_codex":7.236936e-7,"about_ca_topic_score_gemma":9.189214e-7,"teacher_disagreement_score":0.91896605,"about_ca_system_score_codex":0.000049909242,"about_ca_system_score_gemma":0.0002212789,"threshold_uncertainty_score":0.58949566},"labels":[],"label_agreement":null},{"id":"W4403323930","doi":"10.48550/arxiv.2410.04874","title":"On graphs which have locally complete 2-edge-colourings and their relationship to proper circular-arc graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arc (geometry); Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematics; Indifference graph; 1-planar graph; Chordal graph; Computer science; Graph; Geometry; Telecommunications","score_opus":0.08552962598946565,"score_gpt":0.2229627904206511,"score_spread":0.13743316443118545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403323930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71118623,0.00020946706,0.28004622,0.0008495489,0.0004492258,0.0014594054,0.000054799435,0.00054375594,0.005201354],"genre_scores_gemma":[0.9968894,0.000059209888,0.0012341546,0.00024039816,0.000024298146,0.000012050443,0.000012355251,0.000055944685,0.001472159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960588,0.000418979,0.00029876942,0.002256317,0.00024830847,0.00071877503],"domain_scores_gemma":[0.99641603,0.0005345595,0.00014240203,0.0019442351,0.00044565057,0.00051710894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080457854,0.000580679,0.00048944406,0.0014382021,0.0004275796,0.00037742662,0.00242792,0.00036579775,0.000015663212],"category_scores_gemma":[0.00020578055,0.00055943767,0.00026987528,0.0022508125,0.00033305044,0.00030819557,0.0050526587,0.0020143103,0.00024682455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000885752,0.000075096825,0.0027235912,0.00019640739,0.00013246803,0.00026289004,0.0008688982,0.04426341,0.00014906442,0.95055574,0.00020494589,0.0004789209],"study_design_scores_gemma":[0.00034778842,0.0001999066,0.003146706,0.00032637248,0.00003257549,0.000014600785,0.00010106933,0.07992011,0.000119269724,0.9148004,0.0003664554,0.0006247113],"about_ca_topic_score_codex":0.000056497887,"about_ca_topic_score_gemma":0.00008442458,"teacher_disagreement_score":0.2857032,"about_ca_system_score_codex":0.00023470886,"about_ca_system_score_gemma":0.00026178893,"threshold_uncertainty_score":0.9996857},"labels":[],"label_agreement":null},{"id":"W4403386980","doi":"10.1016/j.dam.2024.09.029","title":"On some classes of quasi-triangulated graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02014365155555507,"score_gpt":0.30091563586410225,"score_spread":0.28077198430854716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403386980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050981797,0.0004995171,0.92621595,0.000396099,0.00026956777,0.00073502667,0.000023944765,0.0007571954,0.020120878],"genre_scores_gemma":[0.9157152,0.000043279713,0.08378522,0.00008355369,0.000020978996,0.000058534275,0.000006740915,0.000043220505,0.0002432577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833226,0.000025265655,0.00038173993,0.00038726584,0.0005357805,0.0003376803],"domain_scores_gemma":[0.99791706,0.0009871806,0.00008700793,0.0008722161,0.00004289073,0.00009365371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042308925,0.00019996752,0.00030085526,0.00034806336,0.00006358236,0.0001313092,0.0008935899,0.000079338155,0.000026530164],"category_scores_gemma":[0.000090950554,0.00015710283,0.00013034506,0.0009475513,0.00014274637,0.00024320677,0.00022038541,0.00023311315,0.00016504402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008862921,0.00008901802,5.071013e-7,0.00029590985,0.000046758076,0.000012672779,0.0007318639,0.00006774549,0.009247052,0.98514664,0.0002862185,0.0040667555],"study_design_scores_gemma":[0.00015779941,0.000095464966,0.000005207865,0.00012044612,0.0000105402705,0.000004547745,0.00010700961,0.025137322,0.019559393,0.9544235,0.00021017494,0.00016861007],"about_ca_topic_score_codex":8.9262716e-7,"about_ca_topic_score_gemma":4.088505e-7,"teacher_disagreement_score":0.8647334,"about_ca_system_score_codex":0.00002639443,"about_ca_system_score_gemma":0.000053637774,"threshold_uncertainty_score":0.64064676},"labels":[],"label_agreement":null},{"id":"W4403425141","doi":"10.1007/s00012-024-00874-4","title":"Graphs of finite algebras: maximality, rectangularity, and decomposition","year":2024,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Decomposition; Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.013411490564310425,"score_gpt":0.2813205636403192,"score_spread":0.2679090730760088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403425141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54169655,0.0027950008,0.44614756,0.0018679283,0.0003688645,0.0003336874,0.000041637417,0.0005981352,0.0061506717],"genre_scores_gemma":[0.9853987,0.00021786838,0.014121472,0.00006401044,0.000015353642,0.0000030483798,0.000007927998,0.000014661874,0.00015692977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998676,0.00015130568,0.00017556812,0.00043397225,0.0003057384,0.0002574126],"domain_scores_gemma":[0.9988997,0.00040285662,0.000040358893,0.00045541013,0.000089473906,0.00011220619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003938536,0.00013634666,0.00017342831,0.00046856634,0.000090913025,0.0001396649,0.00058655685,0.00007258012,0.000034536322],"category_scores_gemma":[0.000041510863,0.00013815548,0.00008919428,0.0011473419,0.00022879447,0.0009952909,0.00045311198,0.00018779804,0.000015684467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013251515,0.000024330846,0.00047292962,0.00006804794,0.00005308286,0.0001010274,0.0005979535,0.000008393992,0.003547993,0.9823717,0.00011801517,0.012623265],"study_design_scores_gemma":[0.00030273804,0.00018938769,0.0033863445,0.00013029913,0.000024877016,0.000058701917,0.00009910758,0.010096781,0.009552991,0.97365177,0.002244972,0.00026204076],"about_ca_topic_score_codex":0.00006968398,"about_ca_topic_score_gemma":0.000019391517,"teacher_disagreement_score":0.4437022,"about_ca_system_score_codex":0.0000375947,"about_ca_system_score_gemma":0.00005451107,"threshold_uncertainty_score":0.5633817},"labels":[],"label_agreement":null},{"id":"W4403462576","doi":"10.1016/j.dam.2024.09.030","title":"Time-delayed Cops and Robbers","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Vancouver Island University; Mount Saint Vincent University; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.012243395674120416,"score_gpt":0.2746837846845574,"score_spread":0.262440389010437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403462576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006493469,0.000409027,0.9546763,0.00040264853,0.00007384715,0.00037003777,0.000008649064,0.0006189522,0.036947075],"genre_scores_gemma":[0.35235322,0.00010068158,0.64411813,0.0001971727,0.00008035656,0.0001346704,0.000012579027,0.00008900623,0.0029141908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878067,0.000013818742,0.00020984959,0.00037548336,0.00030482307,0.00031535132],"domain_scores_gemma":[0.99897426,0.00031130473,0.00003295242,0.00053881545,0.00002133203,0.000121332276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037793757,0.00016442864,0.0001845813,0.00012615135,0.00009590166,0.0002951273,0.0005331604,0.00005479608,0.000038883492],"category_scores_gemma":[0.000021392856,0.0001341101,0.000045733555,0.00043575952,0.00016234064,0.00023523453,0.00036939429,0.00018800948,0.0004961292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003346728,0.000013567028,2.5268133e-7,0.00012859465,0.00003522611,0.000016157177,0.0016116233,0.000037915073,0.0064982553,0.983066,0.00072332215,0.007865699],"study_design_scores_gemma":[0.00015604618,0.00004034228,0.000002367614,0.000056731475,0.00001481116,0.00003512102,0.00021382041,0.2729239,0.0027725934,0.7207773,0.0027425396,0.0002644857],"about_ca_topic_score_codex":5.5321635e-7,"about_ca_topic_score_gemma":3.6031767e-7,"teacher_disagreement_score":0.34585974,"about_ca_system_score_codex":0.000024136576,"about_ca_system_score_gemma":0.00003335631,"threshold_uncertainty_score":0.63769025},"labels":[],"label_agreement":null},{"id":"W4403526016","doi":"10.4230/lipics.gd.2024.14","title":"Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Japan Society for the Promotion of Science; Deutsche Forschungsgemeinschaft","keywords":"Treewidth; Bounding overwatch; Combinatorics; Planar graph; 1-planar graph; Chordal graph; Planar; Clique-sum; Pathwidth; Mathematics; Computer science; Graph; Artificial intelligence; Computer graphics (images); Line graph","score_opus":0.08265023632790686,"score_gpt":0.2319563006026829,"score_spread":0.14930606427477605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403526016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1055007,0.00030017886,0.8885953,0.00046366538,0.0009048112,0.0005200894,0.000041157367,0.00024467835,0.0034294454],"genre_scores_gemma":[0.99585325,0.00007253996,0.0017129773,0.000037142272,0.000047746536,0.0000021295893,0.000009488866,0.000021520898,0.0022432278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980096,0.00028306103,0.0002513644,0.0008901745,0.00018116219,0.00038462016],"domain_scores_gemma":[0.9974207,0.00037242426,0.00019975603,0.0017349549,0.00015177774,0.00012034062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060696446,0.00026734849,0.00031521372,0.0006621339,0.00023381937,0.00014150936,0.0027085594,0.00018304179,0.000025407797],"category_scores_gemma":[0.00004172876,0.00022779607,0.00037521662,0.0017947848,0.00034001746,0.0002417933,0.0021832774,0.0008810964,0.00007793009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027093163,0.000038725117,0.0005088252,0.000078098295,0.00016432117,0.00019229195,0.0004998689,0.02148562,0.00017013993,0.9752562,0.00020847515,0.001370316],"study_design_scores_gemma":[0.00021340116,0.000034500965,0.00036695544,0.000079645295,0.00006456009,0.0000071130366,0.00006505529,0.13668618,0.00020767702,0.8616446,0.00040543303,0.00022484043],"about_ca_topic_score_codex":0.00007792325,"about_ca_topic_score_gemma":0.000050379338,"teacher_disagreement_score":0.89035255,"about_ca_system_score_codex":0.00012350602,"about_ca_system_score_gemma":0.00017458404,"threshold_uncertainty_score":0.92892545},"labels":[],"label_agreement":null},{"id":"W4403560623","doi":"10.1007/s10878-024-01207-w","title":"The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Brock University","funders":"","keywords":"Theory of computation; Hamiltonian path; Combinatorics; Grid; Mathematics; Hamiltonian (control theory); Hamiltonian path problem; Simple (philosophy); Path (computing); Lattice graph; Discrete mathematics; Simple graph; Graph; Longest path problem; Computer science; Chordal graph; Line graph; Algorithm; Voltage graph; Mathematical optimization; Geometry","score_opus":0.010735848812645252,"score_gpt":0.2803335710840392,"score_spread":0.26959772227139395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403560623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004631953,0.0020882091,0.98214537,0.0021037261,0.008327377,0.00052320206,0.000011927036,0.00007263138,0.000095630014],"genre_scores_gemma":[0.8269367,0.0034234808,0.16766547,0.00038189063,0.0012645907,0.0000957031,0.000022339602,0.00011446321,0.00009537257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804825,0.00025250798,0.00059961487,0.00023581987,0.0005287282,0.00033506873],"domain_scores_gemma":[0.9977935,0.0009212336,0.00024015777,0.00032487666,0.00058927096,0.00013098038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018244463,0.0001500519,0.00024042395,0.00046639284,0.00023415731,0.0004435136,0.0008570652,0.00009623176,0.0000061282603],"category_scores_gemma":[0.0007919106,0.0001092899,0.00020490139,0.001687988,0.0000724672,0.00087098137,0.00008510429,0.00035148513,0.000001321666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002722581,0.00011634924,0.00014412156,0.000042221633,0.00009000633,0.00007489929,0.00092163775,0.038902123,0.0004034714,0.9443879,0.0064614597,0.008183513],"study_design_scores_gemma":[0.0012064781,0.0004967092,0.00004576907,0.00008592472,0.000012232458,0.000028628687,0.000049367558,0.20177478,0.00066344946,0.78775984,0.007732298,0.00014454003],"about_ca_topic_score_codex":0.000004700282,"about_ca_topic_score_gemma":0.0000016465877,"teacher_disagreement_score":0.8223047,"about_ca_system_score_codex":0.000110544766,"about_ca_system_score_gemma":0.00028743863,"threshold_uncertainty_score":0.44567126},"labels":[],"label_agreement":null},{"id":"W4403733504","doi":"10.1016/j.disc.2024.114288","title":"Large matchings in maximal 1-planar graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Planar; Planar graph; Chordal graph; Graph; Computer science","score_opus":0.018123747558879955,"score_gpt":0.30189577878873863,"score_spread":0.28377203122985867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403733504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043363698,0.0005528661,0.9453244,0.00087191985,0.00020829854,0.00027750022,0.000022434671,0.00044962746,0.008929259],"genre_scores_gemma":[0.8425313,0.000048955084,0.15616052,0.00013932756,0.000031318894,0.00005026888,0.000008651001,0.0000467808,0.0009828821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834615,0.00005792834,0.00030071018,0.0003770812,0.0004102053,0.00050791854],"domain_scores_gemma":[0.9990079,0.0002414268,0.000034354052,0.0005990058,0.000023851399,0.00009349197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086039456,0.00017109995,0.0002041024,0.0003670131,0.000070631264,0.00030921717,0.0009479723,0.000058723508,0.000039127615],"category_scores_gemma":[0.00006198024,0.00014088706,0.00009907604,0.0009652405,0.00005598484,0.000564753,0.00025155194,0.000323566,0.00030576542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001994682,0.00004064478,0.00006909265,0.00019676778,0.000011844813,0.00017088316,0.0038607614,0.000007755938,0.00032495352,0.99406964,0.00023226549,0.0010134251],"study_design_scores_gemma":[0.00012959281,0.000028581853,0.00008216104,0.0001650352,0.000003035417,0.000040713854,0.00032762933,0.0800487,0.0002970466,0.91662633,0.002069603,0.00018159093],"about_ca_topic_score_codex":0.0000037011912,"about_ca_topic_score_gemma":0.000010627972,"teacher_disagreement_score":0.7991676,"about_ca_system_score_codex":0.000038112557,"about_ca_system_score_gemma":0.000037357433,"threshold_uncertainty_score":0.57452077},"labels":[],"label_agreement":null},{"id":"W4404235910","doi":"10.1016/j.dam.2024.10.026","title":"Recoloring some hereditary graph classes","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.02648004777911063,"score_gpt":0.2954527750302783,"score_spread":0.26897272725116766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404235910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009912248,0.00089464075,0.95731103,0.0005444158,0.00060870504,0.0004859292,0.0000096146805,0.0012541007,0.028979301],"genre_scores_gemma":[0.45575354,0.0002063157,0.5422854,0.00019809586,0.00037642062,0.00032600306,0.000012002798,0.00010293349,0.00073928456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981945,0.000019057077,0.00032456263,0.00049875927,0.00046792201,0.00049516105],"domain_scores_gemma":[0.9984626,0.00049728825,0.00004923536,0.00082309934,0.000031036278,0.00013671878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048192244,0.00022412025,0.00024124944,0.0002613796,0.00014359746,0.00035747606,0.0010756325,0.000078311445,0.000026435122],"category_scores_gemma":[0.000039852028,0.00018732982,0.00011687892,0.00078878406,0.00011373435,0.0006818392,0.00046502324,0.00033525113,0.00039825466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024597787,0.000027579867,0.0000015363115,0.00028092825,0.000040333867,0.0000624549,0.0006616562,0.000056447887,0.0027722467,0.98770124,0.00071330025,0.007679819],"study_design_scores_gemma":[0.00009471164,0.000031753494,0.0000115676785,0.00008940499,0.000010418058,0.000028343688,0.00026374927,0.01829186,0.0051627196,0.97351855,0.0022413414,0.00025558672],"about_ca_topic_score_codex":8.4531393e-7,"about_ca_topic_score_gemma":0.0000013707861,"teacher_disagreement_score":0.44584128,"about_ca_system_score_codex":0.00004922595,"about_ca_system_score_gemma":0.00006211849,"threshold_uncertainty_score":0.7639088},"labels":[],"label_agreement":null},{"id":"W4404885503","doi":"10.1002/rsa.21271","title":"Typical Structure of Hereditary Graph Families. I. Apex‐free Families","year":2024,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Graph","score_opus":0.008741220257620879,"score_gpt":0.258519497421506,"score_spread":0.2497782771638851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404885503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38808545,0.036734417,0.56713194,0.0009739547,0.0036375446,0.0010541126,0.00059614744,0.00074723014,0.001039198],"genre_scores_gemma":[0.9563374,0.0009788614,0.04216792,0.000081897066,0.00029953427,0.000007554972,0.000013171675,0.00002721838,0.00008646667],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979745,0.000121246936,0.0003373834,0.0006189758,0.00052811083,0.00041978128],"domain_scores_gemma":[0.99854845,0.00044419066,0.000050979317,0.0007110642,0.00008636273,0.00015895999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019597294,0.0002842748,0.00043910087,0.00036293583,0.0001541169,0.00017517866,0.0009918255,0.00014514488,0.00004328463],"category_scores_gemma":[0.00009473605,0.00020482205,0.00016387319,0.0007634996,0.00044140022,0.00043269974,0.0005001768,0.0004338835,0.0000017657333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042646637,0.000025855079,0.00017259784,0.00046960634,0.00030282894,0.00024315753,0.0016791547,0.00038981665,0.008606459,0.4131659,0.0022119381,0.5723062],"study_design_scores_gemma":[0.0029870234,0.00019470282,0.0028851184,0.00008532012,0.000029891686,0.0002535666,0.000276595,0.020216584,0.006738009,0.96228445,0.0036334123,0.0004153248],"about_ca_topic_score_codex":0.000035353918,"about_ca_topic_score_gemma":0.000012106837,"teacher_disagreement_score":0.5718909,"about_ca_system_score_codex":0.000015399379,"about_ca_system_score_gemma":0.00006672268,"threshold_uncertainty_score":0.83524007},"labels":[],"label_agreement":null},{"id":"W4404984221","doi":"","title":"A NOTE ON QUARTER-SYMMETRIC METRIC CONNECTIONS","year":2015,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Metric (unit); Mathematics; Combinatorics; Geography; Engineering; Archaeology; Operations management","score_opus":0.3238713946165705,"score_gpt":0.5692896157092927,"score_spread":0.2454182210927222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404984221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19511825,0.022702813,0.7097668,0.00228157,0.004439111,0.0021147702,0.000066091845,0.00051340676,0.06299718],"genre_scores_gemma":[0.9930095,0.001145505,0.0046563824,0.00041807783,0.00016992413,0.0000698916,0.0000029686455,0.000046765654,0.00048096172],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99511236,0.0007639047,0.0008325503,0.00080614915,0.001752534,0.00073248544],"domain_scores_gemma":[0.99443895,0.0017347477,0.0006797281,0.0014172822,0.0009163343,0.0008129329],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0034925689,0.00037512387,0.00075305765,0.005948548,0.00039274804,0.0022341209,0.008424528,0.00012706079,0.00082653365],"category_scores_gemma":[0.0025016624,0.00033595497,0.00025501844,0.013136883,0.00017599062,0.0049690846,0.0019599614,0.00078929955,0.0002035442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012056568,0.0038273397,0.14915434,0.00017420943,0.0008943117,0.0006859109,0.0019800155,0.0067202062,0.036390655,0.18322945,0.21280077,0.40293714],"study_design_scores_gemma":[0.0043786275,0.0004676925,0.23965351,0.00051041873,0.000107023654,0.00020669897,0.000312174,0.014784262,0.040965464,0.6360907,0.060257528,0.0022659171],"about_ca_topic_score_codex":0.0002972018,"about_ca_topic_score_gemma":0.000023843979,"teacher_disagreement_score":0.79789126,"about_ca_system_score_codex":0.00029822247,"about_ca_system_score_gemma":0.00035491085,"threshold_uncertainty_score":0.9999092},"labels":[],"label_agreement":null},{"id":"W4405231961","doi":"10.1017/s0963548324000415","title":"Tight bound for the Erdős–Pósa property of tree minors","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; University of Ottawa","keywords":"Combinatorics; Mathematics; Disjoint sets; Upper and lower bounds; Minor (academic); Vertex (graph theory); Graph; Tree (set theory); Discrete mathematics; Integer (computer science); Pairwise comparison; Computer science; Statistics","score_opus":0.043453593176519964,"score_gpt":0.3042557150052427,"score_spread":0.2608021218287227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405231961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050597858,0.0024692349,0.9387618,0.0019593555,0.0019662639,0.0018889479,0.000005335349,0.0004525721,0.0018986873],"genre_scores_gemma":[0.9823351,0.000010778688,0.017073886,0.000035137004,0.00007008469,0.00005178588,0.0000017190683,0.000024552122,0.0003969827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997429,0.00021212432,0.0005165519,0.0007488333,0.00052462105,0.0005688314],"domain_scores_gemma":[0.9953952,0.0027063051,0.00011116259,0.0012453862,0.000436475,0.00010550085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027998388,0.00022846927,0.00030138835,0.00014125279,0.00044131928,0.00030213085,0.002117881,0.00008657003,0.0000036010858],"category_scores_gemma":[0.00069111004,0.000134934,0.00023035245,0.0015142537,0.00036072824,0.00037055823,0.00093799975,0.00039113636,0.000009510112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001306522,0.00014190964,0.00053406117,0.0005045357,0.000048175512,0.0000038209946,0.0010446332,0.00030644514,0.00032303765,0.89668304,0.0003613777,0.10003592],"study_design_scores_gemma":[0.00023016035,0.00016772725,0.0003741757,0.00007852906,0.0000116336705,0.000007943224,0.000027768285,0.30260736,0.0023265886,0.68770534,0.0062904907,0.0001722699],"about_ca_topic_score_codex":0.000015164133,"about_ca_topic_score_gemma":0.0000052818837,"teacher_disagreement_score":0.93173724,"about_ca_system_score_codex":0.00019241251,"about_ca_system_score_gemma":0.00029482468,"threshold_uncertainty_score":0.5502449},"labels":[],"label_agreement":null},{"id":"W4405364433","doi":"10.1137/23m1548591","title":"On the Parameterized Complexity of Deletion to \\(\\boldsymbol{\\mathcal{H}}\\)-Free Strong Components","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Horizon 2020 Framework Programme","keywords":"Parameterized complexity; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.08969256280258837,"score_gpt":0.33928839582178805,"score_spread":0.2495958330191997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405364433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.240896,0.000065830325,0.75072885,0.0053935805,0.00034035716,0.00046610783,0.000029954239,0.00010303794,0.0019762956],"genre_scores_gemma":[0.9191262,0.000020347567,0.080351196,0.00023486644,0.000061348714,0.000019342637,0.0000020104214,0.00003539588,0.00014929412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704546,0.00032524948,0.000648338,0.00031921803,0.0012063057,0.00045542742],"domain_scores_gemma":[0.99687237,0.001347527,0.00021188121,0.0012050925,0.00013169133,0.00023143608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017050275,0.0002600159,0.00038545433,0.00033539714,0.00025350644,0.0004773935,0.0022637951,0.000059066268,0.00007273949],"category_scores_gemma":[0.0005952407,0.00015773508,0.00025350487,0.0006730769,0.00023024685,0.00029257848,0.0004898697,0.00070519623,0.00016230253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052501517,0.00012195471,0.0000026934715,0.000094304414,0.0000711499,0.000040082654,0.00085447496,0.0005225866,0.0042693275,0.9918197,0.0006953809,0.0014558692],"study_design_scores_gemma":[0.00031293076,0.00057319825,0.00010872115,0.00082951225,0.000013753171,0.000100651865,0.00015634355,0.09422135,0.0034128414,0.8997489,0.00032075308,0.00020099108],"about_ca_topic_score_codex":0.0000014545246,"about_ca_topic_score_gemma":0.0000010275616,"teacher_disagreement_score":0.67823017,"about_ca_system_score_codex":0.000104814215,"about_ca_system_score_gemma":0.000053163196,"threshold_uncertainty_score":0.64322495},"labels":[],"label_agreement":null},{"id":"W4405475243","doi":"10.1137/24m169669x","title":"Corrigendum: Orthogonal Tree-Decompositions of Graphs","year":2024,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Australian Research Council; University of Ottawa","keywords":"Mathematics; Combinatorics; Tree (set theory); Discrete mathematics","score_opus":0.031064065311332986,"score_gpt":0.3166621801442057,"score_spread":0.28559811483287273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405475243","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022908651,0.00679496,0.62484235,0.002325188,0.063325845,0.001077453,0.00053139287,0.00048517904,0.30038854],"genre_scores_gemma":[0.0062943297,0.0060190377,0.39811465,0.000530517,0.0034513643,0.00012701053,0.00029181238,0.0007527467,0.58441854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952421,0.00023231494,0.0013076027,0.0005808328,0.0019119385,0.0007251988],"domain_scores_gemma":[0.9965683,0.00033233815,0.0009439422,0.0013456539,0.0003919906,0.00041773866],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011239756,0.0006139143,0.00097431673,0.0013489675,0.0003138744,0.0005341951,0.0029497605,0.00039280485,0.00017870525],"category_scores_gemma":[0.00017279918,0.00047136453,0.00095081097,0.0012550924,0.00029856863,0.00039320483,0.0005894651,0.0036967453,0.0002860017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013250514,0.00019634413,0.0000015682228,0.0005876945,0.00029223596,0.00036921282,0.0005607166,0.000035473124,0.00010458964,0.6268518,0.3690061,0.0019810405],"study_design_scores_gemma":[0.0002626392,0.00061058206,0.000011977226,0.002881766,0.000115250434,0.0010853851,0.00013062079,0.009484598,0.00018377362,0.93293977,0.05170768,0.00058597105],"about_ca_topic_score_codex":6.6579884e-7,"about_ca_topic_score_gemma":0.000005897439,"teacher_disagreement_score":0.3172984,"about_ca_system_score_codex":0.00014565556,"about_ca_system_score_gemma":0.00060830975,"threshold_uncertainty_score":0.9997738},"labels":[],"label_agreement":null},{"id":"W4405592103","doi":"10.1051/ita/2024015","title":"Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees","year":2024,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Vertex (graph theory); Combinatorics; Feedback vertex set; Mathematics; Discrete mathematics; Graph; Computer science","score_opus":0.008375581791291243,"score_gpt":0.26857800056655173,"score_spread":0.2602024187752605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405592103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04074567,0.00029557978,0.944842,0.0014423106,0.000041082534,0.0007650602,0.000024694174,0.00043309166,0.011410524],"genre_scores_gemma":[0.9415291,0.00011241022,0.057885535,0.00013013872,0.000012453515,0.00025118428,0.000017680362,0.000014376574,0.000047109646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876916,0.000063306434,0.00035709265,0.00022424641,0.00025076876,0.00033544961],"domain_scores_gemma":[0.9986939,0.0005988176,0.000040766485,0.00044488913,0.00006336905,0.00015828383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043880558,0.00016504235,0.00017203875,0.00023845729,0.00017616374,0.0003557458,0.00044795737,0.00006623598,0.000017138986],"category_scores_gemma":[0.00003198175,0.000123609,0.000037641705,0.0012381438,0.0005376335,0.00048174412,0.00019670451,0.00023492015,0.000045037727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004531504,0.00003110527,0.000052058534,0.00005190696,0.000012360204,0.0000020098937,0.00094355457,0.00008491652,0.00010714602,0.94502014,0.00003961735,0.053650666],"study_design_scores_gemma":[0.00019645083,0.000055360975,0.00025727865,0.0000886811,0.000005864804,0.000022444492,0.00024156092,0.4963888,0.00018309079,0.5010199,0.0013713657,0.00016919464],"about_ca_topic_score_codex":0.00000230049,"about_ca_topic_score_gemma":0.0000066667358,"teacher_disagreement_score":0.9007834,"about_ca_system_score_codex":0.000028034552,"about_ca_system_score_gemma":0.00005991687,"threshold_uncertainty_score":0.5040629},"labels":[],"label_agreement":null},{"id":"W4405695073","doi":"10.1016/j.disc.2024.114372","title":"Existential closure in uniform hypergraphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Closure (psychology); Combinatorics; Discrete mathematics; Hypergraph; Existentialism","score_opus":0.02157182862074907,"score_gpt":0.305390688148636,"score_spread":0.28381885952788694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405695073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045381445,0.000776561,0.8989568,0.00089361914,0.00050734554,0.00041508395,0.000012356455,0.000569992,0.0524868],"genre_scores_gemma":[0.87018853,0.00008216868,0.12810746,0.000047192487,0.00005847257,0.00004184497,0.000005396248,0.00003608833,0.0014328632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860394,0.000040959683,0.0002847794,0.00032125993,0.00038414856,0.00036488523],"domain_scores_gemma":[0.99906826,0.00017783868,0.000028990871,0.00061350345,0.00003154585,0.00007987784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050839013,0.00014826974,0.00017590789,0.0003663635,0.0000536342,0.00027783008,0.0008561643,0.000059979448,0.00003237694],"category_scores_gemma":[0.000057433033,0.00011885192,0.00011622634,0.001189763,0.000083564424,0.00048639436,0.00028418176,0.00025972349,0.00016981422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019645734,0.00003016396,0.000058282378,0.00017753404,0.000014280639,0.00010378494,0.0015007209,0.000044626737,0.0002444314,0.9943591,0.0001231384,0.0033420022],"study_design_scores_gemma":[0.00017355799,0.000053113417,0.00007480808,0.00021177623,0.000005654516,0.00004995274,0.0002782355,0.14629,0.0007926503,0.848098,0.00373896,0.00023332142],"about_ca_topic_score_codex":0.000003878826,"about_ca_topic_score_gemma":0.000012050146,"teacher_disagreement_score":0.82480705,"about_ca_system_score_codex":0.000037295013,"about_ca_system_score_gemma":0.000057425812,"threshold_uncertainty_score":0.48466408},"labels":[],"label_agreement":null},{"id":"W4405806035","doi":"10.1016/j.ejc.2024.104104","title":"On heroes in digraphs with forbidden induced forests","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Grantová Agentura České Republiky","keywords":"Mathematics; Combinatorics; Digraph","score_opus":0.01995709647949996,"score_gpt":0.27270917631230945,"score_spread":0.2527520798328095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405806035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90723234,0.0005962159,0.08279433,0.00051731453,0.0007752892,0.00010824727,4.6302043e-7,0.00006786396,0.00790796],"genre_scores_gemma":[0.9988308,0.00003583232,0.00089724077,0.000039698265,0.000038413924,7.5723096e-7,1.3017414e-7,0.00002940542,0.00012774255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981886,0.0004081913,0.00033270655,0.00020306252,0.00058721646,0.00028022192],"domain_scores_gemma":[0.9989505,0.00030867636,0.00011387541,0.000338035,0.00014489469,0.00014404605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014658555,0.0001409553,0.00018029181,0.00067759684,0.000049804283,0.00022892219,0.0011361369,0.00001759192,0.000003355013],"category_scores_gemma":[0.0001121529,0.00009964357,0.000079290454,0.0013995926,0.000043512126,0.0006354069,0.00013514279,0.0006761855,0.000033412878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008197891,0.0001376971,0.0019488911,0.000030241794,0.000038436672,0.0059750327,0.00082946697,0.00024278036,0.00019603112,0.97287095,0.0004928732,0.01715564],"study_design_scores_gemma":[0.0026485,0.006900024,0.030536827,0.0012635547,0.000013123268,0.0007310173,0.00015052459,0.0022266835,0.0017264134,0.94810677,0.0051857037,0.0005108521],"about_ca_topic_score_codex":4.4256797e-7,"about_ca_topic_score_gemma":0.000002259046,"teacher_disagreement_score":0.091598466,"about_ca_system_score_codex":0.00007063302,"about_ca_system_score_gemma":0.00009757764,"threshold_uncertainty_score":0.4063347},"labels":[],"label_agreement":null},{"id":"W4406142000","doi":"10.1137/1.9781611978322.110","title":"Planar Graphs in Blowups of Fans","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Social Sciences and Humanities Research Council; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Computer science","score_opus":0.05531187485176512,"score_gpt":0.2729049954355485,"score_spread":0.2175931205837834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406142000","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027810334,0.00016239035,0.109070584,0.0001348238,0.00024899121,0.0035660183,0.0002990204,0.00013801244,0.8861021],"genre_scores_gemma":[0.0040696897,0.0002245852,0.44671437,0.0003323947,0.00040931953,0.0007292131,0.00008414056,0.00019943243,0.54723686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998286,0.000005367812,0.00058494287,0.00046084862,0.00033135252,0.000331499],"domain_scores_gemma":[0.998483,0.00055210094,0.00029982347,0.0005206081,0.00006397083,0.00008051336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061869586,0.00033008,0.0006896345,0.00016923658,0.00010911564,0.00004715481,0.00071620854,0.00064979604,0.000003974402],"category_scores_gemma":[0.000023706485,0.00030857295,0.0004227186,0.00006842586,0.00030318435,0.00003300259,0.00027941293,0.0006358471,0.000001175202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019106472,0.000021431188,3.0416533e-7,0.00034096028,0.0001199959,7.087671e-7,0.0008365354,0.0000017199832,0.00019480727,0.979727,0.0013123396,0.017425086],"study_design_scores_gemma":[0.0011545394,0.00006285316,7.716798e-8,0.0003398216,0.000042164746,0.000001396275,0.00011474242,0.00025482697,0.00088918325,0.98857504,0.008297269,0.0002680742],"about_ca_topic_score_codex":0.0000017573807,"about_ca_topic_score_gemma":0.0000028798434,"teacher_disagreement_score":0.33886522,"about_ca_system_score_codex":0.000038660084,"about_ca_system_score_gemma":0.00018734968,"threshold_uncertainty_score":0.99993664},"labels":[],"label_agreement":null},{"id":"W4406151938","doi":"10.1137/1.9781611978322.151","title":"Tree Independence Number IV. Even-hole-free graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Tree (set theory); Independence (probability theory); Mathematics; Combinatorics; Independence number; Discrete mathematics; Graph; Statistics","score_opus":0.05098567971063879,"score_gpt":0.280411270088534,"score_spread":0.22942559037789523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406151938","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003668659,0.00008333825,0.10833304,0.00018953106,0.00029399543,0.002434618,0.00021917834,0.00028355222,0.8881261],"genre_scores_gemma":[0.0006954087,0.00008696732,0.23536615,0.00035290187,0.0005468527,0.0006194364,0.000044236112,0.00015487519,0.7621332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968183,0.000010809263,0.00070312066,0.0009604093,0.00085950934,0.00064784597],"domain_scores_gemma":[0.9968502,0.0008381151,0.00043692536,0.0014700802,0.000180116,0.00022455005],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009821213,0.0006603849,0.000862927,0.00011705219,0.00047461395,0.00026270386,0.0021075697,0.0013328413,0.000028242823],"category_scores_gemma":[0.00007570285,0.0006166234,0.0007985567,0.00009284459,0.0004888488,0.00009985032,0.0015217741,0.001454675,0.000019517407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026107942,0.00002498419,2.760372e-7,0.00023885911,0.0002460744,0.0000018145428,0.00045144086,0.000001052079,0.00007945508,0.931079,0.016412817,0.05143815],"study_design_scores_gemma":[0.0018267975,0.000059957845,6.213082e-8,0.00030129473,0.00010574386,0.0000075394723,0.00015736921,0.00041862935,0.00047511575,0.9593054,0.03675159,0.0005904801],"about_ca_topic_score_codex":0.0000018210022,"about_ca_topic_score_gemma":0.000004725319,"teacher_disagreement_score":0.12703311,"about_ca_system_score_codex":0.000073906805,"about_ca_system_score_gemma":0.00037112678,"threshold_uncertainty_score":0.99996364},"labels":[],"label_agreement":null},{"id":"W4406163979","doi":"10.61091/ars161-15","title":"Hamilton-connected properties of 3-connected {claw, hourglass, bull}-free graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Hourglass; Mathematics; Combinatorics; Geography; Structural engineering; Engineering","score_opus":0.01876740492641785,"score_gpt":0.24959209917180447,"score_spread":0.23082469424538662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406163979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850366,0.0040901364,0.0024197525,0.0009196842,0.00350467,0.000613963,0.000015327849,0.001298422,0.002101434],"genre_scores_gemma":[0.99770856,0.000106735475,0.00154554,0.00005901477,0.000011381321,0.000069819456,0.0000045620422,0.00005038029,0.0004439788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969812,0.00028046998,0.00049312273,0.0007955122,0.0007672932,0.0006823809],"domain_scores_gemma":[0.99703085,0.00041995794,0.00010069716,0.0018507777,0.00039916328,0.00019856819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006650708,0.00032580385,0.00042469375,0.0005862119,0.00017849475,0.00025593353,0.0027189392,0.00015284948,0.000032626605],"category_scores_gemma":[0.00047440708,0.000283813,0.00020611165,0.00261783,0.00037758306,0.0008860967,0.0007209492,0.0004885387,0.00009705106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035269157,0.00011709959,0.000183883,0.00015098267,0.00011271266,0.0000768,0.0008349528,0.000013868953,0.025725974,0.9690889,0.0018814428,0.0017781242],"study_design_scores_gemma":[0.00079448154,0.00025407216,0.00043539214,0.00027011495,0.000015414682,0.000029103432,0.000055046807,0.005339697,0.08232197,0.9081107,0.0020094304,0.00036460243],"about_ca_topic_score_codex":0.00004505731,"about_ca_topic_score_gemma":0.000010218296,"teacher_disagreement_score":0.060978215,"about_ca_system_score_codex":0.00008400502,"about_ca_system_score_gemma":0.00022834085,"threshold_uncertainty_score":0.9999614},"labels":[],"label_agreement":null},{"id":"W4406164433","doi":"10.61091/ars161-10","title":"3-Trees with Diameter 2","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.013178216316463988,"score_gpt":0.2714635989864607,"score_spread":0.25828538266999673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6131693,0.0042373734,0.33080414,0.0043779206,0.007066734,0.0008222465,0.0000070444826,0.0033684557,0.03614678],"genre_scores_gemma":[0.99034274,0.0000135743285,0.008561873,0.00007407267,0.0000066560187,0.000027107157,8.168698e-7,0.000018108003,0.0009550592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988296,0.000059568967,0.000094905015,0.00038552718,0.00032396655,0.00030645163],"domain_scores_gemma":[0.99900603,0.00023808217,0.000013304593,0.0005919671,0.000052385556,0.00009825337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023054272,0.000115850315,0.000104920466,0.00015327243,0.000075045195,0.00027414286,0.0007528616,0.000033453653,0.00002356969],"category_scores_gemma":[0.000025224761,0.000086216154,0.000043293603,0.000831213,0.00008914261,0.0006364394,0.00021462483,0.00020300178,0.0002812824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004668288,0.00002195936,0.0003810938,0.000010970394,0.000021512862,0.00012247254,0.0001843345,0.0000083616505,0.00028499152,0.987034,0.0008799496,0.011045678],"study_design_scores_gemma":[0.0001848783,0.00017610462,0.00063529646,0.000043877968,0.0000030439257,0.000023759481,0.000010156086,0.0032951874,0.0022777717,0.9841492,0.009047025,0.00015370148],"about_ca_topic_score_codex":0.000004145121,"about_ca_topic_score_gemma":0.0000029737703,"teacher_disagreement_score":0.37717342,"about_ca_system_score_codex":0.000035545192,"about_ca_system_score_gemma":0.00006116552,"threshold_uncertainty_score":0.36154103},"labels":[],"label_agreement":null},{"id":"W4406164824","doi":"10.61091/ars161-16","title":"The 2 -burning Number of a Graph","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01337650856485818,"score_gpt":0.30332214073398817,"score_spread":0.28994563216913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85863507,0.0075896834,0.06572562,0.0034349551,0.012317896,0.0006634476,0.0000043792033,0.0011497083,0.050479263],"genre_scores_gemma":[0.99790496,0.00006604114,0.0013838093,0.000017611952,0.000004690139,0.000015976122,2.7513147e-7,0.000010618881,0.0005960412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988937,0.00010586571,0.00016262513,0.00023252658,0.00033429408,0.00027099313],"domain_scores_gemma":[0.99857044,0.0006833666,0.000030836167,0.000575684,0.00008227616,0.000057366215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006796178,0.00008364756,0.000094436844,0.00006878713,0.00017130534,0.00016556284,0.0010365439,0.000031013573,0.000010768692],"category_scores_gemma":[0.00009383545,0.00005818061,0.00008342164,0.0010096431,0.00014554903,0.00031244959,0.00030353418,0.00022525301,0.000111153524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029908474,0.000012016399,0.000426651,0.000012522542,0.000021060658,0.000016108936,0.0002450389,0.00000431828,0.00030028724,0.9863131,0.0007290147,0.011916871],"study_design_scores_gemma":[0.00009714566,0.000027122356,0.00021176814,0.00003321096,0.0000020643822,0.000014307856,0.000024162911,0.0024296949,0.0017132203,0.98784715,0.007531324,0.000068857706],"about_ca_topic_score_codex":0.0000052409528,"about_ca_topic_score_gemma":7.2436086e-7,"teacher_disagreement_score":0.13926989,"about_ca_system_score_codex":0.000020542564,"about_ca_system_score_gemma":0.000058038157,"threshold_uncertainty_score":0.23725364},"labels":[],"label_agreement":null},{"id":"W4406171432","doi":"10.1016/j.disc.2024.114383","title":"The sandwich problem for odd-hole-free and even-hole-free graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016880662444144736,"score_gpt":0.29887521204873435,"score_spread":0.28199454960458964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031639442,0.0010911309,0.97321063,0.0066036656,0.00014010447,0.0015389064,0.000055239758,0.00023192649,0.013964442],"genre_scores_gemma":[0.12457051,0.0003969123,0.8612801,0.00053903356,0.00008683137,0.0011586446,0.000014099371,0.00010230988,0.011851597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979937,0.000086902946,0.00043800657,0.00046236176,0.0004278239,0.0005912218],"domain_scores_gemma":[0.995728,0.0014585977,0.00014255356,0.002379804,0.00017900561,0.000112045236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012601749,0.0002501998,0.0002933441,0.00016565934,0.0006617934,0.00045218877,0.0032623776,0.00008314878,0.0000023037192],"category_scores_gemma":[0.00082355435,0.00016777987,0.00014094694,0.00069783017,0.00032497742,0.00029981174,0.0016579248,0.00023503802,0.000006514295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017668634,0.000037272333,0.00004502667,0.00023921512,0.000052957705,0.000001911954,0.0005215137,0.000021933995,0.00023199107,0.98768306,0.004144578,0.0070028943],"study_design_scores_gemma":[0.0008741958,0.00008343095,0.00005949127,0.00013009449,0.000019634226,0.0000046281057,0.00043628397,0.027951224,0.0008229837,0.9634593,0.005961866,0.0001968508],"about_ca_topic_score_codex":0.0000027969402,"about_ca_topic_score_gemma":0.000026895497,"teacher_disagreement_score":0.12140656,"about_ca_system_score_codex":0.00002927861,"about_ca_system_score_gemma":0.00007770991,"threshold_uncertainty_score":0.68418646},"labels":[],"label_agreement":null},{"id":"W4406172191","doi":"10.61091/um121-06","title":"D-irregularity Strength of a Graph","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Direktorat Jenderal Pendidikan Tinggi; Kementerian Pendidikan, Kebudayaan, Riset, dan Teknologi; Institut Teknologi Bandung","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.026275882808709693,"score_gpt":0.31175349837280947,"score_spread":0.2854776155640998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406172191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020955259,0.0019135238,0.955734,0.0006014833,0.00019449121,0.0003144742,0.000018635219,0.00052370265,0.019744439],"genre_scores_gemma":[0.88075596,0.000014255249,0.11873126,0.000014295874,0.000013815883,0.000022119222,0.0000010925484,0.000012802507,0.00043438395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986035,0.00008158029,0.00027911455,0.00033744005,0.00041525296,0.00028309654],"domain_scores_gemma":[0.99831444,0.00059008895,0.000032447486,0.00090570777,0.00006600524,0.000091302354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006978462,0.0001232576,0.00020560858,0.00024299754,0.000047884812,0.00007767617,0.00088600564,0.000045660512,0.00013581858],"category_scores_gemma":[0.0001884034,0.00009956784,0.00014017186,0.00088037434,0.00018809698,0.00034120408,0.00029651495,0.00016679593,0.00013363665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024346696,0.00007822064,0.000007730375,0.00035631168,0.000032126543,0.0000150856085,0.0007873335,0.0000015887707,0.0005577911,0.98284,0.0004185638,0.014902826],"study_design_scores_gemma":[0.00006364833,0.000056056964,0.0000654987,0.00014434666,0.0000069466414,0.000017898801,0.0000635036,0.029087897,0.004247728,0.96492213,0.0012263333,0.00009803357],"about_ca_topic_score_codex":0.0000021218668,"about_ca_topic_score_gemma":8.603116e-7,"teacher_disagreement_score":0.8598007,"about_ca_system_score_codex":0.000017587154,"about_ca_system_score_gemma":0.000061433966,"threshold_uncertainty_score":0.4060259},"labels":[],"label_agreement":null},{"id":"W4406203418","doi":"10.61091/jcmcc123-42","title":"Saturation of \\(K_{4}\\) Subdivisions in Multidimensional Grids","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Graph; Complete bipartite graph; Induced subgraph; Discrete mathematics; Vertex (graph theory)","score_opus":0.017579574090746362,"score_gpt":0.30022087855568325,"score_spread":0.2826413044649369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406203418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8434771,0.0012184206,0.1389655,0.00032835096,0.015332677,0.00028659732,0.0000020482933,0.00005709545,0.0003322584],"genre_scores_gemma":[0.9702939,0.0000509992,0.029250799,0.0000073718957,0.00037325494,0.00000112675,5.711536e-7,0.000018052779,0.000003935778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972585,0.0001724311,0.0011493335,0.0002505703,0.0008693984,0.00029978398],"domain_scores_gemma":[0.99692214,0.0017358001,0.00044406543,0.00027817613,0.00047632563,0.00014350587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025814294,0.00020639223,0.00056797074,0.0006118487,0.00011293459,0.0001883528,0.0006054477,0.00012349381,0.0000032988835],"category_scores_gemma":[0.000590946,0.00017502476,0.00016503058,0.0009538023,0.000102400925,0.00062202074,0.00040767464,0.0006289358,0.0000020721561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033264343,0.00026764558,0.00013758588,0.00017199115,0.00003861771,0.000060543436,0.0012007679,0.00012732294,0.002525221,0.99175906,0.0000617161,0.003616233],"study_design_scores_gemma":[0.0016395726,0.0005298567,0.00034796813,0.0008254663,0.000016713264,0.0001147111,0.00011535206,0.09125291,0.001929272,0.90273166,0.00030849242,0.00018801374],"about_ca_topic_score_codex":0.0000052119544,"about_ca_topic_score_gemma":3.6082366e-7,"teacher_disagreement_score":0.12681684,"about_ca_system_score_codex":0.00008702124,"about_ca_system_score_gemma":0.00023979867,"threshold_uncertainty_score":0.7137302},"labels":[],"label_agreement":null},{"id":"W4406215708","doi":"10.46298/dmtcs.6848","title":"Colourings of $(m, n)$-coloured mixed graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.01252100145226509,"score_gpt":0.29307219231010706,"score_spread":0.28055119085784197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406215708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0439609,0.000044470937,0.9444458,0.0008153443,0.0004128793,0.00042531238,0.0000036807432,0.00019150811,0.0097001465],"genre_scores_gemma":[0.6403137,0.0000046482087,0.35948223,0.00012443274,0.000009170257,0.000018200173,4.668939e-7,0.000008536508,0.000038632657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962937,0.00016046353,0.0006702827,0.00085877586,0.0011636307,0.00085313176],"domain_scores_gemma":[0.99630284,0.0009656549,0.00019816139,0.001757437,0.0005117346,0.00026418417],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028024607,0.00029614987,0.0005102047,0.00075516413,0.00044516326,0.00034270712,0.005378251,0.000090247755,0.000029218376],"category_scores_gemma":[0.0004966463,0.0002409872,0.00019675089,0.0039438065,0.005519449,0.0006173933,0.002652359,0.00032487966,0.000024229696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011371578,0.0001323687,0.000052026542,0.000089371,0.000018767589,0.000007437828,0.0006018263,0.00006603745,0.0030631402,0.9921974,0.000061071085,0.0036991925],"study_design_scores_gemma":[0.00025130538,0.00011054955,0.00020236419,0.0001173507,0.00000903172,0.000008721876,0.000040642608,0.25136515,0.019834284,0.7278427,0.000034441466,0.00018349722],"about_ca_topic_score_codex":0.0000013910603,"about_ca_topic_score_gemma":6.0300795e-7,"teacher_disagreement_score":0.59635276,"about_ca_system_score_codex":0.000056476067,"about_ca_system_score_gemma":0.00025520613,"threshold_uncertainty_score":0.99942183},"labels":[],"label_agreement":null},{"id":"W4406372334","doi":"10.46298/dmtcs.13438","title":"Eulerian $k$-dominating reconfiguration graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Mount Allison University; Universities Space Research Association","keywords":"Eulerian path; Combinatorics; Mathematics; Vertex (graph theory); Dominating set; Graph; Discrete mathematics; Lagrangian; Mathematical analysis","score_opus":0.01472033709827064,"score_gpt":0.30093745814633094,"score_spread":0.2862171210480603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406372334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069970037,0.00003020801,0.95505583,0.0013930941,0.00051326375,0.0003993737,0.000001972369,0.00028637235,0.0353229],"genre_scores_gemma":[0.59684575,0.000004090035,0.40277746,0.00025626644,0.000024083572,0.00002470927,0.0000010299534,0.000009368792,0.00005724622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645287,0.00017829565,0.0005866449,0.00097124896,0.00094925944,0.00086166005],"domain_scores_gemma":[0.9968066,0.000808229,0.0001495395,0.0015742662,0.00040314483,0.0002582265],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031446824,0.00029649292,0.0003544782,0.00067723694,0.00087553763,0.0010841128,0.0040044757,0.000078813195,0.00005461881],"category_scores_gemma":[0.0006071344,0.00024665295,0.0001416542,0.0033146234,0.0029317657,0.0011959304,0.0014830733,0.00035007295,0.000068350375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048000347,0.000055921766,0.000016556996,0.000040841132,0.000009078637,0.000006627201,0.0006750716,0.000049605438,0.00243699,0.97253823,0.00003293554,0.024133319],"study_design_scores_gemma":[0.00015113031,0.000047088357,0.00006014372,0.000089250105,0.0000041757808,0.000010535328,0.00004388771,0.40724096,0.005482288,0.58666205,0.00003932569,0.00016914046],"about_ca_topic_score_codex":0.0000010711661,"about_ca_topic_score_gemma":6.757714e-7,"teacher_disagreement_score":0.58984876,"about_ca_system_score_codex":0.00007827879,"about_ca_system_score_gemma":0.00020113958,"threshold_uncertainty_score":0.99999857},"labels":[],"label_agreement":null},{"id":"W4406651655","doi":"10.1007/978-3-031-75409-8_7","title":"Improved Outerplanarity Bounds for Planar Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Waterloo","funders":"","keywords":"Computer science; Planar; Planar graph; Theoretical computer science; Graph; Computer graphics (images)","score_opus":0.018720267353283707,"score_gpt":0.2899366867150379,"score_spread":0.2712164193617542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406651655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010861865,0.00046726235,0.991586,0.0011347038,0.002085052,0.0010737682,0.000053598225,0.00025374762,0.0033349856],"genre_scores_gemma":[0.014365297,0.000078914825,0.97839165,0.0030234803,0.00037872803,0.000104445804,0.0000322282,0.000062584964,0.0035626728],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487174,0.00005040222,0.00061352283,0.002332499,0.00092130614,0.0012105368],"domain_scores_gemma":[0.99520475,0.0014741451,0.0002633506,0.0023400493,0.00045849624,0.0002592275],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015864896,0.0006800439,0.0007374498,0.0018382178,0.0005562001,0.00075906864,0.0065385946,0.00045576133,0.000008239979],"category_scores_gemma":[0.0002648411,0.00064189266,0.00029990714,0.0010902404,0.0011375776,0.00073457434,0.001425513,0.0011355574,0.00001008166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040059746,0.000034883782,0.000035153505,0.00012017803,0.000031150095,0.000044445133,0.0002469975,0.0009928221,0.00023190604,0.482479,0.00016729957,0.51557606],"study_design_scores_gemma":[0.00038274602,0.00024662682,0.000017504597,0.00020770765,0.0000073972265,0.000022044744,9.716891e-8,0.2397726,0.00080907723,0.7535857,0.0043766596,0.00057185104],"about_ca_topic_score_codex":0.000022931275,"about_ca_topic_score_gemma":0.00015189614,"teacher_disagreement_score":0.5150042,"about_ca_system_score_codex":0.0003524872,"about_ca_system_score_gemma":0.0010487125,"threshold_uncertainty_score":0.9996032},"labels":[],"label_agreement":null},{"id":"W4406655767","doi":"10.1016/b978-044488002-4/50007-5","title":"10.1016/b978-044488002-4/50007-5","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"History; Computer science","score_opus":0.014118273479009562,"score_gpt":0.216969121848539,"score_spread":0.20285084836952944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406655767","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.939291e-8,0.00035305717,0.00051052484,0.00029079494,0.000006444792,0.0005046252,0.000041217987,0.00047500248,0.9978183],"genre_scores_gemma":[4.2432342e-7,0.0000015025772,0.0024485546,0.0000695793,0.00022976706,0.000031147094,0.00002220385,0.00010977425,0.99708706],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968448,0.000058583228,0.0004115053,0.001076219,0.0008742429,0.0007346158],"domain_scores_gemma":[0.997,0.00022138463,0.00012576544,0.0020240366,0.00017019993,0.00045861286],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00037725523,0.0005522828,0.0005465574,0.0006261727,0.00017427863,0.00020725398,0.0026875203,0.00032850818,0.99147755],"category_scores_gemma":[0.00003965883,0.0005704373,0.000257158,0.00021173959,0.00016638491,0.0003617596,0.0008851427,0.00073715346,0.9977291],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000521954,0.000018647741,1.4957391e-9,0.000012333544,0.00004809822,0.000088261855,0.000014960462,0.000046750403,0.000006903326,0.018577278,0.078345865,0.9027887],"study_design_scores_gemma":[0.00016230796,0.00023312347,2.1693512e-7,0.00009307646,0.0000115204775,0.000033033768,7.5893375e-8,0.00023160399,0.000023060753,0.05107184,0.9475374,0.0006027366],"about_ca_topic_score_codex":0.0000034509662,"about_ca_topic_score_gemma":1.8302633e-7,"teacher_disagreement_score":0.902186,"about_ca_system_score_codex":0.00013305053,"about_ca_system_score_gemma":0.00014532277,"threshold_uncertainty_score":0.99967474},"labels":[],"label_agreement":null},{"id":"W4406655784","doi":"10.1016/b978-044488002-4/50011-7","title":"10.1016/b978-044488002-4/50011-7","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.01465901170541322,"score_gpt":0.21668001104560536,"score_spread":0.20202099934019213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406655784","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.53075e-8,0.00032168327,0.0005871236,0.00022366212,0.0000066868515,0.0004984018,0.00004057092,0.0004690867,0.99785274],"genre_scores_gemma":[3.3423677e-7,0.0000014758315,0.0026031672,0.00006689556,0.00021953546,0.000031298474,0.000023561497,0.00010812637,0.9969456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968962,0.000057490328,0.0004060093,0.0010670212,0.0008430892,0.00073016697],"domain_scores_gemma":[0.99705374,0.00021112095,0.00012485494,0.001993147,0.00017148386,0.00044567286],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035814938,0.00054798013,0.00054041285,0.00061210984,0.0001710236,0.00019560017,0.0029388608,0.00032311954,0.99119323],"category_scores_gemma":[0.000038544364,0.00056453893,0.00025265597,0.00020840735,0.00016400129,0.00033576414,0.0008778226,0.00073155586,0.99756104],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051081075,0.000018955976,1.41407e-9,0.000011520528,0.00004769407,0.00008752365,0.000014127906,0.000041643954,0.0000072114904,0.01441798,0.078626916,0.90667534],"study_design_scores_gemma":[0.0001633528,0.00024112301,1.9194951e-7,0.00009113085,0.000011499532,0.00003437641,7.798614e-8,0.0002378714,0.000026616057,0.035050984,0.9635354,0.0006073596],"about_ca_topic_score_codex":0.0000032108271,"about_ca_topic_score_gemma":1.6119398e-7,"teacher_disagreement_score":0.90606797,"about_ca_system_score_codex":0.000127381,"about_ca_system_score_gemma":0.00014190504,"threshold_uncertainty_score":0.9996806},"labels":[],"label_agreement":null},{"id":"W4406943783","doi":"10.1016/j.tcs.2025.115091","title":"A subquadratic certification scheme for P5-free graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Certification; Scheme (mathematics); Mathematics; Programming language; Computer science; Discrete mathematics; Combinatorics; Calculus (dental); Medicine; Economics; Management","score_opus":0.021426337706722795,"score_gpt":0.31762652775782085,"score_spread":0.29620019005109804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406943783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006609997,0.000060608887,0.98475873,0.0044567017,0.00054514606,0.00059428555,0.0000028803427,0.00029540944,0.0026762232],"genre_scores_gemma":[0.549272,0.0000028296934,0.4500353,0.0005308838,0.000027706945,0.000073268064,9.178832e-7,0.000006316639,0.00005077952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700046,0.00010671051,0.0003540114,0.0010355597,0.00068776344,0.0008155113],"domain_scores_gemma":[0.9960969,0.0008721925,0.000066434244,0.0022219077,0.00051032903,0.0002322241],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024235167,0.00020469939,0.00023168615,0.00059700373,0.00075504836,0.00056553626,0.006226555,0.00006397642,0.000013859779],"category_scores_gemma":[0.00072856783,0.00017651088,0.000116560615,0.0035120584,0.0034177639,0.00088973466,0.0016795764,0.00021661684,0.000032339296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002266324,0.00006044641,0.000035381683,0.000022725726,0.000005788808,0.0000015317546,0.000103166836,0.000037207206,0.0039569857,0.962271,0.00022132268,0.033261806],"study_design_scores_gemma":[0.000269167,0.000096101205,0.00020999713,0.00002464766,0.000002531227,0.000003504276,0.0000037061845,0.35787824,0.009864462,0.6313188,0.0001991703,0.00012965527],"about_ca_topic_score_codex":0.0000010548293,"about_ca_topic_score_gemma":6.9200166e-7,"teacher_disagreement_score":0.542662,"about_ca_system_score_codex":0.00008819391,"about_ca_system_score_gemma":0.00027125175,"threshold_uncertainty_score":0.99929434},"labels":[],"label_agreement":null},{"id":"W4407134763","doi":"10.1016/j.laa.2025.01.044","title":"Subdivision and graph eigenvalues","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; European Commission","keywords":"Mathematics; Subdivision; Eigenvalues and eigenvectors; Combinatorics; Graph; Geography","score_opus":0.013491166718671309,"score_gpt":0.303899687886157,"score_spread":0.2904085211674857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407134763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0379382,0.004232141,0.9533761,0.0014464617,0.000029355544,0.00044076805,0.0000056141416,0.00014602601,0.0023853465],"genre_scores_gemma":[0.9791853,0.0013080699,0.017267525,0.0005134086,0.0000402129,0.00020483219,0.0000062906192,0.000008315314,0.001466045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993187,0.000028142682,0.000108242355,0.00030496958,0.00009368385,0.00014622422],"domain_scores_gemma":[0.99938816,0.000134895,0.000021323876,0.00031926282,0.00006460998,0.00007174032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014714897,0.00007477882,0.00008158135,0.00014206403,0.0002692854,0.000067700035,0.00029419473,0.0000368379,0.000004134234],"category_scores_gemma":[0.000025221108,0.00006706648,0.000018932506,0.0005907511,0.00007194306,0.00019696928,0.0002646052,0.000094279574,0.000018849008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014165257,0.000017535918,0.00022616381,0.000012817741,0.0000068664986,2.0886641e-7,0.00005035698,0.0000014628148,0.0008469081,0.964747,0.000077349316,0.03401191],"study_design_scores_gemma":[0.0002782922,0.000040930332,0.0060532857,0.00001980537,0.000010517007,0.0000050396493,0.00003255045,0.030342726,0.0074825105,0.9136365,0.041925557,0.00017229997],"about_ca_topic_score_codex":0.0000018544257,"about_ca_topic_score_gemma":0.0000012140179,"teacher_disagreement_score":0.9412471,"about_ca_system_score_codex":0.0000044351746,"about_ca_system_score_gemma":0.000020169131,"threshold_uncertainty_score":0.27348918},"labels":[],"label_agreement":null},{"id":"W4407258471","doi":"10.1137/23m1615218","title":"Group Connectivity in 3-Edge-Connected Signed Graphs","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Signed graph; Mathematics; Enhanced Data Rates for GSM Evolution; Group (periodic table); Discrete mathematics; Connectivity; Graph; Computer science; Telecommunications","score_opus":0.017141712302540874,"score_gpt":0.3026721765592732,"score_spread":0.28553046425673234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407258471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18597181,0.00020032392,0.80090064,0.0013202801,0.00043407246,0.0004338008,0.0000036569156,0.00014993218,0.010585499],"genre_scores_gemma":[0.9591712,0.000049315488,0.040051162,0.0002846924,0.000027217151,0.000024083574,0.000001102447,0.000022533479,0.00036873616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739766,0.0003894284,0.0006343088,0.0003963066,0.0005733582,0.0006089315],"domain_scores_gemma":[0.9973082,0.0013273667,0.00024654,0.00079071877,0.00014450212,0.00018269946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018078265,0.00027736666,0.00045557792,0.0009288681,0.00026858604,0.00033877103,0.001494392,0.000109195615,0.00003578182],"category_scores_gemma":[0.00094761833,0.00022508243,0.00020061183,0.0018755302,0.00013561812,0.0005970251,0.0003123287,0.00086236896,0.000040746305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045367004,0.00027938912,0.00029432823,0.00007093996,0.000046768113,0.00011802472,0.00060313416,0.00011671971,0.002070558,0.991887,0.00017923802,0.004288566],"study_design_scores_gemma":[0.0011105171,0.00025115313,0.0010527704,0.00038928556,0.000007873004,0.000070439,0.0002466563,0.015484002,0.0018709148,0.9790548,0.00020288817,0.0002586976],"about_ca_topic_score_codex":0.0000020988716,"about_ca_topic_score_gemma":0.00001605923,"teacher_disagreement_score":0.7731993,"about_ca_system_score_codex":0.00015665499,"about_ca_system_score_gemma":0.00010976674,"threshold_uncertainty_score":0.91785955},"labels":[],"label_agreement":null},{"id":"W4407352089","doi":"10.1017/fms.2024.68","title":"An efficient asymmetric removal lemma and its limitations","year":2025,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lemma (botany); Mathematics; Pure mathematics; Biology","score_opus":0.03500129368280316,"score_gpt":0.3117944297006516,"score_spread":0.27679313601784844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407352089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11237842,0.00054022437,0.8778199,0.00068777776,0.000089603374,0.000290572,0.0000046943824,0.00008259443,0.00810621],"genre_scores_gemma":[0.81944025,0.000020289242,0.18016909,0.000042445747,0.0000046410387,0.000011800175,7.817586e-7,0.0000068985296,0.0003038226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988537,0.000055774603,0.00027479965,0.00024689813,0.00030498943,0.00026384086],"domain_scores_gemma":[0.99834913,0.00073334837,0.0000941883,0.0005731153,0.0001716158,0.00007859847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055703905,0.00010399797,0.00018409235,0.00052386324,0.00012869037,0.00005909585,0.00070720766,0.000046298992,0.000002879156],"category_scores_gemma":[0.00058918435,0.0000946512,0.00004674924,0.0012783731,0.00006487354,0.00019728682,0.00028177633,0.00010131024,0.000010197291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026617834,0.000210216,0.000023657303,0.000091095135,0.0000135823275,0.000003884054,0.00045362292,0.00097463315,0.0013155706,0.98195857,0.00007532687,0.014877159],"study_design_scores_gemma":[0.00034384566,0.000169383,0.0002537937,0.00008104781,0.00000968597,0.00001880321,0.00048882654,0.6005497,0.012560555,0.38496748,0.0004216962,0.0001351648],"about_ca_topic_score_codex":9.160855e-7,"about_ca_topic_score_gemma":0.0000021939454,"teacher_disagreement_score":0.7070618,"about_ca_system_score_codex":0.000019864401,"about_ca_system_score_gemma":0.000055359575,"threshold_uncertainty_score":0.3859764},"labels":[],"label_agreement":null},{"id":"W4407532593","doi":"10.5802/igt.6","title":"Induced subgraphs and tree decompositions XII. Grid theorem for pinched graphs","year":2025,"lang":"en","type":"article","venue":"Innovations in Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Combinatorics; Grid; Mathematics; Tree (set theory); Discrete mathematics; Geometry","score_opus":0.022705901374081027,"score_gpt":0.3215805210370834,"score_spread":0.2988746196630024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407532593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21301794,0.0004390442,0.7755413,0.002129906,0.0006320266,0.001234812,0.000041093444,0.00031870397,0.006645148],"genre_scores_gemma":[0.95121896,0.000065278626,0.04696102,0.00085997646,0.000025400548,0.0006719529,0.000033225315,0.000023190674,0.00014096453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760455,0.00033595285,0.0005830608,0.000698232,0.00022674898,0.0005514387],"domain_scores_gemma":[0.9967312,0.00165166,0.00012398374,0.0010048944,0.00041607063,0.00007215868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001764457,0.00027211042,0.00030729582,0.0035495705,0.0005313126,0.00016955905,0.0011781025,0.00015597326,0.0000074551704],"category_scores_gemma":[0.0004514639,0.00027247457,0.00013121647,0.008521765,0.00046711438,0.00065780606,0.0003306312,0.00041831206,0.0000030462536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068824455,0.00013881948,0.0019059952,0.000025627032,0.000057131918,0.0000029551209,0.00028294412,0.000015517295,0.008018556,0.9575939,0.00020781458,0.03168188],"study_design_scores_gemma":[0.0010369257,0.00008430551,0.009208043,0.00006886598,0.000010368776,0.000006480731,0.00018030936,0.0005609652,0.0050371145,0.98309934,0.00044490182,0.0002623719],"about_ca_topic_score_codex":0.000008166893,"about_ca_topic_score_gemma":0.000058053833,"teacher_disagreement_score":0.7382011,"about_ca_system_score_codex":0.000055186778,"about_ca_system_score_gemma":0.00013950885,"threshold_uncertainty_score":0.99997276},"labels":[],"label_agreement":null},{"id":"W4407952367","doi":"10.2140/involve.2025.18.261","title":"Every graph with maximum degree at most fouris (11,219)-packing edge-colorable and (12,217)-packing edge-colorable","year":2025,"lang":"en","type":"article","venue":"Involve a Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Degree (music); Computer science; Artificial intelligence; Physics","score_opus":0.03833087084889889,"score_gpt":0.27829352487017445,"score_spread":0.23996265402127556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407952367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.337976,0.004284131,0.6525752,0.0013897008,0.00052670715,0.0006314515,0.0000064701153,0.000111872054,0.0024984486],"genre_scores_gemma":[0.36771142,0.0016535276,0.6239642,0.001142161,0.00028340743,0.000060978076,0.0000030969948,0.0001599578,0.0050212955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629986,0.00021119998,0.0010391591,0.0004947215,0.0010700917,0.0008849807],"domain_scores_gemma":[0.99533874,0.0015561803,0.00094591914,0.00095713336,0.0008662351,0.00033578573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024185365,0.00045363247,0.000858607,0.0009772229,0.000604586,0.00050190924,0.0017448256,0.00018559967,0.000024391058],"category_scores_gemma":[0.0006496248,0.00035829408,0.00020579895,0.0016727815,0.00031064756,0.0015472842,0.00095460075,0.0007605797,0.000016643045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035604725,0.008695256,0.14008905,0.014012926,0.008064627,0.009487965,0.06517401,0.022379342,0.06258917,0.39800793,0.13193683,0.1360024],"study_design_scores_gemma":[0.004112549,0.0014200336,0.0007255528,0.0041804635,0.0002725579,0.0018062372,0.0023493487,0.01997423,0.02105761,0.9340689,0.008906446,0.001126029],"about_ca_topic_score_codex":0.000017575345,"about_ca_topic_score_gemma":0.00019370328,"teacher_disagreement_score":0.536061,"about_ca_system_score_codex":0.0004294552,"about_ca_system_score_gemma":0.00045040346,"threshold_uncertainty_score":0.99988693},"labels":[],"label_agreement":null},{"id":"W4407955310","doi":"10.1016/j.ejc.2025.104139","title":"Injective edge colorings of degenerate graphs and the oriented chromatic number","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Chromatic scale; Combinatorics; Injective function; Degenerate energy levels; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Physics","score_opus":0.008913040825824276,"score_gpt":0.25554163910575695,"score_spread":0.24662859827993266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407955310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83032763,0.0013332738,0.14118004,0.0008821482,0.0007554458,0.00020918078,8.267897e-7,0.000028010434,0.025283456],"genre_scores_gemma":[0.9979866,0.00014090909,0.0014321915,0.00007579339,0.000007856326,0.0000010180851,6.534467e-8,0.00000905218,0.00034649073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979508,0.0009825936,0.00044885033,0.00012949122,0.00031806732,0.00017019824],"domain_scores_gemma":[0.9981766,0.00050718954,0.00037727066,0.00031338743,0.0005516264,0.000073936055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023778428,0.00010941796,0.00026410725,0.00019811702,0.00014327894,0.000058683323,0.00090600335,0.000013800326,0.000002573997],"category_scores_gemma":[0.00041207383,0.00007272435,0.00009207747,0.0012228544,0.00033449265,0.00027658461,0.00037805765,0.00032892355,0.0000041307485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091738846,0.000059321836,0.0018217551,0.000022990956,0.00007250471,0.000044180848,0.0006677005,0.000023223223,0.00023329163,0.9953012,0.00030720382,0.0013548859],"study_design_scores_gemma":[0.008413475,0.0007271783,0.017229822,0.0003069718,0.00006776194,0.00022965838,0.00033236356,0.0013971948,0.008673759,0.9562237,0.0061471737,0.0002509219],"about_ca_topic_score_codex":0.0000029311698,"about_ca_topic_score_gemma":5.465883e-7,"teacher_disagreement_score":0.167659,"about_ca_system_score_codex":0.0000424347,"about_ca_system_score_gemma":0.00013049676,"threshold_uncertainty_score":0.29656133},"labels":[],"label_agreement":null},{"id":"W4408128244","doi":"10.1007/978-981-96-1090-7_41","title":"Approximately Covering Vertices by Order-5 or Longer Paths","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Order (exchange); Algorithm","score_opus":0.020373389558708023,"score_gpt":0.28294204550124963,"score_spread":0.2625686559425416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408128244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049310966,0.00106013,0.98991233,0.00046602156,0.0012443253,0.0005492208,0.000016135304,0.00027129697,0.0064312317],"genre_scores_gemma":[0.028984638,0.00042624204,0.9569091,0.003349146,0.00037602748,0.000067271816,0.000017033137,0.00010618859,0.009764353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946306,0.000067437206,0.00057524367,0.0021544183,0.0014406862,0.0011316478],"domain_scores_gemma":[0.9958839,0.0012244143,0.00023451987,0.002018798,0.00039610363,0.00024230119],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010660777,0.0006723157,0.00066467444,0.0010226594,0.00039651385,0.0008955987,0.006047361,0.00035426443,0.000058184538],"category_scores_gemma":[0.00038306453,0.0005557625,0.0001239286,0.0017457433,0.0010192578,0.0011401922,0.0032142426,0.001170008,0.000057936282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051175637,0.000058976624,0.000031749896,0.00017538646,0.00002842471,0.00023487909,0.0005795584,0.008862887,0.0005345387,0.049433757,0.0002344827,0.93977416],"study_design_scores_gemma":[0.0007125303,0.00044684584,0.000019484998,0.0011006847,0.000014624864,0.00009032071,6.7676945e-7,0.5878831,0.008377039,0.38499355,0.014721529,0.0016396],"about_ca_topic_score_codex":0.000015734528,"about_ca_topic_score_gemma":0.000048671365,"teacher_disagreement_score":0.9381346,"about_ca_system_score_codex":0.00035040092,"about_ca_system_score_gemma":0.0010067851,"threshold_uncertainty_score":0.9996894},"labels":[],"label_agreement":null},{"id":"W4408140300","doi":"10.1016/j.tcs.2025.115160","title":"On 1-planar graphs with bounded cop-number","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Planar graph; Mathematics; Combinatorics; Planar; Discrete mathematics; 1-planar graph; Outerplanar graph; Pathwidth; Chordal graph; Graph; Computer science; Line graph; Mathematical analysis","score_opus":0.008572124148925313,"score_gpt":0.28842919260586986,"score_spread":0.2798570684569445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408140300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032252137,0.000010703321,0.9218639,0.0015953145,0.00036453825,0.0002505953,0.0000013551827,0.00030700213,0.043354433],"genre_scores_gemma":[0.86134547,0.000002821683,0.1367131,0.0017904381,0.000019498942,0.000016215326,5.237159e-7,0.000008475934,0.000103434795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964001,0.00018465714,0.0002404031,0.001110937,0.0011382484,0.0009256426],"domain_scores_gemma":[0.99701554,0.00076817116,0.000050414023,0.0015669055,0.00028742797,0.0003115343],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001460445,0.0002614143,0.00026121907,0.00045738977,0.0007582007,0.00062320527,0.0040565995,0.000058474605,0.00006252657],"category_scores_gemma":[0.0001119573,0.00018827064,0.00006726351,0.0040910244,0.0059089884,0.0006589043,0.0007522898,0.00041544306,0.0002274045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006726441,0.00008263303,0.0001522897,0.0000073458623,0.0000094209945,0.000036821537,0.000086749555,0.00008678353,0.00015247433,0.9871163,0.00018475235,0.0120171895],"study_design_scores_gemma":[0.00043448768,0.00032956904,0.0006328586,0.00007093325,0.0000034525297,0.000034328885,0.0000039687297,0.04849423,0.003360607,0.9461269,0.00026785923,0.0002408123],"about_ca_topic_score_codex":0.000002479397,"about_ca_topic_score_gemma":0.0000011554504,"teacher_disagreement_score":0.82909334,"about_ca_system_score_codex":0.00009523399,"about_ca_system_score_gemma":0.00029704405,"threshold_uncertainty_score":0.99679637},"labels":[],"label_agreement":null},{"id":"W4408225562","doi":"10.1016/j.dam.2025.02.024","title":"An introduction to the deduction number","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Calculus (dental); Combinatorics; Arithmetic","score_opus":0.011608572319302658,"score_gpt":0.3122440572055866,"score_spread":0.30063548488628394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408225562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007223674,0.000005755829,0.97226465,0.008096784,0.00026094614,0.00045980484,0.0000010838113,0.00017619877,0.011511093],"genre_scores_gemma":[0.50380725,0.000005079455,0.49373654,0.0005830873,0.00039921934,0.0002764183,0.0000066461766,0.000020777663,0.0011649883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988847,0.00003242812,0.00020371836,0.00035718316,0.00026542423,0.0002565784],"domain_scores_gemma":[0.99842954,0.000078996025,0.000050013074,0.0013048137,0.000068126006,0.00006852797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005619821,0.00012196726,0.00012505932,0.000094462375,0.00024127009,0.0001831152,0.001031642,0.00003923384,0.00002436691],"category_scores_gemma":[0.000058415855,0.000085243824,0.000035598656,0.000937345,0.000061074614,0.00023505553,0.00023518442,0.00015980881,0.00023754613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061892965,0.0000436321,0.0000037777945,0.000020649719,0.0000111005465,2.5725572e-7,0.00088228896,0.0005654749,0.0056559867,0.9767451,0.004514268,0.011551225],"study_design_scores_gemma":[0.00016936807,0.000030953062,0.00008524101,0.000012110503,0.000013413653,0.000010649817,0.0011387832,0.017065035,0.02246932,0.93153346,0.027256168,0.00021549322],"about_ca_topic_score_codex":0.0000012583472,"about_ca_topic_score_gemma":0.0000025112035,"teacher_disagreement_score":0.49658358,"about_ca_system_score_codex":0.00004377839,"about_ca_system_score_gemma":0.00003121201,"threshold_uncertainty_score":0.34761423},"labels":[],"label_agreement":null},{"id":"W4408310889","doi":"10.1007/s13398-025-01715-2","title":"Covering a space with a small number of countably tight subspaces","year":2025,"lang":"es","type":"article","venue":"Revista de la Real Academia de Ciencias Exactas Físicas y Naturales Serie A Matemáticas","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Linear subspace; Space (punctuation); Mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.011861935661993697,"score_gpt":0.3129017105011057,"score_spread":0.30103977483911204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408310889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9427345,0.0068294485,0.01988005,0.0023767152,0.00013073444,0.0012550566,0.0001174577,0.00037930344,0.026296755],"genre_scores_gemma":[0.9617245,0.008114519,0.02751236,0.00044034046,0.00011326475,0.00008964257,0.0000116592455,0.000096667995,0.0018970395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99234396,0.0015065548,0.0011316182,0.0015898369,0.0012919543,0.0021360836],"domain_scores_gemma":[0.99301165,0.003234977,0.00083160994,0.0015859063,0.0006614275,0.00067442365],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0034479941,0.0009679714,0.0014690306,0.00058524654,0.00048747097,0.0013049622,0.0032490625,0.001445181,0.00007319119],"category_scores_gemma":[0.0010887772,0.00083204836,0.00035327233,0.0044479123,0.002064793,0.001311748,0.0013085401,0.0038275244,0.000050751212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088148157,0.00022364888,0.048181687,0.0027553842,0.0003482847,0.00067547866,0.0014973991,0.00013092151,0.024398413,0.9165844,0.00077649584,0.0035464268],"study_design_scores_gemma":[0.010406723,0.002173102,0.20044401,0.0329031,0.0024719671,0.008635153,0.0036492322,0.038007475,0.16224353,0.07879859,0.4513138,0.008953318],"about_ca_topic_score_codex":0.00026223107,"about_ca_topic_score_gemma":0.000020366257,"teacher_disagreement_score":0.8377858,"about_ca_system_score_codex":0.0012628072,"about_ca_system_score_gemma":0.0021522886,"threshold_uncertainty_score":0.99985117},"labels":[],"label_agreement":null},{"id":"W4408397455","doi":"10.1007/s00373-025-02901-0","title":"Veto Interval Graphs and Variations","year":2025,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Mathematical Sciences","keywords":"Mathematics; Combinatorics; Interval (graph theory); Veto; Discrete mathematics; Interval graph; Indifference graph; Chordal graph; Graph; 1-planar graph","score_opus":0.01242007600694425,"score_gpt":0.27290333408641954,"score_spread":0.2604832580794753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408397455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41515946,0.006916482,0.5555855,0.0037184712,0.0021788236,0.00070686714,0.000012737163,0.00071870507,0.015002976],"genre_scores_gemma":[0.99673444,0.0004329164,0.0021462243,0.00020944765,0.0000021604742,0.000024627576,0.0000012188796,0.000005714093,0.00044326682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998989,0.000071691684,0.00015776377,0.00035528478,0.00016952069,0.0002567467],"domain_scores_gemma":[0.9991727,0.0001776242,0.000036698122,0.00040133332,0.000104253144,0.00010741881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029437814,0.00012613814,0.00015356313,0.00038051975,0.00029887774,0.0001841644,0.0004422123,0.00006152984,0.000002194229],"category_scores_gemma":[0.00005407557,0.00012050778,0.000047719765,0.0014003033,0.00013243359,0.00030932514,0.00045120064,0.00019440624,0.0000020547864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004391632,0.000046877474,0.005398254,0.000018125193,0.000021734118,0.0000046909636,0.00017485762,7.36708e-7,0.000050683688,0.98212564,0.0003062666,0.011847737],"study_design_scores_gemma":[0.0003961071,0.00008447452,0.011730096,0.00001868055,0.000007262801,0.0000059380013,0.0000414899,0.0019939402,0.000100223464,0.9834587,0.0020441287,0.00011894367],"about_ca_topic_score_codex":0.0000111325535,"about_ca_topic_score_gemma":0.0000028491534,"teacher_disagreement_score":0.581575,"about_ca_system_score_codex":0.000014548569,"about_ca_system_score_gemma":0.000036053883,"threshold_uncertainty_score":0.49141648},"labels":[],"label_agreement":null},{"id":"W4408462275","doi":"10.4153/s0008439525000281","title":"Bridging colorings of virtual links from virtual biquandles to biquandles","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bridging (networking); Computer science","score_opus":0.015082052390838254,"score_gpt":0.26430660656537636,"score_spread":0.2492245541745381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408462275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2402415,0.00007106804,0.7275083,0.01205672,0.00013995389,0.00046218705,0.000054874592,0.00012159179,0.019343814],"genre_scores_gemma":[0.9744267,0.000007247708,0.021592196,0.0015464444,0.000035919224,0.000052421165,0.0000039522383,0.000019782521,0.002315366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979685,0.00011674896,0.00044131442,0.0005044485,0.00034455047,0.0006244384],"domain_scores_gemma":[0.997394,0.000975597,0.000060680195,0.00074761367,0.00014118817,0.0006809203],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005548416,0.0002086054,0.00039687485,0.0006053255,0.00016071874,0.00013406995,0.0013702136,0.00018118364,0.00081224163],"category_scores_gemma":[0.0010494842,0.00020431519,0.0001031491,0.0008079043,0.00019526733,0.00008431501,0.00034807378,0.00039525155,0.0017774454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019580784,0.000040193965,0.00009257256,0.00004151365,0.000036166537,0.000033084583,0.00045471132,0.00010105389,0.00104027,0.97762305,0.0023528766,0.018164923],"study_design_scores_gemma":[0.002040694,0.0010924771,0.0021453488,0.0030081475,0.000062650375,0.000022051994,0.0013134845,0.025869194,0.045145147,0.71909696,0.19850074,0.0017031223],"about_ca_topic_score_codex":0.0016370846,"about_ca_topic_score_gemma":0.001084438,"teacher_disagreement_score":0.73418516,"about_ca_system_score_codex":0.00015769289,"about_ca_system_score_gemma":0.00041107062,"threshold_uncertainty_score":0.9989998},"labels":[],"label_agreement":null},{"id":"W4408492470","doi":"10.37236/13018","title":"A Note on the Invertibility of Oriented Graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Computer science","score_opus":0.010311144251661103,"score_gpt":0.28411038253773035,"score_spread":0.2737992382860692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408492470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45461938,0.0019734534,0.5298948,0.010354323,0.0007242132,0.00033151137,6.583648e-7,0.000027067434,0.0020745802],"genre_scores_gemma":[0.9993074,0.00022082725,0.000043889064,0.00025456704,0.000008833737,0.0000025995164,5.6748952e-8,0.000005097824,0.00015671091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783593,0.00053390686,0.0004178205,0.00013974984,0.00061920413,0.00045336367],"domain_scores_gemma":[0.9968973,0.0013644678,0.00032489482,0.0008728468,0.0004958377,0.000044676308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003569069,0.00011784206,0.0002257941,0.00021463982,0.00018933904,0.000028547038,0.0023878454,0.000042659583,0.0000034178627],"category_scores_gemma":[0.0006873769,0.00006120813,0.00017499823,0.0020987573,0.0002149157,0.00016843487,0.00023087102,0.0010523734,0.0000023831083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095296076,0.00013216767,0.00020200653,0.0000067867386,0.000056885543,0.0000018133973,0.00019483252,0.000057693065,0.00054523436,0.99714345,0.0001914352,0.0013724159],"study_design_scores_gemma":[0.00043949307,0.00054732256,0.0003977329,0.0000348481,0.000012656253,0.000011935281,0.000039648265,0.000879953,0.013824406,0.982383,0.0013773746,0.00005161031],"about_ca_topic_score_codex":0.0000035134606,"about_ca_topic_score_gemma":0.0000030544256,"teacher_disagreement_score":0.54468805,"about_ca_system_score_codex":0.00023424285,"about_ca_system_score_gemma":0.0007125319,"threshold_uncertainty_score":0.45720974},"labels":[],"label_agreement":null},{"id":"W4408731436","doi":"10.61091/um122-06","title":"Dominator colorings of \\(n\\)-inordinate invariant intersection graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Combinatorics; Intersection (aeronautics); Discrete mathematics; Geography; Cartography","score_opus":0.015360826354190924,"score_gpt":0.291601772188336,"score_spread":0.27624094583414505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19468985,0.00020235249,0.7114317,0.00080023875,0.0003030019,0.00072000426,0.0000057513353,0.00026705413,0.09158007],"genre_scores_gemma":[0.97156066,0.000005501857,0.027507706,0.000047503214,0.0000025938516,0.00005619887,4.907123e-7,0.0000070629985,0.000812303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863684,0.00010862518,0.00037812925,0.0003323887,0.00025695324,0.000287053],"domain_scores_gemma":[0.998475,0.00040877928,0.00010549239,0.00079840876,0.0001474655,0.000064854656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081757,0.00013762247,0.00027696657,0.0004385429,0.00009191613,0.000043132113,0.0009472125,0.000058515365,0.000048802198],"category_scores_gemma":[0.0004181455,0.00012164629,0.00011972691,0.0010807044,0.00019453453,0.00033625762,0.0004782979,0.00016109963,0.000036627476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025954778,0.00010456495,0.000060044997,0.00021773657,0.000040675128,0.0000060216566,0.0004875874,0.0000018882738,0.0022395886,0.9928355,0.0001959288,0.0037844905],"study_design_scores_gemma":[0.00032779877,0.0000946643,0.00040376835,0.00017417187,0.000011082697,0.000009912356,0.00026243195,0.0061184713,0.023163434,0.9688581,0.000470255,0.0001058598],"about_ca_topic_score_codex":0.000006594192,"about_ca_topic_score_gemma":0.0000024069582,"teacher_disagreement_score":0.7768708,"about_ca_system_score_codex":0.000054354576,"about_ca_system_score_gemma":0.00006425118,"threshold_uncertainty_score":0.49605918},"labels":[],"label_agreement":null},{"id":"W4408731651","doi":"10.61091/um122-02","title":"On 1-11-representability and multi-1-11-representability of graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.030053615606383734,"score_gpt":0.3417294456927507,"score_spread":0.31167583008636696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7209649,0.0002235077,0.27050695,0.00086998404,0.00014902251,0.0011661839,0.000026746658,0.00022949305,0.0058631715],"genre_scores_gemma":[0.9562121,0.000009760367,0.04326519,0.00006837128,0.0000039801516,0.00007530366,0.0000015808804,0.000011335956,0.00035239608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695027,0.0004205016,0.0006634362,0.00092972105,0.0005478761,0.00048818107],"domain_scores_gemma":[0.9945346,0.0022810292,0.00012945294,0.002676529,0.00020823338,0.00017014709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017074572,0.00027068506,0.0005301573,0.0003292835,0.00017229308,0.00006517024,0.0012932548,0.000104362516,0.00010196454],"category_scores_gemma":[0.002283115,0.00023105474,0.00018757906,0.0010307224,0.0008566164,0.00035579316,0.0011005448,0.00021080168,0.000019362895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000395923,0.00089752785,0.013513942,0.0004983808,0.00004415061,0.000003532346,0.0007126748,0.000009193338,0.0009602937,0.977319,0.00028817105,0.005713539],"study_design_scores_gemma":[0.00075032265,0.000084493055,0.017823793,0.00013136205,0.000016836819,0.000004549419,0.0002811833,0.023951288,0.013133562,0.94344854,0.00016142291,0.00021262796],"about_ca_topic_score_codex":0.000054413053,"about_ca_topic_score_gemma":0.00003843315,"teacher_disagreement_score":0.23524715,"about_ca_system_score_codex":0.000051418065,"about_ca_system_score_gemma":0.00007677687,"threshold_uncertainty_score":0.9422139},"labels":[],"label_agreement":null},{"id":"W4408736815","doi":"10.61091/ars162-07","title":"On total coloring of 1-planar graphs without 4-cycles","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Total coloring; Planar graph; Combinatorics; Edge coloring; Planar; Graph; Computer science; Graph power; Computer graphics (images); Line graph","score_opus":0.013061476965901698,"score_gpt":0.2873518288260597,"score_spread":0.274290351860158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813945,0.00011639024,0.0058350083,0.00021958296,0.0012888749,0.00021860085,0.0000022168588,0.00013771554,0.010787091],"genre_scores_gemma":[0.9971984,0.00000933814,0.0023296196,0.00006428503,0.000001433394,0.000019164238,8.16622e-7,0.000007634946,0.00036927674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987208,0.000106129824,0.00020978453,0.00033698883,0.00032592926,0.00030035785],"domain_scores_gemma":[0.9986855,0.00038991502,0.00006891023,0.0006830082,0.000103416,0.00006927206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034581622,0.00012933649,0.00022236168,0.00032302432,0.00012089145,0.000040580708,0.000897348,0.000056178946,0.000004939163],"category_scores_gemma":[0.00013659202,0.00012568387,0.00007462473,0.00093347026,0.00012181288,0.00022822898,0.00021129397,0.00020130137,0.000018461027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037683436,0.00009302616,0.0043769307,0.000018857305,0.000028582468,0.000007788408,0.00009063863,0.000042960186,0.0014061446,0.9914233,0.0002670192,0.0022070778],"study_design_scores_gemma":[0.0005996317,0.00016942754,0.007240637,0.00006537457,0.0000034770483,0.0000020038578,0.000020435991,0.00065507105,0.013773989,0.9772626,0.000098327815,0.00010898234],"about_ca_topic_score_codex":0.0000134347165,"about_ca_topic_score_gemma":0.0000018653723,"teacher_disagreement_score":0.015803913,"about_ca_system_score_codex":0.000042024254,"about_ca_system_score_gemma":0.00006944129,"threshold_uncertainty_score":0.51252395},"labels":[],"label_agreement":null},{"id":"W4408841349","doi":"10.1017/fms.2025.22","title":"Tree-like graphings, wallings, and median graphings of equivalence relations","year":2025,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Equivalence (formal languages); Tree (set theory); Combinatorics; Pure mathematics","score_opus":0.012800867163832417,"score_gpt":0.27316420019931176,"score_spread":0.2603633330354793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408841349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07274128,0.0007567172,0.91941017,0.0020007063,0.00014631599,0.0003764444,0.000010810895,0.00009872021,0.004458856],"genre_scores_gemma":[0.80085844,0.00016217158,0.19836248,0.000058518774,0.0000045475967,0.000017058617,0.0000016803427,0.000012204596,0.00052289944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831253,0.00004735299,0.0005476315,0.00031239967,0.00044432713,0.00033576382],"domain_scores_gemma":[0.99784935,0.00084062625,0.00028647383,0.00073601695,0.00019692995,0.000090636095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078957196,0.00016148253,0.00034654376,0.0006527688,0.00013559192,0.00003489,0.001041005,0.00008733452,0.000010917229],"category_scores_gemma":[0.00039512315,0.00014903049,0.00011907996,0.0012666361,0.00040093617,0.00043348584,0.00048576205,0.0001924883,0.0000027223423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005613243,0.00011841498,0.0019524852,0.00033798287,0.000044155186,0.0000020011846,0.0016533937,0.000027106777,0.0037985428,0.98707473,0.00040530667,0.004580254],"study_design_scores_gemma":[0.00033098226,0.00010091817,0.00038455363,0.00037291078,0.00001814962,0.000005107312,0.0005523266,0.02480013,0.008712457,0.9643554,0.00022713073,0.00013992167],"about_ca_topic_score_codex":0.000014621476,"about_ca_topic_score_gemma":0.00002325185,"teacher_disagreement_score":0.72811717,"about_ca_system_score_codex":0.000012580921,"about_ca_system_score_gemma":0.00006270859,"threshold_uncertainty_score":0.60772866},"labels":[],"label_agreement":null},{"id":"W4408892500","doi":"10.61091/jcmcc125-15","title":"The number of total dominating sets in binary trees","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Binary number; Mathematics; Combinatorics; Arithmetic","score_opus":0.01208407633317526,"score_gpt":0.30680075736877366,"score_spread":0.2947166810355984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408892500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97152275,0.0005365427,0.016904408,0.00036541017,0.008581463,0.00026347736,6.0886475e-7,0.000022970758,0.0018023821],"genre_scores_gemma":[0.98878175,0.000046116293,0.010984565,0.000008823011,0.00014656704,0.0000022732956,1.2831866e-7,0.0000126933555,0.000017097242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970553,0.00028630212,0.0013433862,0.00021849676,0.0006943364,0.00040219844],"domain_scores_gemma":[0.9945481,0.0034405203,0.0009290779,0.0004169882,0.00056854,0.000096814714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037385724,0.00022310525,0.00065539795,0.00030564744,0.00033310504,0.00023536013,0.0011278571,0.00011606277,0.0000013367242],"category_scores_gemma":[0.0012036003,0.00016793645,0.00017142559,0.001071268,0.0002007966,0.00036692078,0.0008064501,0.0006144206,8.3059615e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079483056,0.0003055491,0.0013616853,0.0000973804,0.000056253106,0.000023504525,0.00074521283,0.000087017346,0.000641265,0.98870116,0.00004637651,0.007855111],"study_design_scores_gemma":[0.0031407794,0.00025260204,0.0011424907,0.0005603973,0.000016854538,0.0000710805,0.00042621588,0.024026211,0.0013046283,0.9688104,0.000085830005,0.00016251623],"about_ca_topic_score_codex":0.000006508953,"about_ca_topic_score_gemma":6.085563e-7,"teacher_disagreement_score":0.023939194,"about_ca_system_score_codex":0.00009071837,"about_ca_system_score_gemma":0.00023508372,"threshold_uncertainty_score":0.684825},"labels":[],"label_agreement":null},{"id":"W4408892509","doi":"10.61091/jcmcc125-05","title":"The vertex-edge locating Roman domination of some graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Graph; Artificial intelligence","score_opus":0.011720877262077364,"score_gpt":0.2826358369886785,"score_spread":0.2709149597266011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408892509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7630462,0.0029180706,0.19796008,0.001024579,0.03188324,0.000729424,0.0000012429157,0.000085196414,0.0023519315],"genre_scores_gemma":[0.99210674,0.00009109136,0.0075591174,0.000019217941,0.00019220024,0.0000024268206,2.2322567e-7,0.000014557568,0.00001444811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970182,0.00025514708,0.0013016567,0.00022948437,0.00081309245,0.00038238123],"domain_scores_gemma":[0.9940664,0.0030707174,0.0012325136,0.00051462365,0.000995585,0.00012012615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038626564,0.00023301721,0.00060898246,0.00038432592,0.0006333098,0.0003292187,0.0015914775,0.000118156364,6.092643e-7],"category_scores_gemma":[0.0014634256,0.00017578977,0.00020790944,0.00095718243,0.00024321004,0.0005314025,0.00067197194,0.000536703,7.5187296e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051361272,0.00021101326,0.0000789515,0.00013065612,0.000092826405,0.0000056496724,0.0005389606,0.00002928897,0.00093698886,0.9871735,0.00011998272,0.010630813],"study_design_scores_gemma":[0.0023158889,0.00038746351,0.00013349367,0.00039432826,0.00003259796,0.000022563925,0.00024124369,0.016504236,0.0033844623,0.9761131,0.00032181072,0.00014884726],"about_ca_topic_score_codex":0.0000037627267,"about_ca_topic_score_gemma":2.6457633e-7,"teacher_disagreement_score":0.22906049,"about_ca_system_score_codex":0.00008469092,"about_ca_system_score_gemma":0.00024911194,"threshold_uncertainty_score":0.71684986},"labels":[],"label_agreement":null},{"id":"W4408961034","doi":"10.1016/j.comgeo.2025.102192","title":"Bounds on the edge-length ratio of 2-outerplanar graphs","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Ministero dell'Università e della Ricerca; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Outerplanar graph; Pathwidth; Computer science; Graph; Telecommunications; Line graph","score_opus":0.017873185146532328,"score_gpt":0.29802974953785755,"score_spread":0.2801565643913252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408961034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060958546,0.00021756401,0.9293683,0.0036399374,0.00035093472,0.00020645808,0.0000109269295,0.000072681294,0.0051746494],"genre_scores_gemma":[0.98361087,0.0000064628443,0.01473485,0.0010777632,0.000020705571,0.000017695855,0.000009800045,0.000005592211,0.0005162371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985968,0.00014140438,0.00024935437,0.00030315938,0.0004937584,0.00021551446],"domain_scores_gemma":[0.99732083,0.0018082923,0.000083788604,0.0005045273,0.00023698292,0.000045571916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005397962,0.000118229706,0.00014706349,0.00062198244,0.00020673324,0.000088250665,0.0011475483,0.00004161217,0.000029471672],"category_scores_gemma":[0.00022620706,0.00008876863,0.00009337062,0.0023051617,0.00020235345,0.00018391825,0.00024004703,0.00021129573,0.000047555375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014383862,0.00006303303,0.00079203723,0.000013658442,0.000042505537,0.0000024733886,0.000114172144,0.013477266,0.00006255554,0.974283,0.002314137,0.0088208085],"study_design_scores_gemma":[0.00028205884,0.00009136728,0.01641162,0.00004030289,0.0000038016194,0.000003465349,0.000049972616,0.0638394,0.0010057401,0.9163829,0.0017748916,0.00011449281],"about_ca_topic_score_codex":0.0000023089506,"about_ca_topic_score_gemma":5.703401e-7,"teacher_disagreement_score":0.92265236,"about_ca_system_score_codex":0.000033492248,"about_ca_system_score_gemma":0.00014953919,"threshold_uncertainty_score":0.36198798},"labels":[],"label_agreement":null},{"id":"W4409158217","doi":"10.1016/j.dam.2025.03.023","title":"Preprocessing complexity for some graph problems parameterized by structural parameters","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Preprocessor; Graph; Computational complexity theory; Combinatorics; Algorithm; Theoretical computer science; Computer science; Artificial intelligence","score_opus":0.04015370730956459,"score_gpt":0.32062872376984347,"score_spread":0.2804750164602789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409158217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046968684,0.00013244106,0.9494027,0.00027795936,0.00009928153,0.0016152336,0.00003892283,0.00031220657,0.001152583],"genre_scores_gemma":[0.28988996,0.000008293496,0.7090061,0.00023101305,0.000010129656,0.0006258675,0.00003452673,0.000029088673,0.00016505564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977267,0.000034224224,0.0005396134,0.0006895305,0.0003653873,0.0006445836],"domain_scores_gemma":[0.9979568,0.0005686521,0.00023789276,0.0010394767,0.000079686695,0.00011749966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005206102,0.00031745996,0.0004810557,0.00018741927,0.0003703207,0.00038163166,0.0014508724,0.000083162864,0.000003851791],"category_scores_gemma":[0.00012046986,0.00027131347,0.00015610164,0.00065120956,0.00037608188,0.0004376353,0.00042056286,0.00021835408,0.0000063885595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034026354,0.000049926555,0.0000069239054,0.0007318341,0.00007517327,5.452214e-7,0.0006338074,0.00021803284,0.019111134,0.97320634,0.00025433188,0.005677926],"study_design_scores_gemma":[0.000734645,0.000037797527,0.000007756029,0.0000700193,0.00001897618,0.000002257606,0.00013391036,0.06618437,0.02108871,0.9112921,0.00015050909,0.00027899342],"about_ca_topic_score_codex":0.000002506442,"about_ca_topic_score_gemma":0.0000010403096,"teacher_disagreement_score":0.24292128,"about_ca_system_score_codex":0.00005137298,"about_ca_system_score_gemma":0.000059131893,"threshold_uncertainty_score":0.9999739},"labels":[],"label_agreement":null},{"id":"W4409252201","doi":"10.1016/j.tcs.2025.115234","title":"Vertex-critical graphs in co-gem-free graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Chordal graph; Mathematics; Graph; Computer science; Discrete mathematics","score_opus":0.01258889013089405,"score_gpt":0.3244643890253385,"score_spread":0.31187549889444444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409252201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024514195,0.00012213338,0.94975,0.0038410323,0.0009718673,0.00032984966,0.0000038720914,0.0003283032,0.020138713],"genre_scores_gemma":[0.90728134,0.000013783367,0.09135029,0.0012752648,0.000016463773,0.000027213215,6.1892655e-7,0.0000103390175,0.000024683073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949081,0.00039556628,0.00050925545,0.0014520533,0.0012664997,0.001468526],"domain_scores_gemma":[0.99487394,0.0018126417,0.00004003239,0.0025361252,0.00030369952,0.00043358974],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033081265,0.0003188962,0.0003984111,0.001540739,0.0005675973,0.0006039664,0.008814519,0.000112844886,0.000048506132],"category_scores_gemma":[0.0012378645,0.0002853776,0.00014192048,0.0070123854,0.009845346,0.0012567593,0.0032063636,0.0006921059,0.00009195327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027135166,0.00014140707,0.0005730522,0.000018124814,0.0000043910777,0.00006369677,0.00015138477,0.000046545872,0.0005124043,0.97494596,0.00019994503,0.02331594],"study_design_scores_gemma":[0.0005205396,0.00015499731,0.0025129684,0.00007809514,0.000002629457,0.000020745922,0.000009142689,0.11708089,0.0031098847,0.87612003,0.000115750474,0.00027434077],"about_ca_topic_score_codex":0.000005672186,"about_ca_topic_score_gemma":0.0000033074969,"teacher_disagreement_score":0.88276714,"about_ca_system_score_codex":0.00012643219,"about_ca_system_score_gemma":0.00033870025,"threshold_uncertainty_score":0.9999598},"labels":[],"label_agreement":null},{"id":"W4409898124","doi":"10.1142/s0129054125500054","title":"Efficiently Enumerating Spanning Trees of <i>k</i> -Trees","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Bangladesh University of Engineering and Technology","keywords":"Spanning tree; Combinatorics; Mathematics; Minimum degree spanning tree; Weight-balanced tree; Tree (set theory); Discrete mathematics; Trémaux tree; Graph; Binary tree; Binary search tree; Line graph; Pathwidth","score_opus":0.017781280910574723,"score_gpt":0.3485295082599452,"score_spread":0.3307482273493705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409898124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09611526,0.00011368211,0.9004197,0.00095396757,0.0015489968,0.000058686088,0.000002031245,0.000012302046,0.0007753877],"genre_scores_gemma":[0.75025916,0.000011640022,0.24956697,0.000067768684,0.00005941514,8.444605e-7,3.638898e-7,0.0000022723882,0.00003153004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974107,0.000071488415,0.0007727151,0.00022947439,0.0013169431,0.00019863466],"domain_scores_gemma":[0.9952984,0.00049182517,0.0006938919,0.00036836282,0.003079068,0.00006848068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015935902,0.000102034566,0.00022220596,0.0015014063,0.00015753346,0.00025882284,0.004229794,0.000023263165,0.000006711785],"category_scores_gemma":[0.00042873583,0.00009236283,0.00013292811,0.0016622613,0.00066178857,0.0017647913,0.00070368533,0.0001716996,0.0000019423164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004227172,0.00032669978,0.005036994,0.000015030221,0.00013366321,0.000016298067,0.0011986736,0.077183284,0.057006367,0.5618893,0.00017930272,0.29697216],"study_design_scores_gemma":[0.0019874962,0.00069635926,0.047680993,0.0012232456,0.00002681608,0.00021073023,0.00017851162,0.6472641,0.1933834,0.1045153,0.0024511917,0.0003818225],"about_ca_topic_score_codex":0.0000070255473,"about_ca_topic_score_gemma":0.0000052198106,"teacher_disagreement_score":0.6541439,"about_ca_system_score_codex":0.000091135196,"about_ca_system_score_gemma":0.00074998004,"threshold_uncertainty_score":0.78600794},"labels":[],"label_agreement":null},{"id":"W4410061426","doi":"10.1007/978-981-96-4448-3_11","title":"Broadcasting and Three List Subtraction","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Subtraction; Telecommunications; Computer network; Arithmetic; Mathematics","score_opus":0.023856134428355102,"score_gpt":0.2866058865756826,"score_spread":0.2627497521473275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410061426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012362115,0.0007817889,0.98951083,0.000624174,0.0009825804,0.0003236572,0.0000028390862,0.00016139564,0.0074891294],"genre_scores_gemma":[0.13706227,0.00017590144,0.8586839,0.0012411586,0.00057121686,0.000018950443,0.0000046381892,0.000051021936,0.0021909368],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965821,0.000034702865,0.0003700816,0.0015459484,0.0008273347,0.00063984643],"domain_scores_gemma":[0.9971982,0.0010392905,0.00018149872,0.00117632,0.000245892,0.00015877158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010710309,0.0004079383,0.00039214315,0.0011306441,0.00040405404,0.00064817,0.0023720346,0.00024916235,0.000011589791],"category_scores_gemma":[0.00025277573,0.00039139553,0.00007766647,0.0008506757,0.00092171214,0.0008569984,0.002015052,0.0011095209,0.000011857027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005693511,0.000008940559,0.00013575652,0.000041406314,0.0000057829593,0.00005319728,0.00011911886,0.002319264,0.00014058304,0.11528125,0.0000080943555,0.88188094],"study_design_scores_gemma":[0.00016414018,0.000091983544,0.0002240985,0.0003884007,0.0000040388613,0.00007815663,8.5674074e-8,0.3612621,0.00064409466,0.63559407,0.0011334652,0.00041536088],"about_ca_topic_score_codex":0.000025827361,"about_ca_topic_score_gemma":0.00017211931,"teacher_disagreement_score":0.88146555,"about_ca_system_score_codex":0.00021916827,"about_ca_system_score_gemma":0.00040947745,"threshold_uncertainty_score":0.9998538},"labels":[],"label_agreement":null},{"id":"W4410156455","doi":"10.1145/3734525","title":"A \\(\\boldsymbol{O}(\\textbf{log}\\,\\boldsymbol{k})\\) -Approximation for <scp>Directed Steiner Tree</scp> in Planar Graphs","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Planar; Binary logarithm; Approximation algorithm; Planar graph; Discrete mathematics; Tree (set theory); Computer science; Graph","score_opus":0.02066447745728899,"score_gpt":0.29402476052985693,"score_spread":0.27336028307256793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410156455","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060089575,0.000230144,0.98770946,0.001229955,0.0006692116,0.0013992357,0.00007496138,0.00070528005,0.0019727945],"genre_scores_gemma":[0.26406243,0.00030246348,0.71939653,0.0010409938,0.00009190176,0.0028270066,0.00007692207,0.00012636719,0.0120753655],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965473,0.0002757859,0.0006324741,0.0010830789,0.00054892804,0.0009124472],"domain_scores_gemma":[0.9958778,0.0018796773,0.0001222609,0.0016521985,0.00027772915,0.00019031114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080889266,0.00043061026,0.0004949875,0.0017913735,0.00042803,0.00019126303,0.0019451571,0.00027606453,0.00001118004],"category_scores_gemma":[0.00036786863,0.00043417848,0.0002896633,0.0036991243,0.00016097206,0.000698727,0.000038642876,0.0006347444,0.000041023402],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000840327,0.00096424046,0.00011863597,0.00012296264,0.00020016299,0.000025690177,0.0012572722,0.0022693179,0.003958604,0.06424094,0.00066457345,0.9260936],"study_design_scores_gemma":[0.007734815,0.00089413085,0.0064140013,0.00040423218,0.00009998642,0.000035941157,0.00090561155,0.2815502,0.05374759,0.6362617,0.011216495,0.00073531683],"about_ca_topic_score_codex":0.000071412534,"about_ca_topic_score_gemma":0.00026475542,"teacher_disagreement_score":0.92535824,"about_ca_system_score_codex":0.00019448785,"about_ca_system_score_gemma":0.00018185207,"threshold_uncertainty_score":0.999811},"labels":[],"label_agreement":null},{"id":"W4410338800","doi":"10.37236/12822","title":"Grid Minors and Products","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Grid; Computer science; Geology; Geodesy","score_opus":0.006239289094987502,"score_gpt":0.256904653646761,"score_spread":0.2506653645517735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410338800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3767535,0.044954438,0.54085803,0.030478245,0.0026622976,0.00044962397,4.3224875e-7,0.000070793925,0.003772597],"genre_scores_gemma":[0.9978837,0.00090668636,0.00015420023,0.00010878089,0.00004448679,0.0000015306648,4.7523347e-8,0.000004551398,0.0008960172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876803,0.00016098036,0.00022174962,0.00012568494,0.00030298097,0.0004205584],"domain_scores_gemma":[0.998881,0.0002508085,0.00014441328,0.00037590947,0.00030271852,0.000045139055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015518322,0.00008960491,0.00015435209,0.0001814302,0.00015035992,0.00006881001,0.0012332839,0.000027706943,7.939512e-7],"category_scores_gemma":[0.00024428006,0.00005844075,0.000041523304,0.0010498287,0.00009777943,0.00028936003,0.00021655373,0.00062107656,0.0000017628768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018029454,0.000036308556,0.00013536369,0.000009196894,0.000035770645,0.000004891525,0.000099775876,0.000009961333,0.00032467075,0.99435467,0.00068664027,0.0042847493],"study_design_scores_gemma":[0.00038489036,0.0002541491,0.00038675542,0.000016238842,0.000010454008,0.00011767771,0.000027047992,0.00018171735,0.0052397666,0.98140174,0.011921325,0.000058256766],"about_ca_topic_score_codex":9.745493e-7,"about_ca_topic_score_gemma":6.530518e-7,"teacher_disagreement_score":0.62113017,"about_ca_system_score_codex":0.00012893513,"about_ca_system_score_gemma":0.0005418742,"threshold_uncertainty_score":0.2698303},"labels":[],"label_agreement":null},{"id":"W4410371193","doi":"10.1016/j.ejc.2025.104174","title":"Sparsity of 3-flow-critical graphs","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Mathematics; Combinatorics; Flow (mathematics); Discrete mathematics; Geometry","score_opus":0.017855904037367868,"score_gpt":0.28922014670176716,"score_spread":0.2713642426643993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410371193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039317977,0.0009807665,0.9305494,0.0010399141,0.0016526231,0.000060115293,0.0000013504692,0.00003136343,0.026366483],"genre_scores_gemma":[0.98531234,0.00007235472,0.014322798,0.0000810906,0.000017769287,1.1824443e-7,9.2589715e-8,0.0000081469525,0.00018529929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979117,0.0007245026,0.00049990736,0.00014536345,0.0004837635,0.00023476026],"domain_scores_gemma":[0.9980416,0.00044177606,0.00019919412,0.00045407814,0.0007238259,0.0001395094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021691297,0.00010443511,0.0002525493,0.00043536653,0.00009097399,0.0000520528,0.0017344381,0.000018981726,0.000006331691],"category_scores_gemma":[0.0008131667,0.0000944104,0.00016165145,0.0011617074,0.00018727391,0.00037388568,0.00042656405,0.00042963336,0.000010292659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002807396,0.00017119729,0.001383813,0.000029572228,0.000028079616,0.00025284485,0.000098706856,0.000056387787,0.00033847752,0.9887106,0.0011900987,0.007712186],"study_design_scores_gemma":[0.0011515028,0.0006159185,0.0097477585,0.00017037855,0.000019952153,0.000081010214,0.000038318827,0.0010090126,0.0033247988,0.9752457,0.008439415,0.00015623146],"about_ca_topic_score_codex":1.7854293e-7,"about_ca_topic_score_gemma":4.3411518e-8,"teacher_disagreement_score":0.9459944,"about_ca_system_score_codex":0.00003398869,"about_ca_system_score_gemma":0.00010925927,"threshold_uncertainty_score":0.38499445},"labels":[],"label_agreement":null},{"id":"W4410455285","doi":"10.1007/978-3-031-92935-9_1","title":"Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bipartite graph; Regular polygon; Computer science; Combinatorics; Set (abstract data type); Mathematics; Graph; Geometry","score_opus":0.02357357690253381,"score_gpt":0.28097834642607944,"score_spread":0.25740476952354563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410455285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029516526,0.0011987161,0.9898709,0.0010707318,0.0011544011,0.00090466376,0.000018739662,0.00030051757,0.005186139],"genre_scores_gemma":[0.48821333,0.0019121034,0.48965824,0.0117952395,0.00040577553,0.00023527877,0.00003694771,0.0002349861,0.0075080935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99434346,0.0001007446,0.00058655575,0.0024954383,0.0013688211,0.0011049776],"domain_scores_gemma":[0.99569684,0.0013226363,0.0002556083,0.0020856983,0.00030965748,0.00032955228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013877325,0.00075514376,0.00074502383,0.0026361644,0.00048232847,0.0007210525,0.003981663,0.00037960513,0.000018116052],"category_scores_gemma":[0.00017658024,0.0006722913,0.00017937062,0.0019278623,0.002134648,0.0006914442,0.0021070233,0.0014933912,0.000038865215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018651062,0.000034366927,0.00015822292,0.00012430578,0.00002679424,0.000091491354,0.00054311176,0.0061058593,0.00021167059,0.67919487,0.00011125397,0.3133794],"study_design_scores_gemma":[0.0003212649,0.0003625753,0.00009116027,0.00088311895,0.0000070920332,0.000042205764,1.9122848e-7,0.09982468,0.0010770657,0.8940686,0.0026268044,0.0006952522],"about_ca_topic_score_codex":0.000014751512,"about_ca_topic_score_gemma":0.000054126023,"teacher_disagreement_score":0.50021267,"about_ca_system_score_codex":0.00015313439,"about_ca_system_score_gemma":0.0004628234,"threshold_uncertainty_score":0.9995728},"labels":[],"label_agreement":null},{"id":"W4410590705","doi":"10.37236/13669","title":"Frozen Colourings in $2K_2$-free graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics","score_opus":0.0058383278427437645,"score_gpt":0.2613319210123492,"score_spread":0.25549359316960546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410590705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51226574,0.014502135,0.44864932,0.014948032,0.0014865808,0.00048107438,6.6105594e-7,0.00007831855,0.007588146],"genre_scores_gemma":[0.99836296,0.0006768502,0.00015639077,0.00018174078,0.000014875739,0.0000046576624,6.802047e-8,0.000008168438,0.00059426454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978804,0.0002914995,0.0004340106,0.00016257884,0.0005107993,0.00072069134],"domain_scores_gemma":[0.9981425,0.0005361537,0.00023214158,0.00077173195,0.0002548427,0.0000626309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026803806,0.00013631707,0.00026939606,0.00054849224,0.00013643688,0.00007971367,0.004135252,0.00006131817,0.0000033754523],"category_scores_gemma":[0.00036517426,0.000097978256,0.00012876219,0.0022953604,0.00010236718,0.00039124148,0.00048772444,0.001275961,0.0000039782076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049279,0.00009559617,0.00078030536,0.000006509435,0.000040587376,0.000019844927,0.00015944608,0.000087531065,0.0001696667,0.9967027,0.0005597118,0.0013288365],"study_design_scores_gemma":[0.0012716337,0.00029950976,0.0010921746,0.000037451584,0.000008171385,0.00005026327,0.00004514116,0.00034074308,0.0015916727,0.9921521,0.0030236847,0.000087440596],"about_ca_topic_score_codex":0.000006341613,"about_ca_topic_score_gemma":0.000013005697,"teacher_disagreement_score":0.48609725,"about_ca_system_score_codex":0.00042178764,"about_ca_system_score_gemma":0.0007362338,"threshold_uncertainty_score":0.7684396},"labels":[],"label_agreement":null},{"id":"W4411004437","doi":"10.1002/jgt.23265","title":"A Dichotomy Theorem for Γ‐Switchable H‐Colouring on m‐Edge‐Coloured Graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Telecommunications","score_opus":0.015777773108179422,"score_gpt":0.3045510545709746,"score_spread":0.2887732814627952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411004437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076450214,0.0014618693,0.90997106,0.0015728452,0.001551511,0.0007868118,0.000006362353,0.00011750444,0.0080818],"genre_scores_gemma":[0.9709224,0.0001553816,0.02602491,0.0010826568,0.00011574347,0.00007203213,6.31177e-7,0.000035397206,0.0015908327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971546,0.000528722,0.0007012228,0.00040518012,0.00055404287,0.0006562327],"domain_scores_gemma":[0.99547917,0.0024457544,0.00048860325,0.0007928607,0.0005793004,0.00021430205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005041452,0.000286876,0.0005250202,0.0017923205,0.00041645893,0.00018183392,0.0023703105,0.0001384449,0.000018633382],"category_scores_gemma":[0.00076409295,0.00022624669,0.0006398102,0.0016625572,0.00027738448,0.0006382424,0.00023672749,0.0006717475,0.00000732924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010508971,0.00021090676,0.00023511177,0.00004689945,0.00023482658,0.000043083386,0.00028655244,0.00022027487,0.0032032693,0.9736644,0.0013037561,0.01950003],"study_design_scores_gemma":[0.0017523702,0.00074097345,0.0004958475,0.00023792133,0.000037512287,0.000043610515,0.00018888415,0.00035444915,0.011568261,0.97963804,0.004734589,0.0002075144],"about_ca_topic_score_codex":6.6191564e-7,"about_ca_topic_score_gemma":0.0000012927871,"teacher_disagreement_score":0.8944722,"about_ca_system_score_codex":0.000092211274,"about_ca_system_score_gemma":0.00024955109,"threshold_uncertainty_score":0.92260724},"labels":[],"label_agreement":null},{"id":"W4411149101","doi":"10.1016/j.tcs.2025.115393","title":"Cuts, cats, and complete graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland","funders":"Memorial University of Newfoundland","keywords":"Combinatorics; Mathematics; Computer science; Discrete mathematics","score_opus":0.013954405158160247,"score_gpt":0.2940944799975862,"score_spread":0.28014007483942593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411149101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013871825,0.00016404862,0.9731207,0.0022764264,0.0004077537,0.00020725456,0.0000018074016,0.0002404258,0.009709751],"genre_scores_gemma":[0.8507533,0.000020072366,0.14806172,0.0010798336,0.000020515612,0.00000924199,3.1628903e-7,0.000005190071,0.000049774906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723876,0.0001616882,0.000248763,0.00096553785,0.00062600174,0.00075924647],"domain_scores_gemma":[0.9977806,0.00051269255,0.00003866757,0.0011427127,0.00022004574,0.0003052888],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016434079,0.00019838217,0.00023460321,0.00054702075,0.00071422267,0.0005508714,0.0032352484,0.000047379443,0.00001471949],"category_scores_gemma":[0.00012621074,0.0001666164,0.00005421509,0.0028919983,0.006767168,0.00072611665,0.0027285186,0.00029473667,0.00003685201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072111307,0.00002637964,0.00014730688,0.000009814323,0.0000044955045,0.000009429254,0.00011725115,0.000017524204,0.0009896362,0.95142484,0.000067937675,0.047178194],"study_design_scores_gemma":[0.0002060105,0.0000882817,0.00208557,0.000029896964,0.0000024713775,0.000023688484,0.000004816893,0.16476151,0.0013363437,0.8305617,0.0007310192,0.00016867228],"about_ca_topic_score_codex":0.0000032561968,"about_ca_topic_score_gemma":6.927408e-7,"teacher_disagreement_score":0.8368815,"about_ca_system_score_codex":0.00004506431,"about_ca_system_score_gemma":0.00015574123,"threshold_uncertainty_score":0.99593586},"labels":[],"label_agreement":null},{"id":"W4411279523","doi":"10.1016/j.disc.2025.114644","title":"Hopping forcing number in random d-regular graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Forcing (mathematics); Discrete mathematics; Random graph; Graph; Mathematical analysis","score_opus":0.014393945943673759,"score_gpt":0.3071972158539919,"score_spread":0.29280326991031813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411279523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03733744,0.000108971966,0.93783027,0.00040809566,0.00011116306,0.0003464895,0.0000011974837,0.0001255173,0.023730826],"genre_scores_gemma":[0.81686866,0.000027815347,0.18150839,0.00015891546,0.0000115474695,0.00007327719,0.0000020726163,0.000019168838,0.0013301483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850357,0.0000895806,0.00037410352,0.00031657613,0.00029753995,0.00041864763],"domain_scores_gemma":[0.99859726,0.00043953207,0.00007532927,0.0007743154,0.000055584762,0.00005799155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084243267,0.00016089996,0.00029321155,0.00028628163,0.00011478688,0.00014811574,0.00094975124,0.00005951735,0.000014986283],"category_scores_gemma":[0.0002448423,0.00014110436,0.00011408306,0.001250857,0.00008481391,0.0003844292,0.0004126573,0.00021072823,0.000039766226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008174846,0.00003329079,0.000823646,0.0001300023,0.000018641626,0.000014497882,0.0010057734,0.00017603283,0.0005174471,0.9949773,0.00007667687,0.0022185396],"study_design_scores_gemma":[0.0009898343,0.00000811184,0.00015971919,0.00029089686,0.0000051979464,0.0000060277157,0.0002845575,0.06876132,0.0020358788,0.9269892,0.00030045898,0.00016882096],"about_ca_topic_score_codex":0.000005328381,"about_ca_topic_score_gemma":0.000008540164,"teacher_disagreement_score":0.77953124,"about_ca_system_score_codex":0.000045546472,"about_ca_system_score_gemma":0.000056129174,"threshold_uncertainty_score":0.5754069},"labels":[],"label_agreement":null},{"id":"W4411331343","doi":"10.1016/j.laa.2025.06.009","title":"Vertex partitioning and p-energy of graphs","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; European Commission","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Discrete mathematics; Graph","score_opus":0.011410731436133593,"score_gpt":0.2791932171361464,"score_spread":0.26778248570001284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411331343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01678868,0.0023068127,0.9754596,0.00092589745,0.000023603488,0.00012565947,0.000006106206,0.00006492486,0.0042987145],"genre_scores_gemma":[0.99081075,0.00046667238,0.0078108255,0.00017170337,0.000007519752,0.00010446643,0.0000035707578,0.0000033763943,0.00062111206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995029,0.000020177964,0.000113145834,0.00019404515,0.000067327834,0.00010243239],"domain_scores_gemma":[0.9995127,0.000119239936,0.000027983333,0.00022667013,0.000068208865,0.000045212608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007990166,0.0000516316,0.00007798723,0.00010852734,0.00014148829,0.000024284573,0.0001890478,0.000026639442,0.000003637515],"category_scores_gemma":[0.00001499147,0.000049573668,0.000016535512,0.00052629283,0.00007380564,0.00014070126,0.00014387349,0.00005150665,0.0000023549005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012969509,0.000016169255,0.00019585744,0.000012417058,0.0000074256077,9.887998e-8,0.000031900476,0.0000040827294,0.0013646041,0.9669214,0.0000465764,0.03139817],"study_design_scores_gemma":[0.00019680847,0.000027020553,0.002337038,0.000020498373,0.000006750271,0.0000024880235,0.0000236449,0.02265142,0.009388425,0.9476387,0.017621215,0.00008597527],"about_ca_topic_score_codex":0.0000053863564,"about_ca_topic_score_gemma":0.0000034953855,"teacher_disagreement_score":0.9740221,"about_ca_system_score_codex":0.0000028003017,"about_ca_system_score_gemma":0.000020217785,"threshold_uncertainty_score":0.20215555},"labels":[],"label_agreement":null},{"id":"W4411405042","doi":"10.1017/9781009158688.011","title":"Points and Lines, Graphs and Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Northern British Columbia","funders":"","keywords":"Computer science","score_opus":0.016413020182926102,"score_gpt":0.217372722140218,"score_spread":0.2009597019572919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411405042","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056624438,0.0012907558,0.065336786,0.00004995955,0.00016131738,0.00036758,0.00004581157,0.00019705384,0.9324941],"genre_scores_gemma":[0.0004120039,0.0010610098,0.0022775694,0.000109502325,0.000026597521,6.5106946e-7,0.000008638258,0.000018777333,0.9960852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850005,0.000060296195,0.00013949124,0.0007590871,0.00021505333,0.0003260294],"domain_scores_gemma":[0.9985734,0.00021089942,0.00010797579,0.0007359521,0.0001489907,0.00022273115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017029165,0.00032339504,0.00034893616,0.0003721221,0.0002608597,0.000115121096,0.00088775775,0.0002945012,6.084113e-7],"category_scores_gemma":[0.000013468905,0.00037436016,0.0000918771,0.000027348913,0.00046243428,0.00019919728,0.0020014667,0.00058798376,0.0000011369724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034633857,0.0000030560882,0.000006761116,0.000054360586,0.0000665183,0.0001889547,0.000014742756,0.0000021233213,0.000003055491,0.98096126,0.005675046,0.012989496],"study_design_scores_gemma":[0.0009724788,0.00010025769,0.00006641651,0.00038624372,0.00009696399,0.000040892643,0.0000120473815,0.006645481,0.000056687782,0.008107434,0.98272896,0.0007861349],"about_ca_topic_score_codex":0.000022751565,"about_ca_topic_score_gemma":0.0000022255597,"teacher_disagreement_score":0.97705394,"about_ca_system_score_codex":0.00004810098,"about_ca_system_score_gemma":0.00006849216,"threshold_uncertainty_score":0.99987084},"labels":[],"label_agreement":null},{"id":"W4411599125","doi":"10.61091/jcmcc126-19","title":"On domination polynomials of some graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013241094408873909,"score_gpt":0.2923340008613273,"score_spread":0.27909290645245344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411599125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84924126,0.0005951643,0.12829638,0.00048636727,0.018696848,0.000458834,0.0000018242539,0.000055465178,0.0021678738],"genre_scores_gemma":[0.9897214,0.000039901668,0.009952326,0.0000408491,0.0002174182,0.0000015814677,2.582397e-7,0.00001379707,0.0000124419785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972336,0.00021018805,0.0012141988,0.00024459037,0.00078235916,0.00031505048],"domain_scores_gemma":[0.9953737,0.0021863326,0.0011408299,0.0004426188,0.0007267248,0.00012975011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026319977,0.00023937336,0.0007765021,0.00079164834,0.00021329641,0.00016987154,0.0011117905,0.00013995952,0.0000019777917],"category_scores_gemma":[0.0011592763,0.00021134164,0.00022282611,0.00082739565,0.00014382084,0.00047281306,0.00042198037,0.00045920166,0.0000011985007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011253687,0.00046027714,0.000038553022,0.00013751838,0.000086322725,0.000008785592,0.00034507207,0.000054054017,0.0018782326,0.99280953,0.00015796108,0.0039111306],"study_design_scores_gemma":[0.003383983,0.0007973655,0.00008471684,0.0004541997,0.000028796861,0.00001548526,0.000067759305,0.0039206767,0.009510976,0.98147136,0.00010432113,0.00016034792],"about_ca_topic_score_codex":0.0000024658098,"about_ca_topic_score_gemma":5.3492357e-8,"teacher_disagreement_score":0.14048018,"about_ca_system_score_codex":0.000081383594,"about_ca_system_score_gemma":0.00020931692,"threshold_uncertainty_score":0.8618262},"labels":[],"label_agreement":null},{"id":"W4411673352","doi":"10.1016/j.disc.2025.114648","title":"The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Combinatorics Foundation; National Research Foundation of Korea; Ministry of Education; University of Wyoming; Division of Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Combinatorics; Graph coloring; Discrete mathematics; List coloring; Chordal graph; Graph; Line graph","score_opus":0.03852087644603635,"score_gpt":0.35095695988294967,"score_spread":0.3124360834369133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411673352","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006006851,0.0003813631,0.9872171,0.0007526301,0.00010184067,0.0009637808,0.0000125928045,0.00006287959,0.0045009176],"genre_scores_gemma":[0.030308526,0.00011295812,0.96731967,0.000078552206,0.000016305472,0.00034771248,0.0000014278943,0.00002443467,0.0017904384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998669,0.00007541446,0.00036753362,0.0002752171,0.0002572594,0.00035557157],"domain_scores_gemma":[0.9966884,0.0020366698,0.00014359105,0.0009172452,0.00015454943,0.000059489506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014526116,0.00015145447,0.00028131367,0.00012912317,0.00034823333,0.00013828129,0.0013362597,0.00005266415,7.913499e-7],"category_scores_gemma":[0.0006946278,0.00009938,0.00008892274,0.0004208443,0.00020537742,0.00019174613,0.00054949714,0.00013458531,7.0437e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030142655,0.000017452376,0.000054726403,0.000307134,0.00006186887,9.288909e-7,0.0011769119,0.000019566698,0.001497337,0.99255127,0.00019158947,0.0040910793],"study_design_scores_gemma":[0.00059980515,0.00012811471,0.00007480405,0.00014355444,0.000024213554,0.000005102851,0.00074662786,0.06152327,0.01376019,0.91749513,0.005354512,0.00014468493],"about_ca_topic_score_codex":0.0000047547205,"about_ca_topic_score_gemma":0.0000081290955,"teacher_disagreement_score":0.07505614,"about_ca_system_score_codex":0.000021956397,"about_ca_system_score_gemma":0.000055562923,"threshold_uncertainty_score":0.40525988},"labels":[],"label_agreement":null},{"id":"W4411720721","doi":"10.61091/ars163-06","title":"Coloring of graphs with cost-functions whose marginal costs decrease","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Marginal cost; Combinatorics; Microeconomics; Economics","score_opus":0.012082443639475188,"score_gpt":0.2749637507143706,"score_spread":0.26288130707489543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9229165,0.00032668567,0.05729332,0.0005979032,0.0015624941,0.00088616804,0.0000091507645,0.00027249995,0.016135287],"genre_scores_gemma":[0.99541366,0.000017832896,0.0036685395,0.0000823232,0.000001757621,0.00010246867,0.0000030596066,0.000010530893,0.0006998222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851996,0.00012627839,0.00021726039,0.0003942776,0.00036440042,0.00037784842],"domain_scores_gemma":[0.99818754,0.00037816397,0.00008610667,0.00082468905,0.00032968292,0.00019384208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038375726,0.00015793914,0.0002233674,0.00038730804,0.00021382773,0.00006624857,0.0009124639,0.00005381366,0.000015328864],"category_scores_gemma":[0.00018234263,0.00014546147,0.00006591432,0.0019847741,0.00021778504,0.00043908705,0.00032456018,0.0002468363,0.000016969676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011203299,0.00016526112,0.012641764,0.00002011577,0.00004941603,0.000023900182,0.000051967378,0.000041934058,0.0004422094,0.98106986,0.0005200574,0.0048614605],"study_design_scores_gemma":[0.0023903935,0.0004298638,0.013917178,0.0001796677,0.000024417914,0.0000147669625,0.000112674854,0.0014740069,0.007795414,0.97037435,0.0030183087,0.0002689827],"about_ca_topic_score_codex":0.0000424732,"about_ca_topic_score_gemma":0.000016924361,"teacher_disagreement_score":0.072497174,"about_ca_system_score_codex":0.000115778246,"about_ca_system_score_gemma":0.0002954471,"threshold_uncertainty_score":0.5931747},"labels":[],"label_agreement":null},{"id":"W4411720742","doi":"10.61091/ars163-03","title":"Eternal distance-2 domination in trees","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.010530093153499303,"score_gpt":0.29029416328090896,"score_spread":0.27976407012740967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7934035,0.0004965461,0.17903754,0.0017778211,0.0026767228,0.00040089275,0.000001722196,0.0002108878,0.021994345],"genre_scores_gemma":[0.9971575,0.000016634182,0.0018022672,0.000073851385,0.0000020432765,0.000029977855,8.8762505e-7,0.0000043003274,0.0009125294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989365,0.00011065621,0.00017567002,0.0002915235,0.0002275978,0.00025805522],"domain_scores_gemma":[0.99920607,0.0002029221,0.000036788497,0.00044976582,0.000063503176,0.000040954867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039133817,0.000090871545,0.0001238336,0.0002792411,0.000072000104,0.00008243912,0.0008736041,0.000043540003,0.0000055880137],"category_scores_gemma":[0.00011249933,0.00009164681,0.000037667633,0.0010378299,0.00005907295,0.00045067136,0.00023145735,0.00017934784,0.000020719835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014037185,0.00005963517,0.00926889,0.0000059361296,0.0000043389236,0.0000146021,0.00011583756,0.000021224787,0.00034433117,0.97283524,0.0001705488,0.017145392],"study_design_scores_gemma":[0.0007746807,0.00002988603,0.027113613,0.000037206726,8.216353e-7,8.7557635e-7,0.000015082733,0.0044668224,0.0021329655,0.9640459,0.0012958497,0.000086336004],"about_ca_topic_score_codex":0.000013737972,"about_ca_topic_score_gemma":0.00003751505,"teacher_disagreement_score":0.20375398,"about_ca_system_score_codex":0.00011658172,"about_ca_system_score_gemma":0.000056319575,"threshold_uncertainty_score":0.37372485},"labels":[],"label_agreement":null},{"id":"W4411973470","doi":"10.1007/s10878-025-01332-0","title":"Algorithms for 2-balanced connected k-partition problem in graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Theory of computation; Partition (number theory); Combinatorics; Computer science; Mathematics; Partition problem; Discrete mathematics; Algorithm","score_opus":0.013535896212277767,"score_gpt":0.3004663665176037,"score_spread":0.286930470305326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411973470","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012817022,0.00008953414,0.9947805,0.0009810281,0.002092675,0.00040600082,0.000001313795,0.000029013738,0.00033822324],"genre_scores_gemma":[0.26693496,0.00008596399,0.732615,0.000120569115,0.00011417196,0.000046695943,0.0000070668434,0.000013052955,0.000062532774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986557,0.00015107876,0.0005377022,0.00016372136,0.00027740726,0.00021442777],"domain_scores_gemma":[0.9983056,0.00029176663,0.00031999074,0.00017878045,0.0008326981,0.00007112752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009274255,0.00010016249,0.00024621247,0.0006255501,0.00008125606,0.00009804025,0.00049732666,0.00008362045,0.000003498566],"category_scores_gemma":[0.0005621436,0.00009577785,0.000091113994,0.0013748395,0.00003481171,0.0008383534,0.0000549048,0.00018755713,4.5715512e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002408298,0.00017794338,0.00023371453,0.000026719004,0.000024690287,0.0000047341623,0.00009666218,0.22752312,0.00048364777,0.76775193,0.0004748047,0.0029611774],"study_design_scores_gemma":[0.0037428911,0.0003258642,0.000103375365,0.00009900418,0.0000071627123,0.000004659187,0.000014298528,0.27222678,0.0019992609,0.7210463,0.0003398624,0.00009050487],"about_ca_topic_score_codex":0.0000014053245,"about_ca_topic_score_gemma":3.0982318e-7,"teacher_disagreement_score":0.26565325,"about_ca_system_score_codex":0.000118979005,"about_ca_system_score_gemma":0.0002514615,"threshold_uncertainty_score":0.39057073},"labels":[],"label_agreement":null},{"id":"W4412016901","doi":"10.1007/s00493-025-00160-4","title":"Signed graphs with the same even cycles","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011003287367122902,"score_gpt":0.27149403176875814,"score_spread":0.2604907444016352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412016901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06441971,0.0025040435,0.84187084,0.033867057,0.00093529024,0.0011788105,0.0000027943818,0.00094781833,0.054273628],"genre_scores_gemma":[0.9954188,0.000015564676,0.0018061008,0.0005089868,0.000005911789,0.000059717757,4.646025e-7,0.000008155645,0.002176314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874765,0.00015693478,0.000107552754,0.00033577412,0.00031578244,0.00033628356],"domain_scores_gemma":[0.99834836,0.00044019727,0.000042410862,0.0009829934,0.00012090695,0.0000651517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030821827,0.00012699088,0.00013933485,0.00015718964,0.0003396832,0.000119260745,0.0018885826,0.000037407375,0.0000064316023],"category_scores_gemma":[0.000056116765,0.00007789085,0.000054077107,0.001880761,0.00017989647,0.00022959855,0.0004256339,0.00022252982,0.000031324817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138325895,0.000052999316,0.0005571883,0.0000066558514,0.000023757735,0.000009619298,0.00014908201,0.000012312008,0.00023177601,0.98735374,0.0030321416,0.008556909],"study_design_scores_gemma":[0.00046240786,0.00013118773,0.0034150686,0.000020233609,0.000005737401,0.0000036426059,0.00005953039,0.00060036907,0.0017336827,0.9795466,0.013881787,0.00013974053],"about_ca_topic_score_codex":0.000007900445,"about_ca_topic_score_gemma":0.0000029211462,"teacher_disagreement_score":0.9309991,"about_ca_system_score_codex":0.000047669193,"about_ca_system_score_gemma":0.000095030504,"threshold_uncertainty_score":0.35094878},"labels":[],"label_agreement":null},{"id":"W4412042334","doi":"10.1112/blms.70134","title":"Longest cycles in vertex‐transitive and highly connected graphs","year":2025,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Transitive relation; Vertex (graph theory); Combinatorics; Graph","score_opus":0.009607886391988337,"score_gpt":0.2566998037470482,"score_spread":0.24709191735505986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412042334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82964665,0.001283138,0.104892336,0.048573375,0.00019118206,0.0013447658,0.000011263388,0.0001964394,0.013860867],"genre_scores_gemma":[0.97433794,0.00011677548,0.024014484,0.00072947174,0.000004748847,0.000033239507,3.9253763e-7,0.000010594966,0.00075237197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862885,0.00019527647,0.00029199396,0.0003095285,0.00028498677,0.00028934187],"domain_scores_gemma":[0.998019,0.00126193,0.00006511446,0.00051698677,0.00008422726,0.00005277405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006476442,0.00014159788,0.00028608643,0.00004853736,0.00009884941,0.000040779752,0.000835144,0.0000949477,0.000030149302],"category_scores_gemma":[0.0003352851,0.00009969228,0.0001704379,0.0005943709,0.0005145003,0.000036244382,0.00048563414,0.00028032012,0.000007371004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023177352,0.00018032588,0.0008147592,0.00024918737,0.0000521959,0.0000028527027,0.000989309,0.000017227516,0.0023352816,0.9917131,0.0019458086,0.0016767398],"study_design_scores_gemma":[0.0010238701,0.00004529622,0.007094101,0.00038505683,0.000015195898,0.0000068906684,0.00023800942,0.007158257,0.01071486,0.97207886,0.0010632116,0.00017640565],"about_ca_topic_score_codex":0.000017777902,"about_ca_topic_score_gemma":0.000003876002,"teacher_disagreement_score":0.14469129,"about_ca_system_score_codex":0.000030319508,"about_ca_system_score_gemma":0.000032943855,"threshold_uncertainty_score":0.40653333},"labels":[],"label_agreement":null},{"id":"W4412133525","doi":"10.1002/jgt.23276","title":"Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Chordal graph; Combinatorics; Mathematics; Clique-sum; Partial k-tree; 1-planar graph; Pathwidth; Indifference graph; Bounded function; Discrete mathematics; Graph; Line graph","score_opus":0.014522849603426218,"score_gpt":0.28703737638345067,"score_spread":0.27251452678002447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412133525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48459274,0.0035743015,0.50030655,0.0039831838,0.0019114801,0.0005276573,0.000023701155,0.00016700427,0.0049133515],"genre_scores_gemma":[0.9350921,0.00049336045,0.06260798,0.0008550785,0.00007020155,0.00002042954,8.933645e-7,0.000030824187,0.00082914834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705327,0.000558996,0.0007129543,0.00044856383,0.0006459967,0.0005801944],"domain_scores_gemma":[0.9970077,0.0006841565,0.00031435263,0.001120173,0.0004421011,0.0004314623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023762656,0.00029519096,0.00048641925,0.0025505254,0.00046640402,0.00027026606,0.0022981423,0.00011581315,0.000020202626],"category_scores_gemma":[0.0006122589,0.00025462435,0.00037790844,0.0031059943,0.00050615927,0.0009539143,0.00059309177,0.00071715174,0.0000058310793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026222598,0.000104210434,0.0014845557,0.000019203359,0.00018529683,0.00006110115,0.00033123823,0.00007167714,0.0027690702,0.9658025,0.001651324,0.027257599],"study_design_scores_gemma":[0.001137126,0.00033577564,0.01013458,0.00011449798,0.000042561176,0.000200687,0.0003216958,0.000050935534,0.0013188148,0.9835993,0.0025106033,0.00023341241],"about_ca_topic_score_codex":0.0000053772465,"about_ca_topic_score_gemma":0.000023759876,"teacher_disagreement_score":0.45049933,"about_ca_system_score_codex":0.0000630928,"about_ca_system_score_gemma":0.00019597904,"threshold_uncertainty_score":0.9999906},"labels":[],"label_agreement":null},{"id":"W4412402110","doi":"10.55016/ojs/cdm.v10i2.62217","title":"A theorem on fractional ID - ( g , f ) - factor-critical graphs","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; National Social Science Fund of China; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics; Factor (programming language); Computer science","score_opus":0.023433605097989585,"score_gpt":0.3495409181538872,"score_spread":0.32610731305589763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028872255,0.000025262856,0.9835117,0.009743628,0.0001965146,0.00036236152,0.00050701847,0.00025585506,0.0025104764],"genre_scores_gemma":[0.96585524,0.000008900199,0.033150863,0.0003171232,0.00007093022,0.00012360908,0.000005562953,0.00002135665,0.00044644065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783236,0.00013252525,0.000347236,0.00044304656,0.00062404544,0.0006208008],"domain_scores_gemma":[0.9955895,0.002580872,0.000065628185,0.0010193791,0.00037124823,0.000373403],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000472405,0.00021965922,0.0002538051,0.0002709375,0.00036498564,0.00016119587,0.0009922298,0.00008856304,0.0002266248],"category_scores_gemma":[0.0037873639,0.00014001562,0.00014396949,0.0005877537,0.0002591872,0.00049228733,0.00032096644,0.00019984948,0.0012014536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013890409,0.000110641304,0.000022649183,0.000007949134,0.00002070298,0.000008169951,0.00012028074,0.0000063130656,0.0027270312,0.9937373,0.0006001206,0.0026250004],"study_design_scores_gemma":[0.0003799635,0.00018394549,0.00026767622,0.00011102307,0.000006649484,0.000022017282,0.000027766513,0.0011817619,0.0048822793,0.987935,0.0047417344,0.0002602011],"about_ca_topic_score_codex":7.453176e-7,"about_ca_topic_score_gemma":0.0000010644635,"teacher_disagreement_score":0.962968,"about_ca_system_score_codex":0.00016916088,"about_ca_system_score_gemma":0.00008785222,"threshold_uncertainty_score":0.9995762},"labels":[],"label_agreement":null},{"id":"W4412435997","doi":"10.55016/ojs/cdm.v11i2.62553","title":"Fully Indecomposable and Nearly Decomposable Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Research in Fundamental Sciences; School of Mathematics, Institute for Research in Fundamental Sciences; Sharif University of Technology","keywords":"Combinatorics; Mathematics; Indecomposable module; Cograph; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.018580713753969132,"score_gpt":0.3376772356103748,"score_spread":0.3190965218564057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036440242,0.0001348348,0.95179564,0.004884601,0.00014866333,0.0006043096,0.0000774357,0.00018021757,0.0057340763],"genre_scores_gemma":[0.77888846,0.000029819623,0.21966548,0.00013439832,0.000035997047,0.00009397817,0.0000064904884,0.000022759294,0.0011226374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817574,0.00006000026,0.0003343982,0.00044482472,0.00034138391,0.00064364745],"domain_scores_gemma":[0.99677235,0.0002688153,0.0001836107,0.002019708,0.00034004022,0.000415454],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008204294,0.00021480865,0.00032886295,0.00019007025,0.0016715736,0.0014747947,0.0019749587,0.000081830345,0.000024350977],"category_scores_gemma":[0.0011787297,0.00019357828,0.00008941376,0.00026811325,0.0002726443,0.0010438715,0.0013129935,0.0002248092,0.00018987826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006729069,0.00005695879,0.0004905168,0.000024106399,0.000030004907,0.0000116480505,0.0003384162,0.00002549576,0.0010240466,0.9955315,0.00066473096,0.0017958735],"study_design_scores_gemma":[0.000722831,0.000127152,0.0020333324,0.00009200656,0.000014538015,0.000049672504,0.000057801288,0.026626786,0.0028440992,0.96115965,0.005874823,0.000397323],"about_ca_topic_score_codex":0.0000104137525,"about_ca_topic_score_gemma":0.000012581331,"teacher_disagreement_score":0.7424482,"about_ca_system_score_codex":0.00006402613,"about_ca_system_score_gemma":0.00008583193,"threshold_uncertainty_score":0.9996281},"labels":[],"label_agreement":null},{"id":"W4412558656","doi":"10.1016/j.dam.2025.07.009","title":"Obstructions for local tournament orientation completions with cut-vertices","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Mathematics; Orientation (vector space); Combinatorics; Geometry","score_opus":0.01855583382420776,"score_gpt":0.30799474652268233,"score_spread":0.28943891269847455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412558656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019480714,0.000015635362,0.9898695,0.0005788982,0.000078646866,0.00072829693,0.000010676669,0.00012691325,0.0066433884],"genre_scores_gemma":[0.27307552,0.000005125066,0.725966,0.000107267864,0.00001622929,0.000475637,0.000015382324,0.000013160899,0.00032565702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989163,0.000011849564,0.00025468893,0.00028465694,0.00025897747,0.00027350278],"domain_scores_gemma":[0.99890083,0.00029808006,0.00009579869,0.0005220075,0.00011760254,0.00006568326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017262818,0.00013563935,0.00017765081,0.00014384907,0.00034231882,0.00013738856,0.0005060542,0.0000346195,0.000008766475],"category_scores_gemma":[0.000024751174,0.00010804267,0.000049176604,0.00055700465,0.00015948732,0.00020000486,0.00013283468,0.0001048038,0.000012708229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016619015,0.00006036326,0.0000072137036,0.000094002025,0.000039776747,5.2174323e-7,0.0006189138,0.0015198443,0.0006237008,0.9918058,0.00016117764,0.005052082],"study_design_scores_gemma":[0.00081744365,0.000081268336,0.000066522116,0.00006774763,0.000044746324,0.0000063584394,0.0026184977,0.1061896,0.0055102576,0.88218546,0.00220292,0.00020919742],"about_ca_topic_score_codex":0.0000015872303,"about_ca_topic_score_gemma":0.000013151361,"teacher_disagreement_score":0.27112746,"about_ca_system_score_codex":0.000073788644,"about_ca_system_score_gemma":0.00006210961,"threshold_uncertainty_score":0.4405852},"labels":[],"label_agreement":null},{"id":"W4412582169","doi":"10.55016/ojs/cdm.v12i2.62487","title":"Lower Bounds on the Distance Domination Number of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; University of Johannesburg; National Research Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.020261008347206164,"score_gpt":0.3484921222010613,"score_spread":0.3282311138538551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021257693,0.000014343768,0.9630835,0.0061212685,0.00014696005,0.00048141964,0.000113399576,0.000046487752,0.008734932],"genre_scores_gemma":[0.9841904,0.0000061905494,0.014875618,0.00007892484,0.000026608683,0.000097405034,0.0000026188775,0.000009974269,0.00071226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986438,0.00007274599,0.00029007098,0.00024138541,0.00043931382,0.00031266944],"domain_scores_gemma":[0.9965122,0.00057079596,0.00026055647,0.002140434,0.00041708085,0.00009894056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089945766,0.00013870405,0.00020797686,0.000069651556,0.00088947115,0.00034650663,0.0019409149,0.000046501456,0.000034302215],"category_scores_gemma":[0.002608732,0.000092858354,0.00012400656,0.0002908726,0.00033467196,0.0003547365,0.00040706556,0.0001581976,0.00014182176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011298061,0.00007714938,0.000060113834,0.000012213132,0.00001730402,0.0000023360546,0.0003132819,0.000017133334,0.00031465624,0.998133,0.00045458868,0.0005868924],"study_design_scores_gemma":[0.0003436709,0.000077501514,0.0008929594,0.0001430576,0.000011373085,0.0000062323006,0.00006949564,0.0076246522,0.0044234917,0.9837378,0.0024887302,0.00018100944],"about_ca_topic_score_codex":0.0000028938564,"about_ca_topic_score_gemma":0.000006403948,"teacher_disagreement_score":0.9629327,"about_ca_system_score_codex":0.00006707037,"about_ca_system_score_gemma":0.000046719822,"threshold_uncertainty_score":0.68411833},"labels":[],"label_agreement":null},{"id":"W4412582188","doi":"10.55016/ojs/cdm.v12i2.62745","title":"Permutations avoiding connected graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.028515208239438185,"score_gpt":0.35768140537228726,"score_spread":0.32916619713284906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015280558,0.000037654576,0.9747915,0.0038712546,0.00016641204,0.00053089677,0.00014669698,0.00026453528,0.004910461],"genre_scores_gemma":[0.95294017,0.0000072491707,0.046234507,0.00008494033,0.000033454453,0.00012471156,0.000012078385,0.000016456761,0.0005464163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830264,0.00010150538,0.00033332992,0.00037253433,0.00035422842,0.00053573446],"domain_scores_gemma":[0.99634147,0.0005419277,0.00019584758,0.002066498,0.0005568802,0.00029736815],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00079067977,0.00018397736,0.0002600685,0.00022998676,0.0028195737,0.00092167273,0.0021583291,0.00006604244,0.000031026357],"category_scores_gemma":[0.0064657233,0.00016901895,0.00013049369,0.0003926679,0.00019881723,0.0008036791,0.0007437443,0.00026653666,0.00033586373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021617664,0.00004083202,0.000065145905,0.000012107216,0.000025426763,0.000009168285,0.0007314034,0.000060678016,0.0024473553,0.99584687,0.000268071,0.0004907674],"study_design_scores_gemma":[0.00047495967,0.000061000996,0.001102721,0.0000800175,0.000018299022,0.000024664096,0.0002433394,0.031909823,0.0050041797,0.959418,0.0013424181,0.00032057078],"about_ca_topic_score_codex":0.000006232016,"about_ca_topic_score_gemma":0.000015296233,"teacher_disagreement_score":0.9376596,"about_ca_system_score_codex":0.0000928527,"about_ca_system_score_gemma":0.00009089101,"threshold_uncertainty_score":0.9984786},"labels":[],"label_agreement":null},{"id":"W4412582201","doi":"10.55016/ojs/cdm.v12i2.62550","title":"Bounds for the m -Eternal Domination Number of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.025918743299742482,"score_gpt":0.38280737895624833,"score_spread":0.35688863565650586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054963483,0.000031717387,0.9893625,0.0030956888,0.00014250942,0.00070118567,0.00015803239,0.000032223023,0.0009798257],"genre_scores_gemma":[0.8935595,0.000009042616,0.10555439,0.000037785412,0.00005156559,0.00024432968,0.0000037442715,0.000010089872,0.0005295354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891025,0.00003265892,0.0002842566,0.0001875462,0.00029318192,0.00029210825],"domain_scores_gemma":[0.99690545,0.0007626627,0.00025424323,0.0014348581,0.00055722747,0.00008558864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009519286,0.0001086263,0.00018812451,0.00006613773,0.0009913302,0.0003579861,0.0019036431,0.000041744326,0.000010399971],"category_scores_gemma":[0.00226505,0.00007448847,0.0001532113,0.00016562828,0.00023751687,0.00037905673,0.0004132105,0.00009184684,0.000031837906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001076353,0.000036219597,0.000091105794,0.000024171766,0.000034770543,5.5970474e-7,0.0003759849,0.000027987391,0.00064149353,0.99561405,0.00028804745,0.0028548478],"study_design_scores_gemma":[0.0006533366,0.00006178269,0.0010443467,0.0000636377,0.000028506425,0.000013698255,0.00007416827,0.041591514,0.0053374376,0.9487053,0.0022813848,0.00014487325],"about_ca_topic_score_codex":0.000005897403,"about_ca_topic_score_gemma":0.000007285589,"teacher_disagreement_score":0.8880632,"about_ca_system_score_codex":0.00004294191,"about_ca_system_score_gemma":0.000054476986,"threshold_uncertainty_score":0.7624611},"labels":[],"label_agreement":null},{"id":"W4412582255","doi":"10.55016/ojs/cdm.v12i2.62508","title":"On Cops and Robbers on G Ξ and cop-edge critical graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Center for Research and Development in Mathematics and Applications","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Artificial intelligence","score_opus":0.023302382710995946,"score_gpt":0.3636016574214429,"score_spread":0.34029927471044696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07652333,0.00013073681,0.9038384,0.011902648,0.00021169437,0.00075513683,0.00022821133,0.00015984272,0.0062499987],"genre_scores_gemma":[0.9798329,0.000022523778,0.019607432,0.0002620676,0.000020080948,0.000051096344,0.0000026555922,0.000013132131,0.0001881405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862057,0.000064161846,0.00020729906,0.00039323297,0.00029498097,0.00041973012],"domain_scores_gemma":[0.9970974,0.0011148663,0.00006864359,0.0011898964,0.00018153501,0.00034770378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052772753,0.00017880097,0.0002507793,0.00014908343,0.0011053717,0.0006157768,0.0007294475,0.00006959202,0.000008801117],"category_scores_gemma":[0.0044738976,0.00015048355,0.000049388243,0.00013228739,0.0005039362,0.0003169876,0.0005195061,0.00022325527,0.00006908841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012649734,0.000051586438,0.000043614044,0.000024241694,0.0000122541815,0.000011853207,0.0002399878,0.00000733445,0.00015069846,0.9977582,0.00043436096,0.0012531854],"study_design_scores_gemma":[0.000564685,0.00036328653,0.0012496226,0.00017345148,0.000014003731,0.000022633227,0.00005878746,0.011254995,0.0009829648,0.98455334,0.0005102199,0.00025203414],"about_ca_topic_score_codex":0.000002226569,"about_ca_topic_score_gemma":0.0000038610083,"teacher_disagreement_score":0.9033095,"about_ca_system_score_codex":0.00004477719,"about_ca_system_score_gemma":0.000031047184,"threshold_uncertainty_score":0.8501737},"labels":[],"label_agreement":null},{"id":"W4412582263","doi":"10.55016/ojs/cdm.v12i2.62445","title":"On the total signed domination number of the Cartesian product of paths","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Cartesian product; Mathematics; Combinatorics; Product (mathematics); Geometry","score_opus":0.015871039270510267,"score_gpt":0.32509482120535843,"score_spread":0.3092237819348482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2407194,0.000018721683,0.7407928,0.011002216,0.00021200666,0.0015229365,0.00018885842,0.00003563445,0.005507434],"genre_scores_gemma":[0.99383473,8.4663975e-7,0.0056207054,0.000020429034,0.000021030663,0.000058149522,0.0000011920217,0.0000073197825,0.00043560885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871254,0.0001326549,0.0003007605,0.00019289862,0.0004361104,0.0002250545],"domain_scores_gemma":[0.99634176,0.00056263007,0.00034253718,0.002235603,0.00046471675,0.000052776264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009398608,0.00011225704,0.00019946763,0.00004107663,0.00057600735,0.00010081505,0.0017390604,0.000032264303,0.000018752875],"category_scores_gemma":[0.0048325122,0.00006141494,0.0001238035,0.00025988682,0.0002998531,0.0001944906,0.00052315975,0.00012830774,0.000027850565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057527054,0.00006527379,0.000054012748,0.000019962745,0.000016892596,4.214498e-7,0.0007407679,0.00006247923,0.0055315173,0.9926744,0.00018140486,0.0006471205],"study_design_scores_gemma":[0.00045933542,0.00010221506,0.0044238716,0.00022352676,0.000026825006,0.00001291961,0.0001844135,0.014028611,0.12337942,0.8568845,0.000085851185,0.0001885206],"about_ca_topic_score_codex":0.0000050877634,"about_ca_topic_score_gemma":0.0000027694712,"teacher_disagreement_score":0.75311536,"about_ca_system_score_codex":0.00004564321,"about_ca_system_score_gemma":0.00007511436,"threshold_uncertainty_score":0.57853174},"labels":[],"label_agreement":null},{"id":"W4412617759","doi":"10.55016/ojs/cdm.v12i1.62175","title":"Bounds on several versions of restrained domination number","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph","score_opus":0.022056640730318405,"score_gpt":0.3656217373183562,"score_spread":0.3435650965880378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036140222,0.00000441966,0.9448117,0.0035669324,0.00015513581,0.0004307636,0.00017765249,0.00007214012,0.014641022],"genre_scores_gemma":[0.94289,0.0000032836922,0.056011677,0.00004148056,0.000031013406,0.000034788503,0.000009392634,0.000009189819,0.0009691558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987014,0.000057916783,0.00028424896,0.0002438186,0.0003963886,0.0003162582],"domain_scores_gemma":[0.99734795,0.00032648977,0.0002111284,0.0015665076,0.00039062966,0.00015729696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713218,0.00012988523,0.00022178887,0.000116021234,0.0007576623,0.00022780604,0.0013597724,0.00006252502,0.00004007414],"category_scores_gemma":[0.002586605,0.000115455034,0.000104084385,0.00021409433,0.00019168918,0.00044810204,0.00044129437,0.00014463965,0.00021254091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015214933,0.00008525164,0.00004319676,0.00001563416,0.000018574048,0.000004628001,0.00042663814,0.00010113518,0.0010251455,0.99693894,0.0006770356,0.000648623],"study_design_scores_gemma":[0.0017733916,0.0003014471,0.004564664,0.00028571574,0.000030338375,0.00002050967,0.00017244063,0.048297986,0.013478759,0.9273472,0.0032760743,0.00045148717],"about_ca_topic_score_codex":0.0000052152113,"about_ca_topic_score_gemma":0.000004382359,"teacher_disagreement_score":0.9067498,"about_ca_system_score_codex":0.00010595145,"about_ca_system_score_gemma":0.00008258006,"threshold_uncertainty_score":0.58274025},"labels":[],"label_agreement":null},{"id":"W4412647922","doi":"10.55016/ojs/cdm.v2i1.61885","title":"On the rigidity of regular bicycle (n,k)-gons","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rigidity (electromagnetism); Combinatorics; Materials science","score_opus":0.020391223131922997,"score_gpt":0.33276876695995283,"score_spread":0.31237754382802985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045896195,0.000027919195,0.9466209,0.0029644019,0.00007267593,0.0004961982,0.00007850398,0.00008618364,0.0037570177],"genre_scores_gemma":[0.96331793,0.000002322021,0.03616042,0.00015209882,0.000027706687,0.000028331542,0.0000030434092,0.000010657056,0.00029749292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835885,0.000089583635,0.0003833238,0.00023851349,0.00047452495,0.00045522445],"domain_scores_gemma":[0.996178,0.0017979183,0.00012905899,0.0013872283,0.00034105105,0.00016678426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022403477,0.00013916894,0.0002140771,0.00017467784,0.00030269538,0.00006334261,0.0012743347,0.000055296492,0.000029801438],"category_scores_gemma":[0.0024648225,0.00009247505,0.00012112316,0.0010360191,0.000197116,0.00014015376,0.00035766716,0.00019895073,0.00014158562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075604403,0.00008153488,0.000010456744,0.000009560576,0.00001681971,0.0000033766646,0.000340167,0.00011048464,0.0023477592,0.9958159,0.0007462197,0.0005102159],"study_design_scores_gemma":[0.00020527294,0.00012797276,0.00042950636,0.00006723381,0.000009293515,0.000007654627,0.00015357083,0.0057818177,0.05081615,0.94064724,0.0015973389,0.00015692465],"about_ca_topic_score_codex":0.000002934783,"about_ca_topic_score_gemma":0.000006331767,"teacher_disagreement_score":0.91742176,"about_ca_system_score_codex":0.00008604635,"about_ca_system_score_gemma":0.000049644517,"threshold_uncertainty_score":0.37710232},"labels":[],"label_agreement":null},{"id":"W4412648037","doi":"10.55016/ojs/cdm.v1i1.61914","title":"Uniquely circular colourable and uniquely fractional colourable graphs of large girth","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Combinatorics; Mathematics; Girth (graph theory)","score_opus":0.010675779929692698,"score_gpt":0.2983649979812065,"score_spread":0.2876892180515138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120576635,0.00031057282,0.8738977,0.0014490612,0.0000612103,0.0007824497,0.00040450637,0.00015986078,0.0023580478],"genre_scores_gemma":[0.9342679,0.000027999013,0.06480956,0.00010217443,0.0000051657084,0.000104646366,0.000034422654,0.000019866617,0.0006283064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790233,0.00015206718,0.0005137404,0.00037558732,0.00046972866,0.0005865539],"domain_scores_gemma":[0.997633,0.0005364963,0.00021452969,0.00069583766,0.0007181423,0.00020202884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010696186,0.00021350353,0.0003922684,0.0003119371,0.00041835615,0.00013436821,0.0006476915,0.00011492379,0.00003804561],"category_scores_gemma":[0.0004992564,0.00020229211,0.00011338405,0.0011486798,0.00018927388,0.00046547144,0.00032815867,0.00024361779,0.000026315789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009941991,0.00017595361,0.00037540807,0.000058451176,0.00003162387,0.000008546904,0.00011238018,0.00032603068,0.0042851344,0.99375093,0.0008126686,0.00005293632],"study_design_scores_gemma":[0.00060928013,0.00013426071,0.0011842638,0.0000697348,0.00002095213,0.00003593069,0.00009579547,0.019110909,0.007812185,0.968107,0.002572167,0.00024753134],"about_ca_topic_score_codex":0.00003117622,"about_ca_topic_score_gemma":0.00002389459,"teacher_disagreement_score":0.81369126,"about_ca_system_score_codex":0.00011562736,"about_ca_system_score_gemma":0.00016924561,"threshold_uncertainty_score":0.8249233},"labels":[],"label_agreement":null},{"id":"W4412648067","doi":"10.55016/ojs/cdm.v1i1.61915","title":"Induced Subgraphs of Bounded Degree and Bounded Treewidth","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Treewidth; Bounded function; Mathematics; Combinatorics; Degree (music); Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.025956985522601995,"score_gpt":0.3125563119720091,"score_spread":0.2865993264494071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21976419,0.00015677787,0.7760255,0.00077936845,0.000055354933,0.0005430497,0.00009241129,0.00012564732,0.0024577398],"genre_scores_gemma":[0.8992079,0.0000062690547,0.100432426,0.000034357356,0.000025221078,0.00005353551,0.000011392045,0.000014948934,0.00021394476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981488,0.00008964802,0.00050066866,0.0003547863,0.00041481917,0.0004912837],"domain_scores_gemma":[0.9979648,0.00039170336,0.00016750763,0.0009003783,0.00039373452,0.00018189244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062297395,0.00020446724,0.00037449555,0.0003264668,0.00027822034,0.00019150648,0.00075055234,0.000089620466,0.000009221279],"category_scores_gemma":[0.00052007515,0.00018215773,0.000104445375,0.0010965618,0.00021543737,0.00033616245,0.00038959304,0.00016436027,0.000020263627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008150477,0.000095036936,0.00016279292,0.00003339461,0.000022441998,0.000004242775,0.00024009353,0.000006388868,0.008230787,0.9898598,0.0001283651,0.0012084729],"study_design_scores_gemma":[0.0007042888,0.0001555376,0.0021054572,0.000060913495,0.00002083968,0.000020539037,0.00007476322,0.0055463873,0.017901983,0.97265124,0.0004973142,0.0002607363],"about_ca_topic_score_codex":0.000035248326,"about_ca_topic_score_gemma":0.000072410454,"teacher_disagreement_score":0.6794437,"about_ca_system_score_codex":0.00007688252,"about_ca_system_score_gemma":0.00010239859,"threshold_uncertainty_score":0.74281764},"labels":[],"label_agreement":null},{"id":"W4412648234","doi":"10.55016/ojs/cdm.v13i1.62310","title":"On the enumeration of a class of toroidal graphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Enumeration; Combinatorics; Mathematics; Toroid; Class (philosophy); Computer science; Physics; Artificial intelligence","score_opus":0.01820904632752397,"score_gpt":0.3194199532373009,"score_spread":0.3012109069097769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06477658,0.000021759155,0.9308354,0.0015770405,0.00007179617,0.00043460677,0.00010818877,0.00003394991,0.0021406675],"genre_scores_gemma":[0.9830607,0.0000024479295,0.016700732,0.00007691341,0.000020979038,0.000037451602,0.0000029743092,0.0000062404774,0.000091530834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988217,0.00010308042,0.00033451087,0.00016348172,0.0003593479,0.00021787567],"domain_scores_gemma":[0.9975802,0.0007203415,0.00015401814,0.0008521276,0.0006256525,0.000067678884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072406215,0.000098335986,0.00018519079,0.00013041885,0.00016978182,0.00003600258,0.000789293,0.000039883234,0.000033705157],"category_scores_gemma":[0.0014618563,0.00006550849,0.00008822882,0.0007322814,0.00027268563,0.00013200878,0.00019953998,0.00009366371,0.000061493614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009479521,0.00005738369,0.000008177404,0.000011873652,0.000017568833,2.4734527e-7,0.00079211855,0.000028991713,0.008333783,0.9899523,0.00038996953,0.00039807725],"study_design_scores_gemma":[0.00022761933,0.00045766385,0.00010836091,0.00008150341,0.000010029724,0.000002823204,0.00012644188,0.021894718,0.09533008,0.88109064,0.00056095555,0.00010914412],"about_ca_topic_score_codex":0.0000026139028,"about_ca_topic_score_gemma":0.0000057841903,"teacher_disagreement_score":0.9182842,"about_ca_system_score_codex":0.0000349753,"about_ca_system_score_gemma":0.000059688882,"threshold_uncertainty_score":0.26713586},"labels":[],"label_agreement":null},{"id":"W4412863170","doi":"10.1007/978-981-95-0218-9_11","title":"Vertex-Critical $$(P_5,W_4)$$-Free Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island; Acadia University","funders":"","keywords":"Computer science; Vertex (graph theory); Combinatorics; Graph; Theoretical computer science; Mathematics","score_opus":0.017836022691292343,"score_gpt":0.2949606395636925,"score_spread":0.27712461687240014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412863170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011569,0.0010206612,0.9734472,0.002600397,0.0029607248,0.0004587025,0.000016680595,0.00034086383,0.0191432],"genre_scores_gemma":[0.049679436,0.00019884939,0.9415817,0.00450478,0.0003796569,0.000046836754,0.00000868725,0.00009363776,0.0035063762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99314654,0.000104488325,0.00067599805,0.002638157,0.001987468,0.0014473596],"domain_scores_gemma":[0.99174315,0.0028322288,0.00014832028,0.0043248856,0.0005539941,0.00039744773],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014238723,0.0007731764,0.0007804907,0.0022775207,0.00052236667,0.0007785331,0.011892393,0.0004964588,0.000055382316],"category_scores_gemma":[0.001272694,0.0007302953,0.00029276306,0.001937075,0.002718429,0.0010259202,0.006180553,0.0019166362,0.000092879316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009279139,0.000028717932,0.00001893646,0.000052300475,0.000011133228,0.00017622673,0.00012261307,0.0009875246,0.00006022329,0.67201525,0.00017051435,0.3263473],"study_design_scores_gemma":[0.00030786544,0.0001715215,0.000031382762,0.00046724803,0.000007643255,0.000060827955,1.0604597e-7,0.09440067,0.00080080214,0.9005112,0.0025601224,0.00068062823],"about_ca_topic_score_codex":0.000012851211,"about_ca_topic_score_gemma":0.00005214204,"teacher_disagreement_score":0.32566667,"about_ca_system_score_codex":0.00036731322,"about_ca_system_score_gemma":0.0011079086,"threshold_uncertainty_score":0.9999956},"labels":[],"label_agreement":null},{"id":"W4412946758","doi":"10.1002/rsa.70023","title":"Leaf Stripping on Uniform Attachment Trees","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Banco Bilbao Vizcaya Argentaria; Canada Research Chairs; McGill University; Fundación BBVA; Simons Foundation; Ministerio de Economía y Competitividad; National Science Foundation","keywords":"Stripping (fiber); Mathematics; Horticulture; Combinatorics; Computer science; Biology; Botany; Materials science; Composite material","score_opus":0.013784659978995658,"score_gpt":0.3026938574745666,"score_spread":0.288909197495571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412946758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032110393,0.0015537823,0.9557969,0.001723297,0.0006923788,0.00061571324,0.000012686039,0.00021024246,0.007284595],"genre_scores_gemma":[0.966193,0.00030861906,0.031142551,0.0006256404,0.00011209588,0.000030723626,0.0000049578507,0.00001137598,0.0015709877],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875665,0.00007272473,0.00018039801,0.00040270833,0.00026272342,0.000324826],"domain_scores_gemma":[0.9991517,0.00026948258,0.00004353638,0.00040686384,0.000042074,0.00008632479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026171745,0.00016762114,0.00023388339,0.00021528793,0.00028777783,0.00018086599,0.00049893407,0.00005493992,0.000012242122],"category_scores_gemma":[0.00004598854,0.00012436892,0.0000677227,0.0003838082,0.00009541539,0.00018766658,0.0002294514,0.00020840617,0.000002354493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013156632,0.000016257995,0.00015285688,0.000019316592,0.000048229664,0.000014149039,0.00013890918,0.0006745905,0.0003037137,0.4412617,0.0002339457,0.55700475],"study_design_scores_gemma":[0.01398163,0.0004065076,0.010591273,0.00016222782,0.000022176151,0.000030064932,0.00021876286,0.08993995,0.011735929,0.84083205,0.03146385,0.00061557593],"about_ca_topic_score_codex":0.000011563116,"about_ca_topic_score_gemma":0.000004465107,"teacher_disagreement_score":0.9340826,"about_ca_system_score_codex":0.000033288376,"about_ca_system_score_gemma":0.0000368805,"threshold_uncertainty_score":0.50716174},"labels":[],"label_agreement":null},{"id":"W4412969805","doi":"10.1090/proc/17320","title":"Open graphs and Tukey order","year":2025,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Artificial intelligence; Annotation","score_opus":0.019396964075518497,"score_gpt":0.3205074959984511,"score_spread":0.3011105319229326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412969805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8180584,0.0009337654,0.04370107,0.042620845,0.00028445027,0.0040283287,0.000029040102,0.0002495564,0.09009456],"genre_scores_gemma":[0.73713,0.00053961173,0.25167412,0.0032315783,0.000027984124,0.00013269634,2.7971103e-7,0.000050488314,0.0072132573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974179,0.000040011102,0.0005502235,0.0007241489,0.0006289325,0.0006387602],"domain_scores_gemma":[0.99750787,0.0005560438,0.0005561646,0.0005174036,0.00068994873,0.0001725913],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015194397,0.00032251762,0.0007928621,0.00006992579,0.00047216896,0.00065965496,0.005006395,0.00008134272,0.000026235717],"category_scores_gemma":[0.001013174,0.00022355889,0.00034589073,0.00387291,0.003604868,0.0006771423,0.008339518,0.0005618521,0.000011627511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003592011,0.00022971228,0.0022863639,0.00069562846,0.00022205868,1.7403667e-7,0.0021076563,0.0000010279495,0.002922484,0.97757524,0.0057930825,0.008130658],"study_design_scores_gemma":[0.00040919989,0.0001380705,0.002418135,0.00050308014,0.000075370815,0.000007941855,0.0025271508,0.009743363,0.002713272,0.9804996,0.000711502,0.00025329468],"about_ca_topic_score_codex":0.000036688907,"about_ca_topic_score_gemma":4.493336e-7,"teacher_disagreement_score":0.20797305,"about_ca_system_score_codex":0.00006988175,"about_ca_system_score_gemma":0.00016241184,"threshold_uncertainty_score":0.9996808},"labels":[],"label_agreement":null},{"id":"W4413071390","doi":"10.1007/978-3-031-98740-3_10","title":"Covering Vertices by $$4^+$$-Paths: A Simpler Local Search Coupled with a More Delicate Amortization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Amortization; Algorithm","score_opus":0.014650625266111888,"score_gpt":0.281982273973631,"score_spread":0.26733164870751913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413071390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047561806,0.00051834097,0.9963493,0.00077308953,0.00025388628,0.0006925359,0.000012620365,0.00022464558,0.00069998746],"genre_scores_gemma":[0.6865821,0.00017962353,0.308683,0.0027567488,0.00019305115,0.00007647307,0.0000398873,0.00010607981,0.0013830728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448377,0.00006719961,0.00051742507,0.0020165206,0.0018354733,0.0010796387],"domain_scores_gemma":[0.99649566,0.00073834293,0.00019706386,0.0016995021,0.00060117076,0.0002682454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095359306,0.00060760067,0.0005847827,0.0010288198,0.00040539104,0.0006760963,0.0040288297,0.00027177477,0.000018322307],"category_scores_gemma":[0.00008635197,0.0005176487,0.00009727831,0.0017956953,0.0016675584,0.0010008296,0.0019748663,0.0011098591,0.000021329932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009567442,0.00006712997,0.000220707,0.0001683013,0.000050009057,0.00019203282,0.0010746887,0.41523713,0.0007794197,0.025370631,0.000063462496,0.5566808],"study_design_scores_gemma":[0.00043905922,0.000246263,0.000057224304,0.00047427003,0.00000955284,0.000037325968,9.2035924e-7,0.96422255,0.0023466698,0.030930402,0.0006178312,0.00061791786],"about_ca_topic_score_codex":0.00006325838,"about_ca_topic_score_gemma":0.00009131443,"teacher_disagreement_score":0.6876663,"about_ca_system_score_codex":0.0004868582,"about_ca_system_score_gemma":0.0010277831,"threshold_uncertainty_score":0.9997275},"labels":[],"label_agreement":null},{"id":"W4413073558","doi":"10.37236/13247","title":"Clustered Colouring of Graph Products","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Bounded function; Discrete mathematics; Cluster analysis; 1-planar graph; Pathwidth; Degree (music); Partial k-tree; Graph; Chordal graph; Line graph","score_opus":0.008809648612104325,"score_gpt":0.26838149700915837,"score_spread":0.25957184839705405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413073558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2631531,0.010992258,0.71635324,0.0060532046,0.0011275647,0.0003508684,3.4886e-7,0.000037538346,0.0019318856],"genre_scores_gemma":[0.9987514,0.0004483796,0.00024420305,0.000048087648,0.000021585796,0.0000020082318,5.779385e-8,0.000006329043,0.00047796828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982298,0.00025411425,0.00042507984,0.00013344141,0.00046573323,0.00049181416],"domain_scores_gemma":[0.99803215,0.00033860264,0.00037712042,0.00056852424,0.0006421779,0.00004140655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022415493,0.00010727703,0.00025492028,0.00033630495,0.00012699145,0.000036464182,0.0021695958,0.00003914223,0.0000011507201],"category_scores_gemma":[0.00030618845,0.00007440017,0.00010663234,0.0019810488,0.00011543475,0.0002849193,0.00027574858,0.00070346124,0.0000011469823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005450655,0.00009313427,0.00012604825,0.000025775675,0.000081298866,0.000004167598,0.00015814413,0.00016946123,0.0018303307,0.9957452,0.00022397634,0.0014879507],"study_design_scores_gemma":[0.0006366162,0.0004063282,0.00025412795,0.00004531737,0.000016101556,0.00005187877,0.000040498977,0.0003096667,0.03058091,0.96625704,0.0013376662,0.000063871215],"about_ca_topic_score_codex":0.0000014176328,"about_ca_topic_score_gemma":0.0000010449975,"teacher_disagreement_score":0.73559827,"about_ca_system_score_codex":0.00017845053,"about_ca_system_score_gemma":0.0008401196,"threshold_uncertainty_score":0.4031685},"labels":[],"label_agreement":null},{"id":"W4413106090","doi":"10.55016/ojs/cdm.v4i1.61874","title":"The search for N-e.c. graphs","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Mathematics","score_opus":0.02301138307289361,"score_gpt":0.3528199337561546,"score_spread":0.329808550683261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010706183,0.00012672633,0.97875476,0.017469607,0.000095185795,0.0010289174,0.00007382116,0.00015679472,0.0012235644],"genre_scores_gemma":[0.7826311,0.00004285631,0.21455972,0.0005940283,0.00008960235,0.0003490813,0.000014284089,0.000021107058,0.0016982292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983443,0.00006767364,0.00029572865,0.00027456586,0.00035887875,0.0006588455],"domain_scores_gemma":[0.9970627,0.0010861555,0.000051527048,0.0010565209,0.00052963995,0.00021345307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012712392,0.00014087187,0.00017387675,0.00012244585,0.001004234,0.000371243,0.0015389564,0.000046770037,0.0000027584674],"category_scores_gemma":[0.0009136327,0.00009454386,0.00014477476,0.0008284884,0.000102929356,0.00022027202,0.00019239153,0.00015301007,0.00007677072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000791139,0.00003484732,0.0000025951076,0.0000051639167,0.000011451663,9.967085e-7,0.00026256108,0.00007210246,0.00065114885,0.98917174,0.0013790956,0.008400371],"study_design_scores_gemma":[0.0002861198,0.00020642449,0.000098050616,0.000020373316,0.0000062704726,0.000007681499,0.00009317331,0.02331518,0.004886234,0.9616657,0.009260784,0.00015403387],"about_ca_topic_score_codex":5.1604115e-7,"about_ca_topic_score_gemma":0.0000018053095,"teacher_disagreement_score":0.7815605,"about_ca_system_score_codex":0.00007462225,"about_ca_system_score_gemma":0.000080829974,"threshold_uncertainty_score":0.77238566},"labels":[],"label_agreement":null},{"id":"W4413186111","doi":"10.55016/ojs/cdm.v5i2.62764","title":"Generalized CPR-graphs and applications","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.012707080345668788,"score_gpt":0.31933515415495034,"score_spread":0.30662807380928153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0144081125,0.00006989601,0.9810404,0.0018501887,0.00007065054,0.0007757899,0.00009803573,0.00024339503,0.0014435049],"genre_scores_gemma":[0.45826522,0.000029474593,0.5396684,0.0002832446,0.00007845761,0.00090007746,0.000021236805,0.000025410389,0.0007284883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876505,0.0000372335,0.0002625408,0.00032989105,0.00023279079,0.00037248066],"domain_scores_gemma":[0.9980731,0.00025547613,0.00006704588,0.0010151212,0.00028225966,0.000306967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004725461,0.00014667005,0.00019640556,0.000192015,0.00038212855,0.00021908071,0.0007839105,0.00007137931,0.000024292112],"category_scores_gemma":[0.0004065181,0.00012893118,0.00006475675,0.0007564534,0.00016177556,0.0002471961,0.00040868123,0.0002516743,0.00012105305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013218806,0.000036509948,0.00002795739,0.000010504067,0.000011236116,0.0000010523123,0.00015226581,0.00000816116,0.011194914,0.9854153,0.00020129127,0.0029395195],"study_design_scores_gemma":[0.00033583064,0.00003036238,0.00015892701,0.000009926628,0.000011241952,0.000030366838,0.000032224496,0.009313054,0.0034346895,0.9644384,0.021984264,0.00022071622],"about_ca_topic_score_codex":0.0000023091536,"about_ca_topic_score_gemma":0.000012064325,"teacher_disagreement_score":0.4438571,"about_ca_system_score_codex":0.00002030921,"about_ca_system_score_gemma":0.000050245242,"threshold_uncertainty_score":0.5257661},"labels":[],"label_agreement":null},{"id":"W4413186243","doi":"10.55016/ojs/cdm.v6i2.62059","title":"A variant of the bipartite relation theorem and its application to clique graphs","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Clique; Bipartite graph; Clique graph; Robertson–Seymour theorem; Discrete mathematics; Cograph; Relation (database); Chordal graph; Graph; 1-planar graph; Line graph; Computer science; Voltage graph","score_opus":0.02114390511315031,"score_gpt":0.29782461520389014,"score_spread":0.27668071009073986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03276019,0.000048459733,0.96392745,0.0010489009,0.00003955101,0.0010828967,0.00005447776,0.000056528792,0.0009815188],"genre_scores_gemma":[0.96324533,0.000006883196,0.036402274,0.00008428408,0.000007939406,0.00017206474,0.0000018120303,0.000008722862,0.00007071003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885505,0.00011220932,0.00032154453,0.0002451803,0.00022803183,0.00023796046],"domain_scores_gemma":[0.998423,0.0001849665,0.0001322587,0.0007889837,0.0003292358,0.00014157727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881207,0.00011151331,0.00016240733,0.00014164422,0.00019464639,0.00003267722,0.0006909408,0.00005383387,0.000005926892],"category_scores_gemma":[0.00076637825,0.000078312834,0.00006065133,0.0010299871,0.00007190458,0.00020909931,0.00043257995,0.00011213343,0.000036212743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007448842,0.00003929496,0.00007363848,0.000016124206,0.00001141367,4.052872e-7,0.0021106873,0.000045621822,0.0052768616,0.99186945,0.00001614614,0.00053289515],"study_design_scores_gemma":[0.00017217941,0.000081778504,0.003338005,0.00007012484,0.000016475893,0.000011987286,0.00006549905,0.025046622,0.024073632,0.9467475,0.0002396431,0.00013657533],"about_ca_topic_score_codex":0.000003838861,"about_ca_topic_score_gemma":0.000006377179,"teacher_disagreement_score":0.9304851,"about_ca_system_score_codex":0.00003570018,"about_ca_system_score_gemma":0.000040984938,"threshold_uncertainty_score":0.31935045},"labels":[],"label_agreement":null},{"id":"W4413186403","doi":"10.55016/ojs/cdm.v7i2.62089","title":"Domination Value in Graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Value (mathematics); Statistics","score_opus":0.018171568515713735,"score_gpt":0.33151473795935527,"score_spread":0.31334316944364154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024073409,0.00014594324,0.9715411,0.0011603737,0.0001385685,0.0004996681,0.000028602019,0.000108019885,0.0023042806],"genre_scores_gemma":[0.8994138,0.0000068698937,0.100177094,0.000079420184,0.000031215684,0.00011562802,0.0000066406133,0.000010073052,0.00015921576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984692,0.0001139168,0.0003130718,0.00019625062,0.00031417725,0.00059339346],"domain_scores_gemma":[0.99855375,0.00035798023,0.00006632935,0.000636371,0.00015735385,0.00022822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012623019,0.00013117983,0.00019169536,0.00037125876,0.00013699387,0.00008738548,0.0006635634,0.000058470738,0.000014193653],"category_scores_gemma":[0.001095857,0.000118897166,0.00006949975,0.0012965534,0.000054684442,0.000728897,0.00029385136,0.00015988591,0.00023718755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023225875,0.00010354314,0.00029452407,0.00001135491,0.000005718287,0.0000014204321,0.0011143406,0.00014013116,0.0007293367,0.9964364,0.000116349176,0.0010445488],"study_design_scores_gemma":[0.000589351,0.000054268596,0.0030919632,0.00007578382,0.000008349939,0.000018123354,0.00018999267,0.03215652,0.005411545,0.95627713,0.0018093876,0.00031759788],"about_ca_topic_score_codex":0.0000038446888,"about_ca_topic_score_gemma":0.0000028042034,"teacher_disagreement_score":0.8753404,"about_ca_system_score_codex":0.00016049795,"about_ca_system_score_gemma":0.00003650729,"threshold_uncertainty_score":0.48484856},"labels":[],"label_agreement":null},{"id":"W4413186462","doi":"10.55016/ojs/cdm.v7i1.62115","title":"On characterizing game-perfect graphs by forbidden induced subgraphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.02203298500575682,"score_gpt":0.32223342822638623,"score_spread":0.3002004432206294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.318593,0.00015586351,0.6765918,0.0013092619,0.00030136347,0.0009131345,0.00021228663,0.00034612766,0.0015771831],"genre_scores_gemma":[0.9901246,0.000012258797,0.008910265,0.00041966248,0.000056761754,0.0002127338,0.00003470199,0.000033849665,0.00019518711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731064,0.00016090553,0.00043927477,0.00041105764,0.00056052924,0.0011176134],"domain_scores_gemma":[0.997168,0.00064575055,0.00015521771,0.001240111,0.00022590553,0.0005650261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011070938,0.00031734788,0.0003852301,0.00039601306,0.00036193678,0.00023806843,0.0011917489,0.00012250926,0.000037726484],"category_scores_gemma":[0.0010894556,0.0002768008,0.00019607793,0.0012997596,0.000082471,0.0008321598,0.00038435357,0.00037188164,0.00047156223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011700117,0.00021454386,0.00013590828,0.000023393983,0.00004547581,0.0000023747389,0.0010900444,0.0000029927412,0.04073742,0.95476216,0.0014255233,0.0015484497],"study_design_scores_gemma":[0.0020497749,0.0010366295,0.0021257366,0.00042937562,0.00008284453,0.00008069921,0.00038005624,0.006931513,0.18346302,0.7900946,0.011300106,0.0020256038],"about_ca_topic_score_codex":0.0000033322815,"about_ca_topic_score_gemma":0.0000010722647,"teacher_disagreement_score":0.6715316,"about_ca_system_score_codex":0.00014593927,"about_ca_system_score_gemma":0.000046277768,"threshold_uncertainty_score":0.9999684},"labels":[],"label_agreement":null},{"id":"W4413187066","doi":"10.55016/ojs/cdm.v3i2.61934","title":"Colourful transversal theorems","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Transversal (combinatorics); Mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.02085932868845986,"score_gpt":0.3110499104651051,"score_spread":0.29019058177664525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015750818,0.00006526293,0.976136,0.0024838112,0.0001095397,0.0005289917,0.00009842996,0.0002981409,0.0045289923],"genre_scores_gemma":[0.8869235,0.000020142863,0.1116948,0.00019567664,0.000050674116,0.000094713294,0.000009115695,0.000019615754,0.0009917739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823207,0.000092213544,0.00032838105,0.00033611295,0.0004407087,0.00057051994],"domain_scores_gemma":[0.9979704,0.00039580633,0.0000660112,0.000936018,0.0003194448,0.00031229688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005090299,0.00018560709,0.00027300318,0.00018007339,0.00050984323,0.000083734696,0.0012314037,0.00007213012,0.000053731954],"category_scores_gemma":[0.00063677394,0.00015995771,0.0001377755,0.0009199492,0.00022907775,0.0003499892,0.0002545179,0.00020668707,0.00053028273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007764615,0.00008283349,0.00002434022,0.000009281917,0.000022875069,0.000034113862,0.0017808594,0.00014334309,0.0014718802,0.9950134,0.0010212949,0.0003880221],"study_design_scores_gemma":[0.0014901782,0.00038763296,0.00040611345,0.00007847475,0.000027213739,0.0003677415,0.00033608678,0.050890144,0.016037581,0.91066635,0.018500088,0.00081240205],"about_ca_topic_score_codex":0.000002182258,"about_ca_topic_score_gemma":0.0000025103213,"teacher_disagreement_score":0.87117267,"about_ca_system_score_codex":0.00011372748,"about_ca_system_score_gemma":0.00012830054,"threshold_uncertainty_score":0.6815888},"labels":[],"label_agreement":null},{"id":"W4413187103","doi":"10.55016/ojs/cdm.v3i2.62003","title":"Partially critical indecomposable graphs","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Indecomposable module; Discrete mathematics","score_opus":0.028750634360140834,"score_gpt":0.34725951642660197,"score_spread":0.3185088820664611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007889304,0.00008773786,0.98479253,0.003670867,0.00014400695,0.0003890235,0.00007416357,0.0003028642,0.002649516],"genre_scores_gemma":[0.7965567,0.000015739837,0.20261692,0.0002622497,0.00004286569,0.00011520899,0.0000075007456,0.000017823431,0.00036497277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785405,0.00010703918,0.0004197899,0.000392683,0.0005045856,0.00072187406],"domain_scores_gemma":[0.9972211,0.00071199605,0.00005490565,0.00106318,0.00050048856,0.00044834192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000538977,0.00019607494,0.00030292483,0.00022779539,0.0006640312,0.00014128511,0.0011915343,0.00007994295,0.0000572959],"category_scores_gemma":[0.0022779787,0.00017714672,0.0001392314,0.0010664195,0.00029164468,0.0005104638,0.0005117576,0.00024497663,0.00062306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048031106,0.00012168535,0.000103885504,0.000014231065,0.000015998927,0.000042020012,0.000491529,0.000120008626,0.00070389925,0.99667346,0.0014986116,0.00020987527],"study_design_scores_gemma":[0.00044978672,0.00017804108,0.00044400487,0.000054913413,0.000012815514,0.00019910566,0.000058629223,0.027717993,0.005699949,0.9595566,0.005208965,0.0004192291],"about_ca_topic_score_codex":0.0000022995334,"about_ca_topic_score_gemma":0.000003446144,"teacher_disagreement_score":0.78866744,"about_ca_system_score_codex":0.00008439885,"about_ca_system_score_gemma":0.00015447012,"threshold_uncertainty_score":0.80083835},"labels":[],"label_agreement":null},{"id":"W4413232290","doi":"10.1007/978-3-032-00281-5_8","title":"The Two-Squirrel Problem and Its Relatives","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Squirrel monkey; Theoretical computer science; Biology; Ecology","score_opus":0.018986700502872562,"score_gpt":0.29215149539107527,"score_spread":0.2731647948882027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413232290","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018238887,0.003904068,0.9752673,0.0021927813,0.00067730236,0.0006100682,0.0000030270128,0.00012600422,0.017201208],"genre_scores_gemma":[0.10926171,0.0015538022,0.8638591,0.001878592,0.0005952192,0.00009822584,0.0000037382592,0.000092877795,0.022656731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962525,0.00009836432,0.00041709706,0.0015084809,0.00093939435,0.0007841879],"domain_scores_gemma":[0.99560827,0.002407813,0.00019423792,0.0013119482,0.00031722593,0.00016050006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017025237,0.00044799858,0.00037481732,0.0006545967,0.00088092306,0.00075340155,0.00424756,0.00018747193,0.000004080338],"category_scores_gemma":[0.000261596,0.00031707773,0.00008710147,0.0009238247,0.001501188,0.0007249269,0.0033768192,0.0012323299,0.000021101097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000548144,0.000005435564,0.000008693501,0.000019748499,0.000008192972,0.000020167796,0.00031193698,0.002217982,0.00005907335,0.6008156,0.000011660131,0.39651603],"study_design_scores_gemma":[0.00019128982,0.000088497225,0.000025955122,0.0002908169,0.000003114379,0.000029160818,1.8187657e-7,0.19119735,0.00039772413,0.80485356,0.002598573,0.0003238069],"about_ca_topic_score_codex":0.0000035905673,"about_ca_topic_score_gemma":0.000034123193,"teacher_disagreement_score":0.39619222,"about_ca_system_score_codex":0.0001638891,"about_ca_system_score_gemma":0.0005549814,"threshold_uncertainty_score":0.9999281},"labels":[],"label_agreement":null},{"id":"W4413241235","doi":"10.1002/rsa.70026","title":"Sidorenko‐Type Inequalities for Pairs of Trees","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McGill University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Mitacs; Pacific Institute for the Mathematical Sciences; University of Victoria","keywords":"Homomorphism; Mathematics; Combinatorics; Vertex (graph theory); Path (computing); Type (biology); Graph; Discrete mathematics; Computer science","score_opus":0.019395925844421836,"score_gpt":0.3092716544559079,"score_spread":0.289875728611486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413241235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041000113,0.0028711082,0.9538964,0.00047234024,0.00048926653,0.00051616214,0.00003519215,0.00007919447,0.00064019434],"genre_scores_gemma":[0.9243872,0.00016283775,0.07455464,0.00010245387,0.000059889415,0.000027529342,0.000005675313,0.000007644231,0.00069212046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991182,0.00006985655,0.00020791791,0.00024712883,0.00014573963,0.00021112943],"domain_scores_gemma":[0.99884886,0.00064877555,0.000057190213,0.00027415293,0.00012710271,0.00004392267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003032416,0.00011423863,0.0002746835,0.00015298584,0.00011817909,0.0000547092,0.00037315453,0.000048463837,0.000005470634],"category_scores_gemma":[0.00017249904,0.000085537875,0.00007216392,0.00030863713,0.00014779539,0.00014022223,0.00014120407,0.00007502301,1.4242555e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036283367,0.000014124258,0.00030688904,0.0001296116,0.00007541911,0.0000017169428,0.0005106554,0.00017335814,0.0013280095,0.7878062,0.00041341386,0.20887776],"study_design_scores_gemma":[0.0047344468,0.00019138253,0.001948357,0.000039123646,0.000012800376,0.000003865567,0.00020581509,0.017936056,0.01265185,0.95794874,0.004166475,0.00016111242],"about_ca_topic_score_codex":0.00001441586,"about_ca_topic_score_gemma":0.000008429789,"teacher_disagreement_score":0.8833871,"about_ca_system_score_codex":0.000006963968,"about_ca_system_score_gemma":0.00004560061,"threshold_uncertainty_score":0.34881333},"labels":[],"label_agreement":null},{"id":"W4413297002","doi":"10.1007/s00236-025-00503-0","title":"On the 3-tree core of plane graphs","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Bangladesh University of Engineering and Technology","keywords":"Theory of computation; Core (optical fiber); Tree (set theory); Combinatorics; Mathematics; Computer science; Plane (geometry); Discrete mathematics; Algorithm; Geometry; Telecommunications","score_opus":0.02111892525438423,"score_gpt":0.2857842315970918,"score_spread":0.2646653063427076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413297002","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23258331,0.000053358337,0.12310242,0.008271416,0.00040193248,0.0009184903,0.000015488433,0.0002442017,0.63440937],"genre_scores_gemma":[0.9957093,0.000009429232,0.0028977327,0.0010475147,0.000002300979,0.000015265,0.000001465344,0.0000021342626,0.00031486253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991937,0.00002734473,0.00022747752,0.000078539415,0.00027467764,0.00019823085],"domain_scores_gemma":[0.9980624,0.0009644598,0.00007164578,0.00080742314,0.000060728664,0.000033358636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035518443,0.00007799948,0.00010817695,0.00017955681,0.00009977388,0.00004204346,0.0013905528,0.0000307534,0.00003124029],"category_scores_gemma":[0.00030688415,0.000047374004,0.00004752221,0.00067132496,0.00013340708,0.00035074184,0.00029664976,0.0001731314,0.00005720795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011908391,0.000014662606,0.000056400553,0.000022836171,0.000014712721,6.2426403e-7,0.00038308263,0.000010669085,0.00012964726,0.9855483,0.0049721003,0.008835013],"study_design_scores_gemma":[0.0002914296,0.0001521762,0.0016271046,0.00009812783,0.0000038135247,0.0000037236514,0.0001816589,0.013239758,0.0055704773,0.97132874,0.0073928884,0.00011013578],"about_ca_topic_score_codex":0.0000021093556,"about_ca_topic_score_gemma":0.0000017389665,"teacher_disagreement_score":0.76312596,"about_ca_system_score_codex":0.000011019897,"about_ca_system_score_gemma":0.00004842043,"threshold_uncertainty_score":0.25840163},"labels":[],"label_agreement":null},{"id":"W4413431503","doi":"10.1016/j.disc.2025.114746","title":"Oriented colouring graphs of bounded degree and degeneracy","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Illinois at Urbana-Champaign","keywords":"Mathematics; Degree (music); Bounded function; Degeneracy (biology); Combinatorics; Discrete mathematics","score_opus":0.02541250570613969,"score_gpt":0.3095260943351586,"score_spread":0.2841135886290189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413431503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30612975,0.00021987346,0.6884275,0.00014841055,0.00006588355,0.0001975369,0.0000032099001,0.00006379437,0.004743999],"genre_scores_gemma":[0.7006484,0.00003580337,0.29870287,0.000039575483,0.0000042843685,0.000018363422,0.0000013182159,0.000009134243,0.0005402252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989857,0.000047182708,0.00028104868,0.00022609757,0.00022934939,0.00023059342],"domain_scores_gemma":[0.9988856,0.00027596715,0.00009957138,0.00057256914,0.00010684301,0.000059487425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035419603,0.0001157434,0.00021373975,0.00021778747,0.00011721196,0.00006275719,0.00053517555,0.000040018487,0.0000041105027],"category_scores_gemma":[0.00020442544,0.00009908928,0.000053599797,0.00070204365,0.00017248253,0.00020846903,0.0004506575,0.00010483896,0.0000025715258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005062276,0.000035686335,0.00058718637,0.00016004671,0.000027472659,0.000003210135,0.00064175006,0.000008236459,0.0018999514,0.9939054,0.000030391744,0.0026956105],"study_design_scores_gemma":[0.00039789974,0.00004929123,0.0007110145,0.00014340426,0.000012965252,0.000006576421,0.00024315744,0.024810512,0.023304569,0.94994,0.00024465017,0.00013594882],"about_ca_topic_score_codex":0.0000031605232,"about_ca_topic_score_gemma":0.0000060001644,"teacher_disagreement_score":0.39451864,"about_ca_system_score_codex":0.000016320184,"about_ca_system_score_gemma":0.000045997265,"threshold_uncertainty_score":0.40407437},"labels":[],"label_agreement":null},{"id":"W4413472841","doi":"10.61091/jcmcc126-24","title":"The polychromatic domination number","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.010896539075305703,"score_gpt":0.2957728304822263,"score_spread":0.2848762914069206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413472841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3348408,0.0012124333,0.6094602,0.002629841,0.040600386,0.00073489535,6.894839e-7,0.00012966743,0.010391146],"genre_scores_gemma":[0.9842646,0.00006468369,0.015193523,0.00003598106,0.00036866474,0.0000028724703,1.408028e-7,0.000013664422,0.00005587563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743104,0.00023439783,0.001010117,0.0002025136,0.00074167945,0.00038025464],"domain_scores_gemma":[0.9950763,0.002832924,0.0007743741,0.00047693792,0.0007137452,0.00012571596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032939152,0.00021583063,0.00046907258,0.00019522279,0.00077678415,0.00067870435,0.0014341234,0.00010501062,0.0000018173274],"category_scores_gemma":[0.0012037485,0.00015385503,0.00016185801,0.00081829575,0.0001713146,0.0004379187,0.00059216237,0.00050965365,0.0000047291555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033707976,0.00015362952,0.000098159064,0.00006251917,0.000073504365,0.0000092401415,0.0003631223,0.000008200647,0.00019953997,0.98951316,0.00032705636,0.00915815],"study_design_scores_gemma":[0.0020686924,0.00017170107,0.00014263428,0.00022700004,0.000026004098,0.000070417744,0.00017073378,0.012305423,0.00075718574,0.98232484,0.0015904551,0.00014489575],"about_ca_topic_score_codex":0.0000020569612,"about_ca_topic_score_gemma":1.8610734e-7,"teacher_disagreement_score":0.6494238,"about_ca_system_score_codex":0.00010556722,"about_ca_system_score_gemma":0.00022469345,"threshold_uncertainty_score":0.65447617},"labels":[],"label_agreement":null},{"id":"W4413682142","doi":"10.1007/s00012-025-00900-z","title":"Słupecki digraphs","year":2025,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Szegedi Tudományegyetem","keywords":"Mathematics; Algebra over a field; Digraph; Pure mathematics; Combinatorics","score_opus":0.008265318919469853,"score_gpt":0.2577459259912336,"score_spread":0.24948060707176373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413682142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017381933,0.00043792682,0.83865744,0.0034067067,0.0003831766,0.00020483935,0.000004129437,0.00054944394,0.1389744],"genre_scores_gemma":[0.97557354,0.00008563077,0.013035205,0.0009786729,0.000020666015,0.000007039867,0.0000037337888,0.000010384579,0.010285111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892294,0.000081113525,0.00010702155,0.0003612338,0.0002033206,0.00032435177],"domain_scores_gemma":[0.9988472,0.00017018564,0.000027900416,0.00078047917,0.000089418914,0.00008481862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016453235,0.00011134115,0.00011778408,0.00043540914,0.00016153694,0.0000895324,0.0014075474,0.000050584356,0.000044249125],"category_scores_gemma":[0.00005111772,0.0001119464,0.000083964325,0.0017319723,0.0001307728,0.00068058015,0.0004459723,0.00015406846,0.00007387724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062264453,0.000020160574,0.0005207005,0.0000046913137,0.000025740794,0.000027733024,0.0001530009,0.0000070112906,0.00043633164,0.9806201,0.0029592172,0.015219106],"study_design_scores_gemma":[0.0007547225,0.00006752182,0.00268834,0.00003848044,0.000011091026,0.0000057911166,0.00023653281,0.0020747979,0.008215023,0.81017596,0.17542091,0.00031081145],"about_ca_topic_score_codex":0.00003358869,"about_ca_topic_score_gemma":0.000014743632,"teacher_disagreement_score":0.95819163,"about_ca_system_score_codex":0.000050071067,"about_ca_system_score_gemma":0.00008888839,"threshold_uncertainty_score":0.45650417},"labels":[],"label_agreement":null},{"id":"W4413812704","doi":"10.4171/owr/2025/1","title":"Graph Theory","year":2025,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Georgia Institute of Technology; Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Georgia State University; National Science Foundation","keywords":"Graph theory; Computer science; Graph; Focus (optics); Theoretical computer science; Mathematics; Combinatorics; Physics","score_opus":0.0126850914085572,"score_gpt":0.2899782201441894,"score_spread":0.27729312873563217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413812704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111072315,0.0007389823,0.8332075,0.00059403933,0.00077251747,0.00024332637,5.303593e-7,0.00040546202,0.15293041],"genre_scores_gemma":[0.9561571,0.000025366648,0.019341156,0.00058269134,0.000029065232,0.0000632412,0.0000025579986,0.000013029291,0.023785781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980921,0.00017194732,0.00035536458,0.0006036679,0.00035422054,0.0004226594],"domain_scores_gemma":[0.99784726,0.00021741589,0.00010853053,0.0015949173,0.00012628215,0.00010562017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014463695,0.00015048053,0.00017913357,0.0003471771,0.00020573057,0.00012435595,0.0007083245,0.000070378795,0.00004889016],"category_scores_gemma":[0.00031890144,0.0001349543,0.00012326823,0.001229041,0.00013090397,0.00041718181,0.0004788121,0.00023658764,0.0000364567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064701467,0.000048107853,0.003350127,0.000012992482,0.000029448684,0.00058065815,0.00007006218,0.000040490035,0.0008379565,0.92922276,0.0019980348,0.06380286],"study_design_scores_gemma":[0.000088778506,0.00001979178,0.00399028,0.000021919755,0.0000044316507,0.00015848548,0.000015539186,0.00015598089,0.0056455806,0.9599665,0.02978864,0.00014407282],"about_ca_topic_score_codex":0.000007111426,"about_ca_topic_score_gemma":0.0000031565385,"teacher_disagreement_score":0.9450499,"about_ca_system_score_codex":0.000041165953,"about_ca_system_score_gemma":0.00013602598,"threshold_uncertainty_score":0.55032766},"labels":[],"label_agreement":null},{"id":"W4413876268","doi":"10.4153/s0008414x2510151x","title":"On the <i>f</i> -vectors of flow polytopes for the complete graph","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université du Québec à Montréal; National Science Foundation","keywords":"Mathematics; Polytope; Combinatorics; Graph; Flow (mathematics); Geometry","score_opus":0.036441054005416786,"score_gpt":0.2770330724317701,"score_spread":0.24059201842635333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413876268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010218577,0.000673386,0.97717935,0.009979143,0.00041628728,0.00035257146,0.000026252537,0.0000054039483,0.0011490339],"genre_scores_gemma":[0.92429096,0.000040872434,0.07338761,0.0016993368,0.00006706229,0.000015990892,3.4230234e-7,0.000019092255,0.00047873348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990724,0.00006614736,0.00033532953,0.00007430237,0.0002123101,0.00023953778],"domain_scores_gemma":[0.9960021,0.0029044764,0.00020886131,0.00049230724,0.00026516442,0.00012709023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011729873,0.00008837427,0.00018627725,0.0002573142,0.00025889464,0.000080246304,0.0017378367,0.000026044032,0.000012884829],"category_scores_gemma":[0.0008166881,0.000045796707,0.00016228859,0.0005079854,0.00021366439,0.000083361534,0.000035090332,0.00020223999,0.000002148147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004284234,0.000014126601,0.000030759962,0.000037420275,0.0000705604,0.000004547802,0.00067280873,0.00069082325,0.00010922326,0.9891799,0.0063757254,0.0028098198],"study_design_scores_gemma":[0.00026272883,0.000146611,0.0001281788,0.00023130036,0.000025063853,0.000029379746,0.00051756436,0.017315188,0.0017638807,0.9712909,0.008206942,0.000082270104],"about_ca_topic_score_codex":0.00005732769,"about_ca_topic_score_gemma":0.001061588,"teacher_disagreement_score":0.9140724,"about_ca_system_score_codex":0.000040122595,"about_ca_system_score_gemma":0.0005345505,"threshold_uncertainty_score":0.32293618},"labels":[],"label_agreement":null},{"id":"W4413980878","doi":"10.61091/ojac20-02","title":"A note on plane trees with decreasing labels","year":2025,"lang":"en","type":"article","venue":"Online Journal of Analytic Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Plane (geometry); Computer science; Mathematics; Geometry","score_opus":0.014187209113237112,"score_gpt":0.31373094282946057,"score_spread":0.29954373371622345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413980878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41415772,0.0007607933,0.5750856,0.005644113,0.0006951654,0.00018331333,0.000006551763,0.00007061987,0.0033961413],"genre_scores_gemma":[0.9770345,0.00011262964,0.021602351,0.00026015614,0.00004647895,5.7662e-7,0.0000012509025,0.000011371736,0.0009306905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983259,0.000108471446,0.00040753445,0.00020603083,0.0006632019,0.000288877],"domain_scores_gemma":[0.9979343,0.0006245863,0.00029366,0.00047285875,0.0005104993,0.00016409653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000624073,0.00016252961,0.00035983764,0.0007386051,0.000114208364,0.000107444015,0.0010845031,0.000051928855,0.0000048450906],"category_scores_gemma":[0.0003594572,0.0001186378,0.00010541801,0.0018425294,0.00006983568,0.00030922293,0.00013568286,0.0005305635,0.0000030978995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054236955,0.0017367882,0.006413264,0.00005360447,0.00032758008,0.00094202167,0.00021714096,0.0025873955,0.00045168272,0.94367176,0.0008249535,0.042231463],"study_design_scores_gemma":[0.008736769,0.006287696,0.02007338,0.0019171532,0.00024696768,0.0007380629,0.00023894606,0.07070404,0.0038768556,0.8753487,0.011041093,0.0007903185],"about_ca_topic_score_codex":0.0000041438575,"about_ca_topic_score_gemma":0.000013159429,"teacher_disagreement_score":0.56287676,"about_ca_system_score_codex":0.00017847624,"about_ca_system_score_gemma":0.00043948094,"threshold_uncertainty_score":0.4837909},"labels":[],"label_agreement":null},{"id":"W4414056840","doi":"10.1016/j.ic.2025.105355","title":"Polynomial Turing compressions for some graph problems parameterized by modular-width","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"China Scholarship Council","keywords":"Parameterized complexity; Turing machine; Oracle; Time complexity; Polynomial; Set (abstract data type); Turing; Kernelization","score_opus":0.015192233473038146,"score_gpt":0.2912174323092757,"score_spread":0.27602519883623755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414056840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03739016,0.00009093558,0.9607361,0.00065627694,0.0001862204,0.00054451096,0.000012217419,0.00014047667,0.00024310533],"genre_scores_gemma":[0.9518858,0.000026196754,0.047070153,0.00068861287,0.000012337203,0.00014552419,0.000096179865,0.0000039278357,0.00007126527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991905,0.00004367686,0.00029472425,0.00013999382,0.00014839545,0.0001827077],"domain_scores_gemma":[0.9994346,0.00015942656,0.00010760962,0.00014143146,0.00010069709,0.00005623934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022270785,0.00009722135,0.00011594475,0.00027608383,0.00027141938,0.00029383518,0.00023373583,0.000040529983,7.9198054e-7],"category_scores_gemma":[0.00003951131,0.000092406626,0.000041426636,0.00030267081,0.00004510559,0.00227702,0.00011671047,0.00008397593,0.00000427177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013552062,0.000086713146,0.00014356416,0.0002961603,0.00006452578,3.2966028e-7,0.0017381343,0.05471307,0.005434761,0.1312685,0.010059979,0.7960587],"study_design_scores_gemma":[0.001454457,0.0000679173,0.00054726296,0.000046549452,0.0000040462396,0.0000023172886,0.000045647863,0.88178885,0.002140286,0.103855655,0.009903645,0.00014336158],"about_ca_topic_score_codex":0.0000059212334,"about_ca_topic_score_gemma":4.1698067e-7,"teacher_disagreement_score":0.91449565,"about_ca_system_score_codex":0.00002328738,"about_ca_system_score_gemma":0.000035941594,"threshold_uncertainty_score":0.37682328},"labels":[],"label_agreement":null},{"id":"W4414056851","doi":"10.1016/j.jctb.2025.08.003","title":"Tree independence number II. Three-path-configurations","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Division of Computing and Communication Foundations; Ministry of Colleges and Universities; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; U.S. Air Force; Alfred P. Sloan Foundation","keywords":"Tree (set theory); Independence number; Independence (probability theory); Class (philosophy); Graph","score_opus":0.01070042686151122,"score_gpt":0.2865333438356005,"score_spread":0.27583291697408924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414056851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05795628,0.0006472302,0.8132339,0.0035492966,0.01828758,0.0004450879,0.000006501942,0.00017041984,0.105703704],"genre_scores_gemma":[0.9904978,0.000051442257,0.0066372408,0.0001545125,0.0003168086,0.000009372091,5.4024423e-7,0.000013352195,0.0023188929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769133,0.00039080824,0.0006136328,0.00023467018,0.00072000927,0.00034957312],"domain_scores_gemma":[0.9973842,0.0005786802,0.00036292334,0.0006324178,0.00089696987,0.0001448122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021751367,0.00019415654,0.00036762608,0.00027359312,0.0004635624,0.00020861824,0.0019871201,0.00013850123,0.0001574106],"category_scores_gemma":[0.00084639946,0.00016676745,0.00017782496,0.0011024999,0.00026973733,0.0021140743,0.00045817968,0.0007034765,0.0000200384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035892177,0.00012240837,0.00026895656,0.000009121653,0.00007386529,0.000050739625,0.0002780117,0.00001733469,0.0014035545,0.98640347,0.0010004464,0.010013147],"study_design_scores_gemma":[0.0009877419,0.0003371121,0.00041630855,0.00007001017,0.000015098767,0.000114699236,0.0001379043,0.000070652095,0.0069363103,0.97775275,0.01301171,0.00014971373],"about_ca_topic_score_codex":0.0000019251618,"about_ca_topic_score_gemma":0.0000038292023,"teacher_disagreement_score":0.93254155,"about_ca_system_score_codex":0.00008227373,"about_ca_system_score_gemma":0.00059060706,"threshold_uncertainty_score":0.68005794},"labels":[],"label_agreement":null},{"id":"W4414243250","doi":"10.5802/igt.10","title":"Product Structure of Graph Classes with Strongly Sublinear Separators","year":2025,"lang":"lv","type":"article","venue":"Innovations in Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford; Grantová Agentura České Republiky; Merton College, University of Oxford","keywords":"Sublinear function; Treewidth; Graph; Bounded function; Line graph; Voltage graph; Graph property; Graph factorization; Clique-width; Distance-hereditary graph","score_opus":0.015296409847241087,"score_gpt":0.3071461678948458,"score_spread":0.2918497580476047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414243250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8057329,0.0019372447,0.18580313,0.0009413486,0.0009355992,0.0013937765,0.00019866669,0.0001594085,0.0028979306],"genre_scores_gemma":[0.98362434,0.00006847066,0.015287218,0.0001595511,0.000056029003,0.000049437407,0.000034508746,0.000040487666,0.00067996146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951254,0.0008413557,0.0011806493,0.0011889137,0.00078714266,0.0008765206],"domain_scores_gemma":[0.9947926,0.000788403,0.00048382767,0.0021856902,0.001664343,0.00008512876],"candidate_categories":["metaepi_narrow","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0018006015,0.000539913,0.00067549414,0.0053042388,0.00034707593,0.00018856175,0.0021720566,0.00022952793,0.00006445788],"category_scores_gemma":[0.0006175195,0.0004823898,0.00014179037,0.029263474,0.001946197,0.0010496222,0.0004771277,0.0012374821,0.0000053414724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037062692,0.0003221239,0.032547638,0.00020554481,0.00024523877,0.000015813843,0.00062614295,0.0031391098,0.004868955,0.9504431,0.00033029303,0.006885445],"study_design_scores_gemma":[0.0013790702,0.00031744523,0.01896496,0.0005001542,0.00004457773,0.000012552781,0.0007979621,0.00052196445,0.025623305,0.9501587,0.0011234777,0.0005558325],"about_ca_topic_score_codex":0.000029965453,"about_ca_topic_score_gemma":0.00015141434,"teacher_disagreement_score":0.17789145,"about_ca_system_score_codex":0.00010905898,"about_ca_system_score_gemma":0.0010956731,"threshold_uncertainty_score":0.9997628},"labels":[],"label_agreement":null},{"id":"W4414474364","doi":"10.1016/j.disc.2025.114809","title":"On the structure of perfectly divisible graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique number; Induced subgraph; Graph; Perfect graph; Divisibility rule; Bounded function; Split graph; Clique graph","score_opus":0.014469867531054576,"score_gpt":0.29108378401340207,"score_spread":0.2766139164823475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414474364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2999051,0.00011581068,0.67643213,0.0013928228,0.00017104168,0.00052382296,0.000020523654,0.00011013289,0.021328632],"genre_scores_gemma":[0.9803785,0.000006015908,0.019007323,0.0001518439,0.0000039878573,0.0000051092156,8.637079e-7,0.0000074596805,0.0004388912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896705,0.00007798699,0.00021053331,0.0001960183,0.0003343569,0.00021407052],"domain_scores_gemma":[0.99791133,0.0008620435,0.000085050015,0.0010368248,0.00007355214,0.00003116624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002847371,0.0001221026,0.00017326111,0.00015389289,0.00013323894,0.00006896286,0.001314899,0.000039356648,0.000036290377],"category_scores_gemma":[0.0003020697,0.00007054463,0.00009388743,0.0008297845,0.00014655857,0.0001050747,0.0003224207,0.00019080455,0.000010291102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029128225,0.00002411503,0.000041310286,0.00007100797,0.00002278796,8.44179e-7,0.0005711702,0.0000749456,0.0044728797,0.993779,0.0002720527,0.00066695415],"study_design_scores_gemma":[0.00009167559,0.000044963912,0.0000901555,0.00008602374,0.00000501878,0.000001118469,0.00012271543,0.0094914995,0.03332243,0.9566137,0.00006159353,0.00006909219],"about_ca_topic_score_codex":0.0000012776219,"about_ca_topic_score_gemma":0.0000017400116,"teacher_disagreement_score":0.6804734,"about_ca_system_score_codex":0.000012515173,"about_ca_system_score_gemma":0.000035567493,"threshold_uncertainty_score":0.28767267},"labels":[],"label_agreement":null},{"id":"W4414537028","doi":"10.1007/s00208-025-03293-5","title":"A unified Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups","year":2025,"lang":"en","type":"article","venue":"Mathematische Annalen","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; Institute for Basic Science; Javna Agencija za Raziskovalno Dejavnost RS; National Research Foundation of Korea; National Research Foundation","keywords":"Abelian group; Bounded function; Vertex (graph theory); Duality (order theory); Modulo; Set (abstract data type)","score_opus":0.022734948312030764,"score_gpt":0.3052306350787034,"score_spread":0.28249568676667264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414537028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12769637,0.0017725868,0.85548884,0.003493287,0.00017857816,0.002013693,0.000067850495,0.00041405202,0.0088747805],"genre_scores_gemma":[0.9069217,0.00012776953,0.08724561,0.0005272475,0.000018597662,0.0006222051,0.000022634029,0.000041497136,0.0044727223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785244,0.00018259179,0.0004290725,0.0006019361,0.00029842765,0.0006355008],"domain_scores_gemma":[0.99766713,0.0010773012,0.00010975567,0.00091682695,0.00012576589,0.00010320921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381454,0.0002536751,0.00037729696,0.0004881213,0.00019865824,0.00013860274,0.0016001045,0.00011740564,0.000018010307],"category_scores_gemma":[0.00042511616,0.00022468575,0.00014409132,0.0013322053,0.00014209928,0.00045981782,0.00041091745,0.00025241074,0.0000416658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073368385,0.00024602414,0.0008525125,0.00018691723,0.00005792362,0.000008292181,0.0012647982,0.000024984123,0.007256379,0.9687177,0.005519496,0.015791634],"study_design_scores_gemma":[0.0016967268,0.00007710063,0.0004791341,0.00018223085,0.000007650833,0.0000035858784,0.00021750866,0.020606235,0.013371475,0.95750684,0.0055523887,0.00029915548],"about_ca_topic_score_codex":0.000018597888,"about_ca_topic_score_gemma":0.00006106267,"teacher_disagreement_score":0.77922535,"about_ca_system_score_codex":0.000034371802,"about_ca_system_score_gemma":0.00006254034,"threshold_uncertainty_score":0.9162419},"labels":[],"label_agreement":null},{"id":"W4414581267","doi":"10.61091/jcmcc127-15","title":"A study on roman domination lower deg-centric graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Domination analysis; Upper and lower bounds; Graph theory; Dominating set; Connectivity","score_opus":0.0164604518090323,"score_gpt":0.30108273144938125,"score_spread":0.2846222796403489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8996515,0.00018871199,0.07865416,0.00026255834,0.01817863,0.0007130702,5.6441394e-7,0.00007911361,0.002271654],"genre_scores_gemma":[0.99491584,0.000013357289,0.00470875,0.00003927278,0.00027978185,0.0000044043773,2.27495e-7,0.000019781282,0.000018599672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965618,0.0003677762,0.0011359643,0.0003818806,0.001107025,0.00044552336],"domain_scores_gemma":[0.9961238,0.0014879451,0.0008256942,0.00058127596,0.0007889279,0.00019233683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031961743,0.00032785,0.0007407467,0.0009483349,0.00043975082,0.00048143475,0.0013703144,0.00012967027,0.0000020838588],"category_scores_gemma":[0.0008922147,0.00028584752,0.00021274581,0.0015397058,0.000088510584,0.00044520455,0.00060924946,0.0007049152,0.0000036575452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013062725,0.002271357,0.0004121985,0.00005098672,0.00012849299,0.000091492766,0.00095204887,0.000033409808,0.00013541599,0.992219,0.00016383447,0.0034111773],"study_design_scores_gemma":[0.0066970685,0.0025152527,0.00079284713,0.00030383302,0.000056761644,0.000040408526,0.00047319086,0.003656813,0.00046606248,0.98447573,0.00025563192,0.00026639842],"about_ca_topic_score_codex":0.0000020771886,"about_ca_topic_score_gemma":1.8312242e-7,"teacher_disagreement_score":0.09526429,"about_ca_system_score_codex":0.00014726752,"about_ca_system_score_gemma":0.00018617036,"threshold_uncertainty_score":0.99995935},"labels":[],"label_agreement":null},{"id":"W4414581271","doi":"10.61091/jcmcc127-06","title":"The {2}-domination in rooted product graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Vertex (graph theory); Product (mathematics); Graph product; Line graph; Block graph; Connectivity","score_opus":0.012288716764623476,"score_gpt":0.28850146660855935,"score_spread":0.2762127498439359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79730344,0.0030206554,0.15794668,0.0031425809,0.034479905,0.0011244186,6.523086e-7,0.000101236175,0.0028804366],"genre_scores_gemma":[0.99331063,0.00009134095,0.006343218,0.000019237395,0.0002002274,0.0000037195866,1.6645423e-7,0.000011636509,0.000019797333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997321,0.0002858406,0.0010744281,0.00025486702,0.0006631842,0.0004006495],"domain_scores_gemma":[0.996111,0.0019756164,0.0006643847,0.00046391026,0.00069050386,0.00009461701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045188535,0.00021130769,0.00048220734,0.00049466064,0.00046253233,0.0004591657,0.0013554803,0.00008508937,4.7263268e-7],"category_scores_gemma":[0.001685079,0.00015651048,0.00012826116,0.0014616487,0.00014851156,0.0004281647,0.0005186821,0.0006530253,8.629431e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058874724,0.00021853801,0.00030342344,0.00005361811,0.000038086982,0.000013920042,0.00040662906,0.000037496317,0.00033419134,0.98626673,0.000111025045,0.012157472],"study_design_scores_gemma":[0.0025984873,0.0002066324,0.00068787654,0.00025046698,0.000012454867,0.000028189539,0.00011363916,0.011613259,0.0011278477,0.98243386,0.0007825091,0.00014481017],"about_ca_topic_score_codex":0.0000043102345,"about_ca_topic_score_gemma":0.0000012329136,"teacher_disagreement_score":0.19600722,"about_ca_system_score_codex":0.00011340901,"about_ca_system_score_gemma":0.00023761805,"threshold_uncertainty_score":0.6382312},"labels":[],"label_agreement":null},{"id":"W4414581273","doi":"10.61091/jcmcc127-20","title":"Assigning airport gates during a pandemic using tolerance graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hrvatska Zaklada za Znanost","keywords":"Generalization; Scheduling (production processes); Graph; Graph coloring; Interval (graph theory); Clique","score_opus":0.020069160716700386,"score_gpt":0.2993154395757704,"score_spread":0.27924627885907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8409336,0.00064250437,0.14920203,0.0000624481,0.008447963,0.00023553235,4.6116952e-7,0.0000857026,0.00038975987],"genre_scores_gemma":[0.9683471,0.000051154253,0.03118898,0.000022936778,0.00035479115,0.0000018924011,1.5535522e-7,0.000023805074,0.00000921328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967134,0.00019529932,0.0013364994,0.00037709242,0.0008091168,0.00056857977],"domain_scores_gemma":[0.99654377,0.00088876474,0.0011368253,0.00048092337,0.00073867606,0.00021103522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002412371,0.00034530324,0.0008933271,0.0006402691,0.00061991933,0.0004293104,0.001282945,0.00016936801,0.000001886641],"category_scores_gemma":[0.0006164439,0.0003222896,0.00024177937,0.0011995542,0.00015231215,0.0007092736,0.0007592477,0.0008061379,9.0055244e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007125842,0.00019997322,0.002878643,0.00024663328,0.00012216196,0.0000620915,0.00060455466,0.0005126193,0.008883895,0.9848847,0.000019376335,0.0015140941],"study_design_scores_gemma":[0.003504864,0.00022193199,0.00072428054,0.00093979115,0.000048156933,0.00022718395,0.00015009644,0.040432874,0.0036748429,0.9496606,0.00008142116,0.00033397335],"about_ca_topic_score_codex":0.000005617567,"about_ca_topic_score_gemma":1.6049007e-7,"teacher_disagreement_score":0.12741347,"about_ca_system_score_codex":0.00020927409,"about_ca_system_score_gemma":0.00039568948,"threshold_uncertainty_score":0.99992293},"labels":[],"label_agreement":null},{"id":"W4414581280","doi":"10.61091/jcmcc127-17","title":"\\(\\left(s,s+1,s+1,\\dots\\right)\\)-packing colorings and \\(\\left(1,s,s,\\dots\\right)\\)-packing colorings and d-distance colorings of distance graphs \\(D(1,t)\\)","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Upper and lower bounds; Graph; Vertex (graph theory); Bound graph; Chromatic scale; Wheel graph; Windmill graph; Graph power","score_opus":0.011218061044913212,"score_gpt":0.2712087827179902,"score_spread":0.259990721673077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9120452,0.0026843664,0.07354401,0.00053125963,0.007033315,0.00096902973,0.0000094782645,0.00015919068,0.0030241457],"genre_scores_gemma":[0.98435706,0.0004786963,0.014725673,0.000058619113,0.00024179704,0.000006671148,0.000001189795,0.0000671821,0.0000631187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99349403,0.00034656134,0.0024707518,0.0009893216,0.0015471958,0.0011521089],"domain_scores_gemma":[0.9918533,0.0029578274,0.00239703,0.0008454813,0.0013952439,0.0005511051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037996483,0.0008422812,0.0020608085,0.000973406,0.0010656974,0.0009100681,0.0018045247,0.00038523594,0.0000067129354],"category_scores_gemma":[0.0011259252,0.0007938893,0.00031958873,0.0014180804,0.00091246795,0.0014236508,0.0016293345,0.0014069612,0.0000010145544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002939728,0.00040066964,0.0036851503,0.0009387805,0.0002535639,0.00009502624,0.0017652146,0.000029288363,0.0022740578,0.9891869,0.00007316752,0.0010042206],"study_design_scores_gemma":[0.0060379496,0.0011522969,0.0011258145,0.0022878,0.00015787798,0.00024909063,0.0005373179,0.0056471834,0.007300193,0.97059155,0.0041004326,0.0008125188],"about_ca_topic_score_codex":0.000016192374,"about_ca_topic_score_gemma":0.000003922966,"teacher_disagreement_score":0.07231185,"about_ca_system_score_codex":0.00028087173,"about_ca_system_score_gemma":0.0003794493,"threshold_uncertainty_score":0.9994512},"labels":[],"label_agreement":null},{"id":"W4414581293","doi":"10.61091/jcmcc127-16","title":"On the connected coalition number of graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Natural Science Foundation of Shanxi Province; National Natural Science Foundation of China","keywords":"Cartesian product; Connectivity; Strongly connected component; Dominating set; Partition (number theory); Vertex (graph theory); Lexicographical order; Domination analysis","score_opus":0.016053839097720617,"score_gpt":0.29850830388490146,"score_spread":0.28245446478718084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8503079,0.00013584284,0.13306028,0.0008940533,0.010461205,0.00039988226,0.0000017285068,0.000047841626,0.004691257],"genre_scores_gemma":[0.99470186,0.000018684688,0.005070496,0.00006300426,0.00012208334,0.0000020495902,2.6533112e-7,0.000011400011,0.000010175515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751705,0.0003110678,0.00095778634,0.00019786194,0.0007349217,0.00028131538],"domain_scores_gemma":[0.9936416,0.0040331027,0.00088153913,0.0004695377,0.0008806722,0.00009355599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025753009,0.00020863293,0.0005665379,0.0002637502,0.0002897952,0.00017477121,0.0011365818,0.00010920364,0.0000073329006],"category_scores_gemma":[0.0014347289,0.00014804536,0.00019222853,0.0009639092,0.00018554817,0.00022156435,0.00038284983,0.00053796393,0.0000020634175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007234077,0.00033055028,0.000109010354,0.000083610765,0.000093057984,0.000006738634,0.0003457448,0.000019158782,0.00042199285,0.9975235,0.00034081104,0.0006534781],"study_design_scores_gemma":[0.0019858552,0.00034524334,0.00008759501,0.00042846228,0.00002602843,0.000031090116,0.00014855475,0.0045841937,0.0027217441,0.9893646,0.00015021686,0.00012640365],"about_ca_topic_score_codex":0.0000030630808,"about_ca_topic_score_gemma":7.940355e-8,"teacher_disagreement_score":0.14439394,"about_ca_system_score_codex":0.000050711416,"about_ca_system_score_gemma":0.0001613263,"threshold_uncertainty_score":0.6037115},"labels":[],"label_agreement":null},{"id":"W4414631978","doi":"10.61091/ars164-09","title":"Nonsplit graphs with split maximal edge induced subgraphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Board for Higher Mathematics","keywords":"Graph; Induced subgraph; Enhanced Data Rates for GSM Evolution; Independent set; Set (abstract data type); Line graph","score_opus":0.014494523322379722,"score_gpt":0.2721521042521349,"score_spread":0.25765758092975516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414631978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9640466,0.00022800096,0.01160533,0.0009069049,0.0015473972,0.0006018622,0.0000032776777,0.00051250315,0.020548135],"genre_scores_gemma":[0.9932011,0.000014906715,0.0057263556,0.00025635737,0.0000034786624,0.00008958333,0.0000031135203,0.000022016035,0.0006831385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974398,0.00017536065,0.0002938579,0.00080384384,0.00053972646,0.00074741355],"domain_scores_gemma":[0.9975867,0.0002841834,0.000088513974,0.001561137,0.0002756338,0.000203798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005627842,0.0002998004,0.00032398108,0.0006349234,0.0003382844,0.00022368372,0.002058975,0.0001285201,0.00001731784],"category_scores_gemma":[0.00007619892,0.0002672979,0.00012037056,0.0034019342,0.00022231822,0.0006706594,0.0005947212,0.00052041427,0.0000784018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000637426,0.0001465871,0.006112171,0.000023892646,0.00006131832,0.000052812436,0.00012298794,0.0000029121234,0.0012108529,0.98634,0.00042606928,0.005436646],"study_design_scores_gemma":[0.0013201357,0.0002717377,0.014239137,0.00006197292,0.000011124172,0.000011963615,0.0000339557,0.00034560706,0.0054180454,0.9768201,0.0011507946,0.00031540132],"about_ca_topic_score_codex":0.000029196524,"about_ca_topic_score_gemma":0.000010002922,"teacher_disagreement_score":0.02915446,"about_ca_system_score_codex":0.00007998908,"about_ca_system_score_gemma":0.00024356469,"threshold_uncertainty_score":0.99997795},"labels":[],"label_agreement":null},{"id":"W4414785425","doi":"10.37236/13199","title":"Degree-Similar Graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shandong Province; University of Waterloo; China Postdoctoral Science Foundation","keywords":"Degree matrix; Invertible matrix; Adjacency matrix; Laplacian matrix; Diagonal matrix; Degree (music); Converse; Diagonal; Matrix (chemical analysis)","score_opus":0.013921917469359935,"score_gpt":0.2820883461614702,"score_spread":0.26816642869211027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414785425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027453778,0.010667977,0.9495026,0.0060221637,0.00090156036,0.00015334095,2.1135011e-7,0.00004643002,0.0052519385],"genre_scores_gemma":[0.99775213,0.0009864643,0.00021854407,0.00025399795,0.000020516689,0.000002523069,7.23147e-8,0.00000768496,0.0007580634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980534,0.00027027726,0.00035561965,0.00014125869,0.00052344985,0.00065603317],"domain_scores_gemma":[0.99823564,0.00044340172,0.00022568763,0.00062513916,0.0003997051,0.00007044634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022105945,0.00013234785,0.00022491082,0.00034389898,0.00023075132,0.00008460181,0.0029310065,0.0000512034,0.0000038690046],"category_scores_gemma":[0.00019407268,0.00008780557,0.00017156093,0.0018884622,0.00011075343,0.00036820822,0.00025851463,0.0010478934,0.000006340211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025353353,0.000060850925,0.00012986794,0.000004922037,0.000072523995,0.000010610264,0.00007165209,0.000048827424,0.000180972,0.9933247,0.0006452626,0.0054244567],"study_design_scores_gemma":[0.0005330217,0.00028613606,0.000216155,0.000020401581,0.000015235417,0.00007986625,0.000030849646,0.00037138918,0.0022507422,0.98621434,0.00990262,0.000079217054],"about_ca_topic_score_codex":0.000001153042,"about_ca_topic_score_gemma":0.0000017079433,"teacher_disagreement_score":0.97029835,"about_ca_system_score_codex":0.0002439336,"about_ca_system_score_gemma":0.0007688295,"threshold_uncertainty_score":0.54465884},"labels":[],"label_agreement":null},{"id":"W4414962663","doi":"10.1016/j.jctb.2025.09.005","title":"Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Bipartite graph; Robertson–Seymour theorem; Minor (academic); Graph; Set (abstract data type); Complete bipartite graph","score_opus":0.02026782751886669,"score_gpt":0.29336489469822086,"score_spread":0.27309706717935417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414962663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95356834,0.00046298598,0.031462844,0.0019728323,0.0061309645,0.0003237676,0.0000058979995,0.000090578185,0.0059818192],"genre_scores_gemma":[0.9938151,0.00007187086,0.0056414567,0.0001605975,0.00015056973,0.000008321964,9.3003933e-7,0.0000141311975,0.00013699639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974105,0.0007596725,0.00066971016,0.00028635084,0.0004684804,0.0004052931],"domain_scores_gemma":[0.99744356,0.0008730561,0.00037724437,0.0005526707,0.00052124413,0.00023222397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014416595,0.00024125994,0.0004999621,0.0007963169,0.00043099924,0.00027392697,0.001256098,0.00012899215,0.000016550792],"category_scores_gemma":[0.0003247731,0.00021591049,0.00018733999,0.0012889871,0.00028772923,0.0014286076,0.0004218007,0.0006693567,0.0000034482678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004037509,0.00011181561,0.0004162252,0.000016052225,0.00011896954,0.000039635117,0.00032484805,0.0000040139835,0.048543673,0.9426611,0.00013225978,0.007227667],"study_design_scores_gemma":[0.001770364,0.0008154433,0.0031827327,0.000091451744,0.00002988773,0.000108487984,0.00017535106,0.000058762773,0.017832866,0.97327065,0.002456026,0.00020799162],"about_ca_topic_score_codex":0.0000035322664,"about_ca_topic_score_gemma":0.0000043906066,"teacher_disagreement_score":0.040246814,"about_ca_system_score_codex":0.00007775287,"about_ca_system_score_gemma":0.0002716507,"threshold_uncertainty_score":0.88045746},"labels":[],"label_agreement":null},{"id":"W4415210014","doi":"10.1051/ita/2025010","title":"Superfluous Arcs and Confluent Reductions in the Minimum Feedback Vertex Set Problem","year":2025,"lang":"en","type":"article","venue":"RAIRO. Theoretical informatics and applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Trois-Rivières; Université du Québec à Montréal","funders":"","keywords":"Digraph; Feedback arc set; Vertex (graph theory); Feedback vertex set; Bounded function; Directed graph; Graph; Reduction (mathematics)","score_opus":0.010358751724870477,"score_gpt":0.28663921932323977,"score_spread":0.2762804675983693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415210014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043676,0.0003162864,0.9048789,0.0122646075,0.000041173313,0.0018626428,0.000029355775,0.00010005521,0.036830988],"genre_scores_gemma":[0.9750905,0.00021659417,0.022963291,0.0010530195,0.000013952472,0.0005350056,0.000009784223,0.0000054883994,0.00011238632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989816,0.000068154,0.00034918135,0.00016555015,0.00017194635,0.00026354793],"domain_scores_gemma":[0.99879104,0.00049391255,0.000038588118,0.0005265878,0.00006600671,0.00008389389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056439586,0.00011832871,0.00013588191,0.00013913024,0.0002942425,0.00022450167,0.0005684876,0.000059287788,0.000007656106],"category_scores_gemma":[0.000044515436,0.00008407169,0.000027934684,0.00065790286,0.0009096664,0.00022690342,0.0002841449,0.00026047105,0.000014055248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039798756,0.000043020198,0.000041630887,0.00003843326,0.0000072476255,2.4428414e-7,0.0015676266,0.000032770608,0.000043010812,0.9835072,0.00023595581,0.014478842],"study_design_scores_gemma":[0.00031388242,0.00003780982,0.00034267333,0.000029143874,0.00000866365,0.00002484646,0.0015740723,0.04967831,0.00008678392,0.9344825,0.013307386,0.0001138875],"about_ca_topic_score_codex":0.0000021828305,"about_ca_topic_score_gemma":0.0000013143094,"teacher_disagreement_score":0.9314145,"about_ca_system_score_codex":0.000018274663,"about_ca_system_score_gemma":0.000049785023,"threshold_uncertainty_score":0.34283438},"labels":[],"label_agreement":null},{"id":"W4415525844","doi":"10.61091/jcmcc128-05","title":"Backward edge-preserving maps between graphs","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Intersection graph; Vertex (graph theory); Line graph; Homomorphism; Class (philosophy); Graph homomorphism; Comparability graph","score_opus":0.023166008838318906,"score_gpt":0.3027298115669463,"score_spread":0.27956380272862735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415525844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4669779,0.0095544355,0.38791636,0.0024851626,0.118843704,0.0021457842,0.000027918992,0.00023310882,0.011815642],"genre_scores_gemma":[0.97649324,0.0003995753,0.020297341,0.0000668641,0.0025456406,0.0000041336425,0.0000022140605,0.000088119516,0.00010288811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98999345,0.0010375064,0.004055222,0.00097569014,0.0023789133,0.0015592072],"domain_scores_gemma":[0.98655623,0.005125888,0.0031334874,0.0015003023,0.002857626,0.00082645426],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.008721023,0.0010537227,0.0028028109,0.0017651478,0.0013718789,0.0019071178,0.0047079073,0.0006970874,0.000019818675],"category_scores_gemma":[0.0029285443,0.0010428529,0.00088771427,0.0033729451,0.00065857364,0.0013799752,0.004197993,0.0028780107,0.000012656029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018446754,0.00082036084,0.0016072376,0.0011573791,0.0007715926,0.00009761594,0.0016689239,0.00005745055,0.00026538645,0.9754426,0.0013620523,0.01656496],"study_design_scores_gemma":[0.007547895,0.0013595026,0.00038209534,0.0031292906,0.00037820675,0.00008329639,0.0004772197,0.009851304,0.0011525062,0.9715587,0.0032598341,0.0008201413],"about_ca_topic_score_codex":0.000014727397,"about_ca_topic_score_gemma":4.215969e-7,"teacher_disagreement_score":0.50951535,"about_ca_system_score_codex":0.00035911778,"about_ca_system_score_gemma":0.0011749724,"threshold_uncertainty_score":0.9999282},"labels":[],"label_agreement":null},{"id":"W4415525854","doi":"10.61091/jcmcc128-04","title":"On star polynomials of digraphs and their applications to domination","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Digraph; Directed graph; Macdonald polynomials; Orthogonal polynomials; A* search algorithm; Difference polynomials","score_opus":0.01529881721057274,"score_gpt":0.29956420065080497,"score_spread":0.2842653834402322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415525854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54657465,0.0017819364,0.4364008,0.00084376347,0.011104542,0.0017566669,0.000016276279,0.00003368181,0.0014877034],"genre_scores_gemma":[0.99077684,0.00016213564,0.008467382,0.00006394304,0.00047021479,0.00001063529,6.152157e-7,0.000032571108,0.00001565327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952903,0.00041056602,0.002262325,0.00055685494,0.00090679625,0.0005732004],"domain_scores_gemma":[0.9910024,0.00429593,0.001895599,0.00074118865,0.0016492397,0.00041569181],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0042094765,0.000544379,0.0015369013,0.0013951912,0.000573171,0.00048096382,0.0013825772,0.0002739474,0.0000036901504],"category_scores_gemma":[0.0013179522,0.00048366198,0.0003003657,0.0018998709,0.00036382856,0.0004024114,0.001043129,0.0008202047,0.0000016235624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034044796,0.0010069876,0.000038192815,0.0005387942,0.00023248921,0.000004320053,0.0024800408,0.00007026679,0.0024570182,0.96463186,0.0000779086,0.028121665],"study_design_scores_gemma":[0.004154573,0.0022163242,0.000112736474,0.0015036472,0.000090962785,0.000023810959,0.0005771938,0.008132568,0.0066697793,0.97550744,0.0006455,0.00036544382],"about_ca_topic_score_codex":0.000008104083,"about_ca_topic_score_gemma":5.5158836e-7,"teacher_disagreement_score":0.4442022,"about_ca_system_score_codex":0.00015114485,"about_ca_system_score_gemma":0.00045425503,"threshold_uncertainty_score":0.9997615},"labels":[],"label_agreement":null},{"id":"W4415595910","doi":"10.1016/j.dam.2025.10.035","title":"Eternally surrounding a robber","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Multipartite; Variation (astronomy); Class (philosophy); Group (periodic table)","score_opus":0.018495355132309266,"score_gpt":0.304831071605036,"score_spread":0.2863357164727267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415595910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053811427,0.00004344525,0.87576246,0.00025380016,0.000099518955,0.00026864867,0.0000013361124,0.00021063726,0.11797901],"genre_scores_gemma":[0.43989062,0.000014601489,0.55667,0.00032823786,0.000028406143,0.00011051008,0.0000026089197,0.000023450522,0.0029315772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985622,0.000020414927,0.00030463343,0.0003537446,0.00034993808,0.00040906877],"domain_scores_gemma":[0.9985354,0.00032576724,0.00008825817,0.0009188537,0.000052769854,0.000078937745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005195334,0.00017454618,0.00023442224,0.00020860032,0.00015956054,0.00023756972,0.0013305093,0.00005923687,0.000017748796],"category_scores_gemma":[0.00006923475,0.00015135844,0.00007924154,0.00071344216,0.00008214907,0.00022237153,0.000599204,0.00021102489,0.000117194395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040172445,0.000033441716,0.000020921378,0.00008247918,0.000027105727,0.000004903313,0.00043564578,0.000049005524,0.0054201297,0.98915565,0.00018012083,0.0045865513],"study_design_scores_gemma":[0.0003167531,0.000013160854,0.000060009,0.000072812836,0.000009181252,0.0000051794877,0.00016798005,0.016138235,0.006966142,0.9742488,0.0017918135,0.00020987724],"about_ca_topic_score_codex":0.0000012978392,"about_ca_topic_score_gemma":0.0000018828312,"teacher_disagreement_score":0.4345095,"about_ca_system_score_codex":0.000053314285,"about_ca_system_score_gemma":0.000059670696,"threshold_uncertainty_score":0.61722183},"labels":[],"label_agreement":null},{"id":"W4415667475","doi":"10.55016/ojs/cdm.v20i2.77499","title":"About the second neighborhood conjecture for tournaments missing two stars or disjoint paths","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Disjoint sets; Vertex (graph theory); Graph; Simple (philosophy); Property (philosophy)","score_opus":0.024747095572057655,"score_gpt":0.36404841140807986,"score_spread":0.3393013158360222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026064378,0.0018843444,0.9691604,0.015585595,0.0010545554,0.005200811,0.0028570325,0.00013255983,0.0015182762],"genre_scores_gemma":[0.7899928,0.0001818266,0.16570556,0.0055411896,0.00060992385,0.0020925456,0.00013888002,0.00018822966,0.035549007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942041,0.00045512948,0.0016074771,0.0010971292,0.00080373057,0.0018324192],"domain_scores_gemma":[0.9911385,0.00365225,0.00056912465,0.0026177529,0.0012997624,0.00072257343],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022642475,0.0007797949,0.0010486075,0.00043979575,0.002724634,0.0019355598,0.0030632338,0.00024159762,0.0003637595],"category_scores_gemma":[0.006059659,0.0005181168,0.0005861632,0.0023448558,0.0005659256,0.0005943609,0.00156328,0.0008932965,0.00007205101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002760235,0.00041904318,0.00003920121,0.00074942247,0.00060129614,0.000027724524,0.006045092,0.00046957278,0.0013153816,0.9513031,0.0063680406,0.032386083],"study_design_scores_gemma":[0.0040010107,0.00066979416,0.0000552792,0.0019618445,0.00028167502,0.000047800997,0.002118425,0.26133287,0.0036631695,0.67397505,0.050979346,0.0009137489],"about_ca_topic_score_codex":0.000003341838,"about_ca_topic_score_gemma":0.000057182016,"teacher_disagreement_score":0.8034548,"about_ca_system_score_codex":0.0007287415,"about_ca_system_score_gemma":0.001693399,"threshold_uncertainty_score":0.9997271},"labels":[],"label_agreement":null},{"id":"W4415764895","doi":"10.5614/ejgta.2025.13.2.1","title":"Maximum boundary independent broadcasts in graphs and trees","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Boundary (topology); Graph; Upper and lower bounds; Connectivity; Tree (set theory); Order (exchange)","score_opus":0.0056193732299541655,"score_gpt":0.2739667729574518,"score_spread":0.26834739972749766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415764895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2209817,0.023880765,0.75275815,0.0008886265,0.000043193893,0.00033433503,0.0000018378062,0.000029220373,0.0010821731],"genre_scores_gemma":[0.9960905,0.0028506336,0.0007339188,0.0001264426,0.000011426953,0.000037630452,4.332595e-7,0.000005490504,0.00014357384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986494,0.00024431394,0.00031747855,0.00023587613,0.00016914627,0.000383783],"domain_scores_gemma":[0.99904484,0.00038130605,0.00012916344,0.00028141707,0.00008052612,0.0000827751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019587697,0.00011839591,0.00019177917,0.00073422404,0.0002141505,0.000093438015,0.0005671934,0.000053844815,0.0000033831923],"category_scores_gemma":[0.00003476469,0.00010453014,0.00006486699,0.0010678496,0.0002696037,0.00037211762,0.00013820254,0.000570755,7.7415467e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006500817,0.00006599723,0.0009839328,0.000008278776,0.000037198777,0.000003284962,0.00011679164,0.0000117878335,0.0009024687,0.8992859,0.000011693932,0.09850764],"study_design_scores_gemma":[0.0005322026,0.000115285715,0.004994455,0.000028860008,0.00001002963,0.00010876292,0.00014544101,0.000031357806,0.00047103578,0.9900937,0.003381889,0.00008698463],"about_ca_topic_score_codex":0.000001845442,"about_ca_topic_score_gemma":0.000033047345,"teacher_disagreement_score":0.77510875,"about_ca_system_score_codex":0.000045640634,"about_ca_system_score_gemma":0.00022374529,"threshold_uncertainty_score":0.42626154},"labels":[],"label_agreement":null},{"id":"W4415764896","doi":"10.5614/ejgta.2025.13.2.8","title":"Perfect coalition in graphs","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Disjoint sets; Perfect graph theorem; Trivially perfect graph; Vertex (graph theory); Dominating set; Perfect graph; Partition (number theory); Perfect power","score_opus":0.005659939029547717,"score_gpt":0.28493499668852657,"score_spread":0.27927505765897886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415764896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040396485,0.0051064715,0.95217013,0.00059098017,0.000028220662,0.00020932322,8.4198206e-7,0.000019902282,0.001477627],"genre_scores_gemma":[0.99768937,0.0012462288,0.0007369933,0.00013221425,0.000014412635,0.00004513904,5.7513415e-7,0.0000039159627,0.00013117219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877113,0.00032588674,0.00027914782,0.00017158427,0.00012847317,0.0003237519],"domain_scores_gemma":[0.9990004,0.00047554623,0.000113278715,0.00026296257,0.00009681605,0.000051006286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024673701,0.00008726022,0.00015082436,0.0006547119,0.00014882551,0.00004309829,0.0005563728,0.00004064781,0.000004363823],"category_scores_gemma":[0.00004922556,0.00007734072,0.000080860955,0.0013697175,0.00013995236,0.00031845373,0.000062353014,0.00045048373,0.0000015175522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045712815,0.00006165058,0.00035551464,0.000007775713,0.000024255918,0.0000011928839,0.00006058941,0.000028032819,0.0012166585,0.9713427,0.000018965116,0.026836963],"study_design_scores_gemma":[0.00036756197,0.000096542295,0.0010111637,0.000025243324,0.000007863125,0.000040557385,0.00009421812,0.000050711835,0.0010836133,0.9942147,0.002942869,0.000064919645],"about_ca_topic_score_codex":0.0000010678328,"about_ca_topic_score_gemma":0.00000704198,"teacher_disagreement_score":0.95729285,"about_ca_system_score_codex":0.00005104658,"about_ca_system_score_gemma":0.00017783337,"threshold_uncertainty_score":0.31538633},"labels":[],"label_agreement":null},{"id":"W4415914271","doi":"10.28924/2291-8639-23-2025-273","title":"Extending Certified Domination: Bondage Numbers in Generalized Petersen Graphs","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Vertex (graph theory); Domination analysis; Graph; Cardinality (data modeling)","score_opus":0.015611420772718154,"score_gpt":0.35071257551925816,"score_spread":0.33510115474654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415914271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059160594,0.0018434521,0.9301878,0.0059176744,0.00032924747,0.00026026016,0.00002116259,0.000010284723,0.0022694732],"genre_scores_gemma":[0.9859542,0.0025592977,0.010136068,0.00024857122,0.00011835949,0.00003719866,0.000010224259,0.000008055315,0.00092800765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691904,0.00024607312,0.0012721312,0.0004667154,0.00081334566,0.00028269022],"domain_scores_gemma":[0.99718344,0.00039401476,0.00075278914,0.00041419108,0.0010974351,0.00015812236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013797045,0.0002160115,0.0005292633,0.0041101663,0.00019949467,0.00053151185,0.0015854879,0.00009406893,0.000097440185],"category_scores_gemma":[0.00010930021,0.00021280641,0.0005248985,0.004562782,0.00024084066,0.0007425464,0.00034779706,0.00042748603,0.0000048581096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017291198,0.00043172212,0.018855304,0.000022278042,0.0037141282,0.00007205866,0.0006518681,0.004640614,0.0034406756,0.79888344,0.0001342907,0.16898072],"study_design_scores_gemma":[0.0059018675,0.00014311874,0.14078759,0.00052680954,0.0020210443,0.0001586708,0.0012892743,0.15189639,0.0036161225,0.6683753,0.02438202,0.0009017629],"about_ca_topic_score_codex":0.00006991517,"about_ca_topic_score_gemma":0.00012087289,"teacher_disagreement_score":0.92679363,"about_ca_system_score_codex":0.00021775508,"about_ca_system_score_gemma":0.00019530003,"threshold_uncertainty_score":0.86779934},"labels":[],"label_agreement":null},{"id":"W4415956068","doi":"10.1007/978-3-031-89771-9_156","title":"Restrained Roman Edge Domination in Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Studies in systems, decision and control","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Graph; Edge cover; Weight function; Dominating set","score_opus":0.039015043947590915,"score_gpt":0.34568425989983026,"score_spread":0.30666921595223934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415956068","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009369162,0.22192578,0.22851932,0.0013008016,0.0070375525,0.007394192,0.00010112127,0.00034226204,0.53244203],"genre_scores_gemma":[0.80605775,0.010719802,0.001970728,0.00030610754,0.00017933336,0.000528876,0.0000079937,0.000058226502,0.1801712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971601,0.00020523433,0.00087082037,0.0008153264,0.00059444987,0.00035407394],"domain_scores_gemma":[0.99643487,0.0022602237,0.0002237914,0.0007324154,0.00027761795,0.00007110124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018511659,0.0003569534,0.000985868,0.0013438313,0.00013361622,0.00010453552,0.0007600787,0.00024063812,0.0000035286528],"category_scores_gemma":[0.00059453415,0.00030501594,0.000102876635,0.0002896458,0.00025410522,0.00019772314,0.0004820577,0.00045474007,0.000012938819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013025246,0.000015458927,0.000079822945,0.00012347223,0.000076762284,0.0001817405,0.00040779554,0.000023456168,0.0000070659967,0.924113,0.0013666325,0.073474556],"study_design_scores_gemma":[0.005434362,0.00020377715,0.000573663,0.003943732,0.000021096143,0.000025818337,0.0005401909,0.004233695,0.0000016659459,0.94259685,0.041844834,0.00058030523],"about_ca_topic_score_codex":0.000012066176,"about_ca_topic_score_gemma":0.00014499409,"teacher_disagreement_score":0.8051208,"about_ca_system_score_codex":0.00018577854,"about_ca_system_score_gemma":0.00007549955,"threshold_uncertainty_score":0.9999402},"labels":[],"label_agreement":null},{"id":"W4415963533","doi":"10.48550/arxiv.2510.17344","title":"On Algorithmic Meta-Theorems for Solution Discovery: Tractability and Barriers","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Parameterized complexity; Treewidth; Graph; Security token; Complement (music); Transformation (genetics); Computational complexity theory","score_opus":0.0720055849767724,"score_gpt":0.33890989622375284,"score_spread":0.26690431124698044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415963533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28688824,0.0012536972,0.70342964,0.0022304493,0.0015748019,0.0034677987,0.00053729943,0.00014976665,0.00046829745],"genre_scores_gemma":[0.98398006,0.00050807925,0.010680651,0.00042913848,0.00021279731,0.0014104774,0.000048142698,0.000057482015,0.0026731843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99133223,0.0012681714,0.0011737376,0.0037337253,0.0009224597,0.0015696618],"domain_scores_gemma":[0.99116004,0.0036713306,0.00056361867,0.003397436,0.0005397222,0.0006678451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004944714,0.0011536313,0.0016995303,0.00059821684,0.0012044096,0.0006141225,0.0027750358,0.0006859139,0.00009900057],"category_scores_gemma":[0.0027767834,0.0010547929,0.0012654033,0.0009169942,0.0015552856,0.0015954577,0.003015102,0.0020124828,0.000030453357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034789797,0.0013305055,0.024587093,0.0030356895,0.008564729,0.000049763457,0.004650565,0.005740367,0.005322273,0.79960996,0.00053633,0.14309376],"study_design_scores_gemma":[0.0022189012,0.0011341835,0.01578987,0.00035558603,0.001524848,0.000013214,0.00023026983,0.09878001,0.009143158,0.8658671,0.0030556642,0.001887191],"about_ca_topic_score_codex":0.000098866934,"about_ca_topic_score_gemma":0.000035772126,"teacher_disagreement_score":0.6970918,"about_ca_system_score_codex":0.00049079786,"about_ca_system_score_gemma":0.0010327975,"threshold_uncertainty_score":0.9991902},"labels":[],"label_agreement":null},{"id":"W4415991362","doi":"10.1007/s00493-025-00168-w","title":"The Grid-Minor Theorem Revisited","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Monash University; Australian Government","keywords":"Treewidth; Graph minor; Planar graph; Graph; Upper and lower bounds; Existential quantification; Perfect graph; Chromatic scale","score_opus":0.010468888549975325,"score_gpt":0.2878532767963204,"score_spread":0.27738438824634504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415991362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005317782,0.01411946,0.6239169,0.023101695,0.005714917,0.0013810025,0.0000045974766,0.001348232,0.32509542],"genre_scores_gemma":[0.9835037,0.00029125976,0.0017975915,0.0006313628,0.000048069505,0.00007653277,0.0000014033735,0.000013163493,0.013636923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861354,0.00021149439,0.00017939114,0.00033092796,0.00027582652,0.00038881335],"domain_scores_gemma":[0.99755824,0.0008584302,0.000048436825,0.0012969762,0.00016417685,0.000073721596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069074926,0.00011692469,0.00013095737,0.000118429685,0.0006060545,0.00022082828,0.0023743948,0.00004357885,0.0000065824233],"category_scores_gemma":[0.00038428677,0.000078037025,0.00007498489,0.001712898,0.00015540808,0.00019519373,0.0007304289,0.00025131414,0.000096594085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007258304,0.000027172795,0.00021225266,0.0000062401796,0.000012632544,0.000005841394,0.000033117434,0.0000011214892,0.000073509014,0.95377815,0.010366332,0.03547638],"study_design_scores_gemma":[0.00021431017,0.000032933945,0.0007906109,0.00001557251,0.000002317814,0.000001934034,0.000012609122,0.00092737464,0.0010455792,0.78750205,0.20937139,0.00008333593],"about_ca_topic_score_codex":0.0000015493955,"about_ca_topic_score_gemma":3.0001823e-7,"teacher_disagreement_score":0.9781859,"about_ca_system_score_codex":0.000076268465,"about_ca_system_score_gemma":0.000079726815,"threshold_uncertainty_score":0.46613425},"labels":[],"label_agreement":null},{"id":"W4416086981","doi":"10.61091/jcmcc128-15","title":"Equitable domination number of certain graph operators","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Domination analysis; Vertex (graph theory); Graph; Existential quantification; Subdivision; Neighbourhood (mathematics)","score_opus":0.016453819897170957,"score_gpt":0.31402654811134784,"score_spread":0.2975727282141769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416086981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60031986,0.0026480663,0.3404514,0.0005689399,0.04933432,0.0011020385,0.000007818184,0.000055503544,0.0055120774],"genre_scores_gemma":[0.980318,0.00028452108,0.018445363,0.00003234894,0.0007704537,0.0000037217396,9.654381e-7,0.000050757495,0.00009384246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919854,0.0007680939,0.0036211952,0.00063224614,0.0018987432,0.0010943504],"domain_scores_gemma":[0.9898954,0.0028783663,0.0031541064,0.00090638036,0.0027550724,0.0004106983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008204834,0.0007107306,0.0021515111,0.0011131626,0.00078940135,0.0007509733,0.002399295,0.0004856877,0.00002380575],"category_scores_gemma":[0.002270458,0.00068774185,0.000608294,0.003034219,0.00058095914,0.0011408391,0.001913274,0.0014064781,0.000004997393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030467325,0.0015075897,0.0006075728,0.00097050174,0.00046197983,0.00003806568,0.0020201833,0.00014043316,0.0014447201,0.98187757,0.0002425547,0.010384174],"study_design_scores_gemma":[0.008117206,0.0010405933,0.00007807991,0.002363265,0.00024620563,0.00010874564,0.00079028483,0.022921273,0.0067630326,0.9565118,0.0005226037,0.00053690374],"about_ca_topic_score_codex":0.000020468839,"about_ca_topic_score_gemma":4.0686714e-7,"teacher_disagreement_score":0.37999818,"about_ca_system_score_codex":0.00027747022,"about_ca_system_score_gemma":0.0011180385,"threshold_uncertainty_score":0.9995574},"labels":[],"label_agreement":null},{"id":"W4416096748","doi":"10.1007/s00224-025-10247-6","title":"Improved Parameterized Algorithms for Cluster Vertex Deletion","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Natural Science Foundation of China","keywords":"Vertex (graph theory); Parameterized complexity; Graph; Neighbourhood (mathematics); Degree (music); Feedback vertex set; Connected component","score_opus":0.02599159056114206,"score_gpt":0.3157768604298239,"score_spread":0.2897852698686818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416096748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03331142,0.0003029025,0.96305186,0.00011183566,0.0013630328,0.0010069166,0.000004472731,0.00020638946,0.0006411597],"genre_scores_gemma":[0.94150984,0.0000024352207,0.057540137,0.00010599911,0.000053565702,0.00004711586,0.0000035713624,0.000015221077,0.0007221273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977268,0.0006421675,0.0005393994,0.00045056044,0.00021911958,0.0004219279],"domain_scores_gemma":[0.9963118,0.0023148407,0.00023575727,0.0007753785,0.0003015122,0.000060740877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034549304,0.0001802545,0.00042425978,0.0002879369,0.00018628333,0.000109377645,0.0011426227,0.00009135694,9.81627e-7],"category_scores_gemma":[0.0003336687,0.00016570221,0.00015228971,0.00051278487,0.00013899185,0.00018542752,0.0003351404,0.00013851281,0.0000043456535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022521964,0.00005768528,0.000021304908,0.00035157742,0.000098812765,6.51251e-7,0.00048858556,0.0020070525,0.011625675,0.9157254,0.00016455608,0.06923344],"study_design_scores_gemma":[0.0013987512,0.00017002677,0.00006218498,0.0002482056,0.000011809587,0.0000068566496,0.00010523099,0.8416154,0.004523163,0.15114585,0.0005390284,0.00017355368],"about_ca_topic_score_codex":0.0000085106285,"about_ca_topic_score_gemma":3.0232997e-7,"teacher_disagreement_score":0.9081984,"about_ca_system_score_codex":0.000063799605,"about_ca_system_score_gemma":0.000081611346,"threshold_uncertainty_score":0.67571396},"labels":[],"label_agreement":null},{"id":"W4416099726","doi":"10.4230/lipics.socg.2025.19","title":"Polychromatic Coloring of Tuples in Hypergraphs","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of Windsor","funders":"","keywords":"Hypergraph; Vertex (graph theory); Tuple; Set (abstract data type); Constant (computer programming)","score_opus":0.053731101519079436,"score_gpt":0.32533864359938885,"score_spread":0.2716075420803094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416099726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9754872,0.0008388926,0.019956492,0.0002624424,0.0004803414,0.00040702222,0.000009147471,0.00012109194,0.00243739],"genre_scores_gemma":[0.98864734,0.00016665533,0.01052931,0.00005395039,0.000025107165,0.00009158555,0.0000035593416,0.000012073821,0.00047041653],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9977992,0.0002023645,0.00051562616,0.0006881171,0.0003574672,0.00043718854],"domain_scores_gemma":[0.99770695,0.00043333234,0.0001941814,0.0014812414,0.000106007574,0.000078285826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059055013,0.00025155663,0.0005056871,0.00079155713,0.00005646087,0.000038539998,0.0024505672,0.00018635234,0.000011193663],"category_scores_gemma":[0.00024823533,0.00025769343,0.00016523576,0.0010881164,0.00016557943,0.00019982013,0.003114989,0.0007217281,0.000021927186],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003678739,0.00024551907,0.88252854,0.0011333044,0.000120655146,0.00007899683,0.0013130704,0.0029989837,0.006987942,0.0978935,0.00006099161,0.006601677],"study_design_scores_gemma":[0.0009633217,0.00015396292,0.7200194,0.0024384756,0.000025379477,0.000008185238,0.00017920346,0.014496515,0.033215277,0.22726646,0.0003408495,0.0008929523],"about_ca_topic_score_codex":0.0001310692,"about_ca_topic_score_gemma":0.000060485654,"teacher_disagreement_score":0.16250916,"about_ca_system_score_codex":0.00008718964,"about_ca_system_score_gemma":0.00028420752,"threshold_uncertainty_score":0.99998754},"labels":[],"label_agreement":null},{"id":"W4416232600","doi":"10.48550/arxiv.2506.05602","title":"Induced subgraphs and tree decompositions XIX. Thetas and forests","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Treewidth; Graph; Block graph; Tree (set theory); Clique-sum; 1-planar graph; Tree-depth; Class (philosophy); Function (biology)","score_opus":0.07283746239507752,"score_gpt":0.23432469668237466,"score_spread":0.16148723428729714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416232600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6741611,0.00022347766,0.32135752,0.00019657677,0.00016944447,0.00039434084,0.00002846466,0.00018594316,0.0032831663],"genre_scores_gemma":[0.99553853,0.00043794065,0.0031975177,0.000057443798,0.000015160014,0.0000025414788,0.0000083209925,0.000009551675,0.00073299545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807405,0.00020774867,0.00014636417,0.0011145801,0.00008988026,0.00036738845],"domain_scores_gemma":[0.998161,0.00031164268,0.00010488356,0.0010717392,0.00012874209,0.00022196921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019792581,0.0002840615,0.00029910877,0.0006612,0.00030704495,0.00016065453,0.0012337437,0.00022670999,0.000005187921],"category_scores_gemma":[0.000032675664,0.00031854713,0.00011519857,0.0008029439,0.00025709992,0.00040196782,0.00332384,0.0006383818,0.0000060312477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004182766,0.00006722309,0.011151744,0.000085542015,0.00011759706,0.00017639589,0.00024674943,0.0023503327,0.000213642,0.980914,0.000050798728,0.0045841425],"study_design_scores_gemma":[0.0007036269,0.00009314797,0.01831226,0.00014467692,0.000062115876,0.000014828547,0.00006124602,0.09138328,0.0004965147,0.8881091,0.00013392966,0.0004852915],"about_ca_topic_score_codex":0.00006821347,"about_ca_topic_score_gemma":0.00027680222,"teacher_disagreement_score":0.32137746,"about_ca_system_score_codex":0.00006573214,"about_ca_system_score_gemma":0.00013922481,"threshold_uncertainty_score":0.9999267},"labels":[],"label_agreement":null},{"id":"W4416347661","doi":"10.48550/arxiv.2510.12564","title":"Dominating Hadwiger's Conjecture for graphs $G$ with $α(G)=2$","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Dominating set; Conjecture; Graph; Independence number; Clique number; Chromatic scale; Graph power; Existential quantification","score_opus":0.037917087882524,"score_gpt":0.3210448310125198,"score_spread":0.2831277431299958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416347661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22037658,0.0005684664,0.77283067,0.0015338443,0.0007219423,0.0016093546,0.00006029928,0.0004410214,0.001857802],"genre_scores_gemma":[0.8797225,0.000059173995,0.115405716,0.0005596247,0.00014348228,0.00077534403,0.00003740118,0.00004749895,0.0032492669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996952,0.0001616994,0.00036789328,0.0013451875,0.00043793625,0.0007352903],"domain_scores_gemma":[0.9964957,0.00081517233,0.0002701947,0.0018655641,0.00039742506,0.00015592779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006975996,0.00047085268,0.0005521004,0.00044330102,0.00033075456,0.00019851477,0.0027901991,0.00032612646,0.0000115272705],"category_scores_gemma":[0.0002641062,0.00039445184,0.00026281335,0.0007046823,0.00022574016,0.0002689102,0.002173481,0.0011584464,0.000015922564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005248902,0.00038924985,0.1498711,0.002499811,0.0011787955,0.000265865,0.005011021,0.008957545,0.0024317876,0.7510587,0.0026358257,0.07517543],"study_design_scores_gemma":[0.0030486244,0.00063294143,0.017271198,0.0018691042,0.00011155607,0.00004043601,0.00021830118,0.013031634,0.020259853,0.9360384,0.0054385816,0.0020394186],"about_ca_topic_score_codex":0.000027171833,"about_ca_topic_score_gemma":0.000030221936,"teacher_disagreement_score":0.6593459,"about_ca_system_score_codex":0.00009563884,"about_ca_system_score_gemma":0.0004563095,"threshold_uncertainty_score":0.99985075},"labels":[],"label_agreement":null},{"id":"W4416375366","doi":"10.48550/arxiv.2504.17868","title":"Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; European Commission","keywords":"Colored; Upper and lower bounds; Graph; Set (abstract data type); Similarity (geometry); Class (philosophy)","score_opus":0.029473443243371533,"score_gpt":0.3073322533160774,"score_spread":0.27785881007270585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416375366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89729375,0.0006807275,0.08607792,0.0029348384,0.0007895742,0.0018481245,0.00054180785,0.00056814175,0.009265112],"genre_scores_gemma":[0.9585658,0.00006866966,0.026099294,0.00057710113,0.0001638568,0.00055980316,0.00013027068,0.000044780714,0.013790429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9951365,0.00046883195,0.0007593522,0.0017420618,0.0008999965,0.0009932346],"domain_scores_gemma":[0.99571425,0.001368287,0.0002947437,0.002008283,0.00037688567,0.00023755053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009300733,0.0005750725,0.0007635402,0.00036839177,0.00020688215,0.00023544379,0.0043495875,0.0004163072,0.0003370048],"category_scores_gemma":[0.00070575136,0.0006063121,0.00029791452,0.0009036573,0.0003290583,0.00076333305,0.0047556385,0.0016736025,0.0005134174],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026362115,0.0034559178,0.3347846,0.002588885,0.0012703522,0.003774234,0.00430953,0.21321504,0.01214846,0.40130785,0.016521864,0.00398706],"study_design_scores_gemma":[0.0049252585,0.0005069138,0.51080734,0.0021899487,0.00006511859,0.00003668131,0.00009696013,0.31957623,0.003426752,0.1407505,0.014456599,0.0031617125],"about_ca_topic_score_codex":0.000057569214,"about_ca_topic_score_gemma":0.00006106389,"teacher_disagreement_score":0.26055735,"about_ca_system_score_codex":0.00037937824,"about_ca_system_score_gemma":0.0008343146,"threshold_uncertainty_score":0.9996388},"labels":[],"label_agreement":null},{"id":"W4416785444","doi":"10.28924/2291-8639-23-2025-304","title":"The Rainbow Mean Coloring of Some Operations of Graphs","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Edge coloring; Vertex (graph theory); Brooks' theorem; Chromatic scale; Graph; Product (mathematics)","score_opus":0.013743296980078909,"score_gpt":0.3405275770100706,"score_spread":0.32678428002999166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416785444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062007714,0.004195099,0.92721355,0.005501607,0.0002443701,0.0002600145,0.000050739305,0.0000043335763,0.00052259257],"genre_scores_gemma":[0.9905042,0.00479519,0.004184919,0.000057769477,0.00007452243,0.000021526843,0.0000027426308,0.000004111036,0.00035501248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974669,0.00016028788,0.0012486685,0.00022016626,0.0007437583,0.00016019838],"domain_scores_gemma":[0.99513364,0.0007703414,0.00076150545,0.0004476943,0.0027993578,0.00008747901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00143906,0.00012726893,0.0004008525,0.0013823878,0.00033994988,0.00020176072,0.0019263267,0.000050129227,0.000015233263],"category_scores_gemma":[0.00014994027,0.00009659477,0.000496463,0.0026452804,0.00057030295,0.00045808722,0.0003553209,0.00025725982,6.807496e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045902794,0.00020070397,0.0027477439,0.0000113597625,0.004307573,0.0000012829333,0.000328967,0.011853585,0.0040977867,0.9245141,0.00003143386,0.051859535],"study_design_scores_gemma":[0.0021517081,0.0003896552,0.03429816,0.00037364638,0.0033617883,0.000037398146,0.0023146204,0.17439444,0.03932683,0.73021394,0.012690574,0.00044722782],"about_ca_topic_score_codex":0.000041158437,"about_ca_topic_score_gemma":0.000082952196,"teacher_disagreement_score":0.9284965,"about_ca_system_score_codex":0.00005180632,"about_ca_system_score_gemma":0.0002855339,"threshold_uncertainty_score":0.39390203},"labels":[],"label_agreement":null},{"id":"W45265680","doi":"","title":"On Quadrilaterals and Cycle Covers in a Bipartite Graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Quadrilateral; Complete bipartite graph; Combinatorics; Graph; Structural engineering; Finite element method","score_opus":0.013954489477157517,"score_gpt":0.27878385254499,"score_spread":0.2648293630678325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45265680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99533343,0.00009902383,0.0010788896,0.00041914723,0.00037645406,0.00015914744,7.198403e-7,0.000083588406,0.0024495907],"genre_scores_gemma":[0.9992022,0.00008622095,0.0003579054,0.00023473441,0.0000019966876,0.000018346102,6.1856673e-7,0.000009593306,0.00008841195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998698,0.00012625953,0.00016110676,0.0003761428,0.00025549703,0.00038302667],"domain_scores_gemma":[0.9990817,0.00024771784,0.000038822585,0.0004749133,0.000032451564,0.00012441451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003834783,0.00012407101,0.0001544026,0.00027295307,0.00008388817,0.00009251695,0.00046753316,0.000050092152,0.000014459265],"category_scores_gemma":[0.00007121176,0.00012105989,0.000033727883,0.00087993,0.00008371031,0.00046564697,0.00017673131,0.00018723417,0.000059498747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035194695,0.00007983377,0.01094735,0.0000030362646,0.000005445147,0.000087190354,0.00030002097,0.000056467936,0.0010605776,0.98583955,0.00012220077,0.001463109],"study_design_scores_gemma":[0.00088777835,0.00016335303,0.00719269,0.00002416127,7.8472243e-7,0.000011442386,0.000012933859,0.0023342052,0.0014916896,0.98733026,0.00040512712,0.00014559552],"about_ca_topic_score_codex":0.000028701976,"about_ca_topic_score_gemma":0.000012222815,"teacher_disagreement_score":0.0038687338,"about_ca_system_score_codex":0.00003860686,"about_ca_system_score_gemma":0.00001933301,"threshold_uncertainty_score":0.49366793},"labels":[],"label_agreement":null},{"id":"W46589465","doi":"","title":"Arc Signed Graphs of Oriented Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Combinatorics; Indifference graph; Graph; Geometry","score_opus":0.018186615225529747,"score_gpt":0.25880686326639474,"score_spread":0.240620248040865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46589465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9645196,0.0012904158,0.015667815,0.0005930914,0.0026368592,0.0006574313,0.000007472503,0.0005470888,0.014080209],"genre_scores_gemma":[0.9955615,0.0000656936,0.003948176,0.00006591967,0.0000020815073,0.0000234495,0.0000012331838,0.00001812597,0.00031385018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978524,0.00018841762,0.0003396588,0.00047677069,0.0006332764,0.00050949876],"domain_scores_gemma":[0.9980043,0.0002692141,0.00013965461,0.0011381464,0.00025962215,0.00018904134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040052642,0.00019274982,0.00028076235,0.0003995759,0.00014536186,0.00004017314,0.0014277754,0.000080947655,0.00009645512],"category_scores_gemma":[0.00015107288,0.00018854895,0.00015446941,0.002204633,0.00025151527,0.00050233037,0.00034543916,0.00023786495,0.00008992947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010346721,0.000223853,0.001538701,0.000013454176,0.000027804936,0.000020134077,0.00034822995,0.000004997952,0.0027826843,0.98994184,0.0008068185,0.0042811227],"study_design_scores_gemma":[0.0009267864,0.00027595044,0.00074612984,0.000023599383,0.000004550986,0.000007129504,0.000022863529,0.002223869,0.010092866,0.98480374,0.0006667985,0.00020570823],"about_ca_topic_score_codex":0.000009803072,"about_ca_topic_score_gemma":0.0000012061311,"teacher_disagreement_score":0.031041853,"about_ca_system_score_codex":0.000028850149,"about_ca_system_score_gemma":0.000020587395,"threshold_uncertainty_score":0.7688803},"labels":[],"label_agreement":null},{"id":"W52813985","doi":"","title":"Hamiltonian Cycles in N 2 -Locally Connected Claw-Free Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Hamiltonian (control theory); Mathematical optimization; Structural engineering","score_opus":0.018901733731783367,"score_gpt":0.2569798225516237,"score_spread":0.23807808881984036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52813985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97615546,0.0009360183,0.0026549238,0.002556891,0.0016707989,0.0005932108,0.000006011407,0.000677074,0.014749587],"genre_scores_gemma":[0.99532986,0.000080356054,0.003997498,0.00025162016,0.000004515339,0.000041918604,0.00000161383,0.000024799681,0.00026784412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750644,0.0002644587,0.00034705,0.00061971456,0.0005376333,0.0007247284],"domain_scores_gemma":[0.9975832,0.00035489284,0.00008023675,0.001639412,0.0001298447,0.00021239732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004696632,0.00023155294,0.0002857604,0.0004385207,0.00016171255,0.00013962417,0.0027074977,0.00012668561,0.000073978226],"category_scores_gemma":[0.0003473638,0.00023947693,0.00009321406,0.0018667805,0.0002070162,0.0006641131,0.00068182766,0.00045666387,0.0002005082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009469153,0.00019234752,0.004879609,0.000008010385,0.0000126097,0.00011726389,0.00036485714,0.000022921551,0.0004195704,0.98680055,0.0015421686,0.0056306426],"study_design_scores_gemma":[0.0018362525,0.00014293152,0.012613704,0.000031082545,0.0000017949619,0.0000146550565,0.000022790084,0.00830496,0.0008143225,0.9749252,0.0009993725,0.0002929236],"about_ca_topic_score_codex":0.00003609571,"about_ca_topic_score_gemma":0.00006515079,"teacher_disagreement_score":0.019174349,"about_ca_system_score_codex":0.00008919997,"about_ca_system_score_gemma":0.000032452102,"threshold_uncertainty_score":0.97655857},"labels":[],"label_agreement":null},{"id":"W54544480","doi":"","title":"Edge-added Eccentricities of Vertices in a Graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Graph; Computer science; Artificial intelligence","score_opus":0.022744686622149853,"score_gpt":0.26096908762655074,"score_spread":0.2382244010044009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54544480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9879811,0.0016897218,0.0014007495,0.00030206228,0.0009191312,0.00024819066,0.0000017761918,0.00011363542,0.0073436718],"genre_scores_gemma":[0.9985308,0.00010794592,0.001110002,0.000040166986,0.0000023209784,0.000015222164,3.533359e-7,0.000008182737,0.00018500318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986004,0.00013916337,0.00025603408,0.00027555655,0.000359,0.00036981842],"domain_scores_gemma":[0.99891895,0.00027318313,0.00007509206,0.0005611659,0.00009268932,0.00007891612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028934356,0.00011387512,0.00020287554,0.00037172018,0.00005402439,0.00003991667,0.0010359441,0.000049872513,0.00005592821],"category_scores_gemma":[0.00013936883,0.00011269929,0.00006137786,0.0014204561,0.00013569556,0.00052015006,0.00024270947,0.00016901139,0.000040903917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083253335,0.00018376531,0.005155701,0.000018682853,0.000009761733,0.0000227706,0.0009606995,0.000029670713,0.00034494925,0.98906314,0.0004294642,0.0037730439],"study_design_scores_gemma":[0.0009369107,0.00013355442,0.0025940393,0.00003182773,0.0000020982563,0.0000033552008,0.00007646082,0.0062903916,0.0067544333,0.98265004,0.00037606477,0.00015081525],"about_ca_topic_score_codex":0.000020770738,"about_ca_topic_score_gemma":0.0000050698536,"teacher_disagreement_score":0.010549742,"about_ca_system_score_codex":0.00003555326,"about_ca_system_score_gemma":0.000017048373,"threshold_uncertainty_score":0.45957434},"labels":[],"label_agreement":null},{"id":"W55235417","doi":"","title":"On the connectivity of generalized p-cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Degree (music); Upper and lower bounds; Order (exchange); Enhanced Data Rates for GSM Evolution; Set (abstract data type); Discrete mathematics; Mathematical analysis; Physics; Computer science","score_opus":0.025808839045729174,"score_gpt":0.28955243720565654,"score_spread":0.2637435981599274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55235417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9861285,0.00006210113,0.006189317,0.0011810967,0.0005232587,0.00019116959,9.362422e-7,0.00007527932,0.005648346],"genre_scores_gemma":[0.9990495,0.000023105711,0.000510335,0.00020455483,0.0000033234367,0.000018607418,3.3698848e-7,0.000008350847,0.00018187924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986895,0.00027700383,0.00014746682,0.0002569643,0.0003633658,0.00026574437],"domain_scores_gemma":[0.9979407,0.00089788524,0.00007660352,0.00092046865,0.00010180089,0.0000625316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006711922,0.00010441713,0.00015421088,0.00007799974,0.00013586425,0.000035526376,0.0011176596,0.000039332022,0.000041363524],"category_scores_gemma":[0.0002890335,0.00007352374,0.00007301067,0.0006398194,0.00013893278,0.0001852254,0.00024052818,0.00017992248,0.000048047725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023557232,0.000093830975,0.0008773014,0.0000019491524,0.000012095565,0.000009408092,0.000094283016,0.000035564048,0.0011226463,0.9951157,0.00055893674,0.0020547237],"study_design_scores_gemma":[0.0004940017,0.00011279447,0.0026552652,0.000008509049,0.0000013704683,0.0000052568757,0.000009002015,0.001900132,0.008711034,0.98537886,0.00063708343,0.00008667481],"about_ca_topic_score_codex":0.000019207773,"about_ca_topic_score_gemma":0.000002572544,"teacher_disagreement_score":0.012921011,"about_ca_system_score_codex":0.000032691914,"about_ca_system_score_gemma":0.000036786136,"threshold_uncertainty_score":0.2998211},"labels":[],"label_agreement":null},{"id":"W578099889","doi":"10.1007/978-3-319-27261-0_8","title":"Genus, Treewidth, and Local Crossing Number","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Treewidth; Combinatorics; Mathematics; 1-planar graph; Partial k-tree; Planar graph; Clique-sum; Vertex (graph theory); Crossing number (knot theory); Graph; Upper and lower bounds; Discrete mathematics; Pathwidth; Chordal graph; Line graph; Cartography","score_opus":0.03260231898459536,"score_gpt":0.3087347453853231,"score_spread":0.2761324264007277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W578099889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016967527,0.0011368945,0.9914409,0.00032505678,0.0007942277,0.00028295178,0.0000045739243,0.00015950133,0.0056862268],"genre_scores_gemma":[0.23052756,0.000054157463,0.7653669,0.0014446698,0.0006346458,0.00001344461,0.0000041974845,0.00009441273,0.0018599698],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99537724,0.00006210414,0.00043176816,0.0017913886,0.0014017854,0.0009357003],"domain_scores_gemma":[0.99701685,0.00049578876,0.00018377855,0.0015015802,0.00038164228,0.00042036656],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015336196,0.00053927494,0.0005388231,0.0006024107,0.00048237713,0.0012945168,0.0031134698,0.00033321153,0.000027110202],"category_scores_gemma":[0.00012262039,0.00049073464,0.00008931928,0.00073249795,0.00391914,0.0010019452,0.0026888805,0.0010954426,0.000095881376],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009428619,0.000013620633,0.00011546976,0.000023445202,0.0000071925115,0.00017244711,0.000619738,0.006449462,0.000033044493,0.06590875,0.000034520253,0.92661285],"study_design_scores_gemma":[0.00035539747,0.00011499395,0.000064345455,0.0002126852,0.0000042027345,0.00033818334,2.8333085e-7,0.22249289,0.00033178373,0.76614964,0.009259584,0.000675996],"about_ca_topic_score_codex":0.000019250856,"about_ca_topic_score_gemma":0.00005981978,"teacher_disagreement_score":0.9259369,"about_ca_system_score_codex":0.0003708411,"about_ca_system_score_gemma":0.0009356022,"threshold_uncertainty_score":0.9997544},"labels":[],"label_agreement":null},{"id":"W5848928","doi":"10.2466/pms.1965.21.2.535","title":"The Complexity of List Ranking of Trees","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Bounded function; Ranking (information retrieval); Graph; Path (computing); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.05138417851192042,"score_gpt":0.29403200381298866,"score_spread":0.24264782530106824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5848928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98888874,0.0004741012,0.0055711763,0.00042107346,0.0006836083,0.00018974868,0.000002528941,0.00006220737,0.0037068275],"genre_scores_gemma":[0.99761796,0.000049946917,0.0022057313,0.000010941272,0.0000025289444,0.0000048193347,4.277686e-7,0.0000058613314,0.00010178073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877006,0.00015806576,0.00025013735,0.00017327264,0.0004195645,0.00022889233],"domain_scores_gemma":[0.9983949,0.0004803971,0.00014039122,0.0007463827,0.00019022137,0.000047717094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005150542,0.00008237936,0.00018093614,0.000064995875,0.00027532605,0.00001461054,0.0013759162,0.000028436356,0.0000046423183],"category_scores_gemma":[0.00015305546,0.00006154423,0.00008014681,0.000557829,0.0011687486,0.00019134738,0.00033634796,0.00013108306,0.0000041226667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016366337,0.00005643848,0.0037343716,0.0000063563807,0.0000131886045,0.0000044299554,0.00037169072,0.000008683258,0.0015521764,0.9928128,0.00015608715,0.0012673797],"study_design_scores_gemma":[0.00041972744,0.00009191568,0.013378213,0.000012848629,0.0000013984868,0.000008172758,0.000023269733,0.0011276782,0.01839701,0.96607786,0.0003957778,0.00006613477],"about_ca_topic_score_codex":0.000033003715,"about_ca_topic_score_gemma":0.000015491407,"teacher_disagreement_score":0.026734978,"about_ca_system_score_codex":0.00001769731,"about_ca_system_score_gemma":0.000057478697,"threshold_uncertainty_score":0.43063027},"labels":[],"label_agreement":null},{"id":"W603134616","doi":"10.1016/j.disc.2015.05.002","title":"Characterization of the finite C-MH-homogeneous graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Finite graph; Homogeneous; Discrete mathematics; Graph; Monomorphism; Isomorphism (crystallography); Injective function; Chemistry","score_opus":0.034794152584167154,"score_gpt":0.27989089660593613,"score_spread":0.24509674402176898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W603134616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23242608,0.000030227895,0.7638561,0.0003379281,0.00026507274,0.00032029068,0.000014808443,0.00007933427,0.0026701393],"genre_scores_gemma":[0.9672495,0.000010672909,0.031938225,0.00007849636,0.000018061335,0.000019081426,0.000006519307,0.00001879022,0.0006606604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883056,0.00008403725,0.00025833424,0.00016328495,0.0004654352,0.00019833013],"domain_scores_gemma":[0.99856514,0.00011844893,0.0001824257,0.0008957826,0.00015492036,0.000083266816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041399614,0.00010635668,0.0001511403,0.00007566143,0.00006544865,0.0000519719,0.0011393384,0.00003873597,0.000004369033],"category_scores_gemma":[0.00026821665,0.000069183865,0.00008287369,0.0006117848,0.00012128572,0.00021867719,0.00039525624,0.00009563554,0.00002363462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007602201,0.00009499079,0.0004176296,0.000090207766,0.000034038916,0.000005156142,0.0057009133,0.00024532416,0.028313624,0.96277773,0.00007377683,0.0022389942],"study_design_scores_gemma":[0.00030913219,0.00008112613,0.00040011035,0.00007425015,0.000012664601,0.000022194705,0.00016827961,0.05356017,0.03897584,0.90551895,0.00067098625,0.00020627645],"about_ca_topic_score_codex":0.0000011106292,"about_ca_topic_score_gemma":0.0000011629668,"teacher_disagreement_score":0.7348234,"about_ca_system_score_codex":0.000016265867,"about_ca_system_score_gemma":0.000054690852,"threshold_uncertainty_score":0.2821236},"labels":[],"label_agreement":null},{"id":"W61114388","doi":"","title":"Dissolved Graphs and Strong Perfect Graph Conjecture.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Graph; Combinatorics; Strong perfect graph theorem; Line graph; 1-planar graph","score_opus":0.012713019159197654,"score_gpt":0.26526512607692987,"score_spread":0.2525521069177322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61114388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9812013,0.0006711725,0.014949043,0.00059467606,0.00086916384,0.00031525045,0.0000025424088,0.0003294564,0.0010673753],"genre_scores_gemma":[0.99669063,0.000055126668,0.0030960385,0.00007071461,0.0000030464896,0.000023617464,0.0000020568307,0.000017844475,0.000040940315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982986,0.00010215889,0.00018091088,0.00053852604,0.00036448205,0.00051532296],"domain_scores_gemma":[0.9987711,0.00016170075,0.000060607123,0.0007061487,0.00007305761,0.00022739996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036328984,0.0002108346,0.00022173491,0.00022276855,0.0002803389,0.00016267496,0.0008205092,0.00007889163,0.0000072547896],"category_scores_gemma":[0.00007145657,0.00019405856,0.00008903527,0.00077856437,0.00024416664,0.00055381365,0.00034854462,0.00031848514,0.000021197498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009582441,0.000059627415,0.002168107,0.00000900989,0.000022629043,0.000030781404,0.00026693483,0.000060655348,0.000777914,0.9950277,0.000036298472,0.0015307241],"study_design_scores_gemma":[0.0013686988,0.0002518783,0.0054303096,0.000020016458,0.0000049886366,0.00002664301,0.000030801508,0.00013979193,0.0029123805,0.98949295,0.000093527626,0.0002280195],"about_ca_topic_score_codex":0.000023859055,"about_ca_topic_score_gemma":0.000008506896,"teacher_disagreement_score":0.015489295,"about_ca_system_score_codex":0.000047534326,"about_ca_system_score_gemma":0.000063097184,"threshold_uncertainty_score":0.79134786},"labels":[],"label_agreement":null},{"id":"W628055479","doi":"10.1002/net.21464","title":"Proximity graphs inside large weighted graphs","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Chordal graph; Computer science; Maximal independent set; Indifference graph; Pathwidth; Modular decomposition; Combinatorics; 1-planar graph; Mathematics; Graph; Line graph","score_opus":0.019144565450619933,"score_gpt":0.2774915085623688,"score_spread":0.2583469431117489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W628055479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04537657,0.0023907302,0.94255584,0.00022067453,0.0010946242,0.0004460571,0.0000028762286,0.0005658178,0.007346828],"genre_scores_gemma":[0.9817189,0.00010735229,0.01720728,0.00050582195,0.00018240944,0.000053221396,0.0000064255346,0.000023288474,0.00019529065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997355,0.00026474486,0.0002415064,0.00041943352,0.00043523576,0.0012841019],"domain_scores_gemma":[0.99819446,0.00020453692,0.00008801129,0.0010247782,0.00010888888,0.000379336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876624,0.00021423104,0.00021738192,0.00022334882,0.0003064014,0.00009471143,0.0011326876,0.000154141,0.00004827596],"category_scores_gemma":[0.00004225626,0.00018895911,0.00013759958,0.0016047725,0.000115473485,0.0014797607,0.0005550047,0.0005698411,0.00008634006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016719361,0.00017913523,0.027685188,0.0000068837116,0.000027987779,0.000010366348,0.00024176964,0.00009412541,0.000044987428,0.94796556,0.0021636009,0.021563686],"study_design_scores_gemma":[0.0013858805,0.00016607657,0.041095447,0.0000528126,0.000017346123,0.00006111315,0.00004385347,0.12956013,0.00087172556,0.7822976,0.043498423,0.00094957335],"about_ca_topic_score_codex":0.000004784861,"about_ca_topic_score_gemma":0.000011226938,"teacher_disagreement_score":0.93634236,"about_ca_system_score_codex":0.000033331355,"about_ca_system_score_gemma":0.000027976488,"threshold_uncertainty_score":0.7705529},"labels":[],"label_agreement":null},{"id":"W6358082","doi":"","title":"Comparison of Clique-Listing Algorithms.","year":2004,"lang":"en","type":"article","venue":"The International Journal of Periodontics & Restorative Dentistry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Clique graph; Mathematics; Algorithm; Discrete mathematics; Split graph; Graph; Clique; Computer science; Line graph; Graph power; Pathwidth","score_opus":0.061423386650519836,"score_gpt":0.4117061946477557,"score_spread":0.3502828079972359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6358082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36585724,0.0003886024,0.6306406,0.0014438927,0.0013617685,0.00006182863,0.000007281005,0.000010955866,0.00022782329],"genre_scores_gemma":[0.93963724,0.000033246,0.059934918,0.000060614228,0.0002082587,0.0000014091503,0.0000012491748,0.000008511274,0.00011455888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99764043,0.00013744574,0.00066948804,0.00014177465,0.0012361148,0.00017473372],"domain_scores_gemma":[0.99684185,0.00024114847,0.00090403284,0.00029362045,0.0016413265,0.00007802859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091519987,0.00012215652,0.00026273436,0.00018997012,0.00011677107,0.00020877158,0.0028176683,0.000047378915,0.000010253235],"category_scores_gemma":[0.000502275,0.000090798334,0.0001592604,0.00026116587,0.00025084987,0.00059988815,0.00039079756,0.00048868323,0.000008126736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056639884,0.0012028984,0.029542772,0.00005145269,0.0011913076,0.0017404131,0.019251794,0.018652476,0.0897738,0.80032015,0.0013547721,0.036351755],"study_design_scores_gemma":[0.008675999,0.0024643536,0.06593417,0.0014955279,0.00015496642,0.0061406735,0.010424776,0.024071272,0.4573717,0.41080862,0.0111555895,0.0013023436],"about_ca_topic_score_codex":0.000016688135,"about_ca_topic_score_gemma":0.000022131475,"teacher_disagreement_score":0.57378,"about_ca_system_score_codex":0.00019538226,"about_ca_system_score_gemma":0.00029341254,"threshold_uncertainty_score":0.52359754},"labels":[],"label_agreement":null},{"id":"W636225799","doi":"10.1016/j.ejc.2015.03.026","title":"The number of lines in a matroid with no <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-minor","year":2015,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Matroid; Mathematics; Prime power; Combinatorics; Rank (graph theory); Prime (order theory); Discrete mathematics; Oriented matroid; Graphic matroid","score_opus":0.02048945282311033,"score_gpt":0.25401326868118757,"score_spread":0.23352381585807724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W636225799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.598637,0.0023348797,0.0030742288,0.00093348045,0.004427628,0.000058792793,0.00015822919,0.00016180781,0.39021397],"genre_scores_gemma":[0.9883235,0.001999511,0.0044948775,0.00095895963,0.0021942288,0.000263942,0.00019775344,0.00096292276,0.0006042884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98566765,0.0016567261,0.003027767,0.0018241223,0.0047484245,0.0030753224],"domain_scores_gemma":[0.9875462,0.002626534,0.00403225,0.003089683,0.00081710005,0.0018882072],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.0065127104,0.0011002288,0.0005385037,0.00086167565,0.0016991402,0.0021719038,0.0055221063,0.0013138809,0.078896336],"category_scores_gemma":[0.0035862543,0.001795146,0.001943067,0.0026631926,0.0025430988,0.0025896472,0.0036457225,0.0033261185,0.0022450862],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036647937,0.0007052643,0.00010306881,0.0009002884,0.0015191247,0.0052020806,0.002812205,0.0027463573,0.0012042462,0.73653734,0.24196395,0.002641244],"study_design_scores_gemma":[0.006108374,0.0063130474,0.00032057037,0.002764534,0.0012871234,0.0062538083,0.002676796,0.043774284,0.9145708,0.00233842,0.0110952975,0.0024969282],"about_ca_topic_score_codex":0.00043441658,"about_ca_topic_score_gemma":0.0004057671,"teacher_disagreement_score":0.91336656,"about_ca_system_score_codex":0.000037212776,"about_ca_system_score_gemma":0.002737841,"threshold_uncertainty_score":0.9999826},"labels":[],"label_agreement":null},{"id":"W646088219","doi":"10.1007/b135661","title":"Graph Theory and Combinatorial Optimization","year":2005,"lang":"en","type":"book","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Combinatorial optimization; Graph theory; Theoretical computer science; Combinatorics; Mathematics; Algorithm","score_opus":0.011058385292386614,"score_gpt":0.2648337191834106,"score_spread":0.25377533389102397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W646088219","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.0416336e-7,0.0003794946,0.58779097,0.000062820516,0.00031950697,0.00016588837,0.0000018772607,0.00014952252,0.41112953],"genre_scores_gemma":[0.000060710525,0.0004201576,0.09776011,0.00022519122,0.00034731708,0.000017581122,0.00001982008,0.000039014674,0.9011101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984528,0.00018080174,0.00018960044,0.0005199361,0.00038734183,0.00026952583],"domain_scores_gemma":[0.99856365,0.0004482062,0.000086186985,0.00065784156,0.00011727281,0.0001268415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007913434,0.00022293405,0.0002306618,0.0003187891,0.0001242186,0.00015542739,0.0008877037,0.0002296542,0.00014780933],"category_scores_gemma":[0.000063694264,0.0002013606,0.00006776875,0.00017023397,0.00020121183,0.00042980904,0.00050559366,0.0003592657,0.00004019922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015731808,0.000012173175,5.1645026e-7,0.000010243573,0.000017636794,0.0000054881584,0.000039790953,0.0006596871,0.0000011145013,0.98241645,0.0043838094,0.012437368],"study_design_scores_gemma":[0.0003179504,0.000062465784,0.0000010694826,0.000020909609,0.0000055811124,0.0000099661065,0.000002176265,0.0039079683,0.00001853846,0.956341,0.03907451,0.0002378258],"about_ca_topic_score_codex":4.113789e-7,"about_ca_topic_score_gemma":5.277793e-7,"teacher_disagreement_score":0.49003083,"about_ca_system_score_codex":0.00006502155,"about_ca_system_score_gemma":0.00017672482,"threshold_uncertainty_score":0.82112473},"labels":[],"label_agreement":null},{"id":"W650364680","doi":"10.1016/j.dam.2015.05.035","title":"Ferrers dimension of grid intersection graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Combinatorics; Mathematics; Bipartite graph; Intersection (aeronautics); Permutation graph; Intersection graph; Discrete mathematics; Chordal graph; Grid; Indifference graph; Dimension (graph theory); Graph; Line graph","score_opus":0.03533442601073086,"score_gpt":0.2956990426382853,"score_spread":0.2603646166275544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W650364680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07501801,0.00003428955,0.90604275,0.00007250621,0.00030276048,0.0003402229,0.0000031377604,0.00016331085,0.018022997],"genre_scores_gemma":[0.81879455,0.0000051832353,0.18104334,0.00002802137,0.00001824189,0.000027367654,0.000004579816,0.000017027127,0.00006167924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986928,0.000024201672,0.00030678263,0.0002547429,0.00047415736,0.00024730226],"domain_scores_gemma":[0.99880654,0.00008981963,0.0001627295,0.0006910002,0.0001082523,0.0001416882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005301197,0.00014160038,0.00022551106,0.0001862695,0.000049005124,0.000036559006,0.0006287068,0.000053372205,0.0000047823205],"category_scores_gemma":[0.00006612283,0.00011803003,0.00007019088,0.0005357782,0.0001235254,0.00021486131,0.0003350609,0.00013965204,0.000044908164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019880592,0.000066125736,0.000015698868,0.000058584577,0.000019510317,0.0000023208022,0.0029975988,0.00015193288,0.0123262005,0.9818572,0.00044772835,0.002037223],"study_design_scores_gemma":[0.0005330654,0.00012701044,0.000026719348,0.00004370696,0.0000105977615,0.000013322991,0.0018096699,0.018108485,0.038609486,0.94026256,0.00023844965,0.00021693559],"about_ca_topic_score_codex":0.0000030359786,"about_ca_topic_score_gemma":0.0000015259902,"teacher_disagreement_score":0.74377656,"about_ca_system_score_codex":0.00004119965,"about_ca_system_score_gemma":0.000036992056,"threshold_uncertainty_score":0.48131248},"labels":[],"label_agreement":null},{"id":"W651716066","doi":"10.1007/978-1-4612-1388-8","title":"Algorithmic Problems in Groups and Semigroups","year":2000,"lang":"en","type":"book","venue":"Birkhäuser Boston eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Warwick; Marquette University; McGill University; U.S. Naval Academy; Northern Illinois University; Vanderbilt University; Boston College","keywords":"Computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.01661873575901487,"score_gpt":0.24693942095271987,"score_spread":0.230320685193705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W651716066","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013048855,0.0038378777,0.021571234,0.00018522328,0.0004648655,0.0028459046,0.00005197189,0.0008642197,0.9688738],"genre_scores_gemma":[0.00233693,0.00044973302,0.007941151,0.00041635995,0.00025787612,0.00029458618,0.00003084766,0.00019976149,0.98807275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960035,0.00019692311,0.000632058,0.0014413364,0.00076016155,0.00096601306],"domain_scores_gemma":[0.9976722,0.00023975626,0.0001989704,0.001506531,0.00007902774,0.0003035288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071920926,0.0006674107,0.00071290537,0.0010009294,0.00015690396,0.00024965603,0.0018947889,0.0005766639,0.000047523794],"category_scores_gemma":[0.000018807586,0.0006716834,0.00015063066,0.00020116476,0.00039099902,0.0003642526,0.0008448457,0.0013368538,0.00019854419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009186896,0.00016207516,0.00024843478,0.0007031662,0.00015990427,0.0011273341,0.005471185,0.00007423947,0.00042509602,0.5230281,0.011046678,0.45746192],"study_design_scores_gemma":[0.001263437,0.00028344573,0.00024030005,0.00069462863,0.000015775326,0.0002139769,0.000013937452,0.001290404,0.00014281682,0.6404277,0.3541109,0.0013026858],"about_ca_topic_score_codex":0.00003199318,"about_ca_topic_score_gemma":0.00009697055,"teacher_disagreement_score":0.45615923,"about_ca_system_score_codex":0.0002927415,"about_ca_system_score_gemma":0.00045254745,"threshold_uncertainty_score":0.9995734},"labels":[],"label_agreement":null},{"id":"W65985817","doi":"","title":"Characterizing Intersection Graphs of Substars of a Star.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Intersection (aeronautics); Combinatorics; Geography; Mathematical analysis; Cartography","score_opus":0.01302765539315038,"score_gpt":0.2551824923929553,"score_spread":0.24215483699980495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65985817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936667,0.000069785514,0.004680578,0.000047314305,0.00064152665,0.00012514017,0.0000034977854,0.000057501053,0.0007079613],"genre_scores_gemma":[0.9978129,0.000007262499,0.0021216648,0.000009634609,0.0000024257686,0.0000072784665,0.000003388099,0.000009130784,0.00002627447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998828,0.00009275843,0.00030843285,0.00023108536,0.00030946624,0.00023027111],"domain_scores_gemma":[0.99900013,0.00011041411,0.0001887854,0.00048126228,0.00017859114,0.000040798568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003542245,0.0001010412,0.00019849351,0.00027585158,0.000045730856,0.000017928758,0.0006011285,0.000044609944,0.000007092577],"category_scores_gemma":[0.000031308282,0.00010398271,0.000089575,0.0008176111,0.0001229666,0.0004321606,0.00016064862,0.00012680299,0.000004145808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023079672,0.00010854013,0.0029947693,0.000024411036,0.000011965907,0.0000037590003,0.00027360508,0.000010867889,0.0717993,0.92391807,0.0000371227,0.0007945361],"study_design_scores_gemma":[0.00041638114,0.00016805952,0.014468405,0.000033474484,0.000002778381,0.00000347927,0.000051865227,0.00072404544,0.114446424,0.86950654,0.00008179295,0.000096751275],"about_ca_topic_score_codex":0.00010074987,"about_ca_topic_score_gemma":0.000006853061,"teacher_disagreement_score":0.0544115,"about_ca_system_score_codex":0.000034690675,"about_ca_system_score_gemma":0.00003289479,"threshold_uncertainty_score":0.42402917},"labels":[],"label_agreement":null},{"id":"W66989490","doi":"","title":"Connected resolving sets in graphs","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017811914838034626,"score_gpt":0.2806273165562354,"score_spread":0.2628154017182008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66989490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98067296,0.00041169376,0.0030964536,0.00021020723,0.0013299627,0.00031482778,8.582885e-7,0.00025684922,0.013706201],"genre_scores_gemma":[0.9946916,0.000016682365,0.0050713765,0.00009065035,7.2951246e-7,0.00002352585,8.4304503e-7,0.000013591239,0.0000909861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981288,0.00037414153,0.00022304466,0.00043200128,0.0003251081,0.0005169506],"domain_scores_gemma":[0.9986003,0.0003777975,0.000052415828,0.00074713194,0.00009609528,0.00012624315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080621603,0.00013999254,0.00017739221,0.00032115777,0.000115777395,0.000083271676,0.0008551887,0.00007078212,0.00002306837],"category_scores_gemma":[0.0005578504,0.0001466264,0.000050055456,0.0017083162,0.00007438228,0.0006308124,0.0001656925,0.00030504886,0.000062072075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048324746,0.00006517863,0.0061865225,0.000004691205,0.000005207762,0.00006020052,0.00022684287,0.000013862098,0.0006204115,0.99182576,0.00014969196,0.000836781],"study_design_scores_gemma":[0.000826083,0.0000614361,0.0037529974,0.00001949717,7.67555e-7,0.000011997441,0.00003084123,0.00088225264,0.0028983285,0.9905037,0.00083684525,0.00017520633],"about_ca_topic_score_codex":0.000011325174,"about_ca_topic_score_gemma":0.000010446266,"teacher_disagreement_score":0.014018669,"about_ca_system_score_codex":0.00006598893,"about_ca_system_score_gemma":0.000075604374,"threshold_uncertainty_score":0.59792507},"labels":[],"label_agreement":null},{"id":"W68296954","doi":"","title":"The number of independent sets intersecting the set of leaves in trees.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Combinatorics; Computer science; Programming language","score_opus":0.02028516209727581,"score_gpt":0.3224003603183159,"score_spread":0.3021151982210401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68296954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949954,0.000103174854,0.0014693593,0.0002259689,0.0006269037,0.0001663465,8.199399e-7,0.000017955945,0.0023940722],"genre_scores_gemma":[0.9995853,0.000011980791,0.00031070964,0.000017557259,0.0000033027711,0.0000050757944,2.1125162e-7,0.000007250818,0.000058644764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850434,0.00019106995,0.00035012056,0.00019257992,0.00043460575,0.00032729388],"domain_scores_gemma":[0.997636,0.0013854364,0.00016423076,0.0006618944,0.000111979876,0.000040424584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027836524,0.00009329873,0.00014527823,0.00008231101,0.000110226145,0.000029644698,0.0014270425,0.000045514455,0.000004326146],"category_scores_gemma":[0.00026059043,0.00005809959,0.00006286936,0.0007273291,0.00022717504,0.00019005493,0.00049688376,0.00031452067,0.0000065558597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033775417,0.000042579228,0.043490015,0.0000072778953,0.000017136525,0.0000090294425,0.002934704,0.000022172935,0.0007064148,0.9395482,0.000042696858,0.013146001],"study_design_scores_gemma":[0.00058270217,0.00006469608,0.053203426,0.000040039515,0.000001972511,0.000013632023,0.0017240549,0.00064233737,0.021225309,0.92224985,0.00015714059,0.00009486017],"about_ca_topic_score_codex":0.00006905146,"about_ca_topic_score_gemma":0.00015451004,"teacher_disagreement_score":0.020518893,"about_ca_system_score_codex":0.00004763776,"about_ca_system_score_gemma":0.00004310241,"threshold_uncertainty_score":0.26518238},"labels":[],"label_agreement":null},{"id":"W6891559455","doi":"10.4230/lipics.disc.2022.40","title":"Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dominating set; Set cover problem; Set (abstract data type); Connected dominating set; Cover (algebra); Distributed algorithm","score_opus":0.030134733620477132,"score_gpt":0.2921644039674968,"score_spread":0.2620296703470197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891559455","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047174003,0.00009213748,0.9849509,0.0006150569,0.00030059804,0.0034953717,0.0036536,0.00021715323,0.0019578054],"genre_scores_gemma":[0.09386569,0.000031280088,0.89316374,0.0017256375,0.00024185007,0.003267021,0.005681429,0.00012315616,0.001900177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960836,0.00010008712,0.0010673074,0.00061259134,0.0009063081,0.0012300642],"domain_scores_gemma":[0.9974984,0.00038815173,0.000511346,0.00091382733,0.00030996997,0.00037828722],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018453225,0.00044807993,0.00052489736,0.00036467024,0.0013535586,0.00062819646,0.0018946719,0.00011401228,0.000020393823],"category_scores_gemma":[0.00015324821,0.00044596838,0.00022602227,0.0008744762,0.00017530263,0.0019365741,0.0019961426,0.0005730411,0.000008466834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016007504,0.0020202445,0.0021409267,0.003832725,0.0010382143,0.00002855827,0.07772658,0.006104793,0.00048640106,0.53327596,0.07689475,0.2948501],"study_design_scores_gemma":[0.009487802,0.0010759027,0.000042867632,0.000049000293,0.000042773547,0.0002121933,0.005785281,0.7264531,0.0002911424,0.045459654,0.21012886,0.0009713689],"about_ca_topic_score_codex":0.000011445935,"about_ca_topic_score_gemma":0.0000022724396,"teacher_disagreement_score":0.72034836,"about_ca_system_score_codex":0.00025924869,"about_ca_system_score_gemma":0.00021263956,"threshold_uncertainty_score":0.99994653},"labels":[],"label_agreement":null},{"id":"W6891661482","doi":"10.48336/n2cc-p369","title":"The deduction model for Cops and Robber","year":2022,"lang":"en","type":"article","venue":"Memorial University Research Repository (Memorial University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Cartesian product; Product (mathematics); Upper and lower bounds; Complete information; Order (exchange); Variation (astronomy)","score_opus":0.0375121743405933,"score_gpt":0.27396587992465204,"score_spread":0.23645370558405876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891661482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31699148,0.000392948,0.59342146,0.0061944234,0.025691768,0.006887365,0.00018024682,0.0011166824,0.04912363],"genre_scores_gemma":[0.81124556,0.00024982853,0.008504474,0.00003079796,0.002702345,0.000013189232,0.000020099978,0.00006202455,0.17717169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99509877,0.0016475854,0.00017595562,0.0009093,0.0012554753,0.00091291394],"domain_scores_gemma":[0.996607,0.0012903042,0.000118773336,0.0009348431,0.00069454947,0.00035454496],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024870008,0.00020656035,0.00023894418,0.00080085703,0.010346052,0.00031328053,0.0030647644,0.00010777506,0.0000073248434],"category_scores_gemma":[0.00021786819,0.000221323,0.00017444484,0.0020693042,0.00080568687,0.0012091773,0.0034089643,0.0009677084,0.0000050705603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006745738,0.00025234086,0.000118124415,0.000039792314,0.00018830027,0.00062481523,0.001882127,0.012284991,0.0130729275,0.93605554,0.023183007,0.0055523016],"study_design_scores_gemma":[0.00627968,0.0013029638,0.000055352448,0.000014033689,0.000060439266,0.00013357095,0.00900225,0.2376473,0.003291472,0.030476816,0.71099097,0.0007451523],"about_ca_topic_score_codex":0.00018576457,"about_ca_topic_score_gemma":0.00003693699,"teacher_disagreement_score":0.90557873,"about_ca_system_score_codex":0.0012041244,"about_ca_system_score_gemma":0.0009565257,"threshold_uncertainty_score":0.99094236},"labels":[],"label_agreement":null},{"id":"W6903249076","doi":"10.1051/ro/2024108/pdf","title":"Graphs obtained by disjoint unions and joins of cliques and stable sets","year":2024,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Disjoint sets; Cograph; Split graph; Multipartite; Clique-sum; Joins; Independent set; Graph; Chordal graph","score_opus":0.013948846660069897,"score_gpt":0.27235995120281015,"score_spread":0.25841110454274024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903249076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8776305,0.00925101,0.10246044,0.007120408,0.00045098006,0.00050110143,0.000056327477,0.0009868284,0.0015424158],"genre_scores_gemma":[0.9325176,0.0013309655,0.06598574,0.000024352783,0.000009671963,0.00002272127,0.000002796068,0.00001587435,0.000090292924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985795,0.00002496109,0.00034252816,0.0005201733,0.00019802952,0.00033480237],"domain_scores_gemma":[0.99899584,0.000054710003,0.00008499248,0.00068009767,0.000097120486,0.000087221175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037359504,0.00018616265,0.00031640325,0.00090786064,0.00011011994,0.000055653218,0.00064717955,0.00018873233,0.0000029438188],"category_scores_gemma":[0.00012116117,0.00016797714,0.000057862388,0.0011343571,0.0011756405,0.00061634165,0.0009302495,0.00042336062,0.0000025997542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000659179,0.00003949415,0.0015968338,0.00017832158,0.00005733004,0.00001568621,0.00009815052,0.000009539023,0.027017841,0.90581554,0.00008856913,0.06507611],"study_design_scores_gemma":[0.0006165886,0.000535547,0.0016045544,0.00058974855,0.000033921315,0.000063680774,0.00006703234,0.006345177,0.1612664,0.7614244,0.066956006,0.00049689476],"about_ca_topic_score_codex":0.000032018197,"about_ca_topic_score_gemma":0.00001986848,"teacher_disagreement_score":0.14439107,"about_ca_system_score_codex":0.000023937928,"about_ca_system_score_gemma":0.00009521469,"threshold_uncertainty_score":0.6849909},"labels":[],"label_agreement":null},{"id":"W6903276152","doi":"10.1051/ita/2024015/pdf","title":"Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees","year":2024,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Feedback vertex set; Directed graph; Feedback arc set; Vertex (graph theory); Graph; Time complexity; Directed acyclic graph; Strongly connected component","score_opus":0.013390165934388692,"score_gpt":0.2607620653767557,"score_spread":0.24737189944236704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903276152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95179296,0.0018697646,0.03549445,0.004695087,0.0010862971,0.0005898285,0.000008681048,0.0024116081,0.0020513346],"genre_scores_gemma":[0.8843995,0.00013766452,0.115211606,0.000027118847,0.000022638782,0.00006032077,0.0000036090971,0.000030716452,0.00010682851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767584,0.000052972806,0.00044704275,0.00084124785,0.0003747892,0.00060809514],"domain_scores_gemma":[0.99850935,0.00009046023,0.00009806688,0.0010935153,0.00012134413,0.00008724986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045500373,0.00030957762,0.00039958154,0.0020216221,0.00013210869,0.000109166045,0.0016230069,0.0002747673,0.000006643899],"category_scores_gemma":[0.00017383952,0.00026720713,0.00009244363,0.0046586846,0.0007091895,0.0009207592,0.0006654223,0.00070895936,0.000038937636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003532769,0.00013491667,0.007747773,0.00018212048,0.0001371054,0.00036790044,0.00039407043,0.00057320227,0.03662014,0.62657136,0.000071140974,0.32716492],"study_design_scores_gemma":[0.004636153,0.0018426062,0.027852476,0.006354263,0.00008903174,0.00042341056,0.00033162956,0.1655738,0.25372204,0.4848438,0.05119527,0.0031355182],"about_ca_topic_score_codex":0.00004167701,"about_ca_topic_score_gemma":0.00031287305,"teacher_disagreement_score":0.3240294,"about_ca_system_score_codex":0.00009431576,"about_ca_system_score_gemma":0.00023096097,"threshold_uncertainty_score":0.999978},"labels":[],"label_agreement":null},{"id":"W6910408406","doi":"10.4230/lipics.esa.2022.59","title":"Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Path (computing); Matrix multiplication; Matrix (chemical analysis); Range query (database); Colored; Tree (set theory); Element (criminal law); Product (mathematics); Node (physics)","score_opus":0.01677952594851535,"score_gpt":0.28010107376614735,"score_spread":0.263321547817632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910408406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78361064,0.0002203901,0.210615,0.00084401114,0.0004602948,0.0031832089,0.000336119,0.000247283,0.0004830693],"genre_scores_gemma":[0.961585,0.0000289708,0.036470816,0.00028810184,0.00004388941,0.00088873977,0.00017941228,0.000035450346,0.00047964646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971489,0.0001362026,0.0008672629,0.00046420505,0.0006261894,0.00075728446],"domain_scores_gemma":[0.9981684,0.00018579325,0.00033323272,0.0009789902,0.00016943757,0.00016412567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001027199,0.00032753326,0.00040413855,0.0005138989,0.0005095198,0.00027936773,0.0012540728,0.000071727554,0.00002143227],"category_scores_gemma":[0.000108290275,0.00031774014,0.00010607901,0.0007563297,0.00020108596,0.0019792207,0.0013979162,0.00049376563,0.000026746913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053547504,0.0038437585,0.16376062,0.0035714714,0.0006372721,0.00017649539,0.22344516,0.018998781,0.011877977,0.25865412,0.007451752,0.30222782],"study_design_scores_gemma":[0.012333002,0.0016423467,0.018661488,0.00014183093,0.00003526615,0.0004453105,0.008793923,0.83644176,0.0048307595,0.019702636,0.0950411,0.0019306026],"about_ca_topic_score_codex":0.000027247155,"about_ca_topic_score_gemma":0.00005603959,"teacher_disagreement_score":0.81744295,"about_ca_system_score_codex":0.0002588882,"about_ca_system_score_gemma":0.00010265239,"threshold_uncertainty_score":0.99992746},"labels":[],"label_agreement":null},{"id":"W6929452493","doi":"10.48550/arxiv.1406.6413","title":"A finer reduction of constraint problems to digraphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Nondeterministic algorithm; Complexity of constraint satisfaction; Constraint (computer-aided design); Conjecture; Constraint satisfaction; Reduction (mathematics); Algebraic number","score_opus":0.06930224953546349,"score_gpt":0.21551348069052031,"score_spread":0.14621123115505683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929452493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21870364,0.000020405336,0.77817214,0.00012845176,0.00030227276,0.00049065874,0.000011196303,0.00014100927,0.002030246],"genre_scores_gemma":[0.9928219,0.00003745744,0.006111238,0.000025421032,0.00003650292,0.0000029741861,0.0000053890367,0.000014903638,0.000944262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979662,0.00020593722,0.00023712583,0.0010582611,0.00014956224,0.00038293688],"domain_scores_gemma":[0.997591,0.00009611856,0.00023260726,0.0015227159,0.00032671704,0.00023083483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047308637,0.00025396523,0.0003567811,0.00064262876,0.00008585244,0.000050131548,0.0019446105,0.00019260324,0.000021433252],"category_scores_gemma":[0.000069185524,0.00028260204,0.00021604827,0.00107067,0.00030440232,0.00022835966,0.001899479,0.0005116821,0.00004880166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038170136,0.00008619783,0.00033725685,0.00013196257,0.00006921881,0.000031124335,0.0003553789,0.36512247,0.00174242,0.62951165,0.00019627699,0.0023778402],"study_design_scores_gemma":[0.00070639065,0.0003403772,0.00059418916,0.00040171028,0.000045268873,0.000021939753,0.00013222691,0.15918644,0.0041835043,0.8321263,0.0014231836,0.00083844],"about_ca_topic_score_codex":0.000059095823,"about_ca_topic_score_gemma":0.000009779882,"teacher_disagreement_score":0.7741182,"about_ca_system_score_codex":0.000098639815,"about_ca_system_score_gemma":0.00015851679,"threshold_uncertainty_score":0.9999626},"labels":[],"label_agreement":null},{"id":"W6944628196","doi":"10.20382/jocg.v16i2a2","title":"Constrained and ordered level planarity parameterized by the number of levels","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Planarity testing; Parameterized complexity; Disjoint sets; Time complexity; Graph; Crossing number (knot theory); Twist; Order (exchange)","score_opus":0.02604492658022801,"score_gpt":0.28367366597794924,"score_spread":0.25762873939772124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6944628196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3042461,0.00006570733,0.69305414,0.0013846288,0.000092676724,0.00007141097,0.000035782898,0.000008421125,0.0010411114],"genre_scores_gemma":[0.95720303,0.000015864056,0.041804705,0.00014968826,0.000009579396,9.062861e-8,0.0000019702768,0.0000030757906,0.0008119842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876595,0.00021999149,0.00029035946,0.00015351696,0.00041296365,0.00015721004],"domain_scores_gemma":[0.9975985,0.0012871417,0.0003136221,0.00015822922,0.00056135695,0.00008110083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154751,0.000104688246,0.00025824766,0.000550602,0.00014590219,0.00005353325,0.00079441257,0.000054683776,0.000024184888],"category_scores_gemma":[0.00016245859,0.00008738811,0.00010042691,0.0015659239,0.00033941006,0.0004183049,0.00022663901,0.00026475562,0.0000010825224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006199825,0.00032458978,0.011223865,0.00009481823,0.000859271,0.00015496429,0.00044724744,0.013944398,0.0036547035,0.9314416,0.0029276276,0.034306914],"study_design_scores_gemma":[0.015740419,0.00062356656,0.10654112,0.00037462215,0.0002113424,0.001130381,0.0020673256,0.046497583,0.0053776545,0.7898919,0.030637428,0.0009066366],"about_ca_topic_score_codex":0.0000084343565,"about_ca_topic_score_gemma":8.845228e-7,"teacher_disagreement_score":0.65295696,"about_ca_system_score_codex":0.00005562497,"about_ca_system_score_gemma":0.00029437797,"threshold_uncertainty_score":0.35635835},"labels":[],"label_agreement":null},{"id":"W6957551228","doi":"10.6068/dp14ba901929355","title":"Trend 1961 - 2013. Statistics Canada. CANSIM: Construction - Nonresidential Building Construction | Country: Canada | Table: Flows and stocks of fixed non-residential capital, by sector of North American Industry Classification System (NAICS) and asset | Variable: Geometric (infinite) end-year net stock, Telecommunication equipment (x 1,000,000), Administrative and support, waste management and remediation services, Current prices | Units: $CAD, 1961-2013. Data-Planet™ Statistical Ready Reference by Conquest Systems, Inc. Dataset-ID: 075-001-035.","year":2015,"lang":"en","type":"other","venue":"Data Planet","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Economic statistics; Census; Official statistics; Summary statistics; Stock (firearms); Index (typography); Publication; Business statistics; Private sector","score_opus":0.025001666218496695,"score_gpt":0.2699939128488903,"score_spread":0.2449922466303936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957551228","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038397504,0.0011148659,0.0015586849,0.000002762406,0.00037575606,0.0011562328,0.99529237,0.00003574941,0.000079623394],"genre_scores_gemma":[0.0054072845,0.002678056,0.004000068,0.000008828868,0.00007227697,0.000041548155,0.987695,0.000059490892,0.0000374945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995719,0.0005234622,0.0010218751,0.0010661774,0.0011913327,0.00047812634],"domain_scores_gemma":[0.995419,0.0005640745,0.001868356,0.0015387576,0.0002028827,0.00040691113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072772725,0.00050478475,0.0007652307,0.00042130423,0.00019983991,0.00030158804,0.0012019993,0.0002405885,0.00006811761],"category_scores_gemma":[0.000038543112,0.0005303722,3.86948e-7,0.0008208502,0.0005285771,0.0006529565,0.0010163354,0.00070865976,4.8168897e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010513828,0.000046250323,0.0006231021,0.0017168594,0.0002643655,0.000017902288,0.000013557134,0.000037896465,0.00002184386,0.00083660986,0.9931284,0.0031880462],"study_design_scores_gemma":[0.0010550309,0.0002586284,0.00036619892,0.000118088865,0.00032613176,0.00012112765,0.0012019366,0.019966226,0.0000014390835,0.0000012464835,0.9760191,0.0005648828],"about_ca_topic_score_codex":0.9821434,"about_ca_topic_score_gemma":0.9715641,"teacher_disagreement_score":0.019928329,"about_ca_system_score_codex":0.00023201024,"about_ca_system_score_gemma":0.0024978418,"threshold_uncertainty_score":0.9997148},"labels":[],"label_agreement":null},{"id":"W6957651068","doi":"10.60692/egsba-a0564","title":"Rice straw anaerobic digestion enhancement through bioaugmentation: effect on the microbial community","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kwantlen Polytechnic University","funders":"","keywords":"Microbial consortium; Microbial population biology; Anaerobic digestion; Bioconversion; Straw; Metagenomics; Bioenergy; Biogas; Anaerobic exercise","score_opus":0.05594527197766261,"score_gpt":0.27987867046795056,"score_spread":0.22393339849028795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957651068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77033883,9.032856e-7,0.22596446,0.00028833136,0.00043696494,0.0007356153,0.000022123315,0.00045069287,0.001762066],"genre_scores_gemma":[0.9989496,2.9410538e-7,0.0004477257,0.00024765078,0.000033940345,0.00017053663,0.00003431152,0.000006999277,0.000108950866],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99779797,0.0008016038,0.00040842182,0.00015700395,0.00049611647,0.00033885878],"domain_scores_gemma":[0.99853903,0.00015767498,0.0002160652,0.000909005,0.00012549365,0.000052729887],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017071004,0.00018496989,0.00015872507,0.00022930073,0.0008298383,0.00040569023,0.00089017896,0.000062367886,0.000009457486],"category_scores_gemma":[0.000041982967,0.00012405626,0.000072513074,0.0011746477,0.00007008739,0.0014306465,0.00025898035,0.00028851198,0.002813703],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000711617,0.000055335564,0.010646592,0.0024379548,0.0004258363,0.000027914377,0.71609044,0.004458152,0.0051063667,0.24312396,0.0041963616,0.012719451],"study_design_scores_gemma":[0.010028185,0.005424581,0.10397982,0.0022754676,0.0000957989,0.00016752815,0.07670378,0.033234023,0.7613151,0.0014972392,0.0025002826,0.0027782195],"about_ca_topic_score_codex":0.000014087518,"about_ca_topic_score_gemma":2.9992324e-7,"teacher_disagreement_score":0.7562087,"about_ca_system_score_codex":0.00017593996,"about_ca_system_score_gemma":0.000026012427,"threshold_uncertainty_score":0.9979627},"labels":[],"label_agreement":null},{"id":"W6979296102","doi":"","title":"Small hitting sets for longest paths and cycles","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Graph; Upper and lower bounds; Mathematical proof; Path graph; Connectivity; Complete graph; Intersection graph; Path (computing); Strength of a graph","score_opus":0.06631587931356754,"score_gpt":0.3299141863886663,"score_spread":0.2635983070750988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979296102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8173286,0.00038363543,0.1796375,0.0014890423,0.00012906564,0.0002288862,0.0000025979018,0.00011199525,0.0006887129],"genre_scores_gemma":[0.97573835,0.000031524327,0.023143392,0.00037356213,0.000030645173,0.000046383062,0.0000014650155,0.00000896161,0.00062572444],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989774,0.000053595802,0.00014434056,0.00039930124,0.00008939829,0.00033593777],"domain_scores_gemma":[0.9988853,0.000493165,0.000039650105,0.00043180925,0.00007867623,0.00007140451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041136282,0.00010645721,0.00012746254,0.00011936579,0.00020998844,0.00007319662,0.00055338815,0.000047612426,0.0000019998838],"category_scores_gemma":[0.00026142772,0.00010025328,0.000042450178,0.0003138212,0.0000862176,0.00022363682,0.0004133688,0.00012546309,0.000013638045],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029756624,0.000063821084,0.6278045,0.00012890964,0.000039993196,0.000024209772,0.0005293864,0.00003445275,0.007121821,0.1427005,0.00024700575,0.22127561],"study_design_scores_gemma":[0.0014131429,0.00021019283,0.77211773,0.00018984683,0.000016681563,0.000015011852,0.00021561886,0.014262706,0.02423997,0.17789567,0.008917114,0.00050633855],"about_ca_topic_score_codex":0.000006053139,"about_ca_topic_score_gemma":0.000018602737,"teacher_disagreement_score":0.22076929,"about_ca_system_score_codex":0.000019555153,"about_ca_system_score_gemma":0.000043100055,"threshold_uncertainty_score":0.40882102},"labels":[],"label_agreement":null},{"id":"W6982391525","doi":"","title":"Idaho Health and Welfare: Treatment and Transitions Program Evaluation 2020, Year 2 Quarter 1 Report","year":2020,"lang":"en","type":"article","venue":"Scholar Works  (Boise State University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Substance Abuse and Mental Health Services Administration; U.S. Department of Health and Human Services","keywords":"Quarter (Canadian coin); Mental health; Program evaluation; Mental illness; Administration (probate law); Human services; Pilot program; Substance abuse","score_opus":0.026740880101894522,"score_gpt":0.28910185815821343,"score_spread":0.2623609780563189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6982391525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61013514,0.0027837986,0.28762653,0.08758443,0.00025415802,0.0065564425,0.00012424646,0.0010261481,0.0039091147],"genre_scores_gemma":[0.95776206,0.0015726675,0.039682385,0.00030173743,0.000038988997,0.0000185358,0.000065568885,0.000022729873,0.0005353255],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984553,0.00034099707,0.00013593977,0.0005309843,0.00025677987,0.00028002277],"domain_scores_gemma":[0.99901783,0.000025927671,0.000071997376,0.0002989924,0.00012624373,0.00045900262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041343557,0.00013581535,0.00015993584,0.00015758444,0.0004956509,0.00019156912,0.0002073515,0.000041790972,0.000017211978],"category_scores_gemma":[0.000035608427,0.00013993082,0.000044683395,0.0008698498,0.0001189777,0.0011397164,0.00009714178,0.00026701164,0.000007504633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037091813,0.00035295438,0.0020761946,0.00009718254,0.00019345214,0.0012101177,0.017104536,0.0005435517,0.00016600086,0.02237623,0.0005175229,0.95499134],"study_design_scores_gemma":[0.02062055,0.012091571,0.015045884,0.00052933855,0.0002828299,0.00055171014,0.03286187,0.09269799,0.00034227074,0.02760452,0.7947712,0.002600268],"about_ca_topic_score_codex":0.000014041605,"about_ca_topic_score_gemma":0.000020546951,"teacher_disagreement_score":0.9523911,"about_ca_system_score_codex":0.00013332962,"about_ca_system_score_gemma":0.00016898212,"threshold_uncertainty_score":0.5706214},"labels":[],"label_agreement":null},{"id":"W6990684053","doi":"","title":"Domination and independence numbers of large 2-crossing-critical graphs","year":2023,"lang":"en","type":"article","venue":"DiRROS repository (University of Maribor)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Independence (probability theory); Upper and lower bounds; Domination analysis; Independence number; Class (philosophy)","score_opus":0.010468779005087268,"score_gpt":0.2632542755910387,"score_spread":0.25278549658595145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990684053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9076531,0.000094594056,0.08834398,0.00031746842,0.0002219085,0.00015576347,0.000018004797,0.00015015368,0.0030450318],"genre_scores_gemma":[0.9939738,0.000022151506,0.0052880547,0.000007508961,0.0000049797495,3.018869e-7,0.0000029788284,0.000005080806,0.00069517863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986996,0.0001363046,0.00012497764,0.0003245988,0.0004622571,0.00025223056],"domain_scores_gemma":[0.998875,0.00029729758,0.00009664243,0.00038375147,0.00024469366,0.00010260366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052467757,0.00008720651,0.00017409601,0.00023945502,0.0004496105,0.00004927964,0.00059900363,0.000090827394,0.000007459291],"category_scores_gemma":[0.00010097166,0.00010937275,0.000071403476,0.00085765787,0.0006992027,0.0007362696,0.00046380766,0.00016262542,0.000005939569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023724075,0.00032080887,0.083751895,0.0004261152,0.00008822316,0.0006346064,0.009783293,0.0000767589,0.1066069,0.78374696,0.00078700285,0.013540185],"study_design_scores_gemma":[0.004246414,0.0006528956,0.699717,0.0003620331,0.000083538594,0.00018276327,0.0088921385,0.0627911,0.056731593,0.16167481,0.0035493472,0.0011163508],"about_ca_topic_score_codex":0.00010981613,"about_ca_topic_score_gemma":0.00002707743,"teacher_disagreement_score":0.62207216,"about_ca_system_score_codex":0.000027875105,"about_ca_system_score_gemma":0.00008196187,"threshold_uncertainty_score":0.44600913},"labels":[],"label_agreement":null},{"id":"W6991207653","doi":"","title":"Fractionally total colouring most graphs","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Integer (computer science); Graph; Vertex (graph theory); Total coloring; Time complexity; Enhanced Data Rates for GSM Evolution","score_opus":0.015142649374151912,"score_gpt":0.2691662297670496,"score_spread":0.25402358039289774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991207653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86329746,0.0005807412,0.00007776586,0.00006392078,0.0039316206,0.0014409433,0.0005985065,0.0013219225,0.12868711],"genre_scores_gemma":[0.96865326,0.00022449096,0.0133165,0.0003121208,0.000081866565,0.0003562433,0.00062688167,0.00028595686,0.016142683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929626,0.00042304926,0.0009969452,0.002080055,0.0021203582,0.0014170025],"domain_scores_gemma":[0.99551123,0.000518072,0.0006701865,0.0017353436,0.0009106531,0.0006544842],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011893713,0.0010009782,0.00082392077,0.0012195762,0.0021547822,0.00037211535,0.0029989092,0.0009164221,0.00020098293],"category_scores_gemma":[0.0008507786,0.0011335422,0.00055121427,0.002355696,0.00012535792,0.0028987392,0.0005685416,0.0032469856,0.0007565226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015195794,0.00025018674,0.000012411424,0.00017483743,0.00019905137,0.00028448462,0.000011123297,0.00061868766,0.02230256,0.8945424,0.0000043639466,0.08144794],"study_design_scores_gemma":[0.0015107209,0.00036488575,0.0022590382,0.00060466456,0.00007316791,0.00022878403,0.00014821418,0.00015448775,0.07518922,0.90205705,0.015330765,0.0020789942],"about_ca_topic_score_codex":0.00015835717,"about_ca_topic_score_gemma":0.000530909,"teacher_disagreement_score":0.112544425,"about_ca_system_score_codex":0.0012711947,"about_ca_system_score_gemma":0.00032936325,"threshold_uncertainty_score":0.99914426},"labels":[],"label_agreement":null},{"id":"W6995280534","doi":"","title":"Interval Graphs","year":2016,"lang":"en","type":"article","venue":"Scholarship - Claremont (Claremont Colleges)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interval graph; Interval (graph theory); Upper and lower bounds; Indifference graph; Clique; Function (biology); Chordal graph; Series (stratigraphy)","score_opus":0.03519933556200806,"score_gpt":0.29893635943405156,"score_spread":0.2637370238720435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6995280534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3895443,0.0050486624,0.536375,0.030391082,0.0047791903,0.00377481,0.00024836272,0.0042279274,0.025610697],"genre_scores_gemma":[0.96912277,0.00021415064,0.024008974,0.0010914777,0.0001736139,0.00013135052,0.000006070891,0.000110974484,0.0051405947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924931,0.0010702552,0.0009223175,0.0018581174,0.0018001411,0.0018561042],"domain_scores_gemma":[0.9939411,0.0008351753,0.00030743278,0.0032304318,0.0007594095,0.0009264444],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002949816,0.00074104645,0.00074786285,0.0009850512,0.0007166818,0.0006199417,0.0052867406,0.00046442306,0.0002470928],"category_scores_gemma":[0.0014409669,0.0005469623,0.0005678373,0.0022796532,0.00042985787,0.0042838855,0.0016481144,0.0011701637,0.0010193213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004497901,0.0004350108,0.015118258,0.00006707002,0.00023562813,0.0010002553,0.000432227,0.000017491626,0.04227789,0.75519884,0.0050055063,0.17976202],"study_design_scores_gemma":[0.006325327,0.0010706634,0.029835207,0.0008554957,0.0000500699,0.00044649202,0.0001906498,0.00096369174,0.0365686,0.8366531,0.08439301,0.0026476628],"about_ca_topic_score_codex":0.000022814667,"about_ca_topic_score_gemma":0.00014832201,"teacher_disagreement_score":0.5795785,"about_ca_system_score_codex":0.0005407297,"about_ca_system_score_gemma":0.00033771488,"threshold_uncertainty_score":0.9997585},"labels":[],"label_agreement":null},{"id":"W7019141620","doi":"","title":"FACES OF MATCHING POLYHEDRA","year":2016,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Set (abstract data type); Filter (signal processing); Matching (statistics); Noise (video); Intersection (aeronautics); Feature (linguistics)","score_opus":0.011393203437239053,"score_gpt":0.23584250092463035,"score_spread":0.2244492974873913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019141620","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875789,0.00017769854,0.009448618,0.0005304779,0.00027505358,0.00020477774,0.00003089115,0.00008284173,0.0016707347],"genre_scores_gemma":[0.3369157,0.0002444881,0.021543529,0.000008016891,0.000027624501,4.3064344e-7,0.000052091735,0.000032246047,0.64117587],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99862015,0.00009208554,0.00012740934,0.00039929114,0.0004607426,0.00030034286],"domain_scores_gemma":[0.99863887,0.00009613148,0.00032364734,0.00062852656,0.0002223781,0.00009042441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020993337,0.00018573216,0.0003796791,0.00047740169,0.0001524288,0.000017913366,0.001732934,0.00017945179,0.00009812645],"category_scores_gemma":[0.000013227897,0.0001818795,0.00017212726,0.0003103059,0.00013472585,0.00063575024,0.00025233228,0.00019532953,0.00005535005],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060079014,0.00023544254,0.00071349,0.00151881,0.00047664388,0.00015973429,0.4480484,0.00007455808,0.28985518,0.15691367,0.0007595795,0.1006437],"study_design_scores_gemma":[0.0041931462,0.0011862513,0.01501477,0.003595583,0.00021009511,0.00002056856,0.35170314,0.00070320047,0.27409473,0.34461576,0.0018993774,0.0027633929],"about_ca_topic_score_codex":0.0048370534,"about_ca_topic_score_gemma":0.0038378646,"teacher_disagreement_score":0.6506632,"about_ca_system_score_codex":0.000040823936,"about_ca_system_score_gemma":0.00010116365,"threshold_uncertainty_score":0.7416831},"labels":[],"label_agreement":null},{"id":"W7019883598","doi":"","title":"Hypergraphs, existential closure, and related&#13;\\nproblems","year":2024,"lang":"en","type":"dissertation","venue":"Memorial University Research Repository (Memorial University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nucleofection; Hyporeflexia; Gestational period; TSG101; Diafiltration; Liquation","score_opus":0.019918904738613675,"score_gpt":0.26624533795293404,"score_spread":0.24632643321432035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019883598","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33410993,0.0018700508,0.0007327173,0.0004138177,0.05690663,0.0031006883,0.00011381758,0.0017109802,0.6010414],"genre_scores_gemma":[0.26219016,0.0021822697,0.00120527,0.0000074934323,0.004576412,0.0000036328208,0.00035226444,0.00021389966,0.72926855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.990184,0.0022295287,0.0005474275,0.0027250547,0.002679491,0.0016344595],"domain_scores_gemma":[0.9947871,0.0007130504,0.00031828275,0.0018026839,0.001416937,0.0009619418],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0019753717,0.00080921926,0.00096086867,0.00461246,0.0026296095,0.0009863724,0.004876514,0.0013761348,0.0000694146],"category_scores_gemma":[0.00022255568,0.0009799436,0.0006757352,0.0058900286,0.0010507758,0.0021548115,0.0022324421,0.0039777257,0.00023285633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008621779,0.0006503981,0.00025162828,0.0017006149,0.0022163745,0.041217215,0.006929498,0.00012420357,0.030658882,0.8729181,0.026848007,0.007863255],"study_design_scores_gemma":[0.012901068,0.0033314852,0.0007883965,0.0019100384,0.0011411979,0.0007256522,0.018311499,0.002127998,0.01691144,0.10212887,0.83463126,0.0050910627],"about_ca_topic_score_codex":0.0013555716,"about_ca_topic_score_gemma":0.00051845587,"teacher_disagreement_score":0.8077833,"about_ca_system_score_codex":0.0011643309,"about_ca_system_score_gemma":0.001908956,"threshold_uncertainty_score":0.9999203},"labels":[],"label_agreement":null},{"id":"W7023757594","doi":"","title":"Paroles francophones de l'Ouest et du Nord canadiens","year":2012,"lang":"fr","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Government (linguistics); Subject (documents); Identity (music); Perspective (graphical)","score_opus":0.02974691159943568,"score_gpt":0.3027661443516184,"score_spread":0.27301923275218276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023757594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36353722,0.01146864,0.53928703,0.028928278,0.0076142233,0.0003723208,0.00003432551,0.0002588531,0.048499074],"genre_scores_gemma":[0.9177802,0.0004919392,0.042393517,0.0030406485,0.0007330289,0.00002584279,0.0000021976855,0.00003010493,0.03550249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99677193,0.0005885628,0.00023237566,0.00037148313,0.00034380762,0.00169183],"domain_scores_gemma":[0.99754804,0.0005884088,0.000059672217,0.0007066407,0.00022108137,0.00087615434],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017876641,0.00024115507,0.00022618659,0.0001479537,0.00030725115,0.00014419747,0.0009398126,0.00013468707,0.0008660216],"category_scores_gemma":[0.00036445665,0.00023494463,0.00010088649,0.0007354635,0.0003552051,0.0014920343,0.00043005668,0.0004792119,0.0014524173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014395713,0.00021415061,0.069327764,0.00004224781,0.000033912453,0.00007257785,0.011072055,0.00015825154,0.0004047066,0.8434886,0.011481929,0.06368944],"study_design_scores_gemma":[0.0006608867,0.00022933185,0.09258611,0.00010472073,0.000018447452,0.000532093,0.0010856302,0.016963786,0.0050701806,0.06020576,0.8216374,0.00090567087],"about_ca_topic_score_codex":0.009138791,"about_ca_topic_score_gemma":0.021675488,"teacher_disagreement_score":0.81015545,"about_ca_system_score_codex":0.0001587708,"about_ca_system_score_gemma":0.0003584992,"threshold_uncertainty_score":0.9993251},"labels":[],"label_agreement":null},{"id":"W7024564512","doi":"","title":"Shifting visions gender and discourses ; [... consists a selection of articles presented at the eight biennial International Gender and Language Association (IGALA) conference, held in Vancouver, Canada, in 2014]","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Selection (genetic algorithm); Vision; Association (psychology); Focus (optics); Narrative","score_opus":0.026654099922477137,"score_gpt":0.2958584293949209,"score_spread":0.26920432947244377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024564512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99118674,0.00018001055,0.005853919,0.00064374827,0.00020836455,0.00018653255,0.0000104696655,0.000013914562,0.0017162809],"genre_scores_gemma":[0.9984496,0.000017255925,0.00084924744,0.00005639293,0.000016469281,0.000010002279,0.0000023680552,0.000003902822,0.0005947394],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99879885,0.00015573748,0.00019281976,0.00022253138,0.00042493865,0.00020513537],"domain_scores_gemma":[0.9992546,0.00032122288,0.00008964716,0.000118915355,0.00014576054,0.00006987802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006127052,0.00007734391,0.000108422224,0.00014891497,0.000057672416,0.000052799413,0.00018689157,0.000037405905,0.000025588906],"category_scores_gemma":[0.0002976615,0.000057362005,0.000011080781,0.00029992277,0.000066639135,0.0003433263,0.00027275478,0.00012910638,6.059761e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008023293,0.00010324129,0.95230544,0.000014818753,0.000051639046,0.000016598,0.0073794657,0.00043810392,0.0051851897,0.021951783,0.0101629505,0.0023105706],"study_design_scores_gemma":[0.0030514463,0.000087718276,0.73264205,0.000052257936,0.0000116798155,0.00002143744,0.010124328,0.21968691,0.012134622,0.020963475,0.00084416656,0.0003799167],"about_ca_topic_score_codex":0.030427337,"about_ca_topic_score_gemma":0.6972837,"teacher_disagreement_score":0.66685635,"about_ca_system_score_codex":0.00021619325,"about_ca_system_score_gemma":0.00022019351,"threshold_uncertainty_score":0.97602916},"labels":[],"label_agreement":null},{"id":"W7027413379","doi":"","title":"Colourings and games on sparse graphs","year":2024,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Term (time); Graph; Graph theory; Feature (linguistics)","score_opus":0.019161081898827523,"score_gpt":0.2735406871183508,"score_spread":0.25437960521952324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027413379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90953964,0.0013128945,0.000003033427,0.00007237682,0.0021015294,0.000949094,0.00029402724,0.0009406216,0.0847868],"genre_scores_gemma":[0.9690118,0.0009166785,0.0031873165,0.00040446914,0.00004536832,0.00029550793,0.00015416065,0.0002664432,0.025718248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99428344,0.00039368827,0.0006884132,0.0022104436,0.0013324409,0.0010915751],"domain_scores_gemma":[0.99671286,0.0005661942,0.00031001898,0.0015253752,0.00032647414,0.00055907527],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012286374,0.00091772,0.00075924065,0.0013641182,0.0010021366,0.00048873154,0.0020776258,0.00067670026,0.00006132254],"category_scores_gemma":[0.0005574316,0.00091681356,0.0003632111,0.001579262,0.00015867826,0.0012108707,0.0006151415,0.0027246736,0.00078629615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012644469,0.000095909,0.000006254278,0.0003360761,0.00013195684,0.0003145851,0.000024572853,0.000013196601,0.006471559,0.8497945,0.000018696393,0.14266625],"study_design_scores_gemma":[0.0006151165,0.00052057154,0.00055405183,0.0009406068,0.00008032967,0.0000752041,0.0001533741,0.00018164054,0.051297896,0.8859446,0.058287416,0.0013492055],"about_ca_topic_score_codex":0.000048899514,"about_ca_topic_score_gemma":0.00024415416,"teacher_disagreement_score":0.14131705,"about_ca_system_score_codex":0.00034321155,"about_ca_system_score_gemma":0.00007140811,"threshold_uncertainty_score":0.9999917},"labels":[],"label_agreement":null},{"id":"W7030132810","doi":"","title":"The maximum nullity of a complete edge subdivision graph is equal to it zero forcing number","year":2014,"lang":"en","type":"article","venue":"oURspace (University of Regina)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Subdivision; Graph; Forcing (mathematics); Rank (graph theory); Enhanced Data Rates for GSM Evolution; Zero (linguistics); Projection (relational algebra); Tree (set theory); Complete graph","score_opus":0.024459704155524446,"score_gpt":0.2583607915366228,"score_spread":0.23390108738109833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030132810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0341213,0.000015051457,0.72705096,0.23766191,0.000071521055,0.00015158422,0.0000060434704,0.000033115404,0.00088849553],"genre_scores_gemma":[0.9335172,0.000077700126,0.05488929,0.00020896785,0.000023331617,6.6097954e-7,0.0000018972619,0.000018249631,0.011262656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841684,0.00022623593,0.0000266968,0.00038186446,0.0005366235,0.0004117658],"domain_scores_gemma":[0.9979193,0.00042850638,0.00017671958,0.001014194,0.00028662608,0.00017462685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908808,0.00013182824,0.0002526582,0.00015253099,0.00046801424,0.000035716195,0.0017828845,0.00006041048,0.0000052475566],"category_scores_gemma":[0.000088697445,0.00012920794,0.000158203,0.00083973835,0.00037007578,0.0004125525,0.0008412409,0.00018332069,0.00006239884],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021396106,0.000045290566,0.0020426395,0.000071782466,0.000055430493,0.000012426211,0.0024794205,0.0001504327,0.0020850638,0.7296577,0.21618813,0.046997733],"study_design_scores_gemma":[0.0008032248,0.00032857418,0.0015678288,0.000108060245,0.000015846834,0.000008994798,0.001546586,0.009879653,0.001026267,0.057329413,0.9270923,0.00029326652],"about_ca_topic_score_codex":0.000029937959,"about_ca_topic_score_gemma":0.00011610865,"teacher_disagreement_score":0.89939594,"about_ca_system_score_codex":0.00004766875,"about_ca_system_score_gemma":0.000044750996,"threshold_uncertainty_score":0.5268947},"labels":[],"label_agreement":null},{"id":"W7034786469","doi":"","title":"Women, power, and political representation: Canadian and comparative perspectives","year":2021,"lang":"en","type":"article","venue":"CentAUR (University of Reading)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Politics; Government (linguistics); Work (physics); Agency (philosophy)","score_opus":0.03177474351319209,"score_gpt":0.2763056241026017,"score_spread":0.24453088058940958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034786469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97563535,0.00037337383,0.006264318,0.0029979858,0.000043966756,0.00008485905,0.000011989707,0.000026489886,0.01456168],"genre_scores_gemma":[0.9941614,0.000060865288,0.004744844,0.000040151906,0.0000061165874,1.1785105e-7,0.0000017024115,0.0000018521582,0.0009829091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99916464,0.000083443665,0.000042414234,0.00029883618,0.00012171562,0.00028894778],"domain_scores_gemma":[0.99914366,0.00009792848,0.000024077237,0.00020678449,0.00014697133,0.00038054993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008784885,0.000061741186,0.0001366719,0.00014519671,0.00021471544,0.00003634434,0.00018858997,0.00003022244,0.000054726395],"category_scores_gemma":[0.00003111708,0.00008000446,0.000021104905,0.00031990893,0.00036449323,0.00038794635,0.00021105447,0.00009268897,0.000004322404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011307421,0.00001975466,0.0047450354,0.0000069389425,0.00002784991,0.00010358327,0.023177225,8.139239e-7,0.00039023222,0.970791,0.00018620453,0.00054006977],"study_design_scores_gemma":[0.0018841849,0.00028801052,0.17210019,0.00006380789,0.000017662918,0.00024708285,0.6981803,0.002031424,0.002297486,0.11399441,0.008364075,0.00053136353],"about_ca_topic_score_codex":0.0025387204,"about_ca_topic_score_gemma":0.002694681,"teacher_disagreement_score":0.85679656,"about_ca_system_score_codex":0.00015737183,"about_ca_system_score_gemma":0.00014664684,"threshold_uncertainty_score":0.38378027},"labels":[],"label_agreement":null},{"id":"W7068177990","doi":"","title":"Nutrient intake and lifestyle patterns of pregnant Indigenous women residing in northern Manitoban communities: a pilot study for implications for fetal alcohol spectrum disorder","year":2023,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pregnancy; Indigenous; Fetal Alcohol Spectrum Disorder; Nutrient; Alcohol intake; Alcohol consumption; Consumption (sociology); Public health; Gestation","score_opus":0.03669118404247049,"score_gpt":0.2745380118242164,"score_spread":0.2378468277817459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7068177990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9754258,0.00008553114,0.020647844,0.0001554853,0.000098550016,0.003286971,0.00021750653,0.00006405015,0.000018285558],"genre_scores_gemma":[0.9982534,0.00018130802,0.000952922,0.0000031022419,0.000015951195,0.000097906086,0.00018494022,0.000044317057,0.0002661305],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983966,0.00015612518,0.00024326403,0.00044526526,0.00026829285,0.00049045205],"domain_scores_gemma":[0.9980288,0.0005222614,0.00039025623,0.00072940247,0.00023624692,0.000093011804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053819665,0.00024876161,0.00049150013,0.0008089392,0.0004883538,0.00004530498,0.0013347176,0.00009115654,5.328982e-7],"category_scores_gemma":[0.000037528458,0.00031704156,0.00008832224,0.0005284577,0.00008379019,0.00028564234,0.00038794946,0.0002554649,0.0000014279647],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011728479,0.002105644,0.87257665,0.001574499,0.00035810273,0.000015108414,0.11095354,0.0001507689,0.0003407067,0.005266096,0.000017540136,0.0054684756],"study_design_scores_gemma":[0.0019873888,0.002951339,0.55620563,0.00032632882,0.000037519247,0.0000015136355,0.430667,0.00028125301,0.000055222776,0.0071464977,0.000048772385,0.0002915235],"about_ca_topic_score_codex":0.0065577403,"about_ca_topic_score_gemma":0.902472,"teacher_disagreement_score":0.89591426,"about_ca_system_score_codex":0.0002641363,"about_ca_system_score_gemma":0.00015719006,"threshold_uncertainty_score":0.9999282},"labels":[],"label_agreement":null},{"id":"W7070140790","doi":"","title":"Counting Bases","year":2006,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Matroid; Pfaffian; Bipartite graph; Class (philosophy); Polytope; Matching (statistics); Characterization (materials science); Matroid partitioning","score_opus":0.011495399728766344,"score_gpt":0.22712273903125,"score_spread":0.21562733930248365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7070140790","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98696405,0.00020987113,0.005124187,0.00039864512,0.0003950014,0.00027419277,0.000022353066,0.00022235514,0.006389375],"genre_scores_gemma":[0.035531975,0.000056797257,0.02648572,0.000015164303,0.000042217565,4.16312e-7,0.00025209307,0.000027696216,0.9375879],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9985419,0.00007341602,0.00010435866,0.0004598908,0.00047196104,0.00034846718],"domain_scores_gemma":[0.99878734,0.00008219219,0.00022131298,0.0005724188,0.00026338326,0.00007337709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002074371,0.00019570222,0.00029921543,0.00041753173,0.00025043538,0.00004744324,0.0014043804,0.00017674424,0.000071388255],"category_scores_gemma":[0.000017550181,0.00023860854,0.00015496557,0.00045165693,0.00009173444,0.00058452954,0.00017827321,0.00027377624,0.000082962884],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010182103,0.0011657226,0.006301713,0.004164668,0.0008671942,0.0020903463,0.34180135,0.0020195206,0.0745857,0.31835988,0.060808916,0.18681678],"study_design_scores_gemma":[0.009774344,0.002058072,0.07032297,0.004382055,0.00072159385,0.0000777884,0.5066746,0.044502895,0.12699872,0.15261227,0.07199853,0.009876175],"about_ca_topic_score_codex":0.01434841,"about_ca_topic_score_gemma":0.022300737,"teacher_disagreement_score":0.95143205,"about_ca_system_score_codex":0.00006058647,"about_ca_system_score_gemma":0.0001053821,"threshold_uncertainty_score":0.9955397},"labels":[],"label_agreement":null},{"id":"W7070373081","doi":"","title":"Optimization and packings of T-joins and T-cuts","year":2011,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Simple (philosophy); Graph; Cardinality (data modeling); Combinatorial optimization; Simple graph; Optimization problem; Planar","score_opus":0.020072405753269556,"score_gpt":0.25675361521796325,"score_spread":0.2366812094646937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7070373081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247305,0.0013404724,0.00055382284,0.000018234417,0.0008381078,0.0012654305,0.00033465883,0.00040600804,0.07051277],"genre_scores_gemma":[0.948361,0.0015069573,0.045570035,0.00008790685,0.000018568071,0.000079026526,0.00016813197,0.0001450858,0.0040633287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967718,0.00029317787,0.0006161951,0.0011198281,0.0006485227,0.00055045483],"domain_scores_gemma":[0.9974907,0.00024805797,0.0005435165,0.00088626065,0.0005149475,0.00031649848],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085286685,0.00050867454,0.0006042422,0.0006525056,0.0005858898,0.00010823301,0.000969843,0.00048485733,0.000040166924],"category_scores_gemma":[0.00046981423,0.0005342158,0.00012177061,0.00074338063,0.00016510053,0.0015897764,0.00042996448,0.0008516681,0.000014339296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001252903,0.0001162248,0.00008153988,0.0004761989,0.000113771595,0.000033335324,0.000066424225,0.0001074132,0.014579772,0.8033145,0.0000013775804,0.18098415],"study_design_scores_gemma":[0.0025611185,0.0010449056,0.003602095,0.0014112163,0.00021122703,0.0001547963,0.0003820481,0.003824891,0.22422776,0.75290656,0.006872982,0.0028004094],"about_ca_topic_score_codex":0.00008388803,"about_ca_topic_score_gemma":0.00013825198,"teacher_disagreement_score":0.20964798,"about_ca_system_score_codex":0.000089778696,"about_ca_system_score_gemma":0.00004657472,"threshold_uncertainty_score":0.9997109},"labels":[],"label_agreement":null},{"id":"W7093659350","doi":"","title":"Interval Graphs","year":2016,"lang":"","type":"article","venue":"Scholarship - Claremont (Claremont Colleges)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interval graph; Interval (graph theory); Upper and lower bounds; Indifference graph; Clique; Function (biology); Chordal graph; Series (stratigraphy)","score_opus":0.04414187088998066,"score_gpt":0.30948742010610275,"score_spread":0.2653455492161221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093659350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4082772,0.042633656,0.39960596,0.06883383,0.024153214,0.013401978,0.002172252,0.004692469,0.03622944],"genre_scores_gemma":[0.96230024,0.0023889956,0.012464459,0.0018151243,0.0007461919,0.00025920346,0.0000178581,0.00042984312,0.019578094],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9755365,0.004794622,0.0032105772,0.0055627376,0.0051643183,0.0057312306],"domain_scores_gemma":[0.98241,0.0023417114,0.0012989286,0.007948561,0.0027776298,0.0032231477],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.009053069,0.0026276407,0.0025278633,0.002729431,0.002441915,0.0024830222,0.012163195,0.001933057,0.0018622718],"category_scores_gemma":[0.0047721057,0.0021128957,0.0021138582,0.0064883577,0.002223022,0.009715665,0.0053781085,0.0043945876,0.0041626943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027876876,0.0018036751,0.019267056,0.0004185051,0.0011886426,0.003927429,0.0015531165,0.000051572388,0.036755808,0.43554816,0.008603713,0.48809463],"study_design_scores_gemma":[0.019713035,0.0048767277,0.036859326,0.0073791314,0.0004685154,0.0013894323,0.0008000985,0.0044738683,0.03717751,0.7268872,0.15068118,0.0092939595],"about_ca_topic_score_codex":0.0000873899,"about_ca_topic_score_gemma":0.00048738482,"teacher_disagreement_score":0.554023,"about_ca_system_score_codex":0.0021673664,"about_ca_system_score_gemma":0.0017863144,"threshold_uncertainty_score":0.99936265},"labels":[],"label_agreement":null},{"id":"W7100779552","doi":"","title":"List Partitions","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Skew; Homogeneous; Clique; Upper and lower bounds; Time complexity; Homomorphism","score_opus":0.03197091546449135,"score_gpt":0.3119377880094662,"score_spread":0.2799668725449749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100779552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013248337,0.000023131144,0.7493859,0.00036609927,0.00005470435,0.000034926805,1.9556086e-7,0.000109670036,0.24870054],"genre_scores_gemma":[0.88603956,0.000004598936,0.105718285,0.00030666485,0.0000071027357,0.000013136405,2.121207e-7,0.000002939256,0.00790753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999505,0.000050798088,0.000050248786,0.00012968689,0.00010498358,0.00015928944],"domain_scores_gemma":[0.99950093,0.000055940287,0.00000699225,0.0003414324,0.00003163057,0.00006305757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015799848,0.000032877153,0.00003201508,0.00004187069,0.00008433239,0.000048501173,0.0002877592,0.000010927642,0.0003032016],"category_scores_gemma":[0.000070491114,0.000027820595,0.00002059801,0.0003229148,0.00003505817,0.00024773643,0.00004348003,0.00004965249,0.00032012662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4880989e-7,0.000012770213,0.00016317531,4.2392833e-7,0.0000010246066,0.000002516933,0.000017951923,0.000010347079,0.00032500696,0.9973424,0.0010962056,0.0010280143],"study_design_scores_gemma":[0.00008812941,0.00002139096,0.0002124949,0.00000123811,3.1733762e-7,0.000011134893,0.000014228973,0.00059479143,0.009547945,0.8861857,0.103249125,0.00007347044],"about_ca_topic_score_codex":0.0000015529954,"about_ca_topic_score_gemma":0.000004979539,"teacher_disagreement_score":0.8847147,"about_ca_system_score_codex":0.000007805829,"about_ca_system_score_gemma":0.00002044654,"threshold_uncertainty_score":0.41146868},"labels":[],"label_agreement":null},{"id":"W7106241308","doi":"10.1016/j.tcs.2025.115658","title":"Distance-restricted firefighting on finite graphs","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; Verafin (Canada); University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Neighbourhood (mathematics); Firefighting; Vertex (graph theory); Graph; Rest (music); Integer (computer science)","score_opus":0.013059116869591521,"score_gpt":0.29111173967843534,"score_spread":0.2780526228088438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106241308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076921917,0.000040333234,0.9625649,0.0015149474,0.00067294796,0.00022444586,0.0000018090502,0.0004116851,0.026876742],"genre_scores_gemma":[0.9300539,0.000008883853,0.068615235,0.0011305247,0.00003825374,0.000017733682,7.317399e-7,0.000008012045,0.00012675523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963061,0.00021222768,0.00034414037,0.0011442684,0.0010118842,0.0009813327],"domain_scores_gemma":[0.9962408,0.0015639672,0.00006680012,0.0015654393,0.0002754123,0.00028761482],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012312813,0.00025804408,0.0002552199,0.00076367677,0.0009176748,0.00057441706,0.0046614534,0.000065326145,0.000020856422],"category_scores_gemma":[0.00055634324,0.00020892388,0.00010346091,0.0062268768,0.0035353624,0.00068132184,0.0015805135,0.0004673753,0.000090186666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023271812,0.000065836946,0.00007792471,0.0000072643643,0.0000047382,0.000019963809,0.00008505943,0.0005288845,0.00029192885,0.939837,0.00008501329,0.05897311],"study_design_scores_gemma":[0.00021974485,0.00014952593,0.00070827885,0.00006868854,0.0000018064917,0.0000030616764,0.0000025340048,0.35282585,0.003227195,0.6418998,0.0007146677,0.00017883138],"about_ca_topic_score_codex":0.0000016133074,"about_ca_topic_score_gemma":3.2286061e-7,"teacher_disagreement_score":0.9223617,"about_ca_system_score_codex":0.00010638533,"about_ca_system_score_gemma":0.00020328154,"threshold_uncertainty_score":0.99917644},"labels":[],"label_agreement":null},{"id":"W7106501654","doi":"10.1016/j.procs.2025.10.337","title":"Cops and Robbers on Token Graphs","year":2025,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; British Columbia Institute of Technology","funders":"Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Universidad Nacional Autónoma de México; Consejo Nacional de Ciencia y Tecnología","keywords":"Graph; Vertex (graph theory); Security token; Set (abstract data type); Integer (computer science)","score_opus":0.010810462332243493,"score_gpt":0.28424886563037566,"score_spread":0.2734384032981322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106501654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031536005,0.00017221629,0.9575769,0.0018886559,0.0008511267,0.00033580008,6.8536406e-7,0.0003086379,0.007329985],"genre_scores_gemma":[0.8540385,0.000033750977,0.14406219,0.0016373171,0.000033177635,0.000028837698,2.5779164e-7,0.000005753187,0.00016021756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764365,0.0000417818,0.00018254356,0.00094525167,0.00059646793,0.00059027906],"domain_scores_gemma":[0.99856555,0.00023987965,0.000048703816,0.00071780855,0.0002167245,0.0002113244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000899935,0.0001731004,0.00016155864,0.00073292095,0.00057113165,0.0004918999,0.0024230948,0.00003775558,0.0000019647678],"category_scores_gemma":[0.00011311598,0.00015269457,0.00003669277,0.00330773,0.00082114147,0.0010934673,0.0013283162,0.00022744114,0.00002557415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010442147,0.000037820857,0.0013148201,0.000018198449,0.0000049776113,0.000007641259,0.0003270223,0.00020795294,0.0004509216,0.8522703,0.00037775724,0.14497215],"study_design_scores_gemma":[0.0010466472,0.00071866385,0.020687066,0.00020324746,0.000005994441,0.000054079574,0.000027286695,0.50289637,0.018087143,0.44906032,0.006481282,0.0007319213],"about_ca_topic_score_codex":0.000002973654,"about_ca_topic_score_gemma":0.0000027016658,"teacher_disagreement_score":0.8225025,"about_ca_system_score_codex":0.000042383195,"about_ca_system_score_gemma":0.00025340944,"threshold_uncertainty_score":0.6226704},"labels":[],"label_agreement":null},{"id":"W7108482857","doi":"10.61091/jcmcc128-21","title":"Changing and unchanging of the connected domination number of a graph","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Domination analysis; Graph; Connected component; Connectivity; Path graph; Path (computing); Dominating set; Graph power","score_opus":0.01245190482271425,"score_gpt":0.28795091781680454,"score_spread":0.2754990129940903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108482857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8872924,0.0012407956,0.092853025,0.0003055903,0.017009292,0.00064355024,0.0000042453116,0.000015791828,0.0006353506],"genre_scores_gemma":[0.9941538,0.00014320921,0.0053197364,0.000017012597,0.00031831404,0.00000188933,2.4556525e-7,0.00002674963,0.000019037798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495196,0.0005822025,0.0022533692,0.00037767377,0.0012334324,0.0006013868],"domain_scores_gemma":[0.9910458,0.0027190184,0.0033169794,0.00060813926,0.002144856,0.00016522872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0052573676,0.00043485343,0.0014364356,0.00093662355,0.00058042933,0.000234653,0.0013469006,0.0002683514,0.0000047987323],"category_scores_gemma":[0.001989309,0.00035557244,0.00039532766,0.0030860156,0.0006500543,0.00044883476,0.0017901576,0.000850494,2.5100286e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001593302,0.0005025958,0.0009269426,0.0012834067,0.0003043675,0.000006573921,0.00545038,0.000054454205,0.0020438193,0.9833068,0.000015126895,0.0059461766],"study_design_scores_gemma":[0.0057786745,0.00045638203,0.00038206408,0.0042528557,0.00024333662,0.000101118174,0.0014587468,0.02639553,0.011879634,0.9487189,0.000039312898,0.00029345302],"about_ca_topic_score_codex":0.0000072125363,"about_ca_topic_score_gemma":3.2695831e-7,"teacher_disagreement_score":0.10686145,"about_ca_system_score_codex":0.00009943867,"about_ca_system_score_gemma":0.00042584274,"threshold_uncertainty_score":0.9998896},"labels":[],"label_agreement":null},{"id":"W7109980574","doi":"10.4230/lipics.itcs.2025.67","title":"Error-Correcting Graph Codes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Line graph; Null graph; Voltage graph; Butterfly graph; Hamming graph; Hamming code; Block graph; Linear code; Graph property; Block code","score_opus":0.019195820346420592,"score_gpt":0.31439216607789056,"score_spread":0.29519634573146997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109980574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053471357,0.000115096555,0.92362994,0.00047648815,0.0014823362,0.0011676226,0.00012678353,0.00058104686,0.018949319],"genre_scores_gemma":[0.90263295,0.000047382917,0.09185106,0.0023098043,0.00011073325,0.00032574675,0.00015929379,0.00005481806,0.0025082175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669665,0.000090879636,0.0010395931,0.00043731093,0.00058437977,0.0011512139],"domain_scores_gemma":[0.9971117,0.0005841814,0.00031553864,0.0013576131,0.00041221877,0.00021876999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012565732,0.00042230336,0.00049508415,0.0008350761,0.00073854957,0.0005989497,0.0025157854,0.00022857581,0.000019477104],"category_scores_gemma":[0.0003690138,0.0003921569,0.00030119022,0.0014313926,0.0002341535,0.0022983407,0.0010294965,0.0007405289,0.00013068604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030427586,0.0006302322,0.016821533,0.001388345,0.0005743517,0.000022198788,0.011375883,0.001351437,0.00039298585,0.7628673,0.015487731,0.18878375],"study_design_scores_gemma":[0.011620204,0.0009874223,0.0030819734,0.001320866,0.00011987811,0.00026980965,0.009030585,0.36967182,0.023628864,0.30416727,0.27287358,0.0032277373],"about_ca_topic_score_codex":0.000013642996,"about_ca_topic_score_gemma":0.00001869675,"teacher_disagreement_score":0.84916157,"about_ca_system_score_codex":0.00014479172,"about_ca_system_score_gemma":0.00015080022,"threshold_uncertainty_score":0.999853},"labels":[],"label_agreement":null},{"id":"W7110189454","doi":"10.4230/lipics.socg.2025.19","title":"Polychromatic Coloring of Tuples in Hypergraphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hypergraph; Tuple; Set (abstract data type); Constant (computer programming); Characterization (materials science)","score_opus":0.012267265345861035,"score_gpt":0.292994078523558,"score_spread":0.280726813177697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110189454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67381996,0.0001946937,0.3139508,0.00032262172,0.00062071026,0.0014704737,0.00008331139,0.00018799635,0.009349417],"genre_scores_gemma":[0.9591294,0.000046825746,0.040065844,0.0002793764,0.000015832109,0.00015359538,0.00002499839,0.000018350967,0.00026578933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972553,0.0000639915,0.0011992853,0.00027343328,0.0004543504,0.0007535895],"domain_scores_gemma":[0.99794513,0.000447979,0.00029147367,0.0009857554,0.00021568182,0.000113997725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008752289,0.0002875479,0.00052407256,0.0011319584,0.00016902522,0.00015236391,0.001871789,0.00014788726,0.000008400227],"category_scores_gemma":[0.00023545571,0.0002714473,0.00021218199,0.0015959954,0.00021561854,0.0015015908,0.00070521916,0.0003670254,0.000022753868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002537993,0.00072278624,0.06384583,0.002579997,0.0002597771,0.000013148375,0.007713012,0.0009591959,0.001735468,0.8869588,0.0008459032,0.034112323],"study_design_scores_gemma":[0.02029549,0.0015325384,0.04484832,0.003913771,0.00009351114,0.0000971661,0.0077295015,0.50503004,0.0613544,0.3205699,0.031859815,0.002675578],"about_ca_topic_score_codex":0.000019575116,"about_ca_topic_score_gemma":0.000029011131,"teacher_disagreement_score":0.56638885,"about_ca_system_score_codex":0.00011966145,"about_ca_system_score_gemma":0.00014409784,"threshold_uncertainty_score":0.9999738},"labels":[],"label_agreement":null},{"id":"W7110215014","doi":"10.4230/lipics.stacs.2025.64","title":"Cluster Editing on Cographs and Related Classes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Time complexity; Permutation (music); Upper and lower bounds; Connected component; Computational complexity theory; Cograph","score_opus":0.010841416548416588,"score_gpt":0.28794879680089236,"score_spread":0.2771073802524758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110215014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23781872,0.00024799947,0.66805536,0.0038024867,0.0032193656,0.003405958,0.0003282094,0.001090096,0.08203179],"genre_scores_gemma":[0.96779096,0.0000830957,0.027130986,0.002960433,0.00008369007,0.00017519975,0.00009865429,0.000041265954,0.0016357359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973938,0.000080154336,0.0008579284,0.00038700338,0.00046730548,0.00081381836],"domain_scores_gemma":[0.99776655,0.00064399885,0.00025686048,0.0008734294,0.00027251066,0.00018666069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000886553,0.00034883092,0.0003767839,0.00076481095,0.0005378944,0.00052840915,0.001163897,0.00021772496,0.0000106099415],"category_scores_gemma":[0.00031566987,0.00030983536,0.00018189028,0.00096355507,0.00026734345,0.0016969489,0.00078675867,0.0006365386,0.00006089107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029167836,0.00038849254,0.009583153,0.0009705119,0.00043811568,0.000017427987,0.0056606345,0.00035373276,0.000114932074,0.8800407,0.014280269,0.08786034],"study_design_scores_gemma":[0.016534127,0.0017211995,0.00611319,0.001941764,0.00011188018,0.00021635221,0.004218856,0.3806872,0.0053052204,0.3011969,0.27969146,0.002261842],"about_ca_topic_score_codex":0.0000027627736,"about_ca_topic_score_gemma":0.0000042499846,"teacher_disagreement_score":0.72997224,"about_ca_system_score_codex":0.000077384335,"about_ca_system_score_gemma":0.0000666941,"threshold_uncertainty_score":0.9999354},"labels":[],"label_agreement":null},{"id":"W7110406314","doi":"10.4230/lipics.icalp.2025.37","title":"Satisfiability of Commutative vs. Non-Commutative CSPs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; UK Research and Innovation","keywords":"Satisfiability; Boolean satisfiability problem; Constraint satisfaction problem; Hilbert space; Commutative property; Maximum satisfiability problem; Dimension (graph theory)","score_opus":0.011625649098114992,"score_gpt":0.31388914808129603,"score_spread":0.30226349898318106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110406314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121075675,0.000051921303,0.8606558,0.00063625345,0.0004413055,0.002005866,0.0005016054,0.00017947091,0.014452119],"genre_scores_gemma":[0.91068554,0.000021524693,0.08787629,0.00073254685,0.000019009805,0.00022591192,0.00011246306,0.000025200368,0.00030150442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996344,0.00022635722,0.0014738297,0.0003990204,0.0006730089,0.00088381045],"domain_scores_gemma":[0.9950536,0.001471951,0.000583813,0.001768567,0.0009260704,0.00019598358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016526207,0.0004511402,0.00081152626,0.0006127443,0.0004526657,0.00021748302,0.0028538513,0.00020558888,0.000024060602],"category_scores_gemma":[0.0005375067,0.0004123279,0.00035020875,0.0013537782,0.00074195303,0.0021329364,0.0015252666,0.00074207893,0.00005529808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013180303,0.001868116,0.037921626,0.0038250776,0.0012662435,0.00001420244,0.086087584,0.0016077919,0.00074494234,0.76367515,0.0067267437,0.094944514],"study_design_scores_gemma":[0.016446773,0.0025750336,0.025942253,0.0014170698,0.00013988726,0.000048708305,0.014170435,0.34551492,0.07092189,0.49131805,0.02912692,0.0023780828],"about_ca_topic_score_codex":0.000036198282,"about_ca_topic_score_gemma":0.00002285401,"teacher_disagreement_score":0.78960985,"about_ca_system_score_codex":0.00025050738,"about_ca_system_score_gemma":0.00028954822,"threshold_uncertainty_score":0.99983287},"labels":[],"label_agreement":null},{"id":"W7110422314","doi":"10.4230/lipics.wads.2025.42","title":"The Parameterized Landscape of Labeled Graph Contractions","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Treewidth; Graph; Degeneracy (biology); Contraction (grammar); Computational complexity theory; Upper and lower bounds","score_opus":0.012420816385483684,"score_gpt":0.2946825092797038,"score_spread":0.2822616928942201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110422314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1368522,0.0002792274,0.8488662,0.0013691807,0.0012075766,0.0019251747,0.00023718987,0.00027711046,0.008986109],"genre_scores_gemma":[0.9660991,0.00021662666,0.03135638,0.00063248136,0.000036929498,0.00036342425,0.00006786693,0.000025036885,0.0012021434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758524,0.00009519747,0.00097131205,0.0002250011,0.0004338154,0.00068941363],"domain_scores_gemma":[0.996564,0.0012490974,0.00037306768,0.0012163294,0.00048021265,0.00011731172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010118783,0.00025332381,0.00039468572,0.0003784001,0.0006626877,0.0003524986,0.0019230813,0.00013230422,0.000007717614],"category_scores_gemma":[0.0003939505,0.0001814775,0.00028446515,0.0010359504,0.00030044996,0.0010857517,0.0004726201,0.0004129282,0.000026345468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005816965,0.0004474631,0.0049625696,0.00043562992,0.0006705761,0.000003583268,0.0025108282,0.00024763859,0.0012675314,0.9412102,0.0059546554,0.041707646],"study_design_scores_gemma":[0.021641174,0.0012044078,0.0050567645,0.0006244234,0.00018185169,0.00008526053,0.0049847374,0.2353651,0.027339345,0.3443714,0.35742941,0.0017161325],"about_ca_topic_score_codex":0.000005651178,"about_ca_topic_score_gemma":0.000010685334,"teacher_disagreement_score":0.82924694,"about_ca_system_score_codex":0.0000435326,"about_ca_system_score_gemma":0.00012906315,"threshold_uncertainty_score":0.74004376},"labels":[],"label_agreement":null},{"id":"W7110599578","doi":"","title":"Graph Theory Notes for MATH 2070 and MATH 3370","year":2022,"lang":"en","type":"book","venue":"Mspace (University of Manitoba)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph theory; Graph; Cover (algebra); Bibliography; Reading list; Mathematical logic; Algebra over a field","score_opus":0.021505072085345155,"score_gpt":0.22584850047498467,"score_spread":0.2043434283896395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110599578","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047310023,0.0020115394,0.92721456,0.0023593695,0.0005735073,0.0018652716,0.00046230614,0.00043749606,0.060344946],"genre_scores_gemma":[0.006729262,0.0025580234,0.21858388,0.00042870085,0.00031434727,0.000018473916,0.00026492326,0.00027257766,0.7708298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981454,0.00015185839,0.00010483039,0.00068813004,0.0005096662,0.00040010118],"domain_scores_gemma":[0.99772733,0.00087677594,0.0002531215,0.0008561902,0.00015011882,0.00013643969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006131506,0.000280295,0.00044143596,0.00054833817,0.0005721706,0.000054124797,0.0018498925,0.0001761098,0.000017432807],"category_scores_gemma":[0.000049048216,0.00035296447,0.0002368109,0.00025898384,0.00046181775,0.00043040715,0.0017247772,0.0004570855,0.000020178166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114590046,0.00003701343,0.00009069881,0.00021564923,0.00010739787,0.000066057495,0.00032704746,0.000024999837,0.00005383897,0.9862873,0.0069819014,0.005693483],"study_design_scores_gemma":[0.0009436999,0.00047716429,0.0011064607,0.00010756516,0.000091164824,0.00002987728,0.002169781,0.0022503994,0.000023761988,0.7626791,0.22949956,0.00062144006],"about_ca_topic_score_codex":0.000043729884,"about_ca_topic_score_gemma":0.0027051456,"teacher_disagreement_score":0.71048486,"about_ca_system_score_codex":0.00017162987,"about_ca_system_score_gemma":0.0002181495,"threshold_uncertainty_score":0.99989223},"labels":[],"label_agreement":null},{"id":"W7110872679","doi":"10.4230/lipics.fsttcs.2025.10","title":"Cat Herding Game Played on Infinite Trees","year":2025,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Game tree; Graph; Repeated game; Herding; Vertex (graph theory); Combinatorial game theory; Tree (set theory); Measure (data warehouse)","score_opus":0.015020762540071576,"score_gpt":0.2648626783205169,"score_spread":0.24984191578044534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110872679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06922916,0.0002651027,0.75916666,0.0122636715,0.00017260853,0.00028326342,0.000006481373,0.0004213708,0.15819168],"genre_scores_gemma":[0.9301722,0.000107616026,0.047542024,0.00037489226,0.000008453044,0.000043790067,0.00001670052,0.000017480594,0.02171683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9952699,0.0029664808,0.000308761,0.0006268652,0.00040151094,0.00042648523],"domain_scores_gemma":[0.9938611,0.0028737406,0.00013308378,0.002154326,0.00083492714,0.0001428524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035452798,0.00019817047,0.00021035362,0.00039456395,0.00039152618,0.0004021386,0.0021593804,0.00009060641,0.00004516783],"category_scores_gemma":[0.0015236941,0.00020058232,0.00011603325,0.0013209764,0.00020271704,0.0003113865,0.00086230744,0.00029162006,0.00010658282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001269101,0.00018160755,0.00083906774,0.000015273508,0.000024836601,0.0000051539723,0.0022583075,0.000101879516,0.005283291,0.90775263,0.0005555952,0.08296966],"study_design_scores_gemma":[0.0028800182,0.000004447867,0.019079156,0.0025892628,0.000026967125,0.000020919872,0.00033428308,0.18000516,0.4211541,0.25774068,0.11494487,0.0012201052],"about_ca_topic_score_codex":0.00012742664,"about_ca_topic_score_gemma":0.0004238208,"teacher_disagreement_score":0.8609431,"about_ca_system_score_codex":0.0001084673,"about_ca_system_score_gemma":0.00016059255,"threshold_uncertainty_score":0.81795096},"labels":[],"label_agreement":null},{"id":"W7115031712","doi":"","title":"On colouring graphs with forbidden 7-vertex minors","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Graph; Graph minor; Complete graph; Complement graph; Minor (academic)","score_opus":0.016130207490527838,"score_gpt":0.26237673949594104,"score_spread":0.2462465320054132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115031712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7956456,0.0002343607,0.000036788442,0.00004199951,0.0015261497,0.0015402432,0.00030530168,0.0008388568,0.19983071],"genre_scores_gemma":[0.94650596,0.0001638174,0.0072755446,0.00057187246,0.000021751133,0.0005048083,0.00032681343,0.00022939336,0.04440002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99330217,0.0005161888,0.0007709252,0.0022212816,0.0017795297,0.0014099072],"domain_scores_gemma":[0.9950633,0.0009916899,0.00051533355,0.0022884845,0.0006445164,0.00049667933],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010162669,0.0010798239,0.00093890796,0.0016509572,0.0016820406,0.0003043602,0.0038303735,0.0007264642,0.0000781982],"category_scores_gemma":[0.00068742095,0.0010263255,0.00043630254,0.0025998577,0.000105015664,0.0014145349,0.0004863852,0.0025992086,0.00027707487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042186244,0.00017508472,0.000012928201,0.00026981515,0.00022983956,0.00022520627,0.000009918645,0.00010707854,0.0021251417,0.84190065,0.000017247012,0.15450525],"study_design_scores_gemma":[0.0022414213,0.0011937914,0.00085929624,0.002123695,0.0001508866,0.000051424227,0.00019612965,0.00028530174,0.09190392,0.88378716,0.014819688,0.0023873171],"about_ca_topic_score_codex":0.00012640523,"about_ca_topic_score_gemma":0.0015103217,"teacher_disagreement_score":0.15543069,"about_ca_system_score_codex":0.00066555094,"about_ca_system_score_gemma":0.00019514402,"threshold_uncertainty_score":0.99970186},"labels":[],"label_agreement":null},{"id":"W7117078956","doi":"","title":"Nowhere-zero flow reconfiguration","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Abelian group; Graph; Conjecture; Control reconfiguration; Planar graph; Sequence (biology); Flow (mathematics); Directed graph; Planar","score_opus":0.04292922885179728,"score_gpt":0.31685161905131487,"score_spread":0.2739223901995176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117078956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21007724,0.0016784144,0.74882036,0.005546425,0.0029138674,0.00076231884,0.000011118847,0.00024795847,0.029942272],"genre_scores_gemma":[0.9606979,0.00039480164,0.0070489114,0.0011091518,0.00018288795,0.00006704948,0.0000086954515,0.000032356045,0.030458266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956839,0.00053337193,0.0007635654,0.0013735027,0.00055842387,0.0010872443],"domain_scores_gemma":[0.99641615,0.0004989838,0.00020181395,0.0020839327,0.0005267153,0.00027239745],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011164674,0.0004485641,0.0004624252,0.00053358776,0.0007221337,0.0003643018,0.0021749435,0.00028719445,0.00061623467],"category_scores_gemma":[0.0005890701,0.00047974754,0.00024639515,0.002698765,0.0004079803,0.0014691562,0.000750126,0.0008677461,0.0024918588],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025117767,0.00047118592,0.109716505,0.00026141654,0.00028445755,0.00013033523,0.0015129615,0.0013392747,0.024642779,0.12570253,0.0074808705,0.7282065],"study_design_scores_gemma":[0.003707782,0.00092594017,0.22176592,0.0011191077,0.00011864895,0.00004111351,0.00026588424,0.3242366,0.09034411,0.25595903,0.099333234,0.0021826122],"about_ca_topic_score_codex":0.000027536236,"about_ca_topic_score_gemma":0.000044395896,"teacher_disagreement_score":0.75062066,"about_ca_system_score_codex":0.00022319144,"about_ca_system_score_gemma":0.0005486475,"threshold_uncertainty_score":0.9997654},"labels":[],"label_agreement":null},{"id":"W7117406377","doi":"10.61091/ars165-05","title":"On error-detecting open-locating-dominating sets","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Independent set; Graph; Set (abstract data type); Maximal independent set; Dominating set","score_opus":0.03106490125795443,"score_gpt":0.3496209828387878,"score_spread":0.3185560815808334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117406377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85195,0.0012333953,0.017730573,0.0034894415,0.018506868,0.0034148004,0.00001229904,0.00051051506,0.103152126],"genre_scores_gemma":[0.99022406,0.000023857205,0.005212355,0.0007948514,0.000010414838,0.0001586909,0.0000026993257,0.00007183437,0.0035012225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923287,0.0013936434,0.0011667612,0.0021690738,0.0011397165,0.0018020828],"domain_scores_gemma":[0.9914708,0.0038756786,0.000574497,0.002973326,0.0007111553,0.00039451473],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004610746,0.00076543255,0.0009032663,0.000866861,0.0022741572,0.0019263887,0.007946057,0.00034342395,0.000097317046],"category_scores_gemma":[0.0049807224,0.0008667196,0.00024343314,0.00494618,0.0004457547,0.0015607012,0.007142458,0.0020074951,0.00035599188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014239336,0.0004669202,0.00029689152,0.00013335102,0.00010697978,0.000075042386,0.0013536043,0.0003704662,0.0006498423,0.87112683,0.00078607065,0.12449163],"study_design_scores_gemma":[0.0032928633,0.000722965,0.00040560067,0.0012891827,0.000026041294,0.000010996697,0.00050557905,0.078576595,0.0105246855,0.90358275,0.00035233653,0.00071039185],"about_ca_topic_score_codex":0.00008105099,"about_ca_topic_score_gemma":0.000013596415,"teacher_disagreement_score":0.1382741,"about_ca_system_score_codex":0.00062429305,"about_ca_system_score_gemma":0.00082861335,"threshold_uncertainty_score":0.9993783},"labels":[],"label_agreement":null},{"id":"W7117408694","doi":"10.61091/ars165-03","title":"The domatic number game played on graphs","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Disjoint sets; Vertex (graph theory); Alice and Bob; Graph; Dominating set; Pairwise comparison","score_opus":0.012502352197433743,"score_gpt":0.29871535748094324,"score_spread":0.2862130052835095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117408694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79798275,0.0033837443,0.009177029,0.013077249,0.04203552,0.0036877326,0.000017268207,0.00070617883,0.12993251],"genre_scores_gemma":[0.99095124,0.0004185722,0.0002928072,0.0006378626,0.000010381015,0.0001382051,0.0000015558545,0.000038407714,0.0075109643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941436,0.0011433925,0.0008253228,0.0011402665,0.001258495,0.0014889444],"domain_scores_gemma":[0.99173653,0.0040337113,0.00026640572,0.0032612483,0.00039810318,0.00030400857],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002093084,0.00057145883,0.0005410303,0.0003170052,0.0016429124,0.0010081627,0.004536151,0.00024422506,0.00008374977],"category_scores_gemma":[0.00082561345,0.00044857222,0.00036557473,0.0038870727,0.0010036484,0.00053324725,0.0013382315,0.001251882,0.0013998381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017940984,0.00032952486,0.0009193366,0.000051504045,0.00018927833,0.000044388133,0.00044773647,0.00003959881,0.00006778734,0.97067755,0.005007568,0.022046335],"study_design_scores_gemma":[0.0018385497,0.0002795876,0.002074381,0.0002955766,0.000028507022,0.000008834936,0.00009241934,0.0071800277,0.0012717199,0.97816294,0.008353951,0.0004134835],"about_ca_topic_score_codex":0.000016531878,"about_ca_topic_score_gemma":0.000006647803,"teacher_disagreement_score":0.19296847,"about_ca_system_score_codex":0.000246914,"about_ca_system_score_gemma":0.00044118505,"threshold_uncertainty_score":0.9997966},"labels":[],"label_agreement":null},{"id":"W7117418922","doi":"10.61091/um125-07","title":"Unique paired vs edge-vertex minimum dominating sets in trees","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dominating set; Class (philosophy); Tree (set theory); Set (abstract data type)","score_opus":0.026180822681456047,"score_gpt":0.32281665872862075,"score_spread":0.2966358360471647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117418922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21371098,0.005640791,0.62527245,0.012075073,0.0019700548,0.0061507816,0.00008245879,0.00079978135,0.13429764],"genre_scores_gemma":[0.939638,0.00008913643,0.054252077,0.00031255122,0.000023255801,0.00022663751,0.0000042540323,0.000051546594,0.0054025385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926922,0.0013552445,0.00173055,0.0015712952,0.0009435025,0.0017072646],"domain_scores_gemma":[0.99111867,0.0052059023,0.00031646687,0.002700397,0.0003322691,0.00032628345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004242048,0.00073783414,0.0012361844,0.0013345964,0.00044575724,0.00038729084,0.0032209002,0.00037274175,0.00041175983],"category_scores_gemma":[0.0041429466,0.0007371621,0.0003706009,0.0038516938,0.0008702836,0.0009015421,0.0020076544,0.0009866478,0.00031698405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024415785,0.0014107118,0.0005455193,0.002061115,0.00015981677,0.00019911499,0.012005106,0.00005364017,0.0010573037,0.8200662,0.0023006313,0.15989666],"study_design_scores_gemma":[0.0013015782,0.0002108337,0.0014830715,0.0024795872,0.000031878284,0.000017027045,0.0012528473,0.3299372,0.0022904926,0.6599028,0.0005745613,0.00051814795],"about_ca_topic_score_codex":0.000022615452,"about_ca_topic_score_gemma":0.00008202517,"teacher_disagreement_score":0.72592705,"about_ca_system_score_codex":0.00038827676,"about_ca_system_score_gemma":0.0006512941,"threshold_uncertainty_score":0.99950796},"labels":[],"label_agreement":null},{"id":"W7124154569","doi":"10.65109/mhsj2047","title":"Pure Nash equilibria: complete characterization of hard and easy graphical games","year":2010,"lang":"","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Treewidth; Bounded function; Characterization (materials science); Nash equilibrium; Class (philosophy); Complexity class; Time complexity; Parameterized complexity; Iterated function","score_opus":0.02453861068836116,"score_gpt":0.2775504084294305,"score_spread":0.25301179774106936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124154569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8219559,0.00006622307,0.17368649,0.0023621828,0.0007296119,0.000494117,0.0000476383,0.000085792184,0.00057201844],"genre_scores_gemma":[0.98141146,0.00020940215,0.01690309,0.00021020521,0.00014728487,0.000015193769,0.000019634253,0.00002962977,0.0010541289],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965597,0.00029412226,0.0006523941,0.0009817457,0.0007920219,0.0007200514],"domain_scores_gemma":[0.99734193,0.00028423144,0.00027112188,0.0012513141,0.00046038054,0.00039099666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009276067,0.00035368366,0.0005449625,0.00043894132,0.00022399252,0.000329352,0.0013476338,0.00029003015,0.00034753265],"category_scores_gemma":[0.00020984565,0.00032628767,0.00015640091,0.0012873305,0.0015426747,0.0013751871,0.0012226134,0.0008721162,0.00003414835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047131496,0.000060465605,0.002448467,0.00006703838,0.000025661695,0.000008335115,0.00017499214,3.669402e-7,0.5680405,0.4122121,0.000010551484,0.016904382],"study_design_scores_gemma":[0.003226266,0.0015089364,0.3098877,0.00026857076,0.00006279201,0.00035166665,0.000092711736,0.15905647,0.11358712,0.3972328,0.0128776925,0.0018472469],"about_ca_topic_score_codex":0.0000074892278,"about_ca_topic_score_gemma":0.000017242126,"teacher_disagreement_score":0.45445338,"about_ca_system_score_codex":0.000010686156,"about_ca_system_score_gemma":0.00012582181,"threshold_uncertainty_score":0.99991894},"labels":[],"label_agreement":null},{"id":"W7124281514","doi":"10.65109/pcio5382","title":"Gerrymandering Planar Graphs","year":2024,"lang":"","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gerrymandering; Redistricting; Vertex (graph theory); Planar graph; Partition (number theory); Time complexity; Graph; Approximation algorithm; Planar","score_opus":0.03592371740322173,"score_gpt":0.3175840887005323,"score_spread":0.2816603712973106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124281514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025643324,0.012256269,0.91523373,0.0024466736,0.00252264,0.00029267513,0.000005447881,0.0008654939,0.06381274],"genre_scores_gemma":[0.9624405,0.000979372,0.015770156,0.00030428977,0.00017993178,0.000022479448,0.0000013140707,0.00004978282,0.020252172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655074,0.00014505016,0.00038254226,0.0011677998,0.0007356134,0.001018262],"domain_scores_gemma":[0.9981166,0.00039827276,0.000025699197,0.0010283343,0.000075965196,0.00035509033],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008793303,0.00032836176,0.0002527797,0.0007496468,0.00030501277,0.0015092706,0.0016354168,0.00012614792,0.0008444683],"category_scores_gemma":[0.000040525552,0.00029479887,0.00025164572,0.0024780638,0.00028213853,0.0015034603,0.0005408155,0.0006966688,0.0020968346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008762172,0.00002647188,0.000035273264,0.00014784986,0.00007519227,0.00050447544,0.00068949535,0.0000712829,0.0011909072,0.82977843,0.0021153165,0.16535656],"study_design_scores_gemma":[0.00015998253,0.0001918845,0.00012787156,0.00026665322,0.000012545213,0.00015877564,0.000096449185,0.30334547,0.0024581642,0.6518224,0.040852588,0.0005072242],"about_ca_topic_score_codex":0.000020162059,"about_ca_topic_score_gemma":0.000011828464,"teacher_disagreement_score":0.9598762,"about_ca_system_score_codex":0.00007561286,"about_ca_system_score_gemma":0.00020657107,"threshold_uncertainty_score":0.9999504},"labels":[],"label_agreement":null},{"id":"W7128185158","doi":"10.55016/ojs/cdm.v8i2.62050","title":"Colouring stability two unit disk graphs","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Unit disk; Graph; Clique number; Clique; Unit disk graph; Stability (learning theory)","score_opus":0.03198840706107389,"score_gpt":0.3446661638066141,"score_spread":0.3126777567455402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128185158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06839088,0.00020365472,0.92080027,0.0029190076,0.00053434033,0.0020481753,0.00069695205,0.00033351697,0.0040731835],"genre_scores_gemma":[0.94613934,0.000033287746,0.05265656,0.0001826742,0.00015285307,0.00023565486,0.000028190114,0.00006671916,0.0005047127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99261194,0.0011226208,0.001529721,0.0013569039,0.0012980038,0.0020807872],"domain_scores_gemma":[0.99002886,0.0025978028,0.00047081706,0.0038640168,0.0016971261,0.0013413532],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0052676992,0.0007641614,0.0011066775,0.0005647577,0.0016568608,0.0009842514,0.003223709,0.0002255388,0.0002928588],"category_scores_gemma":[0.008120045,0.00074195204,0.0004996503,0.003363156,0.0009048874,0.00087918685,0.0023831762,0.0009578913,0.000932024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003647211,0.00042654065,0.000542154,0.00020713355,0.00010657111,0.0000080213285,0.0021857717,0.0007633417,0.0012875528,0.9891284,0.00012412408,0.0051838844],"study_design_scores_gemma":[0.0015486716,0.00047334676,0.0006153655,0.00037621282,0.0001179621,0.000024151155,0.00041676106,0.24396922,0.0063043814,0.7411105,0.0040667634,0.0009766504],"about_ca_topic_score_codex":0.000021291935,"about_ca_topic_score_gemma":0.00006625255,"teacher_disagreement_score":0.8777485,"about_ca_system_score_codex":0.0004208923,"about_ca_system_score_gemma":0.00034832355,"threshold_uncertainty_score":0.99984586},"labels":[],"label_agreement":null},{"id":"W7128199293","doi":"10.1090/tran/9493","title":"Limits of degeneracy for colouring graphs with forbidden minors","year":2025,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degeneracy (biology); Bipartite graph; Upper and lower bounds; Sublinear function; Monotone polygon; Bounded function; Vertex (graph theory); Graph","score_opus":0.019903900032545527,"score_gpt":0.3073533367955095,"score_spread":0.287449436762964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128199293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13526148,0.000019919868,0.8631578,0.0008268857,0.000020762123,0.00035775214,0.0000074146487,0.000031199983,0.0003167728],"genre_scores_gemma":[0.6729031,0.0000117315885,0.32660446,0.00008640317,0.0000022024756,0.00006425239,1.2672582e-7,0.000006965629,0.00032072677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906343,0.00004828432,0.00024386263,0.00018755716,0.00023499384,0.00022187203],"domain_scores_gemma":[0.99834484,0.0007123312,0.00016314576,0.0005828626,0.00015458906,0.00004223315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026003548,0.00010333603,0.00028651295,0.00004917199,0.00016695427,0.000014555462,0.00089797395,0.000023657429,0.0000052275323],"category_scores_gemma":[0.0000412988,0.00006758543,0.00036854492,0.0011504453,0.00070853374,0.00013290968,0.00003184562,0.00012361673,5.447132e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021028462,0.0010158031,0.0007555432,0.0011812508,0.00097123,3.6334424e-7,0.0033869967,0.0041886023,0.026999528,0.9104053,0.00046324017,0.050421897],"study_design_scores_gemma":[0.0010370557,0.00057259854,0.0014318995,0.0002719422,0.00017917417,0.000007788407,0.0014627981,0.040258788,0.22667077,0.72767484,0.0001532199,0.00027912928],"about_ca_topic_score_codex":0.00001135317,"about_ca_topic_score_gemma":0.000004473044,"teacher_disagreement_score":0.53764164,"about_ca_system_score_codex":0.000026795782,"about_ca_system_score_gemma":0.00008244068,"threshold_uncertainty_score":0.27560538},"labels":[],"label_agreement":null},{"id":"W7131979928","doi":"","title":"Résolution du problème du sous-graphe de poids maximum des arêtes dans des réseaux biologiques","year":2019,"lang":"fr","type":"article","venue":"NPARC","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Body weight; Triglycerides blood; Fish <Actinopterygii>","score_opus":0.024883911274655945,"score_gpt":0.27378151845988263,"score_spread":0.2488976071852267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131979928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44746906,0.0015818793,0.5361403,0.0025444503,0.0004451893,0.0005483156,0.000021076567,0.00029863356,0.010951064],"genre_scores_gemma":[0.8176913,0.0019422857,0.17785223,0.00019437306,0.00023250049,0.00007767137,0.00000765561,0.000046216108,0.0019557192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954007,0.0011337666,0.000427024,0.00093001407,0.00046813895,0.0016403426],"domain_scores_gemma":[0.99744517,0.0005789139,0.00016136804,0.00096224796,0.00048266115,0.000369635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002097158,0.0004303395,0.00040475983,0.00030805115,0.00064246554,0.00034737124,0.0016943865,0.00033004925,0.00045176066],"category_scores_gemma":[0.0005406966,0.0004069739,0.00026132687,0.0012500731,0.0025282043,0.0014013977,0.0007862568,0.0005897912,0.00054006133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009785982,0.0003144609,0.15606834,0.000262337,0.00007745579,0.00006921734,0.004723663,0.0004005577,0.1275118,0.63538843,0.0006946791,0.07439118],"study_design_scores_gemma":[0.00046046881,0.0008875377,0.022798074,0.00023367055,0.00001758592,0.00019493807,0.0004316161,0.030379783,0.019035837,0.922673,0.002418329,0.00046918608],"about_ca_topic_score_codex":0.00021925432,"about_ca_topic_score_gemma":0.00017121366,"teacher_disagreement_score":0.37022227,"about_ca_system_score_codex":0.0004531552,"about_ca_system_score_gemma":0.0003806372,"threshold_uncertainty_score":0.99983823},"labels":[],"label_agreement":null},{"id":"W7133054918","doi":"","title":"Some algorithmic and complexity results for monotone Boolean duality (hypergraph transversal)","year":2004,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"DPLL algorithm; Monotone polygon; Time complexity; True quantified Boolean formula; Conjunctive normal form; Duality (order theory); Boolean function; Polynomial","score_opus":0.06680735408382057,"score_gpt":0.38325191554362575,"score_spread":0.31644456145980515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133054918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24016231,0.0117179705,0.72270525,0.008504819,0.003083913,0.010214759,0.0013591585,0.0007605233,0.0014912784],"genre_scores_gemma":[0.8446612,0.005571208,0.13094456,0.00041531667,0.0010580561,0.0008328712,0.0020114384,0.00034678687,0.014158593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928947,0.00053993176,0.001145639,0.002612692,0.0011943376,0.0016126746],"domain_scores_gemma":[0.99530786,0.000826071,0.00066249026,0.0017855699,0.0006887525,0.0007292502],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022417998,0.001069768,0.0012796642,0.0007043442,0.0012177454,0.00045915451,0.0018330398,0.00066443486,0.000015317757],"category_scores_gemma":[0.0003525681,0.0011920525,0.0005429199,0.0011869037,0.0011526005,0.0011293766,0.00024158794,0.0012209242,0.00003131737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008027951,0.00096762413,0.000027045942,0.0025318973,0.00064024,0.00010775532,0.084335886,0.0012810082,0.011699704,0.86007065,0.00037467934,0.029935533],"study_design_scores_gemma":[0.014658546,0.0022285425,0.0032427602,0.0009485445,0.00025434096,0.000054659224,0.010237014,0.0418503,0.026233645,0.8943377,0.0029770045,0.002976926],"about_ca_topic_score_codex":0.0008464198,"about_ca_topic_score_gemma":0.00044872324,"teacher_disagreement_score":0.60449886,"about_ca_system_score_codex":0.000309574,"about_ca_system_score_gemma":0.0006906243,"threshold_uncertainty_score":0.99905294},"labels":[],"label_agreement":null},{"id":"W7135073389","doi":"10.1137/1.9781611979084.6","title":"Partitioning Trillion Edge Graphs on Edge Devices","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Partition (number theory); Graph; Enhanced Data Rates for GSM Evolution; Edge computing; Overhead (engineering); Edge device; Block (permutation group theory)","score_opus":0.07647425681464981,"score_gpt":0.289620435954992,"score_spread":0.21314617914034217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135073389","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000117106836,0.00018298862,0.10885057,0.00021258125,0.0005175837,0.0030045183,0.00014054876,0.00033751718,0.8866366],"genre_scores_gemma":[0.004008796,0.00022041006,0.1862206,0.0012965418,0.0017869368,0.0014186077,0.0001701098,0.00026446575,0.80461353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979381,0.000008787384,0.000517751,0.0006728754,0.0004237446,0.00043876003],"domain_scores_gemma":[0.99798137,0.00083747186,0.00034739976,0.0005887501,0.00010232427,0.00014270231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006971731,0.00045731006,0.00061047764,0.0001501003,0.00056362036,0.00024127225,0.000665201,0.00071183866,0.000008683809],"category_scores_gemma":[0.00003406415,0.00041252055,0.0005593146,0.000072164155,0.00026360236,0.00006470089,0.0003669315,0.00077834993,0.00001135752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002438409,0.000020925227,9.003287e-8,0.00024021306,0.00015360357,5.5743544e-7,0.00041108206,0.0000030784336,0.000053409603,0.94927174,0.005411084,0.044409852],"study_design_scores_gemma":[0.0010504471,0.000121426405,5.5646105e-8,0.00049623515,0.00008038917,0.0000017908371,0.000088825014,0.00040935102,0.0010958422,0.9164857,0.07976477,0.00040513935],"about_ca_topic_score_codex":5.1352015e-7,"about_ca_topic_score_gemma":0.0000012190487,"teacher_disagreement_score":0.08202306,"about_ca_system_score_codex":0.000066539185,"about_ca_system_score_gemma":0.00016948742,"threshold_uncertainty_score":0.9998327},"labels":[],"label_agreement":null},{"id":"W7135223164","doi":"10.5269/bspm.77901","title":"Inverse domination number of a graph: a survey","year":2025,"lang":"","type":"article","venue":"Boletim da Sociedade Paranaense de Matemática","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Learning Partnership","funders":"","keywords":"Dominating set; Domination analysis; Vertex (graph theory); Inverse; Graph; Conjecture","score_opus":0.027319143652269912,"score_gpt":0.33815281027208616,"score_spread":0.31083366661981626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135223164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40511906,0.0014432863,0.5687407,0.0034944587,0.0012110281,0.0019600012,0.00039509247,0.00028329887,0.017353032],"genre_scores_gemma":[0.9774499,0.00059533666,0.017372956,0.00078562513,0.00004164541,0.000105025894,0.000032777647,0.000059025508,0.003557687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99143934,0.002911393,0.0014234566,0.0013621923,0.0011921036,0.0016715028],"domain_scores_gemma":[0.9939815,0.0019404033,0.0005561908,0.0020585686,0.0010229325,0.00044041255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0057989554,0.0006790938,0.0011091745,0.00066711433,0.0005583604,0.00045353547,0.0023886755,0.00057259836,0.0004073605],"category_scores_gemma":[0.0014169369,0.0007609404,0.00058902946,0.0047322907,0.001895751,0.0005839477,0.0010320133,0.00091265916,0.00039552606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013113372,0.0016221208,0.040350012,0.0018789332,0.0011218217,0.00021678256,0.0075400053,0.0011860224,0.008056131,0.89894724,0.022231232,0.015538351],"study_design_scores_gemma":[0.01188935,0.000559344,0.15087783,0.0024056686,0.00063250004,0.00015395226,0.002209477,0.23582388,0.026846694,0.5564595,0.008663871,0.003477915],"about_ca_topic_score_codex":0.00058289594,"about_ca_topic_score_gemma":0.000089917834,"teacher_disagreement_score":0.5723309,"about_ca_system_score_codex":0.0003707554,"about_ca_system_score_gemma":0.001185997,"threshold_uncertainty_score":0.9994842},"labels":[],"label_agreement":null},{"id":"W71968967","doi":"","title":"On Distance Connected Domination Numbers of Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Domination analysis; Vertex (graph theory); Connectivity; Graph; Vertex connectivity; Order (exchange); Connected dominating set; Induced subgraph; Cardinality (data modeling); Integer (computer science); Discrete mathematics","score_opus":0.010305342496407155,"score_gpt":0.27915559109577526,"score_spread":0.2688502485993681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71968967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88722175,0.00006363624,0.10133215,0.00013002273,0.0011356827,0.00025204476,0.0000024609262,0.0001450871,0.009717179],"genre_scores_gemma":[0.99731946,0.000006280266,0.0024896197,0.000051427178,0.0000018723815,0.0000062321656,0.0000023818752,0.000010490205,0.00011226086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985201,0.00008565435,0.00025616132,0.00031694878,0.00048478294,0.0003363954],"domain_scores_gemma":[0.99818194,0.00073710614,0.00013228237,0.00062621024,0.0002181674,0.00010427205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086641416,0.00012100136,0.00016661762,0.00023077281,0.00009310515,0.000026206017,0.0007801745,0.000060367434,0.000011233951],"category_scores_gemma":[0.00028290952,0.00012046568,0.000066737855,0.001186746,0.0001435165,0.000311673,0.000105914216,0.0001744688,0.000025044463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061756284,0.00011413972,0.00085715693,0.000009128101,0.000010777818,0.000013376405,0.00020144413,0.0000105303425,0.0015826677,0.9929405,0.00018892088,0.0040095886],"study_design_scores_gemma":[0.0008079522,0.00017168428,0.004981968,0.000023834402,0.0000017424691,0.0000023437951,0.000026462145,0.0003937917,0.02657633,0.96667606,0.00021010474,0.00012772465],"about_ca_topic_score_codex":0.00000844691,"about_ca_topic_score_gemma":0.000007819355,"teacher_disagreement_score":0.1100977,"about_ca_system_score_codex":0.000064967615,"about_ca_system_score_gemma":0.000029299365,"threshold_uncertainty_score":0.4912448},"labels":[],"label_agreement":null},{"id":"W73852609","doi":"","title":"Note on acyclic colorings of graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01629310249588141,"score_gpt":0.2869874171003903,"score_spread":0.2706943146045089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73852609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98658544,0.000054893164,0.0036692373,0.0006826224,0.00078636635,0.00023196799,0.0000015237894,0.00016427212,0.007823686],"genre_scores_gemma":[0.9961114,0.000017102835,0.0036585003,0.000116418814,0.0000017799155,0.000016611428,6.0586115e-7,0.000012356363,0.000065230925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985923,0.000055089127,0.00020456102,0.00034601273,0.00045357127,0.00034844945],"domain_scores_gemma":[0.9987121,0.00018571802,0.00009051865,0.00079285505,0.00010071705,0.00011805737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030965335,0.00013285094,0.00018961182,0.00022354799,0.0000988213,0.000032206466,0.0011824558,0.00006123785,0.0000049445275],"category_scores_gemma":[0.00011330955,0.00012872524,0.00008897221,0.0009415168,0.0001407612,0.00032991427,0.00026200825,0.00022875553,0.00008650989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019946105,0.00014122043,0.00027786076,0.000007976838,0.000008829875,0.00001531141,0.00018352272,0.00011742118,0.0030530996,0.9946457,0.000028700098,0.0015004199],"study_design_scores_gemma":[0.00095428375,0.0003809455,0.0021358174,0.000028721026,0.0000017259563,0.000003435493,0.000006420489,0.000041964136,0.059732486,0.93609464,0.0004972921,0.00012228072],"about_ca_topic_score_codex":0.000017895836,"about_ca_topic_score_gemma":0.0000017573254,"teacher_disagreement_score":0.058551062,"about_ca_system_score_codex":0.00007400276,"about_ca_system_score_gemma":0.00007170393,"threshold_uncertainty_score":0.5249263},"labels":[],"label_agreement":null},{"id":"W75080855","doi":"","title":"The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Graph; Set (abstract data type); Integer (computer science); Discrete mathematics; Planar graph; Computer science","score_opus":0.00849990397534381,"score_gpt":0.25327281408344565,"score_spread":0.24477291010810184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75080855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78919375,0.00043274602,0.20062254,0.00042451205,0.0021207314,0.00061069167,0.00002208121,0.00022565661,0.0063473177],"genre_scores_gemma":[0.99709284,0.000016385484,0.002510954,0.000021297592,0.000046852856,0.000025303298,0.000003789584,0.000019478326,0.0002631065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784964,0.00018877389,0.00030653478,0.00048083553,0.00067949796,0.00049468805],"domain_scores_gemma":[0.99788433,0.0003451304,0.00017138771,0.0012134123,0.0002756008,0.00011016206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005172488,0.00020728631,0.00024200302,0.000079661986,0.00034372183,0.000105566665,0.0017106328,0.000055230386,0.0000047175763],"category_scores_gemma":[0.00006468164,0.0001422582,0.00007489009,0.0012534503,0.00053217297,0.00059922895,0.00019435683,0.00032355954,0.000009669332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013633368,0.00014761444,0.001810722,0.000008348952,0.0000133252815,0.00002310477,0.00014368088,0.00009036104,0.00011413285,0.99577594,0.00033159807,0.0014048615],"study_design_scores_gemma":[0.00073218794,0.0002975626,0.0044427034,0.000028304004,0.0000046975697,0.00000571949,0.000047320736,0.004164874,0.0025068922,0.9827144,0.004832183,0.00022315248],"about_ca_topic_score_codex":0.00005599774,"about_ca_topic_score_gemma":0.000225103,"teacher_disagreement_score":0.20789911,"about_ca_system_score_codex":0.00007151218,"about_ca_system_score_gemma":0.00008939398,"threshold_uncertainty_score":0.5801121},"labels":[],"label_agreement":null},{"id":"W75907754","doi":"","title":"Vertex-Disjoint Paths in Graphs","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Disjoint sets; Vertex (graph theory); Combinatorics; Graph","score_opus":0.016950286058527865,"score_gpt":0.2743511412015198,"score_spread":0.25740085514299194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75907754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98433435,0.00031563273,0.004239848,0.0005494366,0.0016363577,0.00028332585,8.584224e-7,0.00024549259,0.008394693],"genre_scores_gemma":[0.9977231,0.000085955166,0.0017715546,0.00014742579,0.0000020641255,0.000032417185,0.0000011998658,0.000013957408,0.00022229902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982315,0.0001495981,0.00023565623,0.0004496631,0.00039005515,0.00054353103],"domain_scores_gemma":[0.99869716,0.00017709534,0.000047133817,0.00085425045,0.00007415508,0.00015018816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000528818,0.00015231954,0.00018966637,0.00031344127,0.00009569005,0.00008004237,0.0012002514,0.000067652356,0.000028559534],"category_scores_gemma":[0.0001170677,0.00015192619,0.00007275256,0.0015427907,0.00008325891,0.0005756001,0.0003706223,0.0002979256,0.00017595597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012070953,0.00012716626,0.013076677,0.0000035933258,0.000005047556,0.00017844043,0.00021660831,0.000013301632,0.00033044055,0.9731525,0.00026464273,0.012619485],"study_design_scores_gemma":[0.0007819466,0.00009978286,0.012602821,0.000018838384,8.357857e-7,0.000021802512,0.000025619116,0.0028512706,0.00046780342,0.981533,0.0014137308,0.00018257379],"about_ca_topic_score_codex":0.000029104618,"about_ca_topic_score_gemma":0.000016198592,"teacher_disagreement_score":0.013388772,"about_ca_system_score_codex":0.00007792534,"about_ca_system_score_gemma":0.000055070534,"threshold_uncertainty_score":0.619537},"labels":[],"label_agreement":null},{"id":"W762650586","doi":"10.1016/j.disc.2015.06.005","title":"Join colourings of chordal graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Chordal graph; Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Pathwidth; Cograph; Split graph; Indifference graph; Graph; Line graph; 1-planar graph","score_opus":0.04375043402777048,"score_gpt":0.31112911825039025,"score_spread":0.2673786842226198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W762650586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15836108,0.00011301842,0.8244969,0.0003085417,0.00012826693,0.00029648034,0.0000066945095,0.00015254233,0.01613646],"genre_scores_gemma":[0.65403473,0.0000070662286,0.34541178,0.000035710953,0.000014770426,0.000017538407,0.0000015041617,0.000017652514,0.0004592418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986623,0.00005321986,0.00029386778,0.00019946368,0.0005157477,0.0002753871],"domain_scores_gemma":[0.99867964,0.00013814255,0.00014142244,0.0007072522,0.00016382047,0.00016974822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071818323,0.00011937542,0.00022736096,0.00014493978,0.000040207575,0.00005010997,0.000999083,0.000042120297,0.000008731319],"category_scores_gemma":[0.00028103252,0.00009850064,0.000081475424,0.0005169276,0.00014528415,0.00028719046,0.00038267014,0.000121836914,0.000047136196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059186073,0.000065727036,0.00017273302,0.00006502391,0.000016051354,0.000007955487,0.002900416,0.000047157366,0.0008884008,0.99472874,0.00040047595,0.00070142356],"study_design_scores_gemma":[0.00037172335,0.0001432419,0.00007740722,0.00004201501,0.0000051260595,0.000017745466,0.00041856113,0.017892085,0.011480667,0.9689048,0.00048828835,0.00015835218],"about_ca_topic_score_codex":0.0000033081437,"about_ca_topic_score_gemma":0.0000013625144,"teacher_disagreement_score":0.49567366,"about_ca_system_score_codex":0.000022074099,"about_ca_system_score_gemma":0.000059610644,"threshold_uncertainty_score":0.40167394},"labels":[],"label_agreement":null},{"id":"W76416303","doi":"","title":"F-factor and Vertex-disjoint F in a graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Vertex (graph theory); Graph; Factor (programming language); Discrete mathematics; Computer science; Programming language","score_opus":0.02384189453152436,"score_gpt":0.26140417543416056,"score_spread":0.2375622809026362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76416303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927873,0.0009621651,0.0014644827,0.0006964095,0.00073881703,0.00024347362,0.000001640538,0.00014892787,0.002956753],"genre_scores_gemma":[0.9984201,0.0001061521,0.0011828191,0.00009045651,0.0000015256035,0.000017527063,2.454414e-7,0.000009603898,0.00017156123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987493,0.00009862105,0.00016257423,0.00037098434,0.00025253303,0.00036599478],"domain_scores_gemma":[0.99911684,0.00016718906,0.000033098542,0.0005100112,0.000037822418,0.00013501204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018846648,0.00012327087,0.00015739974,0.00023661501,0.000076070195,0.00008055311,0.0005708547,0.000052543546,0.00004309058],"category_scores_gemma":[0.00008702139,0.00012025475,0.000035955978,0.00072584447,0.000093655464,0.0004801848,0.0002896346,0.00022386789,0.00007514169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037122206,0.000091367845,0.0048447764,0.0000071538407,0.000005378359,0.000043418906,0.00056617975,0.0000026131986,0.00035100666,0.98200655,0.0002830443,0.0117947785],"study_design_scores_gemma":[0.00080097845,0.00010619104,0.01158658,0.000017269944,7.333435e-7,0.000011998618,0.000015141948,0.0054014437,0.00057126523,0.9807206,0.0006024329,0.00016541107],"about_ca_topic_score_codex":0.00001121716,"about_ca_topic_score_gemma":0.000006552228,"teacher_disagreement_score":0.011629367,"about_ca_system_score_codex":0.000038343045,"about_ca_system_score_gemma":0.000010131519,"threshold_uncertainty_score":0.49038464},"labels":[],"label_agreement":null},{"id":"W76468100","doi":"","title":"Bipartite Dominating Sets in Hypercubes.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Hypercube; Cardinality (data modeling); Graph; Discrete mathematics; Computer science","score_opus":0.017858414930476286,"score_gpt":0.29359529617326785,"score_spread":0.27573688124279155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76468100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903541,0.0002834498,0.0015506829,0.0012104679,0.0005508074,0.00020242663,7.317678e-7,0.00017226346,0.0056750765],"genre_scores_gemma":[0.9865926,0.000015421327,0.012999479,0.00016925292,0.000007251497,0.000027003063,7.848655e-7,0.000013164805,0.00017504799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839336,0.0001380022,0.000244574,0.00038933853,0.000338433,0.0004963058],"domain_scores_gemma":[0.9989101,0.0002368541,0.000049663246,0.00061802746,0.0000682583,0.0001170959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072580815,0.00013292661,0.00016947208,0.00024600417,0.00010012228,0.000089299516,0.000995923,0.000059371876,0.000020552301],"category_scores_gemma":[0.00016530488,0.00013605524,0.00004685029,0.000933959,0.000065223314,0.00086709176,0.00037238674,0.00028228256,0.00026614903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005694482,0.00010002161,0.0037776236,0.000005409255,0.000004100031,0.000028908962,0.00050884695,0.00015986743,0.0012689937,0.9406611,0.00020844123,0.053271],"study_design_scores_gemma":[0.0012458138,0.000072601964,0.0060150167,0.00003542547,0.0000013381115,0.000017621493,0.00003530233,0.031617824,0.0076483437,0.94901747,0.004009263,0.00028397326],"about_ca_topic_score_codex":0.000011005797,"about_ca_topic_score_gemma":0.00001695965,"teacher_disagreement_score":0.052987028,"about_ca_system_score_codex":0.00011677394,"about_ca_system_score_gemma":0.000047572634,"threshold_uncertainty_score":0.55481714},"labels":[],"label_agreement":null},{"id":"W779346977","doi":"","title":"The monophonie detour hull number of a graph","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hull; Combinatorics; Graph; Discrete mathematics; Marine engineering; Engineering","score_opus":0.013445473967491238,"score_gpt":0.2772048916383965,"score_spread":0.26375941767090527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W779346977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9010024,0.00056782877,0.08349155,0.00051991816,0.012308125,0.0005413278,7.5556557e-7,0.00005211865,0.0015159502],"genre_scores_gemma":[0.9755166,0.000087851935,0.023903102,0.00001506163,0.00043399303,0.0000045049933,1.1501411e-7,0.00002441395,0.000014335509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967431,0.00023098617,0.0012936128,0.00022619555,0.0010137596,0.00049233844],"domain_scores_gemma":[0.9942584,0.0022534975,0.0013611664,0.0005797388,0.0013003113,0.00024685613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024278893,0.00026600188,0.000656285,0.0001694519,0.0004707253,0.0004696979,0.0017630489,0.00012299731,0.0000073697483],"category_scores_gemma":[0.00074157515,0.00018578206,0.0002553978,0.0006987935,0.00025149417,0.0005889432,0.00068585813,0.0005979375,0.00001034272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028325288,0.00024100786,0.00030317905,0.000060530092,0.000090693095,0.00000876362,0.0006534648,0.000016469117,0.0007757099,0.99270105,0.00027130893,0.0048494856],"study_design_scores_gemma":[0.0018427968,0.0003819669,0.00018986834,0.00013848524,0.000019730185,0.0001345286,0.00025822542,0.005789157,0.0015700262,0.9891522,0.00032881848,0.00019422534],"about_ca_topic_score_codex":0.00001430915,"about_ca_topic_score_gemma":2.0162378e-7,"teacher_disagreement_score":0.074514195,"about_ca_system_score_codex":0.000050006514,"about_ca_system_score_gemma":0.00016222803,"threshold_uncertainty_score":0.75759727},"labels":[],"label_agreement":null},{"id":"W78658037","doi":"10.1007/978-3-642-30541-2_2","title":"On a DAG Partitioning Problem","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Directed acyclic graph; Bounded function; Combinatorics; Graph; Feedback arc set; Pathwidth; Graph partition; Computer science; Directed graph; Mathematics; Strongly connected component; Discrete mathematics; Time complexity; Line graph; Voltage graph","score_opus":0.026816232369333087,"score_gpt":0.28554245065602657,"score_spread":0.2587262182866935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78658037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003686923,0.00046829958,0.9847944,0.0005303556,0.00075907074,0.0004417048,0.0000032451412,0.00021346702,0.012752608],"genre_scores_gemma":[0.24642634,0.00006394096,0.7496155,0.0019771215,0.00066462596,0.000047772413,0.000006433243,0.00007695305,0.0011213231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556124,0.00006211204,0.0004171975,0.0014761563,0.0013766531,0.0011066407],"domain_scores_gemma":[0.99671984,0.0008371299,0.00021722278,0.0017162694,0.00021471082,0.00029483682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001419844,0.0004935565,0.0004238979,0.0010494599,0.00038635632,0.00048220684,0.0036670163,0.0002532414,0.00006458737],"category_scores_gemma":[0.000117349766,0.00044366202,0.00012692608,0.00080580445,0.00085940753,0.0009580296,0.0015359548,0.0012315619,0.00029128525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063562075,0.000028548608,0.00002245629,0.000020741038,0.000005911748,0.000041081927,0.00035418573,0.02145863,0.00007647662,0.5023957,0.000016405365,0.47557348],"study_design_scores_gemma":[0.00018278763,0.00021342203,0.000036822315,0.00039047617,0.0000029972082,0.00004954179,5.5321774e-8,0.06721306,0.00096798316,0.9285161,0.001878082,0.0005486605],"about_ca_topic_score_codex":0.00000462815,"about_ca_topic_score_gemma":0.000017127022,"teacher_disagreement_score":0.47502482,"about_ca_system_score_codex":0.0003296505,"about_ca_system_score_gemma":0.00035127788,"threshold_uncertainty_score":0.9998015},"labels":[],"label_agreement":null},{"id":"W78797683","doi":"","title":"Some Properties Of Strong Domination Numbers Of Hypergraphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014131852217851671,"score_gpt":0.24701193208292582,"score_spread":0.23288007986507414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W78797683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995854,0.00056566624,0.0012822072,0.00009318573,0.00044518197,0.00018305027,0.0000015536779,0.000052940486,0.0015221679],"genre_scores_gemma":[0.99795383,0.000012687708,0.0018628789,0.0000052831024,0.0000053256686,0.00001219648,0.0000011276848,0.000008869444,0.000137828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987732,0.00009229555,0.00028301275,0.00021543157,0.0004131495,0.00022291555],"domain_scores_gemma":[0.9990695,0.00006515493,0.00014959116,0.00046624278,0.00021363997,0.000035873272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032517296,0.00010065735,0.00019371312,0.00019047149,0.00005411268,0.000018856414,0.0006747812,0.000046041867,0.0000024614485],"category_scores_gemma":[0.00004655528,0.00009148088,0.00007483666,0.0005351257,0.00020257862,0.0006255591,0.000162789,0.00009390754,0.000004970959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001432282,0.000118122516,0.0016232444,0.000033421893,0.000010423564,0.0000013581645,0.00010737217,0.00009482376,0.037643973,0.95954263,0.000064302374,0.0007459973],"study_design_scores_gemma":[0.0005147947,0.000085754255,0.0016624084,0.00003227577,0.000003147834,0.000001529989,0.00003276377,0.0011624822,0.21025656,0.786115,0.00004246745,0.000090819034],"about_ca_topic_score_codex":0.00009402932,"about_ca_topic_score_gemma":0.0000036717752,"teacher_disagreement_score":0.17342764,"about_ca_system_score_codex":0.000029714838,"about_ca_system_score_gemma":0.000050556675,"threshold_uncertainty_score":0.3730482},"labels":[],"label_agreement":null},{"id":"W81407506","doi":"","title":"Transverse families of matchings in the plane.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transverse plane; Plane (geometry); Combinatorics; Geometry; Structural engineering; Engineering","score_opus":0.011947212194047895,"score_gpt":0.2555910858161357,"score_spread":0.2436438736220878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81407506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98957133,0.00007719059,0.00027884176,0.00041535986,0.00014703632,0.00015161693,0.0000018612254,0.00003743971,0.009319343],"genre_scores_gemma":[0.99902433,0.000058987152,0.00067335216,0.00010133052,0.0000014653438,0.000010672104,8.624649e-7,0.0000049063906,0.00012411947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989438,0.00015934813,0.0001634455,0.00018347405,0.00032266873,0.00022723862],"domain_scores_gemma":[0.9991511,0.00026027378,0.000025525185,0.00051148067,0.00002140797,0.00003017946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005044303,0.00008333791,0.00012242739,0.00009358633,0.000056254816,0.000028164673,0.0012897426,0.000034210552,0.000049473947],"category_scores_gemma":[0.000016299342,0.000062276406,0.000042904132,0.00059081055,0.00010060322,0.00028480645,0.00003901179,0.00018654481,0.000047735106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019491032,0.000085110936,0.00068247155,0.000008688498,0.0000042499983,0.000021897207,0.004343268,0.000054053242,0.00029281512,0.9813878,0.00015715686,0.0129429875],"study_design_scores_gemma":[0.00057723414,0.00009251481,0.004554286,0.00001565251,0.0000013567292,0.000009476646,0.0002709468,0.00048807,0.0012628306,0.9901854,0.0024493102,0.00009295601],"about_ca_topic_score_codex":0.0000611619,"about_ca_topic_score_gemma":0.000009099246,"teacher_disagreement_score":0.012850031,"about_ca_system_score_codex":0.000012944399,"about_ca_system_score_gemma":0.000024492852,"threshold_uncertainty_score":0.2539558},"labels":[],"label_agreement":null},{"id":"W81615461","doi":"","title":"Circumferences of 2-Connected Claw-Free Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Claw; Mathematics; Combinatorics; Structural engineering; Engineering","score_opus":0.019228272521084465,"score_gpt":0.26707222680117987,"score_spread":0.2478439542800954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81615461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96134454,0.00061401015,0.010256444,0.00025475965,0.0020935175,0.00035749603,0.00000507505,0.00029269315,0.024781443],"genre_scores_gemma":[0.99402726,0.000026937007,0.0057528443,0.000043049928,0.0000013934354,0.00001719205,9.759307e-7,0.000011619039,0.00011872252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809885,0.00029629975,0.00028731118,0.00040920475,0.00048750004,0.0004208266],"domain_scores_gemma":[0.9976647,0.00040179555,0.00012223689,0.0014224376,0.00025107895,0.00013774968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006030759,0.00015829924,0.00025403654,0.00024066352,0.00011999432,0.00005224429,0.0020232943,0.0000802027,0.00004728005],"category_scores_gemma":[0.0007088073,0.00015207406,0.00009716294,0.0014522354,0.00020831477,0.00044003918,0.00026153607,0.00021475497,0.000028236582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050889103,0.00009426192,0.0038232906,0.000011629546,0.000021056409,0.000008441213,0.00015402379,0.0000038165726,0.0018323419,0.9927302,0.00036527737,0.00095055427],"study_design_scores_gemma":[0.00075964065,0.0001519277,0.0022759007,0.000015242184,0.0000031716427,0.000008002335,0.00003662763,0.000120302626,0.019604359,0.97633904,0.00051907107,0.00016669634],"about_ca_topic_score_codex":0.000012044243,"about_ca_topic_score_gemma":0.0000039757047,"teacher_disagreement_score":0.032682706,"about_ca_system_score_codex":0.000024657542,"about_ca_system_score_gemma":0.000113541086,"threshold_uncertainty_score":0.62014},"labels":[],"label_agreement":null},{"id":"W82574740","doi":"","title":"Long Cycles in 2-Connected Triangle-Free Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Circumference; Bipartite graph; Degree (music); Graph; Connectivity; Discrete mathematics; Geometry; Physics","score_opus":0.024307189558129275,"score_gpt":0.27066436548210565,"score_spread":0.24635717592397638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82574740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929318,0.00043719425,0.002140946,0.00060221995,0.0009240173,0.0003082947,0.0000019849406,0.00030935,0.002344216],"genre_scores_gemma":[0.99688315,0.0000774669,0.002702504,0.000104766055,0.000004994089,0.000040520994,0.0000024270591,0.00002034943,0.00016381496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777335,0.0002707309,0.00032826953,0.0005360236,0.00049054314,0.0006010583],"domain_scores_gemma":[0.9977698,0.00045207463,0.00008194526,0.0014133774,0.00011452934,0.00016832066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054106966,0.0001961764,0.00030551237,0.00051302544,0.00019976938,0.000054588574,0.0022821443,0.0000977184,0.000019378636],"category_scores_gemma":[0.0005200933,0.00019930897,0.00010888275,0.0020452577,0.000193374,0.00072099897,0.00060070603,0.0003595084,0.00007853761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002928613,0.00016123758,0.029396135,0.000006584625,0.000012658029,0.0004028299,0.0003907123,0.000016302833,0.00025183058,0.9662821,0.0008906306,0.0021596465],"study_design_scores_gemma":[0.0024685415,0.000101541285,0.06534756,0.0000202758,0.0000013896,0.000050923776,0.0000150310725,0.0006977665,0.0021562509,0.9287168,0.00018647428,0.0002374409],"about_ca_topic_score_codex":0.0000433437,"about_ca_topic_score_gemma":0.000034569402,"teacher_disagreement_score":0.037565343,"about_ca_system_score_codex":0.000076616416,"about_ca_system_score_gemma":0.00009845962,"threshold_uncertainty_score":0.8127584},"labels":[],"label_agreement":null},{"id":"W826208409","doi":"","title":"The linear t-arboricity of complete bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Bipartite graph; Dense graph; Complete bipartite graph; Combinatorics; 1-planar graph; Discrete mathematics; Graph; Chordal graph; Planar graph","score_opus":0.02636395996074221,"score_gpt":0.2948282829023085,"score_spread":0.2684643229415663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W826208409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96137077,0.00053440867,0.024479311,0.0013341575,0.00442651,0.0005398818,0.000008742347,0.00031631315,0.0069899326],"genre_scores_gemma":[0.9968311,0.000038257996,0.0029004393,0.000071324044,0.000013164793,0.000012314742,6.1129185e-7,0.0000110546725,0.00012172472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983273,0.00019659271,0.0002717927,0.00030638173,0.0004662602,0.00043164764],"domain_scores_gemma":[0.997717,0.00048038608,0.00012774345,0.0011559008,0.00040801687,0.00011095485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008448841,0.00012743019,0.00017278643,0.00010295889,0.00043231618,0.000057816662,0.0018401087,0.000045634457,0.000008054321],"category_scores_gemma":[0.00019418572,0.000092910544,0.00008753911,0.0012043858,0.000701945,0.00027051618,0.0005138231,0.00019339158,0.00010613929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001714,0.000043218188,0.0012081896,0.000004018911,0.000017818435,0.0000022476927,0.00014081592,0.000002220057,0.0018147548,0.9938894,0.0005255905,0.0023345856],"study_design_scores_gemma":[0.00034540475,0.00027251928,0.0028723641,0.00000980504,0.0000026657342,0.0000025465001,0.000011054159,0.0048441147,0.011475701,0.96857554,0.011472243,0.00011604262],"about_ca_topic_score_codex":0.000019126965,"about_ca_topic_score_gemma":0.000008111673,"teacher_disagreement_score":0.035460364,"about_ca_system_score_codex":0.000022413542,"about_ca_system_score_gemma":0.000054008116,"threshold_uncertainty_score":0.3788782},"labels":[],"label_agreement":null},{"id":"W833184608","doi":"10.1016/j.dam.2015.05.025","title":"Triangulations and equality in the domination chain","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Characterization (materials science); Cardinality (data modeling); Combinatorics; Domination analysis; Dominating set; Chain (unit); Discrete mathematics; Graph; Computer science; Data mining","score_opus":0.06494971143370033,"score_gpt":0.3402882606783024,"score_spread":0.2753385492446021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W833184608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02771955,0.000036810026,0.9536999,0.001203293,0.00002107737,0.0004964164,0.0000019891193,0.00004533015,0.016775677],"genre_scores_gemma":[0.88689005,0.0000030064095,0.11283176,0.00011298996,0.00001617867,0.00008708199,0.0000032383275,0.0000060820694,0.000049601516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990474,0.000075683805,0.00020701808,0.00016889007,0.0003307968,0.00017022272],"domain_scores_gemma":[0.9989886,0.00038207765,0.0000693484,0.00047133473,0.0000334672,0.000055131983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020984965,0.00008232207,0.00011761878,0.00008846469,0.00006618765,0.000104397615,0.00048793788,0.000033370543,0.0000014734666],"category_scores_gemma":[0.00016492396,0.000055755634,0.000017944969,0.0004358849,0.000076219505,0.00016774349,0.00014780973,0.00011168743,0.000012801457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037458217,0.000029892477,0.000010183921,0.000014054028,0.0000020590383,9.42798e-7,0.009599994,0.000046261204,0.00020464332,0.98612535,0.000030959203,0.003931904],"study_design_scores_gemma":[0.00048657646,0.000016144184,0.00023730722,0.000006479218,0.0000024364424,0.000004570703,0.0022586586,0.036964748,0.00023825714,0.95946985,0.0002296166,0.00008532846],"about_ca_topic_score_codex":0.0000030571746,"about_ca_topic_score_gemma":0.000009294412,"teacher_disagreement_score":0.8591705,"about_ca_system_score_codex":0.000023956742,"about_ca_system_score_gemma":0.000024990151,"threshold_uncertainty_score":0.22736487},"labels":[],"label_agreement":null},{"id":"W84558688","doi":"","title":"Enumerations of Unlabelled Multigraphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Statistics","score_opus":0.015039088537401933,"score_gpt":0.282554488399597,"score_spread":0.2675153998621951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84558688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9279797,0.0009011349,0.055577748,0.0024324434,0.0013188953,0.00060139666,0.0000064355254,0.0004029174,0.010779322],"genre_scores_gemma":[0.974195,0.000022130102,0.02537568,0.00006226456,0.0000045486477,0.000016940201,0.0000012819733,0.000007783372,0.00031435105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890006,0.00009218,0.00022005336,0.0002440835,0.0002949635,0.00024863426],"domain_scores_gemma":[0.9988159,0.00018824963,0.000072380164,0.00066678255,0.00016493224,0.00009176925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029020742,0.00009710361,0.00014522787,0.00017405808,0.000118971635,0.000031498497,0.0008404323,0.000044225475,0.000029624856],"category_scores_gemma":[0.000095876014,0.0000962369,0.00006864356,0.00075432484,0.000093839146,0.00047636835,0.00018599434,0.00013907772,0.00008039794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041354247,0.00012342451,0.0006210093,0.0000036591825,0.000013331195,0.0000016454402,0.00030745138,0.000094604715,0.0040388717,0.98559374,0.00041021686,0.008787932],"study_design_scores_gemma":[0.0010862777,0.00010657057,0.0013399961,0.0000120357445,0.0000037185343,0.000003919296,0.000018551633,0.011669575,0.046441205,0.9340735,0.005068593,0.00017607272],"about_ca_topic_score_codex":0.000007146426,"about_ca_topic_score_gemma":0.00000515883,"teacher_disagreement_score":0.051520236,"about_ca_system_score_codex":0.000023984783,"about_ca_system_score_gemma":0.000050762996,"threshold_uncertainty_score":0.3924427},"labels":[],"label_agreement":null},{"id":"W84752148","doi":"","title":"Lower bounds on the signed k-subdomination number of graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013654151886603199,"score_gpt":0.27968573837148053,"score_spread":0.26603158648487735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84752148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98064625,0.000027293821,0.0071342234,0.0016138576,0.0011142205,0.0002909705,0.0000013855213,0.00009397274,0.0090778405],"genre_scores_gemma":[0.99847513,0.0000061075793,0.0011689886,0.00016951631,0.000003433988,0.000026196178,8.4159035e-7,0.000012145505,0.00013766569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985466,0.00013364703,0.00020095312,0.00028699538,0.00054574263,0.00028606204],"domain_scores_gemma":[0.99844235,0.00036693757,0.00010133915,0.00083931285,0.0001840516,0.00006601636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006341805,0.00012992103,0.00014451059,0.00010135258,0.0001774146,0.000066092965,0.0011222708,0.000058891084,0.000033702425],"category_scores_gemma":[0.00017553101,0.0000962649,0.000094532756,0.0009266341,0.00020044057,0.0003355712,0.00017844654,0.00019969804,0.00013051287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024558874,0.00017605584,0.0002465644,0.0000040094524,0.000013447838,0.0000067871642,0.00025343813,0.000031555148,0.0012540927,0.99688596,0.00015657529,0.0009469465],"study_design_scores_gemma":[0.00071464916,0.00017527299,0.00094020687,0.000021151965,0.0000024080043,0.0000041449593,0.000020609164,0.00011626407,0.01820487,0.97951245,0.00017960876,0.000108359345],"about_ca_topic_score_codex":0.000011442933,"about_ca_topic_score_gemma":0.000001412531,"teacher_disagreement_score":0.01782887,"about_ca_system_score_codex":0.00007065966,"about_ca_system_score_gemma":0.00007167188,"threshold_uncertainty_score":0.39255685},"labels":[],"label_agreement":null},{"id":"W85795673","doi":"","title":"The Connectivities of Trunk Graphs of Connected Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Trunk; Combinatorics; Graph; Botany","score_opus":0.015913673954377816,"score_gpt":0.26678116363131926,"score_spread":0.25086748967694145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85795673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933297,0.00070202746,0.0014446363,0.00028194327,0.0009157148,0.00026779054,0.0000037611442,0.00010007355,0.0029543748],"genre_scores_gemma":[0.99920535,0.00023382703,0.00038218932,0.000021907868,0.0000017851738,0.000022958751,0.0000010884702,0.000013028186,0.00011784245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981301,0.0002894271,0.000375112,0.00029729423,0.00049925654,0.00040880163],"domain_scores_gemma":[0.9966465,0.0016426092,0.00022507095,0.0010203202,0.00037852442,0.000086979846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007838698,0.0001576277,0.00029716728,0.00022720362,0.0002275192,0.000042152536,0.0015347017,0.00006497805,0.0000124986245],"category_scores_gemma":[0.00035825185,0.00012108364,0.00015046433,0.001618899,0.000632501,0.00034293527,0.00027908137,0.00019886621,0.0000047797894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005137856,0.00009259061,0.003676239,0.000011722294,0.000049241928,0.0000067544015,0.0003483089,0.000007644877,0.0031146558,0.9892659,0.00018253336,0.0031930401],"study_design_scores_gemma":[0.00073777017,0.00026915854,0.0042517902,0.00002216977,0.0000051592506,0.000011589782,0.00018296267,0.00043469263,0.021970151,0.9713538,0.0006316113,0.00012913687],"about_ca_topic_score_codex":0.000036562324,"about_ca_topic_score_gemma":0.000015387657,"teacher_disagreement_score":0.018855495,"about_ca_system_score_codex":0.000019494213,"about_ca_system_score_gemma":0.00007450084,"threshold_uncertainty_score":0.49376476},"labels":[],"label_agreement":null},{"id":"W91420253","doi":"","title":"Super-Arc-Connected and Super-Connected Total Digraphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Combinatorics; Strongly connected component; Geometry","score_opus":0.015779937784937303,"score_gpt":0.2454578139895045,"score_spread":0.2296778762045672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91420253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99490464,0.0005776565,0.0011594308,0.00042789467,0.0008664345,0.0003325968,0.000005842701,0.00050265645,0.001222851],"genre_scores_gemma":[0.9973237,0.00010823859,0.0020469087,0.00011822121,0.000012002956,0.00004049082,0.000008024761,0.000032539705,0.0003098996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972738,0.0002468715,0.00032585463,0.00081086525,0.0005614846,0.00078109937],"domain_scores_gemma":[0.99765253,0.0006171463,0.00005991283,0.0010468828,0.00025817193,0.00036534297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033341706,0.00031308262,0.00036750443,0.00034942012,0.0005408097,0.00012360467,0.0010469133,0.00014169807,0.000044067383],"category_scores_gemma":[0.00039290308,0.00030872758,0.00011046946,0.0014769558,0.00043096923,0.0010103463,0.00060018,0.00042985016,0.00007853947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003600198,0.00017081593,0.011590897,0.000013524956,0.00004498392,0.00020707163,0.0012807067,0.0000045254574,0.005197835,0.97894615,0.0006722287,0.0018352487],"study_design_scores_gemma":[0.0032962041,0.0006144044,0.06981958,0.00003436207,0.000010757864,0.00068699423,0.00013370419,0.0029048366,0.01233557,0.90833175,0.0009739166,0.000857946],"about_ca_topic_score_codex":0.000052120937,"about_ca_topic_score_gemma":0.000007511545,"teacher_disagreement_score":0.07061443,"about_ca_system_score_codex":0.000050912062,"about_ca_system_score_gemma":0.000110569425,"threshold_uncertainty_score":0.99993646},"labels":[],"label_agreement":null},{"id":"W920035815","doi":"10.1016/j.ejc.2015.04.005","title":"Displaying blocking pairs in signed graphs","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Signed graph; Graph; Discrete mathematics; Blocking (statistics); Line graph","score_opus":0.039532124111896313,"score_gpt":0.2762106568089395,"score_spread":0.2366785326970432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W920035815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4885682,0.0012821312,0.49195197,0.00062784465,0.0018606237,0.00013689454,4.0505017e-7,0.00007638819,0.015495551],"genre_scores_gemma":[0.9950894,0.000023996168,0.0047094915,0.000056882098,0.000037285557,3.3702224e-7,1.173355e-7,0.00002109975,0.00006135546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972538,0.0010201564,0.00051880337,0.00017296469,0.0006950723,0.0003392413],"domain_scores_gemma":[0.9984329,0.00019948445,0.0003169155,0.00036259668,0.0003791455,0.0003090052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046870583,0.00013278353,0.00022482887,0.00053044857,0.00006847021,0.00012608143,0.0015906002,0.000017954384,0.0000017268801],"category_scores_gemma":[0.00052603264,0.00011811296,0.000093875264,0.0012806344,0.000057934696,0.00072787894,0.0003331377,0.00051006,0.000020631978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118097894,0.00043086015,0.030359702,0.000024797042,0.00004505312,0.0063188714,0.0039999713,0.0024089175,0.0009781822,0.9301525,0.0014018636,0.023761205],"study_design_scores_gemma":[0.007298954,0.0023129457,0.013504474,0.00035040814,0.0000144479045,0.00078085135,0.00088056375,0.005842501,0.0014355808,0.95801795,0.00881938,0.0007419274],"about_ca_topic_score_codex":5.7513876e-7,"about_ca_topic_score_gemma":2.5411796e-7,"teacher_disagreement_score":0.5065212,"about_ca_system_score_codex":0.000102474114,"about_ca_system_score_gemma":0.00010885986,"threshold_uncertainty_score":0.48165068},"labels":[],"label_agreement":null},{"id":"W9227663","doi":"10.1080/21548331.1997.11443530","title":"Trees With Path-Stable Center.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Center (category theory); Path (computing); Computer science; Crystallography; Computer network; Chemistry","score_opus":0.009179629047181998,"score_gpt":0.2414310311169721,"score_spread":0.23225140206979009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9227663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8839199,0.00044426956,0.055567097,0.00090241584,0.0013910928,0.0005507781,0.000009271375,0.00083253905,0.056382652],"genre_scores_gemma":[0.99187845,0.000005504338,0.0067443918,0.00005040918,0.00000767503,0.000022064005,0.000004256053,0.000016443968,0.0012708104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985169,0.00007923639,0.00014635228,0.00038043634,0.0004075363,0.0004695301],"domain_scores_gemma":[0.9989264,0.0000953939,0.000055362598,0.0007252886,0.0001066744,0.0000908781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021473636,0.00014536221,0.00015010436,0.00009971475,0.00016433613,0.0001360692,0.0009109469,0.000039751874,0.000014969095],"category_scores_gemma":[0.0000140671955,0.00012030646,0.000040825864,0.00063855207,0.000094058305,0.0005767005,0.00021816861,0.00015999726,0.00008385707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013958631,0.00015548474,0.00955332,0.000004359496,0.0000071124246,0.00005096593,0.000042037133,0.00004715016,0.00044903895,0.9871889,0.0014891254,0.0009985504],"study_design_scores_gemma":[0.0011055031,0.0001942244,0.0063428986,0.000020189553,0.0000019503154,0.000020652467,0.00001302427,0.0010341923,0.0035730654,0.98043895,0.007044008,0.00021134915],"about_ca_topic_score_codex":0.000051566738,"about_ca_topic_score_gemma":0.000022246708,"teacher_disagreement_score":0.10795856,"about_ca_system_score_codex":0.000050657254,"about_ca_system_score_gemma":0.000049444676,"threshold_uncertainty_score":0.4905955},"labels":[],"label_agreement":null},{"id":"W92926827","doi":"","title":"A note on graphs with largest total k-domination number.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph; Vertex (graph theory)","score_opus":0.009164763541006529,"score_gpt":0.27539502022611634,"score_spread":0.2662302566851098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92926827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9654918,0.00003632473,0.0147238,0.0020849563,0.00078955386,0.00041865875,0.0000033199706,0.00036628588,0.016085347],"genre_scores_gemma":[0.9896945,0.000006126097,0.009514832,0.00017407643,0.000011067747,0.000035998026,0.0000027790213,0.00001935491,0.00054131704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982579,0.00014001876,0.00016029719,0.00044670943,0.0005697551,0.0004253266],"domain_scores_gemma":[0.9986717,0.00026762704,0.00007330311,0.00069718005,0.00014526241,0.00014493015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044890548,0.00017575725,0.00015868746,0.00014465702,0.00023359022,0.0001110281,0.00063339545,0.00006458338,0.00002899387],"category_scores_gemma":[0.00008161266,0.00015308312,0.000056984023,0.0008180738,0.000090927904,0.00073619554,0.00015199272,0.00034609155,0.0004604273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047761347,0.00018754961,0.00087095355,0.0000038048765,0.000010220216,0.000020453563,0.00022472853,0.000105720625,0.00024652522,0.9856243,0.00032164477,0.012336312],"study_design_scores_gemma":[0.002481941,0.00054568006,0.007001844,0.000042862383,0.000005578735,0.00006475798,0.000018312936,0.006630612,0.009332765,0.97056526,0.0028934334,0.00041697416],"about_ca_topic_score_codex":0.0000062410413,"about_ca_topic_score_gemma":0.0000072588346,"teacher_disagreement_score":0.024202695,"about_ca_system_score_codex":0.000095527954,"about_ca_system_score_gemma":0.000056335004,"threshold_uncertainty_score":0.6242549},"labels":[],"label_agreement":null},{"id":"W929955757","doi":"10.1016/j.disc.2015.06.024","title":"Dichotomy for finite tournaments of mixed-type","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Unary operation; Tournament; Combinatorics; Conjecture; Constraint satisfaction problem; Congruence (geometry); Singleton; Type (biology); Discrete mathematics; Algebraic number; Statistics","score_opus":0.07072933088438883,"score_gpt":0.3471430431633135,"score_spread":0.2764137122789247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W929955757","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022220567,0.00007742871,0.9747219,0.00012133935,0.00019072743,0.00035810776,0.000010487377,0.000052932766,0.0022465067],"genre_scores_gemma":[0.40008715,0.000008690123,0.5988889,0.000035914458,0.000033493336,0.00003873586,0.00000585971,0.000022470176,0.0008788237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883646,0.000038033915,0.00029321105,0.00017970521,0.0003929641,0.00025961106],"domain_scores_gemma":[0.99842024,0.0003704823,0.00015713576,0.00062082836,0.0002868436,0.00014444525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006539406,0.000111365,0.00021567526,0.000103401144,0.00004311289,0.000051471186,0.0008700029,0.000038802064,0.000005346573],"category_scores_gemma":[0.0007087892,0.00009020266,0.00007531152,0.00035456376,0.0000712743,0.00025962965,0.000247323,0.00007595343,0.000027809596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005178508,0.00022236658,0.00039742305,0.00032345142,0.000087730834,0.0000083424575,0.004534243,0.0007432777,0.00093016063,0.98580307,0.0021428494,0.004755296],"study_design_scores_gemma":[0.0007892897,0.00031568517,0.00002952958,0.00007871632,0.000012185872,0.000006104909,0.00033623425,0.11179221,0.007700912,0.87562746,0.0031189262,0.00019277114],"about_ca_topic_score_codex":9.2350587e-7,"about_ca_topic_score_gemma":7.2914105e-7,"teacher_disagreement_score":0.37786657,"about_ca_system_score_codex":0.000025228459,"about_ca_system_score_gemma":0.00006467914,"threshold_uncertainty_score":0.36783576},"labels":[],"label_agreement":null},{"id":"W93756305","doi":"","title":"Extensions of Bondys Theorem on Cycles in 2-Connected Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.017264078822137433,"score_gpt":0.2915152480615969,"score_spread":0.27425116923945947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93756305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99117106,0.00010540627,0.0025538858,0.00023296264,0.0005915407,0.0002246876,0.0000015819151,0.00011448767,0.0050044036],"genre_scores_gemma":[0.99782836,0.000016122578,0.0019851923,0.00011040044,0.0000022346298,0.0000068922777,0.0000013523141,0.0000141817145,0.000035269306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982121,0.00015145549,0.0003356192,0.00039222385,0.00042733556,0.0004812785],"domain_scores_gemma":[0.9978186,0.0009375284,0.00009769059,0.00087120215,0.0001494156,0.00012556561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012674892,0.00015096662,0.00023567195,0.00057705044,0.00008299399,0.000022249307,0.0009751749,0.000083165265,0.000009947187],"category_scores_gemma":[0.00034727788,0.00013939195,0.00008104739,0.0016665214,0.00017894103,0.00024311761,0.0002394734,0.00030273385,0.00002541113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049754606,0.00021773795,0.003043674,0.000005572698,0.0000076363,0.000057100795,0.00025619863,0.00002001461,0.0055569015,0.9864918,0.00010193279,0.004191704],"study_design_scores_gemma":[0.0007181647,0.00018264388,0.0309246,0.00004412761,0.0000013232534,0.000004828443,0.000055154804,0.00032847686,0.031352445,0.9361686,0.00007978961,0.00013981292],"about_ca_topic_score_codex":0.000016610313,"about_ca_topic_score_gemma":0.000017314549,"teacher_disagreement_score":0.05032314,"about_ca_system_score_codex":0.00004421247,"about_ca_system_score_gemma":0.000041915104,"threshold_uncertainty_score":0.56842387},"labels":[],"label_agreement":null},{"id":"W942805742","doi":"10.1007/978-3-662-07003-1_8","title":"Logics with Counting","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Locality; Expressive power; Computer science; Theoretical computer science; Order (exchange); Mathematics; Algorithm; Philosophy","score_opus":0.03145243424737198,"score_gpt":0.26695618135805055,"score_spread":0.23550374711067856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W942805742","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.088595e-7,0.00007599462,0.4008577,0.000118102165,0.00003841627,0.00010650664,9.767983e-7,0.00016496157,0.59863645],"genre_scores_gemma":[0.0014612238,0.000054144246,0.12627801,0.00040932698,0.00007290093,0.000005094968,0.0000034944687,0.000042930347,0.87167287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849874,0.000006736316,0.00014720586,0.0005010448,0.00054155424,0.00030473003],"domain_scores_gemma":[0.9987741,0.00008129156,0.00009584317,0.0007967795,0.00016474539,0.00008724689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019693657,0.0002369789,0.00021314541,0.00015628287,0.00009933491,0.00012385575,0.0011305333,0.00014095275,0.00031971314],"category_scores_gemma":[0.000009264845,0.00016960985,0.000058382746,0.00006668365,0.00015820903,0.00025646342,0.000370225,0.00043682408,0.00039160365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035752898,0.0000034586524,0.0000027809874,0.00001173374,0.000015261408,0.00009346037,0.000019479981,0.00009463041,0.0000034040238,0.99368566,0.000083768144,0.0059827683],"study_design_scores_gemma":[0.00015299198,0.00011027549,0.0000025586985,0.000090255264,0.0000032697305,0.00003643184,0.0000018092907,0.00017644191,0.000056029916,0.9409562,0.058126956,0.00028677308],"about_ca_topic_score_codex":0.0000035866644,"about_ca_topic_score_gemma":0.000010986864,"teacher_disagreement_score":0.27457967,"about_ca_system_score_codex":0.000090983136,"about_ca_system_score_gemma":0.00019108066,"threshold_uncertainty_score":0.6916489},"labels":[],"label_agreement":null},{"id":"W943098930","doi":"10.1007/978-3-319-06686-8_25","title":"A Parameterized Algorithm for Packing Overlapping Subgraphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parameterized complexity; Algorithm; Parallel computing; Theoretical computer science","score_opus":0.026081472131606883,"score_gpt":0.2877207777364756,"score_spread":0.2616393056048687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W943098930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002510483,0.00031868127,0.995838,0.00027175585,0.0015093591,0.0009960345,0.00001195021,0.00026479547,0.00076431537],"genre_scores_gemma":[0.011255145,0.000038562706,0.9867573,0.0010204596,0.00044883366,0.00006429747,0.000007674069,0.00006946831,0.00033828692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943811,0.0000807673,0.0006483291,0.0022972347,0.0012624284,0.0013301228],"domain_scores_gemma":[0.99461937,0.0021885284,0.00038641723,0.002087473,0.0004345667,0.0002836578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022864284,0.00069707184,0.0008581924,0.0015686812,0.0004771815,0.0008296254,0.0049427343,0.00037520946,0.00001075178],"category_scores_gemma":[0.0002912945,0.000659633,0.000347353,0.0010018569,0.001089873,0.00062387844,0.001629511,0.00094871345,0.000023473323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008287495,0.000011260163,0.000006095137,0.000039414994,0.00001580011,0.000026270018,0.00020831575,0.0024797495,0.000345267,0.07086031,0.000006650369,0.9259926],"study_design_scores_gemma":[0.0003904015,0.00019795865,0.000009230979,0.00026047393,0.0000047472736,0.000036084894,8.1424005e-8,0.5319398,0.0007696385,0.4637022,0.0021395735,0.000549835],"about_ca_topic_score_codex":0.0000067113874,"about_ca_topic_score_gemma":0.0000137157585,"teacher_disagreement_score":0.92544276,"about_ca_system_score_codex":0.0002726267,"about_ca_system_score_gemma":0.0004109628,"threshold_uncertainty_score":0.9995855},"labels":[],"label_agreement":null},{"id":"W94648563","doi":"","title":"Lower bounds on dominating functions in graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Combinatorics; Graph","score_opus":0.012760276739990906,"score_gpt":0.2704202048579882,"score_spread":0.25765992811799726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94648563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9623285,0.00006215202,0.0006633665,0.0003994801,0.0011825492,0.0001895131,0.000001213058,0.00016955682,0.03500367],"genre_scores_gemma":[0.9968044,0.000010812958,0.0010147677,0.00016678106,0.0000047099807,0.000040028666,0.000001389462,0.000013908108,0.001943171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840444,0.00014005639,0.0002090071,0.0004314682,0.0003667582,0.00044824585],"domain_scores_gemma":[0.99882907,0.0002652716,0.00003439963,0.0007121453,0.000053475705,0.00010561985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049213023,0.00014336001,0.00015132292,0.00029445786,0.00020605211,0.00011564544,0.00078670436,0.000063799416,0.00019140243],"category_scores_gemma":[0.00007333914,0.00014435436,0.000071351984,0.0014067579,0.00009299376,0.0004906625,0.00010395539,0.00035875523,0.00044807594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030545205,0.00021043538,0.0013630178,0.0000028598943,0.0000059135577,0.00004158402,0.00016822366,0.00012865082,0.00012132883,0.96654016,0.00047186392,0.030915396],"study_design_scores_gemma":[0.0008878362,0.00025278688,0.004963851,0.000028412267,0.0000011737764,0.000006041641,0.00001819718,0.0018082969,0.00026032623,0.9873667,0.004219686,0.00018674304],"about_ca_topic_score_codex":0.000016081132,"about_ca_topic_score_gemma":0.000006857819,"teacher_disagreement_score":0.034475934,"about_ca_system_score_codex":0.00008517884,"about_ca_system_score_gemma":0.000041699663,"threshold_uncertainty_score":0.58866},"labels":[],"label_agreement":null},{"id":"W97074593","doi":"","title":"C-Perfect K-Uniform Hypergraphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Chromatic scale; Clique; Integer (computer science); Clique number; Discrete mathematics; Computer science","score_opus":0.009822721899947998,"score_gpt":0.2507579705319085,"score_spread":0.24093524863196053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97074593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91277254,0.0004644631,0.019785969,0.0007999136,0.0024925373,0.00041027938,0.0000029164853,0.00089433766,0.06237705],"genre_scores_gemma":[0.9937536,0.000008615217,0.005377114,0.000085766114,0.000011395511,0.00002498234,0.0000031394634,0.000017715367,0.0007176349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833316,0.00008825681,0.00020477033,0.00041838197,0.0004328189,0.00052264536],"domain_scores_gemma":[0.99865913,0.00016038759,0.000056298395,0.00090136146,0.00011411375,0.00010868844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040036655,0.00016927614,0.00017359176,0.00021618382,0.00022045698,0.00013050393,0.0012899823,0.000069139875,0.000021699008],"category_scores_gemma":[0.0000407899,0.00016021436,0.000103658334,0.0010412643,0.00011179404,0.00061779027,0.00031010163,0.00022750683,0.00024390582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004877612,0.00008373239,0.0022218302,0.0000046892806,0.0000070305027,0.000026700833,0.000023829341,0.00002889216,0.0012014746,0.9924042,0.0016422276,0.0023504982],"study_design_scores_gemma":[0.0005113962,0.000100974125,0.0031735932,0.0000071235427,0.0000021166857,0.000017051103,0.0000048055986,0.0014112849,0.0057949554,0.982497,0.006273402,0.00020634751],"about_ca_topic_score_codex":0.00006626659,"about_ca_topic_score_gemma":0.000007430296,"teacher_disagreement_score":0.080981106,"about_ca_system_score_codex":0.000057258236,"about_ca_system_score_gemma":0.00005106062,"threshold_uncertainty_score":0.6533352},"labels":[],"label_agreement":null},{"id":"W97347673","doi":"","title":"Covering the Powers of the Complete Graph with a Bounded Number of Snakes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bounded function; Graph; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.012341338833975098,"score_gpt":0.2553891607128465,"score_spread":0.24304782187887142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97347673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9885701,0.000057620804,0.00090648484,0.0004103296,0.00028965782,0.00029300715,0.0000046758764,0.000036870773,0.0094312485],"genre_scores_gemma":[0.998713,0.0000124859525,0.0009257821,0.000079486905,0.0000017774855,0.000010838533,3.6721988e-7,0.000011530622,0.00024469075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998515,0.00017752961,0.00021776147,0.00023365897,0.00056640344,0.00028966318],"domain_scores_gemma":[0.9982986,0.0002582744,0.00012417702,0.0011453872,0.00012323867,0.000050337796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003827385,0.00012664312,0.00019401345,0.000038762504,0.00018722693,0.000040088722,0.0017777188,0.000032961903,0.000073652955],"category_scores_gemma":[0.000028482618,0.00007079882,0.00010076494,0.0010894855,0.00058294315,0.00022628538,0.00021599984,0.00021428739,0.000014446548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046470075,0.000062702886,0.0057067242,0.000012119638,0.000043203006,0.0000027844983,0.00065785577,0.00012725517,0.00053260225,0.9915472,0.00011390318,0.0011471403],"study_design_scores_gemma":[0.0009060538,0.00011552987,0.009641142,0.000054912187,0.00000852148,0.000025656625,0.000065880355,0.0005660065,0.003981851,0.9824706,0.002024641,0.00013922904],"about_ca_topic_score_codex":0.000056517667,"about_ca_topic_score_gemma":0.000008346659,"teacher_disagreement_score":0.010142935,"about_ca_system_score_codex":0.000024256444,"about_ca_system_score_gemma":0.000076626246,"threshold_uncertainty_score":0.33034736},"labels":[],"label_agreement":null},{"id":"W97986267","doi":"","title":"Splitters and barriers in open graphs having a perfect internal matching","year":2008,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Strong perfect graph theorem; Matching (statistics); Combinatorics; Perfect graph; Mathematics; Context (archaeology); Chordal graph; Discrete mathematics; Computer science; Graph; Pathwidth; Line graph; 1-planar graph; Statistics","score_opus":0.019033051428707426,"score_gpt":0.2841289702447476,"score_spread":0.26509591881604017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W97986267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98496175,0.000098056655,0.008420134,0.00076042773,0.00007636132,0.0002759339,9.930086e-7,0.000050063984,0.0053562797],"genre_scores_gemma":[0.98529047,0.00007518221,0.0140101025,0.00030247399,0.000010969378,0.000024171411,4.582402e-7,0.000014969226,0.0002712278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983884,0.00017094657,0.00020318328,0.00052235456,0.00026118182,0.00045395168],"domain_scores_gemma":[0.9989366,0.0002443763,0.000046037527,0.00050823664,0.00002548942,0.00023926249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052421546,0.00015162778,0.00019545054,0.00023397959,0.0001799116,0.00023844227,0.0017373351,0.000045594832,0.000042471107],"category_scores_gemma":[0.00012700401,0.00014582697,0.000040362604,0.00041344017,0.0002373323,0.0008456219,0.00154657,0.00033651522,0.000013118775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003280782,0.00020382767,0.34496546,0.00007100437,0.00012409117,0.0019275743,0.04396439,0.0001504547,0.036798757,0.5062793,0.0014352509,0.06375182],"study_design_scores_gemma":[0.0048095253,0.000726781,0.43636113,0.00053019315,0.000015643998,0.0018405824,0.0013778852,0.01877086,0.0059200977,0.5224966,0.005323885,0.0018268224],"about_ca_topic_score_codex":0.00034958657,"about_ca_topic_score_gemma":0.000059698672,"teacher_disagreement_score":0.09139567,"about_ca_system_score_codex":0.00004511463,"about_ca_system_score_gemma":0.00006402342,"threshold_uncertainty_score":0.5946651},"labels":[],"label_agreement":null},{"id":"W98170933","doi":"","title":"The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Claw; Vertex (graph theory); Combinatorics; Degree (music); Graph; Planar graph; Biology; Physics","score_opus":0.03536603412151292,"score_gpt":0.25515231468816724,"score_spread":0.2197862805666543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98170933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97507554,0.0005360792,0.018117428,0.0005551374,0.0009925556,0.00042508214,0.0000029689274,0.0002037451,0.0040914332],"genre_scores_gemma":[0.9872989,0.00015104168,0.012208136,0.000055340108,0.000004245657,0.000024521338,7.7653004e-7,0.000019261874,0.00023774985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981084,0.000178887,0.00025600003,0.00037875964,0.00059295347,0.0004850032],"domain_scores_gemma":[0.9969113,0.0006423891,0.00013387293,0.0018422079,0.0003263151,0.0001439216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005135732,0.00018109728,0.00023075889,0.00011111631,0.00047488578,0.000031658114,0.002841255,0.00006686606,0.0000026528517],"category_scores_gemma":[0.0002269824,0.00012100452,0.00009032413,0.0012125702,0.00057131355,0.0002614356,0.0005632446,0.0003492812,0.000016606757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059344,0.00010365988,0.004701307,0.0000070146143,0.00003389498,0.000041722098,0.00019209189,0.000015403488,0.00016697557,0.99174005,0.0004086782,0.0025298698],"study_design_scores_gemma":[0.001211092,0.00046298662,0.009943498,0.00001883799,0.0000053136437,0.00003840971,0.000018335437,0.001551392,0.004868456,0.98039025,0.0012945165,0.00019688765],"about_ca_topic_score_codex":0.00004130963,"about_ca_topic_score_gemma":0.000023608336,"teacher_disagreement_score":0.012223357,"about_ca_system_score_codex":0.000035628313,"about_ca_system_score_gemma":0.00014974695,"threshold_uncertainty_score":0.52798057},"labels":[],"label_agreement":null},{"id":"W98685556","doi":"","title":"Tree Domination in Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Forestry; Combinatorics; Geography","score_opus":0.013355501293034559,"score_gpt":0.2749717552010086,"score_spread":0.26161625390797405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98685556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764528,0.0001431694,0.014563438,0.0010999953,0.0009773824,0.00027684658,4.940152e-7,0.00017839088,0.006307472],"genre_scores_gemma":[0.9943496,0.00001532465,0.0054701404,0.000068068555,0.0000018269537,0.000027234193,0.0000010854155,0.000008389552,0.000058335867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998815,0.00007450779,0.00016951065,0.00031335096,0.00031059768,0.00031705466],"domain_scores_gemma":[0.9992292,0.000090460104,0.000041930765,0.00049470435,0.00006554967,0.00007814884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043537674,0.000102381346,0.00012166516,0.00032655528,0.0000699955,0.000059683953,0.00083267206,0.000053318858,0.0000052323717],"category_scores_gemma":[0.00009148391,0.00010481083,0.000045706773,0.0012364545,0.000064960455,0.0006411458,0.00017735221,0.00018980549,0.000073581425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006492501,0.00009756076,0.0009884192,0.000003141755,0.0000027042972,0.000031010615,0.00027320167,0.00008247141,0.00061263086,0.98745507,0.00003081299,0.010416504],"study_design_scores_gemma":[0.0014793929,0.00007855116,0.008941073,0.000014767294,6.1566817e-7,0.0000051604725,0.000019248815,0.00042469602,0.0047471914,0.98407143,0.000100117824,0.00011774885],"about_ca_topic_score_codex":0.000023615512,"about_ca_topic_score_gemma":0.000029445255,"teacher_disagreement_score":0.017896783,"about_ca_system_score_codex":0.0000979113,"about_ca_system_score_gemma":0.00006047951,"threshold_uncertainty_score":0.42740616},"labels":[],"label_agreement":null},{"id":"W98850468","doi":"","title":"On normal quotients of transitive graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Quotient; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.013214129911310128,"score_gpt":0.2670815271796967,"score_spread":0.2538673972683866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98850468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845237,0.00003637402,0.0065136445,0.00016408104,0.00078659283,0.00017700417,0.0000028274112,0.00008499868,0.0077107605],"genre_scores_gemma":[0.99901015,0.000016970003,0.00067604514,0.00008557274,0.0000016505599,0.000009667569,0.0000014043502,0.000009626706,0.00018891375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985926,0.00011800928,0.00018718897,0.00029975182,0.00046210154,0.0003403163],"domain_scores_gemma":[0.99892974,0.00020430234,0.00006419829,0.0005491855,0.0001406984,0.00011188513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027802074,0.00012347709,0.00016855526,0.0002203041,0.000085627566,0.000022196842,0.0008448193,0.000049758695,0.000021304886],"category_scores_gemma":[0.00005081509,0.00011952933,0.00009006641,0.0009014132,0.00011968258,0.00037552498,0.00010738398,0.00018442674,0.0000500507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058979465,0.00019876605,0.0018986637,0.000003977957,0.00001564403,0.00003062455,0.0003827963,0.000034293993,0.00056886196,0.9932719,0.00014699606,0.003388499],"study_design_scores_gemma":[0.0009046102,0.00046711182,0.0053442866,0.000021431442,0.0000022707702,0.0000075746384,0.00001948103,0.00053641445,0.007603277,0.98475087,0.0002120728,0.00013061431],"about_ca_topic_score_codex":0.000011165692,"about_ca_topic_score_gemma":0.0000017400024,"teacher_disagreement_score":0.014486432,"about_ca_system_score_codex":0.000026981481,"about_ca_system_score_gemma":0.000032452816,"threshold_uncertainty_score":0.48742646},"labels":[],"label_agreement":null},{"id":"W99291367","doi":"","title":"The Fractional Vertex Linear Arboricity of Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Graph; Planar graph","score_opus":0.010957304689175594,"score_gpt":0.2678376617227024,"score_spread":0.2568803570335268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99291367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9384864,0.0010058312,0.03962905,0.001616399,0.004906935,0.00046465037,0.00000697299,0.0003015053,0.013582286],"genre_scores_gemma":[0.9981104,0.000023768647,0.0015734177,0.00002761971,0.0000072203156,0.0000123977725,0.0000013573072,0.0000076154465,0.00023618525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865806,0.0001110163,0.00021748555,0.00023106331,0.0004982636,0.00028412096],"domain_scores_gemma":[0.9983978,0.0006247562,0.00010051311,0.0006177043,0.00020802698,0.000051146177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004832065,0.00009840834,0.00011902498,0.000082834646,0.0002808665,0.000041777155,0.0010163339,0.000046643403,0.0000061569767],"category_scores_gemma":[0.00010151558,0.00007466533,0.000084247586,0.0007499089,0.00018844564,0.00028546018,0.00019978858,0.00021936034,0.000029661649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011062749,0.0000819643,0.002258196,0.0000025784739,0.000009752767,0.0000032094804,0.000013647999,0.000060140042,0.00054401974,0.9948528,0.0010446529,0.0011180049],"study_design_scores_gemma":[0.0002950767,0.000057546895,0.011847262,0.000004296603,0.0000017767679,0.00000300003,0.0000051350135,0.003515557,0.0043215025,0.9761372,0.0037298293,0.00008180362],"about_ca_topic_score_codex":0.000055956632,"about_ca_topic_score_gemma":0.0000056413505,"teacher_disagreement_score":0.059624046,"about_ca_system_score_codex":0.00003267946,"about_ca_system_score_gemma":0.00006381998,"threshold_uncertainty_score":0.30447638},"labels":[],"label_agreement":null},{"id":"W9954860","doi":"10.1103/physrevc.38.712","title":"Competition Graphs of Semiorders and the Conditions C(p) and C ∗ (p)","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Competition (biology); Combinatorics; Biology","score_opus":0.013193792900904899,"score_gpt":0.25350586300433825,"score_spread":0.24031207010343336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9954860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98652864,0.0015209299,0.0028754491,0.002884061,0.0003774908,0.00039481279,0.0000062909585,0.00008773717,0.005324576],"genre_scores_gemma":[0.99902034,0.00027742266,0.0005414353,0.00008339937,0.0000011474827,0.0000147559895,8.121431e-7,0.0000042225906,0.000056472138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925554,0.000142846,0.00012318032,0.00017226368,0.00016487608,0.00014129536],"domain_scores_gemma":[0.99907106,0.00044696254,0.000054293414,0.0003068557,0.00006711609,0.0000537146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029975717,0.000071303744,0.0001247208,0.000084960724,0.00017551068,0.000038665443,0.0002778166,0.000027406106,0.000016561631],"category_scores_gemma":[0.00006357306,0.000054148408,0.000028077637,0.00034161503,0.00067152234,0.00024046037,0.00014856775,0.00011186691,0.0000045920897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046718083,0.00002571292,0.0006557553,0.0000075598514,0.000010347378,0.0000013442824,0.00038999692,0.000002078288,0.00016969658,0.99770904,0.00020452184,0.000819287],"study_design_scores_gemma":[0.0012844404,0.000053058946,0.0017771211,0.000011867816,0.0000041815947,0.000010941238,0.00006092104,0.004624972,0.00026602144,0.9916691,0.0001748895,0.000062441984],"about_ca_topic_score_codex":0.000009528161,"about_ca_topic_score_gemma":0.0000016363059,"teacher_disagreement_score":0.01249168,"about_ca_system_score_codex":0.0000057861935,"about_ca_system_score_gemma":0.0000045781594,"threshold_uncertainty_score":0.24742521},"labels":[],"label_agreement":null}]}