{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":139,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":139,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"4056339ef553","filters":{"venue":"Graphs and Combinatorics"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01179459362828049,"gpt":0.2431671078246347,"spread":0.2313725141963542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004862702,0.0002132175,0.0003260564,0.0002965087,0.0002255705,0.00007304696,0.0007776399,0.0001048567,0.00004984622],"category_scores_gemma":[0.00005527084,0.0002032814,0.0001258107,0.001950899,0.0002733193,0.0004756411,0.0001774037,0.0002780205,0.000008303357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001695968,"about_ca_system_score_gemma":0.00002935299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003753456,"about_ca_topic_score_gemma":0.000006464685,"domain_scores_codex":[0.9981832,0.0001770197,0.0002765385,0.0005171854,0.0003976455,0.0004483976],"domain_scores_gemma":[0.9985589,0.0003061443,0.00008653245,0.0007001283,0.0001478532,0.0002004647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003154334,0.0002037188,0.00639351,0.00002387066,0.00002684326,0.00001155052,0.0001838152,0.000002874465,0.000585812,0.9556747,0.00007906364,0.03678267],"study_design_scores_gemma":[0.0009437117,0.0003864594,0.02111081,0.00001601006,0.000007280982,0.00002005158,0.00002579304,0.0008876423,0.001476132,0.9739019,0.0009732808,0.0002508894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9865296,0.000856429,0.008719432,0.0001002574,0.0002385521,0.0002372604,0.000007171887,0.0001967269,0.003114567],"genre_scores_gemma":[0.9981459,0.0004722262,0.001150612,0.00005539512,0.000005460825,0.00002200554,0.000002819458,0.00001456657,0.0001310296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03653178,"threshold_uncertainty_score":0.8289573,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01427854745823877,"gpt":0.2798043015966379,"spread":0.2655257541383991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009616598,0.0001295891,0.0001394691,0.0004028854,0.0001679351,0.00007838001,0.0003975656,0.00006551461,9.444468e-7],"category_scores_gemma":[0.00001886949,0.0001164464,0.00002690645,0.001401674,0.000249741,0.0002982482,0.0002283724,0.0001963238,0.000001371856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001800199,"about_ca_system_score_gemma":0.00001823135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002296686,"about_ca_topic_score_gemma":0.000004148868,"domain_scores_codex":[0.9987867,0.00006480947,0.0001849068,0.0003736958,0.0002156227,0.0003742397],"domain_scores_gemma":[0.9991095,0.0002245288,0.00005051869,0.0003776954,0.00007424234,0.0001635131],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009271389,0.0001017315,0.02368769,0.00001463656,0.00000521181,0.000008131158,0.0001697657,2.344155e-7,0.00001933411,0.9084095,0.00001123005,0.06756331],"study_design_scores_gemma":[0.0003628829,0.00007202048,0.02979519,0.000007721698,0.000002341719,0.000007333188,0.0001021455,0.00003930182,0.0002570102,0.9666901,0.00252427,0.0001396559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7903586,0.04986798,0.1539843,0.000745494,0.0005105095,0.001820875,0.0000067736,0.0004034277,0.002301976],"genre_scores_gemma":[0.9952064,0.002707684,0.001786643,0.000089742,0.00001268223,0.00008736887,0.000002179857,0.00001192253,0.00009537123],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2048478,"threshold_uncertainty_score":0.4748547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973079746","doi":"10.1007/s00373-013-1302-3","title":"The k-Dominating Graph","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Graph power; Bound graph; Neighbourhood (mathematics); Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.005714229060984769,"gpt":0.1844622382965228,"spread":0.178748009235538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002700441,0.0000809526,0.00008213846,0.00004406109,0.0005342533,0.0005017624,0.0003612413,0.0000371287,0.000002774411],"category_scores_gemma":[0.00001611398,0.00005120713,0.0000485275,0.0003566566,0.00003964901,0.0002376057,0.0001081053,0.0001023502,0.00001489985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007103798,"about_ca_system_score_gemma":0.000006812054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006809621,"about_ca_topic_score_gemma":0.000004117266,"domain_scores_codex":[0.9992985,0.00004720495,0.0001551335,0.0001633038,0.0001331685,0.0002026609],"domain_scores_gemma":[0.9993553,0.0001473888,0.00006024477,0.0002674084,0.0001072224,0.00006245348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[2.323172e-7,0.000007767987,0.0008243992,0.000002449624,0.000006243718,6.8963e-7,0.000119315,0.000001235767,0.00001176405,0.9762963,0.00442654,0.01830307],"study_design_scores_gemma":[0.0002235891,0.00007693845,0.004053487,0.00001209364,0.000002133368,0.0000230016,0.0002018531,0.02576909,0.00004798498,0.9574822,0.01196488,0.0001427131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6990764,0.007490034,0.2144337,0.006915901,0.01390476,0.001211693,8.841312e-7,0.0007849155,0.05618169],"genre_scores_gemma":[0.9989391,0.0001351017,0.0001566227,0.0001310878,0.00001668234,0.00003891603,1.364841e-7,0.000004059195,0.0005782701],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2998627,"threshold_uncertainty_score":0.4838506,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01287741953851697,"gpt":0.240615135846158,"spread":0.227737716307641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003281962,0.0000747049,0.00009802051,0.0001181404,0.0001208389,0.00006577277,0.0004748058,0.00003313303,0.00001283506],"category_scores_gemma":[0.00008425125,0.00004862653,0.00003772866,0.0005266918,0.00009405325,0.0002113694,0.0001315326,0.0001009777,0.00001273269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000868621,"about_ca_system_score_gemma":0.00001260607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001529754,"about_ca_topic_score_gemma":4.258933e-7,"domain_scores_codex":[0.9992442,0.00008247609,0.0001245256,0.000159949,0.0002320363,0.0001567989],"domain_scores_gemma":[0.9989613,0.0004245967,0.00006509856,0.000380409,0.0001172361,0.00005137028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002211987,0.0000355394,0.0003231961,0.00000411453,0.000004982339,3.911069e-7,0.00006518621,0.000001865985,0.0007530031,0.9903109,0.0005758521,0.007922725],"study_design_scores_gemma":[0.0001835558,0.000122388,0.008955276,0.000007024771,0.000001155285,0.000001273499,0.0000269481,0.0009533537,0.003219401,0.9863495,0.0001209432,0.00005921386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9821298,0.0002564723,0.01194057,0.001459895,0.0002586347,0.0003414188,0.000001047713,0.00004572612,0.003566458],"genre_scores_gemma":[0.9994339,0.0000483879,0.0002352152,0.0001014849,0.00000292254,0.00002970223,2.502859e-7,0.000004122446,0.0001440383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0173041,"threshold_uncertainty_score":0.1982933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235786133","doi":"10.1007/s003730200003","title":"Shattering News","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Mathematical proof; Lemma (botany); Combinatorics; Algebraic number; Order (exchange); Interpretation (philosophy); Discrete mathematics; Combinatorial proof; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.018612892200937,"gpt":0.1983611266122935,"spread":0.1797482344113566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004874709,0.00005990925,0.00005720449,0.00008514346,0.0001143132,0.0001158872,0.0001475238,0.00002272943,0.00001240384],"category_scores_gemma":[0.000005989522,0.00005885453,0.00002258014,0.0004115638,0.000009896603,0.0002185521,0.00007449331,0.00004668707,0.00001515249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005728802,"about_ca_system_score_gemma":0.000002950046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003686178,"about_ca_topic_score_gemma":5.616875e-7,"domain_scores_codex":[0.9995294,0.00001241964,0.00008219292,0.00015985,0.0001125611,0.0001035655],"domain_scores_gemma":[0.9997313,0.00002298862,0.00002360672,0.0001350087,0.00003066232,0.00005646106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[2.456642e-7,0.00003381943,0.001022429,0.000004709882,0.000003898671,0.000003988952,0.0001701105,0.00003771544,0.00007136146,0.9262872,0.002130702,0.07023387],"study_design_scores_gemma":[0.0006514924,0.0001688595,0.00963151,0.00001156317,0.000006402652,0.00005468293,0.00002753434,0.2026504,0.0004793868,0.7366452,0.04930889,0.0003641558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5165942,0.003736928,0.4593231,0.003075988,0.001963725,0.0001756421,0.000001298444,0.0003779012,0.01475116],"genre_scores_gemma":[0.9970476,0.0001986081,0.002037333,0.0003303686,0.0000142225,0.000004090722,8.059981e-7,0.000002548855,0.0003644],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4804534,"threshold_uncertainty_score":0.2400018,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021848912","doi":"10.1007/s003730070001","title":"The Permutations 123 p 4 … p m and 321 p 4 … p m are Wilf-Equivalent","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Bijection; Combinatorics; Mathematics; Permutation (music); Permutation matrix; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02374271035223836,"gpt":0.2796627942941911,"spread":0.2559200839419527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002784716,0.0002337435,0.000275242,0.0000531467,0.000817052,0.0001428851,0.0002054116,0.00009654103,0.00002451756],"category_scores_gemma":[0.0002193367,0.0001736039,0.00006926957,0.0003224055,0.0002047054,0.0001343343,0.00007928936,0.0002258508,0.00001316479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003068382,"about_ca_system_score_gemma":0.00002014634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000382466,"about_ca_topic_score_gemma":0.000005632266,"domain_scores_codex":[0.9986745,0.00006306474,0.0003423783,0.0002689837,0.0003127584,0.0003383702],"domain_scores_gemma":[0.9983792,0.0007844216,0.0001465629,0.0004367272,0.0001039135,0.0001491866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001021741,0.000115333,0.000562056,0.00006583996,0.00003137354,0.000006727087,0.0004656873,9.392916e-7,0.000006988207,0.9930654,0.001125833,0.004543563],"study_design_scores_gemma":[0.0006173674,0.00009036758,0.0008765684,0.00004588613,0.00005831628,0.00002988821,0.0005756216,0.0001842356,0.00003499016,0.9866575,0.01060748,0.0002217834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9894265,0.002291858,0.000393832,0.0008547226,0.0005837622,0.0005042061,0.00001212134,0.0002236611,0.005709343],"genre_scores_gemma":[0.9945118,0.002451608,0.0007021438,0.00006043107,0.00002910366,0.00006385957,0.000001720833,0.00004372851,0.002135601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009481642,"threshold_uncertainty_score":0.707936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078609456","doi":"10.1007/s00373-007-0731-2","title":"Extremal Ternary Self-Dual Codes Constructed from Negacirculant Matrices","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"University of Lethbridge","keywords":"Ternary operation; Dual (grammatical number); Mathematics; Combinatorics; Construct (python library); Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007092453339405788,"gpt":0.2037224111656626,"spread":0.1966299578262568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003500388,0.0001890606,0.0002034868,0.0002305069,0.0002511205,0.000207055,0.0004416392,0.00009761895,0.000009699927],"category_scores_gemma":[0.000008447461,0.0001746886,0.00009374042,0.00081652,0.00009578365,0.0002828446,0.0002057749,0.000169265,0.000005096534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001289201,"about_ca_system_score_gemma":0.00002588844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007528259,"about_ca_topic_score_gemma":0.000005175903,"domain_scores_codex":[0.9987085,0.00005353884,0.0002422868,0.0003937351,0.0002645972,0.000337282],"domain_scores_gemma":[0.999046,0.0002354462,0.0001032197,0.0003790718,0.00006526499,0.000170992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001506272,0.0001135823,0.1047946,0.00001112721,0.00005519461,0.0001226882,0.0004496278,2.926004e-7,0.0003277217,0.8854411,0.0001594335,0.008509639],"study_design_scores_gemma":[0.0008480498,0.0001615194,0.09083974,0.0000277909,0.00003920705,0.0001124251,0.0002536809,0.001107136,0.0007714849,0.9035206,0.001908958,0.0004093695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9619131,0.001601783,0.03340509,0.00005338599,0.0007787597,0.00009275357,0.000009676378,0.0004782794,0.001667178],"genre_scores_gemma":[0.9946791,0.0001545714,0.005012449,0.0001000984,0.0000280069,0.000002924409,0.00000483174,0.000008387418,0.000009609741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03276603,"threshold_uncertainty_score":0.7123595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984293343","doi":"10.1007/s00373-012-1172-0","title":"Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cayley graph; Vertex connectivity; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.009608412346894054,"gpt":0.2061704933930898,"spread":0.1965620810461957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003055422,0.0001516802,0.0002370301,0.0001257633,0.0001583328,0.00005531882,0.0002196521,0.0001097781,0.000004136116],"category_scores_gemma":[0.000006189017,0.0001373404,0.00009904664,0.0006353954,0.00004357628,0.0004417639,0.00003115868,0.0001156073,0.000001850764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001788393,"about_ca_system_score_gemma":0.00001028497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001738085,"about_ca_topic_score_gemma":0.00001703838,"domain_scores_codex":[0.9989239,0.0001179209,0.0002519536,0.0002304554,0.0001888864,0.0002869141],"domain_scores_gemma":[0.9993346,0.0000677,0.0001070252,0.0002676961,0.00009131084,0.0001317049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009457255,0.0002735386,0.0304224,0.00002477976,0.00004719587,0.000001218734,0.0008287895,0.000009388226,0.00593174,0.956695,0.002112191,0.003644315],"study_design_scores_gemma":[0.00638134,0.002244765,0.2238146,0.0002732197,0.0001985608,0.000228574,0.0006178654,0.04785588,0.09545004,0.6095253,0.01086098,0.002548875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.972546,0.002307115,0.02268266,0.00008300146,0.001517328,0.0001238235,0.000008869414,0.00009331625,0.0006378701],"genre_scores_gemma":[0.9995534,0.0001958061,0.00007279737,0.00007599027,0.00001273701,0.00001509611,0.000007071837,0.000008475668,0.00005862281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3471697,"threshold_uncertainty_score":0.5600578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985239078","doi":"10.1007/s003730200035","title":"A Note on Cycle Lengths in Graphs","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Graph; Interval (graph theory); Degree (music); Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02316026611590884,"gpt":0.2606883193951853,"spread":0.2375280532792764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002234457,0.0002091416,0.0002677931,0.0002801743,0.0002169352,0.00003374669,0.0001883591,0.0001448122,0.00005809397],"category_scores_gemma":[0.0001077987,0.0001753389,0.0001022253,0.0005176024,0.000100598,0.00007177622,0.00007544108,0.0003139748,0.000005490424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001927962,"about_ca_system_score_gemma":0.000003451158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001098283,"about_ca_topic_score_gemma":0.000007656007,"domain_scores_codex":[0.9988346,0.00006540001,0.0002607329,0.0002853785,0.0002388637,0.0003150197],"domain_scores_gemma":[0.9991097,0.000318605,0.00007431495,0.0003680461,0.00003127959,0.00009800669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000117316,0.0001883002,0.002967457,0.00003512991,0.00001265165,0.00002097363,0.001050946,9.785298e-7,0.000007211685,0.9904837,0.001008557,0.004212365],"study_design_scores_gemma":[0.0008444029,0.000150695,0.002921477,0.00003514942,0.00001474874,0.000009460067,0.00007713834,0.0003232133,0.00006352371,0.9939296,0.001402262,0.0002283422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.974553,0.0005955264,0.0000163656,0.0001395444,0.0005073694,0.0001780993,0.000005836207,0.00009200715,0.02391225],"genre_scores_gemma":[0.9987168,0.0005907684,0.0001854055,0.0002112098,0.00001098488,0.00001477322,7.803606e-7,0.00002571266,0.0002435942],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02416377,"threshold_uncertainty_score":0.7150112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105006345","doi":"10.1007/s00373-010-0946-5","title":"Zero-Sum Flows in Regular Graphs","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Zero (linguistics); Vertex (graph theory); Graph; Conjecture; Discrete mathematics; Flow (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.007206904687643349,"gpt":0.2022280136572562,"spread":0.1950211089696128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004735751,0.0001816888,0.0002070633,0.0003654573,0.0001677932,0.0001502784,0.0005252497,0.0001472719,0.000003505569],"category_scores_gemma":[0.00002849045,0.0001655622,0.00007561514,0.001258911,0.00008130114,0.0002555483,0.0001944028,0.000404853,0.000008903729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005285461,"about_ca_system_score_gemma":0.00003096775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007385905,"about_ca_topic_score_gemma":0.00003309915,"domain_scores_codex":[0.9986033,0.00003950566,0.0002654525,0.0004588724,0.0002699887,0.0003628732],"domain_scores_gemma":[0.9989656,0.00005075166,0.00006707023,0.0006500028,0.00008893306,0.000177621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001829144,0.00009853473,0.009370791,0.000009589847,0.000005360552,0.00001704104,0.0001388752,0.000003433837,0.002429704,0.9841363,0.000571194,0.003217345],"study_design_scores_gemma":[0.0006412969,0.00007479697,0.004249026,0.00001435524,0.000004256445,0.00001792916,0.00001092133,0.00347035,0.0006588045,0.9884615,0.002168404,0.0002283426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9946884,0.0006875458,0.0009805362,0.0005067101,0.001679912,0.0001351059,0.000001066171,0.0002085788,0.001112171],"genre_scores_gemma":[0.9959549,0.0001472649,0.003549092,0.0002159617,0.000001811622,0.00001509959,0.000001709154,0.00001086561,0.0001033096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005121765,"threshold_uncertainty_score":0.675143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1654746924","doi":"10.1007/s003730200005","title":"Enumerating Foldings and Unfoldings Between Polygons and Polytopes","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Polygon (computer graphics); Mathematics; Enumeration; Polytope model; Rectilinear polygon; Discrete mathematics; Regular polygon; Computer science; Geometry; Simple polygon","retraction":null,"screen_n_in":null,"score":{"opus":0.01573033716346769,"gpt":0.19786159864013,"spread":0.1821312614766623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001433129,0.0001137583,0.0001304767,0.0001429295,0.0003363978,0.0002807178,0.0001088542,0.00004919038,0.000003096883],"category_scores_gemma":[0.00002232206,0.0001125023,0.00001984869,0.0004266609,0.00004074695,0.0003646429,0.0001474654,0.00008692371,0.000001080466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006296216,"about_ca_system_score_gemma":0.000005528509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001578618,"about_ca_topic_score_gemma":6.763854e-7,"domain_scores_codex":[0.9992547,0.00002217504,0.0001417967,0.0002759919,0.0001413322,0.0001639846],"domain_scores_gemma":[0.999568,0.0001094753,0.00005370209,0.0001061286,0.000042519,0.0001201002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[6.441823e-7,0.00002347667,0.0224482,0.00001847515,0.00001802984,0.000003363724,0.0008304312,0.000002761167,0.0003276451,0.8660505,0.0004497612,0.1098267],"study_design_scores_gemma":[0.00199284,0.0006451163,0.1329241,0.00007740567,0.00007314981,0.0001626609,0.0002051453,0.09425639,0.002726107,0.7536399,0.01221009,0.00108706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9782107,0.004851442,0.01521202,0.0009672121,0.000159604,0.00008077145,0.000002039297,0.0000778064,0.0004383733],"genre_scores_gemma":[0.9966072,0.0005647948,0.002533269,0.0001379159,0.00002330086,0.000003839795,0.000001531103,0.000004843135,0.0001233252],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1124106,"threshold_uncertainty_score":0.4587712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967648182","doi":"10.1007/s00373-007-0714-3","title":"Efficient Many-To-Many Point Matching in One Dimension","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; Queen's University; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Matching (statistics); Dimension (graph theory); Point (geometry); Context (archaeology); 3-dimensional matching; Line (geometry); Discrete mathematics; Bipartite graph; Computer science; Graph; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01663249054649343,"gpt":0.2347373155353467,"spread":0.2181048249888533,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009005281,0.0001740363,0.0002186336,0.0004936852,0.0002117275,0.0001188394,0.0004670429,0.00007085166,0.000002974025],"category_scores_gemma":[0.00001597305,0.0001766015,0.00006479136,0.001428575,0.00004356951,0.00009596942,0.000487272,0.0002500855,0.00001112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004676689,"about_ca_system_score_gemma":0.00001523534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001000796,"about_ca_topic_score_gemma":0.00001677051,"domain_scores_codex":[0.9983622,0.00003458336,0.0003113137,0.0004512904,0.0003725619,0.0004680635],"domain_scores_gemma":[0.9991237,0.0001184733,0.00006095965,0.0004315427,0.0000581801,0.0002071344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007791783,0.0002628212,0.001232182,0.000014918,0.000005907622,0.00004761445,0.001324395,0.0001214445,0.0002491011,0.9842613,0.00003803158,0.01243445],"study_design_scores_gemma":[0.0008905648,0.0002535107,0.07293924,0.0001123383,0.000006193881,0.00002801367,0.000243691,0.02955634,0.0007311985,0.8942729,0.0005022944,0.0004637377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7661599,0.0002887864,0.2313243,0.0003995316,0.0006557421,0.0001793431,8.584591e-7,0.000118788,0.0008727323],"genre_scores_gemma":[0.9881368,0.00003037728,0.01140742,0.0003698159,0.00001118308,0.000005507332,7.965888e-7,0.000009365631,0.00002869519],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.221977,"threshold_uncertainty_score":0.72016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069852972","doi":"10.1007/s003730200028","title":"The Crossing Number of P(N, 3)","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Crossing number (knot theory); Combinatorics; Mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01433431762498918,"gpt":0.2327663448668164,"spread":0.2184320272418272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001151048,0.00004131773,0.0000464543,0.0000229146,0.0003429088,0.0001641527,0.0001553153,0.00001772325,0.000003435863],"category_scores_gemma":[0.00001413667,0.00003012759,0.00002366221,0.0003901916,0.00005395621,0.0001140427,0.0000542443,0.00003872077,0.000003762175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003473259,"about_ca_system_score_gemma":0.000007032415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002772232,"about_ca_topic_score_gemma":3.878803e-7,"domain_scores_codex":[0.9995891,0.00001716202,0.00009847883,0.0000900352,0.000124859,0.00008033189],"domain_scores_gemma":[0.9996462,0.00008307958,0.00004294014,0.0001320708,0.0000684346,0.00002730454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[3.610106e-7,0.00001992504,0.001712441,0.00000257995,0.000003450797,4.927011e-7,0.0001472817,0.0000105487,0.00002177538,0.9621425,0.0006649233,0.03527366],"study_design_scores_gemma":[0.0002891368,0.00004293882,0.008264244,0.00000622499,0.000003711475,0.00002337322,0.00001837751,0.06327397,0.0005523289,0.897339,0.03008056,0.0001060912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8983772,0.003521547,0.08670584,0.0009422281,0.001185954,0.0001028204,9.280164e-7,0.00007773464,0.009085733],"genre_scores_gemma":[0.9985204,0.0001163377,0.0009668251,0.00005670111,0.000006362828,0.000001926555,1.947347e-7,0.000001520429,0.0003297486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1001432,"threshold_uncertainty_score":0.2637412,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Outerplanar graph; Graph; Discrete mathematics; Pathwidth; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01154669324927916,"gpt":0.2358485660586683,"spread":0.2243018728093891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002523326,0.0001271567,0.0001885958,0.0002237447,0.0001606989,0.00008149961,0.0003797217,0.00005495174,8.819798e-7],"category_scores_gemma":[0.00001672615,0.0001157338,0.00003656758,0.0007353153,0.0002194728,0.0003314529,0.0001588968,0.0001207705,6.635993e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007147052,"about_ca_system_score_gemma":0.00001862358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007052458,"about_ca_topic_score_gemma":0.00001100979,"domain_scores_codex":[0.9989122,0.00004687519,0.0001987016,0.0002969473,0.0002770088,0.0002683412],"domain_scores_gemma":[0.9993195,0.0001584266,0.00007718603,0.0002657355,0.00009122457,0.00008792399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001067108,0.00005131693,0.03259502,0.00003852516,0.00001115872,0.000009192142,0.00009001333,0.000008957373,0.0007439203,0.9639028,0.000054237,0.002484175],"study_design_scores_gemma":[0.0004541254,0.0002257335,0.02328931,0.00002005061,0.000006045152,0.000009166561,0.00006234079,0.001022888,0.001996259,0.972141,0.0006243709,0.0001486692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9817954,0.003499587,0.01310845,0.0001092642,0.0001499206,0.000137654,0.000003296637,0.00008075668,0.001115699],"genre_scores_gemma":[0.9976496,0.0004245634,0.001829444,0.00002039917,0.000003007556,0.000008572744,8.914794e-7,0.000006760846,0.00005683998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01585415,"threshold_uncertainty_score":0.4719489,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02099190701356197,"gpt":0.2671143189203534,"spread":0.2461224119067915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133403,0.0001018659,0.0001387181,0.0003210049,0.0001489733,0.00006768796,0.0003941972,0.000053919,0.000007890343],"category_scores_gemma":[0.00004541609,0.00009783419,0.00003778131,0.001547748,0.00005933204,0.00027003,0.0001018506,0.0001776754,0.00000826221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002077733,"about_ca_system_score_gemma":0.00002781259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001544482,"about_ca_topic_score_gemma":0.0000172102,"domain_scores_codex":[0.9989683,0.00007687974,0.0001629932,0.0002697643,0.0002285462,0.0002935189],"domain_scores_gemma":[0.9993058,0.0001858782,0.00003405748,0.0003128806,0.00004928032,0.0001120865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001101996,0.00008097708,0.02902748,0.000003033417,0.000004930666,0.00004412551,0.0001622529,0.00001055795,0.00003668059,0.965323,0.0001057791,0.005190196],"study_design_scores_gemma":[0.001007261,0.00007026238,0.03145913,0.000007101166,0.000001526929,0.00001787144,0.00003094654,0.002878502,0.00003053346,0.9612796,0.003086499,0.0001307968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9488717,0.001757386,0.04191697,0.001248562,0.0004485331,0.0003537167,0.000004398699,0.0001941711,0.005204526],"genre_scores_gemma":[0.9980438,0.0003913357,0.001106626,0.00007542402,0.000006707447,0.00002255945,0.000002698092,0.000006778077,0.0003441069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04917203,"threshold_uncertainty_score":0.3989562,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01688849784610518,"gpt":0.2761060912344208,"spread":0.2592175933883156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003108142,0.000104219,0.000119279,0.0001838449,0.000217043,0.0001527114,0.0003764796,0.00005119657,6.841536e-7],"category_scores_gemma":[0.00005506572,0.00009754814,0.00006777475,0.0005464349,0.00005393146,0.0003693594,0.00005053915,0.00009135258,0.000001717094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001982063,"about_ca_system_score_gemma":0.00001790961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001169935,"about_ca_topic_score_gemma":2.226327e-7,"domain_scores_codex":[0.9990907,0.00003120343,0.0001222374,0.0002831015,0.0001931128,0.000279634],"domain_scores_gemma":[0.999302,0.000141003,0.00004246126,0.0003052273,0.0001110918,0.00009827289],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009577645,0.00004720583,0.0003023828,0.000005009717,0.000004538803,0.000001357603,0.00009783567,0.000002627461,0.0001171841,0.9511779,0.0002439625,0.04799044],"study_design_scores_gemma":[0.000548752,0.0003736145,0.002711531,0.000004960371,0.000003189321,0.000005049702,0.00001819232,0.003979088,0.0007916376,0.9893035,0.002129956,0.0001305115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3206825,0.000946585,0.6728063,0.002179021,0.0006191878,0.0006175842,0.000004121816,0.0002562483,0.001888397],"genre_scores_gemma":[0.9860876,0.00009171995,0.01330193,0.0002715696,0.000004683302,0.00002710816,0.00000228175,0.00000555582,0.0002075081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6654052,"threshold_uncertainty_score":0.3977897,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0214241067806624,"gpt":0.2481203241596899,"spread":0.2266962173790275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003261789,0.0001101118,0.0001086753,0.0001242954,0.000331422,0.0001061773,0.0002413386,0.00004162731,0.000006149268],"category_scores_gemma":[0.00001572252,0.00009131969,0.00002803492,0.0007799004,0.0001035234,0.0008522482,0.0001251935,0.0001532117,0.00001143254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001970006,"about_ca_system_score_gemma":0.00002071385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004741816,"about_ca_topic_score_gemma":0.000003233157,"domain_scores_codex":[0.9989301,0.00005671553,0.0001148359,0.0002034776,0.0002462277,0.0004486275],"domain_scores_gemma":[0.9992671,0.00007421549,0.00005033561,0.0003046597,0.00009515343,0.0002085123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002932704,0.0001136558,0.02426392,0.0000140359,0.000009621242,0.000001997882,0.0003197326,0.00001098231,0.0001235496,0.9740009,0.0001513389,0.0009873655],"study_design_scores_gemma":[0.0004772874,0.0002858512,0.01292892,0.00002968601,0.000009293566,0.00003966162,0.00008067975,0.001137368,0.0006921797,0.9798524,0.004222712,0.0002439167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7064463,0.002403841,0.2819968,0.0007915616,0.0005707342,0.0005940239,0.000004975457,0.0005170755,0.006674643],"genre_scores_gemma":[0.9971389,0.000111857,0.002478829,0.00006069262,0.00001012929,0.00007326618,0.000002140739,0.000009072332,0.0001150675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2906926,"threshold_uncertainty_score":0.3723909,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Cape Breton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Domination analysis; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01448918112808184,"gpt":0.2705044243079864,"spread":0.2560152431799046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002382286,0.00008343907,0.0001351969,0.0002247667,0.0001164647,0.00007728662,0.0003994868,0.00004371992,0.00001406291],"category_scores_gemma":[0.00006900575,0.000077883,0.00004667171,0.0008013842,0.0001096741,0.0005618105,0.0001691191,0.00008819712,0.00001038849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001084424,"about_ca_system_score_gemma":0.00002161075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000061823,"about_ca_topic_score_gemma":0.000001392977,"domain_scores_codex":[0.999069,0.00007436468,0.0001996648,0.0002300992,0.0002372167,0.0001896156],"domain_scores_gemma":[0.9989973,0.0001819112,0.00009133694,0.0004186913,0.000219609,0.0000910964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001893381,0.00005136248,0.004953992,0.00001055494,0.000008444916,9.070946e-7,0.0001857488,0.000002565094,0.001849618,0.9841523,0.0004745754,0.008308006],"study_design_scores_gemma":[0.0003507458,0.00007444093,0.02824223,0.000005898769,0.000002926494,0.000003743791,0.00007931027,0.001300801,0.005251945,0.9644218,0.0001712417,0.00009492337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9284941,0.000726051,0.0640113,0.0009037212,0.0004798259,0.0005391805,0.000004505039,0.0001233319,0.004718],"genre_scores_gemma":[0.9970946,0.0001301245,0.002425485,0.00002931934,0.000004395409,0.00004069839,0.000001955436,0.000005625719,0.0002677703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06860054,"threshold_uncertainty_score":0.3175977,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Colored; Graph; Vertex (graph theory); Discrete mathematics; Clique number","retraction":null,"screen_n_in":null,"score":{"opus":0.03279238096370085,"gpt":0.3089552431641388,"spread":0.276162862200438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005212427,0.0001453224,0.000272542,0.000225514,0.00055438,0.0001787371,0.001323517,0.0000822057,7.453941e-7],"category_scores_gemma":[0.0001772002,0.0001311549,0.0001345343,0.0002634565,0.0003508758,0.00048565,0.000372303,0.0001132821,6.389528e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008855251,"about_ca_system_score_gemma":0.00003285951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002268926,"about_ca_topic_score_gemma":0.00001028818,"domain_scores_codex":[0.9988142,0.00005238617,0.00022211,0.000355101,0.0002335708,0.0003226504],"domain_scores_gemma":[0.9982051,0.0002053592,0.0002215267,0.0009658423,0.0002801402,0.000122041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002393227,0.00006806865,0.009380737,0.00004032904,0.00002697714,0.000003039867,0.0001049267,4.904089e-7,0.0003801217,0.980631,0.0002330604,0.009107327],"study_design_scores_gemma":[0.0006674276,0.0003876408,0.02321935,0.00001678473,0.000007807779,0.000002576955,0.00002905164,0.0007089782,0.005732173,0.9682958,0.0007808352,0.0001516281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9231476,0.001404147,0.07132746,0.0005786542,0.0008875545,0.0006905233,0.00003147488,0.0001811378,0.001751504],"genre_scores_gemma":[0.9941404,0.0003995085,0.005280912,0.00002726579,0.000005351107,0.00004861515,0.00000307008,0.0000105582,0.0000842786],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07099289,"threshold_uncertainty_score":0.534834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036908020","doi":"10.1007/s00373-010-0881-5","title":"Packing and Covering Triangles in Planar Graphs","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Planar; Outerplanar graph; Graph; Pathwidth; Computer science; Line graph; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.01077675851134907,"gpt":0.219536946964797,"spread":0.2087601884534479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001700431,0.00008218071,0.0001034665,0.0002220137,0.00009975937,0.0001216874,0.0001056221,0.00003736749,4.188052e-7],"category_scores_gemma":[0.0000141553,0.00008214567,0.00001994794,0.0006273817,0.00001342112,0.0002520077,0.00002818558,0.00007386369,4.009702e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008868063,"about_ca_system_score_gemma":0.00001329003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007311573,"about_ca_topic_score_gemma":0.000003765992,"domain_scores_codex":[0.9993942,0.00002396583,0.0001259965,0.0002032725,0.0001206309,0.0001319185],"domain_scores_gemma":[0.9997304,0.00005209318,0.00003581198,0.0001000589,0.0000246618,0.00005695948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003592218,0.00003506388,0.003944182,0.000005349841,0.00000279681,0.00001051162,0.0002295892,0.00006129921,0.0001273474,0.9516568,0.00006701767,0.04385646],"study_design_scores_gemma":[0.0006712221,0.0001474111,0.09964897,0.00001774993,0.000002723902,0.00001851076,0.00002527083,0.009776164,0.0001728551,0.8886704,0.0007007395,0.0001480038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9775869,0.001883613,0.01913283,0.0004632759,0.0002408349,0.00008985344,8.529112e-7,0.00005784526,0.00054398],"genre_scores_gemma":[0.9981948,0.0003297998,0.001246317,0.0001983569,0.000006602395,0.000002141214,0.000002220234,0.000001977136,0.00001782574],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09570479,"threshold_uncertainty_score":0.3349803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019462472","doi":"10.1007/s00373-008-0795-7","title":"Hadwiger Number and the Cartesian Product of Graphs","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Cartesian product; Mathematics; Graph; Discrete mathematics; Upper and lower bounds; Square (algebra); Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01905065826584977,"gpt":0.2450804996344979,"spread":0.2260298413686481,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003662813,0.0001675481,0.0003261614,0.0000641816,0.0004391161,0.00001497991,0.0001551398,0.00006619215,0.00001319576],"category_scores_gemma":[0.0001051535,0.0001006964,0.0001058158,0.0003056243,0.0008744808,0.00005943569,0.0001034359,0.0001718821,3.810044e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003531371,"about_ca_system_score_gemma":0.00001391819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002743767,"about_ca_topic_score_gemma":0.000001748995,"domain_scores_codex":[0.9990214,0.00009350642,0.0002575865,0.0002154034,0.0002210633,0.0001910711],"domain_scores_gemma":[0.9990479,0.0002839428,0.0001239069,0.0003852843,0.00009305892,0.00006589534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000371188,0.00004601552,0.03531754,0.0000589863,0.00005522325,0.000005008079,0.00211398,3.912361e-8,0.000009789696,0.9607267,0.001262749,0.0003668838],"study_design_scores_gemma":[0.001157284,0.00003593899,0.01298413,0.00001292033,0.00005598326,0.0001114496,0.0001547496,0.000008048757,0.000228774,0.9844703,0.0006462755,0.0001341125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9915272,0.001393468,0.00001488692,0.000166277,0.0003020489,0.0002493903,0.000004658377,0.0000362159,0.006305876],"genre_scores_gemma":[0.9982767,0.001069258,0.0002405899,0.00007473276,0.00001286816,0.00001329522,8.121092e-7,0.00001744061,0.000294334],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02374367,"threshold_uncertainty_score":0.4106279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W600271645","doi":"10.1007/s00373-015-1582-x","title":"A Cyclic Solution for an Infinite Class of Hamilton–Waterloo Problems","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Class (philosophy); Factorization; Integer (computer science); Combinatorics; Composition (language); Algorithm; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02871495167170536,"gpt":0.217056275594567,"spread":0.1883413239228616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002874043,0.0001198688,0.0001832546,0.000112896,0.00004752275,0.00002295276,0.00009249493,0.00009563648,4.603923e-7],"category_scores_gemma":[0.000006553062,0.0001127056,0.00005184654,0.0002244236,0.0000411485,0.0001378176,0.000010198,0.00006867525,0.000001078024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000127187,"about_ca_system_score_gemma":0.000007552122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002672458,"about_ca_topic_score_gemma":0.00001354183,"domain_scores_codex":[0.9993542,0.00002715829,0.0002106328,0.0001187141,0.0001027147,0.0001865152],"domain_scores_gemma":[0.9995674,0.00002162848,0.00004139723,0.0001709665,0.00007905963,0.0001195583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005790232,0.0002129522,0.008264726,0.0008365256,0.0001209111,0.000001485266,0.006626785,0.001200023,0.009389856,0.9677725,0.001613783,0.003902573],"study_design_scores_gemma":[0.002530772,0.001058607,0.001245487,0.00008776476,0.00006137291,0.0000151245,0.000677488,0.03296766,0.003181729,0.939886,0.01781827,0.0004697387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9952495,0.000873383,0.001557,0.000006455659,0.000642199,0.0002785277,0.00001446151,0.0001481833,0.001230343],"genre_scores_gemma":[0.9996976,0.00006588695,0.00006213949,0.000007861458,0.00001207175,0.00005721427,0.00001526518,0.00002021681,0.00006172874],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03176764,"threshold_uncertainty_score":0.4596001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150037097","doi":"10.1007/s00373-010-0957-2","title":"Every Large Point Set contains Many Collinear Points or an Empty Pentagon","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Pentagon; Conjecture; Integer (computer science); Set (abstract data type); Plane (geometry); Point (geometry)","retraction":null,"screen_n_in":null,"score":{"opus":0.01543672156284936,"gpt":0.2628801235376614,"spread":0.2474434019748121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004361593,0.000149416,0.0001540456,0.0001556925,0.0003106427,0.0002284448,0.0003403769,0.00008967864,0.00003971681],"category_scores_gemma":[0.00003639129,0.0001300446,0.00005034934,0.0005903863,0.00002907618,0.0005620972,0.0001576888,0.0002145451,0.000009880959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000014589,"about_ca_system_score_gemma":0.00008530721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000170705,"about_ca_topic_score_gemma":0.00004658676,"domain_scores_codex":[0.99885,0.00005537628,0.0002057745,0.0003635958,0.0002713485,0.0002539269],"domain_scores_gemma":[0.9991443,0.00007053357,0.00007878589,0.0003510277,0.0001619762,0.0001933465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002581845,0.000295274,0.003435378,0.000013832,0.00001569981,0.00002847819,0.000403662,0.00004980485,0.0004570369,0.9919471,0.001396051,0.001931876],"study_design_scores_gemma":[0.004592326,0.001525464,0.04869743,0.00002295611,0.00003927741,0.000259251,0.000344442,0.3978825,0.003636609,0.5004374,0.04146565,0.001096612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8759168,0.00007092629,0.1212817,0.0004888683,0.001620434,0.000200606,0.00002052505,0.0001352709,0.0002648865],"genre_scores_gemma":[0.9932167,0.00004595262,0.00568258,0.0006458363,0.00004943072,0.00001241285,0.00004043721,0.000008725425,0.0002979102],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4915096,"threshold_uncertainty_score":0.5303066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064483171","doi":"10.1007/s00373-008-0794-8","title":"Equitable Specialized Block-Colourings for Steiner Triple Systems","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Partition (number theory); Combinatorics; Mathematics; Steiner system; Block (permutation group theory); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01525339548254578,"gpt":0.1940080197331334,"spread":0.1787546242505877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002500947,0.000194725,0.0003279219,0.0001332713,0.0003261435,0.0000503653,0.000137086,0.0001198095,0.000005328648],"category_scores_gemma":[0.00001174697,0.0001863742,0.0001064372,0.0003252699,0.00005028266,0.00009991154,0.00002539125,0.0001020749,0.000005397846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000249139,"about_ca_system_score_gemma":0.00001107856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002113663,"about_ca_topic_score_gemma":0.000001254765,"domain_scores_codex":[0.9989653,0.00002383343,0.0002737312,0.0001888597,0.000147122,0.0004011707],"domain_scores_gemma":[0.999505,0.0000591052,0.00004321608,0.0002082722,0.00006346573,0.0001209417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005384132,0.00009488755,0.002007639,0.0005376478,0.0001553728,0.00003062548,0.000642732,0.0005582977,0.001471604,0.9753405,0.01894594,0.00016094],"study_design_scores_gemma":[0.01494416,0.001102107,0.002103009,0.0002825515,0.0002636658,0.0006654492,0.001823046,0.02246409,0.006706314,0.3436894,0.6033137,0.002642495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9821301,0.005677617,0.0004545073,0.00001103422,0.003314031,0.0006401966,0.0000269793,0.0004038943,0.007341716],"genre_scores_gemma":[0.9973373,0.0003703507,0.00002443553,0.00001103188,0.00006662875,0.0001476589,0.000006597127,0.00003840238,0.001997602],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6316512,"threshold_uncertainty_score":0.7600121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969647805","doi":"10.1007/s00373-002-0506-8","title":"Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index","year":2003,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Block (permutation group theory); Chromatic scale; Steiner system; Block size; Discrete mathematics; Arithmetic; Computer science; Key (lock)","retraction":null,"screen_n_in":null,"score":{"opus":0.00509165638525723,"gpt":0.1732324939067311,"spread":0.1681408375214739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004735019,0.0001536571,0.0003468065,0.00009926709,0.00009877554,0.0000481586,0.00009168463,0.00008564107,0.000005516204],"category_scores_gemma":[0.00002394969,0.0001068323,0.00006728841,0.0003203854,0.0001332097,0.0000529859,0.00001571048,0.0001139505,0.000001071837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008974002,"about_ca_system_score_gemma":0.00000658508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002373068,"about_ca_topic_score_gemma":0.000001358657,"domain_scores_codex":[0.9991546,0.0001096707,0.0002912141,0.0001186104,0.0001491673,0.0001767823],"domain_scores_gemma":[0.9995376,0.00009623243,0.00006406005,0.0002050158,0.00003468693,0.00006234318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001899856,0.0000233201,0.005125109,0.0002943711,0.00008721838,0.000002114276,0.0005466137,0.00006785994,0.0001425502,0.9933951,0.0002471726,0.00004951678],"study_design_scores_gemma":[0.02656272,0.0003881124,0.0194052,0.000574118,0.0004341908,0.0003278378,0.005336308,0.01537229,0.002882383,0.8886425,0.03857636,0.001497948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9849229,0.007468555,0.00005374874,0.000009755168,0.0009264605,0.0003523115,0.000003148413,0.00006661288,0.006196515],"genre_scores_gemma":[0.9993268,0.0003703275,0.000004315782,0.000007612447,0.00001074691,0.00003561084,5.247447e-7,0.00001854483,0.0002255165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1047526,"threshold_uncertainty_score":0.4356496,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Brush; Combinatorics; Broom; Graph; Mathematics; Computer science; Geography; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.007359817052971711,"gpt":0.2295834248796102,"spread":0.2222236078266385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021164,0.0001018386,0.00009883572,0.0001222159,0.0002046552,0.0001317168,0.000491242,0.00004637104,0.000003716337],"category_scores_gemma":[0.00001851192,0.00008016805,0.0000235441,0.0006998043,0.000124615,0.0003179974,0.0001766251,0.0003479227,0.000005413141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003898555,"about_ca_system_score_gemma":0.00002155821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005945285,"about_ca_topic_score_gemma":0.000008785514,"domain_scores_codex":[0.9991174,0.00002135516,0.00008075412,0.0002765192,0.0002364629,0.0002675331],"domain_scores_gemma":[0.9992339,0.00007391494,0.00003331489,0.0004380832,0.00008093415,0.0001398733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004481078,0.00002672434,0.006531783,0.000004586279,0.00000531734,0.00001387053,0.0001015459,9.743516e-7,0.0005162843,0.980875,0.00004241419,0.01187705],"study_design_scores_gemma":[0.0004160009,0.000193651,0.006410303,0.00000595436,0.000002264494,0.00004946109,0.00003269794,0.001079504,0.0008935686,0.9875756,0.00317152,0.0001694806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9129164,0.0001808662,0.07949901,0.0003279382,0.0004697629,0.0001498825,7.951384e-7,0.0002793744,0.006176007],"genre_scores_gemma":[0.9930254,0.00002670875,0.006693853,0.00006887483,0.000006334918,0.000008569368,3.963545e-7,0.000009160919,0.0001607556],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08010898,"threshold_uncertainty_score":0.3269158,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01356761502050592,"gpt":0.2686763638600163,"spread":0.2551087488395103,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002941878,0.000142516,0.0001670631,0.0003120675,0.0001357702,0.0002618433,0.0005044667,0.00006026886,0.000002756153],"category_scores_gemma":[0.00002177832,0.0001330093,0.00004193158,0.001136418,0.0000777352,0.0008396746,0.0001178277,0.0002708343,0.000003577734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002036229,"about_ca_system_score_gemma":0.00004345537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001109265,"about_ca_topic_score_gemma":0.000003494189,"domain_scores_codex":[0.9987953,0.0000561764,0.0001775167,0.0003240349,0.0002592234,0.00038773],"domain_scores_gemma":[0.9993662,0.00007837647,0.00004380087,0.000350495,0.00005947455,0.0001017184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004517817,0.00004061192,0.002187122,0.000006095001,0.00000288154,0.00002571115,0.0005346988,0.00006997286,0.0001349106,0.9756407,0.00005219884,0.02130062],"study_design_scores_gemma":[0.00039432,0.0001725266,0.01544188,0.0000198408,0.000001077117,0.000009926071,0.0003868212,0.0023922,0.0001915032,0.9804094,0.0004126927,0.0001678319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8443477,0.003395991,0.1231373,0.001201979,0.0004270599,0.0003803539,0.000001639765,0.0004190686,0.02668891],"genre_scores_gemma":[0.9981373,0.0001975509,0.00133242,0.0001496833,0.000005130644,0.00000642936,6.739353e-7,0.000005603056,0.0001652316],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1537896,"threshold_uncertainty_score":0.5423963,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Acadia University","funders":"","keywords":"Infimum and supremum; Upper and lower bounds; Graph; Klein bottle; Surface (topology); Projective plane","retraction":null,"screen_n_in":null,"score":{"opus":0.01622004758007687,"gpt":0.2687895569116349,"spread":0.252569509331558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000857793,0.0002106664,0.0002120983,0.0002660496,0.0002331639,0.0001374716,0.0004836878,0.00008158216,0.000004909932],"category_scores_gemma":[0.00005772246,0.000148203,0.00004840976,0.001313942,0.0001739714,0.0004139418,0.0002515691,0.0003949268,0.00001115375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000274899,"about_ca_system_score_gemma":0.00001794856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002512562,"about_ca_topic_score_gemma":0.000005716874,"domain_scores_codex":[0.9982855,0.0001536076,0.0001802259,0.0003781691,0.0004004867,0.0006019676],"domain_scores_gemma":[0.9985828,0.0005426424,0.00006352712,0.0005643847,0.00005511538,0.0001915063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002686953,0.0001812955,0.01974328,0.00001102866,0.000008568206,0.000005477354,0.001209842,0.0000204493,0.000113037,0.9767253,0.0002020611,0.00175281],"study_design_scores_gemma":[0.001013942,0.0004385821,0.04294856,0.00005343947,0.000005297608,0.00001003455,0.0002603068,0.002842084,0.001326298,0.9493963,0.001367562,0.0003376675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9947494,0.0007021996,0.001098772,0.0004122217,0.0004249519,0.0003334752,0.000003082428,0.00005380554,0.002222112],"genre_scores_gemma":[0.9989147,0.0003325662,0.0002293725,0.0003067201,0.000006628959,0.0000384463,9.046557e-7,0.00001366137,0.0001569584],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02732906,"threshold_uncertainty_score":0.6043544,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045559318","doi":"10.1007/s00373-003-0527-y","title":"On a Decomposition of Complete Graphs","year":2003,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Prime power; Discrete mathematics; Graph; Strongly regular graph; Prime (order theory); Pathwidth; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.007840884330635641,"gpt":0.1961483299234149,"spread":0.1883074455927793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001281136,0.0001171945,0.0001683166,0.0001395723,0.00006220676,0.00001285928,0.00005996603,0.00005754464,0.000008848868],"category_scores_gemma":[0.000005713356,0.0001141458,0.00006711537,0.0003201448,0.00003854163,0.00003952307,0.00000473117,0.00008863088,0.000003635403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006851483,"about_ca_system_score_gemma":0.000003171216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002786684,"about_ca_topic_score_gemma":5.294829e-7,"domain_scores_codex":[0.999445,0.00004272408,0.0001663625,0.0001038709,0.0001012631,0.0001407415],"domain_scores_gemma":[0.9996759,0.00005518977,0.00002907907,0.0001532601,0.00002603413,0.0000604837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005227601,0.00003909341,0.001162136,0.00006332767,0.00002685163,0.000001973047,0.00008017806,0.00009183463,0.00127118,0.9968459,0.0002513666,0.0001609472],"study_design_scores_gemma":[0.0005157677,0.0001622761,0.00206826,0.00004311783,0.00001607477,0.00001253953,0.00007198613,0.0003418178,0.002867226,0.9923828,0.001349501,0.0001686819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9837166,0.0007425561,0.0003121799,0.00000308658,0.0005029551,0.00009559895,0.000008223655,0.00009545763,0.01452336],"genre_scores_gemma":[0.9998039,0.0001089644,0.00002714417,0.00001551722,0.000001541091,0.000009456314,0.000003480386,0.00001404064,0.00001594017],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01608734,"threshold_uncertainty_score":0.4654732,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0158296650109866,"gpt":0.2788217830343118,"spread":0.2629921180233252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004807114,0.0002309158,0.0003010069,0.0007004202,0.0001763019,0.0002244275,0.001190096,0.0001146912,0.00000877203],"category_scores_gemma":[0.0002575187,0.000208197,0.0001599944,0.00252986,0.000519056,0.0006180278,0.0007319748,0.0003886672,0.000008919687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001783813,"about_ca_system_score_gemma":0.00008327755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001807115,"about_ca_topic_score_gemma":0.000003317239,"domain_scores_codex":[0.9979533,0.0001057337,0.0003353382,0.0005470217,0.0005782025,0.000480382],"domain_scores_gemma":[0.9977825,0.0008327469,0.00003593505,0.0009411598,0.0002015905,0.0002060387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007979032,0.00007379094,0.00106541,0.0001739871,0.00003308539,0.00005085532,0.0003311876,0.000001172637,0.0003235158,0.9861614,0.0008746275,0.01090298],"study_design_scores_gemma":[0.0003035764,0.0002646815,0.001186037,0.00008668684,0.00001311736,0.00002916541,0.00009533507,0.002787097,0.0007336069,0.9910735,0.003192011,0.0002352176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7653341,0.0499851,0.1326796,0.00556407,0.008396908,0.001185569,0.0001594456,0.002575312,0.03411996],"genre_scores_gemma":[0.9961634,0.001516434,0.002049235,0.00007663607,0.000006454019,0.00002169106,0.000002001062,0.00002137247,0.0001427927],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2308293,"threshold_uncertainty_score":0.8490026,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02541339476480037,"gpt":0.2717497073206486,"spread":0.2463363125558483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000310464,0.000159478,0.0001834833,0.0002924325,0.0005092508,0.00007764811,0.0005521939,0.00008695197,0.000005988997],"category_scores_gemma":[0.0001849513,0.000152754,0.00008496123,0.001198952,0.000343147,0.0005670009,0.000223696,0.0002228001,0.00001343574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002201677,"about_ca_system_score_gemma":0.0000409472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006690699,"about_ca_topic_score_gemma":7.360114e-7,"domain_scores_codex":[0.998418,0.0001135636,0.0001916084,0.0004227493,0.0004500206,0.0004040355],"domain_scores_gemma":[0.9987148,0.0003473223,0.00003642006,0.0004802558,0.0002032118,0.0002179673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008217711,0.00010459,0.003026854,0.0000124375,0.000007737798,0.00006111182,0.0002271558,6.388404e-7,0.0001203898,0.990464,0.0005376235,0.005429202],"study_design_scores_gemma":[0.000533619,0.000182353,0.01074069,0.000009160045,0.000003728998,0.00008849973,0.00002601561,0.002321913,0.0004691927,0.9846467,0.0007770417,0.0002010673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8112664,0.003310181,0.1731681,0.002153452,0.001987946,0.0005268864,0.000007145232,0.0008559119,0.006723996],"genre_scores_gemma":[0.9969673,0.0004678428,0.00224286,0.0001312927,0.000004838049,0.00002444438,0.000001759692,0.00001138052,0.0001482539],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1857009,"threshold_uncertainty_score":0.6229129,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01729599098283296,"gpt":0.2514579524417743,"spread":0.2341619614589414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000941966,0.00006405979,0.00009468383,0.0001216806,0.0003758142,0.00002737638,0.0006214493,0.00001483143,0.00001378795],"category_scores_gemma":[0.00006177818,0.00004829157,0.00004251051,0.0008426493,0.00008736469,0.00008824573,0.0004090662,0.0001719606,7.157929e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002422221,"about_ca_system_score_gemma":0.00002589827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000105605,"about_ca_topic_score_gemma":3.171463e-7,"domain_scores_codex":[0.9989502,0.0002548117,0.0001228858,0.0001754281,0.0003595471,0.0001370918],"domain_scores_gemma":[0.9989775,0.0004418746,0.00007626592,0.0004138242,0.00005473208,0.0000357715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001158708,0.00006809957,0.000342158,0.000003523293,0.000005601219,0.000001288469,0.0001722475,0.00002326307,0.0002000734,0.9964663,0.0002233654,0.002482532],"study_design_scores_gemma":[0.0002189519,0.0002071597,0.001790818,0.00000162264,0.000001501653,0.000002402094,0.00009027645,0.0009862707,0.001209124,0.9948378,0.000596919,0.00005718834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9862027,0.0002680683,0.008485091,0.001753608,0.0003825986,0.0002554702,0.0000090137,0.00004820585,0.002595234],"genre_scores_gemma":[0.9996226,0.00002353805,0.00008990039,0.0001287607,0.000001797769,0.00003288829,6.976835e-7,0.000003657393,0.00009620449],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01341985,"threshold_uncertainty_score":0.2890497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3123622571","doi":"10.1007/s00373-020-02182-9","title":"Burning the Plane","year":2020,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Grid; Plane (geometry); Graph; Dimension (graph theory); Sequence (biology); Cartesian coordinate system; Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.048425584420624,"gpt":0.2630287888099712,"spread":0.2146032043893472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001511424,0.00009177028,0.0001480736,0.00001343899,0.0001277884,0.00005149871,0.0001300981,0.00004235883,0.00003880903],"category_scores_gemma":[0.0001797252,0.00005653096,0.00004454791,0.0001675088,0.00004237048,0.00002900577,0.00006487082,0.0001523119,0.000007928692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003001003,"about_ca_system_score_gemma":0.000005341064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002057832,"about_ca_topic_score_gemma":3.709593e-7,"domain_scores_codex":[0.9994302,0.00002089526,0.0001514825,0.0001165279,0.0001462022,0.0001346317],"domain_scores_gemma":[0.9993871,0.0003040323,0.00005717709,0.0001301405,0.00002425155,0.00009729234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002608379,0.00002492598,0.0003211606,0.00005713539,0.00001312134,0.000004468157,0.0004329112,1.575519e-7,0.00002237173,0.9967735,0.001858868,0.000488713],"study_design_scores_gemma":[0.0001709663,0.00005478854,0.0001670244,0.000009555496,0.00002080972,0.000005685583,0.0001543801,0.003441169,0.00001837696,0.9917587,0.004111427,0.00008710887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9478863,0.0007045582,0.008137635,0.008096923,0.0002537163,0.000415671,0.0000140305,0.0002398741,0.03425131],"genre_scores_gemma":[0.9989355,0.00007120304,0.0003673691,0.000474802,0.00001503028,0.000006525919,0.000001400835,0.00001184067,0.0001163165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05104923,"threshold_uncertainty_score":0.2305266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093541724","doi":"10.1007/s003730050006","title":"Symmetric Graph Designs","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Graph; Symmetric graph; Line graph; Discrete mathematics; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.009673629584774029,"gpt":0.1783846952900734,"spread":0.1687110657052994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001322947,0.0001469918,0.0001572652,0.000208589,0.0001079359,0.00004320944,0.0001109652,0.00008328557,0.00009176445],"category_scores_gemma":[0.000002877155,0.0001415344,0.00006898509,0.001014945,0.00003748125,0.00008487744,0.000006556672,0.0001217274,0.00003685059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008266438,"about_ca_system_score_gemma":0.00000288784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006739363,"about_ca_topic_score_gemma":6.612315e-7,"domain_scores_codex":[0.9993334,0.00002707731,0.0001522627,0.0001382569,0.0001141012,0.0002349169],"domain_scores_gemma":[0.9996436,0.00003696454,0.00001126647,0.0001807511,0.00001614777,0.0001112408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006965372,0.00004827932,0.003171406,0.00007583362,0.00005961629,0.00001439875,0.0001790526,0.0001604277,0.0001408046,0.9661378,0.001825319,0.02818014],"study_design_scores_gemma":[0.0007402468,0.000136653,0.007476529,0.00003115214,0.00004166192,0.00004564894,0.0001074856,0.001357577,0.0005745152,0.9646948,0.0242607,0.0005330476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9497145,0.004592772,0.0001558042,0.000008283881,0.0004861999,0.0001124394,0.000004337051,0.0004123115,0.0445133],"genre_scores_gemma":[0.9982278,0.001295522,0.00001813205,0.00002424452,0.00001025623,0.00001684391,0.000002523709,0.00002203842,0.0003826611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04851323,"threshold_uncertainty_score":0.5771604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086987965","doi":"10.1007/s00373-014-1498-x","title":"Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree","year":2014,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"European Commission","keywords":"Betweenness centrality; Combinatorics; Mathematics; Vertex (graph theory); Upper and lower bounds; Degree (music); Enhanced Data Rates for GSM Evolution; Neighbourhood (mathematics); Discrete mathematics; Graph; Centrality; Physics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02340104887465191,"gpt":0.2437281785376534,"spread":0.2203271296630015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002419909,0.0000596842,0.0001253828,0.00003361108,0.0001359019,0.000008935057,0.0000897763,0.0000432754,0.000002846854],"category_scores_gemma":[0.000135846,0.0000434001,0.0000439869,0.0002846865,0.0001638584,0.0000421967,0.0000434131,0.00006713917,1.008857e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000303703,"about_ca_system_score_gemma":0.000008048056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000017257,"about_ca_topic_score_gemma":0.00001953316,"domain_scores_codex":[0.9995016,0.00006585948,0.00018368,0.00008462132,0.00008811279,0.00007608917],"domain_scores_gemma":[0.9992565,0.0003019555,0.0001308072,0.0002225789,0.00005636659,0.00003180815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002710559,0.00007321495,0.04666989,0.0000684912,0.00001319111,1.399129e-8,0.0004188828,1.909359e-7,0.0003515099,0.9520721,0.00007390536,0.0002559275],"study_design_scores_gemma":[0.0002286972,0.0000250392,0.09288661,0.00002818105,0.000057927,6.759762e-7,0.0001712929,0.0001632871,0.0007586444,0.9054431,0.0001932017,0.00004337229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9979903,0.0002556309,0.00009873151,0.0001262941,0.00004391632,0.0001009068,0.000005285334,0.00001294343,0.001366067],"genre_scores_gemma":[0.9997087,0.00005271108,0.0001509132,0.00001181441,0.000001797362,0.000006178336,7.416048e-7,0.000004470505,0.00006264875],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.046629,"threshold_uncertainty_score":0.1769805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069126428","doi":"10.1007/s00373-007-0709-0","title":"Enumerating Non-crossing Minimally Rigid Frameworks","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Point (geometry); Space (punctuation); Graph; Property (philosophy); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science; Geometry; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.003462599481939789,"gpt":0.1969183633865814,"spread":0.1934557639046416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001126415,0.0001103573,0.0001259525,0.00008141341,0.0002058052,0.0001569076,0.00005452631,0.0001385868,0.00001030642],"category_scores_gemma":[0.00001005478,0.0001009803,0.00004557018,0.0003661918,0.00003050998,0.0001197792,0.00001508809,0.0002144529,0.000001426341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001618943,"about_ca_system_score_gemma":0.000004060833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008661052,"about_ca_topic_score_gemma":0.000004797379,"domain_scores_codex":[0.9994152,0.000003484418,0.0001732708,0.0001129426,0.0001014861,0.0001936585],"domain_scores_gemma":[0.999742,0.00003338205,0.00002701186,0.0000883673,0.00004144883,0.00006774114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000540498,0.0001020171,0.1761085,0.0004780413,0.0006084515,0.0001209519,0.006636271,0.04443606,0.01869575,0.355367,0.002423195,0.3949697],"study_design_scores_gemma":[0.001667407,0.0001858843,0.1583907,0.0001742484,0.0001866044,0.0000392055,0.0008302489,0.6340277,0.01288608,0.1862155,0.003782345,0.001614128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9648818,0.0009300753,0.03152716,0.00001326781,0.0003959492,0.00004219695,8.385013e-7,0.0001098086,0.002098951],"genre_scores_gemma":[0.9974198,0.0001183991,0.002343078,0.00004188181,0.00002701339,0.000001229075,0.000005277852,0.00001384913,0.00002950736],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5895916,"threshold_uncertainty_score":0.4117858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075056990","doi":"10.1007/s00373-012-1132-8","title":"On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Maximal independent set; Integer (computer science); Degree (music); Independent set; Discrete mathematics; Indifference graph; Chordal graph; Graph; 1-planar graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03048515398271141,"gpt":0.2755864075653491,"spread":0.2451012535826377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354372,0.0002435733,0.0003812197,0.0001896409,0.0002744088,0.00002787602,0.0001908172,0.0001378313,0.00002883972],"category_scores_gemma":[0.0001273896,0.000195163,0.0001803525,0.0002365943,0.0001709366,0.0001256272,0.0001481942,0.0002479386,7.719116e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002090831,"about_ca_system_score_gemma":0.00001120639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002292903,"about_ca_topic_score_gemma":0.000001699499,"domain_scores_codex":[0.9985656,0.00009587255,0.0003298012,0.0002031447,0.0004132706,0.0003922808],"domain_scores_gemma":[0.9988093,0.0003998744,0.0001807753,0.0003764897,0.00007774567,0.000155819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003081618,0.0001423056,0.08482332,0.0001334389,0.00006946857,0.000003455517,0.001254431,1.527962e-7,0.00001548491,0.9124277,0.0003615198,0.0007378819],"study_design_scores_gemma":[0.000428894,0.0001488912,0.05840258,0.00004697329,0.00007862804,0.0000198157,0.000454432,0.000004189295,0.0003352143,0.9396325,0.0002236299,0.0002242832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9907526,0.0008273598,0.00005480198,0.00001194187,0.0008553942,0.0001490938,0.00002805866,0.00006470762,0.007256084],"genre_scores_gemma":[0.9995476,0.00007444904,0.0001649688,0.00003273728,0.00001769747,0.00001188005,0.000003852951,0.00002810109,0.0001186923],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02720474,"threshold_uncertainty_score":0.7958516,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02439216060659726,"gpt":0.2726992721098767,"spread":0.2483071115032794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003757963,0.0001316938,0.0001530678,0.0001815638,0.0003285838,0.0001648382,0.0005336252,0.00005469224,0.000006187171],"category_scores_gemma":[0.00005930088,0.0001269894,0.00005509339,0.0006706688,0.00006808931,0.0005241926,0.0002375154,0.0002222521,0.00001146688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002121368,"about_ca_system_score_gemma":0.0000183235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003948405,"about_ca_topic_score_gemma":0.000001844454,"domain_scores_codex":[0.9988333,0.00005801362,0.0001549153,0.0003427937,0.0002356798,0.0003752783],"domain_scores_gemma":[0.9991933,0.0001803625,0.00005644611,0.0003400025,0.00008249406,0.0001474696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002606019,0.00003467085,0.001093912,0.000008162144,0.000009474707,0.000007725878,0.0005025581,0.00002310013,0.000218121,0.8693392,0.000149433,0.128611],"study_design_scores_gemma":[0.0006209465,0.000150985,0.002068174,0.00002369391,0.000004653386,0.00004099746,0.0002184605,0.005421951,0.002984139,0.967046,0.02112238,0.0002976411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7065166,0.004888788,0.2722234,0.002980752,0.0007331275,0.0003605286,0.000003311081,0.0007624796,0.01153109],"genre_scores_gemma":[0.993059,0.0001204261,0.006494765,0.0001114859,0.00002186295,0.000008494378,6.225033e-7,0.00001108206,0.0001723039],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2865424,"threshold_uncertainty_score":0.5178477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3153372228","doi":"10.1007/s00373-022-02574-z","title":"From One to Many Rainbow Hamiltonian Cycles","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamiltonian (control theory); Bijection; Hamiltonian path; Bounded function; Transversal (combinatorics); Graph; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02706766960103565,"gpt":0.2630483332081446,"spread":0.235980663607109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002614453,0.0001670146,0.000252637,0.0001516839,0.0007907758,0.00004452376,0.000311764,0.00005237991,0.0002086793],"category_scores_gemma":[0.00004996586,0.0001625598,0.00008931566,0.0003806419,0.00005529415,0.00004034013,0.0005223025,0.0002561928,0.000002128422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003187901,"about_ca_system_score_gemma":0.00001265054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006077425,"about_ca_topic_score_gemma":0.000003670642,"domain_scores_codex":[0.9987859,0.00009287755,0.0002137878,0.0003028382,0.0003448223,0.0002597353],"domain_scores_gemma":[0.9991351,0.0002042313,0.00007072512,0.0004113243,0.00003249535,0.0001460727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002542362,0.0001134405,0.002057483,0.00001459443,0.00005681969,0.00001198331,0.002424671,0.000001452593,0.00008631906,0.988864,0.00435929,0.001984528],"study_design_scores_gemma":[0.0004541159,0.0001334014,0.005604413,0.000007814419,0.00003784624,0.00000558604,0.0007514653,0.0000218074,0.0001020245,0.9804798,0.0121746,0.0002271729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9947422,0.0004762317,0.0001120316,0.0003352529,0.0008367348,0.0002107707,0.00007820759,0.0001138467,0.00309474],"genre_scores_gemma":[0.9975688,0.00004829958,0.001269741,0.0005063568,0.00003496806,0.00005091059,0.00000788196,0.0000303243,0.0004827319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008384238,"threshold_uncertainty_score":0.6628998,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01298566698275696,"gpt":0.2510953005535228,"spread":0.2381096335707658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002560822,0.0001385884,0.0001303927,0.0001876344,0.0002811989,0.0001173217,0.0005753801,0.00005133396,0.000007269947],"category_scores_gemma":[0.00007022629,0.0001230435,0.00003333024,0.001141991,0.0001865787,0.00024858,0.0001960417,0.0001615698,0.00007236363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001844297,"about_ca_system_score_gemma":0.00003635863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005293567,"about_ca_topic_score_gemma":0.000001231755,"domain_scores_codex":[0.9986833,0.00006254957,0.0001181916,0.000461676,0.000320789,0.0003534612],"domain_scores_gemma":[0.998859,0.00008568607,0.00004271087,0.0006941456,0.0001852768,0.0001332213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001132072,0.00006382187,0.0004703115,0.000008388704,0.00000752637,0.000008997494,0.0001456981,4.130827e-7,0.0001826488,0.9941023,0.001466053,0.00353251],"study_design_scores_gemma":[0.0003716351,0.0006138635,0.001803203,0.00001069658,0.000002152021,0.000009459997,0.00001314902,0.000474484,0.004443316,0.9859786,0.006111441,0.000167978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9044966,0.0008761437,0.03244751,0.002492634,0.002686007,0.0007744366,0.000005710096,0.0006851848,0.0555358],"genre_scores_gemma":[0.9981732,0.00004811747,0.0008797903,0.0002266977,0.00002431013,0.00001110555,8.543599e-7,0.00001077061,0.0006251324],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09367665,"threshold_uncertainty_score":0.501757,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Control reconfiguration; Bipartite graph; Discrete mathematics; Graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03079598120794812,"gpt":0.2877690375327042,"spread":0.2569730563247561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005346884,0.0001310394,0.0001682606,0.0005559594,0.0001784846,0.00007275835,0.0004492515,0.0000772919,0.000004619758],"category_scores_gemma":[0.00004304525,0.0001237131,0.0000685478,0.00189157,0.00005082024,0.0002899574,0.0001745697,0.0001944498,0.00001090536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002121598,"about_ca_system_score_gemma":0.00002853198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006934344,"about_ca_topic_score_gemma":0.000001910601,"domain_scores_codex":[0.9986059,0.00009143903,0.0002146133,0.0003421382,0.000448113,0.0002977926],"domain_scores_gemma":[0.9990194,0.0002590122,0.00009187253,0.0004223755,0.0001007162,0.0001065685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009407332,0.00004023586,0.000872061,0.00001761884,0.00001533592,0.000008075219,0.0002089477,0.00007171556,0.0006708399,0.9926799,0.000233604,0.005172275],"study_design_scores_gemma":[0.0003860572,0.0002159101,0.007018832,0.00002263098,0.000002991194,0.000004407181,0.0001097511,0.002674461,0.002930745,0.9864125,0.00008553313,0.0001362035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9844149,0.0001725951,0.01121254,0.0003489357,0.0006361224,0.000254842,0.000005363371,0.0002628388,0.002691902],"genre_scores_gemma":[0.9993286,0.0002746743,0.0001583207,0.00006298434,0.000002395499,0.00001678499,0.000006089607,0.00001061855,0.0001395685],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0149137,"threshold_uncertainty_score":0.5044875,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Claw; Mathematics; Combinatorics; Discrete mathematics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01856724002713184,"gpt":0.2593241864036195,"spread":0.2407569463764877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000873322,0.0001561084,0.0001767073,0.0004727198,0.000150119,0.00007968862,0.0007950252,0.00009028034,0.000003735886],"category_scores_gemma":[0.0001036268,0.0001506371,0.00006115671,0.001694818,0.0001079503,0.0009590341,0.0004165691,0.0002518276,0.000007470025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003749624,"about_ca_system_score_gemma":0.00001986969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001507266,"about_ca_topic_score_gemma":0.000006100171,"domain_scores_codex":[0.9984381,0.0001348136,0.0002103107,0.0002971754,0.0003646179,0.0005549722],"domain_scores_gemma":[0.9988146,0.0001705971,0.00006220412,0.0006741887,0.00007795523,0.0002004899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006098388,0.0001401957,0.05166003,0.00001264168,0.000005037088,0.000005188812,0.000369272,0.000001047082,0.00006471585,0.9371585,0.0002490285,0.01032822],"study_design_scores_gemma":[0.0007843444,0.00007836502,0.05049923,0.00001128371,0.000002402412,0.00001058155,0.00006027292,0.0006197531,0.0003272454,0.9463044,0.001115606,0.0001864571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9539335,0.004867963,0.03208891,0.0008509987,0.001356995,0.000512388,0.000004560645,0.0003192452,0.006065407],"genre_scores_gemma":[0.997694,0.0002873837,0.001766556,0.00009102072,0.000008876874,0.00003638664,0.000001732815,0.00001140536,0.0001026643],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04376044,"threshold_uncertainty_score":0.6142803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911394913","doi":"10.1007/s00373-008-0799-3","title":"Silver Cubes","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Prime power; Vertex (graph theory); Neighbourhood (mathematics); Algebraic number; Discrete mathematics; Graph; Prime (order theory)","retraction":null,"screen_n_in":null,"score":{"opus":0.008022328700756318,"gpt":0.1595524250601304,"spread":0.1515300963593741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005083363,0.00009569835,0.0001099849,0.00006307048,0.000110742,0.00001116185,0.00006439667,0.00005400482,0.0000107579],"category_scores_gemma":[0.000002535803,0.00008988084,0.00004197798,0.0002100798,0.00004550695,0.00006428586,0.00001096461,0.00008237445,0.00001438337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005313457,"about_ca_system_score_gemma":0.000002716414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004096584,"about_ca_topic_score_gemma":4.74e-7,"domain_scores_codex":[0.9995828,0.00001090751,0.00009584283,0.00008639225,0.00008011272,0.0001439937],"domain_scores_gemma":[0.9997693,0.00001775633,0.00000870367,0.0001223945,0.00001556945,0.00006630435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003923352,0.00003934668,0.02929198,0.00007277358,0.00004929076,0.00004091955,0.0006772247,0.00007804971,0.0006577834,0.9619362,0.006350771,0.0008017083],"study_design_scores_gemma":[0.001554982,0.0001896171,0.05528553,0.00005256981,0.00004154159,0.0003551166,0.0004542955,0.006014748,0.003368955,0.8530667,0.07860306,0.00101292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9832342,0.002428629,0.00008146586,0.00000640263,0.0006302605,0.00005012339,0.000001981752,0.0002540822,0.01331281],"genre_scores_gemma":[0.9990415,0.0006569339,0.000008453782,0.00001720405,0.00001026107,0.000008103144,0.000001379866,0.00001371338,0.0002424571],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1088696,"threshold_uncertainty_score":0.3665234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963702185","doi":"10.1007/s00373-004-0571-2","title":"Random Hypergraph Processes with Degree Restrictions","year":2004,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Tuple; Degree (music); Equivalence (formal languages); Infinity; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02909474812830394,"gpt":0.2483741685887711,"spread":0.2192794204604671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001249196,0.0001945437,0.0002356613,0.0001688481,0.0005523287,0.00005055975,0.0001542853,0.0000917759,0.000005366344],"category_scores_gemma":[0.0001509522,0.0001333599,0.00005886313,0.0008497089,0.0001728113,0.0001096067,0.00005083496,0.0001776308,6.545813e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001434259,"about_ca_system_score_gemma":0.0000733452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002451764,"about_ca_topic_score_gemma":0.00004003329,"domain_scores_codex":[0.9990769,0.00002437234,0.0001872854,0.0002411236,0.0002298812,0.0002404285],"domain_scores_gemma":[0.9991217,0.0002505751,0.00008604764,0.0002825414,0.0001493961,0.0001096878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006263428,0.0001093676,0.004587818,0.0001203805,0.00005657469,0.00001381478,0.0004400164,0.000004235875,0.000006205922,0.9941353,0.0001678533,0.0002957658],"study_design_scores_gemma":[0.00269792,0.0002104434,0.002347771,0.00005708908,0.00008377531,0.00007147575,0.0002068961,9.933212e-7,0.0001802117,0.9932921,0.0006393709,0.0002119419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9886135,0.001252562,0.001569682,0.0001422379,0.000268055,0.0002666953,0.000006991496,0.0001979258,0.007682337],"genre_scores_gemma":[0.9971077,0.0008602295,0.001785655,0.00005905182,0.00001612202,0.00003226662,0.000001819742,0.00002541931,0.0001117006],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008494222,"threshold_uncertainty_score":0.5438257,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Digraph; Combinatorics; Mathematics; Conjecture; Graph; Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02388873271898021,"gpt":0.277291752450136,"spread":0.2534030197311558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003734514,0.0001138129,0.0002702177,0.0001798626,0.0000457573,0.000009993114,0.0003358909,0.00005659137,0.000001922922],"category_scores_gemma":[0.00005542368,0.00008416657,0.00005737516,0.0007951007,0.0003740175,0.0001493936,0.0001498446,0.0001413086,1.187529e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006314041,"about_ca_system_score_gemma":0.00001626952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008923049,"about_ca_topic_score_gemma":0.00002896269,"domain_scores_codex":[0.998893,0.0001196819,0.0003131659,0.0002021032,0.0002813283,0.0001907492],"domain_scores_gemma":[0.9988849,0.0003852564,0.0002185005,0.0003458193,0.000122225,0.00004331669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005698235,0.0001660985,0.3193952,0.00008451418,0.00002141535,0.000002309382,0.0007191687,0.00003995329,0.002952218,0.6744504,0.000004827352,0.002106942],"study_design_scores_gemma":[0.00158545,0.0005761699,0.3131702,0.0002844026,0.00001912903,0.00001223864,0.0004569704,0.009950006,0.01543055,0.6582645,0.00004271507,0.00020771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9974789,0.000738719,0.001285136,0.00008102373,0.00004340617,0.0001625596,0.00001033257,0.000008243927,0.0001916976],"genre_scores_gemma":[0.999207,0.0005342318,0.0002330998,0.000007339274,0.000001445539,0.000006445644,8.439492e-7,0.000005274118,0.000004377284],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01618594,"threshold_uncertainty_score":0.3432213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2749343700","doi":"10.1007/s00373-018-1907-7","title":"A Meyniel-Type Condition for Bipancyclicity in Balanced Bipartite Digraphs","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Digraph; Bipartite graph; Order (exchange); Strongly connected component; Directed graph; Complete bipartite graph","retraction":null,"screen_n_in":null,"score":{"opus":0.03134306007140081,"gpt":0.3202403442278282,"spread":0.2888972841564274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003105122,0.0001760839,0.0002791719,0.0002105044,0.0002800375,0.0000332895,0.0001433099,0.0001382582,0.00001810627],"category_scores_gemma":[0.0001703126,0.0001505958,0.00008431765,0.0005835452,0.000200472,0.00009950902,0.00005865867,0.0001266044,0.000001123575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001434824,"about_ca_system_score_gemma":0.00001357723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000128405,"about_ca_topic_score_gemma":0.00003108901,"domain_scores_codex":[0.9989472,0.00004593374,0.0002779652,0.000274157,0.000142978,0.0003117887],"domain_scores_gemma":[0.9991417,0.0002551696,0.0001070042,0.0002697583,0.000144389,0.00008198844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007576327,0.00008063454,0.01949783,0.00006723343,0.00002571262,0.000001521051,0.0006637808,8.967024e-8,0.0001718153,0.9774439,0.001382415,0.000589299],"study_design_scores_gemma":[0.001079569,0.0003198579,0.01306346,0.00003609422,0.00002852792,0.000004001578,0.00009316832,0.0001479143,0.0007281124,0.9812841,0.003011527,0.0002036234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9964691,0.0002738048,0.0002503463,0.00005005612,0.0008486085,0.0003579145,0.00001941148,0.0000792642,0.001651522],"genre_scores_gemma":[0.9989557,0.0001633928,0.0005400571,0.0001251223,0.00004107938,0.00004111184,0.000008209832,0.0000212253,0.0001040707],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00643437,"threshold_uncertainty_score":0.614112,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matroid; Graphic matroid; Combinatorics; Mathematics; Graph; Matroid partitioning; Discrete mathematics; Dual graph; Planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02808379344953137,"gpt":0.2971521795622064,"spread":0.269068386112675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004964357,0.0001337647,0.0002128296,0.000451995,0.0001127243,0.00006566026,0.000680874,0.00008545887,0.000002110257],"category_scores_gemma":[0.0001591452,0.0001247991,0.00009488426,0.002227877,0.0002987013,0.0003771883,0.0003167542,0.0002431074,0.000003291423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001025331,"about_ca_system_score_gemma":0.0000560748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002017233,"about_ca_topic_score_gemma":0.000001804465,"domain_scores_codex":[0.9984596,0.0001199117,0.0002554595,0.0003563866,0.0005153602,0.0002933042],"domain_scores_gemma":[0.9984441,0.000186139,0.00008911752,0.0006806861,0.0003057367,0.0002942039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008642732,0.00009271065,0.0204973,0.00001133753,0.00001628091,0.000008149867,0.0002567103,0.000006011631,0.0001398975,0.9778346,0.0003300453,0.0007982539],"study_design_scores_gemma":[0.0004547256,0.0002328901,0.006597116,0.0000102495,0.000006088955,0.00001891549,0.0001595593,0.001025349,0.0003193585,0.990649,0.0003891251,0.0001376511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7059524,0.003517798,0.2790538,0.001471678,0.001073056,0.00053168,0.00001298595,0.0004485957,0.007937982],"genre_scores_gemma":[0.995643,0.0001977763,0.003999861,0.00004736111,0.000005492891,0.00001934571,0.000001721748,0.000009808758,0.00007566885],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2896906,"threshold_uncertainty_score":0.508916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2783369107","doi":"10.1007/s00373-011-1019-0","title":"Algorithmic Folding Complexity","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Equidistant; Fold (higher-order function); Mathematics; Upper and lower bounds; Combinatorics; String (physics); Folding (DSP implementation); Sequence (biology); Binary number; Simple (philosophy); Geometry; Computer science; Mathematical analysis; Biology; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.05806883863181366,"gpt":0.2246883979558044,"spread":0.1666195593239907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001544146,0.00012974,0.0001425697,0.0000940569,0.0002427234,0.00009246709,0.0005600075,0.00005385703,0.00001297109],"category_scores_gemma":[0.000006489765,0.0001130039,0.00004419015,0.0003621577,0.00006679994,0.0004422939,0.000454934,0.0001216708,0.000009601174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001033192,"about_ca_system_score_gemma":0.00001537452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009903395,"about_ca_topic_score_gemma":0.000001229808,"domain_scores_codex":[0.9990836,0.00002879941,0.0001491594,0.000318474,0.0001801578,0.000239819],"domain_scores_gemma":[0.9992896,0.00002261302,0.00006036414,0.0004394136,0.00005406676,0.0001339261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001507874,0.00006471114,0.001368421,0.000005969699,0.000006621603,0.0000128178,0.0002852004,5.388564e-8,0.00002265425,0.9773811,0.0004966392,0.02035434],"study_design_scores_gemma":[0.0003867818,0.000115153,0.01913766,0.00001433197,0.000005584422,0.00002677898,0.00003305859,0.01362693,0.0003467563,0.9629794,0.003100932,0.0002265943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1223138,0.001980626,0.85632,0.0001691182,0.002400976,0.0003137614,0.00001375101,0.0007350164,0.01575292],"genre_scores_gemma":[0.9534065,0.000174623,0.04620625,0.000116266,0.000013085,0.000008947322,0.000003391484,0.000008320519,0.00006268897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8310927,"threshold_uncertainty_score":0.4608167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1494111593","doi":"10.1007/s00373-016-1700-4","title":"A Tight Upper Bound on Acquaintance Time of Graphs","year":2016,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Multiplicative function; Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01348302932144404,"gpt":0.2449193589234375,"spread":0.2314363296019934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002584286,0.000201398,0.0003140642,0.0001674288,0.0001849002,0.00001686447,0.0002183298,0.0001241373,0.00009835814],"category_scores_gemma":[0.00010355,0.0001206801,0.0001438256,0.0002763522,0.0002564876,0.00007416007,0.00008085969,0.0001019592,0.000006315213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001485218,"about_ca_system_score_gemma":0.00001309809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002124125,"about_ca_topic_score_gemma":4.393981e-7,"domain_scores_codex":[0.9988769,0.00006064202,0.0002791343,0.0002583142,0.0002704342,0.000254606],"domain_scores_gemma":[0.9987611,0.0004647653,0.000147529,0.0004444319,0.00008675711,0.0000954158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004237848,0.00009556022,0.003173462,0.00004234009,0.0000514941,0.000003924079,0.0002728908,2.124478e-8,0.0006462942,0.9920178,0.001782349,0.001871509],"study_design_scores_gemma":[0.0007243805,0.0002327115,0.002631418,0.00009638194,0.00003141377,0.000007390898,0.0000256566,0.000004830776,0.00226258,0.9923782,0.001411372,0.0001936499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9926606,0.0003624126,0.0001089366,0.0001402458,0.0003738507,0.0001525714,0.00002215185,0.00006524409,0.006113932],"genre_scores_gemma":[0.9982413,0.0002746329,0.0001603155,0.0001030241,0.00001016479,0.000008897402,7.590028e-7,0.00002520406,0.00117567],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005580678,"threshold_uncertainty_score":0.4921193,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Université de Montréal","keywords":"Combinatorics; Mathematics; Mathematical proof; Vertex (graph theory); Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01007385019446178,"gpt":0.2495646720490763,"spread":0.2394908218546146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005422601,0.0002518367,0.0002693611,0.0004207579,0.0004192708,0.0002353383,0.001244828,0.0001652071,0.00001178564],"category_scores_gemma":[0.00006326974,0.0002336413,0.0001305318,0.001686577,0.0002520982,0.0005576898,0.0005047957,0.0007429383,0.00002274251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001197685,"about_ca_system_score_gemma":0.00004910055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001222898,"about_ca_topic_score_gemma":0.000012725,"domain_scores_codex":[0.9979739,0.00005417792,0.0002345016,0.0006029938,0.0004854455,0.0006489746],"domain_scores_gemma":[0.9981114,0.0001478051,0.0001142521,0.001041047,0.0002075984,0.0003779486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000589958,0.0001036759,0.02014934,0.00001951606,0.00001502825,0.00004001658,0.0001495537,8.748804e-7,0.001764929,0.9716237,0.0006365213,0.005490934],"study_design_scores_gemma":[0.000546688,0.0001268521,0.01943612,0.00001192848,0.000005392765,0.00003176952,0.00005404598,0.001060039,0.001705651,0.9734939,0.003203819,0.0003238426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9761798,0.0005846671,0.01447098,0.0006223679,0.001997449,0.0003081268,0.000007211917,0.0003929711,0.005436368],"genre_scores_gemma":[0.9969761,0.0001977297,0.002208728,0.0001801729,0.00001593985,0.00003358399,0.000001986137,0.00002182251,0.0003639512],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02079623,"threshold_uncertainty_score":0.9527616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}