{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Hong‐Jian Lai","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002017826,0.0002850487,0.000499894,0.00129768,0.001147591,0.001824055,0.001106336,0.0009549237,0.008578734],"category_scores_gemma":[0.002164603,0.0002519238,0.0002667211,0.001373115,0.001210668,0.002088272,0.001025753,0.0007852385,0.0005324766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005073615,"about_ca_system_score_gemma":0.0003404357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001480247,"about_ca_topic_score_gemma":0.001390954,"domain_scores_codex":[0.9997107,0.0000584363,0.00001648828,0.00007608175,0.00006114943,0.00007715203],"domain_scores_gemma":[0.997853,0.000935186,0.0004879594,0.0001948292,0.0002214809,0.000307548],"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.001199018,0.000251388,0.01013498,0.000536042,0.00007434431,0.001155187,0.004060638,0.01516281,0.03132347,0.8709497,0.007617465,0.05753497],"study_design_scores_gemma":[0.0001612052,0.0001113331,0.005413383,0.00005702293,0.00005125028,0.0005183873,0.001625629,0.02289321,0.005381759,0.9559523,0.00780503,0.0000294755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9402027,0.0003084173,0.02319169,0.0006302972,0.00004630097,0.00007931772,0.0005192836,0.0001633479,0.03485869],"genre_scores_gemma":[0.9904274,0.0002344745,0.006083806,0.0001091693,0.00003466585,0.00005855682,0.0004583233,0.00002846159,0.00256505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008578734,"threshold_uncertainty_score":0.02869874,"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","authors":[{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Bojan Mohar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003113188,0.001072309,0.001284253,0.004154722,0.001552519,0.003973444,0.002186415,0.002086398,0.006466789],"category_scores_gemma":[0.00804512,0.0006078969,0.0009762825,0.007620554,0.005490181,0.00914024,0.002396942,0.004311395,0.002145062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00179362,"about_ca_system_score_gemma":0.000874409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009917156,"about_ca_topic_score_gemma":0.001097783,"domain_scores_codex":[0.9988781,0.0003504299,0.00007643127,0.0002982903,0.0002991587,0.00009762191],"domain_scores_gemma":[0.9934133,0.004744758,0.0002425228,0.0005275119,0.0007755972,0.0002963606],"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.00009099136,0.0001194127,0.0008451216,0.001969079,0.00005152478,0.0001644531,0.0004947169,0.002977979,0.001064594,0.740546,0.03438351,0.2172927],"study_design_scores_gemma":[0.00001372156,0.00005015274,0.0005634206,0.000205984,0.00003097173,0.0002556559,0.0001965911,0.004053659,0.0004895847,0.8171568,0.1769533,0.00003016378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0163057,0.7130156,0.1241413,0.03384664,0.009815825,0.00007332402,0.0003651292,0.0003760319,0.1020605],"genre_scores_gemma":[0.2057485,0.6122854,0.094741,0.008601346,0.04725742,0.0001454363,0.0007613171,0.0002918496,0.03016763],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006466789,"threshold_uncertainty_score":0.02163351,"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","authors":[{"name":"Ruth Haas","is_ca":false},{"name":"Karen Seyffarth","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004998876,0.0006939321,0.0008237346,0.001143452,0.001382065,0.002925622,0.001131158,0.001103946,0.005159437],"category_scores_gemma":[0.003094452,0.0005238565,0.0005020821,0.00136636,0.0021185,0.004038753,0.001500226,0.001552636,0.00135464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00106026,"about_ca_system_score_gemma":0.0008162456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009951835,"about_ca_topic_score_gemma":0.0007367328,"domain_scores_codex":[0.9994487,0.0001353309,0.00002884617,0.000210803,0.00009765897,0.00007857879],"domain_scores_gemma":[0.9982937,0.0008290912,0.0001548213,0.0002212482,0.000256082,0.0002450366],"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.0001214617,0.00002772873,0.00059076,0.0002301702,0.00002816644,0.0001716046,0.0003002332,0.007715845,0.003167005,0.9497231,0.0096472,0.02827668],"study_design_scores_gemma":[0.00002108523,0.00001706824,0.0003643056,0.00003055345,0.00001921942,0.0002865471,0.00008699668,0.01255506,0.0008135331,0.9683846,0.01740628,0.00001485638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3735762,0.007581537,0.3447894,0.01073333,0.001020927,0.0001843594,0.003262337,0.0004910454,0.2583608],"genre_scores_gemma":[0.8814209,0.005276944,0.05509475,0.001428892,0.0005748494,0.0001653823,0.001627058,0.0001543525,0.05425701],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005159437,"threshold_uncertainty_score":0.01726002,"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","authors":[{"name":"Jason I. Brown","is_ca":true},{"name":"Julia Tufts","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008278093,0.0006193276,0.0008344388,0.002181772,0.001534922,0.002136561,0.001086165,0.0009935764,0.01017304],"category_scores_gemma":[0.008664157,0.0004297888,0.0004410927,0.002585633,0.003615086,0.004921574,0.002077575,0.003815121,0.001552208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001490003,"about_ca_system_score_gemma":0.0006982703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001962531,"about_ca_topic_score_gemma":0.002478222,"domain_scores_codex":[0.9993373,0.0001787539,0.00001657773,0.0001118042,0.0001803587,0.0001752191],"domain_scores_gemma":[0.9952578,0.003517419,0.0002962061,0.0002922944,0.0003409497,0.0002953081],"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.00004827033,0.00002571497,0.0003397932,0.00005356099,0.00000616971,0.00006873204,0.0003352267,0.003427944,0.0007284405,0.9733224,0.003476672,0.01816704],"study_design_scores_gemma":[0.00000891236,0.000005151333,0.0001818944,0.00001531792,0.00000367921,0.00004419891,0.00006206507,0.004105143,0.0001765473,0.9925107,0.002878973,0.00000740298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4390591,0.006562178,0.2102196,0.009412669,0.0008130234,0.00006944435,0.0005850361,0.000441055,0.3328379],"genre_scores_gemma":[0.946195,0.002951562,0.01296459,0.0005370342,0.0009092765,0.00004630688,0.0002507328,0.0001650119,0.03598055],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01017304,"threshold_uncertainty_score":0.03403223,"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","authors":[{"name":"R.P. Anstee","is_ca":true},{"name":"Lajos Rónyai","is_ca":false},{"name":"Attila Sali","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002317351,0.001114449,0.0008362887,0.002311127,0.002113526,0.007649127,0.001512846,0.004598022,0.2016411],"category_scores_gemma":[0.009718227,0.0005083714,0.0007503551,0.00156854,0.001717903,0.005398506,0.003171448,0.006746913,0.1385835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001531502,"about_ca_system_score_gemma":0.001664552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001921275,"about_ca_topic_score_gemma":0.00522432,"domain_scores_codex":[0.9979503,0.0002079498,0.00007740819,0.000249763,0.001180225,0.0003343675],"domain_scores_gemma":[0.9941048,0.001081462,0.0002598494,0.0009332027,0.001999635,0.001620947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002792763,0.000008112495,0.00003432396,0.00003473823,0.000002217072,0.00004169097,0.00001678654,0.00002063734,0.0001284031,0.002572639,0.972973,0.02413952],"study_design_scores_gemma":[0.000005331957,0.00000933197,0.000090248,0.00004136641,0.000001880942,0.00003414486,0.00003857543,0.00003798751,0.00008772742,0.00187907,0.9977711,0.000003231122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.001611647,0.02085772,0.002910004,0.1941888,0.3779455,0.00008311185,0.001236963,0.001816001,0.3993502],"genre_scores_gemma":[0.006640709,0.007200988,0.0009983062,0.0475965,0.05201471,0.00003766713,0.0009244427,0.0006544776,0.8839322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2016411,"threshold_uncertainty_score":0.6745567,"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","authors":[{"name":"Eric Babson","is_ca":false},{"name":"Julian West","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004758956,0.0009359933,0.0005987586,0.002037446,0.002071029,0.00342224,0.0007982141,0.0015114,0.01574915],"category_scores_gemma":[0.001848846,0.0004827609,0.0006673854,0.001390913,0.002342019,0.003638933,0.00136258,0.001829296,0.002469074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000843166,"about_ca_system_score_gemma":0.0007454523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007062693,"about_ca_topic_score_gemma":0.00108831,"domain_scores_codex":[0.9991684,0.0001606114,0.00003740668,0.0001317394,0.0001864288,0.0003154873],"domain_scores_gemma":[0.9990933,0.0002593255,0.0002165804,0.0001183741,0.0001559952,0.000156492],"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.0002707266,0.00008096479,0.0006306377,0.0000681422,0.000024968,0.0007028781,0.0003513005,0.0005927277,0.005759638,0.9662617,0.004733734,0.02052255],"study_design_scores_gemma":[0.0000481006,0.00006564416,0.002366656,0.00002224829,0.00003435425,0.0006560339,0.0006258311,0.001544963,0.007393153,0.9709504,0.01624021,0.00005239107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5951847,0.0004047413,0.06632596,0.002027522,0.0009068863,0.0001683489,0.0007278857,0.0006969992,0.333557],"genre_scores_gemma":[0.9479408,0.0004416508,0.0142392,0.0008288489,0.0002600819,0.0001371457,0.000936106,0.0001717648,0.03504429],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01574915,"threshold_uncertainty_score":0.05268615,"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","authors":[{"name":"Masaaki Harada","is_ca":false},{"name":"W. H. Holzmann","is_ca":true},{"name":"Hadi Kharaghani","is_ca":true},{"name":"M. Khorvash","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006181331,0.0005781193,0.0007049274,0.002372903,0.001677575,0.002633264,0.0008324684,0.001614984,0.005084931],"category_scores_gemma":[0.003741867,0.0004954982,0.0004832507,0.001129016,0.001752499,0.001806643,0.001839499,0.00177805,0.0007987755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009761992,"about_ca_system_score_gemma":0.0007390495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003723169,"about_ca_topic_score_gemma":0.0007201215,"domain_scores_codex":[0.9992525,0.0001956383,0.00004293265,0.0001082947,0.0002341571,0.0001664975],"domain_scores_gemma":[0.9980015,0.0009187529,0.0002808547,0.0003046039,0.0002532696,0.0002409857],"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.0001985314,0.00004361113,0.0004808869,0.00005245068,0.000009649729,0.0002100836,0.000171697,0.003606547,0.006600241,0.9791606,0.001397779,0.008067857],"study_design_scores_gemma":[0.0000668701,0.00005087048,0.000570769,0.00005967707,0.00002641737,0.0007628685,0.0001530596,0.04683028,0.01230524,0.9355597,0.00355917,0.00005518238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.788127,0.0005575526,0.1355765,0.001230322,0.0003410357,0.00009132053,0.0004789364,0.0005546027,0.07304265],"genre_scores_gemma":[0.9670683,0.000205396,0.02231957,0.0002715406,0.000126238,0.00006579679,0.0002380323,0.0001190459,0.009586121],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005084931,"threshold_uncertainty_score":0.01701081,"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","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"László Lipták","is_ca":false},{"name":"Ke Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001400205,0.0002370239,0.0002263441,0.0008575076,0.000651911,0.001097371,0.0006366367,0.0005599124,0.006703746],"category_scores_gemma":[0.001348087,0.0002583993,0.0002350737,0.001306957,0.0005383762,0.0009130647,0.0004332565,0.0004469065,0.0003708864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003729517,"about_ca_system_score_gemma":0.0003878056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001587672,"about_ca_topic_score_gemma":0.002887761,"domain_scores_codex":[0.9998322,0.00003928253,0.00001099297,0.00004349444,0.00003841697,0.00003569805],"domain_scores_gemma":[0.9987202,0.0005609425,0.0002878532,0.0001236736,0.000158794,0.0001485621],"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.0003669283,0.0001518617,0.007310313,0.0002437905,0.00006142974,0.001570129,0.001062405,0.04346445,0.03489069,0.8511183,0.006622273,0.05313744],"study_design_scores_gemma":[0.0001062806,0.0001361727,0.005448713,0.00004734077,0.00008317475,0.00078967,0.0006386099,0.1505935,0.01385778,0.8181422,0.01010863,0.00004777663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9370196,0.0002150864,0.03777853,0.0002176089,0.00004292688,0.00003913256,0.0004616651,0.0002404596,0.023985],"genre_scores_gemma":[0.9893997,0.0001899469,0.006059047,0.00006304078,0.00002901343,0.00003789891,0.00061327,0.00004310585,0.003564856],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006703746,"threshold_uncertainty_score":0.02242625,"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","authors":[{"name":"R.J. Gould","is_ca":false},{"name":"Penny Haxell","is_ca":true},{"name":"Alex Scott","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00217254,0.001300462,0.001546355,0.004252152,0.002523184,0.004229519,0.003042223,0.002228956,0.008631871],"category_scores_gemma":[0.01647673,0.0009259419,0.001124293,0.008806717,0.00538178,0.02091298,0.00324059,0.007846124,0.002129124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002514874,"about_ca_system_score_gemma":0.0008777505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002379193,"about_ca_topic_score_gemma":0.002543482,"domain_scores_codex":[0.9983268,0.000494861,0.0001291344,0.0003757415,0.0005274297,0.0001459397],"domain_scores_gemma":[0.9809301,0.01511644,0.0006103056,0.00147594,0.001161637,0.0007055828],"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.00006559371,0.00004095783,0.000566733,0.000294415,0.00001972384,0.00009724048,0.0003962494,0.003266135,0.0009670152,0.9277214,0.03010309,0.03646155],"study_design_scores_gemma":[0.000005480052,0.00001166328,0.0001923371,0.00005080708,0.00001222052,0.0000446821,0.00007089148,0.00171127,0.0002981886,0.9668267,0.03075754,0.00001820113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07468495,0.1208934,0.3710591,0.07893888,0.02551579,0.0001522507,0.002730413,0.001990153,0.324035],"genre_scores_gemma":[0.572865,0.104828,0.1692111,0.01721475,0.05048506,0.000409633,0.001441898,0.002405836,0.08113865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008631871,"threshold_uncertainty_score":0.02887654,"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)","authors":[{"name":"Saieed Akbari","is_ca":false},{"name":"Akbar Daemi","is_ca":false},{"name":"O. Hatami","is_ca":false},{"name":"Adel Javanmard","is_ca":false},{"name":"Abbas Mehrabian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00163857,0.0008393531,0.001326552,0.002866612,0.003635309,0.005735133,0.002335642,0.001885044,0.007929152],"category_scores_gemma":[0.007558103,0.001050145,0.001007465,0.002718017,0.004884008,0.01149564,0.003261369,0.003670472,0.0006845252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002096032,"about_ca_system_score_gemma":0.0009318171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001270216,"about_ca_topic_score_gemma":0.001577957,"domain_scores_codex":[0.9987746,0.0004296218,0.0000659265,0.0002910573,0.0002091351,0.0002295095],"domain_scores_gemma":[0.9916915,0.005618772,0.0006483485,0.0006979639,0.0003734607,0.0009699801],"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.00005775763,0.00004058699,0.0003686485,0.00006078284,0.000007760787,0.0000280402,0.0001888931,0.002585442,0.0004077225,0.9879853,0.001559614,0.006709344],"study_design_scores_gemma":[0.00001011137,0.000003537252,0.00007597642,0.00001084008,0.000006542614,0.00002971863,0.00007308443,0.005272032,0.0002787514,0.9934167,0.0008163299,0.000006488504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7199883,0.001951618,0.2037822,0.005352996,0.0004139268,0.00009382342,0.0007216074,0.0005955603,0.06710004],"genre_scores_gemma":[0.9406638,0.001116249,0.03755372,0.0005809296,0.0004364863,0.0001229947,0.0005220569,0.0002213911,0.01878258],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007929152,"threshold_uncertainty_score":0.02652562,"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","authors":[{"name":"Erik D. Demaine","is_ca":false},{"name":"Martin L. Demaine","is_ca":false},{"name":"Anna Lubiw","is_ca":true},{"name":"Joseph O’Rourke","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006882607,0.0008960497,0.001073141,0.001835429,0.00122102,0.002027733,0.001590337,0.001256656,0.007998476],"category_scores_gemma":[0.008403333,0.001018515,0.001323477,0.002613927,0.001565231,0.005096577,0.002553735,0.001970136,0.001066089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000827015,"about_ca_system_score_gemma":0.0006473477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001500779,"about_ca_topic_score_gemma":0.003935989,"domain_scores_codex":[0.9991824,0.0001511347,0.00006941036,0.0002277795,0.0002065429,0.0001626656],"domain_scores_gemma":[0.9939569,0.004023727,0.0004077436,0.0009457039,0.0004209041,0.0002450735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004795614,0.0004549255,0.02551404,0.00102417,0.000134828,0.000788272,0.001948405,0.2193011,0.01807421,0.2856834,0.01340625,0.4331909],"study_design_scores_gemma":[0.00003099718,0.0001371457,0.003711721,0.0001493531,0.00009838866,0.0004028979,0.001096112,0.3479375,0.01278682,0.6245835,0.009030603,0.00003492966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4234522,0.0004861953,0.558867,0.0004725828,0.0000874336,0.0001723596,0.001745475,0.001680614,0.01303617],"genre_scores_gemma":[0.5542033,0.0004530547,0.4311099,0.0001434761,0.00004471865,0.0001133091,0.005208351,0.0006493999,0.008074398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007998476,"threshold_uncertainty_score":0.02675754,"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","authors":[{"name":"Justin Colannino","is_ca":true},{"name":"Mirela Damian","is_ca":false},{"name":"Ferrán Hurtado","is_ca":false},{"name":"Stefan Langerman","is_ca":false},{"name":"Henk Meijer","is_ca":true},{"name":"Suneeta Ramaswami","is_ca":false},{"name":"Diane L. Souvaine","is_ca":false},{"name":"Godfried Toussaint","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009020658,0.001157302,0.002683084,0.001305245,0.001726984,0.003842781,0.003649377,0.002476383,0.01107726],"category_scores_gemma":[0.005170639,0.0007383315,0.001123605,0.003884692,0.001256359,0.008936671,0.004392412,0.001747224,0.002964672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001771857,"about_ca_system_score_gemma":0.001873767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002329535,"about_ca_topic_score_gemma":0.003220005,"domain_scores_codex":[0.9979959,0.0004498321,0.0001382918,0.0005025999,0.0004862323,0.0004272834],"domain_scores_gemma":[0.9970635,0.0011484,0.0002518312,0.001092796,0.0002126486,0.0002307933],"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.00224707,0.001067002,0.003232022,0.001203556,0.000336731,0.0003614708,0.0006498168,0.1724087,0.02567092,0.3985629,0.03370548,0.3605544],"study_design_scores_gemma":[0.0003090526,0.0001884556,0.0006724583,0.00004592873,0.0001577418,0.0002497142,0.0003002383,0.3944966,0.009987272,0.5861783,0.007358825,0.00005535076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3407536,0.001420553,0.6011994,0.002803745,0.0003277693,0.0004613357,0.001778106,0.005254494,0.04600111],"genre_scores_gemma":[0.6848574,0.0007422398,0.2938136,0.0005078377,0.0001081286,0.0002525856,0.001532741,0.0004785615,0.017707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01107726,"threshold_uncertainty_score":0.0370571,"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","authors":[{"name":"R. Bruce Richter","is_ca":true},{"name":"Gelasio Salazar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008039323,0.0005392555,0.0003634835,0.002659011,0.001899944,0.002976435,0.0009145527,0.001434094,0.01286422],"category_scores_gemma":[0.004166713,0.0003658539,0.0003814271,0.001862974,0.001605394,0.0021998,0.001185644,0.001410915,0.001318085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001294833,"about_ca_system_score_gemma":0.0005894739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001087749,"about_ca_topic_score_gemma":0.001534778,"domain_scores_codex":[0.9993823,0.0001143906,0.00002325902,0.0001647756,0.0001598608,0.0001554812],"domain_scores_gemma":[0.9980741,0.0009216882,0.0003189109,0.0002035352,0.0001511818,0.0003306448],"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.0004695506,0.0001459065,0.007528991,0.0001548805,0.00004623567,0.000927498,0.0005949527,0.01624531,0.01916803,0.8778635,0.01704541,0.05980978],"study_design_scores_gemma":[0.00004702477,0.0001035074,0.008934655,0.00009179403,0.00005923323,0.002080075,0.0005947865,0.07263006,0.01803857,0.8696126,0.0277303,0.00007740684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8092224,0.0005101474,0.04156924,0.001497261,0.0004278773,0.00006175578,0.0008792703,0.0005500145,0.1452821],"genre_scores_gemma":[0.9717727,0.000276639,0.01261654,0.0002279378,0.00007881558,0.00005583656,0.0005371622,0.0002438106,0.01419069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01286422,"threshold_uncertainty_score":0.04303515,"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","authors":[{"name":"Michael O. Albertson","is_ca":false},{"name":"Bojan Mohar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003068296,0.0005289947,0.0006168293,0.0009107283,0.001241374,0.002701468,0.001165094,0.0008831481,0.005839714],"category_scores_gemma":[0.00230767,0.0006838841,0.0004213879,0.001124849,0.001550725,0.002366499,0.001354427,0.001790294,0.0007048344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001087888,"about_ca_system_score_gemma":0.0005487799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00310566,"about_ca_topic_score_gemma":0.005269891,"domain_scores_codex":[0.9996046,0.00009529736,0.00001494673,0.00007680096,0.00009433661,0.0001140219],"domain_scores_gemma":[0.9984981,0.0009095607,0.0001477893,0.0001521488,0.0001186863,0.0001737155],"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.0004278618,0.0001293782,0.003160414,0.0002360218,0.00003567595,0.0004272397,0.001458831,0.0240971,0.01524025,0.8680017,0.008711936,0.07807356],"study_design_scores_gemma":[0.00004489038,0.00003898894,0.001232994,0.0000275579,0.00003582599,0.0001912219,0.0006691218,0.02249989,0.004308131,0.9643676,0.006561289,0.00002256967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7783998,0.001087644,0.1595793,0.00133884,0.0002570264,0.00009327113,0.0004272123,0.0005963256,0.05822073],"genre_scores_gemma":[0.9085582,0.001052402,0.06025016,0.0003369688,0.0002065544,0.0001184176,0.000734016,0.0002812654,0.02846202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005839714,"threshold_uncertainty_score":0.01953578,"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","authors":[{"name":"Zhicheng Gao","is_ca":true},{"name":"Jorge Urrutia","is_ca":true},{"name":"Jianyu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005240329,0.0004413244,0.0005812697,0.00195668,0.00199349,0.002204535,0.00116284,0.001660351,0.01629534],"category_scores_gemma":[0.003963072,0.0007946384,0.0006083606,0.001742829,0.002581486,0.002708986,0.002771751,0.002024889,0.00213747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009881147,"about_ca_system_score_gemma":0.0005232241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002527993,"about_ca_topic_score_gemma":0.00438018,"domain_scores_codex":[0.9994037,0.0001220578,0.00003308765,0.00009812947,0.0001587854,0.0001841804],"domain_scores_gemma":[0.9978449,0.000864603,0.0003568434,0.0003315489,0.0002783483,0.0003236944],"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.0002471092,0.00008481105,0.0009761986,0.0001345727,0.00001121439,0.0004604716,0.000793208,0.007461544,0.006116476,0.9463218,0.004592687,0.03279997],"study_design_scores_gemma":[0.00006524521,0.00004837924,0.0006605814,0.00006792139,0.00002176489,0.0002285663,0.0007404393,0.0225517,0.003428985,0.9658431,0.006314776,0.00002865992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7179055,0.0005424658,0.1849305,0.0009688004,0.0004107106,0.0002173967,0.0007876847,0.00121605,0.09302094],"genre_scores_gemma":[0.9152832,0.0005169685,0.04483963,0.0002837582,0.00008114884,0.0001515314,0.0006755658,0.0004685442,0.03769959],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01629534,"threshold_uncertainty_score":0.05451334,"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","authors":[{"name":"Andrei Gagarin","is_ca":true},{"name":"Anush Poghosyan","is_ca":false},{"name":"Vadim Zverovich","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01098065,0.006640374,0.005231394,0.01076421,0.004778838,0.01686341,0.01490359,0.006322723,0.03895318],"category_scores_gemma":[0.06795885,0.003933148,0.003339399,0.01326948,0.006594465,0.03697645,0.0132472,0.02246991,0.0119621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009647615,"about_ca_system_score_gemma":0.003388788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001671512,"about_ca_topic_score_gemma":0.003050998,"domain_scores_codex":[0.9874213,0.002222014,0.000685525,0.002695347,0.0037133,0.003262554],"domain_scores_gemma":[0.8831928,0.08873212,0.003917854,0.01374308,0.005057761,0.005356397],"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.0009488725,0.0005335372,0.003857511,0.001217648,0.0002742648,0.0002481508,0.001001799,0.04573829,0.00828033,0.8178604,0.02867341,0.09136587],"study_design_scores_gemma":[0.00005578819,0.00005057063,0.0008196686,0.0003172987,0.0001559375,0.0003402677,0.0001769111,0.03674112,0.004161368,0.9430205,0.01405765,0.0001028563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06392266,0.0237572,0.5899647,0.0127104,0.00120016,0.0005269431,0.004968071,0.004643205,0.2983067],"genre_scores_gemma":[0.7493742,0.02249722,0.1566547,0.00537093,0.003593606,0.001858432,0.004999571,0.00440777,0.05124359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03895318,"threshold_uncertainty_score":0.1303114,"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","authors":[{"name":"Ross Churchley","is_ca":true},{"name":"Jing Huang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002167209,0.001646694,0.002221383,0.001620019,0.002392242,0.004953372,0.003671994,0.004500977,0.01604763],"category_scores_gemma":[0.01646801,0.001635208,0.00247579,0.002989167,0.003287216,0.01055424,0.004904749,0.005245864,0.001711057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001798296,"about_ca_system_score_gemma":0.001700702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003477166,"about_ca_topic_score_gemma":0.005212413,"domain_scores_codex":[0.997802,0.0008054225,0.0001044886,0.0004619761,0.0003197466,0.000506519],"domain_scores_gemma":[0.9903868,0.007389697,0.0004083984,0.000982931,0.000327832,0.0005043595],"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.001922672,0.001294225,0.002498737,0.001532466,0.0002987811,0.0005111366,0.001497403,0.3569999,0.007574189,0.437564,0.03483465,0.1534719],"study_design_scores_gemma":[0.0002639975,0.0001385628,0.0002807852,0.00008172516,0.00008923579,0.0001222375,0.0004824105,0.2073112,0.002465416,0.7845221,0.004209066,0.00003328709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3946652,0.001348445,0.5475037,0.004370261,0.0004695973,0.0006054672,0.001327791,0.001636605,0.04807305],"genre_scores_gemma":[0.659429,0.0008053171,0.3152454,0.0009126048,0.0003143326,0.0004328823,0.002619174,0.0009447329,0.01929649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01604763,"threshold_uncertainty_score":0.05368465,"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","authors":[{"name":"Tomer Kotek","is_ca":false},{"name":"James Preen","is_ca":true},{"name":"Peter Tittmann","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005407796,0.0005394652,0.0005818379,0.001922074,0.001084715,0.0027484,0.000988256,0.0006564804,0.01131645],"category_scores_gemma":[0.001976541,0.0003430527,0.0005136119,0.001948333,0.001480435,0.003415201,0.001578393,0.001931606,0.001257786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008792593,"about_ca_system_score_gemma":0.0003749738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005552711,"about_ca_topic_score_gemma":0.0008644917,"domain_scores_codex":[0.999585,0.00008600465,0.00001606457,0.00007176336,0.0001525425,0.00008862285],"domain_scores_gemma":[0.9992298,0.0003156975,0.0001037066,0.0001215145,0.0001227225,0.0001065171],"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.0000256427,0.00001702391,0.0001159259,0.00001973813,0.00000366524,0.00003832769,0.0002044228,0.000926387,0.0007917203,0.9860508,0.001159738,0.01064661],"study_design_scores_gemma":[0.000006244559,0.000006732136,0.0001143776,0.0000076771,0.000004772739,0.0000710474,0.00006326503,0.006098034,0.0004610948,0.9910083,0.002151374,0.000007082919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4666554,0.0008716585,0.3410322,0.001736155,0.0003305686,0.00007236941,0.0007260729,0.000602123,0.1879734],"genre_scores_gemma":[0.945267,0.000638087,0.02162733,0.0002818694,0.0004019543,0.00007671565,0.0004247894,0.0002052676,0.03107706],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01131645,"threshold_uncertainty_score":0.03785729,"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","authors":[{"name":"Julien Bensmail","is_ca":false},{"name":"Christopher Duffy","is_ca":true},{"name":"Sagnik Sen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309704,0.0006583228,0.0006609197,0.001433465,0.002141095,0.004286134,0.001969061,0.001537651,0.01167356],"category_scores_gemma":[0.005417611,0.0009325329,0.001581314,0.001180459,0.002422688,0.003500235,0.002553618,0.002982406,0.0008266502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001322958,"about_ca_system_score_gemma":0.0005973576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001317006,"about_ca_topic_score_gemma":0.002192552,"domain_scores_codex":[0.9984832,0.0005476291,0.00007191564,0.0004103998,0.0002529575,0.0002338861],"domain_scores_gemma":[0.9959235,0.001691384,0.0007719557,0.0005933801,0.0002986096,0.0007211844],"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.00006614937,0.00003304406,0.0002437416,0.00004281327,0.000009170491,0.0001159069,0.0001813991,0.0008537875,0.001498785,0.9931108,0.001385326,0.002459122],"study_design_scores_gemma":[0.00006743769,0.00004086435,0.0009161831,0.00003989805,0.00002817295,0.0003459344,0.000179027,0.01349965,0.001264063,0.9748359,0.008754766,0.00002799559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4311965,0.0009010226,0.3180082,0.002236337,0.0008783033,0.0003299233,0.001167286,0.0006243028,0.2446581],"genre_scores_gemma":[0.8823501,0.0003904538,0.08841476,0.0006009603,0.0003927664,0.0002843682,0.0007927099,0.0002823757,0.02649139],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01167356,"threshold_uncertainty_score":0.03905201,"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)","authors":[{"name":"Qing Cui","is_ca":false},{"name":"Penny Haxell","is_ca":true},{"name":"Will Ma","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004282213,0.0006165237,0.00100422,0.001548448,0.001295817,0.002576202,0.001338862,0.001832365,0.00853193],"category_scores_gemma":[0.006068002,0.0009771786,0.0009581822,0.003317034,0.0021563,0.004143886,0.002679208,0.001633811,0.0009652178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006295189,"about_ca_system_score_gemma":0.0003207459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001689868,"about_ca_topic_score_gemma":0.001396712,"domain_scores_codex":[0.9992812,0.0001832327,0.00004040819,0.0001422332,0.0002263259,0.0001266597],"domain_scores_gemma":[0.997419,0.001519515,0.0003026467,0.0004610491,0.0001315339,0.000166328],"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.0002638138,0.000121029,0.002303213,0.0003184977,0.0000299947,0.0005282682,0.001121346,0.09948125,0.004644621,0.7545179,0.008696808,0.1279732],"study_design_scores_gemma":[0.00003377694,0.00005215156,0.0008719196,0.00005733992,0.0000270892,0.0004991525,0.0003812376,0.1610328,0.003182856,0.8248292,0.009012619,0.00001987197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4504729,0.002483251,0.4927878,0.001230853,0.0003059687,0.0001285598,0.0005554401,0.000756726,0.05127845],"genre_scores_gemma":[0.8553475,0.00177182,0.1231309,0.0002381893,0.000248905,0.0001080533,0.001089578,0.0004278172,0.01763726],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00853193,"threshold_uncertainty_score":0.02854216,"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","authors":[{"name":"L. Sunil Chandran","is_ca":false},{"name":"Alexandr Kostochka","is_ca":false},{"name":"J. Krishnam Raju","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199638,0.0006202071,0.0009400912,0.003707961,0.00203908,0.004274392,0.001339,0.001240876,0.004946979],"category_scores_gemma":[0.004972394,0.0006097619,0.0005897105,0.002601302,0.007200613,0.008716781,0.00263696,0.002474363,0.0006067216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001833567,"about_ca_system_score_gemma":0.000832568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001272661,"about_ca_topic_score_gemma":0.0008811384,"domain_scores_codex":[0.9989322,0.0003606993,0.0000605854,0.0002362408,0.0002427017,0.0001675801],"domain_scores_gemma":[0.9969234,0.001527106,0.0003808078,0.0003038124,0.0003426445,0.0005222911],"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.00001041109,0.000004507095,0.00009105367,0.000008520722,0.000001515362,0.00001603057,0.0001004486,0.0002452242,0.00007373737,0.9980855,0.0002634833,0.001099491],"study_design_scores_gemma":[0.0000040666,0.00000402002,0.00006830623,0.000004934708,0.00000184497,0.00003084711,0.00003595625,0.0005346809,0.00008345662,0.9981976,0.001029622,0.000004708956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6952358,0.005481063,0.09964805,0.00490083,0.0007839208,0.00005234768,0.0003225961,0.0003141565,0.1932613],"genre_scores_gemma":[0.9716023,0.001104488,0.01210321,0.0002950435,0.0003845782,0.00004177669,0.0001389448,0.00004665952,0.01428308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004946979,"threshold_uncertainty_score":0.01654929,"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","authors":[{"name":"Marco Buratti","is_ca":false},{"name":"Peter Danziger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006018801,0.0005982989,0.0006579066,0.0009150896,0.001963332,0.001891645,0.001644715,0.00297005,0.01449788],"category_scores_gemma":[0.005493735,0.0004495686,0.0007974861,0.00128965,0.00177872,0.002028492,0.001777379,0.002628563,0.0006500153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001366247,"about_ca_system_score_gemma":0.001701697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003939308,"about_ca_topic_score_gemma":0.004763728,"domain_scores_codex":[0.9995407,0.0001345774,0.00001826078,0.000080784,0.00009700711,0.0001287105],"domain_scores_gemma":[0.9980468,0.0011938,0.0001645146,0.000163663,0.0001773339,0.0002538982],"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.00004828713,0.0000439521,0.0002057037,0.00007966639,0.0000198046,0.0001165428,0.0001553128,0.01111542,0.0008247996,0.9700631,0.008734544,0.008592913],"study_design_scores_gemma":[0.0000492636,0.00001750778,0.0001368508,0.00002545031,0.000009422713,0.000067128,0.00008991872,0.05961161,0.0003280684,0.9355957,0.004054197,0.00001493469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4301299,0.00168733,0.3094713,0.009817546,0.0006302485,0.0002533188,0.0008135948,0.0003953545,0.2468014],"genre_scores_gemma":[0.8743215,0.001014423,0.06221865,0.001441105,0.0005781068,0.000346396,0.0008617,0.0001815913,0.05903662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01449788,"threshold_uncertainty_score":0.04850024,"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)","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002620284,0.0007537909,0.001194202,0.001376261,0.001888527,0.001950127,0.001264535,0.001194068,0.01233191],"category_scores_gemma":[0.001824736,0.0007896748,0.0009438355,0.002235013,0.001533723,0.002611321,0.002475576,0.00172524,0.002257183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004424881,"about_ca_system_score_gemma":0.0002928438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005922714,"about_ca_topic_score_gemma":0.0008291352,"domain_scores_codex":[0.9994522,0.00006849619,0.00003488908,0.0001507866,0.0002041477,0.00008952581],"domain_scores_gemma":[0.9986238,0.0004381602,0.0001471611,0.000412993,0.0002410605,0.0001368437],"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.0008515045,0.0003255975,0.01116613,0.0009108707,0.0002330434,0.003982944,0.0008530371,0.1051455,0.04212085,0.5936894,0.02554949,0.2151716],"study_design_scores_gemma":[0.000108084,0.0001936554,0.005053789,0.0001532847,0.0001208107,0.002865111,0.001755805,0.1573362,0.03034638,0.7536691,0.04829067,0.0001069946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3894091,0.0004329241,0.5279174,0.00107694,0.0003506766,0.0002353992,0.001835185,0.001037134,0.07770537],"genre_scores_gemma":[0.7570682,0.0004254487,0.2078787,0.0003899835,0.0001121296,0.0002457616,0.003589167,0.0005952638,0.0296954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01233191,"threshold_uncertainty_score":0.04125434,"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","authors":[{"name":"Mario Gionfriddo","is_ca":false},{"name":"Peter Horák","is_ca":false},{"name":"Lorenzo Milazzo","is_ca":false},{"name":"A. Rosa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008026758,0.00055956,0.000921406,0.001263489,0.001657641,0.002205349,0.00101993,0.001096439,0.0126486],"category_scores_gemma":[0.003539294,0.0006132208,0.0005623483,0.001912433,0.001323829,0.004288896,0.002387509,0.001919753,0.001141671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086638,"about_ca_system_score_gemma":0.0006146023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008221869,"about_ca_topic_score_gemma":0.001785038,"domain_scores_codex":[0.9991295,0.00020849,0.0000606616,0.0001474436,0.0002090943,0.0002448207],"domain_scores_gemma":[0.9974012,0.001071798,0.0002529901,0.0006948577,0.0003072411,0.0002718602],"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.0002676235,0.00009804651,0.0007033041,0.000135795,0.00002166203,0.0003126195,0.0006052903,0.01362073,0.01063234,0.9323165,0.00348657,0.03779952],"study_design_scores_gemma":[0.00003443297,0.00004576521,0.0003841085,0.00002947385,0.00002771092,0.0002581714,0.0002480023,0.03182347,0.005555363,0.9550305,0.006544158,0.00001879318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4958217,0.0003297944,0.4280171,0.0005870828,0.0001220665,0.0001758308,0.0005784198,0.0005877416,0.07378025],"genre_scores_gemma":[0.9084036,0.0003576417,0.0689868,0.0002320652,0.00007004511,0.0001526639,0.000726155,0.000341928,0.02072896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0126486,"threshold_uncertainty_score":0.04231381,"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)","authors":[{"name":"Charles J. Colbourn","is_ca":false},{"name":"A. Rosa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000633388,0.0005591393,0.0009552144,0.0017358,0.001673729,0.003005293,0.001108558,0.001063433,0.0077487],"category_scores_gemma":[0.002850941,0.0007249456,0.0006337358,0.002337253,0.00186635,0.003839869,0.001567652,0.002094707,0.0006909947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001676101,"about_ca_system_score_gemma":0.0006030106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002055314,"about_ca_topic_score_gemma":0.003358868,"domain_scores_codex":[0.9994335,0.0001284272,0.00003226307,0.0001204221,0.0001152769,0.0001700108],"domain_scores_gemma":[0.9972024,0.001313268,0.000453154,0.000460935,0.0002119182,0.0003582594],"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.0002152173,0.00004502881,0.001212762,0.00007151554,0.00001784718,0.0001904239,0.0005358734,0.01016948,0.007036961,0.9658942,0.002320074,0.01229054],"study_design_scores_gemma":[0.00002848448,0.00002599465,0.00100593,0.0000196981,0.00002387702,0.0002021927,0.0001784547,0.03178143,0.002765918,0.961171,0.002776675,0.00002029867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7996196,0.0007209514,0.1316782,0.0006843778,0.0001151902,0.00006268377,0.000442843,0.0002668578,0.06640924],"genre_scores_gemma":[0.9703782,0.0004568622,0.0179511,0.0001559969,0.0000883813,0.0000558492,0.000386652,0.0001350682,0.01039194],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0077487,"threshold_uncertainty_score":0.02592194,"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","authors":[{"name":"Margaret-Ellen Messinger","is_ca":true},{"name":"Richard J. Nowakowski","is_ca":true},{"name":"Paweł Prałat","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001905281,0.00117741,0.001503635,0.0034191,0.00496698,0.005111985,0.002519408,0.003589962,0.07163704],"category_scores_gemma":[0.01686809,0.001327049,0.001980334,0.002321079,0.003285298,0.01116785,0.007485362,0.004233505,0.02127281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008659711,"about_ca_system_score_gemma":0.001210727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002209785,"about_ca_topic_score_gemma":0.002948615,"domain_scores_codex":[0.9966303,0.0007136046,0.0001712419,0.0009663415,0.0009181321,0.0006004284],"domain_scores_gemma":[0.9910682,0.001656722,0.0003057771,0.005542041,0.001063008,0.0003641844],"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.0006614121,0.0002315786,0.002407976,0.0006225239,0.0002063169,0.0009903754,0.002096652,0.006761011,0.01125995,0.4571223,0.1599105,0.3577294],"study_design_scores_gemma":[0.00004625367,0.00009148389,0.001029178,0.0003090588,0.0001112102,0.0007829426,0.001662243,0.01696909,0.01215601,0.5530996,0.4136361,0.0001067264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05483454,0.003130263,0.5990602,0.0123955,0.004876429,0.0006072142,0.002706986,0.0169233,0.3054656],"genre_scores_gemma":[0.3787227,0.001738572,0.3506456,0.005597803,0.000961536,0.0004430172,0.00516193,0.01010359,0.2466252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07163704,"threshold_uncertainty_score":0.2396498,"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","authors":[{"name":"Dan Hefetz","is_ca":false},{"name":"Michael Krivelevich","is_ca":false},{"name":"Miloš Stojaković","is_ca":false},{"name":"Tibor Szabó","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003351054,0.001482198,0.002714127,0.001694102,0.002379663,0.004901634,0.003306265,0.00267308,0.009024154],"category_scores_gemma":[0.01677452,0.001343696,0.001472258,0.00154759,0.00229521,0.007122329,0.003830953,0.004807598,0.001419288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001864241,"about_ca_system_score_gemma":0.002473418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003364586,"about_ca_topic_score_gemma":0.005281482,"domain_scores_codex":[0.9970811,0.000797583,0.0001601483,0.000405273,0.0007546137,0.0008013112],"domain_scores_gemma":[0.9849258,0.0107942,0.0009288835,0.001211739,0.0007273431,0.00141203],"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.001237358,0.0003655812,0.002517706,0.0002866384,0.0001159336,0.0004659152,0.0009546411,0.0449893,0.006534694,0.8970454,0.005811022,0.03967577],"study_design_scores_gemma":[0.000191624,0.00008369821,0.0004193398,0.00002215207,0.00004814192,0.0001346683,0.0001520401,0.1275551,0.001379002,0.8687814,0.001201484,0.00003139652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.577843,0.0003973782,0.3781675,0.001471305,0.0001290936,0.0002645663,0.000374919,0.001073094,0.04027906],"genre_scores_gemma":[0.9240576,0.0003045607,0.05286359,0.0002520588,0.00007045832,0.0002284339,0.0003875958,0.0003322473,0.02150343],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009024154,"threshold_uncertainty_score":0.03018874,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007838361,0.001434843,0.001955841,0.001166451,0.002684954,0.00390542,0.002629377,0.003334803,0.01097611],"category_scores_gemma":[0.004626208,0.0006170092,0.001460106,0.001763087,0.004192444,0.008940794,0.004066376,0.005233961,0.001555476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002091942,"about_ca_system_score_gemma":0.0008971244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005795777,"about_ca_topic_score_gemma":0.006926961,"domain_scores_codex":[0.9990724,0.0003016655,0.00004042781,0.0001995982,0.000240458,0.000145497],"domain_scores_gemma":[0.998338,0.00112719,0.00007152293,0.0001463413,0.000110524,0.0002063337],"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.0000694815,0.00004659547,0.0001678789,0.0001355935,0.00002734801,0.0003620762,0.0002690057,0.01298879,0.001246038,0.9595374,0.01545974,0.009690054],"study_design_scores_gemma":[0.00001667811,0.00002954567,0.0001721471,0.00003635888,0.00001640556,0.00008435847,0.0001585361,0.0159363,0.0003129802,0.9650272,0.01817889,0.00003052582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1354989,0.008088638,0.2922118,0.02979128,0.01039482,0.000203336,0.0005946542,0.0004054593,0.5228111],"genre_scores_gemma":[0.7464399,0.01000113,0.07331722,0.003645685,0.006153095,0.000276518,0.000517638,0.0005224482,0.1591264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01097611,"threshold_uncertainty_score":0.03671873,"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","authors":[{"name":"Hadi Kharaghani","is_ca":true},{"name":"R. Torabi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005877696,0.00104259,0.0008232296,0.001976948,0.001332956,0.00270229,0.0009175009,0.0009065056,0.008995799],"category_scores_gemma":[0.001967913,0.0006557588,0.001238663,0.001834876,0.001776078,0.003746615,0.002022743,0.002272278,0.001164227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001109612,"about_ca_system_score_gemma":0.0005445959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001802482,"about_ca_topic_score_gemma":0.002590256,"domain_scores_codex":[0.9995167,0.0001327171,0.00002200419,0.0001182718,0.0001088304,0.000101433],"domain_scores_gemma":[0.9986845,0.0005110375,0.0001371422,0.0002229568,0.000213178,0.0002312217],"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.00005753459,0.00003924906,0.000226896,0.00008012637,0.00001791225,0.00009399893,0.0003290023,0.004907112,0.001350832,0.973349,0.004935303,0.01461309],"study_design_scores_gemma":[0.0000107777,0.000009443685,0.0001742459,0.00003942652,0.00001251473,0.00005845625,0.0001203904,0.009687909,0.0002387672,0.9833015,0.006341557,0.000005005913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.244858,0.001876887,0.5841509,0.002225752,0.0003487001,0.0002154093,0.001574775,0.0003471946,0.1644025],"genre_scores_gemma":[0.6451322,0.002885264,0.2622984,0.0009964789,0.0004126139,0.0002707201,0.004250806,0.0005017908,0.08325175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008995799,"threshold_uncertainty_score":0.03009397,"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","authors":[{"name":"Ben Cameron","is_ca":true},{"name":"Chı́nh T. Hoàng","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000572843,0.0006617123,0.0005273238,0.002676407,0.003612244,0.002860888,0.001790082,0.0009910756,0.008420706],"category_scores_gemma":[0.004207753,0.0008056639,0.0006797992,0.001166379,0.002222929,0.002755201,0.001912501,0.001553073,0.0006347501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001939571,"about_ca_system_score_gemma":0.0007584181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001836916,"about_ca_topic_score_gemma":0.002740589,"domain_scores_codex":[0.9993938,0.0001078239,0.00002698845,0.0001488555,0.0001357254,0.000186805],"domain_scores_gemma":[0.9962457,0.002163433,0.0002831967,0.0002383196,0.0004183466,0.0006508758],"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.00028914,0.000061215,0.003263698,0.000179425,0.00003740563,0.001284284,0.001431464,0.003957558,0.006031704,0.9690449,0.00613556,0.008283551],"study_design_scores_gemma":[0.00007593908,0.0000378574,0.002942899,0.0001446387,0.00007813647,0.00143107,0.0008673,0.0207113,0.005516649,0.9560071,0.01212536,0.00006187845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8701472,0.0008512231,0.05320136,0.001285652,0.0001061224,0.00006553673,0.0007892076,0.0006283626,0.07292534],"genre_scores_gemma":[0.9806157,0.0002560452,0.006599514,0.0002054473,0.00004304981,0.00008547454,0.0009173972,0.0001697153,0.01110767],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008420706,"threshold_uncertainty_score":0.02817005,"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","authors":[{"name":"Xinmin Hou","is_ca":false},{"name":"Michelle Edwards","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003872904,0.0004486281,0.0004944045,0.002171708,0.002186132,0.002176376,0.0009619403,0.0007874475,0.01260521],"category_scores_gemma":[0.002591842,0.0004681509,0.0003052854,0.001077313,0.001290216,0.00236333,0.001772574,0.001587114,0.0007412059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008398464,"about_ca_system_score_gemma":0.0005052966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004570076,"about_ca_topic_score_gemma":0.0008868864,"domain_scores_codex":[0.9996125,0.00008174096,0.000011808,0.00008921781,0.0001001954,0.0001045186],"domain_scores_gemma":[0.9978382,0.0008590031,0.0002035974,0.0002265262,0.0003824531,0.0004901917],"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.0001082366,0.0000367359,0.001005836,0.00006462913,0.00001555169,0.0003245388,0.0002609457,0.001091616,0.003582391,0.977776,0.00418896,0.01154462],"study_design_scores_gemma":[0.00005724563,0.00003458188,0.0007129065,0.00004324937,0.00003287892,0.0006055384,0.0003389778,0.007858435,0.004704959,0.9750636,0.0105301,0.00001735326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6696019,0.0008141309,0.1249119,0.001355986,0.0003752316,0.0002331107,0.0006046371,0.000555044,0.2015481],"genre_scores_gemma":[0.9588329,0.0002229978,0.01565836,0.00030728,0.0001075904,0.0001130765,0.0004024914,0.00008705287,0.0242683],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01260521,"threshold_uncertainty_score":0.04216868,"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)","authors":[{"name":"Iain Beaton","is_ca":true},{"name":"Jason I. Brown","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002223957,0.0006009277,0.001115653,0.003091346,0.001948937,0.00361478,0.001634929,0.001046267,0.009929216],"category_scores_gemma":[0.01555233,0.0006904642,0.0006667837,0.003431888,0.005320292,0.007426035,0.002687934,0.004839261,0.0008157778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002065005,"about_ca_system_score_gemma":0.000867246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002452854,"about_ca_topic_score_gemma":0.002191573,"domain_scores_codex":[0.998665,0.0004151143,0.00004514937,0.0002891083,0.0002960594,0.0002895716],"domain_scores_gemma":[0.9809498,0.01523279,0.0009328388,0.0008273571,0.001109705,0.0009474349],"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.00007067242,0.0000399503,0.0005942207,0.00006035244,0.000009831026,0.00006107755,0.0003510196,0.002275016,0.0007969738,0.9823226,0.00180757,0.01161067],"study_design_scores_gemma":[0.00000780817,0.000007213186,0.0002740507,0.00001192113,0.000005729373,0.00005475221,0.00006486812,0.005766654,0.0001949249,0.9927062,0.0008962952,0.000009582732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5856719,0.004204774,0.2330974,0.008174653,0.0003441641,0.00005353815,0.0007460876,0.0003287719,0.1673787],"genre_scores_gemma":[0.9725945,0.001763077,0.01016457,0.0005997079,0.0006672047,0.0000429113,0.0002640477,0.0001162642,0.01378763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009929216,"threshold_uncertainty_score":0.03321654,"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","authors":[{"name":"Anthony Bonato","is_ca":true},{"name":"Karen Gunderson","is_ca":true},{"name":"Amy Shaw","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003886107,0.0003953117,0.0005650138,0.001113289,0.002358042,0.003803649,0.0006625888,0.001598621,0.02895087],"category_scores_gemma":[0.002175004,0.0002713512,0.0004278127,0.0008480989,0.004285432,0.006466512,0.00242973,0.00281173,0.004321747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001180216,"about_ca_system_score_gemma":0.0005454182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00113303,"about_ca_topic_score_gemma":0.0009915465,"domain_scores_codex":[0.9996428,0.00007735624,0.000009808816,0.00009973421,0.00009435182,0.00007586807],"domain_scores_gemma":[0.9995432,0.0001018742,0.00003992946,0.0001555283,0.00007799444,0.00008147497],"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.00002885058,0.00000591869,0.00006551114,0.00001830883,0.000004060542,0.00002430595,0.0001543732,0.0004292196,0.0003947686,0.9860507,0.006322228,0.006501817],"study_design_scores_gemma":[0.00001143908,0.000009810223,0.000106013,0.00003279297,0.000004697203,0.00008372109,0.0003812019,0.001121007,0.0003437095,0.9352564,0.06264235,0.000006886114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.09516549,0.008241765,0.05539479,0.01919576,0.002752366,0.00005138815,0.0005181577,0.0003922656,0.8182879],"genre_scores_gemma":[0.7971517,0.004722296,0.01517866,0.00421506,0.0008340325,0.00007628122,0.0003674621,0.0004467233,0.1770078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02895087,"threshold_uncertainty_score":0.09685034,"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","authors":[{"name":"H. -D. O. F. Gronau","is_ca":false},{"name":"R. C. Mullin","is_ca":true},{"name":"A. Rosa","is_ca":true},{"name":"P. J. Schellenberg","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008173076,0.0008442139,0.0006173089,0.001440913,0.001239242,0.002216499,0.0009571324,0.00114989,0.02636871],"category_scores_gemma":[0.002867521,0.000532866,0.0007167195,0.001118843,0.001128155,0.002839461,0.001584339,0.001155609,0.005577838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009684524,"about_ca_system_score_gemma":0.001151068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003894332,"about_ca_topic_score_gemma":0.0007176528,"domain_scores_codex":[0.9984977,0.0004481135,0.00006542795,0.0004062773,0.0003843526,0.0001980909],"domain_scores_gemma":[0.9978357,0.0005232389,0.0002129359,0.0007521251,0.0004866674,0.0001893442],"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.00005314596,0.00004694012,0.0001222808,0.00005522907,0.00001219949,0.00004926846,0.00007165852,0.00133733,0.00288077,0.9665359,0.004234263,0.02460099],"study_design_scores_gemma":[0.00004768824,0.00006820817,0.0001367947,0.00003087647,0.00002939355,0.0002120493,0.00008494702,0.008860822,0.004896888,0.9573888,0.02822594,0.00001761072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1126164,0.0005867748,0.5988878,0.001197328,0.0007059869,0.0005324375,0.001255564,0.001120897,0.2830968],"genre_scores_gemma":[0.699192,0.000968925,0.1513863,0.001250747,0.0004100054,0.000608546,0.00152265,0.000446305,0.1442146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02636871,"threshold_uncertainty_score":0.08821213,"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","authors":[{"name":"Snježana Majstorović","is_ca":false},{"name":"Gilles Caporossi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004688121,0.001065793,0.001529853,0.006277656,0.00209688,0.006394695,0.004472616,0.002265787,0.007167954],"category_scores_gemma":[0.06220528,0.001067587,0.0008750003,0.006560047,0.005896455,0.01254834,0.003219779,0.005414683,0.0007794697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002652716,"about_ca_system_score_gemma":0.0008944175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002817646,"about_ca_topic_score_gemma":0.003583679,"domain_scores_codex":[0.9959975,0.001431492,0.0001534356,0.001020469,0.0008092789,0.0005878484],"domain_scores_gemma":[0.8878871,0.09052742,0.007252944,0.005556843,0.004406763,0.004368961],"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.0001446543,0.00006611208,0.003388135,0.0001603643,0.00007546657,0.0001566786,0.000681064,0.02386464,0.003000907,0.9571759,0.002033768,0.009252389],"study_design_scores_gemma":[0.00001681216,0.00003216664,0.002163511,0.00004663496,0.00007085151,0.0001716183,0.0001914977,0.06018116,0.0008749565,0.9344057,0.00178836,0.00005655853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4961295,0.005571716,0.4428986,0.003099786,0.0003865825,0.00006314502,0.0007870098,0.0004388058,0.05062479],"genre_scores_gemma":[0.9599195,0.001310885,0.03266765,0.0003593299,0.0005914517,0.00008631833,0.0003343834,0.0002915767,0.00443887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007167954,"threshold_uncertainty_score":0.02479351,"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","authors":[{"name":"David Avis","is_ca":true},{"name":"Naoki Katoh","is_ca":false},{"name":"Makoto Ohsaki","is_ca":false},{"name":"Ileana Streinu","is_ca":false},{"name":"Shin‐ichi Tanigawa","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136174,0.00153713,0.001573402,0.003228728,0.002981804,0.003710165,0.003758226,0.002566434,0.01435306],"category_scores_gemma":[0.01123743,0.001288858,0.001899551,0.00412786,0.002617592,0.008843374,0.004922819,0.004220271,0.001298607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001633293,"about_ca_system_score_gemma":0.0013677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002240979,"about_ca_topic_score_gemma":0.00644003,"domain_scores_codex":[0.9983554,0.0004027786,0.00009294518,0.0003804418,0.000425842,0.0003425122],"domain_scores_gemma":[0.9936796,0.004234971,0.0004071378,0.0009885399,0.000383749,0.0003058583],"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.0001225071,0.0001217672,0.001224176,0.0003101959,0.00004210812,0.0001543139,0.0004532409,0.04617897,0.001869335,0.8863024,0.005451961,0.05776908],"study_design_scores_gemma":[0.00001172552,0.00001814874,0.0001926607,0.0000442165,0.00002761114,0.00009958795,0.0001819286,0.04790393,0.0009791331,0.9475403,0.002984371,0.00001634924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2721722,0.000944457,0.6624035,0.001527733,0.000135364,0.0001991852,0.001670836,0.002112919,0.05883373],"genre_scores_gemma":[0.7276518,0.0006353564,0.2533118,0.0003225594,0.00007769278,0.0002125175,0.002703921,0.0008352084,0.01424918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01435306,"threshold_uncertainty_score":0.04801577,"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","authors":[{"name":"Bert L. Hartnell","is_ca":true},{"name":"Douglas F. Rall","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002057898,0.001413639,0.001877441,0.004834688,0.004751352,0.007719947,0.002893795,0.002720253,0.004350634],"category_scores_gemma":[0.01018823,0.001404311,0.001626274,0.004997177,0.009412052,0.01426556,0.005473885,0.003734237,0.0007895462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003099934,"about_ca_system_score_gemma":0.001208742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001668123,"about_ca_topic_score_gemma":0.001774753,"domain_scores_codex":[0.9975716,0.0007063153,0.0001202094,0.000602188,0.0004587127,0.0005409814],"domain_scores_gemma":[0.9824507,0.01177113,0.002160348,0.001205696,0.0005980512,0.001814192],"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.000112844,0.00004691019,0.0006816588,0.00006842834,0.00001529078,0.0001844688,0.0005903537,0.002410361,0.001079612,0.9909641,0.0007975458,0.003048353],"study_design_scores_gemma":[0.00001835429,0.00001113845,0.0002900939,0.000033802,0.00001574317,0.0001437099,0.0002012594,0.005643733,0.00044547,0.9925264,0.0006546358,0.00001553655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7871278,0.001399859,0.125474,0.002789587,0.0001264505,0.00009336075,0.0008094843,0.0004353314,0.08174413],"genre_scores_gemma":[0.9644521,0.001028983,0.02108286,0.0004793066,0.000249933,0.0002624882,0.0006624509,0.0001592296,0.01162264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007719947,"threshold_uncertainty_score":0.02249169,"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","authors":[{"name":"Hong‐Jian Lai","is_ca":false},{"name":"Xiangwen Li","is_ca":true},{"name":"Hoifung Poon","is_ca":false},{"name":"Yongbin Ou","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004817338,0.0004946101,0.0005417141,0.001765916,0.002546793,0.002780687,0.001220767,0.001346155,0.01957422],"category_scores_gemma":[0.004313244,0.000648878,0.0005892953,0.002188191,0.0007890445,0.002944342,0.001902728,0.001383136,0.003272264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005745334,"about_ca_system_score_gemma":0.001053991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007700906,"about_ca_topic_score_gemma":0.00202092,"domain_scores_codex":[0.9994792,0.00006622466,0.00005306655,0.0001295013,0.0001215549,0.0001504994],"domain_scores_gemma":[0.9968703,0.0007576126,0.0004240593,0.0006555605,0.0007076169,0.0005847805],"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.001291922,0.0008840061,0.006963373,0.001188083,0.0001670788,0.002277456,0.001739517,0.01072739,0.03488735,0.7158625,0.02361571,0.2003956],"study_design_scores_gemma":[0.0002302513,0.0004682202,0.00404578,0.0006187321,0.0003337477,0.002154939,0.002246343,0.03932036,0.03694119,0.8266732,0.08688167,0.00008563171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6067004,0.0005015348,0.2484628,0.001329787,0.0009900621,0.0009024424,0.004205618,0.001327654,0.1355797],"genre_scores_gemma":[0.7302218,0.0008013498,0.1869033,0.0004853507,0.0001352839,0.0004442465,0.004043635,0.0002946416,0.07667042],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01957422,"threshold_uncertainty_score":0.06548232,"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","authors":[{"name":"Peter Bradshaw","is_ca":true},{"name":"Kevin Halasz","is_ca":false},{"name":"Ladislav Stacho","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272162,0.0004571904,0.0007758755,0.001524979,0.00256722,0.003053395,0.001371115,0.001510403,0.01180298],"category_scores_gemma":[0.004307072,0.000571139,0.0005988606,0.0009838111,0.004017379,0.01000929,0.003254641,0.002392559,0.000860637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00104993,"about_ca_system_score_gemma":0.0006181464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000822194,"about_ca_topic_score_gemma":0.001509057,"domain_scores_codex":[0.9994376,0.0001607006,0.0000266066,0.0001361786,0.0001352744,0.0001036437],"domain_scores_gemma":[0.9981376,0.0008311282,0.0001368459,0.0004167919,0.0002071568,0.0002705178],"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.0000173143,0.00001764461,0.0001966957,0.00004124802,0.00000434098,0.00007118222,0.0002124371,0.0004767147,0.0003939622,0.9918677,0.001508635,0.005192211],"study_design_scores_gemma":[0.000004542451,0.000003974219,0.00006186846,0.00001584114,0.000003942604,0.00007387227,0.0001198626,0.0009756103,0.000136579,0.9968542,0.001744461,0.000005153485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4962264,0.00384624,0.1539292,0.007523871,0.0009640781,0.00009794753,0.0004911662,0.0009989419,0.3359221],"genre_scores_gemma":[0.9440339,0.001313709,0.01948574,0.001004701,0.0003542389,0.00008922746,0.0002212543,0.0002499834,0.03324718],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01180298,"threshold_uncertainty_score":0.03948486,"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","authors":[{"name":"Bert L. Hartnell","is_ca":true},{"name":"Douglas F. Rall","is_ca":false},{"name":"Kirsti Wash","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001735961,0.001474022,0.00151488,0.004281136,0.002919922,0.004660252,0.001377978,0.001723318,0.01025301],"category_scores_gemma":[0.005873786,0.001679333,0.00133053,0.004987887,0.004921285,0.01504034,0.00576565,0.003758423,0.001417754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00153115,"about_ca_system_score_gemma":0.0005884058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001490345,"about_ca_topic_score_gemma":0.001544323,"domain_scores_codex":[0.9978393,0.0006045843,0.0001228705,0.000521322,0.0005598436,0.0003520162],"domain_scores_gemma":[0.9939779,0.003592253,0.0004821039,0.0006919749,0.0006805943,0.0005751228],"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.00004442987,0.00001795444,0.0003999169,0.00005274237,0.000009970925,0.0001251918,0.0007286766,0.0006389235,0.0004070351,0.9918002,0.001193539,0.004581355],"study_design_scores_gemma":[0.000008885096,0.00001310307,0.0002555642,0.0000204188,0.00001468147,0.0001912079,0.000181493,0.001427929,0.0002294138,0.9948717,0.002774937,0.00001074185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.629227,0.004034756,0.2337413,0.004133684,0.0004706552,0.00008645016,0.00106378,0.0005702059,0.1266721],"genre_scores_gemma":[0.9211456,0.0028819,0.0328311,0.0007622546,0.0005712361,0.000135289,0.001214011,0.0004427111,0.040016],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01025301,"threshold_uncertainty_score":0.03429973,"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","authors":[{"name":"David Avis","is_ca":true},{"name":"Duc A. Hoang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119953,0.0009098207,0.001244825,0.002106163,0.00242526,0.003139542,0.002338974,0.001728108,0.01257669],"category_scores_gemma":[0.007723469,0.0009986241,0.001580359,0.002667653,0.003673795,0.006597527,0.003032968,0.002528387,0.001084371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001945099,"about_ca_system_score_gemma":0.001039867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002167257,"about_ca_topic_score_gemma":0.001673136,"domain_scores_codex":[0.9985914,0.0003512214,0.00007872011,0.0003500414,0.0002882462,0.0003405137],"domain_scores_gemma":[0.9921179,0.003870064,0.001358644,0.001180071,0.0004835422,0.0009897405],"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.0003060293,0.00007462749,0.0009405408,0.0001268225,0.00003811803,0.0005042407,0.0007689666,0.02277576,0.004094389,0.9516808,0.002403146,0.01628645],"study_design_scores_gemma":[0.00004146544,0.00004948198,0.0008008566,0.00003637649,0.00004383718,0.0002362743,0.000428713,0.04272921,0.001494119,0.9517695,0.002342414,0.00002781263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6272988,0.0007884069,0.2833636,0.001960921,0.0003067976,0.0002328924,0.0007074078,0.001308689,0.08403248],"genre_scores_gemma":[0.9534243,0.0006661285,0.02875245,0.0003952312,0.0002033451,0.0001891844,0.0007805959,0.0003672258,0.01522148],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01257669,"threshold_uncertainty_score":0.04207325,"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","authors":[{"name":"Shenwei Huang","is_ca":true},{"name":"Liying Kang","is_ca":false},{"name":"Erfang Shan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009903224,0.0006806274,0.0009654845,0.002592593,0.004123548,0.004164984,0.00224593,0.001756528,0.009136864],"category_scores_gemma":[0.005401953,0.00112479,0.0007857285,0.00316438,0.003107764,0.006541137,0.003356695,0.002491967,0.0009811546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001303167,"about_ca_system_score_gemma":0.001167882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002444313,"about_ca_topic_score_gemma":0.004382778,"domain_scores_codex":[0.9987307,0.0002444146,0.0000636879,0.0003219247,0.0003061106,0.0003331922],"domain_scores_gemma":[0.9944901,0.003012057,0.0005649045,0.0005305661,0.0005399116,0.0008624016],"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.0002284037,0.0002042834,0.003379729,0.000199534,0.00005609029,0.0008396243,0.0017982,0.005277473,0.005656109,0.947198,0.004486552,0.0306761],"study_design_scores_gemma":[0.00005688039,0.00002586398,0.0007880352,0.00003866673,0.00004648232,0.0004526757,0.0005067569,0.009846571,0.00315268,0.9811888,0.003867031,0.00002953247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8259933,0.000557732,0.1024503,0.001424778,0.0001195918,0.0001334395,0.0004912287,0.0005125924,0.06831704],"genre_scores_gemma":[0.9639094,0.0002872629,0.01567185,0.000340898,0.0000799914,0.0001100529,0.0005915597,0.0001289046,0.01888008],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009136864,"threshold_uncertainty_score":0.0305658,"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)","authors":[{"name":"M. Ghebleh","is_ca":true},{"name":"Luis Goddyn","is_ca":true},{"name":"E. S. Mahmoodian","is_ca":false},{"name":"Maryam Verdian-Rizi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002004233,0.0008879649,0.0008012769,0.001463939,0.001833728,0.002894376,0.001380974,0.001254004,0.07871469],"category_scores_gemma":[0.001376084,0.0004724456,0.0007507377,0.001045418,0.001131786,0.003141025,0.003169531,0.002093753,0.02579732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000581854,"about_ca_system_score_gemma":0.0006302591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001153461,"about_ca_topic_score_gemma":0.001560648,"domain_scores_codex":[0.9994198,0.00006705986,0.00002548011,0.0001707815,0.0001966605,0.0001201308],"domain_scores_gemma":[0.9994044,0.00007766373,0.00004271023,0.0001759323,0.0001980846,0.0001012086],"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.0003296316,0.00008489956,0.0004012936,0.0001814041,0.00003179088,0.0003668792,0.0002283321,0.002894808,0.01187962,0.8013973,0.06402173,0.1181823],"study_design_scores_gemma":[0.00005954989,0.00008599851,0.0003491123,0.00007578969,0.00002926658,0.0007335775,0.0004209717,0.01629238,0.01237825,0.6698824,0.2996575,0.00003520903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03923187,0.0007642185,0.2439289,0.001592025,0.001810536,0.0002419684,0.001343348,0.002958891,0.7081283],"genre_scores_gemma":[0.3503048,0.0009679543,0.1649846,0.002196662,0.0004323709,0.0005243556,0.00356924,0.001802767,0.4752173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07871469,"threshold_uncertainty_score":0.2633269,"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","authors":[{"name":"Catherine Greenhill","is_ca":false},{"name":"Andrzej Ruciński","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007777191,0.001360316,0.00320171,0.004221379,0.002507098,0.008546856,0.004456642,0.004433086,0.008306511],"category_scores_gemma":[0.05376832,0.002223122,0.001808643,0.003729998,0.009772315,0.02043507,0.006121377,0.006598274,0.001061175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003359967,"about_ca_system_score_gemma":0.001555272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001912174,"about_ca_topic_score_gemma":0.001654459,"domain_scores_codex":[0.993084,0.00330819,0.0002812488,0.001184027,0.001347565,0.0007950036],"domain_scores_gemma":[0.9196189,0.06073185,0.005601459,0.006989722,0.002451719,0.004606391],"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.0000401051,0.00003308243,0.0003009486,0.00002914548,0.00001199801,0.00008322158,0.0001718842,0.005312333,0.0002195997,0.9920052,0.0005627095,0.00122983],"study_design_scores_gemma":[0.00003578803,0.00001085832,0.0001177039,0.00001593257,0.00001482526,0.00009646223,0.00007430332,0.04181742,0.0002173068,0.9569852,0.0005959432,0.00001825931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4171674,0.00185573,0.5224572,0.012039,0.0002714278,0.0002545021,0.001021501,0.0009262098,0.04400714],"genre_scores_gemma":[0.9554788,0.001643601,0.01978203,0.001009621,0.0008082833,0.0004456946,0.0003513674,0.0002328457,0.02024775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008546856,"threshold_uncertainty_score":0.04113019,"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","authors":[{"name":"Gregory Gutin","is_ca":false},{"name":"Anders Yeo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002371604,0.001079301,0.002013059,0.001460238,0.003121814,0.004552484,0.003047284,0.004428132,0.01468081],"category_scores_gemma":[0.02615755,0.001282296,0.002197598,0.002014878,0.00491796,0.01037818,0.003721969,0.006394752,0.001338415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002371765,"about_ca_system_score_gemma":0.001763212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002118292,"about_ca_topic_score_gemma":0.001926065,"domain_scores_codex":[0.9980702,0.0006685406,0.0001059199,0.0006242812,0.0002303953,0.000300776],"domain_scores_gemma":[0.9752398,0.01952475,0.001009689,0.00195474,0.001141282,0.00112972],"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.0004191042,0.000157823,0.001353681,0.0004776649,0.00009273079,0.0001952854,0.0007525072,0.02653708,0.0009948245,0.9326962,0.02341989,0.01290328],"study_design_scores_gemma":[0.00005722262,0.00002286475,0.000225358,0.00002987477,0.00001840029,0.00005272706,0.0001660447,0.02217224,0.000295566,0.9748668,0.002072902,0.00001996722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5816825,0.002686118,0.2419994,0.06419182,0.002948965,0.000197457,0.00379138,0.001008607,0.1014937],"genre_scores_gemma":[0.8975267,0.001286,0.0725867,0.003567208,0.002265614,0.0002830693,0.002781535,0.0004290693,0.01927406],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01468081,"threshold_uncertainty_score":0.0491122,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001453486,0.0006007124,0.001478767,0.002296889,0.003307115,0.003691476,0.001644755,0.002774404,0.02142367],"category_scores_gemma":[0.00978086,0.0008881201,0.00106429,0.002544513,0.002534483,0.007882041,0.003713136,0.003959377,0.00262699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001376756,"about_ca_system_score_gemma":0.0009314358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00130986,"about_ca_topic_score_gemma":0.001669121,"domain_scores_codex":[0.9986621,0.0002932046,0.0001288284,0.0004011778,0.0002306135,0.000284036],"domain_scores_gemma":[0.9948332,0.002970953,0.0003206568,0.0004888891,0.0007077843,0.0006784376],"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.0001062439,0.00003496839,0.0005597104,0.00006287405,0.000009346196,0.0001113399,0.0003346531,0.0006722802,0.001862396,0.9880184,0.003092064,0.00513575],"study_design_scores_gemma":[0.00004792138,0.00002447254,0.0003137759,0.00002667288,0.00001501346,0.0001579157,0.0002130182,0.004240254,0.00131513,0.9896532,0.003973677,0.00001906979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4587372,0.0009291836,0.3024422,0.006860966,0.0006420064,0.0002602305,0.003191548,0.001169268,0.2257674],"genre_scores_gemma":[0.942921,0.0004215537,0.02901713,0.001594332,0.0002827696,0.0003495686,0.001618782,0.0002799874,0.02351474],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02142367,"threshold_uncertainty_score":0.07166928,"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","authors":[{"name":"Rong Chen","is_ca":false},{"name":"Matthew DeVos","is_ca":true},{"name":"Daryl Funk","is_ca":true},{"name":"Irene Pivotto","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002313763,0.0008059577,0.0005152217,0.001957648,0.0007140576,0.003422797,0.001039534,0.001020126,0.0369757],"category_scores_gemma":[0.001240723,0.0003927334,0.00069543,0.0017811,0.0007712793,0.002332854,0.0009582553,0.001259295,0.004216359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006776904,"about_ca_system_score_gemma":0.0003657818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001274252,"about_ca_topic_score_gemma":0.001585891,"domain_scores_codex":[0.9997165,0.00007919614,0.00001555524,0.00005940377,0.00006424059,0.00006507226],"domain_scores_gemma":[0.9994803,0.0001441133,0.00009334339,0.00009671315,0.0001181737,0.00006741416],"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.00005242658,0.0000273894,0.0001041093,0.0000646885,0.000006169127,0.0001074618,0.0002943223,0.004082932,0.0017338,0.9638147,0.005925868,0.02378628],"study_design_scores_gemma":[0.00003281299,0.00003604194,0.0002034183,0.00006410517,0.00002207759,0.0001470179,0.0002695764,0.03685428,0.00135655,0.9178143,0.04317814,0.00002172398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06463175,0.0006898252,0.7828991,0.001536251,0.0003413447,0.0001874294,0.002707493,0.003122122,0.1438846],"genre_scores_gemma":[0.6888068,0.001310236,0.2498745,0.0006409705,0.0004135766,0.0005836097,0.00424179,0.0009432309,0.05318539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0369757,"threshold_uncertainty_score":0.1236961,"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","authors":[{"name":"Jean Cardinal","is_ca":false},{"name":"Erik D. Demaine","is_ca":false},{"name":"Martin L. Demaine","is_ca":false},{"name":"Shinji Imahori","is_ca":false},{"name":"Tsuyoshi Ito","is_ca":true},{"name":"Masashi Kiyomi","is_ca":false},{"name":"Stefan Langerman","is_ca":false},{"name":"Ryuhei Uehara","is_ca":false},{"name":"Takeaki Uno","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009179299,0.0008512756,0.001115701,0.001668399,0.001845353,0.004565108,0.001872316,0.001625129,0.02257713],"category_scores_gemma":[0.007413221,0.0006185804,0.001274156,0.002939975,0.002520497,0.009003705,0.003421403,0.004158074,0.002950435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002529501,"about_ca_system_score_gemma":0.001119546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001152707,"about_ca_topic_score_gemma":0.001262431,"domain_scores_codex":[0.9986227,0.0003084646,0.00007110826,0.0003930111,0.0004476036,0.0001572017],"domain_scores_gemma":[0.9955337,0.002454656,0.0001435837,0.001235894,0.0004399874,0.0001922227],"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.00003129682,0.00003220417,0.0004224108,0.00007663068,0.00001654083,0.00003730359,0.0001444354,0.005831056,0.0003799252,0.9526409,0.008810272,0.03157705],"study_design_scores_gemma":[0.000004043236,0.000003458396,0.00008448406,0.000009710391,0.000006286839,0.00003268075,0.00002747076,0.008928956,0.0002654972,0.9850277,0.005605922,0.000003887987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1192701,0.004075462,0.5843719,0.01030106,0.0006586992,0.0001567352,0.001568963,0.002174175,0.2774228],"genre_scores_gemma":[0.7737121,0.002688849,0.1395252,0.002157565,0.0009840636,0.0003421187,0.00332604,0.001125919,0.07613824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02257713,"threshold_uncertainty_score":0.07552803,"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","authors":[{"name":"Omer Angel","is_ca":true},{"name":"Igor Shinkar","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007245803,0.003497939,0.006582288,0.005552507,0.005022813,0.01243396,0.01235785,0.005661709,0.02603579],"category_scores_gemma":[0.07158722,0.003793663,0.003785035,0.008049802,0.005842702,0.03746986,0.008409084,0.0136671,0.00448624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005846362,"about_ca_system_score_gemma":0.003910172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007011942,"about_ca_topic_score_gemma":0.00615424,"domain_scores_codex":[0.9872519,0.00207737,0.0005367725,0.004207657,0.00279717,0.003129215],"domain_scores_gemma":[0.8742558,0.08889214,0.003857539,0.01800029,0.005200045,0.009794113],"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.002141235,0.001105365,0.006426974,0.001608884,0.0004788531,0.0007585189,0.003229963,0.1266474,0.02040623,0.7011934,0.0385516,0.09745166],"study_design_scores_gemma":[0.00008940831,0.0001642023,0.001565468,0.000164972,0.0002949758,0.000518647,0.0002834592,0.2402838,0.00496545,0.7402844,0.01127556,0.0001095723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1983246,0.01038936,0.6749588,0.01453521,0.0007884993,0.0003067836,0.005186457,0.006103227,0.08940702],"genre_scores_gemma":[0.8170845,0.00484665,0.1322534,0.003499174,0.002039533,0.0004016222,0.003208047,0.003582948,0.03308415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02603579,"threshold_uncertainty_score":0.08709836,"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","authors":[{"name":"P. Mark Kayll","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005251064,0.0009004458,0.001036506,0.001787149,0.003309732,0.003228236,0.001512613,0.001725328,0.009978699],"category_scores_gemma":[0.002349047,0.0007059624,0.0009278521,0.001721639,0.002793395,0.00535517,0.002091783,0.003135064,0.001900905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008751153,"about_ca_system_score_gemma":0.0005852947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001130534,"about_ca_topic_score_gemma":0.001838339,"domain_scores_codex":[0.9993543,0.0001214196,0.00004698624,0.0002071782,0.0001066111,0.0001635029],"domain_scores_gemma":[0.9978656,0.0005951351,0.0003036946,0.000556536,0.000424021,0.0002549519],"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.00005977831,0.00001807873,0.0004183236,0.00004655868,0.0000153529,0.0002480513,0.0002066064,0.0003633247,0.001209491,0.9879569,0.002003766,0.007453749],"study_design_scores_gemma":[0.00001517362,0.00001168069,0.0003917621,0.00002377172,0.00001966385,0.0004052459,0.0002616374,0.001473348,0.001199156,0.9862412,0.009942459,0.00001491585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5766516,0.001264669,0.1578432,0.00252321,0.0008858202,0.0001622645,0.001073387,0.0009312507,0.2586646],"genre_scores_gemma":[0.8751709,0.0008092899,0.0459955,0.0007469669,0.0001730587,0.0001345264,0.0008061686,0.0002789679,0.07588458],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009978699,"threshold_uncertainty_score":0.03338212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}